Auction.bid_le_maxBid
theoremverifiedformalizationimported Lean
Every bid is at most the argmax bidder's bid.
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 lemma Auction.bid_le_maxBid (j : I) : b j ≤ b (argmaxBid b)
- Formalizes
- EconCSLib, `Auction.bid_le_maxBid`
- 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.bid_le_maxBid← Auction.bid_le_maxBid (EconCSLib/MechanismDesign/Auction/AuctionBasic.lean:220): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- Auction.argmaxBidThe bidder whose bid achieves the maximum. This is a mathematical argmax, not a declaration that any auction's winner is the highest…
- Auction.argmaxBid_eq_maxBidThe argmax bidder's bid equals the highest bid.
- Auction.maxBidThe highest bid in a profile.
- Used by 6
- BayesianSingleItemAuction.virtualSurplusMaximizingWinner_eq_iff_forall_virtualScore_leThe selected winner is exactly the bidder whose lexicographic virtual score dominates every other bidder's score.
- BayesianSingleItemAuction.virtualSurplusMaximizingWinner_update_self_of_winnerBayesianSingleItemAuction.virtualSurplusMaximizingWinner_update_self_of_winner
- Auction.SecondPrice.bid_le_bid_winnerAuction.SecondPrice.bid_le_bid_winner
- Auction.ReserveSecondPrice.bid_le_clearing_threshold_of_not_allocation_update_selfAuction.ReserveSecondPrice.bid_le_clearing_threshold_of_not_allocation_update_self
- BayesianSingleItemAuction.virtualSurplusMaximizingWinner_virtualValue_geThe selected winner has maximal virtual value.
- Auction.eq_argmaxBid_of_strict_maxIf
istrictly outbids all others, theniis the argmax bidder.
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) in/-- Every bid is at most the argmax bidder's bid. -/lemma Auction.bid_le_maxBid (j : I) : b j ≤ b (argmaxBid b) := by rw [argmaxBid_eq_maxBid b] exact Finset.le_sup' b (Finset.mem_univ j)