triangular_lattice_coverable_two_div_sqrt_twenty_one
The triangular lattice with spacing d = 2 / Real.sqrt 21 is coverable by non-overlapping closed unit disks.
Statement
theorem triangular_lattice_coverable_two_div_sqrt_twenty_one : is_coverable (triangular_lattice (2 / Real.sqrt 21))- Source
- arXiv:2611.13535 Theorem C -- Covering the Triangular Lattice with Non-Overlapping Unit Disks
- Verified
- 12 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- triangular_latticeThe triangular lattice with spacing d in the complex plane is the set of points of the form d * (a + b * eisensteinOmega) for integers a…
- is_coverableA subset S of the complex plane is coverable by non-overlapping closed unit disks if there exists a set C of disk centers such that ||c -…
- triangular_lattice_coverable_critical_spacingsThe triangular lattice with spacing d is coverable by pairwise non-overlapping closed unit disks for d = 1 / Real.sqrt 13 and for d = 2 /…
Read back from the Lean
There exists a set $C \subseteq \mathbb{C}$ such that: 1. Any two distinct points in $C$ have distance at least 2 from each other (i.e., for all $c, c' \in C$ with $c \ne c'$, $\|c - c'\| \ge 2$), and 2. Every point in the triangular lattice with scale parameter $2 / \sqrt{21}$ is within distance at most 1 from some point in $C$ (i.e., for every $x \in \mathbb{C}$ of the form $\frac{2}{\sqrt{21}}(a + b\omega)$ with $a, b \in \mathbb{Z}$ and $\omega = \frac{-1 + i\sqrt{3}}{2}$, there exists $c \in C$ such that $\|x - c\| \le 1$).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The theorem states that the triangular lattice with spacing d = 2 / √21 can be covered by a family of non-overlapping closed unit disks in the complex plane. This result was already established as the second conjunct of the theorem `triangular_lattice_coverable_critical_spacings`, which proved coverability for both critical spacings 1 / √13 and 2 / √21. The proof immediately concludes by extracting this second component via the projection `.2`.
The triangular lattice with spacing d = 2 / √21 is coverable by non-overlapping closed unit disks.
The result follows immediately by taking the second projection (`.2`) of the previously established conjunction `triangular_lattice_coverable_critical_spacings`, which asserts coverability for spacings 1 / √13 and 2 / √21.
uses
triangular_lattice_coverable_critical_spacings.2theorem triangular_lattice_coverable_two_div_sqrt_twenty_one : is_coverable (triangular_lattice (2 / Real.sqrt 21)) := triangular_lattice_coverable_critical_spacings.2
triangular_lattice_coverable_critical_spacings.2- The triangular lattice with spacing d = 2 / √21 is coverable by non-overlapping closed unit disks (obtained as the second conjunct of `triangular_lattice_coverable_critical_spacings`).
- The proof is given in term mode as a single projection (`.2`), extracting the second conjunct of `triangular_lattice_coverable_critical_spacings` without entering tactic mode.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- The triangular lattice with spacing 2 / √21 is coverable by non-overlapping unit disks. -/theorem triangular_lattice_coverable_two_div_sqrt_twenty_one : is_coverable (triangular_lattice (2 / Real.sqrt 21)) := triangular_lattice_coverable_critical_spacings.2