One active half-phase blocker and one non-half-phase blocker escape
ProvedLonelyRunner.SharedSlowestHalf.strict_of_half_and_nonhalfformalizationlonely-runnerlrc-shared-repair-20261007number-theory
Write for distance to the nearest integer. For finite sets , let . A strict time means a real such that for every . Let with , , , , , and . Assume , , , and . Then has a strict time. No upper bound or ordering is imposed on .
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.