Auction.ReserveSecondPrice.mechanism_payment_of_allocation_ne_some
theoremverifiedformalizationimported Lean
A bidder who is not allocated the item pays zero.
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 {reserve : U} {v : I → U} in omit [IsOrderedAddMonoid U] in lemma Auction.ReserveSecondPrice.mechanism_payment_of_allocation_ne_some {reserve : U} {b : I → U} {i : I} (halloc : allocation reserve b ≠ some i) : (mechanism reserve).paymentRule b i = 0
- Formalizes
- EconCSLib, `Auction.ReserveSecondPrice.mechanism_payment_of_allocation_ne_some`
- 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.ReserveSecondPrice.mechanism_payment_of_allocation_ne_some← Auction.ReserveSecondPrice.mechanism_payment_of_allocation_ne_some (EconCSLib/MechanismDesign/Auction/ReserveVickrey.lean:313): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- Auction.ReserveSecondPrice.mechanismThe reserve second-price auction as a
MechanismWithTransfers. Agents report bids inU. The allocation isnonewhen the reserve is… - Auction.ReserveSecondPrice.allocationThe item is sold exactly when the winning bid meets the reserve.
- MechanismWithTransfersA mechanism with monetary transfers. -
I— agents -T— report/type space of each agent -A— allocation space -P— payment space… - Auction.ReserveSecondPrice.clearingPriceThe price paid by the winner: the maximum of the reserve and the second price.
- Auction.ReserveSecondPrice.mechanism_allocationRuleAuction.ReserveSecondPrice.mechanism_allocationRule
- Auction.ReserveSecondPrice.mechanism_paymentRuleAuction.ReserveSecondPrice.mechanism_paymentRule
- Auction.ReserveSecondPrice.mechanismThe reserve second-price auction as a
- Used by 1
- Auction.ReserveSecondPrice.mechanism_payment_eq_zero_of_allocation_eq_noneIf the item is withheld, every bidder pays zero.
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] [DecidableEq I] invariable {U : Type*} [AddCommGroup U] [LinearOrder U] [IsOrderedAddMonoid U] invariable {reserve : U} {v : I → U} inomit [IsOrderedAddMonoid U] in/-- A bidder who is not allocated the item pays zero. -/lemma Auction.ReserveSecondPrice.mechanism_payment_of_allocation_ne_some {reserve : U} {b : I → U} {i : I} (halloc : allocation reserve b ≠ some i) : (mechanism reserve).paymentRule b i = 0 := by rw [mechanism_paymentRule, if_neg halloc]