Math 2.0

Commutative algebra Proof

Proof of Bézout's identity in a Euclidean domain

Builds on Euclidean domainEuclidean domains are principal ideal domainsPrincipal ideal domainIdealPrincipal idealIdeal generated by a subsetGreatest common divisor in an integral domainDivisibility in a commutative ring

Proof

Let RR be a Euclidean domain and let a,b∈Ra, b \in R.

  1. Let I={sa+tb:s,t∈R}I = \set{s a + t b : s, t \in R}. It contains 0=0a+0b0 = 0 a + 0 b, and also a=1a+0ba = 1 a + 0 b and b=0a+1bb = 0 a + 1 b.
  2. For sa+tbs a + t b and s′a+t′bs' a + t' b in II and r∈Rr \in R, we have (sa+tb)−(s′a+t′b)=(s−s′)a+(t−t′)b∈I(s a + t b) - (s' a + t' b) = (s - s') a + (t - t') b \in I and r(sa+tb)=(rs)a+(rt)b∈Ir (s a + t b) = (r s) a + (r t) b \in I.
  3. By steps 1 and 2, II is an ideal of RR.
  4. Since Euclidean domains are principal ideal domains, II is a principal ideal: I=(d)I = (d) for some d∈Rd \in R.
  5. The set dR={dr:r∈R}d R = \set{d r : r \in R} is an ideal that contains dd. Every ideal containing dd contains dRd R. So the ideal generated by dd is (d)=dR(d) = d R.
  6. Since d∈(d)=Id \in (d) = I, there are s,t∈Rs, t \in R with d=sa+tbd = s a + t b.
  7. Since a∈I=dRa \in I = d R, dd divides aa. In the same way, d∣bd \mid b.
  8. Let c∈Rc \in R with c∣ac \mid a and c∣bc \mid b, say a=ca1a = c a_1 and b=cb1b = c b_1. Then d=sca1+tcb1=c(sa1+tb1)d = s c a_1 + t c b_1 = c (s a_1 + t b_1), so c∣dc \mid d.
  9. By steps 7 and 8, dd is a greatest common divisor of aa and bb. By step 6, d=sa+tbd = s a + t b.

Idea

The combinations sa+tbs a + t b form an ideal. In a Euclidean domain every ideal is generated by one element dd. This dd is itself a combination of aa and bb, it divides both, and every common divisor of aa and bb divides every combination of them, hence divides dd.

Reading path

To understand this page from the ground up, read these 32 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, Proof that Euclidean domains are principal ideal domains.

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 ringdefinitionUnit of a ring, definition, no evidence levelUnit of a 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…statementDivisibility in a commutative ring, definition, no evidence levelDivisibility in a com…definitionIntegral 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 …definitionAssociate elements, definition, no evidence levelAssociate elementsdefinitionEuclidean 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…proofGreatest common divisor in an integral domain, definition, no evidence levelGreatest common divis…definitionPrincipal 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 …proofEuclidean domains are principal ideal domains, statement, no evidence levelEuclidean domains are…statementProof of Bézout's identity in a Euclidean domain, proof, no evidence levelProof of Bézout's ide…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. Unit of a ring definition
  10. Zero divisor definition
  11. Ideal definition
  12. Addition of natural numbers definition
  13. The successor function is injective statement
  14. Zero is not a successor statement
  15. Divisibility in a commutative ring definition
  16. Integral domain definition
  17. Ideal generated by a subset definition
  18. Proof of the commutativity of addition by induction proof
  19. Order on the natural numbers definition
  20. Associate elements definition
  21. Euclidean domain definition
  22. Principal ideal definition
  23. Commutativity of addition statement
  24. Proof of strong induction from ordinary induction proof
  25. Greatest common divisor in an integral domain definition
  26. Principal ideal domain definition
  27. Strong induction statement
  28. Proof of the well-ordering principle from strong induction proof
  29. Well-ordering principle statement
  30. Proof that Euclidean domains are principal ideal domains proof
  31. Euclidean domains are principal ideal domains statement
  32. Proof of Bézout's identity in a Euclidean domain proof

Where this leads

9 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity, For principal ideal domains
About this page
TagSN89E2RKSA
URIm2://SN89E2RKSA
Kindproof
WritingW0 stub
MSC13F07
ProvesBézout's identity in a Euclidean domain
UsesEuclidean domain, Euclidean domains are principal ideal domains, Principal ideal domain, Ideal, Principal ideal, Ideal generated by a subset, Greatest common divisor in an integral domain, Divisibility in a commutative ring
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.