AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplus_le_virtualSurplusMaximizingAllocationRule

theoremverifiedformalizationimported Lean

Pointwise virtual-surplus maximality.

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.virtualSurplus_le_virtualSurplusMaximizingAllocationRule
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) {x : (I → ℝ) → I → ℝ} {b : I → ℝ}
    (hx_nonneg : ∀ i, 0 ≤ x b i)
    (hx_capacity : (∑ i, x b i) ≤ 1) :
    A.virtualSurplus x b ≤
    A.virtualSurplus A.virtualSurplusMaximizingAllocationRule b
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplus_le_virtualSurplusMaximizingAllocationRule`
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 30
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/-- Pointwise virtual-surplus maximality. -/theorem BayesianSingleItemAuction.virtualSurplus_le_virtualSurplusMaximizingAllocationRule    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) {x : (I → ℝ) → I → ℝ} {b : I → ℝ}    (hx_nonneg : ∀ i, 0 ≤ x b i)    (hx_capacity : (∑ i, x b i) ≤ 1) :    A.virtualSurplus x b ≤    A.virtualSurplus A.virtualSurplusMaximizingAllocationRule b := by  by_cases hpos : 0 < A.winningVirtualValue b  · have hle := A.virtualSurplus_le_winningVirtualValue hx_nonneg hx_capacity (le_of_lt hpos)    simpa [A.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_of_pos b hpos] using hle  · have hle := A.virtualSurplus_nonpos_of_winningVirtualValue_nonpos hx_nonneg (le_of_not_gt hpos)    simpa [A.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos b hpos]      using hle
See it in the graphDiscuss this resultChallenge it