Mathlib Map

Theorems · Definition · probability

MeasureTheory.Filtration.rightCont

{Ω : Type u_3} →
  {ι : Type u_4} →
    {m : MeasurableSpace Ω} → [inst : PartialOrder ι] → MeasureTheory.Filtration ι m → MeasureTheory.Filtration ι m

Given a filtration 𝓕, its right continuation is the filtration 𝓕₊ defined as follows: - If i is isolated on the right, then 𝓕₊ i := 𝓕 i; - Otherwise, 𝓕₊ i := ⨅ j > i, 𝓕 j. It is sometimes simply defined as 𝓕₊ i := ⨅ j > i, 𝓕 j when the index type is . In the general case this is not ideal however. If i is maximal for instance, then 𝓕₊ i = ⊤, which is inconvenient because 𝓕₊ is not a Filtration ι m anymore. If the index type is discrete (such as ), then we would have 𝓕 = 𝓕₊ (i.e. 𝓕 is right-continuous) only if 𝓕 is constant. To avoid requiring a TopologicalSpace instance on ι in the definition, we endow ι with the order topology Preorder.topology inside the definition. Say you write a statement about 𝓕₊ which does not require a TopologicalSpace structure on ι, but you wish to use a statement which requires a topology (such as rightCont_apply). Then you can endow ι with the order topology by writing ``lean letI := Preorder.topology ι haveI : OrderTopology ι := ⟨rfl⟩ ``

Defined in
Mathlib.Probability.Process.Filtration
Cited by
14 results in Mathlib
Foundations
Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
PartialOrder

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by16

Results whose statement or proof uses this declaration.