Proof that K[x] is a Euclidean domain
Builds on FieldIntegral domainR[x] is an integral domain iff R isEuclidean domainDivision algorithm for polynomialsMonic polynomialLeading coefficientDegree of a polynomial
Proof
Let be a field.
- The field is an integral domain: , and if with , then .
- By the theorem on polynomial rings, is an integral domain.
- For nonzero , the degree is an integer at least . So defines a function .
- Let with . Let be the leading coefficient of , so and has an inverse in .
- Put . Its coefficients are those of times . Since only for , the polynomial has degree and leading coefficient .
- So is monic. By the division algorithm in , there are with and .
- Put . Then , so .
- If , then step 6 gives . So or .
- By steps 2, 3 and 8, is a Euclidean domain with the degree as Euclidean function.
Idea
Over a field, every nonzero polynomial becomes monic after we divide it by its leading coefficient. Long division by a monic polynomial always works, so we can divide by any nonzero polynomial and get a remainder of smaller degree.
Reading path
To understand this page from the ground up, read these 18 pages in order. The foundations come first. The path takes the proofs Proof that R[x] is an integral domain iff R is, Proof of the degree of a product over an integral domain.
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
- Field definition
- Integral domain definition
- Leading coefficient definition
- Euclidean domain definition
- Monic polynomial definition
- Proof of the degree of a product over an integral domain proof
- Division algorithm for polynomials statement
- Degree of a product statement
- Proof that R[x] is an integral domain iff R is proof
- R[x] is an integral domain iff R is statement
- Proof that K[x] is a Euclidean domain proof
Where this leads
60 pages build on this one.
- Uniqueness of finite fields of a given order
- Existence of splitting fields
- Uniqueness of the algebraic closure
- Galois field
- Uniqueness of splitting fields
- K[x]/(f) is a field iff f is irreducible
- Order of the Galois group of a Galois extension equals its degree
- Impossibility of doubling the cube
- K[x] is a Euclidean domain
- Existence of an algebraic closure
- Impossibility of trisecting the angle
- Transcendence of pi
- Adjoining a root of a polynomial
- Degree of a simple extension is the degree of the minimal polynomial
- The algebraic numbers form a field
- The Galois group has order at most the degree
- Irreducibility of the cyclotomic polynomials over the rationals
- The degree of a constructible number is a power of two
- Primitive element theorem
- Fundamental theorem of Galois theory
- Existence of finite fields of every prime power order
- An algebraic extension of an algebraic extension is algebraic
- Every polynomial has a root in some extension field
- Impossibility of squaring the circle
- Gauss–Wantzel theorem
- Decomposition into generalised eigenspaces
- K(a) is isomorphic to K[x] modulo the minimal polynomial
- Proof of the impossibility of doubling the cube
- Proof that the algebraic numbers form a field
- Proof that the automorphism group of a finite extension has order at most the degree
- Proof of the impossibility of squaring the circle
- Proof of the transcendence of pi from the Lindemann–Weierstrass theorem
- Proof of the uniqueness of splitting fields
- Model theory of algebraically closed fields
- Weil conjectures
- Proof of the uniqueness of the algebraic closure
- Proof that every polynomial has a root in some extension field
- Proof that the Galois group of a finite Galois extension has order equal to the degree
- Proof that the degree of a simple extension is the degree of the minimal polynomial
- Proof of the uniqueness of finite fields of a given order
- Cyclotomic field
- Steinitz's theorem on algebraically closed fields
- Standard conjectures on algebraic cycles
- Proof that the degree of a constructible number is a power of two
- Proof of the decomposition into generalised eigenspaces
- Proof of the irreducibility of the cyclotomic polynomials by reduction modulo primes
- Proof of the primitive element theorem
- Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial
- Galois group of a finite field extension
- Proof of the existence of splitting fields
- Proof of the existence of finite fields of every prime power order
- Proof of the impossibility of trisecting the angle
- Categorical theory
- Proof that K[x]/(f) is a field iff f is irreducible
- Proof of the fundamental theorem of Galois theory
- Proof of the Gauss–Wantzel theorem
- Impossibility of the classical construction problems
- Artin's theorem on fixed fields
- Proof that an algebraic extension of an algebraic extension is algebraic
- Proof of the existence of an algebraic closure
Further reading
About this page
| Tag | ZS386M1RD6 |
|---|---|
| URI | m2://ZS386M1RD6 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 13F07 |
| Proves | K[x] is a Euclidean domain |
| Uses | Field, Integral domain, R[x] is an integral domain iff R is, Euclidean domain, Division algorithm for polynomials, Monic polynomial, Leading coefficient, Degree of a polynomial |
| Changed | 4 November 2026 |
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.
What links here
No page links to this page yet.