Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Actual BV Lévy origin dyadic deficit slopes converge to zero almost surely

Proved
AvramDividend.Classical.bv_actual_origin_dyadic_deficit_zero_ae_ws01c

by WillR · Oct 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

almost-sure-convergenceavram-classicalbounded-variationdyadic-zero-slopews01c

For the actual bounded-variation spectrally negative Lévy process, the entire sequence of dyadic residual slopes d−(X_(2^(-n))−X_0)/2^(-n) converges almost surely to zero. This is the correct Cauchy upgrade: the source-complete Fubini-stationarity theorem gives an almost-sure Cauchy sequence, the actual scaled-tail theorem gives convergence in measure, and the already Proved Cauchy-plus-in-measure limit theorem yields the full almost-sure zero limit. This avoids the false inference of almost-sure convergence from convergence in probability alone.

Preamble
import Mathlib
import Theorems.Thm_AvramDividend_Classical_bv_actual_origin_dyadic_cauchy_ae_ws01c
import Theorems.Thm_AvramDividend_Classical_bv_actual_dyadic_slope_tendstoInMeasure_zero_ws01c
import Theorems.Thm_AvramDividend_Classical_bv_ae_cauchy_plus_in_measure_bundle_ws01c

open MeasureTheory Filter Topology AvramDividend.Classical
open scoped NNReal
Formal statement
theorem AvramDividend.Classical.bv_actual_origin_dyadic_deficit_zero_ae_ws01c
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {ℱ : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P ℱ) (hBV : X.BoundedVariation) :
    ∀ᵐ ω ∂P,
      Tendsto (fun n : ℕ =>
        X.drift -
          (X.X (((1 : ℝ≥0) / 2) ^ n) ω - X.X 0 ω) /
            (((1 : ℝ≥0) / 2) ^ n : ℝ))
        atTop (𝓝 (0 : ℝ)) := by sorry
Source
Source-complete WS01C origin zero-slope formalisation assembled from work/avram_ws01c_origin_zero_slope_full_assembly_draft.lean. Invokes existing canonical Proved Cauchy-plus-measure theorem eb4d928e, plus two newly submitted specific actual-process intermediate targets.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me