DOCSLIB.ORG

Prime Ideals in Commutative Rings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Prime Ideals in Commutative Rings PRIME IDEALS IN COMMUTATIVE RINGS APPROVED: Majbr Professor Minor Professor r x Director of the Department of Mathematics PRIME IDEALS IN COMMUTATIVE RINGS THESIS Presented to the Graduate Council of the North Texas State University in Partial Fulfillment of the Requirements For the Degree of MASTER OF SCIENCE By Marlene H. Clayton, B. S, Denton, Texas August, 1970 TABLE OP CONTENTS Chapter Page I. MULTIPLICATIVELY CLOSED SETS AMD PRINCIPAL PRIMES 1 II. FACTORIZATION OF IDEALS 16 III. MAXIMAL AND MINIMAL PRIMES 22 IV. PRIME IDEALS IN RINGS WITH THE DESCENDING CHAIN CONDITION 56 BIBLIOGRAPHY ..... 40 1X1 CHAPTER I MULTIPLICATIVELY CLOSED SETS AND PRINCIPAL PRIMES This thesis is a study of some properties of prime ideals in commutative rings with unity. Throughout the thesis the symbols €, d , and < will mean is an element of/' set containment, and proper set containment, respectively. Capital letters will denote sets and lower case letters wi-11 denote elements of sets. All rings will he commutative and have a multiplicative identity (i.e. unity element) unless otherwise stated. Definition 1.1: The ideal P in a ring- R is a prime ideal if and only if for a, b e R, ab € P implies a e P or b € P. Theorem 1.2; If I is an ideal in a ring R, then I is a prime ideal if and only if R/I is an integral domain. Proof; Suppose I is a prime ideal. Let + I)(r2 + I) =0+1=1, where r^ + I and r^ + I belong to R/I. Now by multiplication of residue classes this implies *"^2 + ^ = 0 + !• Since a + I = b. + I if and only if a - b e I then r^g - 0 s I, > or r 1r2 e I. But I is a prime ideal so either r^ e I which Implies r^ + I = I (because residue classes are either identi- cal or disjoint) or r? e I which implies r2 + I = I. 1 Suppose R/I is an integral domain. Let ab e I, ab also belongs to ab + I and hence ab +1=0+1=1. This says (a + l)(b + I) = I, but since R/I is an integral do- main there are no non-zero divisors of zero and hence a+I=Iorb+I=I. If a + I = I this implies a e I. If b + I = I this implies b € I. Definition 1.5; A subset S of a ring R is said to be muitiplicatively closed if and only if S is not empty5 S does not contain the zero element of R, and if a, b e S, then ab e S. Theorem 1.4: If I is an ideal in R such that I ^ R, let S = R\lJ then I is prime if and only if S is muitipli- catively closed. Proof; Suppose I is prime. The set S is not empty because I 4 R implies 1 I which says 1 € S. The zero element belongs to I and hence o | S. Let a, b e S, then since S = r\i, a, b | I, Now either ab e S or ab | S. Assume ab | S. Then ab e I and hence either a e I or b e I. But this contradicts the fact that a, b | I, Therefore, the assumption that ab | S is false and hence ab e S. Suppose now that S is muitiplicatively closed. Let ab e 1, and hence ab | S. Since S is a muitiplicatively closed set then we consider these cases: (1) a, b both do not belong to S which implies a, b e I, 3 (2) a e S and b | S which implies b e I, (5) a | S and b e S which implies a e I, or (4) a € S and b € S which implies ab e S but that contradicts the fact that ab | S. Thus, in the three cases which can occur, either a e I or b e I. Lemma 1.5: Let R be a commutative ring with unity. Let S = {a-p a2, a^, ••• , an, ...3, where a^ e R for i = 1, 2, 5} •••. Denote by (s) the collection of all finite sums of the form S r^a^ where r^ e R and a^ e S then (S) is an ideal. In the event that S is a finite set, say ## a S C^l^ ^ ^ * s n}, the notation ^ a~j, a^>, ^ ^ ^n^ is sometimes used instead of (S). ft Proof: Let x € (S) and r e R, then x = Sr,a. where is| 1 1 r^ £ R and a^ e S, and n is a positive integer. Now rx = r i-Ir. a. =5Z?(r v . a.7 ) = 5Z(rrv y. ) a. and rr. e R for all i=/ 11 •_/ l i *.( i I l i = 1, 2, 3, n. The finite sum/lI ?(r. a. ) belongs to l-i 1 x (S), and hence, rx e (S). m Let z and y belong to (S), then z = ]EIr.a. where r. € R ;«i 1 1 1 and a. e S, and m is a positive integer. The element t _ y =S r.a. where r . e R and a. e S, and t is a positive i J J J J integer. Now let r. = -r . and a. = a . for j = 1, 2, 3, • J 3 j 4^ ... , t. Then z - y =ZZr.a. --Lr .a. i i js, j j = Sr. a, -iZ(~r ^0 a J_. m •=J i i +o m+j m -fc = 22 r. a. +5~'r , . a , . 1 1 m+J ra+J ,r.a.. I* i 1 1 Therefore, z - y e (S), hence (S) is an ideal in R. Lemma 1.6: If R is a commutative ring with unity and I is an ideal of R such that I 4 and a is a fixed element of R\I, then the set S such that S = {x | x = i + ra where i e I, r e R and a is a fixed element of R\l) is an ideal in R. Proof: Let s e S and r e R, then s = i + r-^a for some i e I and r^ e R. Now rs = r(i + r1a) = ri + (rr.^) a, where ri e I and rr^ e R. Hence rs e S. Let x, y e S, then x = i + ra and y = I + ra for some ±} i e I, r, r s R. Now x - y = (i + ra) - (i + ra) = (i - I) 4- ra - ra = (i - i) + a(r - r), where i - I € I and r ~ r e R. Hence, x - y e Sa and thus S is an ideal in R. Definition 1.7* If I is an ideal in R and a e R, a | I, let (I, a) denote the ideal generated by all the elements in I and by a. Theorem 1.81 Let S be a multiplicatively closed set in a ring R, and let I be an ideal in R maximal with respect to the exclusion of S. Then I is prime. Proof» Let a, b £ R and ab € I, and assume a, b | I. Consider the ideals (I, a) and (I, b). Now (I, a)DI, (I, b)3I and hence (I, a) and I, b) each contain an element in S, since I is maximal with respect to the exclusion of S. 5 Let s^ be an element in (I, a) such that e S} and let Sg he an element in (I, b) such that Sg e S. Hence s^ = i^ + r^a where i^ € I and e R, and Sg = ig + r^b where ig e I and rg e R. Now s-^Sg belongs to S because S is a multiplicatively closed set, therefore s-^Sg = (i^ + r^a)(ig + rgb) = + ^lr21:) + rla^"2 + rir2ak* But i-^ig € i]_(r2lD) € ^-2^rl8^ € al3^rlr2^ € ^ since I is closed under addition then s^Sg e I, but this contradicts our hypothesis and hence our assumption that a, b | I is false. Therefore, a € I or b € I. Definition 1.9* A non-unit element p e R is called a principal prime if the principal ideal (p) is prime and non-zero. Definition 1.10* An element u e R is called a unit if and only if there exists an element w e R such that uw = 1, where 1 is the unity in R. Definition 1.11! An element a e R is called an irreducible element if and only if a is not a unit and a = be implies b is a unit or c is a unit. Lemma 1.12: In an integral domain D with unity a principal prime element p. is an irreducible element. Proof: Let p be a principal prime element in Da then (p) is a prime ideal in D. Assume p is not an irreducible element. Then p = ab where neiths r a nor b is a unit in D. Now ab = p implies ab e (p). Since (p) is a prime ideal then either a e (p) or b € (p). 6 Suppose a e (p), then a = pk where k e D. Now ab = p so by substitution (pk)*b = P p•(kb) = P p-(kb) = p.l and by the cancellation law kb = 1. Hence b is a unit which contradicts our assumption. In a similar way if b € (p) then a would be a unit. Therefore, our assumption that p is not irreducible is false and, therefore, in an integral with unity a principal prime is an irreducible element.
Load more

