Mathlib Map

Theorems · Theorem · probability

MeasureTheory.upperCrossingTime_eq_of_bound_le

∀ {Ω : Type u_1} {a b : ℝ} {f : ℕ → Ω → ℝ} {N n : ℕ} {ω : Ω},
  a < b → N ≤ n → MeasureTheory.upperCrossingTime a b f N n ω = N
Defined in
Mathlib.Probability.Martingale.Upcrossing
Cited by
1 results in Mathlib
Foundations
Depth 113 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

MeasureTheory.upcrossingsBefore_le · cited by 3MeasureTheory.upcrossings…Real · cited by 25697Realle_antisymm · cited by 2068le_antisymmle_trans · cited by 985le_transEq.le · cited by 605Eq.leMeasureTheory.upperCrossingTime · cited by 42MeasureTheory.upperCrossi…MeasureTheory.upperCrossingTime_le · cited by 10MeasureTheory.upperCrossi…MeasureTheory.upperCrossingTime_mono · cited by 5MeasureTheory.upperCrossi…MeasureTheory.upperCrossingTime_bound_eq · cited by 1MeasureTheory.upperCrossi…MeasureTheory.upperCrossingTi…CITED BYCITES

Cites8

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

Cited by1

Results whose statement or proof uses this declaration.