lintegral sup rpow edist le of minimal cover two of le one
ProvedProbabilityTheory.lintegral_sup_rpow_edist_le_of_minimal_cover_two_of_le_onecontext-reviewlevystochcalcsource-import
The source theorem ProbabilityTheory.lintegral_sup_rpow_edist_le_of_minimal_cover_two_of_le_one is extracted from BrownianMotion.Continuity.IsKolmogorovProcess. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_BrownianMotion_Continuity_IsKolmogorovProcess_F001
/-
Copyright (c) 2025 Rémy Degenne. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Rémy Degenne
-/
/-!
# Stochastic processes satisfying the Kolmogorov condition
-/
@[expose] public section
open MeasureTheory Metric
open scoped ENNReal NNReal Finset
section Aux
end Aux
namespace ProbabilityTheory
variable {T Ω E : Type*} [PseudoEMetricSpace T] {mΩ : MeasurableSpace Ω}
[PseudoEMetricSpace E]
{p q : ℝ} {M : ℝ≥0} {P : Measure Ω} {X : T → Ω → E}
section Measurability
variable [MeasurableSpace E] [BorelSpace E]
end Measurability
section FirstTerm
variable {J : Set T}
end FirstTerm
section SecondTerm
variable {J : Set T} {C : ℕ → Finset T} {ε : ℕ → ℝ≥0} {j k m : ℕ}
Formal statement
theorem _root_.ProbabilityTheory.lintegral_sup_rpow_edist_le_of_minimal_cover_two_of_le_one (hp : p ≤ 1)
(hX : IsAEKolmogorovProcess X P p q M) {ε₀ : ℝ≥0} (hε : ε₀ ≤ Metric.ediam J)
(hC : ∀ n, IsCover (ε₀ * 2⁻¹ ^ n) J (C n)) (hC_subset : ∀ n, (C n : Set T) ⊆ J)
(hC_card : ∀ n, #(C n) = coveringNumber (ε₀ * 2⁻¹ ^ n) J)
{c₁ : ℝ≥0∞} {d : ℝ} (hdq : d < q)
(h_cov : HasBoundedCoveringNumber J c₁ d)
(hm : m ≤ k) :
∫⁻ ω, ⨆ (t : C k), edist (X t ω) (X (chainingSequence C t k m) ω) ^ p ∂P
≤ 2 ^ d * M * c₁ * (2 * (ε₀ : ℝ≥0∞) * 2⁻¹ ^ m) ^ (q - d) / (2 ^ (q - d) - 1) := by sorry
Source