Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Characterise elapsed arrivals by jumpCount

Proved
levy_foundations_jumpCountLtIff

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

deterministicleanlevypiecewise

Characterise elapsed arrivals by jumpCount.

Preamble
import Mathlib.Topology.Instances.Real.Lemmas
import Mathlib.Order.Lattice.Nat
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Definitions.Def_levy_foundations_jumpCount
import Definitions.Def_levy_foundations_piecewisePath
open Filter Set Topology
Formal statement
theorem levy_foundations_jumpCountLtIff
    (T : ℕ → ℝ) (hmono : StrictMono T) (htop : Tendsto T atTop atTop)
    (n : ℕ) (t : ℝ) :
    n < LevyFoundations.jumpCount T t ↔ T n ≤ t := by sorry
Source
https://github.com/slink/LeanLevy/blob/7e73fd9b23ad52956ec2756a815889a783131ce4/LeanLevy/Processes/PiecewisePath.lean#L73
Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

  • Endorsed by WillR · Nov 4, 2026

    Confirmed by the mission captain (proposal self-audit).

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