Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A running maximum does not increase while the underlying path remains below its preceding record

Proved
AvramDividend.Classical.raw_runningSup_constant_of_future_below_previous_max

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

avram-classicalexcursionslocal-timeregulatorrunning-supremumstieltjes

Let f be any real-valued nonnegative-time path with bounded range above on [0,v], and fix times u≤v. If every value of f on [u,v] is bounded by the previous running supremum M_u=sup_{0≤s≤u}f(s), then the running supremum at v is still exactly M_u. This records a necessary pathwise property of the actual reflected Lévy local-time regulator S=runningSup X: future intervals with no new record carry no regulator increase. Together with right continuity of X, a positive drawdown S_u−X_u>0 provides a short interval of this form, and hence is a first step towards showing that the Lebesgue–Stieltjes record measure dS is supported (measure-theoretically) on the zero set of the reflected process. The latter support and the characteristic sigma-finite excursion measure are not yet claimed.

Preamble
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy
import Mathlib.Order.ConditionallyCompleteLattice.Basic
import Mathlib.Order.Interval.Set.Basic

open AvramDividend.Classical Set
open scoped NNReal
Formal statement
theorem AvramDividend.Classical.raw_runningSup_constant_of_future_below_previous_max
    (f : ℝ≥0 → ℝ) (u v : ℝ≥0) (huv : u ≤ v)
    (hb : BddAbove (f '' Icc 0 v))
    (hBelow : ∀ t : ℝ≥0, u ≤ t → t ≤ v →
      f t ≤ sSup (f '' Icc 0 u)) :
    sSup (f '' Icc 0 v) = sSup (f '' Icc 0 u) := by sorry
Source
Elementary compact running-supremum order bounds in pinned Mathlib.Order.ConditionallyCompleteLattice.Basic and AvramDividend.Classical.runningSup_split_at.

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