AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.expectedSellerRevenueInEnvironment_le_virtualSurplusMaximizingAuction_of_revenueUpperBounded

theoremverifiedformalizationimported Lean

BayesianSingleItemAuction.expectedSellerRevenueInEnvironment_le_virtualSurplusMaximizingAuction_of_revenueUpperBounded

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.expectedSellerRevenueInEnvironment_le_virtualSurplusMaximizingAuction_of_revenueUpperBounded
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A B : BayesianSingleItemAuction I)
    (hB : A.IsRevenueUpperBounded B)
    (hopt_int :
      A.IntegrableVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule)
    (hopt_id :
      A.HasExpectedRevenueVirtualSurplusIdentity A.virtualSurplusMaximizingAuction) :
    A.expectedSellerRevenueInEnvironment B ≤
      A.expectedSellerRevenueInEnvironment A.virtualSurplusMaximizingAuction
Formalizes
EconCSLib, `BayesianSingleItemAuction.expectedSellerRevenueInEnvironment_le_virtualSurplusMaximizingAuction_of_revenueUpperBounded`
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 39
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*} intheorem BayesianSingleItemAuction.expectedSellerRevenueInEnvironment_le_virtualSurplusMaximizingAuction_of_revenueUpperBounded    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A B : BayesianSingleItemAuction I)    (hB : A.IsRevenueUpperBounded B)    (hopt_int :      A.IntegrableVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule)    (hopt_id :      A.HasExpectedRevenueVirtualSurplusIdentity A.virtualSurplusMaximizingAuction) :    A.expectedSellerRevenueInEnvironment B ≤      A.expectedSellerRevenueInEnvironment A.virtualSurplusMaximizingAuction := by  rcases hB with ⟨_henv, hfeas, hint, hupper⟩  calc    A.expectedSellerRevenueInEnvironment B        ≤ A.expectedVirtualSurplus B.allocationRule := hupper    _ ≤ A.expectedVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule :=        A.expectedVirtualSurplus_le_virtualSurplusMaximizingAuction_allocationRule          (x := B.allocationRule) hfeas.isSingleItemAllocationRule hint hopt_int    _ = A.expectedSellerRevenueInEnvironment A.virtualSurplusMaximizingAuction := by        exact hopt_id.symm
See it in the graphDiscuss this resultChallenge it