AFTD Auto-Formalizing Theoretical Domains

BayesianSingleItemAuction.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegrand_eq_onSupport

theoremverifiedformalizationimported Lean

BayesianSingleItemAuction.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegrand_eq_onSupport

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.envelopeIntegrand_eq_onSupport
    {A B : BayesianSingleItemAuction I}
    (h : A.EnvelopeVirtualSurplusAnalyticAssumptions B) (i : I) :
    Set.EqOn
      (fun v =>
        (B.interimAllocProb i v * v -
          ∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v)
      (fun v =>
        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)
      (Set.uIoc 0 (A.typeData.omega i))
Formalizes
EconCSLib, `BayesianSingleItemAuction.EnvelopeVirtualSurplusAnalyticAssumptions.envelopeIntegrand_eq_onSupport`
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 32
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.envelopeIntegrand_eq_onSupport    {A B : BayesianSingleItemAuction I}    (h : A.EnvelopeVirtualSurplusAnalyticAssumptions B) (i : I) :    Set.EqOn      (fun v =>        (B.interimAllocProb i v * v -          ∫ z in 0..v, B.interimAllocProb i z) * A.typeDensity i v)      (fun v =>        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)      (Set.uIoc 0 (A.typeData.omega i)) := by  intro v hv  have hv' : v ∈ Set.Ioc 0 (A.typeData.omega i) := by    simpa [Set.uIoc_of_le (A.typeData.cdf i).omega_nonneg] using hv  have h0 : 0 < v := hv'.1  have homega : v ≤ A.typeData.omega i := hv'.2  have homega_lt_or_eq : v < A.typeData.omega i ∨ v = A.typeData.omega i :=    lt_or_eq_of_le homega  rcases homega_lt_or_eq with homega_lt | rfl  · have hdens_ne :        A.typeDensity i v ≠ 0 :=      h.positive_density_on_support.nonzero_on_support A h0 homega_lt    simp [virtualValue, mul_sub, sub_mul, mul_assoc, div_eq_mul_inv, hdens_ne]  · have hFω : (A.typeData.cdf i).cdf (A.typeData.omega i) = 1 :=      (A.typeData.cdf i).cdf_upper    have hsurv_zero : 1 - (A.typeData.cdf i).cdf (A.typeData.omega i) = 0 := by      rw [hFω]      ring    simp [virtualValue, hsurv_zero, sub_mul]
See it in the graphDiscuss this resultChallenge it