Auction.FirstPrice.utility_winner
theoremverifiedformalizationimported Lean
If i is the winner, utility is v i − b i.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I : Type*} [Fintype I] [Nontrivial I] [DecidableEq I] in variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in variable {v : I → U} in omit [IsOrderedAddMonoid U] in lemma Auction.FirstPrice.utility_winner {b : I → U} {i : I} (h : i = winner b) : utility v b i = v i - b i
- Formalizes
- EconCSLib, `Auction.FirstPrice.utility_winner`
- 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.FirstPrice.utility_winner← Auction.FirstPrice.utility_winner (EconCSLib/MechanismDesign/Auction/FirstPrice.lean:86): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Auction.FirstPrice.winnerThe winner of the first-price auction: the bidder with the highest bid. Uses
Auction.argmaxBidfrom… - Auction.FirstPrice.utilityUtility of bidder
iin a first-price auction: winner getsv i − b i(pays own bid), losers get0.
- Auction.FirstPrice.winnerThe winner of the first-price auction: the bidder with the highest bid. Uses
- Used by 1
- Auction.FirstPrice.no_dominant_strategyNo dominant strategy exists in first-price auctions. For any bidder
iand any bidbi, there exists a profile where biddingbiis…
- Auction.FirstPrice.no_dominant_strategyNo dominant strategy exists in first-price auctions. For any bidder
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {I : Type*} [Fintype I] [Nontrivial I] [DecidableEq I] in variable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] in variable {v : I → U} in omit [IsOrderedAddMonoid U] in /-- If `i` is the winner, utility is `v i − b i`. -/ lemma Auction.FirstPrice.utility_winner {b : I → U} {i : I} (h : i = winner b) : utility v b i = v i - b i := if_pos h