AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingWinner_virtualValue_ge

theoremverifiedformalizationimported Lean

The selected winner has maximal 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.virtualSurplusMaximizingWinner_virtualValue_ge
    [Fintype I] [Nontrivial I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) (i : I) :
    A.virtualValue i (b i) ≤ A.winningVirtualValue b
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingWinner_virtualValue_ge`
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 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 selected winner has maximal virtual value. -/theorem BayesianSingleItemAuction.virtualSurplusMaximizingWinner_virtualValue_ge    [Fintype I] [Nontrivial I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (b : I → ℝ) (i : I) :    A.virtualValue i (b i) ≤ A.winningVirtualValue b := by  have hscore :      A.virtualScore b i ≤ A.virtualScore b (A.virtualSurplusMaximizingWinner b) := by    simpa [virtualSurplusMaximizingWinner] using Auction.bid_le_maxBid (A.virtualScore b) i  rw [virtualScore, virtualScore, Prod.Lex.toLex_le_toLex] at hscore  rcases hscore with hlt | ⟨heq, _⟩  · exact le_of_lt hlt  · exact le_of_eq heq
See it in the graphDiscuss this resultChallenge it