Auction.maxBidExcluding_update_self
theoremverifiedformalizationimported Lean
Changing i's bid does not affect the highest bid among the others.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I : Type*} [Fintype I] [Nontrivial I] {V : Type*} [LinearOrder V] in variable (b : I → V) in variable [DecidableEq I] in lemma Auction.maxBidExcluding_update_self (i : I) (bi : V) : maxBidExcluding (Function.update b i bi) i = maxBidExcluding b i
- Formalizes
- EconCSLib, `Auction.maxBidExcluding_update_self`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.Auction.maxBidExcluding_update_self← Auction.maxBidExcluding_update_self (EconCSLib/MechanismDesign/Auction/AuctionBasic.lean:257): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Auction.maxBidExcludingThe highest bid excluding bidder
i.
- Auction.maxBidExcludingThe highest bid excluding bidder
- Used by 3
- Auction.SecondPrice.valuation_is_dominantVickrey's Theorem (core form): Truthful bidding dominates any other bid. For any bid profile
b, replacingi's bid withv idoes… - Auction.ReserveSecondPrice.valuation_is_dominantTruthful bidding dominates any other bid in the reserve second-price auction.
- Auction.ReserveSecondPrice.bid_le_clearing_threshold_of_not_allocation_update_selfAuction.ReserveSecondPrice.bid_le_clearing_threshold_of_not_allocation_update_self
- Auction.SecondPrice.valuation_is_dominantVickrey's Theorem (core form): Truthful bidding dominates any other bid. For any bid profile
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {I : Type*} [Fintype I] [Nontrivial I] {V : Type*} [LinearOrder V] invariable (b : I → V) invariable [DecidableEq I] in/-- Changing `i`'s bid does not affect the highest bid among the others. -/lemma Auction.maxBidExcluding_update_self (i : I) (bi : V) : maxBidExcluding (Function.update b i bi) i = maxBidExcluding b i := by apply Finset.sup'_congr _ rfl intro j hj simp [Function.update_of_ne (Finset.ne_of_mem_erase hj)]