AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos

theoremverifiedformalizationimported Lean

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos

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_eq_zero_of_not_pos
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ)
    (hnotpos : ¬ 0 < A.winningVirtualValue b) :
    A.virtualSurplusMaximizingAllocationRule b = fun _ => (0 : ℝ)
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos`
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 26
Used by 8

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_eq_zero_of_not_pos    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (b : I → ℝ)    (hnotpos : ¬ 0 < A.winningVirtualValue b) :    A.virtualSurplusMaximizingAllocationRule b = fun _ => (0 : ℝ) := by  funext i  simp [virtualSurplusMaximizingAllocationRule, hnotpos]
See it in the graphDiscuss this resultChallenge it