Bolyai–Gerwien theorem

From Wikipedia, the free encyclopedia

(Redirected from Bolyai-Gerwien theorem)
Jump to: navigation, search

In geometry, the Bolyai–Gerwien theorem states that if two simple polygons of equal area are given, one can cut the first into finitely many polygonal pieces and rearrange the pieces to obtain the second polygon.

"Rearrangement" means that one may apply a translation and a rotation to every polygonal piece.

Unlike the solution to Tarski's circle-squaring problem, the axiom of choice is not required for the proof, and the decomposition and reassembly can actually be carried out "physically".

The analogous statement about polyhedra in three dimensions, known as Hilbert's third problem, is false, as proven by Max Dehn in 1900, leading to the Banach–Tarski paradox 24 years later.

Farkas Bolyai, father of Janos Bolyai, first formulated the question. Gerwien proved the theorem in 1833, but in fact Wallace had proven the same result already in 1807.

According to other sources, Farkas Bolyai and Gerwien had independently proved the theorem in 1833 and 1835, respectively.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.