Admissibility properties of simple Brownian integrands
DefinitionKLSModular_LevyStochCalc_Brownian_ItoAlgebraSimpleIntegrandVendored from the LevyStochCalc library (https://github.com/cgarryZA/LevyStochCalc). A SimplePredictable integrand has a uniform real bound, and its evaluation is progressively measurable when its coefficients are strongly measurable with respect to the corresponding filtration times. Multiplying its evaluation by a jointly measurable process preserves joint measurability, and multiplying by a progressively measurable process preserves progressive measurability. The bundle also proves finite squared -valued energy on every positive horizon when the other factor has finite such energy.
Original module imports
import LevyStochCalc.Brownian.ItoL2Completion
Original declaration excerpt
Shown in the original module context.
theorem SimplePredictable.exists_eval_bound {T : ℝ} (G : SimplePredictable Ω T) :
∃ B : ℝ, 0 ≤ B ∧ ∀ s ω, |G.eval s ω| ≤ B := by
classical
choose M hM using G.ξ_bounded
refine ⟨∑ i : Fin G.N, max (M i) 0, Finset.sum_nonneg fun i _ => le_max_right _ _,
fun s ω => ?_⟩
refine (Finset.abs_sum_le_sum_abs _ _).trans (Finset.sum_le_sum fun i _ => ?_)
by_cases h : G.partition i.castSucc < s ∧ s ≤ G.partition i.succ
· rw [if_pos h]; exact (hM i ω).trans (le_max_left _ _)
· rw [if_neg h, abs_zero]; exact le_max_right _ _
Module navigation
Direct project imports: LevyStochCalc/Brownian/ItoL2Completion.
Theorems in source order:
SimplePredictable.lintegral_eval_sq_lt_topsimpleIntegral_diff_isometry_of_adaptedstochasticIntegralBrownian_eval_simple
Project result: The KLS conjecture.
Original module · LevyStochCalc.Brownian.ItoAlgebraSimpleIntegrand · Frozen source 408915f.
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_ItoL2Completion
/-
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/ItoAlgebraSimpleIntegrand.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
namespace LevyStochCalc
namespace Brownian
namespace Ito
open MeasureTheory
open scoped NNReal ENNReal
universe u
variable {Ω : Type u} [MeasurableSpace Ω]
/-- A simple integrand is uniformly bounded in both variables. -/
theorem SimplePredictable.exists_eval_bound {T : ℝ} (G : SimplePredictable Ω T) :
∃ B : ℝ, 0 ≤ B ∧ ∀ s ω, |G.eval s ω| ≤ B := by
classical
choose M hM using G.ξ_bounded
refine ⟨∑ i : Fin G.N, max (M i) 0, Finset.sum_nonneg fun i _ => le_max_right _ _,
fun s ω => ?_⟩
refine (Finset.abs_sum_le_sum_abs _ _).trans (Finset.sum_le_sum fun i _ => ?_)
by_cases h : G.partition i.castSucc < s ∧ s ≤ G.partition i.succ
· rw [if_pos h]; exact (hM i ω).trans (le_max_left _ _)
· rw [if_neg h, abs_zero]; exact le_max_right _ _
/-- A finite sum of step processes `1_{(aᵢ, bᵢ]}(s) · ξᵢ ω`, with `ξᵢ` measurable for
`ℱ (aᵢ)`, is progressively measurable. -/
theorem progressivelyMeasurable_sum_indicator_Ioc
(ℱ : Filtration ℝ ‹MeasurableSpace Ω›) {n : ℕ} (a b : Fin n → ℝ)
(ξ : Fin n → Ω → ℝ)
(hξ : ∀ i, @MeasureTheory.StronglyMeasurable Ω ℝ _ (ℱ (a i)) (ξ i)) :
Probability.ProgressivelyMeasurable ℱ
(fun ω s => ∑ i : Fin n, (Set.Ioc (a i) (b i)).indicator (fun _ => ξ i ω) s) := by
classical
intro t
have key : (fun p : Ω × ℝ => (Set.Iic t).indicator
(fun s => ∑ i : Fin n, (Set.Ioc (a i) (b i)).indicator (fun _ => ξ i p.1) s) p.2)
= fun p : Ω × ℝ => ∑ i : Fin n,
(Set.univ ×ˢ (Set.Ioc (a i) (b i) ∩ Set.Iic t)).indicator
(fun q : Ω × ℝ => ξ i q.1) p := by
funext p
by_cases hp : p.2 ≤ t
· rw [Set.indicator_of_mem (Set.mem_Iic.mpr hp)]
refine Finset.sum_congr rfl fun i _ => ?_
by_cases hi : p.2 ∈ Set.Ioc (a i) (b i)
· have hmem : p ∈ Set.univ ×ˢ (Set.Ioc (a i) (b i) ∩ Set.Iic t) :=
⟨Set.mem_univ _, hi, Set.mem_Iic.mpr hp⟩
rw [Set.indicator_of_mem hi, Set.indicator_of_mem hmem]
· rw [Set.indicator_of_notMem hi, Set.indicator_of_notMem]
rintro ⟨-, hmem, -⟩
exact hi hmem
· rw [Set.indicator_of_notMem (by simpa using hp)]
refine (Finset.sum_eq_zero fun i _ => ?_).symm
rw [Set.indicator_of_notMem]
rintro ⟨-, -, hmem⟩
exact hp (Set.mem_Iic.mp hmem)
letI : MeasurableSpace Ω := ℱ t
rw [key]
refine Finset.stronglyMeasurable_fun_sum _ fun i _ => ?_
by_cases hi : a i < t
· refine MeasureTheory.StronglyMeasurable.indicator ?_
(MeasurableSet.univ.prod (measurableSet_Ioc.inter measurableSet_Iic))
exact ((hξ i).mono (ℱ.mono hi.le)).comp_measurable measurable_fst
· have hempty : Set.Ioc (a i) (b i) ∩ Set.Iic t = ∅ :=
Set.eq_empty_iff_forall_notMem.mpr fun s hs =>
absurd (lt_of_lt_of_le hs.1.1 hs.2) (not_lt.mpr (not_lt.mp hi))
rw [hempty, Set.prod_empty, Set.indicator_empty]
exact MeasureTheory.stronglyMeasurable_const
/-- A simple integrand with `ℱ`-adapted coefficients is progressively measurable. -/
theorem SimplePredictable.progressivelyMeasurable_eval {T : ℝ} (G : SimplePredictable Ω T)
(ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
(h_adapt : ∀ i : Fin G.N, @MeasureTheory.StronglyMeasurable Ω ℝ _
(ℱ (G.partition i.castSucc)) (G.ξ i)) :
Probability.ProgressivelyMeasurable ℱ (fun ω s => G.eval s ω) := by
have hfun : (fun ω s => G.eval s ω)
= fun ω s => ∑ i : Fin G.N,
(Set.Ioc (G.partition i.castSucc) (G.partition i.succ)).indicator
(fun _ => G.ξ i ω) s := by
funext ω s; exact eval_eq_sum_indicator G s ω
rw [hfun]
exact progressivelyMeasurable_sum_indicator_Ioc ℱ _ _ _ h_adapt
/-- A simple integrand times a jointly measurable process is jointly measurable. -/
theorem SimplePredictable.measurable_uncurry_eval_mul {T : ℝ} (G : SimplePredictable Ω T)
{H : Ω → ℝ → ℝ} (hm : Measurable (Function.uncurry H)) :
Measurable (Function.uncurry fun ω s => G.eval s ω * H ω s) :=
G.eval_jointly_measurable.mul hm
/-- A simple integrand with adapted coefficients times a progressively measurable process is
progressively measurable. -/
theorem SimplePredictable.progressivelyMeasurable_eval_mul {T : ℝ} (G : SimplePredictable Ω T)
(ℱ : Filtration ℝ ‹MeasurableSpace Ω›)
(h_adapt : ∀ i : Fin G.N, @MeasureTheory.StronglyMeasurable Ω ℝ _
(ℱ (G.partition i.castSucc)) (G.ξ i))
{H : Ω → ℝ → ℝ} (hp : Probability.ProgressivelyMeasurable ℱ H) :
Probability.ProgressivelyMeasurable ℱ fun ω s => G.eval s ω * H ω s :=
(G.progressivelyMeasurable_eval ℱ h_adapt).mul hp
/-- A simple integrand times a square-integrable process is square-integrable on every
window. -/
theorem SimplePredictable.lintegral_eval_mul_sq_lt_top {T : ℝ} (G : SimplePredictable Ω T)
{P : Measure Ω} [IsProbabilityMeasure P] {H : Ω → ℝ → ℝ}
(hq : ∀ T, 0 < T → ∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T,
(‖H ω s‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P < ⊤)
(T' : ℝ) (hT' : 0 < T') :
∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T',
(‖G.eval s ω * H ω s‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P < ⊤ := by
obtain ⟨B, hB0, hB⟩ := G.exists_eval_bound
have hbd : ∀ s ω, (‖G.eval s ω‖₊ : ℝ≥0∞) ≤ ENNReal.ofReal B := by
intro s ω
calc (‖G.eval s ω‖₊ : ℝ≥0∞)
= ENNReal.ofReal ‖G.eval s ω‖ := by
rw [ENNReal.ofReal_eq_coe_nnreal (norm_nonneg _)]; rfl
_ ≤ ENNReal.ofReal B :=
ENNReal.ofReal_le_ofReal ((Real.norm_eq_abs _).le.trans (hB s ω))
have hpt : ∀ s ω, (‖G.eval s ω * H ω s‖₊ : ℝ≥0∞) ^ 2
≤ ENNReal.ofReal B ^ 2 * (‖H ω s‖₊ : ℝ≥0∞) ^ 2 := by
intro s ω
rw [nnnorm_mul, ENNReal.coe_mul, mul_pow]
gcongr
exact hbd s ω
have hne : ENNReal.ofReal B ^ 2 ≠ ⊤ := (ENNReal.pow_lt_top ENNReal.ofReal_lt_top).ne
calc ∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T',
(‖G.eval s ω * H ω s‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P
≤ ∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T',
ENNReal.ofReal B ^ 2 * (‖H ω s‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P :=
lintegral_mono fun ω => lintegral_mono fun s => hpt s ω
_ = ENNReal.ofReal B ^ 2 * ∫⁻ ω, ∫⁻ s in Set.Icc (0 : ℝ) T',
(‖H ω s‖₊ : ℝ≥0∞) ^ 2 ∂volume ∂P := by
rw [← MeasureTheory.lintegral_const_mul' _ _ hne]
exact lintegral_congr fun ω => MeasureTheory.lintegral_const_mul' _ _ hne
_ < ⊤ := ENNReal.mul_lt_top (lt_top_iff_ne_top.mpr hne) (hq T' hT')
end Ito
end Brownian
end LevyStochCalc