AFTD Auto-Formalizing Theoretical Domains

SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone

theoremverifiedformalizationimported Lean

Myerson Lemma, Property 2: a monotone allocation rule is DSIC when paired with the canonical Myerson payment rule.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open SingleParameterMechanism in
variable {I : Type*} in
theorem SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone [DecidableEq I]
    {x : (I → ℝ) → I → ℝ}
    (hx : IsMonotone ({ allocationRule := x, paymentRule := myersonPayment x } :
      SingleParameterMechanism I ℝ)) :
    (withMyersonPayment x).IsDSIC
Formalizes
EconCSLib, `SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone`
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.
What was changed in SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone
--- EconCSLib/MechanismDesign/Auction/Myerson.lean:162 (SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone)
+++ as compiled here
@@ -1,5 +1,6 @@
-/-- Myerson Lemma, Property 2:
-a monotone allocation rule is DSIC when paired with the canonical Myerson
-payment rule. -/
-theorem withMyersonPayment_isDSIC_of_isMonotone [DecidableEq I]
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open SingleParameterMechanism in
+variable {I : Type*} in
+theorem SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone [DecidableEq I]
     {x : (I → ℝ) → I → ℝ}
@@ -58,3 +59,3 @@
         simpa [add_comm, add_left_comm, add_assoc] using
-          add_le_add_left hbracket (∫ z in 0..v i, g z)
+          add_le_add_right hbracket (∫ z in 0..v i, g z)
       _ = ∫ z in 0..v i, g z := by simp
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 15
Used by 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen SingleParameterMechanism invariable {I : Type*} in/-- Myerson Lemma, Property 2: a monotone allocation rule is DSIC when paired with the canonical Myerson payment rule. -/theorem SingleParameterMechanism.withMyersonPayment_isDSIC_of_isMonotone [DecidableEq I]    {x : (I → ℝ) → I → ℝ}    (hx : IsMonotone ({ allocationRule := x, paymentRule := myersonPayment x } :      SingleParameterMechanism I ℝ)) :    (withMyersonPayment x).IsDSIC := by  intro v i (s' : ℝ) (reports : I → ℝ)  let g : ℝ → ℝ := fun z => x (Function.update reports i z) i  have hgmono : Monotone g := by    intro z₁ z₂ hz    exact hx i z₁ z₂ hz reports  have hform : ∀ r : ℝ,      (withMyersonPayment x).quasiLinearUtility (Function.update reports i r) v i =        (v i - r) * g r + ∫ z in 0..r, g z := by    intro r    rw [withMyersonPayment_quasiLinearUtility_eq]    simp [g, Function.update_idem]  change    (withMyersonPayment x).quasiLinearUtility (Function.update reports i s') v i ≤      (withMyersonPayment x).quasiLinearUtility (Function.update reports i (v i)) v i  by_cases hs : s' ≤ v i  · have hg0s : IntervalIntegrable g MeasureTheory.volume 0 s' := hgmono.intervalIntegrable    have hgsv : IntervalIntegrable g MeasureTheory.volume s' (v i) := hgmono.intervalIntegrable    have hmonoInt :        (v i - s') * g s' ≤ ∫ z in s'..v i, g z := by      simpa using        intervalIntegral.integral_mono_on hs intervalIntegrable_const hgsv          (fun z hz => hgmono hz.1)    calc      (withMyersonPayment x).quasiLinearUtility (Function.update reports i s') v i          = (v i - s') * g s' + ∫ z in 0..s', g z := hform s'      _ ≤ (∫ z in s'..v i, g z) + ∫ z in 0..s', g z := by        exact add_le_add hmonoInt le_rfl      _ = ∫ z in 0..v i, g z := by        simpa [add_comm] using intervalIntegral.integral_add_adjacent_intervals hg0s hgsv      _ = (withMyersonPayment x).quasiLinearUtility (Function.update reports i (v i)) v i := by        rw [hform (v i)]        ring  · have hvs : v i ≤ s' := le_of_not_ge hs    have hg0v : IntervalIntegrable g MeasureTheory.volume 0 (v i) := hgmono.intervalIntegrable    have hgvs : IntervalIntegrable g MeasureTheory.volume (v i) s' := hgmono.intervalIntegrable    have hbracket : (v i - s') * g s' + ∫ z in v i..s', g z ≤ 0 := by      have hmonoInt : ∫ z in v i..s', g z ≤ (s' - v i) * g s' := by        simpa using          intervalIntegral.integral_mono_on hvs hgvs intervalIntegrable_const            (fun z hz => hgmono hz.2)      nlinarith    calc      (withMyersonPayment x).quasiLinearUtility (Function.update reports i s') v i          = (v i - s') * g s' + ∫ z in 0..s', g z := hform s'      _ = (v i - s') * g s' + ((∫ z in 0..v i, g z) + ∫ z in v i..s', g z) := by        rw [← intervalIntegral.integral_add_adjacent_intervals hg0v hgvs]      _ = (∫ z in 0..v i, g z) + ((v i - s') * g s' + ∫ z in v i..s', g z) := by        ring      _ ≤ ∫ z in 0..v i, g z + 0 := by        simpa [add_comm, add_left_comm, add_assoc] using          add_le_add_right hbracket (∫ z in 0..v i, g z)      _ = ∫ z in 0..v i, g z := by simp      _ = (withMyersonPayment x).quasiLinearUtility (Function.update reports i (v i)) v i := by        rw [hform (v i)]        ring
See it in the graphDiscuss this resultChallenge it