AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_zero_iff_forall_virtualValue_nonpos

theoremverifiedformalizationimported Lean

Withholding is equivalent to all virtual values being nonpositive.

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_zero_iff_forall_virtualValue_nonpos
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I) {b : I → ℝ} :
    (A.virtualSurplusMaximizingAllocationRule b = fun _ => (0 : ℝ)) ↔
      ∀ i, A.virtualValue i (b i) ≤ 0
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_zero_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 30
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/-- Withholding is equivalent to all virtual values being nonpositive. -/theorem BayesianSingleItemAuction.virtualSurplusMaximizingAllocationRule_eq_zero_iff_forall_virtualValue_nonpos    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I) {b : I → ℝ} :    (A.virtualSurplusMaximizingAllocationRule b = fun _ => (0 : ℝ)) ↔      ∀ i, A.virtualValue i (b i) ≤ 0 := by  constructor  · intro hzero    apply (A.winningVirtualValue_nonpos_iff_forall_virtualValue_nonpos b).mp    by_contra hnot    have hpos : 0 < A.winningVirtualValue b := lt_of_not_ge hnot    have hone :        A.virtualSurplusMaximizingAllocationRule b (A.virtualSurplusMaximizingWinner b) = 1 :=      A.virtualSurplusMaximizingAllocationRule_winner_eq_one_of_winningVirtualValue_pos b hpos    have hzero_at :        A.virtualSurplusMaximizingAllocationRule b (A.virtualSurplusMaximizingWinner b) = 0 := by      simpa using congr_fun hzero (A.virtualSurplusMaximizingWinner b)    exact one_ne_zero (hone.symm.trans hzero_at)  · exact A.virtualSurplusMaximizingAllocationRule_eq_zero_of_forall_virtualValue_nonpos
See it in the graphDiscuss this resultChallenge it