Math 2.0

Commutative algebra Proof

Proof that Euclidean domains are principal ideal domains

Builds on Euclidean domainPrincipal ideal domainIdealPrincipal idealIdeal generated by a subsetWell-ordering principle

Proof

Let RR be a Euclidean domain with Euclidean function δ ⁣:R∖{0}→ℕ\delta \colon R \setminus \set{0} \to \N. Let II be an ideal of RR.

  1. For b∈Rb \in R, the set bR={bt:t∈R}b R = \set{b t : t \in R} is an ideal that contains bb. Every ideal containing bb contains bRb R. So the ideal generated by bb is (b)=bR(b) = b R.
  2. If I={0}I = \set{0}, then I=(0)I = (0), so II is principal.
  3. Now let I≠{0}I \neq \set{0}. The set {δ(c):c∈I,c≠0}\set{\delta(c) : c \in I, c \neq 0} is a nonempty set of natural numbers.
  4. By the well-ordering principle, it has a least element. Choose b∈Ib \in I with b≠0b \neq 0 such that δ(b)\delta(b) is this least element.
  5. Since b∈Ib \in I, step 1 gives (b)⊆I(b) \subseteq I.
  6. Let a∈Ia \in I. Since b≠0b \neq 0, there are q,r∈Rq, r \in R with a=bq+ra = b q + r, and r=0r = 0 or δ(r)<δ(b)\delta(r) < \delta(b).
  7. Since II is an ideal, bq∈Ib q \in I, so r=a−bq∈Ir = a - b q \in I.
  8. If r≠0r \neq 0, then rr is a nonzero element of II with δ(r)<δ(b)\delta(r) < \delta(b). This contradicts the choice of bb. So r=0r = 0.
  9. Hence a=bq∈(b)a = b q \in (b). So I⊆(b)I \subseteq (b), and with step 5, I=(b)I = (b).
  10. Every ideal of RR is principal, and RR is an integral domain. So RR is a principal ideal domain.

Idea

In a nonzero ideal, pick a nonzero element bb with the smallest value of δ\delta. Dividing any element of the ideal by bb leaves a remainder that lies in the ideal and is smaller than bb. So the remainder must be zero, and bb generates the ideal.

Reading path

To understand this page from the ground up, read these 26 pages in order. The foundations come first. The path takes the proofs Proof of the commutativity of addition by induction, Proof of strong induction from ordinary induction, Proof of the well-ordering principle from strong induction.

Show the path as a graph
Definition by recursion, concept, no evidence levelDefinition by recursi…conceptGroup, concept, no evidence levelGroupconceptMathematical induction, concept, no evidence levelMathematical inductionconceptNatural numbers, object, no evidence levelNatural numbersobjectPeano axioms, concept, no evidence levelPeano axiomsconceptRing, definition, no evidence levelRingdefinitionSuccessor function, definition, no evidence levelSuccessor functiondefinitionCommutative ring, definition, no evidence levelCommutative ringdefinitionZero divisor, definition, no evidence levelZero divisordefinitionIdeal, definition, no evidence levelIdealdefinitionAddition of natural numbers, definition, no evidence levelAddition of natural n…definitionThe successor function is injective, statement, no evidence levelThe successor functio…statementZero is not a successor, statement, no evidence levelZero is not a success…statementIntegral domain, definition, no evidence levelIntegral domaindefinitionIdeal generated by a subset, definition, no evidence levelIdeal generated by a …definitionProof of the commutativity of addition by induction, proof, no evidence levelProof of the commutat…proofOrder on the natural numbers, definition, no evidence levelOrder on the natural …definitionEuclidean domain, definition, no evidence levelEuclidean domaindefinitionPrincipal ideal, definition, no evidence levelPrincipal idealdefinitionCommutativity of addition, statement, no evidence levelCommutativity of addi…statementProof of strong induction from ordinary induction, proof, no evidence levelProof of strong induc…proofPrincipal ideal domain, definition, no evidence levelPrincipal ideal domaindefinitionStrong induction, statement, no evidence levelStrong inductionstatementProof of the well-ordering principle from strong induction, proof, no evidence levelProof of the well-ord…proofWell-ordering principle, statement, no evidence levelWell-ordering princip…statementProof that Euclidean domains are principal ideal domains, proof, no evidence levelProof that Euclidean …proof
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. Definition by recursion concept
  2. Group concept
  3. Mathematical induction concept
  4. Natural numbers object
  5. Peano axioms concept
  6. Ring definition
  7. Successor function definition
  8. Commutative ring definition
  9. Zero divisor definition
  10. Ideal definition
  11. Addition of natural numbers definition
  12. The successor function is injective statement
  13. Zero is not a successor statement
  14. Integral domain definition
  15. Ideal generated by a subset definition
  16. Proof of the commutativity of addition by induction proof
  17. Order on the natural numbers definition
  18. Euclidean domain definition
  19. Principal ideal definition
  20. Commutativity of addition statement
  21. Proof of strong induction from ordinary induction proof
  22. Principal ideal domain definition
  23. Strong induction statement
  24. Proof of the well-ordering principle from strong induction proof
  25. Well-ordering principle statement
  26. Proof that Euclidean domains are principal ideal domains proof

Where this leads

67 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Euclidean_Domain_is_Principal_Ideal_Domain
About this page
TagZ38EDQTCTS
URIm2://Z38EDQTCTS
Kindproof
WritingW0 stub
MSC13F07
ProvesEuclidean domains are principal ideal domains
UsesEuclidean domain, Principal ideal domain, Ideal, Principal ideal, Ideal generated by a subset, Well-ordering principle
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)
  • a source with a locator (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.