Strict inequalities persist after a common half-phase exit
ProvedLonelyRunner.CollectiveSecondFastest.clock_exit_escapeformalizationlonely-runnerlrc-shared-repair-20261007number-theory
Write for distance to the nearest integer. Let , , be finite, and continuous. Assume , , , , , and, for every real , and . If for every , then some satisfies these strict inequalities for all and also for and .
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.