Solved conjectures

Proofs, counterexamples, and partial results in combinatorics and number theory, with reproducible checks and Lean 4 formalizations.

29 research entries · 17 stated results formalized in Lean · 11 partial formalizations · 1 not formalized

Lonely runners

Six-speed Loneliness Spectrum Conjecture

The values below 1/6 are exactly (P−1)/(6P) for P ≥ 7 congruent to ±1 modulo 6. Cordella’s nine sporadic sextuples exhaust the exceptions to the three known families. Lean verifies realization of every proposed value by six distinct positive primitive speeds; actual rational-lattice, Gram and integer-factor components are proved, and the registered norm wrappers use the proved four-speed bound and retain hplane. Universal classification remains incomplete. Lean also proves the conditional two-parameter radius estimate; the finite plane enumeration remains incomplete.
Lean: partial formalization
Lonely runners

Five-speed Loneliness Spectrum Conjecture

The values below 1/5 are exactly s/(5s+1) for positive integers s. Cordella’s twelve sporadic primitive quintuples exhaust the exceptions to the two known families. Lean verifies the lower bound 1/6 and both primitive tight-five directions; the full spectrum classification remains incomplete.
Lean: partial formalization
Number theory, packing and partitions

Two-difference Motzkin density

The exact character formula for every pair in every compact abelian group, including noncyclic finite subgroups. Lean verifies the exhaustive relation-basis classification, compact and cyclic formulas, exact evaluator with explicit complexity bounds, and literal attaining witnesses. The cyclic maximum-independent-set problem has a prior 2026 solution.
Lean: formalized stated result
Solitaire and combinatorial games

CUT Family B: nim-sequence threshold

Ellis–Thanatipanonda (2022), Conj. 2: nim-sequence matches the base game iff the least odd cut above 1 exceeds three times the least even cut.
Lean: formalized stated result
Graph theory and discrete geometry

Erdős Problem 607: line-size sets

Sharp counting asymptotic for records of actual finite real-plane configurations, with the exact leading prefactor. Lean verifies the geometric count, formal and analytic generating functions, Fourier extraction, all limit and domination inputs, and the final stated asymptotic.
Lean: formalized stated result
Number theory, packing and partitions

Batista's Egyptian fractions

OEIS A398581: the lexicographically first triple uniquely maximizes the last denominator for admissible k ≢ 1 (mod 5).
Lean: formalized stated result
CombinatoricsPartial result on an open problem

Frankl’s union-closed sets conjecture — two classes of generating families

Frankl’s conjecture (partial). Generators supported in four consecutive positions of a common cyclic order guarantee an abundant point. For uniform generators with every point in three generators and incidence girth at least 16, each point occurs in at least 51.8208% of the unions. · · Both all-point frequency bounds are fully Lean-verified; the cyclic span-four formalization remains incomplete. Checked scope.

Lean: partial formalization
Lonely runnersPartial result on an open problem

Lonely Runner — inserting two speeds into tight families

Lonely Runner (partial). Two arbitrary positive integer speeds can be added to any Goddyn–Wong simultaneous acceleration. The proof gives a prescribed interval for the common witness and an obstruction to the corresponding three-speed assertion. · The complete insertion note is Lean-verified, including the unbounded speeds, acceleration criterion, common-dilation value bound, and literal three-insertion obstruction. Checked scope.

Lean: formalized stated result
Graph theory and discrete geometryPartial result on an open problem

Erdős–Gyárfás — a sharp bound for abelian covers of a subdivided tetrahedron

Erdős–Gyárfás (partial). Every abelian cover of K_4 with one edge subdivided has a cycle of length 4, 8, 16 or 32. A 19-sheeted cyclic example attains the upper bound. The universal voltage-cover theorem, literal 95-vertex sharpness example, and normalization of all seven voltages are Lean-verified. Lean scope.

Lean: formalized stated result
CombinatoricsPartial result on an open problem

Hadamard order 2396 — partial results

Hadamard existence conjecture, order 2396 (open). The signed automorphism group of any candidate matrix has order coprime to 479. The fixed-border common multiplier group is cyclic of order dividing four, with at least 151 sign orbits. Lean verifies these statements, both norm-obstruction proofs, the complete conditional fixed-border construction from its original four sign rows, all fourteen size-149 baseline patterns, and the length-598 order-eleven obstruction. Lean also constructs the actual Hadamard matrix from any Legendre pair and proves the invariant quotient transport from the original centered rows. The order and orbit theorems for odd automorphism subgroups on groups of order nine are also checked. For length-1197 Legendre pairs, Lean proves that the common-multiplier order divides 27; the stated sharper bound of nine and the exhaustive quotient/no-lift certificates remain pending. No order-2396 matrix existence is claimed. Checked scope and receipts · · Sequence proof · .

Lean: partial formalization