Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One active half-phase blocker and one non-half-phase blocker escape

Proved
LonelyRunner.SharedSlowestHalf.strict_of_half_and_nonhalf

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. For finite sets R,W⊆NR,W\subseteq\mathbb NR,W⊆N, let S(n,R,W)={v∈N:0<v<n, v∉R}∪WS(n,R,W)=\{v\in\mathbb N:0<v<n,\ v\notin R\}\cup WS(n,R,W)={v∈N:0<v<n, v∈/R}∪W. A strict time means a real ttt such that d(vt)>1/nd(vt)>1/nd(vt)>1/n for every v∈S(n,R,W)v\in S(n,R,W)v∈S(n,R,W). Let n,r,m,Q,w∈Nn,r,m,Q,w\in\mathbb Nn,r,m,Q,w∈N with r≥7r\ge7r≥7, r+2≤n≤2rr+2\le n\le2rr+2≤n≤2r, m>0m>0m>0, r∈Rr\in Rr∈R, n<m(n−r)n<m(n-r)n<m(n−r), and mr<Qmr<Qmr<Q. Assume r∣2Qr\mid2Qr∣2Q, r∤Qr\nmid Qr∤Q, r∤2wr\nmid2wr∤2w, and d(1/2−Q/(nmr))≤1/nd(1/2-Q/(nmr))\le1/nd(1/2−Q/(nmr))≤1/n. Then S(n,R,{mr,Q,w})S(n,R,\{mr,Q,w\})S(n,R,{mr,Q,w}) has a strict time. No upper bound or ordering is imposed on www.

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.SharedSlowestHalf
open CollectiveSecondFastest CollectiveUnits BadCover

/-- An active half-phase blocker and any non-half-phase blocker leave a strict
time; the latter's speed may be arbitrarily large. -/
theorem LonelyRunner.SharedSlowestHalf.strict_of_half_and_nonhalf {n r m Q w : ℕ} {R : Finset ℕ}
    (hr : 7 ≤ r) (hrmax : r+2 ≤ n) (hm : 0 < m)
    (hrR : r ∈ R) (hlarge : n ≤ 2*r) (hfull : n < m*(n-r))
    (hpQ : m*r < Q) (hd : r ∣ 2*Q) (hnQ : ¬r ∣ Q)
    (hnw : ¬r ∣ 2*w)
    (hband : ndist (1/2-((Q:ℝ)/((m:ℝ)*r))/(n:ℝ)) ≤ 1/(n:ℝ)) :
    SeparatedMulti.HasStrictTime n R {m*r,Q,w} := by sorry
Source
Wade Hunter, lonely-runner research repository, https://github.com/huntrontrakkr/lonely-runner; local source snapshot 9b5f51aa235e321a3ec794c9bf60358933a8e6dc, lean/LonelyRunner/SharedSlowestHalf.lean, lines 113–197, declaration LonelyRunner.SharedSlowestHalf.strict_of_half_and_nonhalf. 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