statement theorem
K[x] is a Euclidean domain
Statement
Let be a field. Then the polynomial ring is a Euclidean domain, with the degree as Euclidean function. That is, for all with , there are with and or .
Remarks
The ring is an integral domain because is one. The existence of and is the division algorithm over a field. A consequence is that is a principal ideal domain and a unique factorization domain. The ring is not a Euclidean domain, because it is not a principal ideal domain.
Explanations
L1 human
Over a field, you can divide any polynomial by any nonzero polynomial and get a remainder of smaller degree. This is the same situation as division with remainder for integers. So all the theory of the Euclidean algorithm works for polynomials over a field.
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
- Zero divisor definition
- Degree of a polynomial definition
- Integral domain definition
- Leading coefficient definition
- Euclidean domain definition
- Monic polynomial definition
- Degree of a product statement
- Division algorithm for polynomials statement
- R[x] is an integral domain iff R is statement
- K[x] is a Euclidean domain statement
What depends on this
16 nodes use this node, directly or through other nodes.
- Uniqueness of finite fields of a given order 010PKCQPXP
- Existence of splitting fields 01441KDGBY
- Uniqueness of the algebraic closure 01VQ7C4FTB
- Galois field 04SGPNT8R9
- Uniqueness of splitting fields 069A3BC3EP
- K[x]/(f) is a field iff f is irreducible 0AWMPX35CW
- Impossibility of doubling the cube 0CQ357M0QS
- Impossibility of trisecting the angle 0EWXPZCSZ0
- Adjoining a root of a polynomial 0M893X7YY7
- Degree of a simple extension is the degree of the minimal polynomial 0N5QW9K7MH
- The degree of a constructible number is a power of two 0SSSM1D475
- Existence of finite fields of every prime power order 0T8M3YC5RG
- Every polynomial has a root in some extension field 0VG02M1FEZ
- Impossibility of squaring the circle 0X7CVDE3BG
- Gauss–Wantzel theorem 0Y34JMJNE9
- K(a) is isomorphic to K[x] modulo the minimal polynomial 0ZN39QDTP9
Sources
What links here
Used by
- K[x]/(f) is a field iff f is irreducible 0AWMPX35CW