Theorems · Definition · probability
MeasureTheory.upperCrossingTime
{Ω : Type u_1} → {ι : Type u_2} → [inst : Preorder ι] → [OrderBot ι] → [InfSet ι] → ℝ → ℝ → (ι → Ω → ℝ) → ι → ℕ → Ω → ιupperCrossingTime a b f N n is the first time before time N, f reaches
above b after f reached below a for the n - 1-th time.
- Cited by
- 42 results in Mathlib
- Foundations
- Depth 104 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by45
Results whose statement or proof uses this declaration.
- MeasureTheory.lowerCrossingTimeproof · cited by 23
- MeasureTheory.upcrossingsBeforeproof · cited by 22
- MeasureTheory.upperCrossingTime_lestatement · cited by 10
- MeasureTheory.upcrossingStratproof · cited by 8
- MeasureTheory.upperCrossingTime_le_lowerCrossingTimestatement · cited by 7
- MeasureTheory.lowerCrossingTime_le_upperCrossingTime_succstatement · cited by 6
- MeasureTheory.upperCrossingTime_lt_bddAbovestatement and proof · cited by 5
- MeasureTheory.upperCrossingTime_monostatement and proof · cited by 5
- MeasureTheory.upperCrossingTime_succ_eqstatement and proof · cited by 5
- MeasureTheory.lowerCrossingTime_leproof · cited by 4
- MeasureTheory.stoppedValue_lowerCrossingTimeproof · cited by 4
- MeasureTheory.upperCrossingTime_lt_of_le_upcrossingsBeforestatement and proof · cited by 3