Grid stopping times for Itô-integral locality
DefinitionKLSModular_LevyStochCalc_Brownian_ItoLocalityVendored from the LevyStochCalc library at https://github.com/cgarryZA/LevyStochCalc, commit 984dbf0b790031eac05d56fe5a84b65e15e1e932. For a stopping time , stepStop τ c is the two-valued stopping time that is when and otherwise. gridPt t n k is , gridStopAux τ t n recursively takes the minimum of the relevant stepStop values, and gridStop τ t n is the resulting stopping time at the first grid point strictly beyond among the grid points indexed through .
Original module imports
import LevyStochCalc.Brownian.ItoOptionalStopping
import LevyStochCalc.Brownian.ItoIncrement
Original declaration excerpt
Shown in the original module context.
noncomputable def stepStop (c : ℝ) : Ω → WithTop ℝ :=
fun ω => if (c : WithTop ℝ) ≤ τ ω then ⊤ else (c : WithTop ℝ)
Module navigation
Direct project imports: LevyStochCalc/Brownian/ItoOptionalStopping, LevyStochCalc/Brownian/ItoIncrement.
Theorems in source order:
gridStopAux_le_iffeventually_gridStop_ltstochasticIntegralBrownian_stopped_eq_of_lestochasticIntegralBrownian_congr_of_posstochasticIntegralBrownian_congr_of_le
Project result: The KLS conjecture.
Original module · LevyStochCalc.Brownian.ItoLocality · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoOptionalStopping
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoIncrement
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
-- Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (upstream path LevyStochCalc/Brownian/ItoLocality.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
namespace LevyStochCalc
namespace Brownian
namespace Ito
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal Topology
universe u
variable {Ω : Type u} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
(τ : Ω → WithTop ℝ)
section GridStop
/-- The two-valued stopping time that stops at `c`, unless `τ` has already reached `c`. -/
noncomputable def stepStop (c : ℝ) : Ω → WithTop ℝ :=
fun ω => if (c : WithTop ℝ) ≤ τ ω then ⊤ else (c : WithTop ℝ)
/-- A point of the uniform grid on `[0, t]` with `n` steps. -/
noncomputable def gridPt (t : ℝ) (n k : ℕ) : ℝ := (k : ℝ) * t / (n : ℝ)
/-- The stopping time that stops at the first grid point strictly beyond `τ`, among the first
`k + 1` points. -/
noncomputable def gridStopAux (t : ℝ) (n : ℕ) : ℕ → Ω → WithTop ℝ
| 0 => stepStop τ (gridPt t n 0)
| (k + 1) => fun ω => min (stepStop τ (gridPt t n (k + 1)) ω) (gridStopAux t n k ω)
/-- The stopping time that stops at the first point of the uniform grid on `[0, t]` with `n`
steps that lies strictly beyond `τ`. -/
noncomputable def gridStop (t : ℝ) (n : ℕ) : Ω → WithTop ℝ := gridStopAux τ t n n
end GridStop
end Ito
end Brownian
end LevyStochCalc