Natalchenko–Sagdeev nonmixed-gap packing

What Lean checks

The exact three-case packing and real circle formula for every positive gap pair and arbitrary positive gap counts, including gcd normalization, literal tile semantics, periodic attainment, and the stated example.

Collection · Catalogue · Verification · Lean status

Result

Natalchenko–Sagdeev’s main packing conjecture for arbitrary gap counts. The same formula gives the circle parameter in their Section 4 question.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/nonmixed-gap-packing/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

The complete three-case formula for positive coprime steps and arbitrary positive gap counts is formalized. It proves both the supremum of packing densities and the actual real circle maximum, with periodic attainment and literal tile semantics. Common-divisor normalization is proved. The full stated result passed source compilation, axiom audit, and independent kernel replay. See the checked Lean scope and the status report.