Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Malikiosis–Santos–Schymura finite checking

Open
LonelyRunnerConjecture.mss_finite_checking

by LG · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsdiophantine-approximationnumber-theory

Assume the conjecture for nnn runners (LRC(n−1)\mathrm{LRC}(n-1)LRC(n−1)). Then it holds for n+1n+1n+1 runners with positive integer speeds v1,…,vnv_1,\dots,v_nv1​,…,vn​ satisfying gcd⁡(v1,…,vn)=1\gcd(v_1,\dots,v_n)=1gcd(v1​,…,vn​)=1 and ∑S⊆[n]vS>(n+12)n−1\sum_{S\subseteq[n]} v_S > \binom{n+1}{2}^{n-1}∑S⊆[n]​vS​>(2n+1​)n−1, where vS=gcd⁡(vi:i∈S)v_S=\gcd(v_i:i\in S)vS​=gcd(vi​:i∈S). 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 LonelyRunnerConjecture
Source
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
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me