AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegral_eq_virtualSurplusIntegral

theoremverifiedformalizationimported Lean

BayesianSingleItemAuction.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegral_eq_virtualSurplusIntegral

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.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegral_eq_virtualSurplusIntegral
    {A B : BayesianSingleItemAuction I}
    (h : A.EnvelopeVirtualSurplusAnalyticAssumptions B) (i : I) :
    (∫ v in 0..A.typeData.omega i,
      (B.interimAllocProb i v * v -
        ∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v) =
      ∫ v in 0..A.typeData.omega i,
        B.interimAllocProb i v * A.virtualValue i v * A.typeDensity i v
Formalizes
EconCSLib, `BayesianSingleItemAuction.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegral_eq_virtualSurplusIntegral`
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 34
Used by 2

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.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegral_eq_virtualSurplusIntegral    {A B : BayesianSingleItemAuction I}    (h : A.EnvelopeVirtualSurplusAnalyticAssumptions B) (i : I) :    (∫ v in 0..A.typeData.omega i,      (B.interimAllocProb i v * v -        ∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v) =      ∫ v in 0..A.typeData.omega i,        B.interimAllocProb i v * A.virtualValue i v * A.typeDensity i v := by  have hsurv := h.survivalIntegral_eq_accumulatedDensity i  have hvirt_int := h.interim_virtual_surplus_integrable i  have hcongr :      (∫ v in 0..A.typeData.omega i,        (B.interimAllocProb i v * v -          ∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v) =        ∫ v in 0..A.typeData.omega i,          B.interimAllocProb i v * A.virtualValue i v * A.typeDensity i v +            B.interimAllocProb i v * (1 - (A.typeData.cdf i).cdf v) -              (∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v := by    refine intervalIntegral.integral_congr_ae ?_    filter_upwards with v hv    exact h.envelopeIntegrand_eq_onSupport i hv  have hderiv_int := h.accumulatedAllocation_density_integrable i  calc    (∫ v in 0..A.typeData.omega i,        (B.interimAllocProb i v * v -          ∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v)        = ∫ v in 0..A.typeData.omega i,            B.interimAllocProb i v * A.virtualValue i v * A.typeDensity i v +              B.interimAllocProb i v * (1 - (A.typeData.cdf i).cdf v) -                (∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v := hcongr    _ = (∫ v in 0..A.typeData.omega i,            B.interimAllocProb i v * A.virtualValue i v * A.typeDensity i v) -          (-(∫ v in 0..A.typeData.omega i,            B.interimAllocProb i v * (1 - (A.typeData.cdf i).cdf v))) -            ∫ v in 0..A.typeData.omega i,              (∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v := by          rw [intervalIntegral.integral_sub            (hvirt_int.add (h.interim_allocation_survival_integrable i)) hderiv_int,            intervalIntegral.integral_add hvirt_int (h.interim_allocation_survival_integrable i)]          ring    _ = ∫ v in 0..A.typeData.omega i,          B.interimAllocProb i v * A.virtualValue i v * A.typeDensity i v := by          rw [hsurv]          ring
See it in the graphDiscuss this resultChallenge it