Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Zero reflected-supremum value from pathwise non-monotonicity and infinite scale slope

Proved
AvramDividend.Classical.zero_reflectedSupValue_of_ae_no_local_monotone_and_deriv_top

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

avram-classicalinfinite-activityreflected-supremumstochastic-regularityzero-barrier

If almost every spectrally negative Lévy path is non-monotone on every interval [0,ε], then the first strictly positive drawdown occurs at time zero. The stopped Stieltjes dividend reward is therefore zero. If the scale function right derivative at zero is positive infinity, the corresponding totalised zero-barrier scale candidate is also zero. This proves a reusable conditional branch of the full zero-reflected-supremum identity, including bounded-variation infinite-activity situations once path regularity and scale-slope divergence are established.

Preamble
import Theorems.Thm_AvramDividend_Classical_barrierRuinTime_zero_of_no_local_monotone_path
import Theorems.Thm_AvramDividend_Classical_barrierSupValue_zero_of_ae_instant_ruin
import Theorems.Thm_AvramDividend_Classical_barrierValue_zero_of_derivZeroPlus_top

open AvramDividend.Classical MeasureTheory Set
open scoped NNReal ENNReal
Formal statement
namespace AvramDividend.Classical

/-- The instant-ruin zero-barrier branch whenever the scale normaliser is infinite. -/
theorem zero_reflectedSupValue_of_ae_no_local_monotone_and_deriv_top
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕)
    (q : ℝ) (W : ℝ → ℝ)
    (hNoMono : ∀ᵐ ω ∂P, ∀ ε : ℝ≥0, 0 < ε →
      ¬ MonotoneOn (fun t : ℝ≥0 => X.X t ω) (Icc 0 ε))
    (hder : derivZeroPlus W = ⊤) :
    barrierSupValue X 0 q = ENNReal.ofReal (barrierValue W 0 0) := by sorry

end AvramDividend.Classical
Source
Avram, Palmowski and Pistorius (2007), Proposition 1, zero barrier case following (3.13), https://arxiv.org/pdf/math/0702893

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