Tilings of an Isosceles Triangle
Michael Beeson
math.MG
Jun 9, 2012 · v9
TL;DR
The paper's tiling results are formalized in Lean 4 with Mathlib, with a public repository and kernel-checked proofs that use no sorry.
Abstract
An N-tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC. In this paper we study the case of isosceles (but not equilateral) ABC. We study three possible forms of the tile: right-angled, or with one angle double another, or with a 120 degree angle. In the case of a right-angled tile, we give a complete characterization of the tilings, and prove that N must be even. In the latter two cases we prove the ratios of the sides of the tile are rational, and give a necessary condition for the existence of an N-tiling. For the case when the tile has one angle double another, we prove N cannot be prime or even squarefree. The proofs have been verified in Lean.
Problem
The paper asks for which N an isosceles, non-equilateral triangle ABC can be N-tiled by congruent copies of a tile. It treats three tile shapes: right-angled, one angle double another, and a 120-degree angle.
Approach
The argument specializes Laczkovich's classification of possible tile shapes to isosceles triangles. It then uses Laczkovich's graph-theoretic method (graphs Γ_a), together with number-theoretic facts about sums of squares and algebraic degrees of trigonometric values. All proofs except the explicit tiling constructions are formalized in Lean 4 with Mathlib, checked by the kernel using only the standard axioms.
Results
For right-angled tiles, the tilings are completely characterized and N must be even unless ABC is right isosceles. For the other two tile shapes, the tile's side ratios are shown to be rational and a necessary condition on N is given. In the double-angle case this rules out N prime or squarefree, and in the 120-degree case it rules out N < 33.