AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAuction_isExpectedSellerRevenueOptimalInEnvironmentAmongRevenueUpperBounded

theoremverifiedformalizationimported Lean

Revenue optimality under the one-sided revenue upper bound.

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.virtualSurplusMaximizingAuction_isExpectedSellerRevenueOptimalInEnvironmentAmongRevenueUpperBounded
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I)
    (hopt_int :
      A.IntegrableVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule)
    (hopt_id :
      A.HasExpectedRevenueVirtualSurplusIdentity A.virtualSurplusMaximizingAuction) :
    A.IsExpectedSellerRevenueOptimalInEnvironmentAmong
      A.virtualSurplusMaximizingAuction
      (fun B => A.IsRevenueUpperBounded B)
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAuction_isExpectedSellerRevenueOptimalInEnvironmentAmongRevenueUpperBounded`
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 36

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/-- Revenue optimality under the one-sided revenue upper bound. -/theorem BayesianSingleItemAuction.virtualSurplusMaximizingAuction_isExpectedSellerRevenueOptimalInEnvironmentAmongRevenueUpperBounded    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I)    (hopt_int :      A.IntegrableVirtualSurplus (A.virtualSurplusMaximizingAuction).allocationRule)    (hopt_id :      A.HasExpectedRevenueVirtualSurplusIdentity A.virtualSurplusMaximizingAuction) :    A.IsExpectedSellerRevenueOptimalInEnvironmentAmong      A.virtualSurplusMaximizingAuction      (fun B => A.IsRevenueUpperBounded B) := by  constructor  · exact A.virtualSurplusMaximizingAuction_isRevenueUpperBounded hopt_int hopt_id  · intro B hB    exact      A.expectedSellerRevenueInEnvironment_le_virtualSurplusMaximizingAuction_of_revenueUpperBounded        B hB hopt_int hopt_id
See it in the graphDiscuss this resultChallenge it