Hilbert's third problem

From Wikipedia, the free encyclopedia
Two polyhedra of equal volume, cut into two pieces which can be reassembled into either polyhedron

The third of Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: given any two polyhedra of equal volume, is it always possible to cut the first into finitely many polyhedral pieces which can be reassembled to yield the second? Based on earlier writings by Carl Friedrich Gauss,[1] David Hilbert conjectured that this is not always possible. This was confirmed within the year by his student Max Dehn, who proved that the answer in general is "no" by producing a counterexample.[2]

The answer for the analogous question about polygons in 2 dimensions is "yes" and had been known for a long time; this is the Wallace–Bolyai–Gerwien theorem.

Unknown to Hilbert and Dehn, Hilbert's third problem was also proposed independently by Władysław Kretkowski for a math contest of 1882 by the Academy of Arts and Sciences of Kraków, and was solved by Ludwik Antoni Birkenmajer with a different method than Dehn's. Birkenmajer did not publish the result, and the original manuscript containing his solution was rediscovered years later.[3]

History and motivation[edit]

The formula for the volume of a pyramid,

had been known to Euclid, but all proofs of it involve some form of limiting process or calculus, notably the method of exhaustion or, in more modern form, Cavalieri's principle. Similar formulas in plane geometry can be proven with more elementary means. Gauss regretted this defect in two of his letters to Christian Ludwig Gerling, who proved that two symmetric tetrahedra are equidecomposable.[3]

Gauss' letters were the motivation for Hilbert: is it possible to prove the equality of volume using elementary "cut-and-glue" methods? Because if not, then an elementary proof of Euclid's result is also impossible.

Dehn's answer[edit]

Dehn's proof is an instance in which abstract algebra is used to prove an impossibility result in geometry. Other examples are doubling the cube and trisecting the angle.

Two polyhedra are called scissors-congruent if the first can be cut into finitely many polyhedral pieces that can be reassembled to yield the second. Any two scissors-congruent polyhedra have the same volume. Hilbert asks about the converse.

For every polyhedron , Dehn defines a value, now known as the Dehn invariant , with the property that, if is cut into polyhedral pieces , then

In particular, if two polyhedra are scissors-congruent, then they have the same Dehn invariant. He then shows that every cube has Dehn invariant zero while every regular tetrahedron has non-zero Dehn invariant. Therefore, these two shapes cannot be scissors-congruent.

A polyhedron's invariant is defined based on the lengths of its edges and the angles between its faces. If a polyhedron is cut into two, some edges are cut into two, and the corresponding contributions to the Dehn invariants should therefore be additive in the edge lengths. Similarly, if a polyhedron is cut along an edge, the corresponding angle is cut into two. Cutting a polyhedron typically also introduces new edges and angles; their contributions must cancel out. The angles introduced when a cut passes through a face add to , and the angles introduced around an edge interior to the polyhedron add to . Therefore, the Dehn invariant is defined in such a way that integer multiples of angles of give a net contribution of zero.

All of the above requirements can be met by defining as an element of the tensor product of the real numbers (representing lengths of edges) and the quotient space (representing angles, with all rational multiples of replaced by zero). For some purposes, this definition can be made using the tensor product of modules over (or equivalently of abelian groups), while other aspects of this topic make use of a vector space structure on the invariants, obtained by considering the two factors and to be vector spaces over and taking the tensor product of vector spaces over . This choice of structure in the definition does not make a difference in whether two Dehn invariants, defined in either way, are equal or unequal.

For any edge of a polyhedron , let be its length and let denote the dihedral angle of the two faces of that meet at , measured in radians and considered modulo rational multiples of . The Dehn invariant is then defined as

where the sum is taken over all edges of the polyhedron . It is a valuation.

Further information[edit]

In light of Dehn's theorem above, one might ask "which polyhedra are scissors-congruent"? Sydler (1965) showed that two polyhedra are scissors-congruent if and only if they have the same volume and the same Dehn invariant.[4] Børge Jessen later extended Sydler's results to four dimensions.[citation needed] In 1990, Dupont and Sah provided a simpler proof of Sydler's result by reinterpreting it as a theorem about the homology of certain classical groups.[5]

Debrunner showed in 1980 that the Dehn invariant of any polyhedron with which all of three-dimensional space can be tiled periodically is zero.[6]

Unsolved problem in mathematics:

In spherical or hyperbolic geometry, must polyhedra with the same volume and Dehn invariant be scissors-congruent?

Jessen also posed the question of whether the analogue of Jessen's results remained true for spherical geometry and hyperbolic geometry. In these geometries, Dehn's method continues to work, and shows that when two polyhedra are scissors-congruent, their Dehn invariants are equal. However, it remains an open problem whether pairs of polyhedra with the same volume and the same Dehn invariant, in these geometries, are always scissors-congruent.[7]

Original question[edit]

Hilbert's original question was more complicated: given any two tetrahedra T1 and T2 with equal base area and equal height (and therefore equal volume), is it always possible to find a finite number of tetrahedra, so that when these tetrahedra are glued in some way to T1 and also glued to T2, the resulting polyhedra are scissors-congruent?

Dehn's invariant can be used to yield a negative answer also to this stronger question.

See also[edit]


  1. ^ Carl Friedrich Gauss: Werke, vol. 8, pp. 241 and 244
  2. ^ Dehn, Max (1901). "Ueber den Rauminhalt". Mathematische Annalen. 55 (3): 465–478. doi:10.1007/BF01448001. S2CID 120068465.
  3. ^ a b Ciesielska, Danuta; Ciesielski, Krzysztof (2018-05-29). "Equidecomposability of Polyhedra: A Solution of Hilbert's Third Problem in Kraków before ICM 1900". The Mathematical Intelligencer. 40 (2): 55–63. doi:10.1007/s00283-017-9748-4. ISSN 0343-6993.
  4. ^ Sydler, J.-P. (1965). "Conditions nécessaires et suffisantes pour l'équivalence des polyèdres de l'espace euclidien à trois dimensions". Comment. Math. Helv. 40: 43–80. doi:10.1007/bf02564364. S2CID 123317371.
  5. ^ Dupont, Johan; Sah, Chih-Han (1990). "Homology of Euclidean groups of motions made discrete and Euclidean scissors congruences". Acta Math. 164 (1–2): 1–27. doi:10.1007/BF02392750.
  6. ^ Debrunner, Hans E. (1980). "Über Zerlegungsgleichheit von Pflasterpolyedern mit Würfeln". Arch. Math. 35 (6): 583–587. doi:10.1007/BF01235384. S2CID 121301319.
  7. ^ Dupont, Johan L. (2001), Scissors congruences, group homology and characteristic classes, Nankai Tracts in Mathematics, vol. 1, World Scientific Publishing Co., Inc., River Edge, NJ, p. 6, doi:10.1142/9789812810335, ISBN 978-981-02-4507-8, MR 1832859, archived from the original on 2016-04-29.

Further reading[edit]

External links[edit]