AFTD Auto-Formalizing Theoretical Domains

SingleParameterMechanism.payment_sandwich

theoremverifiedformalizationimported Lean

For a DSIC single-parameter mechanism, fixing all other bids yields the standard two-sided bound on payment differences.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SingleParameterMechanism in
variable {I : Type*} in
theorem SingleParameterMechanism.payment_sandwich [DecidableEq I]
    {x p : (I → ℝ) → I → ℝ}
    (hdsic : ({ allocationRule := x, paymentRule := p } :
      SingleParameterMechanism I ℝ).IsDSIC)
    (b : I → ℝ) (i : I) (y z : ℝ) :
    z * (x (Function.update b i y) i - x (Function.update b i z) i) ≤
      p (Function.update b i y) i - p (Function.update b i z) i ∧
    p (Function.update b i y) i - p (Function.update b i z) i ≤
      y * (x (Function.update b i y) i - x (Function.update b i z) i)
Formalizes
EconCSLib, `SingleParameterMechanism.payment_sandwich`
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 12
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen SingleParameterMechanism invariable {I : Type*} in/-- For a DSIC single-parameter mechanism, fixing all other bids yields the standard two-sided bound on payment differences. -/theorem SingleParameterMechanism.payment_sandwich [DecidableEq I]    {x p : (I → ℝ) → I → ℝ}    (hdsic : ({ allocationRule := x, paymentRule := p } :      SingleParameterMechanism I ℝ).IsDSIC)    (b : I → ℝ) (i : I) (y z : ℝ) :    z * (x (Function.update b i y) i - x (Function.update b i z) i) ≤      p (Function.update b i y) i - p (Function.update b i z) i ∧    p (Function.update b i y) i - p (Function.update b i z) i ≤      y * (x (Function.update b i y) i - x (Function.update b i z) i) := by  let vy : I → ℝ := Function.update b i y  have h1 : y * x (Function.update b i z) i - p (Function.update b i z) i ≤      y * x (Function.update b i y) i - p (Function.update b i y) i := by    have := hdsic vy i z b    simpa [SingleParameterMechanism.IsDSIC, MechanismWithTransfers.isDSIC,      MechanismWithTransfers.toStrategicGame, IsWeaklyDominant, WeaklyDominates,      SingleParameterMechanism.payment, vy]      using this  let vz : I → ℝ := Function.update b i z  have h2 : z * x (Function.update b i y) i - p (Function.update b i y) i ≤      z * x (Function.update b i z) i - p (Function.update b i z) i := by    have := hdsic vz i y b    simpa [SingleParameterMechanism.IsDSIC, MechanismWithTransfers.isDSIC,      MechanismWithTransfers.toStrategicGame, IsWeaklyDominant, WeaklyDominates,      SingleParameterMechanism.payment, vz]      using this  constructor <;> linarith
See it in the graphDiscuss this resultChallenge it