AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.expectedVirtualSurplus_le_virtualSurplusMaximizingAuction_allocationRule

theoremverifiedformalizationimported Lean

The allocation rule of the constructed Bayesian auction is ex-ante virtual-surplus optimal under the same explicit integrability assumptions.

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.expectedVirtualSurplus_le_virtualSurplusMaximizingAuction_allocationRule
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) {x : (I → ℝ) → I → ℝ}
    (hx : IsSingleItemAllocationRule x)
    (hx_int : A.IntegrableVirtualSurplus x)
    (hopt_int : A.IntegrableVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule) :
    A.expectedVirtualSurplus x ≤
      A.expectedVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule
Formalizes
EconCSLib, `BayesianSingleItemAuction.expectedVirtualSurplus_le_virtualSurplusMaximizingAuction_allocationRule`
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 31
Used by 3

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/-- The allocation rule of the constructed Bayesian auction is ex-ante virtual-surplus optimal under the same explicit integrability assumptions. -/theorem BayesianSingleItemAuction.expectedVirtualSurplus_le_virtualSurplusMaximizingAuction_allocationRule    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) {x : (I → ℝ) → I → ℝ}    (hx : IsSingleItemAllocationRule x)    (hx_int : A.IntegrableVirtualSurplus x)    (hopt_int : A.IntegrableVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule) :    A.expectedVirtualSurplus x ≤      A.expectedVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule := by  simpa [virtualSurplusMaximizingAuction, virtualSurplusMaximizingMechanism] using    A.expectedVirtualSurplus_le_virtualSurplusMaximizingAllocationRule      (x := x) hx hx_int hopt_int
See it in the graphDiscuss this resultChallenge it