indep iSup lt of indep
ProvedLevyStochCalc.Probability.indep_iSup_lt_of_indepcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Probability.indep_iSup_lt_of_indep 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_lt_of_indep {𝒢 m : ℕ → MeasurableSpace Ω} (hmono : Monotone 𝒢)
(h𝒢 : ∀ k, 𝒢 k ≤ mΩ) (hm : ∀ k, m k ≤ mΩ) (hle : ∀ k, m k ≤ 𝒢 (k + 1))
(hindep : ∀ k, Indep (𝒢 k) (m k) P) (n : ℕ) :
Indep (⨆ k, ⨆ _ : k < n, m k) (𝒢 0) P := by sorry
Source