Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Brownian motion relative to a filtration

Definition
KLSModular_LevyStochCalc_Brownian_Filtered

by Lazyfill · Oct 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

functional-inequalitiesklskls-conjecturekls-modularlog-concavemodule-contextvendored-levystochcalc

Vendored from LevyStochCalc, repository https://github.com/cgarryZA/LevyStochCalc, commit 984dbf0b790031eac05d56fe5a84b65e15e1e932. IsBrownianFiltration W ℱ requires that every W t is measurable with respect to ℱ t and that, for each 0 ≤ s, ℱ s is independent of the supremum σ-algebra generated by all increments W t − W s with t > s. The theorem IsBrownianFiltration.indep derives independence for one increment, and stronglyMeasurable gives strong measurability of each time slice. The conditional-expectation results state that an increment after s has conditional expectation zero and that, for 0 ≤ s ≤ t, the conditional expectation of W t given ℱ s equals W s almost everywhere.

Original module imports

import LevyStochCalc.Brownian.FutureIndependence
import LevyStochCalc.Brownian.MartingaleCondExp
import LevyStochCalc.Probability.ComapTuple
import LevyStochCalc.Probability.IndepJoin
import LevyStochCalc.Probability.IndepLimit

Original declaration excerpt

Shown in the original module context.

structure IsBrownianFiltration (W : BrownianMotion P) (ℱ : Filtration ℝ ‹MeasurableSpace Ω›) :
    Prop where
  measurable : ∀ t, Measurable[ℱ t] (W.W t)
  indep_future : ∀ ⦃s : ℝ⦄, 0 ≤ s →
    Indep (ℱ s) (⨆ t ∈ Set.Ioi s,
      MeasurableSpace.comap (fun ω => W.W t ω - W.W s ω) inferInstance) P

Module navigation

Direct project imports: LevyStochCalc/Brownian/FutureIndependence, LevyStochCalc/Brownian/MartingaleCondExp, LevyStochCalc/Probability/ComapTuple, LevyStochCalc/Probability/IndepJoin, LevyStochCalc/Probability/IndepLimit.

Theorems in source order:

  • IsBrownianFiltration.rightCont

Project result: The KLS conjecture.

Original module · LevyStochCalc.Brownian.Filtered · Frozen source 408915f.

Definition code
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_FutureIndependence
import Definitions.Def_KLSModular_LevyStochCalc_Brownian_MartingaleCondExp
import Definitions.Def_KLSModular_LevyStochCalc_Probability_ComapTuple
import Definitions.Def_KLSModular_LevyStochCalc_Probability_IndepJoin
import Definitions.Def_KLSModular_LevyStochCalc_Probability_IndepLimit

/-
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/Filtered.lean; Apache-2.0; provenance in formalization/vendor/vendor-lock.json of the KLS repository)
open MeasureTheory ProbabilityTheory Filter Topology
namespace LevyStochCalc
namespace Brownian
universe u
variable {Ω : Type u} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
/-- `W` is a Brownian motion for the filtration `ℱ`: it is adapted, and for `0 ≤ s` the
σ-algebra `ℱ s` is independent of the σ-algebra generated by the increments `W t − W s`,
`t > s`. -/
structure IsBrownianFiltration (W : BrownianMotion P) (ℱ : Filtration ℝ ‹MeasurableSpace Ω›) :
    Prop where
  measurable : ∀ t, Measurable[ℱ t] (W.W t)
  indep_future : ∀ ⦃s : ℝ⦄, 0 ≤ s →
    Indep (ℱ s) (⨆ t ∈ Set.Ioi s,
      MeasurableSpace.comap (fun ω => W.W t ω - W.W s ω) inferInstance) P
/-- The σ-algebra `ℱ s` is independent of a single increment `W t − W s`, `0 ≤ s < t`. -/
theorem IsBrownianFiltration.indep {W : BrownianMotion P}
    {ℱ : Filtration ℝ ‹MeasurableSpace Ω›} (h : IsBrownianFiltration W ℱ) :
    ∀ ⦃s t : ℝ⦄, 0 ≤ s → s < t →
      Indep (ℱ s) (MeasurableSpace.comap (fun ω => W.W t ω - W.W s ω) inferInstance) P :=
  fun _ t hs hst => indep_of_indep_of_le_right (h.indep_future hs)
    (le_iSup₂_of_le t (Set.mem_Ioi.mpr hst) le_rfl)
namespace IsBrownianFiltration
variable {W : BrownianMotion P} {ℱ : Filtration ℝ ‹MeasurableSpace Ω›}
/-- `W_t` is `ℱ t`-strongly measurable. -/
theorem stronglyMeasurable (h : IsBrownianFiltration W ℱ) (t : ℝ) :
    StronglyMeasurable[ℱ t] (W.W t) :=
  (h.measurable t).stronglyMeasurable
/-- The conditional expectation of the increment `W_t − W_s`, `0 ≤ s < t`, given `ℱ s`
vanishes. -/
theorem condExp_increment_eq_zero (h : IsBrownianFiltration W ℱ) {s t : ℝ} (hs : 0 ≤ s)
    (hst : s < t) : P[(fun ω => W.W t ω - W.W s ω) | ℱ s] =ᵐ[P] fun _ => 0 :=
  Martingale.condExp_increment_eq_zero_of_indep W ℱ hs hst (h.indep hs hst)
/-- The martingale identity `E[W_t | ℱ s] = W_s` for `0 ≤ s ≤ t`. -/
theorem condExp_eq (h : IsBrownianFiltration W ℱ) {s t : ℝ} (hs : 0 ≤ s) (hst : s ≤ t) :
    P[W.W t | ℱ s] =ᵐ[P] W.W s := by
  have h_int_s := Martingale.brownianMotion_integrable W s
  rcases hst.eq_or_lt with rfl | hlt
  · rw [condExp_of_stronglyMeasurable (ℱ.le s) (h.stronglyMeasurable s) h_int_s]
  · have h_int_t := Martingale.brownianMotion_integrable W t
    have h_decomp : (W.W t : Ω → ℝ) = W.W s + (W.W t - W.W s) := by
      funext ω; simp
    rw [h_decomp]
    filter_upwards [condExp_add h_int_s (h_int_t.sub h_int_s) (ℱ s),
      h.condExp_increment_eq_zero hs hlt] with ω h_add h_zero
    rw [h_add, Pi.add_apply,
      condExp_of_stronglyMeasurable (ℱ.le s) (h.stronglyMeasurable s) h_int_s]
    change W.W s ω + P[(fun ω => W.W t ω - W.W s ω) | ℱ s] ω = W.W s ω
    rw [h_zero, add_zero]
end IsBrownianFiltration
end Brownian
end LevyStochCalc
Source
Lean source: https://github.com/cgarryZA/LevyStochCalc/blob/984dbf0b790031eac05d56fe5a84b65e15e1e932/LevyStochCalc/Brownian/Filtered.lean#L32-L159 (repository human-ai-mathematics/kls-lean, commit 408915f, module `LevyStochCalc.Brownian.Filtered`, definition bundle `KLSModular_LevyStochCalc_Brownian_Filtered`; 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).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me