AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.winningVirtualValue_nonpos_iff_forall_virtualValue_nonpos

theoremverifiedformalizationimported Lean

The winning virtual value is nonpositive iff all virtual values are.

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.winningVirtualValue_nonpos_iff_forall_virtualValue_nonpos
    [Fintype I] [Nontrivial I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) :
    A.winningVirtualValue b ≤ 0 ↔ ∀ i, A.virtualValue i (b i) ≤ 0
Formalizes
EconCSLib, `BayesianSingleItemAuction.winningVirtualValue_nonpos_iff_forall_virtualValue_nonpos`
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 3

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 winning virtual value is nonpositive iff all virtual values are. -/theorem BayesianSingleItemAuction.winningVirtualValue_nonpos_iff_forall_virtualValue_nonpos    [Fintype I] [Nontrivial I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (b : I → ℝ) :    A.winningVirtualValue b ≤ 0 ↔ ∀ i, A.virtualValue i (b i) ≤ 0 := by  constructor  · intro hwin i    exact le_trans (A.virtualSurplusMaximizingWinner_virtualValue_ge b i) hwin  · intro h    simpa [winningVirtualValue] using h (A.virtualSurplusMaximizingWinner b)
See it in the graphDiscuss this resultChallenge it