AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_respectsSingleItemCapacity

theoremverifiedformalizationimported Lean

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_respectsSingleItemCapacity

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
lemma BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_respectsSingleItemCapacity
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) :
    (∑ i, A.virtualSurplusMaximizingAllocationRule b i) ≤ 1
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_respectsSingleItemCapacity`
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 28
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*} inlemma BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_respectsSingleItemCapacity    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (b : I → ℝ) :    (∑ i, A.virtualSurplusMaximizingAllocationRule b i) ≤ 1 := by  classical  by_cases hpos : 0 < A.winningVirtualValue b  · rw [A.virtualSurplusMaximizingAllocationRule_eq_winnerIndicator_of_pos b hpos]    simp [Finset.sum_ite_eq', Finset.mem_univ]  · rw [A.virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos b hpos]    simp
See it in the graphDiscuss this resultChallenge it