Loogle!
Result
Found 462 declarations mentioning MeasureTheory.Filtration. Of these, only the first 200 are shown.
- MeasureTheory.Filtration 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} (ι : Type u_2) [Preorder ι] (m : MeasurableSpace Ω) : Type (max u_1 u_2) - MeasureTheory.Filtration.instBot 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : Bot (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instCompleteLattice 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : CompleteLattice (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instInfSet 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : InfSet (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instInhabited 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : Inhabited (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instLE 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : LE (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instMax 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : Max (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instMin 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : Min (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instPartialOrder 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : PartialOrder (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instSupSet 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : SupSet (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.instTop 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : Top (MeasureTheory.Filtration ι m) - MeasureTheory.Filtration.IsRightContinuous 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] (𝓕 : MeasureTheory.Filtration ι m) : Prop - MeasureTheory.Filtration.seq 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} [Preorder ι] {m : MeasurableSpace Ω} (self : MeasureTheory.Filtration ι m) : ι → MeasurableSpace Ω - MeasureTheory.SigmaFiniteFiltration 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (μ : MeasureTheory.Measure Ω) (f : MeasureTheory.Filtration ι m) : Prop - MeasureTheory.Filtration.piLE 📋 Mathlib.Probability.Process.Filtration
{ι : Type u_2} [Preorder ι] {X : ι → Type u_4} [(i : ι) → MeasurableSpace (X i)] : MeasureTheory.Filtration ι MeasurableSpace.pi - MeasureTheory.filtrationOfSet 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {s : ι → Set Ω} (hsm : ∀ (i : ι), MeasurableSet (s i)) : MeasureTheory.Filtration ι m - MeasureTheory.instCoeFunFiltrationForallMeasurableSpace 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] : CoeFun (MeasureTheory.Filtration ι m) fun x => ι → MeasurableSpace Ω - MeasureTheory.Filtration.const 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} (ι : Type u_2) {m : MeasurableSpace Ω} [Preorder ι] (m' : MeasurableSpace Ω) (hm' : m' ≤ m) : MeasureTheory.Filtration ι m - MeasureTheory.Filtration.rightCont 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_3} {ι : Type u_4} {m : MeasurableSpace Ω} [PartialOrder ι] (𝓕 : MeasureTheory.Filtration ι m) : MeasureTheory.Filtration ι m - MeasureTheory.Filtration.piFinset 📋 Mathlib.Probability.Process.Filtration
{ι : Type u_4} {X : ι → Type u_5} [(i : ι) → MeasurableSpace (X i)] : MeasureTheory.Filtration (Finset ι) MeasurableSpace.pi - MeasureTheory.Filtration.cylinderEventsCompl 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {m : MeasurableSpace Ω} {α : Type u_4} : MeasureTheory.Filtration (Finset α)ᵒᵈ MeasurableSpace.pi - MeasureTheory.Filtration.instIsRightContinuousRightCont 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] {𝓕 : MeasureTheory.Filtration ι m} : 𝓕.rightCont.IsRightContinuous - MeasureTheory.Filtration.limitProcess 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {E : Type u_4} [Zero E] [TopologicalSpace E] (f : ι → Ω → E) (ℱ : MeasureTheory.Filtration ι m) (μ : MeasureTheory.Measure Ω) : Ω → E - MeasureTheory.Filtration.le 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (f : MeasureTheory.Filtration ι m) (i : ι) : ↑f i ≤ m - MeasureTheory.Filtration.le' 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} [Preorder ι] {m : MeasurableSpace Ω} (self : MeasureTheory.Filtration ι m) (i : ι) : ↑self i ≤ m - MeasureTheory.IsFiniteMeasure.sigmaFiniteFiltration 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (μ : MeasureTheory.Measure Ω) (f : MeasureTheory.Filtration ι m) [MeasureTheory.IsFiniteMeasure μ] : MeasureTheory.SigmaFiniteFiltration μ f - MeasureTheory.Filtration.mono' 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} [Preorder ι] {m : MeasurableSpace Ω} (self : MeasureTheory.Filtration ι m) : Monotone ↑self - MeasureTheory.measurableSet_of_filtration 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {s : Set Ω} {i : ι} (hs : MeasurableSet s) : MeasurableSet s - MeasureTheory.Filtration.mk 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} [Preorder ι] {m : MeasurableSpace Ω} (seq : ι → MeasurableSpace Ω) (mono' : Monotone seq) (le' : ∀ (i : ι), seq i ≤ m) : MeasureTheory.Filtration ι m - MeasureTheory.Filtration.IsRightContinuous.eq 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] {𝓕 : MeasureTheory.Filtration ι m} [h : 𝓕.IsRightContinuous] : 𝓕.rightCont = 𝓕 - MeasureTheory.Filtration.le_rightCont 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] (𝓕 : MeasureTheory.Filtration ι m) : 𝓕 ≤ 𝓕.rightCont - MeasureTheory.Filtration.rightCont_self 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] (𝓕 : MeasureTheory.Filtration ι m) : 𝓕.rightCont.rightCont = 𝓕.rightCont - MeasureTheory.Filtration.stronglyMeasurable_limit_process' 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {E : Type u_4} [Zero E] [TopologicalSpace E] {ℱ : MeasureTheory.Filtration ι m} {f : ι → Ω → E} {μ : MeasureTheory.Measure Ω} : MeasureTheory.StronglyMeasurable (MeasureTheory.Filtration.limitProcess f ℱ μ) - MeasureTheory.Filtration.mono 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {i j : ι} (f : MeasureTheory.Filtration ι m) (hij : i ≤ j) : ↑f i ≤ ↑f j - MeasureTheory.Filtration.ext 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f g : MeasureTheory.Filtration ι m} (h : ↑f = ↑g) : f = g - MeasureTheory.Filtration.ext_iff 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f g : MeasureTheory.Filtration ι m} : f = g ↔ ↑f = ↑g - MeasureTheory.Filtration.IsRightContinuous.RC 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} {inst✝ : PartialOrder ι} {𝓕 : MeasureTheory.Filtration ι m} [self : 𝓕.IsRightContinuous] : 𝓕.rightCont ≤ 𝓕 - MeasureTheory.Filtration.IsRightContinuous.mk 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] {𝓕 : MeasureTheory.Filtration ι m} (RC : 𝓕.rightCont ≤ 𝓕) : 𝓕.IsRightContinuous - MeasureTheory.Filtration.rightCont_eq_of_isMax 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] (𝓕 : MeasureTheory.Filtration ι m) {i : ι} (hi : IsMax i) : ↑𝓕.rightCont i = ↑𝓕 i - MeasureTheory.sigmaFinite_of_sigmaFiniteFiltration 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (μ : MeasureTheory.Measure Ω) (f : MeasureTheory.Filtration ι m) [hf : MeasureTheory.SigmaFiniteFiltration μ f] (i : ι) : MeasureTheory.SigmaFinite (μ.trim ⋯) - MeasureTheory.Filtration.natural 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] [∀ (i : ι), TopologicalSpace.MetrizableSpace (β i)] [mβ : (i : ι) → MeasurableSpace (β i)] [∀ (i : ι), BorelSpace (β i)] [Preorder ι] (u : (i : ι) → Ω → β i) (hum : ∀ (i : ι), MeasureTheory.StronglyMeasurable (u i)) : MeasureTheory.Filtration ι m - MeasureTheory.SigmaFiniteFiltration.SigmaFinite 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} {inst✝ : Preorder ι} {μ : MeasureTheory.Measure Ω} {f : MeasureTheory.Filtration ι m} [self : MeasureTheory.SigmaFiniteFiltration μ f] (i : ι) : MeasureTheory.SigmaFinite (μ.trim ⋯) - MeasureTheory.SigmaFiniteFiltration.mk 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {μ : MeasureTheory.Measure Ω} {f : MeasureTheory.Filtration ι m} (SigmaFinite : ∀ (i : ι), MeasureTheory.SigmaFinite (μ.trim ⋯)) : MeasureTheory.SigmaFiniteFiltration μ f - MeasureTheory.Filtration.IsRightContinuous.measurableSet 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] {𝓕 : MeasureTheory.Filtration ι m} [𝓕.IsRightContinuous] {i : ι} {s : Set Ω} (hs : MeasurableSet s) : MeasurableSet s - MeasureTheory.Filtration.stronglyMeasurable_limitProcess 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {E : Type u_4} [Zero E] [TopologicalSpace E] {ℱ : MeasureTheory.Filtration ι m} {f : ι → Ω → E} {μ : MeasureTheory.Measure Ω} : MeasureTheory.StronglyMeasurable (MeasureTheory.Filtration.limitProcess f ℱ μ) - MeasureTheory.Filtration.rightCont_eq_self 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [LinearOrder ι] [SuccOrder ι] (𝓕 : MeasureTheory.Filtration ι m) : 𝓕.rightCont = 𝓕 - MeasureTheory.Filtration.rightCont_eq_of_nhdsGT_eq_bot 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] [TopologicalSpace ι] [OrderTopology ι] (𝓕 : MeasureTheory.Filtration ι m) {i : ι} (hi : nhdsWithin i (Set.Ioi i) = ⊥) : ↑𝓕.rightCont i = ↑𝓕 i - MeasureTheory.Filtration.sSup_def 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (s : Set (MeasureTheory.Filtration ι m)) (i : ι) : ↑(sSup s) i = sSup ((fun f => ↑f i) '' s) - MeasureTheory.Filtration.coeFn_inf 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f g : MeasureTheory.Filtration ι m} : ↑(f ⊓ g) = ↑f ⊓ ↑g - MeasureTheory.Filtration.coeFn_sup 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f g : MeasureTheory.Filtration ι m} : ↑(f ⊔ g) = ↑f ⊔ ↑g - MeasureTheory.Integrable.uniformIntegrable_condExp_filtration 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {μ : MeasureTheory.Measure Ω} [MeasureTheory.IsFiniteMeasure μ] {f : MeasureTheory.Filtration ι m} {g : Ω → ℝ} (hg : MeasureTheory.Integrable g μ) : MeasureTheory.UniformIntegrable (fun i => μ[g | ↑f i]) 1 μ - MeasureTheory.Filtration.sInf_def 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (s : Set (MeasureTheory.Filtration ι m)) (i : ι) : ↑(sInf s) i = if s.Nonempty then sInf ((fun f => ↑f i) '' s) else m - MeasureTheory.Filtration.rightCont_eq_of_neBot_nhdsGT 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] [TopologicalSpace ι] [OrderTopology ι] (𝓕 : MeasureTheory.Filtration ι m) (i : ι) [(nhdsWithin i (Set.Ioi i)).NeBot] : ↑𝓕.rightCont i = ⨅ j, ⨅ (_ : j > i), ↑𝓕 j - MeasureTheory.Filtration.rightCont_eq_of_exists_gt 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [LinearOrder ι] (𝓕 : MeasureTheory.Filtration ι m) {i : ι} (hi : ∃ j > i, Set.Ioo i j = ∅) : ↑𝓕.rightCont i = ↑𝓕 i - MeasureTheory.Filtration.condExp_condExp 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {E : Type u_3} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] (f : Ω → E) {μ : MeasureTheory.Measure Ω} (ℱ : MeasureTheory.Filtration ι m) {i j : ι} (hij : i ≤ j) [MeasureTheory.SigmaFinite (μ.trim ⋯)] : μ[μ[f | ↑ℱ j] | ↑ℱ i] =ᵐ[μ] μ[f | ↑ℱ i] - MeasureTheory.Filtration.memLp_limitProcess_of_eLpNorm_bdd 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} {R : NNReal} {p : ENNReal} {F : Type u_5} [NormedAddCommGroup F] {ℱ : MeasureTheory.Filtration ℕ m} {f : ℕ → Ω → F} (hfm : ∀ (n : ℕ), MeasureTheory.AEStronglyMeasurable (f n) μ) (hbdd : ∀ (n : ℕ), MeasureTheory.eLpNorm (f n) p μ ≤ ↑R) : MeasureTheory.MemLp (MeasureTheory.Filtration.limitProcess f ℱ μ) p μ - MeasureTheory.Filtration.rightCont_apply 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [PartialOrder ι] [TopologicalSpace ι] [OrderTopology ι] (𝓕 : MeasureTheory.Filtration ι m) (i : ι) : ↑𝓕.rightCont i = if (nhdsWithin i (Set.Ioi i)).NeBot then ⨅ j, ⨅ (_ : j > i), ↑𝓕 j else ↑𝓕 i - MeasureTheory.Filtration.filtrationOfSet_eq_natural 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] [∀ (i : ι), TopologicalSpace.MetrizableSpace (β i)] [mβ : (i : ι) → MeasurableSpace (β i)] [∀ (i : ι), BorelSpace (β i)] [Preorder ι] [(i : ι) → MulZeroOneClass (β i)] [∀ (i : ι), Nontrivial (β i)] {s : ι → Set Ω} (hsm : ∀ (i : ι), MeasurableSet (s i)) : MeasureTheory.filtrationOfSet hsm = MeasureTheory.Filtration.natural (fun i => (s i).indicator fun x => 1) ⋯ - MeasureTheory.Filtration.rightCont_def 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_3} {ι : Type u_4} {m : MeasurableSpace Ω} [PartialOrder ι] (𝓕 : MeasureTheory.Filtration ι m) : 𝓕.rightCont = { seq := fun i => if (nhdsWithin i (Set.Ioi i)).NeBot then ⨅ j, ⨅ (_ : j > i), ↑𝓕 j else ↑𝓕 i, mono' := ⋯, le' := ⋯ } - MeasureTheory.Filtration.rightCont_eq 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [LinearOrder ι] [DenselyOrdered ι] [NoMaxOrder ι] (𝓕 : MeasureTheory.Filtration ι m) (i : ι) : ↑𝓕.rightCont i = ⨅ j, ⨅ (_ : j > i), ↑𝓕 j - MeasureTheory.Filtration.rightCont_eq_of_not_isMax 📋 Mathlib.Probability.Process.Filtration
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [LinearOrder ι] [DenselyOrdered ι] (𝓕 : MeasureTheory.Filtration ι m) {i : ι} (hi : ¬IsMax i) : ↑𝓕.rightCont i = ⨅ j, ⨅ (_ : j > i), ↑𝓕 j - MeasureTheory.IsProgressive 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_3} [MeasurableSpace ι] [MeasurableSpace β] (f : MeasureTheory.Filtration ι m) (u : ι → Ω → β) : Prop - MeasureTheory.IsStronglyProgressive 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] (f : MeasureTheory.Filtration ι m) (u : ι → Ω → β) : Prop - MeasureTheory.ProgMeasurable 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] (f : MeasureTheory.Filtration ι m) (u : ι → Ω → β) : Prop - MeasureTheory.Adapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] (f : MeasureTheory.Filtration ι m) (u : (i : ι) → Ω → β i) : Prop - MeasureTheory.StronglyAdapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] (f : MeasureTheory.Filtration ι m) (u : (i : ι) → Ω → β i) : Prop - MeasureTheory.adapted_const 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_4} [MeasurableSpace β] (f : MeasureTheory.Filtration ι m) (x : β) : MeasureTheory.Adapted f fun x_1 x_2 => x - MeasureTheory.stronglyAdapted_const 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_4} [TopologicalSpace β] (f : MeasureTheory.Filtration ι m) (x : β) : MeasureTheory.StronglyAdapted f fun x_1 x_2 => x - MeasureTheory.isProgressive_const 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_3} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} (f : MeasureTheory.Filtration ι m) (b : β) : MeasureTheory.IsProgressive f fun x x_1 => b - MeasureTheory.isStronglyProgressive_const 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] (f : MeasureTheory.Filtration ι m) (b : β) : MeasureTheory.IsStronglyProgressive f fun x x_1 => b - MeasureTheory.progMeasurable_const 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] (f : MeasureTheory.Filtration ι m) (b : β) : MeasureTheory.IsStronglyProgressive f fun x x_1 => b - MeasureTheory.adapted_const' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] (f : MeasureTheory.Filtration ι m) (x : (i : ι) → β i) : MeasureTheory.Adapted f fun i x_1 => x i - MeasureTheory.stronglyAdapted_const' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] (f : MeasureTheory.Filtration ι m) (x : (i : ι) → β i) : MeasureTheory.StronglyAdapted f fun i x_1 => x i - MeasureTheory.Adapted.measurable 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u : (i : ι) → Ω → β i} {i : ι} (hf : MeasureTheory.Adapted f u) : Measurable (u i) - MeasureTheory.IsProgressive.adapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} (h : MeasureTheory.IsProgressive f u) : MeasureTheory.Adapted f u - MeasureTheory.IsStronglyProgressive.stronglyAdapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] (h : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.StronglyAdapted f u - MeasureTheory.ProgMeasurable.stronglyAdapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] (h : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.StronglyAdapted f u - MeasureTheory.StronglyAdapted.stronglyMeasurable 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} {i : ι} (hf : MeasureTheory.StronglyAdapted f u) : MeasureTheory.StronglyMeasurable (u i) - MeasureTheory.stronglyAdapted_zero 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (β : Type u_4) [TopologicalSpace β] [Zero β] (f : MeasureTheory.Filtration ι m) : MeasureTheory.StronglyAdapted f 0 - MeasureTheory.IsStronglyProgressive.isProgressive 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [TopologicalSpace.PseudoMetrizableSpace β] [BorelSpace β] (h : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsProgressive f u - MeasureTheory.IsProgressive.isStronglyProgressive 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [TopologicalSpace.PseudoMetrizableSpace β] [SecondCountableTopology β] [OpensMeasurableSpace β] (h : MeasureTheory.IsProgressive f u) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.Adapted.measurable_le 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u : (i : ι) → Ω → β i} {i j : ι} (hf : MeasureTheory.Adapted f u) (hij : i ≤ j) : Measurable (u i) - MeasureTheory.StronglyAdapted.stronglyMeasurable_le 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} {i j : ι} (hf : MeasureTheory.StronglyAdapted f u) (hij : i ≤ j) : MeasureTheory.StronglyMeasurable (u i) - MeasureTheory.stronglyAdapted_zero' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] (β : ι → Type u_3) [(i : ι) → TopologicalSpace (β i)] [(i : ι) → Zero (β i)] (f : MeasureTheory.Filtration ι m) : MeasureTheory.StronglyAdapted f 0 - MeasureTheory.StronglyAdapted.isStronglyProgressive_of_discrete 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [TopologicalSpace ι] [DiscreteTopology ι] [SecondCountableTopology ι] [MeasurableSpace ι] [OpensMeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] (h : MeasureTheory.StronglyAdapted f u) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.StronglyAdapted.progMeasurable_of_discrete 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [TopologicalSpace ι] [DiscreteTopology ι] [SecondCountableTopology ι] [MeasurableSpace ι] [OpensMeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] (h : MeasureTheory.StronglyAdapted f u) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.StronglyAdapted.adapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} [mΒ : (i : ι) → MeasurableSpace (β i)] [∀ (i : ι), BorelSpace (β i)] [∀ (i : ι), TopologicalSpace.PseudoMetrizableSpace (β i)] (hf : MeasureTheory.StronglyAdapted f u) : MeasureTheory.Adapted f u - MeasureTheory.IsStronglyProgressive.norm 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} [MeasurableSpace ι] {β : Type u_4} {u : ι → Ω → β} [SeminormedAddCommGroup β] (hu : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsStronglyProgressive f fun t ω => ‖u t ω‖ - MeasureTheory.ProgMeasurable.norm 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} [MeasurableSpace ι] {β : Type u_4} {u : ι → Ω → β} [SeminormedAddCommGroup β] (hu : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsStronglyProgressive f fun t ω => ‖u t ω‖ - MeasureTheory.IsProgressive.norm 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [NormedAddCommGroup β] [OpensMeasurableSpace β] (hu : MeasureTheory.IsProgressive f u) : MeasureTheory.IsProgressive f fun t ω => ‖u t ω‖ - MeasureTheory.Adapted.stronglyAdapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} [mΒ : (i : ι) → MeasurableSpace (β i)] [∀ (i : ι), OpensMeasurableSpace (β i)] [∀ (i : ι), TopologicalSpace.PseudoMetrizableSpace (β i)] [∀ (i : ι), SecondCountableTopology (β i)] (hf : MeasureTheory.Adapted f u) : MeasureTheory.StronglyAdapted f u - MeasureTheory.stronglyAdapted_iff_adapted 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} [mΒ : (i : ι) → MeasurableSpace (β i)] [∀ (i : ι), BorelSpace (β i)] [∀ (i : ι), TopologicalSpace.PseudoMetrizableSpace (β i)] [∀ (i : ι), SecondCountableTopology (β i)] : MeasureTheory.StronglyAdapted f u ↔ MeasureTheory.Adapted f u - MeasureTheory.StronglyAdapted.isStronglyProgressive_of_continuous 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [TopologicalSpace ι] [TopologicalSpace.MetrizableSpace ι] [SecondCountableTopology ι] [MeasurableSpace ι] [OpensMeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] (h : MeasureTheory.StronglyAdapted f u) (hu_cont : ∀ (ω : Ω), Continuous fun i => u i ω) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.StronglyAdapted.progMeasurable_of_continuous 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [TopologicalSpace ι] [TopologicalSpace.MetrizableSpace ι] [SecondCountableTopology ι] [MeasurableSpace ι] [OpensMeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] (h : MeasureTheory.StronglyAdapted f u) (hu_cont : ∀ (ω : Ω), Continuous fun i => u i ω) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.IsProgressive.inv 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [Group β] [MeasurableInv β] (hu : MeasureTheory.IsProgressive f u) : MeasureTheory.IsProgressive f fun i ω => (u i ω)⁻¹ - MeasureTheory.IsProgressive.neg 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [AddGroup β] [MeasurableNeg β] (hu : MeasureTheory.IsProgressive f u) : MeasureTheory.IsProgressive f fun i ω => -u i ω - MeasureTheory.IsStronglyProgressive.inv 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] [Group β] [ContinuousInv β] (hu : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsStronglyProgressive f fun i ω => (u i ω)⁻¹ - MeasureTheory.IsStronglyProgressive.neg 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] [AddGroup β] [ContinuousNeg β] (hu : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsStronglyProgressive f fun i ω => -u i ω - MeasureTheory.ProgMeasurable.inv 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] [Group β] [ContinuousInv β] (hu : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsStronglyProgressive f fun i ω => (u i ω)⁻¹ - MeasureTheory.ProgMeasurable.neg 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] [AddGroup β] [ContinuousNeg β] (hu : MeasureTheory.IsStronglyProgressive f u) : MeasureTheory.IsStronglyProgressive f fun i ω => -u i ω - MeasureTheory.StronglyAdapted.norm 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_4} {u : (i : ι) → Ω → β i} [(i : ι) → SeminormedAddCommGroup (β i)] (hu : MeasureTheory.StronglyAdapted f u) : MeasureTheory.StronglyAdapted f fun t ω => ‖u t ω‖ - MeasureTheory.IsProgressive.comp 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} {t : ι → Ω → ι} (h : MeasureTheory.IsProgressive f u) (ht : MeasureTheory.IsProgressive f t) (ht_le : ∀ (i : ι) (ω : Ω), t i ω ≤ i) : MeasureTheory.IsProgressive f fun i ω => u (t i ω) ω - MeasureTheory.IsProgressive.add 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u v : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [Add β] [MeasurableAdd₂ β] (hu : MeasureTheory.IsProgressive f u) (hv : MeasureTheory.IsProgressive f v) : MeasureTheory.IsProgressive f fun i ω => u i ω + v i ω - MeasureTheory.IsProgressive.mul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u v : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [Mul β] [MeasurableMul₂ β] (hu : MeasureTheory.IsProgressive f u) (hv : MeasureTheory.IsProgressive f v) : MeasureTheory.IsProgressive f fun i ω => u i ω * v i ω - MeasureTheory.IsStronglyProgressive.add 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [Add β] [ContinuousAdd β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω + v i ω - MeasureTheory.IsStronglyProgressive.mul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [Mul β] [ContinuousMul β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω * v i ω - MeasureTheory.ProgMeasurable.add 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [Add β] [ContinuousAdd β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω + v i ω - MeasureTheory.ProgMeasurable.mul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [Mul β] [ContinuousMul β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω * v i ω - MeasureTheory.isStronglyProgressive_of_tendsto 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] {U : ℕ → ι → Ω → β} (h : ∀ (l : ℕ), MeasureTheory.IsStronglyProgressive f (U l)) (h_tendsto : Filter.Tendsto U Filter.atTop (nhds u)) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.progMeasurable_of_tendsto 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] {U : ℕ → ι → Ω → β} (h : ∀ (l : ℕ), MeasureTheory.IsStronglyProgressive f (U l)) (h_tendsto : Filter.Tendsto U Filter.atTop (nhds u)) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.IsStronglyProgressive.comp 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] {t : ι → Ω → ι} [TopologicalSpace ι] [BorelSpace ι] [TopologicalSpace.PseudoMetrizableSpace ι] (h : MeasureTheory.IsStronglyProgressive f u) (ht : MeasureTheory.IsStronglyProgressive f t) (ht_le : ∀ (i : ι) (ω : Ω), t i ω ≤ i) : MeasureTheory.IsStronglyProgressive f fun i ω => u (t i ω) ω - MeasureTheory.ProgMeasurable.comp 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} [MeasurableSpace ι] {t : ι → Ω → ι} [TopologicalSpace ι] [BorelSpace ι] [TopologicalSpace.PseudoMetrizableSpace ι] (h : MeasureTheory.IsStronglyProgressive f u) (ht : MeasureTheory.IsStronglyProgressive f t) (ht_le : ∀ (i : ι) (ω : Ω), t i ω ≤ i) : MeasureTheory.IsStronglyProgressive f fun i ω => u (t i ω) ω - MeasureTheory.IsProgressive.div 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u v : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [Group β] [MeasurableDiv₂ β] (hu : MeasureTheory.IsProgressive f u) (hv : MeasureTheory.IsProgressive f v) : MeasureTheory.IsProgressive f fun i ω => u i ω / v i ω - MeasureTheory.IsProgressive.sub 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {u v : ι → Ω → β} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} [AddGroup β] [MeasurableSub₂ β] (hu : MeasureTheory.IsProgressive f u) (hv : MeasureTheory.IsProgressive f v) : MeasureTheory.IsProgressive f fun i ω => u i ω - v i ω - MeasureTheory.IsStronglyProgressive.div' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [Group β] [ContinuousDiv β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω / v i ω - MeasureTheory.IsStronglyProgressive.sub 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [AddGroup β] [ContinuousSub β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω - v i ω - MeasureTheory.ProgMeasurable.div' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [Group β] [ContinuousDiv β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω / v i ω - MeasureTheory.ProgMeasurable.sub 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u v : ι → Ω → β} [MeasurableSpace ι] [AddGroup β] [ContinuousSub β] (hu : MeasureTheory.IsStronglyProgressive f u) (hv : MeasureTheory.IsStronglyProgressive f v) : MeasureTheory.IsStronglyProgressive f fun i ω => u i ω - v i ω - MeasureTheory.isStronglyProgressive_of_tendsto' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} {γ : Type u_4} [MeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] (fltr : Filter γ) [fltr.NeBot] [fltr.IsCountablyGenerated] {U : γ → ι → Ω → β} (h : ∀ (l : γ), MeasureTheory.IsStronglyProgressive f (U l)) (h_tendsto : Filter.Tendsto U fltr (nhds u)) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.progMeasurable_of_tendsto' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] {u : ι → Ω → β} {γ : Type u_4} [MeasurableSpace ι] [TopologicalSpace.PseudoMetrizableSpace β] (fltr : Filter γ) [fltr.NeBot] [fltr.IsCountablyGenerated] {U : γ → ι → Ω → β} (h : ∀ (l : γ), MeasureTheory.IsStronglyProgressive f (U l)) (h_tendsto : Filter.Tendsto U fltr (nhds u)) : MeasureTheory.IsStronglyProgressive f u - MeasureTheory.IsProgressive.finsetProd 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} {γ : Type u_4} [CommMonoid β] [MeasurableMul₂ β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsProgressive f (U c)) : MeasureTheory.IsProgressive f fun i ω => ∏ c ∈ s, U c i ω - MeasureTheory.IsProgressive.finsetSum 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} {mi : MeasurableSpace ι} {mβ : MeasurableSpace β} {γ : Type u_4} [AddCommMonoid β] [MeasurableAdd₂ β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsProgressive f (U c)) : MeasureTheory.IsProgressive f fun i ω => ∑ c ∈ s, U c i ω - MeasureTheory.IsStronglyProgressive.finsetProd 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [CommMonoid β] [ContinuousMul β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f fun i a => ∏ c ∈ s, U c i a - MeasureTheory.IsStronglyProgressive.finsetSum 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [AddCommMonoid β] [ContinuousAdd β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f fun i a => ∑ c ∈ s, U c i a - MeasureTheory.IsStronglyProgressive.finset_prod 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [CommMonoid β] [ContinuousMul β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f fun i a => ∏ c ∈ s, U c i a - MeasureTheory.IsStronglyProgressive.finset_sum 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [AddCommMonoid β] [ContinuousAdd β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f fun i a => ∑ c ∈ s, U c i a - MeasureTheory.ProgMeasurable.finset_prod 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [CommMonoid β] [ContinuousMul β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f fun i a => ∏ c ∈ s, U c i a - MeasureTheory.ProgMeasurable.finset_sum 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [AddCommMonoid β] [ContinuousAdd β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f fun i a => ∑ c ∈ s, U c i a - MeasureTheory.StronglyAdapted.smul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} [(i : ι) → SMul ℝ (β i)] [∀ (i : ι), ContinuousConstSMul ℝ (β i)] (c : ℝ) (hu : MeasureTheory.StronglyAdapted f u) : MeasureTheory.StronglyAdapted f (c • u) - MeasureTheory.Adapted.smul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u : (i : ι) → Ω → β i} {𝕂 : Type u_4} [MeasurableSpace 𝕂] [(i : ι) → SMul 𝕂 (β i)] [∀ (i : ι), MeasurableSMul 𝕂 (β i)] (c : 𝕂) (hu : MeasureTheory.Adapted f u) : MeasureTheory.Adapted f (c • u) - MeasureTheory.IsStronglyProgressive.finsetProd' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [CommMonoid β] [ContinuousMul β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f (∏ c ∈ s, U c) - MeasureTheory.IsStronglyProgressive.finsetSum' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [AddCommMonoid β] [ContinuousAdd β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f (∑ c ∈ s, U c) - MeasureTheory.IsStronglyProgressive.finset_prod' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [CommMonoid β] [ContinuousMul β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f (∏ c ∈ s, U c) - MeasureTheory.IsStronglyProgressive.finset_sum' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [AddCommMonoid β] [ContinuousAdd β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f (∑ c ∈ s, U c) - MeasureTheory.ProgMeasurable.finset_prod' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [CommMonoid β] [ContinuousMul β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f (∏ c ∈ s, U c) - MeasureTheory.ProgMeasurable.finset_sum' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : Type u_3} [TopologicalSpace β] [MeasurableSpace ι] {γ : Type u_4} [AddCommMonoid β] [ContinuousAdd β] {U : γ → ι → Ω → β} {s : Finset γ} (h : ∀ c ∈ s, MeasureTheory.IsStronglyProgressive f (U c)) : MeasureTheory.IsStronglyProgressive f (∑ c ∈ s, U c) - MeasureTheory.Adapted.inv 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u : (i : ι) → Ω → β i} [(i : ι) → Group (β i)] [∀ (i : ι), MeasurableInv (β i)] (hu : MeasureTheory.Adapted f u) : MeasureTheory.Adapted f u⁻¹ - MeasureTheory.Adapted.neg 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u : (i : ι) → Ω → β i} [(i : ι) → AddGroup (β i)] [∀ (i : ι), MeasurableNeg (β i)] (hu : MeasureTheory.Adapted f u) : MeasureTheory.Adapted f (-u) - MeasureTheory.StronglyAdapted.inv 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} [(i : ι) → Group (β i)] [∀ (i : ι), ContinuousInv (β i)] (hu : MeasureTheory.StronglyAdapted f u) : MeasureTheory.StronglyAdapted f u⁻¹ - MeasureTheory.StronglyAdapted.neg 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u : (i : ι) → Ω → β i} [(i : ι) → AddGroup (β i)] [∀ (i : ι), ContinuousNeg (β i)] (hu : MeasureTheory.StronglyAdapted f u) : MeasureTheory.StronglyAdapted f (-u) - MeasureTheory.Adapted.add 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Add (β i)] [∀ (i : ι), MeasurableAdd₂ (β i)] (hu : MeasureTheory.Adapted f u) (hv : MeasureTheory.Adapted f v) : MeasureTheory.Adapted f (u + v) - MeasureTheory.Adapted.div 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Div (β i)] [∀ (i : ι), MeasurableDiv₂ (β i)] (hu : MeasureTheory.Adapted f u) (hv : MeasureTheory.Adapted f v) : MeasureTheory.Adapted f (u / v) - MeasureTheory.Adapted.mul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Mul (β i)] [∀ (i : ι), MeasurableMul₂ (β i)] (hu : MeasureTheory.Adapted f u) (hv : MeasureTheory.Adapted f v) : MeasureTheory.Adapted f (u * v) - MeasureTheory.Adapted.sub 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → MeasurableSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Sub (β i)] [∀ (i : ι), MeasurableSub₂ (β i)] (hu : MeasureTheory.Adapted f u) (hv : MeasureTheory.Adapted f v) : MeasureTheory.Adapted f (u - v) - MeasureTheory.StronglyAdapted.add 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Add (β i)] [∀ (i : ι), ContinuousAdd (β i)] (hu : MeasureTheory.StronglyAdapted f u) (hv : MeasureTheory.StronglyAdapted f v) : MeasureTheory.StronglyAdapted f (u + v) - MeasureTheory.StronglyAdapted.div' 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Div (β i)] [∀ (i : ι), ContinuousDiv (β i)] (hu : MeasureTheory.StronglyAdapted f u) (hv : MeasureTheory.StronglyAdapted f v) : MeasureTheory.StronglyAdapted f (u / v) - MeasureTheory.StronglyAdapted.mul 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Mul (β i)] [∀ (i : ι), ContinuousMul (β i)] (hu : MeasureTheory.StronglyAdapted f u) (hv : MeasureTheory.StronglyAdapted f v) : MeasureTheory.StronglyAdapted f (u * v) - MeasureTheory.StronglyAdapted.sub 📋 Mathlib.Probability.Process.Adapted
{Ω : Type u_1} {ι : Type u_2} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {β : ι → Type u_3} [(i : ι) → TopologicalSpace (β i)] {u v : (i : ι) → Ω → β i} [(i : ι) → Sub (β i)] [∀ (i : ι), ContinuousSub (β i)] (hu : MeasureTheory.StronglyAdapted f u) (hv : MeasureTheory.StronglyAdapted f v) : MeasureTheory.StronglyAdapted f (u - v) - MeasureTheory.IsStoppingTime 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] (f : MeasureTheory.Filtration ι m) (τ : Ω → WithTop ι) : Prop - MeasureTheory.isStoppingTime_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] (f : MeasureTheory.Filtration ι m) (i : ι) : MeasureTheory.IsStoppingTime f fun x => ↑i - MeasureTheory.IsStoppingTime.measurableSpace 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) : MeasurableSpace Ω - MeasureTheory.IsStoppingTime.measurableSpace_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) : hτ.measurableSpace ≤ m - MeasureTheory.IsStoppingTime.measurableSpace_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] (f : MeasureTheory.Filtration ι m) (i : ι) : ⋯.measurableSpace = ↑f i - MeasureTheory.isStoppingTime_of_measurableSet_eq 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] [Countable ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : ∀ (i : ι), MeasurableSet {ω | τ ω = ↑i}) : MeasureTheory.IsStoppingTime f τ - MeasureTheory.IsStoppingTime.measurableSet_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω ≤ ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq_of_countable 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [PartialOrder ι] {τ : Ω → WithTop ι} {f : MeasureTheory.Filtration ι m} [Countable ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_lt_of_pred 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [PredOrder ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSpace_le_of_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) {n : ι} (hτ_le : ∀ (ω : Ω), τ ω ≤ ↑n) : hτ.measurableSpace ≤ m - MeasureTheory.IsStoppingTime.measurableSet_eq_of_countable_range 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [PartialOrder ι] {τ : Ω → WithTop ι} {f : MeasureTheory.Filtration ι m} (hτ : MeasureTheory.IsStoppingTime f τ) (h_countable : (Set.range τ).Countable) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.le_measurableSpace_of_const_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) {i : ι} (hτ_le : ∀ (ω : Ω), ↑i ≤ τ ω) : ↑f i ≤ hτ.measurableSpace - MeasureTheory.IsStoppingTime.measurableSpace_le_of_le_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) {i : ι} (hτ_le : ∀ (ω : Ω), τ ω ≤ ↑i) : hτ.measurableSpace ≤ ↑f i - MeasureTheory.IsStoppingTime.measurableSet_lt_of_countable 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [PartialOrder ι] {τ : Ω → WithTop ι} {f : MeasureTheory.Filtration ι m} [Countable ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSpace_le' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) : hτ.measurableSpace ≤ ⨆ t, ↑f t - MeasureTheory.isStoppingTime_piecewise_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {𝒢 : MeasureTheory.Filtration ι m} {i j : ι} {s : Set Ω} [DecidablePred fun x => x ∈ s] (hij : i ≤ j) (hs : MeasurableSet s) : MeasureTheory.IsStoppingTime 𝒢 (s.piecewise (fun x => ↑i) fun x => ↑j) - MeasureTheory.IsStoppingTime.measurableSet_lt_of_countable_range 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [PartialOrder ι] {τ : Ω → WithTop ι} {f : MeasureTheory.Filtration ι m} (hτ : MeasureTheory.IsStoppingTime f τ) (h_countable : (Set.range τ).Countable) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSpace_mono 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ π : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (hπ : MeasureTheory.IsStoppingTime f π) (hle : τ ≤ π) : hτ.measurableSpace ≤ hπ.measurableSpace - MeasureTheory.IsStoppingTime.measurable' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [SecondCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) : Measurable τ - MeasureTheory.IsStoppingTime.measurableSet_eq_of_countable' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [Countable ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq_top 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [SecondCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) : MeasurableSet {ω | τ ω = ⊤} - MeasureTheory.IsStoppingTime.measurableSet_inter_eq_iff 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (s : Set Ω) (i : ι) : MeasurableSet (s ∩ {ω | τ ω = ↑i}) ↔ MeasurableSet (s ∩ {ω | τ ω = ↑i}) - MeasureTheory.IsStoppingTime.max_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasureTheory.IsStoppingTime f fun ω => max (τ ω) ↑i - MeasureTheory.IsStoppingTime.min_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasureTheory.IsStoppingTime f fun ω => min (τ ω) ↑i - MeasureTheory.IsStoppingTime.measurableSet_eq_of_countable_range' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (h_countable : (Set.range τ).Countable) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurable 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [SecondCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) : Measurable τ - MeasureTheory.IsStoppingTime.measurableSet_gt 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i < τ ω} - MeasureTheory.IsStoppingTime.measurableSet_gt' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i < τ ω} - MeasureTheory.IsStoppingTime.measurableSet_le' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω ≤ ↑i} - MeasureTheory.IsStoppingTime.measurableSet_ge_of_countable 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {m : MeasurableSpace Ω} {ι : Type u_4} [LinearOrder ι] {τ : Ω → WithTop ι} {f : MeasureTheory.Filtration ι m} [Countable ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_eq 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_ge_of_countable' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [Countable ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_lt_of_countable' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [Countable ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.sigmaFinite_stopping_time 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {m : MeasurableSpace Ω} {ι : Type u_4} [SemilatticeSup ι] [OrderBot ι] {μ : MeasureTheory.Measure Ω} {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [MeasureTheory.SigmaFiniteFiltration μ f] (hτ : MeasureTheory.IsStoppingTime f τ) : MeasureTheory.SigmaFinite (μ.trim ⋯) - MeasureTheory.IsStoppingTime.measurableSet_ge_of_countable_range 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {m : MeasurableSpace Ω} {ι : Type u_4} [LinearOrder ι] {τ : Ω → WithTop ι} {f : MeasureTheory.Filtration ι m} (hτ : MeasureTheory.IsStoppingTime f τ) (h_countable : (Set.range τ).Countable) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.max 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ π : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (hπ : MeasureTheory.IsStoppingTime f π) : MeasureTheory.IsStoppingTime f fun ω => max (τ ω) (π ω) - MeasureTheory.IsStoppingTime.measurableSet_ge_of_countable_range' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (h_countable : (Set.range τ).Countable) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_lt_of_countable_range' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (h_countable : (Set.range τ).Countable) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.min 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ π : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (hπ : MeasureTheory.IsStoppingTime f π) : MeasureTheory.IsStoppingTime f fun ω => min (τ ω) (π ω) - MeasureTheory.IsStoppingTime.measurableSet 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) (s : Set Ω) : MeasurableSet s ↔ MeasurableSet s ∧ ∀ (i : ι), MeasurableSet (s ∩ {ω | τ ω ≤ ↑i}) - MeasureTheory.IsStoppingTime.piecewise_of_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Preorder ι] {𝒢 : MeasureTheory.Filtration ι m} {τ η : Ω → WithTop ι} {i : ι} {s : Set Ω} [DecidablePred fun x => x ∈ s] (hτ_st : MeasureTheory.IsStoppingTime 𝒢 τ) (hη_st : MeasureTheory.IsStoppingTime 𝒢 η) (hτ : ∀ (ω : Ω), ↑i ≤ τ ω) (hη : ∀ (ω : Ω), ↑i ≤ η ω) (hs : MeasurableSet s) : MeasureTheory.IsStoppingTime 𝒢 (s.piecewise τ η) - MeasureTheory.IsStoppingTime.add_const 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [AddGroup ι] [Preorder ι] [AddRightMono ι] [AddLeftMono ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) {i : ι} (hi : 0 ≤ i) : MeasureTheory.IsStoppingTime f fun ω => τ ω + ↑i - MeasureTheory.IsStoppingTime.measurable_iSup 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [SecondCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) : Measurable τ - MeasureTheory.IsStoppingTime.measurableSet_ge 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_lt 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSet_ge' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_lt' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) {i j : ι} (hle : i ≤ j) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq_stopping_time 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ π : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [SecondCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (hπ : MeasureTheory.IsStoppingTime f π) : MeasurableSet {ω | τ ω = π ω} - MeasureTheory.integrable_stoppedValue 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} (ι : Type u_3) {m : MeasurableSpace Ω} [Nonempty ι] {μ : MeasureTheory.Measure Ω} {τ : Ω → WithTop ι} {E : Type u_4} {u : ι → Ω → E} [PartialOrder ι] {ℱ : MeasureTheory.Filtration ι m} [NormedAddCommGroup E] [LocallyFiniteOrderBot ι] (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hu : ∀ (n : ι), MeasureTheory.Integrable (u n) μ) {N : ι} (hbdd : ∀ (ω : Ω), τ ω ≤ ↑N) : MeasureTheory.Integrable (MeasureTheory.stoppedValue u τ) μ - MeasureTheory.IsStoppingTime.measurableSet_eq_top' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [SecondCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) : MeasurableSet {ω | τ ω = ⊤}
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59