Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Actual infinite-activity BV reflected zero-barrier strict survival is null at every positive horizon

Proved
AvramDividend.Classical.avram_ws01e_bt_new_bv_infinite_activity_strict_survival_null_all_positive

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

For an actual spectrally negative Lévy process X satisfying Standing, bounded variation and infinite negative-jump activity, and every strictly positive nonnegative-real time horizon T, prove that the original probability P of the event T < barrierRuinTime X 0 is zero. Use real physical drift positivity, source-faithful uniform mesh surviving-deficit bounds, the positive-rate BV exponent asymptotic, and the already accepted null-survival-from-bounds theorem. This remains a theorem about the actual reflected process; there is no artificial Poisson jump-count assumption, external independence or extra integrability hypothesis.

Preamble
import Theorems.Thm_AvramDividend_Classical_avram_ws01e_bt_new_bv_mesh_grid_calibration
import Theorems.Thm_AvramDividend_Classical_avram_ws01e_bt_new_bv_actual_uniform_mesh_survival_bound
import Theorems.Thm_AvramDividend_Classical_bv_infinite_activity_strict_survival_null_of_mesh_bounds
import Theorems.Thm_AvramDividend_Classical_bv_actual_survival_deficit_integrable
import Theorems.Thm_AvramDividend_Classical_bv_standing_drift_pos
import Mathlib.Order.Filter.Tendsto

open AvramDividend.Classical MeasureTheory Set Filter
open scoped NNReal ENNReal
Formal statement
theorem AvramDividend.Classical.avram_ws01e_bt_new_bv_infinite_activity_strict_survival_null_all_positive
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕)
    (hStanding : X.Standing) (hBV : X.BoundedVariation)
    (hInfinite : ¬ X.ν (Iio (0 : ℝ)) < ⊤) :
    ∀ T : ℝ≥0, 0 < T →
      P {ω : Ω | (T : ℝ≥0∞) < barrierRuinTime X 0 ω} = 0 := by sorry

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