AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_one_iff

theoremverifiedformalizationimported Lean

Allocation probability 1 characterizes the positive virtual-value winner.

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.virtualSurplusMaximizingAllocationRule_eq_one_iff
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) (b : I → ℝ) (i : I) :
    A.virtualSurplusMaximizingAllocationRule b i = 1 ↔
      0 < A.winningVirtualValue b ∧ i = A.virtualSurplusMaximizingWinner b
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_one_iff`
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 29
Used by 1

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/-- Allocation probability `1` characterizes the positive virtual-value winner. -/theorem BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_one_iff    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) (b : I → ℝ) (i : I) :    A.virtualSurplusMaximizingAllocationRule b i = 1 ↔      0 < A.winningVirtualValue b ∧ i = A.virtualSurplusMaximizingWinner b := by  constructor  · intro hi    by_cases hpos : 0 < A.winningVirtualValue b    · refine ⟨hpos, ?_⟩      by_contra hne      have hzero : A.virtualSurplusMaximizingAllocationRule b i = 0 :=        A.virtualSurplusMaximizingAllocationRule_eq_zero_of_ne_winner hne      exact zero_ne_one (hzero.symm.trans hi)    · have hzero : A.virtualSurplusMaximizingAllocationRule b i = 0 := by        simpa using          congr_fun (A.virtualSurplusMaximizingAllocationRule_eq_zero_of_not_pos b hpos) i      exact False.elim (zero_ne_one (by rw [← hzero, hi]))  · rintro ⟨hpos, hi⟩    exact A.virtualSurplusMaximizingAllocationRule_eq_one_of_winner_of_winning_pos      hi.symm hpos
See it in the graphDiscuss this resultChallenge it