statement theorem
Every polynomial has a root in some extension field
Statement
Let be a field and let with . Then there is a field extension with such that has a root in .
Remarks
The proof: let be an irreducible factor of in . Adjoining a root of gives the field of degree over . The class of in is a root of , and so of . The irreducible factor exists because is a unique factorisation domain. Repeating the step gives a splitting field of .
Explanations
L1 human
A polynomial with no root in a field gets a root in a bigger field. The bigger field is built from the polynomial itself, without any reference to the complex numbers.
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 43 nodes in this order. The foundations come first, and the list ends with this node.
- Group concept
- Ring definition
- Commutative ring definition
- Ideal definition
- Polynomial ring 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
- Field definition
- Degree of a polynomial definition
- Integral domain definition
- Principal ideal definition
- Associate elements definition
- Prime element definition
- Quotient ring definition
- The only ideals of a field are zero and the whole field statement
- Irreducible element definition
- Field of fractions definition
- Leading coefficient definition
- Euclidean domain definition
- Correspondence theorem for rings statement
- Greatest common divisor in an integral domain definition
- Principal ideal domain definition
- Irreducible polynomial definition
- Unique factorisation domain definition
- Degree of a product statement
- Monic polynomial definition
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Content of a polynomial definition
- R/M is a field iff M is maximal statement
- Division algorithm for polynomials statement
- R[x] is an integral domain iff R is statement
- Primitive polynomial definition
- K[x] is a Euclidean domain statement
- K[x]/(f) is a field iff f is irreducible statement
- Product of primitive polynomials is primitive statement
- Adjoining a root of a polynomial definition
- Gauss's lemma statement
- Polynomial ring over a UFD is a UFD statement
- Every polynomial has a root in some extension field statement
What depends on this
3 nodes use this node, directly or through other nodes.
- Existence of splitting fields 01441KDGBY
- Galois field 04SGPNT8R9
- Existence of finite fields of every prime power order 0T8M3YC5RG
Sources
- Web https://en.wikipedia.org/wiki/Splitting_field, Constructing splitting fields
What links here
Used by
- Existence of splitting fields 01441KDGBY