Complementary small fibres of a shared repair force strictness
ProvedLonelyRunner.SharedSlowest.strict_of_complementaryformalizationlonely-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 . Write , , and for the existence of an integer with and . An active fibre for consists of natural numbers with , , , , , , and, for every , if and only if . Let be active fibres for and , and let . Assume , , , , , , , and . If for every , implies , then has a strict time.
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.SharedSlowest
open CollectiveUnits CollectiveSecondFastest CollectiveFibreNormalForm
/-- The two complementary small-fibre branches have a full strict-time proof,
including the low-totient table and the possible small-baseline handoff. -/
theorem LonelyRunner.SharedSlowest.strict_of_complementary {n r s m k q u : ℕ} {R : Finset ℕ}
(F : ActiveFibre n r m q) (G : ActiveFibre n r m u)
(hr : 7 ≤ r) (hlarge : n ≤ 2*r) (hrs : r < s) (hsn : s < n)
(hrR : r ∈ R) (hm : 0 < m) (hk : 0 < k) (hshared : m*r=k*s)
(hpq : m*r < q) (hqu : q < u)
(hF : F.h=3 ∨ F.h=4 ∨ F.h=6) (hG : G.h=3 ∨ G.h=4 ∨ G.h=6)
(hcomp : ∀c ∈ units r, CollectiveBoundary.Blocks (n:ℤ) r m u c →
¬CollectiveBoundary.Blocks (n:ℤ) r m q c) :
SeparatedMulti.HasStrictTime n R {m*r,q,u} := by sorry
Source
Wade Hunter, lonely-runner research repository, https://github.com/huntrontrakkr/lonely-runner; local source snapshot 9b5f51aa235e321a3ec794c9bf60358933a8e6dc, lean/LonelyRunner/SharedSlowest.lean, lines 15–68, declaration LonelyRunner.SharedSlowest.strict_of_complementary. AI-assisted formalization. The snapshot identifier records the submitted local source; it is not a claim that this commit is publicly hosted.