1
$\begingroup$

The classic problem of constructing a perfect squared square, i.e. tiling a square with a finite number of squares of pairwise distinct sidelengths (which must be rational multiples of the tiled square's, so we need only look for integral tilings) has solutions (one is shown below). However, it has been proved impossible to tile an equilateral triangle with equilateral triangles of distinct sizes (elegant proof here). It is also impossible to do it for other (more-sided) regular polygons since the angle between a corner piece and the side of the tiled polygon will be acute.

In three dimensions, one can prove very elegantly that it is impossible to divide a cube into a finite number of cubes of distinct sizes. A natural generalization is to ask whether it is possible to divide a regular tetrahedron into tetrahedra of distinct sizes (I assume the other Platonic solids will not work)? This problem appears more complicated, and I don't know if either impossibility proof (for cube or equilateral triangle) will generalize to tetrahedra. (This question appears to be asking something somewhat different, related to a specific type of division).

It is possible however to tile an equilateral triangle with equilateral triangles which can have the same size if their orientation is different; an example is shown below. It is worth wondering whether such a dissection might be possible for the tetrahedron.

Thus I have the following questions:

  1. Is it possible to divide a regular tetrahedron into regular tetrahedra of distinct sizes?
  2. If it is possible, can a proof like this be extended to show that all dissections are rational?
  3. Is the dissection possible if we only force tetrahedra of the same orientation to have distinct sizes?

Perfect squared square:

$\hskip2in$Squared square

Equilateral triangle dissection:

$\hskip2in$Triangled triangle

$\endgroup$
5
$\begingroup$

It is not possible to dissect a regular tetrahedron into any finite number${}>1$ of regular tetrahedra at all. This is simply because the angle between the faces of a regular tetrahedron, which is the angle that it occupies around any one of its edges, measured in a plane perpendicular to that edge, is $\arccos(\frac13)$ and this is not of the form $\frac{2\pi}n$ for any integer$~n$; therefore one can never complete the remaining angle with a number of regular tetrahedra.

Here is a bit more rigorous argument. Clearly such a decomposition will have an edge $e$ of some smaller tetrahedron$~t$ across a face of the original tetrahedron ("across" meaning lying in the face but not along an edge of it). The plane perpendicular to$~e$ and cutting it at the middle has an angle of$~\pi$ for the interior of the original tetrahedron (the remaining angle$~\pi$ being the exterior). Of this flat angle, $t$ occupies $\arccos(\frac13)$, but $\pi-\arccos(\frac13)$ is not an integer multiple of $\arccos(\frac13)$, and so we cannot fill this remaining angle completely with tetrahedra, so we will fail to cover some points in the neighbourhood of the edge$~e$.

We see that it would actually be necessary to have an angle of the form $\frac\pi n$ rather than the more liberal $\frac{2\pi}n$ to succeed. If you try to arrange regular tetrahedra around a common edge, you will see that you can manage $5$ but that a small angle is left, way to small to fit in a sixth regular tetrahedron.

$\endgroup$
  • $\begingroup$ I almost see what you're saying... why must $f$ be irrational? $\endgroup$ – Anon Jan 26 '17 at 8:34
  • $\begingroup$ I rewrote to make the argument more evident. The point is just $\arccos(\frac13)$ is not of the form $\frac\pi n$ with $n$ integer; the fact that it is an irrational multiple of $\pi$ is much stronger, and true, but not needed. $\endgroup$ – Marc van Leeuwen Jan 26 '17 at 8:51
  • $\begingroup$ Nice proof. +1. It's a bit disappointing that the tetrahedron case is so relatively trivial compared to the square, cube and equilateral triangle, but a nice proof regardless. $\endgroup$ – Anon Jan 29 '17 at 0:49

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.