A failed primitive flank lies in one band of the second insertion
ProvedLonelyRunner.FailedFlank.covered_flank_bandformalizationlonely-runnerlrc-component-rigidity-20261007number-theory
Write for distance to the nearest integer. For finite , put . A strict time is a real with for every . Let and . Assume , , , , , , , and . Suppose has no strict time. Put and . 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.FailedFlank
open Farey BadCover LargeDeletionMatching
set_option maxHeartbeats 1200000 in
theorem LonelyRunner.FailedFlank.covered_flank_band {n r s m b q : ℕ} {a c : ℤ}
(hn : 5 ≤ n) (hlarge : n ≤ 2*r) (hrn : r < n)
(hm : 2 ≤ m) (hmn : m+1 ≤ n) (hq : 0 < q)
(hab : n-r ≤ b) (hfail : b < m*(n-r))
(hunit : a*(b:ℤ)-c*(r:ℤ)=1)
(hno : ¬ HasStrictTime n r s (m*r) q) :
∃ j : ℤ,
|(q:ℝ)*((a:ℝ)/r-1/((n:ℝ)*m*r))-j| ≤ 1/n ∧
|(q:ℝ)*((a:ℝ)/r-((n:ℝ)-r)/((n:ℝ)*r*b))-j| ≤ 1/n := by sorry
Source
Wade Hunter, AI-assisted lonely-runner research, https://github.com/huntrontrakkr/lonely-runner; local source snapshot e63781c7cf2101e453103bfd9b215b72d162d05d, lean/LonelyRunner/FailedFlank.lean, lines 129–218, declaration LonelyRunner.FailedFlank.covered_flank_band. The snapshot identifies the submitted local source, not a publicly hosted commit.