Contractable Factorization: Product Convergence and Kernel Independence #
This file completes the disjoint-block averaging argument from Kallenberg's "first proof"
of de Finetti's theorem. Building on BlockAverage.lean (which defines block averages and
establishes their L¹ convergence), this file proves:
Main results #
product_blockAvg_L1_convergence: Product of block averages converges L¹ to product of CEs.measure_map_reindexBlock_eq_of_contractable: Contractability implies path-space measure invariance under block reindexing (via π-λ theorem).condexp_product_factorization_contractable: For contractable measures,CE[∏ fᵢ(ωᵢ) | mSI] = ∏ CE[fᵢ(ω₀) | mSI]a.e.
Mathematical context #
The proof proceeds as follows:
L¹ convergence of products: Using the telescoping bound and individual L¹ convergence of block averages (from
BlockAverage.lean), we show that products of block averages converge to products of conditional expectations.Measure invariance from contractability: The π-λ theorem upgrades finite-dimensional contractability to full path-space measure invariance under block reindexing.
CE product factorization: Combining L¹ convergence with measure invariance and uniqueness of conditional expectation yields the key factorization result.
References #
- Kallenberg (2005), Probabilistic Symmetries and Invariance Principles, Chapter 1
Product L¹ Convergence via Telescoping #
Telescoping bound for product differences with general bound C.
Extends abs_prod_sub_prod_le (which requires bound 1) to general bounds via normalization.
For functions bounded by C > 0:
|∏ A - ∏ B| ≤ C^{m-1} * ∑ |A_i - B_i|
This is derived from abs_prod_sub_prod_le by dividing by C.
Telescoping bound for product differences.
|∏ Aᵢ - ∏ Bᵢ| ≤ m * C^{m-1} * max |Aᵢ - Bᵢ|
when |Aᵢ|, |Bᵢ| ≤ C for all i.
Note: When m = 0, both products are 1, so the LHS is 0 and the RHS is 0. For m > 0, we use Finset.univ.sup' with nonemptiness.
Product of block averages converges L¹ to product of conditional expectations.
∫ |∏ blockAvg_i - ∏ CE[fᵢ(ω₀) | mSI]| dμ → 0 as n → ∞
Proof uses telescoping bound and individual L¹ convergence of each blockAvg_i.
Path-Space Measure Invariance from Contractability #
The key insight (Kallenberg's first proof): finite-dimensional contractability upgrades to full path-space measure invariance via the π-λ theorem. This avoids the need for "conditional contractability" or disintegration.
Finite-dimensional contractability upgrades to path-space measure invariance.
Given contractability (finite marginals on {k(0), ..., k(m-1)} equal marginals on {0, ..., m-1}),
we show that the pushforward under reindexing by any strictly monotone ρ equals the original
measure. This is the π-λ argument: finite marginal equality → full measure equality.
Set integral equality from measure invariance and set invariance.
If the measure is invariant under reindexing (μ = μ ∘ reindexBlock⁻¹) and the set is invariant under reindexing (s = reindexBlock⁻¹(s)), then ∫_s f ∘ reindexBlock = ∫_s f.
This is the key lemma that replaces "conditional contractability".
Kernel Independence from Contractability #
The main result: for contractable measures, the product factorization of conditional expectations holds almost surely, giving kernel independence.
For contractable measures, product of CEs equals CE of product.
CE[∏ fᵢ(ωᵢ) | mSI] = ∏ CE[fᵢ(ω₀) | mSI] a.e.
This is the key factorization that yields conditional i.i.d.
Bridge to CommonEnding #
The bridge lemma indicator_product_bridge_contractable would connect the CE-based
factorization in this file to the ConditionallyIID definition required by
CommonEnding.conditional_iid_from_directing_measure.
The key insight is:
- For injective k, sort to get StrictMono ρ with permutation σ such that k = ρ ∘ σ
- Apply contractability to get integral equality
- Use CE factorization and the ν ↔ CE relationship
This bridge is needed to complete the sorry at line 178 of TheoremViaKoopman.lean,
which proves Contractable μ X → Exchangeable μ X ∧ ConditionallyIID μ X.
Status: Incomplete. The path-space proof in ViaKoopman.lean is complete;
the original-space bridge requires additional work to match the ConditionallyIID
definition's bind-based formula.