AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_max_winningVirtualValue_zero

theoremverifiedformalizationimported Lean

The constructed virtual surplus is the positive part of the winning virtual value.

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_virtualSurplusMaximizingAllocationRule_eq_max_winningVirtualValue_zero
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) :
    A.virtualSurplus A.virtualSurplusMaximizingAllocationRule b =
      max (A.winningVirtualValue b) 0
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_max_winningVirtualValue_zero`
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

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 constructed virtual surplus is the positive part of the winning virtual value. -/theorem BayesianSingleItemAuction.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_max_winningVirtualValue_zero    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (b : I → ℝ) :    A.virtualSurplus A.virtualSurplusMaximizingAllocationRule b =      max (A.winningVirtualValue b) 0 := by  by_cases hpos : 0 < A.winningVirtualValue b  · have hnonneg : 0 ≤ A.winningVirtualValue b := le_of_lt hpos    rw [A.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_of_pos b hpos,      max_eq_left hnonneg]  · have hnonpos : A.winningVirtualValue b ≤ 0 := le_of_not_gt hpos    rw [A.virtualSurplus_virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos b hpos,      max_eq_right hnonpos]
See it in the graphDiscuss this resultChallenge it