Bisection: Difference between revisions
en>EmausBot m r2.7.2+) (Robot: Adding he:חוצה זווית |
en>Seaphoto m Reverted edits by 180.233.122.180 (talk) to last revision by ClueBot NG (HG) |
||
Line 1: | Line 1: | ||
The third on [[Hilbert's problems|Hilbert's list of mathematical problems]], presented in 1900, was the first to be solved. The problem is related to the following question: given any two [[polyhedron|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? Based on earlier writings by [[Carl Friedrich Gauss|Gauss]],{{which|date=September 2012}} Hilbert conjectured that this is not always possible. This was confirmed within the year by his student [[Max Dehn]], who proved that the answer in general is "no" by producing a counterexample. | |||
The answer for the analogous question about [[polygon]]s in 2 dimensions is "yes" and had been known for a long time; this is the [[Bolyai–Gerwien theorem]]. | |||
==History and motivation== | |||
The formula for the volume of a [[pyramid (geometry)|pyramid]], | |||
:<math>\frac{\text{base area} \times \text{height}}{3},</math> | |||
had been known to [[Euclid]], but all proofs of it involve some form of [[Limit of a sequence|limiting process]] or [[calculus]], notably the [[method of exhaustion]] or, in more modern form, [[Cavalieri's principle]]. Similar formulas in plane geometry can be proven with more elementary means. Gauss regretted this defect in two of his letters. This was the motivation for Hilbert: is it possible to prove the equality of volume using elementary "cut-and-glue" methods? Because if not, then an elementary proof of Euclid's result is also impossible. | |||
==Dehn's answer== | |||
Dehn's proof is an instance in which [[abstract algebra]] is used to prove an impossibility result in [[geometry]]. Other examples are [[doubling the cube]] and [[trisecting the angle]]. | |||
We call two polyhedra '''scissors-congruent''' if the first can be cut into finitely many polyhedral pieces which can be reassembled to yield the second. Obviously, any two scissors-congruent polyhedra have the same volume. Hilbert asks about the converse. | |||
For every polyhedron ''P'', Dehn defines a value, now known as the '''Dehn invariant''' D(''P''), with the following property: | |||
* If ''P'' is cut into two polyhedral pieces ''P''<sub>1</sub> and ''P''<sub>2</sub> with one plane cut, then D(''P'') = D(''P''<sub>1</sub>) + D(''P''<sub>2</sub>). | |||
From this it follows | |||
* If ''P'' is cut into ''n'' polyhedral pieces ''P''<sub>1</sub>,...,''P''<sub>''n''</sub>, then D(''P'') = D(''P''<sub>1</sub>) + ... + D(''P''<sub>''n''</sub>) | |||
and in particular | |||
* If two polyhedra are scissors-congruent, then they have the same Dehn invariant. | |||
He then shows that every [[cube]] has Dehn invariant zero while every regular [[tetrahedron]] has non-zero Dehn invariant. This settles the matter. | |||
A polyhedron's invariant is defined based on the lengths of its edges and the angles between its faces. Note that if a polyhedron is cut into two, some edges are cut into two, and the corresponding contributions to the Dehn invariants should therefore be additive in the edge lengths. Similarly, if a polyhedron is cut along an edge, the corresponding angle is cut into two. However, normally cutting a polyhedron introduces new edges and angles; we need to make sure that the contributions of these cancel out. The two angles introduced will always add up to [[Pi|π]]; we therefore define our Dehn invariant so that multiples of angles of π give a net contribution of zero. | |||
All of the above requirements can be met if we define D(''P'') as an element of the [[tensor product]] of the [[real number]]s '''R''' and the [[quotient space]] '''R'''/('''Q'''π) in which all rational multiples of π are zero. For the present purposes, it suffices to consider this as a tensor product of '''Z'''-modules (or equivalently of abelian groups).{{Elucidate|reason=What makes this simpler? Without knowing, it's extra confusion.|date=November 2011}} However, the more difficult proof of the converse (see below) makes use of the [[vector space]] structure: Since both of the factors are vector spaces over '''Q''', the tensor product can be taken over '''Q'''. | |||
Let ''ℓ''(''e'') be the length of the edge ''e'' and θ(''e'') be the [[dihedral angle]] between the two faces meeting at ''e'', measured in [[radian]]s. The Dehn invariant is then defined as | |||
:<math>\operatorname{D}(P) = \sum_{e} \ell(e)\otimes (\theta(e)+\mathbb{Q}\pi)</math> | |||
where the sum is taken over all edges ''e'' of the polyhedron ''P''. | |||
==Further information== | |||
In light of Dehn's theorem above, one might ask "which polyhedra are scissors-congruent"? [[Jean-Pierre Sydler|Sydler]] (1965) showed that two polyhedra are scissors-congruent if and only if they have the same volume and the same Dehn invariant. [[Børge Jessen]] later extended Sydler's results to four dimensions. In 1990, Dupont and Sah provided a simpler proof of Sydler's result by reinterpreting it as a theorem about the [[homology (mathematics)|homology]] of certain [[classical group]]s. | |||
Debrunner showed in 1980 that the Dehn invariant of any polyhedron with which all of [[three-dimensional space]] can be [[honeycomb (geometry)|tiled]] periodically is zero. | |||
==Original question== | |||
Hilbert's original question was more complicated: given any two [[tetrahedron|tetrahedra]] ''T''<sub>1</sub> and ''T''<sub>2</sub> with equal base area and equal height (and therefore equal volume), is it always possible to find a finite number of tetrahedra, so that when these tetrahedra are glued in some way to ''T''<sub>1</sub> and also glued to ''T''<sub>2</sub>, the resulting polyhedra are scissors-congruent? | |||
Dehn's invariant can be used to yield a negative answer also to this stronger question. | |||
==See also== | |||
* [[Hill tetrahedron]] | |||
==References== | |||
*Max Dehn: "Über den Rauminhalt", ''Mathematische Annalen'' 55 (1901), no. 3, pages 465–478. | |||
*Sydler, J.-P. "[http://retro.seals.ch/digbib/view?rid=comahe-002:1965-1966:40::67&id=browse&id2=&id3= Conditions nécessaires et suffisantes pour l'équivalence des polyèdres de l'espace euclidien à trois dimensions]", ''Comment. Math. Helv.'' 40 (1965), pages 43–80 | |||
*Johan Dupont and Chih-Han Sah: "Homology of Euclidean groups of motions made discrete and Euclidean scissors congruences", ''Acta Math.'' 164 (1990), no. 1–2, pages 1–27 | |||
*Hans E. Debrunner: "Über Zerlegungsgleichheit von Pflasterpolyedern mit Würfeln", ''Arch. Math.'' (Basel) 35 (1980), no. 6, pages 583–587 | |||
*Rich Schwartz: "[http://www.math.brown.edu/~res/Papers/dehn_sydler.pdf The Dehn-Sydler Theorem Explained]" | |||
==External links== | |||
*[http://everything2.com/e2node/Proof%2520for%2520Hilbert%2527s%2520third%2520problem Proof of Dehn's Theorem at Everything2] | |||
*{{MathWorld |id=DehnInvariant |title=Dehn Invariant}} | |||
*[http://everything2.com/e2node/Dehn%2520invariant Dehn Invariant at Everything2] | |||
*{{SpringerEOM| title=Dehn invariant | id=Dehn_invariant | oldid=13481 | first=M. | last=Hazewinkel }} | |||
{{Hilbert's problems}} | |||
[[Category:Hilbert's problems|#03]] | |||
[[Category:Euclidean solid geometry]] | |||
[[Category:Geometric dissection]] |
Revision as of 15:23, 31 January 2014
The third on Hilbert's list of mathematical problems, presented in 1900, was the first to be solved. The problem is related to the following question: 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? Based on earlier writings by Gauss,Template:Which Hilbert conjectured that this is not always possible. This was confirmed within the year by his student Max Dehn, who proved that the answer in general is "no" by producing a counterexample.
The answer for the analogous question about polygons in 2 dimensions is "yes" and had been known for a long time; this is the Bolyai–Gerwien theorem.
History and motivation
The formula for the volume of a pyramid,
had been known to Euclid, but all proofs of it involve some form of limiting process or calculus, notably the method of exhaustion or, in more modern form, Cavalieri's principle. Similar formulas in plane geometry can be proven with more elementary means. Gauss regretted this defect in two of his letters. This was the motivation for Hilbert: is it possible to prove the equality of volume using elementary "cut-and-glue" methods? Because if not, then an elementary proof of Euclid's result is also impossible.
Dehn's answer
Dehn's proof is an instance in which abstract algebra is used to prove an impossibility result in geometry. Other examples are doubling the cube and trisecting the angle.
We call two polyhedra scissors-congruent if the first can be cut into finitely many polyhedral pieces which can be reassembled to yield the second. Obviously, any two scissors-congruent polyhedra have the same volume. Hilbert asks about the converse.
For every polyhedron P, Dehn defines a value, now known as the Dehn invariant D(P), with the following property:
- If P is cut into two polyhedral pieces P1 and P2 with one plane cut, then D(P) = D(P1) + D(P2).
From this it follows
- If P is cut into n polyhedral pieces P1,...,Pn, then D(P) = D(P1) + ... + D(Pn)
and in particular
- If two polyhedra are scissors-congruent, then they have the same Dehn invariant.
He then shows that every cube has Dehn invariant zero while every regular tetrahedron has non-zero Dehn invariant. This settles the matter.
A polyhedron's invariant is defined based on the lengths of its edges and the angles between its faces. Note that if a polyhedron is cut into two, some edges are cut into two, and the corresponding contributions to the Dehn invariants should therefore be additive in the edge lengths. Similarly, if a polyhedron is cut along an edge, the corresponding angle is cut into two. However, normally cutting a polyhedron introduces new edges and angles; we need to make sure that the contributions of these cancel out. The two angles introduced will always add up to π; we therefore define our Dehn invariant so that multiples of angles of π give a net contribution of zero.
All of the above requirements can be met if we define D(P) as an element of the tensor product of the real numbers R and the quotient space R/(Qπ) in which all rational multiples of π are zero. For the present purposes, it suffices to consider this as a tensor product of Z-modules (or equivalently of abelian groups).Template:Elucidate However, the more difficult proof of the converse (see below) makes use of the vector space structure: Since both of the factors are vector spaces over Q, the tensor product can be taken over Q.
Let ℓ(e) be the length of the edge e and θ(e) be the dihedral angle between the two faces meeting at e, measured in radians. The Dehn invariant is then defined as
where the sum is taken over all edges e of the polyhedron P.
Further information
In light of Dehn's theorem above, one might ask "which polyhedra are scissors-congruent"? Sydler (1965) showed that two polyhedra are scissors-congruent if and only if they have the same volume and the same Dehn invariant. Børge Jessen later extended Sydler's results to four dimensions. In 1990, Dupont and Sah provided a simpler proof of Sydler's result by reinterpreting it as a theorem about the homology of certain classical groups.
Debrunner showed in 1980 that the Dehn invariant of any polyhedron with which all of three-dimensional space can be tiled periodically is zero.
Original question
Hilbert's original question was more complicated: given any two tetrahedra T1 and T2 with equal base area and equal height (and therefore equal volume), is it always possible to find a finite number of tetrahedra, so that when these tetrahedra are glued in some way to T1 and also glued to T2, the resulting polyhedra are scissors-congruent?
Dehn's invariant can be used to yield a negative answer also to this stronger question.
See also
References
- Max Dehn: "Über den Rauminhalt", Mathematische Annalen 55 (1901), no. 3, pages 465–478.
- Sydler, J.-P. "Conditions nécessaires et suffisantes pour l'équivalence des polyèdres de l'espace euclidien à trois dimensions", Comment. Math. Helv. 40 (1965), pages 43–80
- Johan Dupont and Chih-Han Sah: "Homology of Euclidean groups of motions made discrete and Euclidean scissors congruences", Acta Math. 164 (1990), no. 1–2, pages 1–27
- Hans E. Debrunner: "Über Zerlegungsgleichheit von Pflasterpolyedern mit Würfeln", Arch. Math. (Basel) 35 (1980), no. 6, pages 583–587
- Rich Schwartz: "The Dehn-Sydler Theorem Explained"
External links
- Proof of Dehn's Theorem at Everything2
I had like 17 domains hosted on single account, and never had any special troubles. If you are not happy with the service you will get your money back with in 45 days, that's guaranteed. But the Search Engine utility inside the Hostgator account furnished an instant score for my launched website. Fantastico is unable to install WordPress in a directory which already have any file i.e to install WordPress using Fantastico the destination directory must be empty and it should not have any previous installation files. When you share great information, others will take note. Once your hosting is purchased, you will need to setup your domain name to point to your hosting. Money Back: All accounts of Hostgator come with a 45 day money back guarantee. If you have any queries relating to where by and how to use Hostgator Discount Coupon, you can make contact with us at our site. If you are starting up a website or don't have too much website traffic coming your way, a shared plan is more than enough. Condition you want to take advantage of the worldwide web you prerequisite a HostGator web page, -1 of the most trusted and unfailing web suppliers on the world wide web today. Since, single server is shared by 700 to 800 websites, you cannot expect much speed.
Hostgator tutorials on how to install Wordpress need not be complicated, especially when you will be dealing with a web hosting service that is friendly for novice webmasters and a blogging platform that is as intuitive as riding a bike. After that you can get Hostgator to host your domain and use the wordpress to do the blogging. Once you start site flipping, trust me you will not be able to stop. I cut my webmaster teeth on Control Panel many years ago, but since had left for other hosting companies with more commercial (cough, cough) interfaces. If you don't like it, you can chalk it up to experience and go on. First, find a good starter template design. When I signed up, I did a search for current "HostGator codes" on the web, which enabled me to receive a one-word entry for a discount. Your posts, comments, and pictures will all be imported into your new WordPress blog.- Dehn Invariant at Everything2
- 53 yrs old Fitter (Common ) Batterton from Carp, likes to spend some time kid advocate, property developers in singapore and handball. Completed a cruise liner experience that was comprised of passing by Gusuku Sites and Related Properties of the Kingdom of Ryukyu.
Here is my web page www.mtfgaming.com