Lemma 2 — unchanged sub-Gaussian parameter under bin mixing
DisprovedChenGallegoPricing.ABE.lemma_2Let be a probability measure on a measurable space , let be measurable with , and let be a measurable family of real probability laws. Fix . Suppose each component with has a finite first moment and satisfies
with finite exponential moments. Let and assume its first moment is finite. The printed assertion is that
including existence of the finite exponential moments. No equal-component-means hypothesis is imposed. The price is fixed throughout and is suppressed from the notation. This is the source's assertion; insight I1 records its bounded counterexample.
Differences from the source:
- encoding: the displayed means and conditional distribution → finite first moments and conditioning on a positive-probability measurable event; a Markov kernel represents the family at the fixed price; reason: these are the domains where the source’s displayed expectations and conditioning are defined
- encoding: the bound exp(σt²) → Mathlib HasSubgaussianMGF for the centered variable with variance proxy 2σ, including integrability of every exponential; reason: Mathlib uses exp(c t²/2); this preserves σ exactly and avoids default-zero nonintegrable expectations
- generalization: a componentwise bound for given covariates in the model → arbitrary measurable mixing space and component hypotheses required only on B; reason: values outside the conditioning event have no effect; the original covariate-space claim is a specialization
import Mathlib open MeasureTheory ProbabilityTheory open scoped NNReal
namespace ChenGallegoPricing.ABE
theorem lemma_2 {X : Type*} [MeasurableSpace X]
(μ : Measure X) [IsProbabilityMeasure μ] (B : Set X)
(hB : MeasurableSet B) (hpos : μ B ≠ 0)
(κ : Kernel X ℝ) [IsMarkovKernel κ] (σ : ℝ≥0)
(hcomponents : ∀ x ∈ B, Integrable id (κ x) ∧
HasSubgaussianMGF (fun z => z - ∫ y, y ∂κ x) (2 * σ) (κ x))
(hmean : Integrable id (κ ∘ₘ ProbabilityTheory.cond μ B)) :
HasSubgaussianMGF
(fun z => z - ∫ y, y ∂(κ ∘ₘ ProbabilityTheory.cond μ B))
(2 * σ) (κ ∘ₘ ProbabilityTheory.cond μ B) := by sorry
end ChenGallegoPricing.ABE
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting.
- is any measurable space.
- is a probability measure on .
- is a measurable set with .
- is the conditional probability given .
- is a Markov kernel from to : each is a probability measure on , measurable in .
- is a real number.
- is the mixture probability measure on .
Hypotheses.
- For every :
- has a finite first moment, with mean ;
- the centred variable under is sub-Gaussian with variance proxy . That is, for every , is -integrable and
- has a finite first moment.
Conclusion. Let . For every , is -integrable and
In other words, the mixture, centred at its own mean, is sub-Gaussian with variance proxy , the same constant as the components. No hypothesis constrains the means to agree or to be close.
Degenerate cases.
- Mass zero. is excluded, so is nonempty and the conditioning involves no division by zero.
- . The hypothesis bounds each component's centred moment generating function by for all . The conclusion asserts the same bound for the mixture.
- . The mixture is taken against itself.
- One-point . The mixture is the single component , and the statement reduces to its own hypothesis.
- Points outside . Nothing is assumed about for . Such points carry zero conditional mass.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.