AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
Used by 1

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it