Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Null zero atom of every genuine finite-horizon running infimum forces almost-sure immediate downward regularity

Proved
AvramDividend.Classical.levy_negative_near_zero_of_fixed_infimum_no_atom_ws01f

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

avram-classicalendpoint-bridgerogozin-regularityrunning-infimumws01fzero-atom

For an actual spectrally negative Lévy process, if the negative running infimum over every strictly positive deterministic horizon has no atom at zero under its original probability measure, then almost every path enters the negative half-line before every positive horizon. A countable cofinal deterministic time grid ensures the a.e.-all quantifier. This is a precise pathwise bridge for the future exponential-clock Wiener–Hopf zero-atom route, without claiming that the missing atomlessness itself follows from infinite jumps.

Preamble
import Mathlib
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy
import Theorems.Thm_AvramDividend_Classical_chat04_negative_running_infimum_nonneg
import Theorems.Thm_AvramDividend_Classical_chat04_reflected_infimum_Iic_iff_survival

open Filter Topology MeasureTheory Set
open scoped NNReal ENNReal
open AvramDividend.Classical
Formal statement
theorem AvramDividend.Classical.levy_negative_near_zero_of_fixed_infimum_no_atom_ws01f
    {Ω : Type*} [mΩ : MeasurableSpace Ω]
    {P : Measure Ω} {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕)
    (hAtom : ∀ (t : ℝ≥0), 0 < t →
      P {ω : Ω |
        -sInf {y : ℝ | ∃ s : ℝ≥0, s ≤ t ∧ y = X.X s ω} = 0} = 0) :
    ∀ᵐ ω ∂P, ∀ (ε : ℝ≥0), 0 < ε →
      ∃ s : ℝ≥0, s < ε ∧ X.X s ω < 0 := by sorry
Source
Proved chat04_negative_running_infimum_nonneg and chat04_reflected_infimum_Iic_iff_survival, measure_eq_zero_iff_ae_notMem, countable a.e. intersection, and the 1/(n+1) time grid.

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