Pathwise Decomposition of a Finite-Range Stopped Integrand
ProvedLevyStochCalc.Brownian.Ito.stopped_eq_sub_sum_readablefunctional-inequalitieskls-conjecturekls-modularkls-readablelog-concavevendored-levystochcalc
This is the pathwise decomposition of the cut integrand used for finite-range optional stopping.
Let , let , let , and let be a finite set of real times. Assume:
- every satisfies ;
- every satisfies ;
- for every , either for some , or .
Then the indicator-term representation indTerm of the stopped integrand Probability.stopped τ H on is pointwise
This neutral pathwise identity is the algebraic component of the finite-range optional-stopping theorem.
Original Lean declaration header
Within namespace LevyStochCalc.Brownian.Ito. Shown in its original module context. Proof omitted.
theorem stopped_eq_sub_sum (H : Ω → ℝ → ℝ) {t : ℝ} (J : Finset ℝ)
(hJ0 : ∀ c ∈ J, 0 ≤ c) (hJt : ∀ c ∈ J, c < t)
(hτJ : ∀ ω, (∃ c ∈ J, τ ω = ((c : ℝ) : WithTop ℝ)) ∨ ((t : ℝ) : WithTop ℝ) ≤ τ ω) :
indTerm (Probability.stopped τ H) 0 t
= fun ω s => indTerm H 0 t ω s - ∑ c ∈ J, cutTerm τ H c t ω s
Module navigation
Module: LevyStochCalc/Brownian/ItoOptionalStopping.
Definition modules: LevyStochCalc/Probability/StoppedProgressive.
Next: stochasticIntegralBrownian_stopped.
Source excerpt, lines 143–147 · Frozen source 408915f.
Preamble
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoOptionalStopping
/-
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/ItoOptionalStopping.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory
universe u
variable {Ω : Type u} [MeasurableSpace Ω] {P : MeasureTheory.Measure Ω} [MeasureTheory.IsProbabilityMeasure P]
variable (τ : Ω → WithTop ℝ)
omit [IsProbabilityMeasure P]
Formal statement
theorem LevyStochCalc.Brownian.Ito.stopped_eq_sub_sum_readable (H : Ω → ℝ → ℝ) {t : ℝ} (J : Finset ℝ)
(hJ0 : ∀ c ∈ J, 0 ≤ c) (hJt : ∀ c ∈ J, c < t)
(hτJ : ∀ ω, (∃ c ∈ J, τ ω = ((c : ℝ) : WithTop ℝ)) ∨ ((t : ℝ) : WithTop ℝ) ≤ τ ω) :
indTerm (Probability.stopped τ H) 0 t
= fun ω s => indTerm H 0 t ω s - ∑ c ∈ J, cutTerm τ H c t ω s := by sorry
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Brownian/ItoOptionalStopping.lean#L139-L209 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Brownian.ItoOptionalStopping`, declaration `LevyStochCalc.Brownian.Ito.stopped_eq_sub_sum`; the repository is private at upload time). Vendored from https://github.com/cgarryZA/LevyStochCalc at commit 984dbf0b790031eac05d56fe5a84b65e15e1e932 (Apache-2.0; upstream copyright notice retained in the Lean text).