Hilbert's third problem

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 Gauss,[1] 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. Birkenmajer did not publish the result, and the original manuscript containing his solution was rediscovered years later.[3]

History and motivation

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

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 P, Dehn defines a value, now known as the Dehn invariant D(P), with the following property:

  • If P is cut into two polyhedral pieces P1 and P2 with one plane cut, then D(P) = D(P1) + D(P2).

From this it follows

  • If P is cut into n polyhedral pieces P1,...,Pn, then D(P) = D(P1) + ... + D(Pn)

and 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. This settles the matter.

A polyhedron's invariant is defined based on the lengths of its edges and the angles between its faces. Note that 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. However, normally cutting a polyhedron introduces new edges and angles; we need to make sure that the contributions of these cancel out. The two angles introduced will always add up to π; we therefore define our Dehn invariant so that multiples of angles of π give a net contribution of zero.

All of the above requirements can be met if we define D(P) as an element of the tensor product of the real numbers R and the quotient space R/(Qπ) in which all rational multiples of π are zero. For the present purposes, it suffices to consider this as a tensor product of Z-modules (or equivalently of abelian groups). However, the more difficult proof of the converse (see below) makes use of the vector space structure: Since both of the factors are vector spaces over Q, the tensor product can be taken over Q.

Let ℓ(e) be the length of the edge e and θ(e) be the dihedral angle between the two faces meeting at e, measured in radians. The Dehn invariant is then defined as

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

Further information

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. 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?
(more unsolved problems in mathematics)

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

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.

gollark: Troubling.
gollark: To be fair to the UK, we *do* have the whole "much more contagious variant" thing going on.
gollark: Yes, this would also work.
gollark: You could do *internet* radio.
gollark: And a regular expression for URLs.

See also

References
  1. Carl Friedrich Gauss: Werke, vol. 8, pp. 241 and 244
  2. Dehn, Max (1901). "Ueber den Rauminhalt" (PDF). Mathematische Annalen. 55 (3): 465–478. doi:10.1007/BF01448001.
  3. 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.
  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.
  7. Dupont, Johan L. (2001), Scissors congruences, group homology and characteristic classes, Nankai Tracts in Mathematics, 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
  • Benko, D. (2007). "A New Approach to Hilbert's Third Problem". The American Mathematical Monthly. 114 (8): 665–676. doi:10.1080/00029890.2007.11920458.
  • Schwartz, Rich (2010). "The Dehn–Sydler Theorem Explained" (PDF). Cite journal requires |journal= (help)
  • Koji, Shiga; Toshikazu Sunada (2005). A Mathematical Gift, III: The Interplay Between Topology, Functions, Geometry, and Algebra. American Mathematical Society.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.