Finite Control Implies Finite Bielecki Norm
ProvedLevyStochCalc.Ito.Picard.bieleckiNorm_lt_top_of_supL2_modularfunctional-inequalitieskls-conjecturekls-modularlog-concavevendored-levystochcalc
This shows that a finite windowwise bound gives a finite Bielecki norm at weight zero.
Let be a probability measure, let , and let . Assume that for every ,
Then
The supremum and integral are represented using ENNReal, and finiteness means strict inequality with . This provides the integrability input needed for Picard-space arguments.
Superseded upload. This snapshot was replaced by LevyStochCalc.Ito.Picard.bieleckiNorm_lt_top_of_supL2_readable: open the readable replacement. The replacement preserves the frozen source and mathematical statement, with a compact declaration context. This historical node remains available for existing imports.
Preamble
import Definitions.Def_KLSModular_LevyStochCalc_Ito_PicardWindow
/-
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/Ito/PicardWindow.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory LevyStochCalc.Probability
open scoped NNReal ENNReal
section
namespace LevyStochCalc
end LevyStochCalc
open LevyStochCalc
section
namespace LevyStochCalc.Ito
end LevyStochCalc.Ito
open LevyStochCalc LevyStochCalc.Ito
section
namespace LevyStochCalc.Ito.Picard
end LevyStochCalc.Ito.Picard
open LevyStochCalc LevyStochCalc.Ito LevyStochCalc.Ito.Picard
universe u v
variable {Ω : Type u} [MeasurableSpace Ω] {E : Type v} [MeasurableSpace E]
variable {P : Measure Ω} [IsProbabilityMeasure P] {n d : ℕ}
omit [MeasurableSpace E]
Formal statement
theorem LevyStochCalc.Ito.Picard.bieleckiNorm_lt_top_of_supL2_modular {T : ℝ} (hT : 0 < T) {Z : ℝ → Ω → (Fin n → ℝ)}
(hS : ∀ T' : ℝ, 0 < T' →
∫⁻ ω, (⨆ t : Set.Icc (0 : ℝ) T', ∑ i, (‖Z (t : ℝ) ω i‖₊ : ℝ≥0∞) ^ 2) ∂P < ⊤) :
bieleckiNorm (P := P) 0 T Z < ⊤ := by sorry
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Ito/PicardWindow.lean#L82-L103 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Ito.PicardWindow`, declaration `LevyStochCalc.Ito.Picard.bieleckiNorm_lt_top_of_supL2`; 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).