AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplus_le_totalAllocation_mul_winningVirtualValue

theoremverifiedformalizationimported Lean

BayesianSingleItemAuction.virtualSurplus_le_totalAllocation_mul_winningVirtualValue

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.virtualSurplus_le_totalAllocation_mul_winningVirtualValue
    [Fintype I] [Nontrivial I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) {x : (I → ℝ) → I → ℝ} {b : I → ℝ}
    (hx_nonneg : ∀ i, 0 ≤ x b i) :
    A.virtualSurplus x b ≤ (∑ i, x b i) * A.winningVirtualValue b
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplus_le_totalAllocation_mul_winningVirtualValue`
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 27
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.virtualSurplus_le_totalAllocation_mul_winningVirtualValue    [Fintype I] [Nontrivial I] [LinearOrder I]    (A : BayesianSingleItemAuction I) {x : (I → ℝ) → I → ℝ} {b : I → ℝ}    (hx_nonneg : ∀ i, 0 ≤ x b i) :    A.virtualSurplus x b ≤ (∑ i, x b i) * A.winningVirtualValue b := by  have hterm :      ∀ i, x b i * A.virtualValue i (b i) ≤ x b i * A.winningVirtualValue b := by    intro i    exact mul_le_mul_of_nonneg_left      (A.virtualSurplusMaximizingWinner_virtualValue_ge b i)      (hx_nonneg i)  calc    A.virtualSurplus x b = ∑ i, x b i * A.virtualValue i (b i) := rfl    _ ≤ ∑ i, x b i * A.winningVirtualValue b :=      Finset.sum_le_sum fun i _ => hterm i    _ = (∑ i, x b i) * A.winningVirtualValue b := by      rw [← Finset.sum_mul]
See it in the graphDiscuss this resultChallenge it