Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strict lower passage clock is bounded by a downcrossing of the negative initial-reserve gap

Proved
AvramDividend.Classical.twoSidedExitDownTime_le_of_strict_lower_gap_observed

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

avram-dividendcorrected-thresholdstopping-timestrict-downcrossingtwo-sided-exit

If the centred Lévy process has fallen below the level -x at observation time s, its canonical strict lower first-passage clock with threshold -x is no later than s. The threshold argument is deliberately -x, matching the process-side inequality exactly. This corrects a prior mis-specified auxiliary clock statement that used threshold x and was mathematically false without an extra order hypothesis.

Preamble
import Definitions.Def_AvramDividend_Classical_TwoSidedExit
import Mathlib.Data.ENNReal.Basic

open AvramDividend.Classical MeasureTheory Set
open scoped NNReal ENNReal
Formal statement
theorem AvramDividend.Classical.twoSidedExitDownTime_le_of_strict_lower_gap_observed
    {Ω : Type*} [mΩ : MeasurableSpace Ω]
    {P : Measure Ω} {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕)
    (x : ℝ) (ω : Ω) (s : ℝ≥0)
    (hs : X.X s ω < -x) :
    twoSidedExitDownTime X (-x) ω ≤ (s : ℝ≥0∞) := by sorry
Source
Definition of twoSidedExitDownTime as nested infimum over crossing instants; order bounds for nested indexed infima.

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