statement theorem
Irreducibility of the cyclotomic polynomials over the rationals
Statement
For every integer , the cyclotomic polynomial is irreducible in .
Remarks
For prime, Eisenstein's criterion applied to with the prime proves the statement. The general case is harder. One proof shows that if is a root of an irreducible factor of , then so is for each prime . A consequence: is the minimal polynomial over of each primitive -th root of unity. So the degree of over is .
Explanations
L1 human
The polynomial cannot be split into smaller polynomials with rational coefficients. So all the primitive -th roots of unity are conjugate over the rationals: no rational polynomial equation separates them.
What this node 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 node is. They do not measure its truth.
What this needs
To read this node, read these 14 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Ring definition
- Commutative ring definition
- Polynomial ring definition
- Unit of a ring definition
- Zero divisor definition
- Degree of a polynomial definition
- Integral domain definition
- Leading coefficient definition
- Irreducible element definition
- Monic polynomial definition
- Irreducible polynomial definition
- Cyclotomic polynomial definition
- Irreducibility of the cyclotomic polynomials over the rationals statement
What depends on this
1 node uses this node, directly or through other nodes.
- Gauss–Wantzel theorem 0Y34JMJNE9
Sources
What links here
Used by
- Gauss–Wantzel theorem 0Y34JMJNE9