exitTime le iff
ProvedLevyStochCalc.Probability.exitTime_le_iffcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Probability.exitTime_le_iff is extracted from LevyStochCalc.Probability.ExitTime. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Probability_ExitTime_F000
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# Exit times of a process with continuous paths
`exitTime X k ω` is the first nonnegative time at which the path `X ω` has norm at least `k`, and
`⊤` when the path never reaches that norm. For continuous paths the comparison `exitTime X k ω ≤ t`
is decided by the values of the path on the rationals of `[0, t]`, so the exit time is a stopping
time for any filtration the process is adapted to. Letting `k` grow gives a localising sequence:
every time lies strictly below `exitTime X k` for all large `k`.
-/
open MeasureTheory
namespace LevyStochCalc.Probability
universe u v
variable {Ω : Type u} {mΩ : MeasurableSpace Ω} {E : Type v} [NormedAddCommGroup E]
Formal statement
theorem _root_.LevyStochCalc.Probability.exitTime_le_iff {X : Ω → ℝ → E} {ω : Ω} (hX : Continuous (X ω)) (k t : ℝ) :
exitTime X k ω ≤ (t : WithTop ℝ) ↔ ∃ s ∈ Set.Icc (0 : ℝ) t, k ≤ ‖X ω s‖ := by sorry
Source