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 .
Reading path
To understand this page from the ground up, read these 14 pages in order. The foundations come first.
Show the path as a graph
- 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
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | 0SK1VHZ5R2 |
|---|---|
| URI | m2://0SK1VHZ5R2 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11R18 |
| Status | This copy of the site has no build data. Run m2 status 0SK1VHZ5R2. |
| Uses | Cyclotomic polynomial, Irreducible polynomial |
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.