Math 2.0

Commutative algebra Proof

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 KK be a field.

  1. The field KK is an integral domain: 1≠01 \neq 0, and if ab=0a b = 0 with a≠0a \neq 0, then b=a−1ab=0b = a^{-1} a b = 0.
  2. By the theorem on polynomial rings, K[x]K[x] is an integral domain.
  3. For nonzero h∈K[x]h \in K[x], the degree deg⁡h\deg h is an integer at least 00. So δ(h)=deg⁡h\delta(h) = \deg h defines a function δ ⁣:K[x]∖{0}→ℕ\delta \colon K[x] \setminus \set{0} \to \N.
  4. Let f,g∈K[x]f, g \in K[x] with g≠0g \neq 0. Let cc be the leading coefficient of gg, so c≠0c \neq 0 and cc has an inverse c−1c^{-1} in KK.
  5. Put g1=c−1gg_1 = c^{-1} g. Its coefficients are those of gg times c−1c^{-1}. Since c−1a=0c^{-1} a = 0 only for a=0a = 0, the polynomial g1g_1 has degree deg⁡g\deg g and leading coefficient c−1c=1c^{-1} c = 1.
  6. So g1g_1 is monic. By the division algorithm in K[x]K[x], there are q1,r∈K[x]q_1, r \in K[x] with f=q1g1+rf = q_1 g_1 + r and deg⁡r<deg⁡g1=deg⁡g\deg r < \deg g_1 = \deg g.
  7. Put q=c−1q1q = c^{-1} q_1. Then qg=q1c−1g=q1g1q g = q_1 c^{-1} g = q_1 g_1, so f=qg+rf = q g + r.
  8. If r≠0r \neq 0, then step 6 gives δ(r)=deg⁡r<deg⁡g=δ(g)\delta(r) = \deg r < \deg g = \delta(g). So r=0r = 0 or δ(r)<δ(g)\delta(r) < \delta(g).
  9. By steps 2, 3 and 8, K[x]K[x] 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Unit of a ring definition
  6. Zero divisor definition
  7. Degree of a polynomial definition
  8. Field definition
  9. Integral domain definition
  10. Leading coefficient definition
  11. Euclidean domain definition
  12. Monic polynomial definition
  13. Proof of the degree of a product over an integral domain proof
  14. Division algorithm for polynomials statement
  15. Degree of a product statement
  16. Proof that R[x] is an integral domain iff R is proof
  17. R[x] is an integral domain iff R is statement
  18. Proof that K[x] is a Euclidean domain proof

Where this leads

60 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Euclidean_domain, Examples
About this page
TagZS386M1RD6
URIm2://ZS386M1RD6
Kindproof
WritingW0 stub
MSC13F07
ProvesK[x] is a Euclidean domain
UsesField, 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
Changed4 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.