Theorem 1 (Bolyai-Gerwien Theorem).
Given two polygons with the same area, it is possible to cut up one polygon into a finite number of smaller polygonal pieces and from those pieces assemble into the other polygon.
To cast the theorem in more mathematically rigorous terms, let be a polygon in a plane (Euclidean plane). A dissection or polygonal decomposition of is a finite set of polygons such that and is either a line segment, a point, or the empty set. Two polygons and are said to be equidecomposable (or scissor-equivalent) if there is a dissection of and a finite set of rigid motions such that is a dissection of . From this definition, it is easy to see that equidecomposability is an equivalence relation on the set of all polygons in a given plane. Furthermore, if two polygons are equidecomposable, they have the same area, and the converse of which is the statement of Bolyai-Gerwien Theorem.
One possible proof is to show that any polygon can be broken down into triangles. These triangles can be reassembled into rectangles, which can then be joined into one big rectangle. This big rectangle can then be reassembled into a square.
Remarks. Farkas Bolyai conjectured this in the 1790s and William Wallace proved it in 1808. Unaware of this, Paul Gerwien proved it again in 1833, and then Bolyai, unaware of both earlier results, gave another proof in 1835.
David Hilbert wondered if the same could be done for any pair of polyhedra of equal volume (see the third of Hilbert’s problems). Dehn proved that this could not be done shortly after (Dehn’s Theorem). However, under some suitable conditions, Hadwiger proved that equidecomposability is still possible.
|Date of creation||2013-03-22 16:32:19|
|Last modified on||2013-03-22 16:32:19|
|Last modified by||CWoo (3771)|