indep
ProvedLevyStochCalc.Probability.IsTrivialSigma.indepcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Probability.IsTrivialSigma.indep is extracted from LevyStochCalc.Probability.TrivialSigma. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Probability_TrivialSigma_F000
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# σ-algebras whose sets are null or conull
A sub-σ-algebra each of whose sets has measure `0` or `1` is independent of every other
sub-σ-algebra, and a σ-algebra generated by an almost-surely constant random variable is of that
kind. Together they let such a factor be dropped from an independence statement.
## Main statements
* `IsTrivialSigma` — the predicate.
* `IsTrivialSigma.indep` — a trivial σ-algebra is independent of everything.
* `isTrivialSigma_comap_of_ae_const` — the σ-algebra of an a.s. constant random variable.
* `IsTrivialSigma.indep_sup` — a trivial factor drops out of an independence statement.
* `trivialSigma` — the σ-algebra of measurable null-or-conull sets, which absorbs a whole family
of trivial factors at once.
-/
open MeasureTheory ProbabilityTheory
namespace LevyStochCalc.Probability
variable {Ω : Type*} {mΩ : MeasurableSpace Ω} {P : Measure Ω}
Formal statement
theorem _root_.LevyStochCalc.Probability.IsTrivialSigma.indep [IsProbabilityMeasure P] {m m' : MeasurableSpace Ω}
(hm : m ≤ mΩ) (h : IsTrivialSigma P m) : Indep m m' P := by sorry
Source