Bolyai-Gerwien theorem

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 $P$ be a polygon in a plane (Euclidean plane). A dissection or polygonal decomposition of $P$ is a finite set of polygons $P_{1},\\ldots,P_{n}$ such that $P=P_{1}\\cup\\cdots\\cup P_{n}$ and $P_{i}\\cap P_{j}$ is either a line segment, a point, or the empty set. Two polygons $P$ and $Q$ are said to be equidecomposable (or scissor-equivalent) if there is a dissection $\\{P_{i}\\mid i=1,\\ldots,n\\}$ of $P$ and a finite set of rigid motions $\\{m_{i}\\mid i=1,\\ldots,n\\}$ such that $\\{m_{i}(P_{i})\\mid i=1,\\ldots,n\\}$ is a dissection of $Q$ . 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.

单词	BolyaiGerwienTheorem
释义	Bolyai-Gerwien theorem 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 $P$ be a polygon in a plane (Euclidean plane). A dissection or polygonal decomposition of $P$ is a finite set of polygons $P_{1},\\ldots,P_{n}$ such that $P=P_{1}\\cup\\cdots\\cup P_{n}$ and $P_{i}\\cap P_{j}$ is either a line segment, a point, or the empty set. Two polygons $P$ and $Q$ are said to be equidecomposable (or scissor-equivalent) if there is a dissection $\\{P_{i}\\mid i=1,\\ldots,n\\}$ of $P$ and a finite set of rigid motions $\\{m_{i}\\mid i=1,\\ldots,n\\}$ such that $\\{m_{i}(P_{i})\\mid i=1,\\ldots,n\\}$ is a dissection of $Q$ . 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.
随便看	TheInverseImageCommutesWithSetOperations the inverse image commutes with set operations TheJinvariantClassifiesEllipticCurvesUpToIsomorphism the j-invariant classifies elliptic curves up to isomorphism TheKernelOfAGroupHomomorphismIsANormalSubgroup the kernel of a group homomorphism is a normal subgroup TheLimitOfAUniformlyConvergentSequenceOfContinuousFunctionsIsContinuous the limit of a uniformly convergent sequence of continuous functions is continuous The logic of mere propositions TheMultiplicativeIdentityOfACyclicRingMustBeAGenerator the multiplicative identity of a cyclic ring must be a generator The natural numbers The object classifier TheOddBernoulliNumbersAreZero the odd Bernoulli numbers are zero TheOnlyCompactMetricSpacesThatAdmitAPositivelyExpansiveHomeomorphismAreDiscreteSpaces the only compact metric spaces that admit a positively expansive homeomorphism are discrete spaces TheoremAboutContinuousConvergence theorem about continuous convergence TheoremAboutCyclicSubspaces theorem about cyclic subspaces TheoremForNormalMatrices theorem for normal matrices TheoremForNormalTriangularMatrices theorem for normal triangular matrices