integral sum weight increments mem Icc
ProvedProbabilityTheory.integral_sum_weight_increments_mem_Icccontext-reviewlevystochcalcsource-import
The source theorem ProbabilityTheory.integral_sum_weight_increments_mem_Icc is extracted from BrownianMotion.StochasticIntegral.Quasimartingale.MaximalInequality. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_BrownianMotion_StochasticIntegral_Quasimartingale_MaximalInequality_F001
/-
Copyright (c) 2026 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rohit Manokaran, Rémy Degenne
-/
/-! # Maximal inequality for real quasimartingales -/
@[expose] public section
open MeasureTheory Finset Filter
open scoped ENNReal Topology MeasureTheory ProbabilityTheory.SimpleProcess
namespace ProbabilityTheory
variable {ι Ω : Type*} [LinearOrder ι]
{mΩ : MeasurableSpace Ω} {𝓕 : Filtration ι mΩ} {μ : Measure Ω}
{X : ι → Ω → ℝ} {τ σ : Ω → WithTop ι} {i : ι}
section Bridge
variable {F : Finset ι} {t : ι} {k l : ℕ}
end Bridge
/-! ### Upcrossing and alternation bounds along finite time sets -/
section UpcrossingBound
variable {a b : ℝ} {t : ι} {F : Finset ι} {m : ℕ}
end UpcrossingBound
/-! ### Selection of alternating tuples from frequent oscillation -/
section Selection
variable [TopologicalSpace ι] [OrderTopology ι]
variable {T : Set ι} {x d : ι} {a b : ℝ} {ω : Ω}
end Selection
/-! ### Maximal inequality along finite time sets -/
section Maximal
variable {t : ι} {F : Finset ι} {lam : ℝ}
-- todo name
Formal statement
theorem _root_.ProbabilityTheory.integral_sum_weight_increments_mem_Icc [OrderBot ι]
(hXint : ∀ s, Integrable (X s) μ) {C : ℝ}
(hC : ∀ S : ElementaryPredictableSet 𝓕, μ[(S.indicator (1 : ℝ) ● X) t] ≤ C)
{n : ℕ} {idx : ℕ → ι} (hidx : Monotone idx) (hidxt : ∀ k, idx k ≤ t)
{W : ℕ → Ω → ℝ} (hW01 : ∀ k, k < n → ∀ ω, W k ω = 0 ∨ W k ω = 1)
(hWmeas : ∀ k, k < n → Measurable[𝓕 (idx k)] (W k)) :
∫ ω, (∑ k ∈ range n, W k ω * (X (idx (k + 1)) ω - X (idx k) ω)) ∂μ
∈ Set.Icc (-(C + ∫ ω, |X (idx n) ω - X (idx 0) ω| ∂μ)) C := by sorry
Source