triangular_lattice
def
The triangular lattice with spacing d in the complex plane is the set of points of the form d * (a + b * eisensteinOmega) for integers a and b, where eisensteinOmega is the primitive cube root of unity (-1 + i * √3)/2.
Statement
def triangular_lattice (d : ℝ) : Set ℂ- Defined in
- arXiv:2611.13535, Section 2
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Built on 1
- eisensteinOmegaThe primitive cube root of unity ω = (-1 + √(-3))/2 in the complex numbers.
- Used by 4
- 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 /…
- triangular_lattice_coverable_one_div_sqrt_thirteenThe triangular lattice with spacing d = 1 / Real.sqrt 13 is coverable by non-overlapping closed unit disks.
- triangular_lattice_coverable_two_div_sqrt_twenty_oneThe triangular lattice with spacing d = 2 / Real.sqrt 21 is coverable by non-overlapping closed unit disks.
- triangular_lattice_zero_memFor every real number d, the origin 0 belongs to the triangular lattice with spacing d.
Read back from the Lean
triangular_lattice is a function taking a real number d and returning the set of all complex numbers z such that there exist integers a and b satisfying z = d * (a + b * eisensteinOmega).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The triangular lattice in the complex plane with spacing parameter d. -/ def triangular_lattice (d : ℝ) : Set ℂ := {z : ℂ | ∃ a b : ℤ, z = (d : ℂ) * ((a : ℂ) + (b : ℂ) * eisensteinOmega)}