AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.virtualSurplusMaximizingAuction_hasIntegrableInterimObjects_of_aestronglyMeasurable

theoremverifiedformalizationimported Lean

Once the constructed allocation and payment integrands are measurable, boundedness gives interim integrability for the constructed auction.

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_hasIntegrableInterimObjects_of_aestronglyMeasurable
    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]
    (A : BayesianSingleItemAuction I)
    (halloc_meas :
      ∀ i z_i,
        AEStronglyMeasurable
          (fun t =>
            A.virtualSurplusMaximizingAuction.interimAllocationIntegrand i z_i t)
          (A.opponentPrior i))
    (hpay_meas :
      ∀ i z_i,
        AEStronglyMeasurable
          (fun t =>
            A.virtualSurplusMaximizingAuction.interimPaymentIntegrand i z_i t)
          (A.opponentPrior i)) :
    A.virtualSurplusMaximizingAuction.HasIntegrableInterimObjects
Formalizes
EconCSLib, `BayesianSingleItemAuction.virtualSurplusMaximizingAuction_hasIntegrableInterimObjects_of_aestronglyMeasurable`
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 41

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/-- Once the constructed allocation and payment integrands are measurable, boundedness gives interim integrability for the constructed auction. -/theorem BayesianSingleItemAuction.virtualSurplusMaximizingAuction_hasIntegrableInterimObjects_of_aestronglyMeasurable    [Fintype I] [Nontrivial I] [DecidableEq I] [LinearOrder I]    (A : BayesianSingleItemAuction I)    (halloc_meas :      ∀ i z_i,        AEStronglyMeasurable          (fun t =>            A.virtualSurplusMaximizingAuction.interimAllocationIntegrand i z_i t)          (A.opponentPrior i))    (hpay_meas :      ∀ i z_i,        AEStronglyMeasurable          (fun t =>            A.virtualSurplusMaximizingAuction.interimPaymentIntegrand i z_i t)          (A.opponentPrior i)) :    A.virtualSurplusMaximizingAuction.HasIntegrableInterimObjects :=  A.virtualSurplusMaximizingAuction    |>.hasIntegrableInterimObjects_of_aestronglyMeasurable_of_bound      (by simpa [virtualSurplusMaximizingAuction_opponentPrior] using halloc_meas)      (by simpa [virtualSurplusMaximizingAuction_opponentPrior] using hpay_meas)      (by        intro i z_i        refine ⟨1, Filter.Eventually.of_forall ?_⟩        intro t        have hx :=          A.virtualSurplusMaximizingAuction_isFeasible.1 (reportProfile i z_i t) i        have hnonneg :            0 ≤              A.virtualSurplusMaximizingAuction.interimAllocationIntegrand i z_i t := by          simpa [interimAllocationIntegrand] using hx.1        have hle :            A.virtualSurplusMaximizingAuction.interimAllocationIntegrand i z_i t ≤ 1 := by          simpa [interimAllocationIntegrand] using hx.2        rw [Real.norm_eq_abs, abs_of_nonneg hnonneg]        exact hle)      (by        intro i z_i        exact ⟨2 * ‖z_i‖,          A.virtualSurplusMaximizingAuction_interimPaymentIntegrand_bound i z_i⟩)
See it in the graphDiscuss this resultChallenge it