SingleParameterMechanism.payment_difference_bound
theoremverifiedformalizationimported Lean
If two payment rules implement the same allocation rule in DSIC form, then their difference along a one-dimensional deviation is controlled by the change in the allocation rule. This is the comparison estimate used in the proof of the Myerson payment identity.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open SingleParameterMechanism in variable {I : Type*} in theorem SingleParameterMechanism.payment_difference_bound [DecidableEq I] {x p q : (I → ℝ) → I → ℝ} (hpdsic : ({ allocationRule := x, paymentRule := p } : SingleParameterMechanism I ℝ).IsDSIC) (hqdsic : ({ allocationRule := x, paymentRule := q } : SingleParameterMechanism I ℝ).IsDSIC) (b : I → ℝ) (i : I) (y z : ℝ) : |(p (Function.update b i y) i - q (Function.update b i y) i) - (p (Function.update b i z) i - q (Function.update b i z) i)| ≤ (y - z) * (x (Function.update b i y) i - x (Function.update b i z) i)
- Formalizes
- EconCSLib, `SingleParameterMechanism.payment_difference_bound`
- 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.SingleParameterMechanism.payment_difference_bound← SingleParameterMechanism.payment_difference_bound (EconCSLib/MechanismDesign/Auction/Myerson.lean:144): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- SingleParameterMechanism.IsDSICDominant-strategy incentive compatibility in the single-parameter, quasi-linear setting. Truthful reporting
θᵢis weakly dominant for… - SingleParameterMechanism.payment_sandwichFor a DSIC single-parameter mechanism, fixing all other bids yields the standard two-sided bound on payment differences.
- SingleParameterMechanismA single-parameter mechanism. Each agent
ihas a single private typeθ_i : R(their "value per unit"). The allocation gives each agent… - MechanismWithTransfersA mechanism with monetary transfers. -
I— agents -T— report/type space of each agent -A— allocation space -P— payment space… - EconCSLib.StrategicGame.Profile.deviate_selfDeviating to the same strategy is the identity.
- EconCSLib.StrategicGame.Profile.deviate_sameAt the deviated player, the updated profile returns the new strategy.
- EconCSLib.StrategicGame.Profile.deviate_of_neAt every other player, the updated profile is unchanged.
- SingleParameterMechanism.IsDSICDominant-strategy incentive compatibility in the single-parameter, quasi-linear setting. Truthful reporting
- Used by 1
- SingleParameterMechanism.payment_formula_of_isDSIC_of_zeroNormalizedExplicit payment identity used in Myerson's Lemma: for a DSIC single-parameter mechanism with zero-normalized payments, the payment rule…
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 inopen SingleParameterMechanism invariable {I : Type*} in/-- If two payment rules implement the same allocation rule in DSIC form, then their difference along a one-dimensional deviation is controlled by the change in the allocation rule. This is the comparison estimate used in the proof of the Myerson payment identity. -/theorem SingleParameterMechanism.payment_difference_bound [DecidableEq I] {x p q : (I → ℝ) → I → ℝ} (hpdsic : ({ allocationRule := x, paymentRule := p } : SingleParameterMechanism I ℝ).IsDSIC) (hqdsic : ({ allocationRule := x, paymentRule := q } : SingleParameterMechanism I ℝ).IsDSIC) (b : I → ℝ) (i : I) (y z : ℝ) : |(p (Function.update b i y) i - q (Function.update b i y) i) - (p (Function.update b i z) i - q (Function.update b i z) i)| ≤ (y - z) * (x (Function.update b i y) i - x (Function.update b i z) i) := by obtain ⟨hp₁, hp₂⟩ := payment_sandwich hpdsic b i y z obtain ⟨hq₁, hq₂⟩ := payment_sandwich hqdsic b i y z rw [abs_le] constructor <;> linarith