mul measureReal exists lt le
ProvedProbabilityTheory.mul_measureReal_exists_lt_lecontext-reviewlevystochcalcsource-import
The source theorem ProbabilityTheory.mul_measureReal_exists_lt_le 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_Auxiliary_Filtration_F000
import Definitions.Def_BrownianMotion_Auxiliary_Upcrossing_F000
import Definitions.Def_BrownianMotion_Auxiliary_Upcrossing_F001
import Definitions.Def_BrownianMotion_StochasticIntegral_Quasimartingale_Basic_F000
/-
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.mul_measureReal_exists_lt_le [IsFiniteMeasure μ]
{g : ι → Ω → ℝ} (hg : StronglyAdapted 𝓕 g) (hgint : ∀ s, Integrable (g s) μ)
{n : ℕ} {idx : ℕ → ι} (hidx : Monotone idx) {K : ℝ}
(hK : ∀ W : ℕ → Ω → ℝ, (∀ k, k < n → ∀ ω, W k ω = 0 ∨ W k ω = 1) →
(∀ k, k < n → Measurable[𝓕 (idx k)] (W k)) →
∫ ω, (∑ k ∈ range n, W k ω * (g (idx (k + 1)) ω - g (idx k) ω)) ∂μ ≤ K) :
lam * μ.real {ω | ∃ k ≤ n, lam < g (idx k) ω}
≤ K + ∫ ω, |g (idx 0) ω| ∂μ + ∫ ω, |g (idx n) ω| ∂μ := by sorry
Source