AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_isMonotone_of_isRegular

theoremverifiedformalizationimported Lean

Under regularity, the deterministic virtual-surplus-maximizing allocation rule is monotone in the sense required by SingleParameterMechanism.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open BayesianSingleItemAuction in
open scoped BigOperators in
open MeasureTheory in
variable {I : Type*} in
theorem BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_isMonotone_of_isRegular
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (hA : A.IsRegular) :
    SingleParameterMechanism.IsMonotone
      ({ allocationRule := A.virtualSurplusMaximizingAllocationRule
         paymentRule := A.virtualSurplusMaximizingPaymentRule } :
        SingleParameterMechanism I ℝ)
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_isMonotone_of_isRegular`
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 38
Used by 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen BayesianSingleItemAuction inopen scoped BigOperators inopen MeasureTheory invariable {I : Type*} in/-- Under regularity, the deterministic virtual-surplus-maximizing allocation rule is monotone in the sense required by `SingleParameterMechanism`. -/theorem BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_isMonotone_of_isRegular    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (hA : A.IsRegular) :    SingleParameterMechanism.IsMonotone      ({ allocationRule := A.virtualSurplusMaximizingAllocationRule         paymentRule := A.virtualSurplusMaximizingPaymentRule } :        SingleParameterMechanism I ℝ) := by  classical  intro i r s hrs b  change    A.virtualSurplusMaximizingAllocationRule (Function.update b i r) i ≤      A.virtualSurplusMaximizingAllocationRule (Function.update b i s) i  by_cases hwin_lo :      A.virtualSurplusMaximizingWinner (Function.update b i r) = i  · have hwin_hi :        A.virtualSurplusMaximizingWinner (Function.update b i s) = i :=      A.virtualSurplusMaximizingWinner_update_self_of_winner hA b i hrs hwin_lo    by_cases hpos_lo : 0 < A.virtualValue i r    · have hpos_hi : 0 < A.virtualValue i s := lt_of_lt_of_le hpos_lo (hA i hrs)      have hpos_lo' :          0 < A.winningVirtualValue (Function.update b i r) :=        (A.winningVirtualValue_update_self_pos_iff_of_winner b i r hwin_lo).2 hpos_lo      have hpos_hi' :          0 < A.winningVirtualValue (Function.update b i s) :=        (A.winningVirtualValue_update_self_pos_iff_of_winner b i s hwin_hi).2 hpos_hi      rw [A.virtualSurplusMaximizingAllocationRule_eq_one_of_winner_of_winning_pos hwin_lo          hpos_lo',        A.virtualSurplusMaximizingAllocationRule_eq_one_of_winner_of_winning_pos hwin_hi          hpos_hi']    · have hnotpos_lo :          ¬ 0 < A.winningVirtualValue (Function.update b i r) :=        mt (A.winningVirtualValue_update_self_pos_iff_of_winner b i r hwin_lo).1 hpos_lo      rw [A.virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos        (Function.update b i r) hnotpos_lo]      exact A.virtualSurplusMaximizingAllocationRule_nonneg (Function.update b i s) i  · have hi_ne : i ≠ A.virtualSurplusMaximizingWinner (Function.update b i r) :=      fun hi => hwin_lo hi.symm    rw [A.virtualSurplusMaximizingAllocationRule_eq_zero_of_ne_winner hi_ne]    exact A.virtualSurplusMaximizingAllocationRule_nonneg (Function.update b i s) i
See it in the graphDiscuss this resultChallenge it