Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strict inequalities persist after a common half-phase exit

Proved
LonelyRunner.CollectiveSecondFastest.clock_exit_escape

by Whunt003 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

formalizationlonely-runnerlrc-shared-repair-20261007number-theory

Write d(x)=∣x−round⁡(x)∣d(x)=|x-\operatorname{round}(x)|d(x)=∣x−round(x)∣ for distance to the nearest integer. Let n,P,Q,γ,z0,T∈Rn,P,Q,\gamma,z_0,T\in\mathbb Rn,P,Q,γ,z0​,T∈R, A,J,j∈ZA,J,j\in\mathbb ZA,J,j∈Z, S⊆NS\subseteq\mathbb NS⊆N be finite, and c:R→Rc:\mathbb R\to\mathbb Rc:R→R continuous. Assume n>2n>2n>2, γ>0\gamma>0γ>0, 1≤z0<n−11\le z_0<n-11≤z0​<n−1, γz0=T+1\gamma z_0=T+1γz0​=T+1, T=n(j+1/2)T=n(j+1/2)T=n(j+1/2), and, for every real zzz, Pc(z)=A−z/nPc(z)=A-z/nPc(z)=A−z/n and Qc(z)=J+1/2−γz/nQc(z)=J+1/2-\gamma z/nQc(z)=J+1/2−γz/n. If d(vc(z0))>1/nd(vc(z_0))>1/nd(vc(z0​))>1/n for every v∈Sv\in Sv∈S, then some z>z0z>z_0z>z0​ satisfies these strict inequalities for all v∈Sv\in Sv∈S and also for PPP and QQQ.

Preamble
import Mathlib
import Mathlib.Data.ZMod.Units
import Mathlib.GroupTheory.Index
import Mathlib.RingTheory.Coprime.Lemmas
import Mathlib.RingTheory.Int.Basic
import Definitions.Def_LRC_SharedRepair_Defs
Formal statement
open LonelyRunner
open LonelyRunner.CollectiveSecondFastest
open BadCover

/-- Strict inequalities at finitely many speeds persist on a small rightward
clock interval. Both distinguished runners become safe immediately after the
common exit. -/
theorem LonelyRunner.CollectiveSecondFastest.clock_exit_escape {n P Q gamma z₀ T : ℝ} {A J j : ℤ}
    (S : Finset ℕ) (clock : ℝ → ℝ) (hclock : Continuous clock)
    (hn : 2 < n) (hg : 0 < gamma)
    (hz : 1 ≤ z₀) (hzupper : z₀ < n-1)
    (he : gamma*z₀=T+1) (hT : T=n*((j:ℝ)+1/2))
    (hP : ∀ z, P*clock z=(A:ℝ)-z/n)
    (hQ : ∀ z, Q*clock z=(J:ℝ)+1/2-gamma*z/n)
    (hsafe : ∀ v ∈ S, 1/n < ndist ((v:ℝ)*clock z₀)) :
    ∃ z, z₀ < z ∧ 1/n < ndist (P*clock z) ∧
      1/n < ndist (Q*clock z) ∧ ∀ v ∈ S, 1/n < ndist ((v:ℝ)*clock z) := by sorry
Source
Wade Hunter, lonely-runner research repository, https://github.com/huntrontrakkr/lonely-runner; local source snapshot 9b5f51aa235e321a3ec794c9bf60358933a8e6dc, lean/LonelyRunner/CollectiveSecondFastest.lean, lines 54–118, declaration LonelyRunner.CollectiveSecondFastest.clock_exit_escape. AI-assisted formalization. The snapshot identifier records the submitted local source; it is not a claim that this commit is publicly hosted.

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