Theorems · Definition · probability
MeasureTheory.IsPredictable
Deprecated since 2026-04-24Use MeasureTheory.IsStronglyPredictable instead.
{Ω : Type u_1} →
{ι : Type u_2} →
{m : MeasurableSpace Ω} →
{E : Type u_3} →
[TopologicalSpace E] → [inst : Preorder ι] → [OrderBot ι] → MeasureTheory.Filtration ι m → (ι → Ω → E) → PropAlias of MeasureTheory.IsStronglyPredictable.
A process is said to be predictable if it is measurable with respect to the predictable
σ-algebra.
- Defined in
- Mathlib.Probability.Process.Predictable
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- TopologicalSpacestatement · cited by 24,529
- MeasurableSpacestatement · cited by 13,106
- Preorderstatement · cited by 7,952
- OrderBotstatement · cited by 1,055
- MeasureTheory.Filtrationstatement · cited by 425
- MeasureTheory.IsStronglyPredictableproof · cited by 17
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.