Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict finite-mesh Lévy drawdown/minimum symmetry from a full-vector reversal law

Proved
AvramDividend.Classical.avram_ws01e_b_strict_grid_path_probability_of_vector_reversal

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

avram-classicalesscherfinite-gridstrict-drawdownwiener-hopf

For a spectrally negative Lévy path and any path measure ν, if ν gives equal mass to every measurable event on n equal-mesh increments and its reversal, then the strict finite-grid terminal drawdown and running-infimum events have equal probabilities. Convert vector symmetry into an invariant pushed-forward law and use the Proved general strict prefix reversal, prefix telescoping and measurability.

Preamble
import Mathlib
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy
import Theorems.Thm_AvramDividend_Classical_avram_ws01e_b_general_strict_prefix_reversal_of_law

open AvramDividend.Classical MeasureTheory Finset Set
open scoped NNReal ENNReal

Formal statement
theorem AvramDividend.Classical.avram_ws01e_b_strict_grid_path_probability_of_vector_reversal
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕) (δ : ℝ≥0) (n : ℕ)
    (ν : Measure Ω) (a : ℝ)
    (hR : ∀ A : Set (Fin n → ℝ), MeasurableSet A →
      ν {ω : Ω | (fun i : Fin n =>
        X.X (((i.rev.val + 1 : ℕ) : ℝ≥0) * δ) ω -
        X.X ((i.rev.val : ℝ≥0) * δ) ω) ∈ A} =
      ν {ω : Ω | (fun i : Fin n =>
        X.X (((i.val + 1 : ℕ) : ℝ≥0) * δ) ω -
        X.X ((i.val : ℝ≥0) * δ) ω) ∈ A}) :
    ν {ω : Ω | ∃ k : Fin n.succ,
      X.X ((n : ℝ≥0) * δ) ω - X.X ((k.val : ℝ≥0) * δ) ω < a} =
    ν {ω : Ω | ∃ k : Fin n.succ,
      X.X ((k.val : ℝ≥0) * δ) ω - X.X 0 ω < a} := by sorry
Source
Proved avram_ws01e_b_general_strict_prefix_reversal_of_law and Lévy adaptedness; source-specific SpectrallyNegativeLevy definition import.

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