Math 2.0

Field theory and polynomials Galois theory Theorem

Gauss–Wantzel theorem

Builds on Constructible numberIrreducibility of the cyclotomic polynomials over the rationalsThe degree of a constructible number is a power of two

Statement

Let n≥3n \ge 3. The regular nn-gon can be constructed with straightedge and compass if and only if n=2kp1p2⋯ptn = 2^k p_1 p_2 \cdots p_t, with k,t≥0k, t \ge 0 and p1,…,ptp_1, \dots, p_t distinct Fermat primes.

Remarks

A Fermat prime is a prime number of the form 22m+12^{2^m} + 1. The known Fermat primes are 3,5,17,2573, 5, 17, 257 and 6553765537. The regular nn-gon is constructible if and only if e2πi/ne^{2\pi i/n} is a constructible number. Its degree over ℚ\mathbb{Q} is φ(n)\varphi(n), by the irreducibility of Φn\Phi_n. The condition on nn holds if and only if φ(n)\varphi(n) is a power of 22. So the 1717-gon and the 1515-gon are constructible, but the 77-gon and the 99-gon are not.

History

Carl Friedrich Gauss proved in 1796 that the regular 1717-gon is constructible. In his 1801 book Disquisitiones Arithmeticae, he gave the sufficient condition. Pierre Wantzel gave a full proof of the necessity in 1837.

Reading path

To understand this page from the ground up, read these 59 pages in order. The foundations come first.

  1. Group concept
  2. Straightedge and compass construction concept
  3. Ring definition
  4. Constructible number definition
  5. Commutative ring definition
  6. Ideal definition
  7. Polynomial ring definition
  8. Ring homomorphism definition
  9. Subring definition
  10. Unit of a ring definition
  11. Zero divisor definition
  12. Divisibility in a commutative ring definition
  13. Ideal generated by a subset definition
  14. Maximal ideal definition
  15. Two-sided ideal definition
  16. Degree of a polynomial definition
  17. Polynomial evaluation definition
  18. Field definition
  19. Integral domain definition
  20. Kernel of a ring homomorphism definition
  21. Ring isomorphism definition
  22. Principal ideal definition
  23. Quotient ring definition
  24. The only ideals of a field are zero and the whole field statement
  25. Evaluation homomorphism definition
  26. Leading coefficient definition
  27. Root of a polynomial definition
  28. Subfield definition
  29. Irreducible element definition
  30. Euclidean domain definition
  31. Correspondence theorem for rings statement
  32. Principal ideal domain definition
  33. The constructible numbers form a field closed under square roots statement
  34. Monic polynomial definition
  35. Universal property of the quotient ring statement
  36. Irreducible polynomial definition
  37. Degree of a product statement
  38. Field extension definition
  39. R/M is a field iff M is maximal statement
  40. Cyclotomic polynomial definition
  41. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  42. Division algorithm for polynomials statement
  43. Algebraic element definition
  44. R[x] is an integral domain iff R is statement
  45. First isomorphism theorem for rings statement
  46. Intermediate field definition
  47. Degree of a field extension definition
  48. Irreducibility of the cyclotomic polynomials over the rationals statement
  49. Minimal polynomial of an algebraic element definition
  50. K[x] is a Euclidean domain statement
  51. Field generated by adjoining elements definition
  52. Tower law statement
  53. The minimal polynomial divides every polynomial vanishing at the element statement
  54. K[x]/(f) is a field iff f is irreducible statement
  55. Simple extension definition
  56. K(a) is isomorphic to K[x] modulo the minimal polynomial statement
  57. Degree of a simple extension is the degree of the minimal polynomial statement
  58. The degree of a constructible number is a power of two statement
  59. Gauss–Wantzel theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Constructible_polygon, Conditions for constructibility
About this page
Tag0Y34JMJNE9
URIm2://0Y34JMJNE9
Kindstatement, theorem
WritingW0 stub
MSC12F05
StatusThis copy of the site has no build data. Run m2 status 0Y34JMJNE9.
UsesConstructible number, Irreducibility of the cyclotomic polynomials over the rationals, The degree of a constructible number is a power of two

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.