As mentioned in lecture, Hilbert’s third problem was an attempt to understand whether the Bolyai-Gerwien theorem could generalize to

3. THE EQUALITY OF THE VOLUMES OF TWO TETRAHEDRA OF EQUAL BASES AND EQUAL ALTITUDES.

In two letters to Gerling, Gauss expresses his regret that certain theorems of solid geometry depend upon the method of exhaustion, i.e., in modern phraseology, upon the axiom of continuity (or upon the axiom of Archimedes). Gauss mentions in particular the theorem of Euclid, that triangular pyramids of equal altitudes are to each other as their bases. Now the analogous problem in the plane has been solved. Gerling also succeeded in proving the equality of volume of symmetrical polyhedra by dividing them into congruent parts. Nevertheless, it seems to me probable that a general proof of this kind for the theorem of Euclid just mentioned is impossible, and it should be our task to give a rigorous proof of its impossibility. This would be obtained, as soon as we succeeded in specifying two tetrahedra of equal bases and equal altitudes which can in no way be split up into congruent tetrahedra, and which cannot be combined with congruent tetrahedra to form two polyhedra which themselves could be split up into congruent tetrahedra.

Hilbert’s student Max Dehn solved the problem in 1901 with the introduction of what we now call Dehn invariants:

Theorem. If two polyhedra in are equidecomposable into polyhedra, then they have the same volume and the same Dehn invariants.

In 1965, J.-P. Sydler proved the converse of Dehn’s result:

Theorem. Two polyhedra in with the same volume and the same Dehn invariants are equidecomposable into polyhedra.

A couple of years ago, Richard Schwartz, from Brown university, wrote a couple of very nice notes explaining both Dehn’s and Sydler’s theorems. He also developed a Java applet illustrating Sydler’s argument (for his “Fundamental lemma”). They can be downloaded here.

(The nicest presentation of the Bolyai-Gerwein result that I’ve found is in Howard Eves’ “A Survey of geometry“. The text of Hilbert’s original lecture delivered before the International Congress of Mathematicians at Paris in 1900 was expanded to a paper, “Mathematical problems”, Bull. Amer. Math. Soc. 8 (1902), 437–479. It has been recently (I’m old) reprinted, in Bull. Amer. Math. Soc. (N.S.) 37 (2000), no. 4, 407–436 and can be downloaded here.)

This entry was posted on Monday, January 23rd, 2012 at 1:32 pm and is filed under 515: Analysis II. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

No, this is not consistent. Todorčević has shown in ZF that, in fact, there is no function $F\!:\mathcal W(S)\to S$ with the property you require. Here, $\mathcal W(S)$ is the collection of subsets of $S$ that are well-orderable. This is corollary 6 in MR0793235 (87d:03126). Todorčević, Stevo. Partition relations for partially ordered sets. Acta Math. 155 (1 […]

As suggested by Gerald, the notion was first introduced for groups. Given a directed system of groups, their direct limit was defined as a quotient of their direct product (which was referred to as their "weak product"). The general notion is a clear generalization, although the original reference only deals with groups. As mentioned by Cameron Zwa […]

A database of number fields, by Jürgen Klüners and Gunter Malle. (Note this is not the same as the one mentioned in this answer.) The site also provides links to similar databases.

As the other answer indicates, the yes answer to your question is known as the De Bruijn-Erdős theorem. This holds regardless of the size of the graph. The De Bruijn–Erdős theorem is a particular instance of what in combinatorics we call a compactness argument or Rado's selection principle, and its truth can be seen as a consequence of the topological c […]

Every $P_c$ has the size of the reals. For instance, suppose $\sum_n a_n=c$ and start by writing $\mathbb N=A\cup B$ where $\sum_{n\in A}a_n$ converges absolutely (to $a$, say). This is possible because $a_n\to 0$: Let $m_0

Sure. A large class of examples comes from the partition calculus. A simple result of the kind I have in mind is the following: Any infinite graph contains either a copy of the complete graph on countably many vertices or of the independent graph on countably many vertices. However, if we want to find an uncountable complete or independent graph, it is not e […]

I think that, from a modern point of view, there is a misunderstanding in the position that you suggest in your question. Really, "set theory" should be understood as an umbrella term that covers a whole hierarchy of ZFC-related theories. Perhaps one of the most significant advances in foundations is the identification of the consistency strength h […]

I'll only discuss the first question. As pointed out by Asaf, the argument is not correct, but something interesting can be said anyway. There are a couple of issues. A key problem is with the idea of an "explicitly constructed" set. Indeed, for instance, there are explicitly constructed sets of reals that are uncountable and of size continuum […]

The question seems to be: Assume that there is a Vitali set $V$. Is there an explicit bijection between $V$ and $\mathbb R$? The answer is yes, by an application of the Cantor-Schröder-Bernstein theorem: there is an explicit injection from $\mathbb R$ into $\mathbb R/\mathbb Q$ (provably in ZF, this requires some thought, or see the answers to this question) […]

If a set $X$ is well-founded (essentially, if it contains no infinite $\in$-descending chains), then indeed $\emptyset$ belongs to its transitive closure, that is, either $X=\emptyset$ or $\emptyset\in\bigcup X$ or $\emptyset\in\bigcup\bigcup X$ or... However, this does not mean that there is some $n$ such that the result of iterating the union operation $n$ […]