Lean proof of the critical-family classification

What Lean checks

All twelve example values and both critical-family reductions are checked. The unconditional four-speed gap theorem is proved: below 2/9, precisely the two scaled critical directions occur, both with value 1/5. This also proves the four-speed runner bound. The unconditional five-speed lower bound L(v) ≥ 1/6 is also proved by Renault’s argument. All 122,880 indexed plane cases and the five-speed coordinate cutoff are checked, and their gap input is now available. The bounded five-speed classification remains open.

The two critical families in PROOF.md now have a direct Lean proof. The proof does not assume the results of Cordella cited there.

For a finite list of natural-number speeds ds, the formal definitions are

clearance(ds,t)=mind∈ds∥dt∥,value(ds)=sup0≤t≤1clearance(ds,t).\mathop{\mathrm{clearance}}(ds,t)=\min_{d\in ds}\|dt\|, \qquad \mathop{\mathrm{value}}(ds)=\sup_{0\le t\le1}\mathop{\mathrm{clearance}}(ds,t).

Here ∥x∥\|x\| is the distance from the real number xx to the nearest integer. The empty-list clearance is defined as 1/21/2; the classification concerns lists of length five.

Statement

Loneliness.CriticalFamilies.ContainsCriticalQuadruple ds means that, for some positive natural number dd, the list contains every speed in at least one of

d{1,2,3,4},d{1,3,4,7}.d\{1,2,3,4\},\qquad d\{1,3,4,7\}.

critical_family_classification proves the following. Suppose ds has length five, all its entries are positive, its entries have greatest common divisor one, and it contains a critical quadruple. Then

value(ds)≥15or∃s≥1,value(ds)=s5s+1.\mathop{\mathrm{value}}(ds)\ge\frac15 \quad\text{or}\quad \exists s\ge1,\quad \mathop{\mathrm{value}}(ds)=\frac{s}{5s+1}.

The corollary critical_family_below_threshold takes the additional hypothesis value(ds)<1/5\mathop{\mathrm{value}}(ds)<1/5 and concludes the displayed exact formula. Distinctness is not required by these Lean theorems. They therefore apply, in particular, to the five distinct speeds required by the paper.

The proof has three source files:

Source Main contents
LonelinessCriticalBase.lean Integer periodicity, permutation invariance, the modular witness, and extraction of the fifth speed
LonelinessCriticalSecond.lean Exact values for {1,3,4,7,5s}\{1,3,4,7,5s\}
LonelinessCriticalFamilies.lean The classification of both primitive critical families

Nontrivial dilations have value at least one fifth

After permutation, a list containing a critical quadruple has the form

dQ∪{a},Q∈{{1,2,3,4},{1,3,4,7}}.dQ\cup\{a\},\qquad Q\in\bigl\{\{1,2,3,4\},\{1,3,4,7\}\bigr\}.

Primitivity implies gcd(a,d)=1\gcd(a,d)=1. The proof establishes this from divisibility of the list's iterated greatest common divisor. It does not assume a separate normal-form theorem.

Suppose d≥2d\ge2. Choose the smallest integer n≥dn\ge d congruent to aa modulo five. Then

d≤n≤d+4≤4d.d\le n\le d+4\le4d.

Write n=a+5δn=a+5\delta. Bézout's identity supplies integers j,kj,k such that

aj=δ+dk.aj=\delta+dk.

At the real time

t=5j+15d,t=\frac{5j+1}{5d},

the four base speeds satisfy

dmt=mj+m5,m∈Q.dm\,t=mj+\frac m5,\qquad m\in Q.

Every entry of either quadruple is nonzero modulo five, so these four distances are at least 1/51/5. The fifth speed satisfies

at−k=n5d∈[15,45],at-k=\frac{n}{5d}\in\left[\frac15,\frac45\right],

and its distance is also at least 1/51/5. Integer periodicity moves this witness into the unit interval. The relevant declarations are modular_witness, fifth_of_dilation, and le_value_any.

When d=1d=1 and 5∤a5\nmid a, the single time t=1/5t=1/5 gives the same bound. Thus a critical-family list below the threshold must have d=1d=1 and a=5sa=5s for some positive integer ss.

Exact values in the two remaining families

The first family is proved in LonelinessFiveFamily.lean:

value([1,2,3,4,5s])=s5s+1(s≥1).\mathop{\mathrm{value}}([1,2,3,4,5s])=\frac{s}{5s+1} \qquad(s\ge1).

The new theorem second_family_value proves

value([1,3,4,7,5s])=s5s+1(s≥2).\mathop{\mathrm{value}}([1,3,4,7,5s])=\frac{s}{5s+1} \qquad(s\ge2).

Set r=s/(5s+1)r=s/(5s+1). Then 2/11≤r<1/52/11\le r<1/5, and the time t=rt=r attains clearance at least rr. For the upper bound, the following successive cases cover the half-period. Each row identifies an integer kk within distance rr of the indicated speed multiplied by tt.

Time interval Speed Integer kk
0≤t≤r0\le t\le r 11 00
r<t≤(1−r)/4r\lt t\le(1-r)/4 5s5s ss
(1−r)/4<t≤(1+r)/4(1-r)/4\lt t\le(1+r)/4 44 11
(1+r)/4<t≤(1+r)/3(1+r)/4\lt t\le(1+r)/3 33 11
(1+r)/3<t≤(3−r)/7(1+r)/3\lt t\le(3-r)/7 5s5s 2s2s
(3−r)/7<t≤(3+r)/7(3-r)/7\lt t\le(3+r)/7 77 33
(3+r)/7<t≤1/2(3+r)/7\lt t\le1/2 44 22

Reflection, t↦1−tt\mapsto1-t, proves the upper bound on the remaining half-period. All interval inequalities are proved in Lean from (5s+1)r=s(5s+1)r=s and the stated bounds on rr.

The case s=1s=1 has a different value:

value([1,3,4,7,5])=211.\mathop{\mathrm{value}}([1,3,4,7,5])=\frac2{11}.

second_family_one_value proves this with a thirteen-interval exact rational cover and the attaining time 5/115/11. The certificate is checked by the generic real-time certificate theorem, which proves the upper bound for every real time. Since 2/11=2/(5⋅2+1)2/11=2/(5\cdot2+1), this case also has the required spectrum form.

Scope and validation

This proves both critical-family inputs used in the five-speed spectrum argument. It does not prove the classification outside these families, the external norm bound, or the exhaustiveness of the twelve sporadic examples.

The files use the repository's pinned Lean 4.35.0 and Mathlib manifest. From the repository root, the relevant commands are:

cd lean
lake build Conjectures.LonelinessCriticalFamilies
lake env leanchecker Conjectures.LonelinessCriticalBase
lake env leanchecker Conjectures.LonelinessCriticalSecond
lake env leanchecker Conjectures.LonelinessCriticalFamilies

The main declarations depend only on Lean's standard propext, Classical.choice, and Quot.sound axioms. There are no unfinished proofs, custom mathematical axioms, or native-computation axioms in these proofs.