Product Measure Variance Decomposition
ProvedFunctionalInequalities.ProductVariance.decomposition_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concave
This is the law of total variance for a product probability measure.
Let and be probability measures on measurable spaces and , and let belong to . Then
The explicit MemLp f 2 assumption supplies the iterated integrability needed for the ordinary integral formulation.
Original Lean declaration header
Within namespace FunctionalInequalities.ProductVariance. Shown in its original module context. Proof omitted.
theorem decomposition (hf : MemLp f 2 (μ.prod ν)) :
variance f (μ.prod ν) =
(∫ x, variance (fun y ↦ f (x, y)) ν ∂μ) +
variance (fun x ↦ ∫ y, f (x, y) ∂ν) μ
Module navigation
Module: Probability/ProductVariance.
Source excerpt, lines 104–107 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_ProductVariance
open MeasureTheory ProbabilityTheory
variable {E F : Type*} [MeasurableSpace E] [MeasurableSpace F]
{μ : MeasureTheory.Measure E} {ν : MeasureTheory.Measure F} [MeasureTheory.IsProbabilityMeasure μ] [MeasureTheory.IsProbabilityMeasure ν]
{f : E × F → ℝ}
Formal statement
theorem FunctionalInequalities.ProductVariance.decomposition_readable (hf : MemLp f 2 (μ.prod ν)) :
variance f (μ.prod ν) =
(∫ x, variance (fun y ↦ f (x, y)) ν ∂μ) +
variance (fun x ↦ ∫ y, f (x, y) ∂ν) μ := by sorry
Source
Lean source: https://github.com/human-ai-mathematics/kls-lean/blob/408915f/formalization/FunctionalInequalities/Probability/ProductVariance.lean#L101-L124 (repository human-ai-mathematics/kls-lean, commit 408915f, module `FunctionalInequalities.Probability.ProductVariance`, declaration `FunctionalInequalities.ProductVariance.decomposition`; the repository is private at upload time).