← All papers
First page of Tiling an Equilateral Triangle

Tiling an Equilateral Triangle

Michael Beeson

math.CO Dec 17, 2018 · v4 math.HO math.MG
All theorems on equilateral-triangle tilings are formalized in Lean 4 with Mathlib, building on a Lean tiling library, with a public repository.
Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the “tile”) and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known about the possible values of $N$. Here we prove that for $N>3$, $N$ cannot be prime, and study more closely the possible tilings when the tile has a $π/3$ angle. All theorems have been formalized in Lean.

It is known which tile shapes can tile an equilateral triangle, but little is known about which numbers N of congruent tiles are possible. The open cases are tiles with a π/3 or 2π/3 angle whose other angles are not rational multiples of π.

For tiles with a π/3 angle, a black-white coloring equation is combined with the area equation, so that N and the coloring number M determine the tile shape. Tiles with a 2π/3 angle are handled with Laczkovich's directed graph Γ_c. Harries' additive-function argument shows that ab divides the side X and N. All results are formalized in Lean 4 with Mathlib, building on Bonfioli's tiling library and checked with no sorry or native_decide.

For N>3, N cannot be prime. ab divides N, and M²<N for the π/3 case. A table lists candidate tilings not ruled out by these conditions; the code computing it is not formalized. Herdt's new small tilings (N=1215, 1440, 1944) are presented.