Recommended publications
  • Dimension Theory and Systems of Parameters
    Dimension theory and systems of parameters Krull's principal ideal theorem Our next objective is to study dimension theory in Noetherian rings. There was initially amazement that the results that follow hold in an arbitrary Noetherian ring. Theorem (Krull's principal ideal theorem). Let R be a Noetherian ring, x 2 R, and P a minimal prime of xR. Then the height of P ≤ 1. Before giving the proof, we want to state a consequence that appears much more general. The following result is also frequently referred to as Krull's principal ideal theorem, even though no principal ideals are present. But the heart of the proof is the case n = 1, which is the principal ideal theorem. This result is sometimes called Krull's height theorem. It follows by induction from the principal ideal theorem, although the induction is not quite straightforward, and the converse also needs a result on prime avoidance. Theorem (Krull's principal ideal theorem, strong version, alias Krull's height theorem). Let R be a Noetherian ring and P a minimal prime ideal of an ideal generated by n elements. Then the height of P is at most n. Conversely, if P has height n then it is a minimal prime of an ideal generated by n elements. That is, the height of a prime P is the same as the least number of generators of an ideal I ⊆ P of which P is a minimal prime. In particular, the height of every prime ideal P is at most the number of generators of P , and is therefore finite.
    [Show full text]
  • Prime Ideals in Polynomial Rings in Several Indeterminates
    PROCEEDINGS OF THE AMIERICAN MIATHEMIIATICAL SOCIETY Volume 125, Number 1, January 1997, Pages 67 -74 S 0002-9939(97)03663-0 PRIME IDEALS IN POLYNOMIAL RINGS IN SEVERAL INDETERMINATES MIGUEL FERRERO (Communicated by Ken Goodearl) ABsTrRAcr. If P is a prime ideal of a polynomial ring K[xJ, where K is a field, then P is determined by an irreducible polynomial in K[x]. The purpose of this paper is to show that any prime ideal of a polynomial ring in n-indeterminates over a not necessarily commutative ring R is determined by its intersection with R plus n polynomials. INTRODUCTION Let K be a field and K[x] the polynomial ring over K in an indeterminate x. If P is a prime ideal of K[x], then there exists an irreducible polynomial f in K[x] such that P = K[x]f. This result is quite old and basic; however no corresponding result seems to be known for a polynomial ring in n indeterminates x1, ..., xn over K. Actually, it seems to be very difficult to find some system of generators for a prime ideal of K[xl,...,Xn]. Now, K [x1, ..., xn] is a Noetherian ring and by a converse of the principal ideal theorem for every prime ideal P of K[x1, ..., xn] there exist n polynomials fi, f..n such that P is minimal over (fi, ..., fn), the ideal generated by { fl, ..., f}n ([4], Theorem 153). Also, as a consequence of ([1], Theorem 1) it follows that any prime ideal of K[xl, X.., Xn] is determined by n polynomials.
    [Show full text]
  • Formal Power Series - Wikipedia, the Free Encyclopedia
    Formal power series - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Formal_power_series Formal power series From Wikipedia, the free encyclopedia In mathematics, formal power series are a generalization of polynomials as formal objects, where the number of terms is allowed to be infinite; this implies giving up the possibility to substitute arbitrary values for indeterminates. This perspective contrasts with that of power series, whose variables designate numerical values, and which series therefore only have a definite value if convergence can be established. Formal power series are often used merely to represent the whole collection of their coefficients. In combinatorics, they provide representations of numerical sequences and of multisets, and for instance allow giving concise expressions for recursively defined sequences regardless of whether the recursion can be explicitly solved; this is known as the method of generating functions. Contents 1 Introduction 2 The ring of formal power series 2.1 Definition of the formal power series ring 2.1.1 Ring structure 2.1.2 Topological structure 2.1.3 Alternative topologies 2.2 Universal property 3 Operations on formal power series 3.1 Multiplying series 3.2 Power series raised to powers 3.3 Inverting series 3.4 Dividing series 3.5 Extracting coefficients 3.6 Composition of series 3.6.1 Example 3.7 Composition inverse 3.8 Formal differentiation of series 4 Properties 4.1 Algebraic properties of the formal power series ring 4.2 Topological properties of the formal power series
    [Show full text]
  • Algebraic Number Theory
    Algebraic Number Theory William B. Hart Warwick Mathematics Institute Abstract. We give a short introduction to algebraic number theory. Algebraic number theory is the study of extension fields Q(α1; α2; : : : ; αn) of the rational numbers, known as algebraic number fields (sometimes number fields for short), in which each of the adjoined complex numbers αi is algebraic, i.e. the root of a polynomial with rational coefficients. Throughout this set of notes we use the notation Z[α1; α2; : : : ; αn] to denote the ring generated by the values αi. It is the smallest ring containing the integers Z and each of the αi. It can be described as the ring of all polynomial expressions in the αi with integer coefficients, i.e. the ring of all expressions built up from elements of Z and the complex numbers αi by finitely many applications of the arithmetic operations of addition and multiplication. The notation Q(α1; α2; : : : ; αn) denotes the field of all quotients of elements of Z[α1; α2; : : : ; αn] with nonzero denominator, i.e. the field of rational functions in the αi, with rational coefficients. It is the smallest field containing the rational numbers Q and all of the αi. It can be thought of as the field of all expressions built up from elements of Z and the numbers αi by finitely many applications of the arithmetic operations of addition, multiplication and division (excepting of course, divide by zero). 1 Algebraic numbers and integers A number α 2 C is called algebraic if it is the root of a monic polynomial n n−1 n−2 f(x) = x + an−1x + an−2x + ::: + a1x + a0 = 0 with rational coefficients ai.
    [Show full text]
  • A Review of Commutative Ring Theory Mathematics Undergraduate Seminar: Toric Varieties
    A REVIEW OF COMMUTATIVE RING THEORY MATHEMATICS UNDERGRADUATE SEMINAR: TORIC VARIETIES ADRIANO FERNANDES Contents 1. Basic Definitions and Examples 1 2. Ideals and Quotient Rings 3 3. Properties and Types of Ideals 5 4. C-algebras 7 References 7 1. Basic Definitions and Examples In this first section, I define a ring and give some relevant examples of rings we have encountered before (and might have not thought of as abstract algebraic structures.) I will not cover many of the intermediate structures arising between rings and fields (e.g. integral domains, unique factorization domains, etc.) The interested reader is referred to Dummit and Foote. Definition 1.1 (Rings). The algebraic structure “ring” R is a set with two binary opera- tions + and , respectively named addition and multiplication, satisfying · (R, +) is an abelian group (i.e. a group with commutative addition), • is associative (i.e. a, b, c R, (a b) c = a (b c)) , • and the distributive8 law holds2 (i.e.· a,· b, c ·R, (·a + b) c = a c + b c, a (b + c)= • a b + a c.) 8 2 · · · · · · Moreover, the ring is commutative if multiplication is commutative. The ring has an identity, conventionally denoted 1, if there exists an element 1 R s.t. a R, 1 a = a 1=a. 2 8 2 · ·From now on, all rings considered will be commutative rings (after all, this is a review of commutative ring theory...) Since we will be talking substantially about the complex field C, let us recall the definition of such structure. Definition 1.2 (Fields).
    [Show full text]
  • 6. PID and UFD Let R Be a Commutative Ring. Recall That a Non-Unit X ∈ R Is Called Irreducible If X Cannot Be Written As A
    6. PID and UFD Let R be a commutative ring. Recall that a non-unit x R is called irreducible if x cannot be written as a product of two non-unit elements of R i.e.∈x = ab implies either a is an unit or b is an unit. Also recall that a domain R is called a principal ideal domain or a PID if every ideal in R can be generated by one element, i.e. is principal. 6.1. Lemma. (a) Let R be a commutative domain. Then prime elements in R are irreducible. (b) Let R be a PID. Then an irreducible in R is a prime element. Proof. (a) Let (p) be a prime ideal in R. If possible suppose p = uv.Thenuv (p), so either u (p)orv (p), if u (p), then u = cp,socv = 1, that is v is an unit. Similarly,∈ if v (p), then∈ u is an∈ unit. ∈ ∈(b) Let p R be irreducible. Suppose ab (p). Since R is a PID, the ideal (a, p)hasa generator, say∈ x, that is, (x)=(a, p). Then ∈p (x), so p = xu for some u R. Since p is irreducible, either u or x must be an unit and we∈ consider these two cases seperately:∈ In the first case, when u is an unit, then x = u−1p,soa (x) (p), that is, p divides a.Inthe second case, when x is a unit, then (a, p)=(1).So(∈ ab,⊆ pb)=(b). But (ab, pb) (p). So (b) (p), that is p divides b.
    [Show full text]
  • Algebra 557: Weeks 3 and 4
    Algebra 557: Weeks 3 and 4 1 Expansion and Contraction of Ideals, Primary ideals. Suppose f : A B is a ring homomorphism and I A,J B are ideals. Then A can be thought→ of as a subring of B. We denote by⊂ Ie ( expansion⊂ of I) the ideal IB = f( I) B of B, and by J c ( contraction of J) the ideal J A = f − 1 ( J) A. The following are easy to verify: ∩ ⊂ I Iec, ⊂ J ce J , ⊂ Iece = Ie , J cec = J c. Since a subring of an integral domain is also an integral domain, and for any prime ideal p B, A/pc can be seen as a subring of B/p we have that ⊂ Theorem 1. The contraction of a prime ideal is a prime ideal. Remark 2. The expansion of a prime ideal need not be prime. For example, con- sider the extension Z Z[ √ 1 ] . Then, the expansion of the prime ideal (5) is − not prime in Z[ √ 1 ] , since 5 factors as (2 + i)(2 i) in Z[ √ 1 ] . − − − Definition 3. An ideal P A is called primary if its satisfies the property that for all x, y A, xy P , x P⊂, implies that yn P, for some n 0. ∈ ∈ ∈ ∈ ≥ Remark 4. An ideal P A is primary if and only if all zero divisors of the ring A/P are nilpotent. Since⊂ thsi propert is stable under passing to sub-rings we have as before that the contraction of a primary ideal remains primary. Moreover, it is immediate that Theorem 5.
    [Show full text]
  • 6. Localization
    52 Andreas Gathmann 6. Localization Localization is a very powerful technique in commutative algebra that often allows to reduce ques- tions on rings and modules to a union of smaller “local” problems. It can easily be motivated both from an algebraic and a geometric point of view, so let us start by explaining the idea behind it in these two settings. Remark 6.1 (Motivation for localization). (a) Algebraic motivation: Let R be a ring which is not a field, i. e. in which not all non-zero elements are units. The algebraic idea of localization is then to make more (or even all) non-zero elements invertible by introducing fractions, in the same way as one passes from the integers Z to the rational numbers Q. Let us have a more precise look at this particular example: in order to construct the rational numbers from the integers we start with R = Z, and let S = Znf0g be the subset of the elements of R that we would like to become invertible. On the set R×S we then consider the equivalence relation (a;s) ∼ (a0;s0) , as0 − a0s = 0 a and denote the equivalence class of a pair (a;s) by s . The set of these “fractions” is then obviously Q, and we can define addition and multiplication on it in the expected way by a a0 as0+a0s a a0 aa0 s + s0 := ss0 and s · s0 := ss0 . (b) Geometric motivation: Now let R = A(X) be the ring of polynomial functions on a variety X. In the same way as in (a) we can ask if it makes sense to consider fractions of such polynomials, i.
    [Show full text]
  • Prime Ideals in B-Algebras 1 Introduction
    International Journal of Algebra, Vol. 11, 2017, no. 7, 301 - 309 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.7838 Prime Ideals in B-Algebras Elsi Fitria1, Sri Gemawati, and Kartini Department of Mathematics University of Riau, Pekanbaru 28293, Indonesia 1Corresponding author Copyright c 2017 Elsi Fitria, Sri Gemawati, and Kartini. This article is distributed un- der the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper, we introduce the definition of ideal in B-algebra and some relate properties. Also, we introduce the definition of prime ideal in B-algebra and we obtain some of its properties. Keywords: B-algebras, B-subalgebras, ideal, prime ideal 1 Introduction In 1996, Y. Imai and K. Iseki introduced a new algebraic structure called BCK-algebra. In the same year, K. Iseki introduced the new idea be called BCI-algebra, which is generalization from BCK-algebra. In 2002, J. Neggers and H. S. Kim [9] constructed a new algebraic structure, they took some properties from BCI and BCK-algebra be called B-algebra. A non-empty set X with a binary operation ∗ and a constant 0 satisfying some axioms will construct an algebraic structure be called B-algebra. The concepts of B-algebra have been disscussed, e.g., a note on normal subalgebras in B-algebras by A. Walendziak in 2005, Direct Product of B-algebras by Lingcong and Endam in 2016, and Lagrange's Theorem for B-algebras by JS. Bantug in 2017.
    [Show full text]
  • Elements of Minimal Prime Ideals in General Rings
    Elements of minimal prime ideals in general rings W.D. Burgess, A. Lashgari and A. Mojiri Dedicated to S.K. Jain on his seventieth birthday Abstract. Let R be any ring; a 2 R is called a weak zero-divisor if there are r; s 2 R with ras = 0 and rs 6= 0. It is shown that, in any ring R, the elements of a minimal prime ideal are weak zero-divisors. Examples show that a minimal prime ideal may have elements which are neither left nor right zero-divisors. However, every R has a minimal prime ideal consisting of left zero-divisors and one of right zero-divisors. The union of the minimal prime ideals is studied in 2-primal rings and the union of the minimal strongly prime ideals (in the sense of Rowen) in NI-rings. Mathematics Subject Classification (2000). Primary: 16D25; Secondary: 16N40, 16U99. Keywords. minimal prime ideal, zero-divisors, 2-primal ring, NI-ring. Introduction. E. Armendariz asked, during a conference lecture, if, in any ring, the elements of a minimal prime ideal were zero-divisors of some sort. In what follows this question will be answered in the positive with an appropriate interpretation of \zero-divisor". Two very basic statements about minimal prime ideals hold in a commutative ring R: (I) If P is a minimal prime ideal then the elements of P are zero-divisors, and (II) the union of the minimal prime ideals is M = fa 2 R j 9 r 2 R with ar 2 N∗(R) but r2 = N∗(R)g, where N∗(R) is the prime radical.
    [Show full text]
  • Ring (Mathematics) 1 Ring (Mathematics)
    Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right.
    [Show full text]
  • 9. Gauss Lemma Obviously It Would Be Nice to Have Some More General Methods of Proving That a Given Polynomial Is Irreducible. T
    9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beau- tiful and due to Gauss. The basic idea is as follows. Suppose we are given a polynomial with integer coefficients. Then it is natural to also consider this polynomial over the rationals. Note that it is much easier to prove that this polynomial is irreducible over the integers than it is to prove that it is irreducible over the rationals. For example it is clear that x2 − 2 is irreducible overp the integers. In fact it is irreducible over the rationals as well, that is, 2 is not a rational number. First some definitions. Definition 9.1. Let R be a commutative ring and let a1; a2; : : : ; ak be a sequence of elements of R. The gcd of a1; a2; : : : ; ak is an element d 2 R such that (1) djai, for all 1 ≤ i ≤ k. 0 0 (2) If d jai, for all 1 ≤ i ≤ k, then d jd. Lemma 9.2. Let R be a UFD. Then the gcd of any sequence a1; a2; : : : ; ak of elements of R exists. Proof. There are two obvious ways to proceed. The first is to take a common factorisation of each ai into a product of powers of primes, as in the case k = 2. The second is to recursively construct the gcd, by setting di to be the gcd of di−1 and ai and taking d1 = a1. In this case d = dk will be a gcd for the whole sequence a1; a2; : : : ; ak.
    [Show full text]