EDIT: as pointed-out below, this has been posted on math.stackexchange. I'll leave it up to the community whether or not to delete this question, but I do think there is room for a more technical answer than the one posted on math.stackexchange.




---


A famous question related to [Hilbert's third problem](https://en.wikipedia.org/wiki/Hilbert%27s_third_problem "Hilbert's third problem"): 



> 
> 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?
> 
> 
> 


This was answered in the negative by Max Dehn, who showed that it was impossible to cut a cube into a finite number of polyhedral pieces that can be reassembled into a tetrahedron. This was accomplished by associating to each polyhedra $P$, an element $D(P)$ of the group $\mathbb{R}\otimes\_{\mathbb{Q}}(\mathbb{R}/\mathbb{Q}\pi)$ that is invariant under cutting and pasteing. To obtain his result, Dehn then proved that the cube had value 0 in the group above, and the tetrahedron had a non-zero value. 


My question is this: is there a more conceptual explanation for why this question should be answered in the negative? In particular, the corresponding statement about polygons is true: given two polygons with the same area, there is a decomposition of the first polygon into polygonal pieces that may be reassembled into the second (see the [Wallace-Bolya-Gerwien Theorem](https://en.wikipedia.org/wiki/Wallace%E2%80%93Bolyai%E2%80%93Gerwien_theorem "Wallace-Bolyai-Gerwien Theorem")). Is there a specific property of polygons that we are exploiting to prove WBG, that fails when we go to three dimensions?



Intuition behind the Dehn Invariant
The Dehn functional of a polyhedron $P$ with edge lengths $\ell\_i$ and exterior dihedral angles $\theta\_i$ is $D(P) = \sum\_i \ell\_i \otimes\_{\mathbb Q} (\theta\_i\, \mathrm{mod}\, \mathbb{Q}\pi)$. It looks similar to the (twice) the total mean curvature $S(P) = \sum\_i \ell\_i \theta\_i$. Both of them satisfy the "valuation property":
$$
F(P \cup Q) = F(P) + F(Q) - F(P \cap Q)
$$
for any two convex polyhedra whose union is convex. In particular, if $P \cap Q$ is a polygon, then $S(P \cap Q)$ is $\sum\_i \ell\_i \cdot \pi$. Dehn's idea is to take $\theta\, (\mathrm{mod}\, \pi)$ to make this vanish. Since we need linearity and distributivity, the product of $\ell$ with $\theta$ becomes the tensor product over $\mathbb{Q}$. Because of $D(P \cap Q)=0$, Dehn's functional is invariant with respect to cutting a polyhedron along a plane, so on equidecomposable polyhedra the functional has the same value.


Dehn almost surely knew about the total mean curvature (Minkowski studied more general functionals shortly before), so this might be the way he invented his functional.


As for the polygons, a similar argument leads to a functional that is the angle sum modulo $\pi$, so always vanishes.


