Field theory and polynomials Theorem
The degree of a constructible number is a power of two
Builds on The constructible numbers form a field closed under square rootsTower lawDegree of a simple extension is the degree of the minimal polynomialMinimal polynomial of an algebraic element
Statement
Let be a constructible number. Then is algebraic over , and for some integer .
Remarks
The proof: there is a tower with and for each . By the tower law, , and divides it. So the minimal polynomial of over has degree a power of two. The converse is false: some algebraic numbers whose degree is a power of two are not constructible. A sufficient condition: the splitting field of the minimal polynomial of has degree a power of two over .
Reading path
To understand this page from the ground up, read these 56 pages in order. The foundations come first.
- Group concept
- Straightedge and compass construction concept
- Ring definition
- Constructible number definition
- Commutative ring definition
- Ideal definition
- Polynomial ring definition
- Ring homomorphism definition
- Subring definition
- Unit of a ring definition
- Zero divisor definition
- Divisibility in a commutative ring definition
- Ideal generated by a subset definition
- Maximal ideal definition
- Two-sided ideal definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Field definition
- Integral domain definition
- Kernel of a ring homomorphism definition
- Ring isomorphism definition
- Principal ideal definition
- Quotient ring definition
- The only ideals of a field are zero and the whole field statement
- Evaluation homomorphism definition
- Leading coefficient definition
- Root of a polynomial definition
- Subfield definition
- Irreducible element definition
- Euclidean domain definition
- Correspondence theorem for rings statement
- Principal ideal domain definition
- The constructible numbers form a field closed under square roots statement
- Monic polynomial definition
- Universal property of the quotient ring statement
- Irreducible polynomial definition
- Degree of a product statement
- Field extension definition
- R/M is a field iff M is maximal statement
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Division algorithm for polynomials statement
- Algebraic element definition
- R[x] is an integral domain iff R is statement
- First isomorphism theorem for rings statement
- Intermediate field definition
- Degree of a field extension definition
- Minimal polynomial of an algebraic element definition
- K[x] is a Euclidean domain statement
- Field generated by adjoining elements definition
- Tower law statement
- The minimal polynomial divides every polynomial vanishing at the element statement
- K[x]/(f) is a field iff f is irreducible statement
- Simple extension definition
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Degree of a simple extension is the degree of the minimal polynomial statement
- The degree of a constructible number is a power of two statement
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Constructible_number, Algebraic properties
About this page
| Tag | 0SSSM1D475 |
|---|---|
| URI | m2://0SSSM1D475 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 12F05 |
| Status | This copy of the site has no build data. Run m2 status 0SSSM1D475. |
| Uses | The constructible numbers form a field closed under square roots, Tower law, Degree of a simple extension is the degree of the minimal polynomial, Minimal polynomial of an algebraic element |
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.