Malikiosis–Santos–Schymura finite checking
OpenLonelyRunnerConjecture.mss_finite_checkingcombinatoricsdiophantine-approximationnumber-theory
Assume the conjecture for runners (). Then it holds for runners with positive integer speeds satisfying and , where . This linearly-exponential bound underlies the recent small-case proofs.
Formalization Note The sum runs over Finset.univ.powerset with Finset.gcd ∅ = 0; the bound is Nat.choose (n+1) 2 ^ (n-1). Speeds need not be distinct.
Preamble
import Mathlib import Definitions.Def_LonelyRunnerConjecture_Defs open scoped BigOperators
Formal statement
namespace LonelyRunnerConjecture
theorem mss_finite_checking (n : ℕ) (hn : 1 ≤ n) (h : LRC (n - 1))
(v : Fin n → ℕ) (hpos : ∀ i, 0 < v i)
(hgcd : Finset.gcd Finset.univ v = 1)
(hsum : (∑ S ∈ Finset.univ.powerset, Finset.gcd S v) > Nat.choose (n + 1) 2 ^ (n - 1)) :
∃ t : ℝ, ∀ i, (1 : ℝ) / (n + 1 : ℝ) ≤ distToNearestInt (t * (v i : ℝ)) := by sorry
end LonelyRunnerConjectureSource
R. D. Malikiosis, F. Santos, M. Schymura, Linearly-exponential checking is enough for the LRC, https://arxiv.org/abs/2411.06903, Theorem A.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.