The smallest repair in a separated insertion set obeys its GW window
ProvedLonelyRunner.SeparatedMulti.minimal_multiple_gwformalizationlonely-runnerlrc-component-rigidity-20261007number-theory
Write for distance to the nearest integer. For finite , put . A strict time is a real with for every . Write for the assertion that no natural number with is coprime to . Let with , , , , and . Suppose , every is at least , and distinct satisfy . Assume is no larger than any insertion divisible by . Then
AI-assisted research and formalization. Independent mathematical review and novelty assessment remain outstanding.
Preamble
import Mathlib import Mathlib.NumberTheory.Bertrand import Mathlib.NumberTheory.Primorial import Definitions.Def_LRC_ComponentRigidity_Defs
Formal statement
open LonelyRunner
open LonelyRunner.SeparatedMulti
open SeparatedReplacements SeparatedBands SingleDeletion
set_option maxHeartbeats 1500000 in
theorem LonelyRunner.SeparatedMulti.minimal_multiple_gw {n r m : ℕ} {R W : Finset ℕ}
(hn : 5 ≤ n) (hrR : r ∈ R) (hlarge : n ≤ 2*r) (hrn : r < n)
(hm : 2 ≤ m) (hpW : m*r ∈ W)
(hW : ∀ q ∈ W, n ≤ q) (hsep : Separated n W)
(hmin : ∀ q ∈ W, r ∣ q → m*r ≤ q)
(hno : ¬ HasStrictTime n R W) : GW n r m := by sorry
Source
Wade Hunter, AI-assisted lonely-runner research, https://github.com/huntrontrakkr/lonely-runner; local source snapshot e63781c7cf2101e453103bfd9b215b72d162d05d, lean/LonelyRunner/SeparatedMulti.lean, lines 71–133, declaration LonelyRunner.SeparatedMulti.minimal_multiple_gw. The snapshot identifies the submitted local source, not a publicly hosted commit.