indep iSup of finset
ProvedLevyStochCalc.Probability.indep_iSup_of_finsetcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Probability.indep_iSup_of_finset is extracted from LevyStochCalc.Probability.IndepJoin. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Mathlib.Probability.Independence.Basic
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# Independence of a join of σ-algebras
If `m₁` is independent of `m₃` and `m₂` is independent of `m₁ ⊔ m₃`, then `m₁ ⊔ m₂` is
independent of `m₃`. The join `m₁ ⊔ m₂` is generated by the π-system of intersections
`A ∩ B` with `A ∈ m₁`, `B ∈ m₂`, on which the product formula is a two-line computation.
Iterating that step along a monotone family `𝒢` gives `indep_iSup_lt_of_indep`: increments that
are measurable one step ahead and independent of the σ-algebra one step behind are *jointly*
independent of the initial σ-algebra.
-/
open MeasureTheory ProbabilityTheory
namespace LevyStochCalc.Probability
variable {Ω : Type*} {m₁ m₂ m₃ mΩ : MeasurableSpace Ω} {P : Measure Ω} [IsProbabilityMeasure P]
Formal statement
theorem _root_.LevyStochCalc.Probability.indep_iSup_of_finset {ι : Type*} {m : ι → MeasurableSpace Ω} {m' : MeasurableSpace Ω}
(h_le : ∀ i, m i ≤ mΩ) (h_le' : m' ≤ mΩ)
(h : ∀ S : Finset ι, Indep (⨆ i ∈ S, m i) m' P) :
Indep (⨆ i, m i) m' P := by sorry
Source