Abstract Algebra: Integer Multiples and Exponents, Schemes and Mind Maps of Abstract Algebra

The recursive definition of integer multiples and exponents in a ring, as well as the extension of these ideas to subtraction, negative exponents, and zero as an exponent. Theorem 8.5 is also presented, which outlines various properties of integer multiples in a ring. a goal for an activity to outline a proof for part i) of Theorem 8.5.

Typology: Schemes and Mind Maps

2022/2023

Uploaded on 03/14/2023

ammla
ammla 🇺🇸

4.5

(37)

274 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 476 - Abstract Algebra 1
Day 28 Group Assignment Name:
Integer Multiples and Exponents
Definition 8.2 Let Rbe a ring, let n3 be an integer, an let x1, x2,··· , xnR. Then we define x1+x2+···+xn=
(x1+x2+···+xn1) + xnand x1x2· · · xn= (x1x2···xn1)xn.
Note: Definition 8.2 is an example of a recursive definition. That is, it defines the next instance in terms of one or more
previous instances. To complete a particular computation, one would need to apply the recursive definition multiple times.
For example, to compute x1+x2+x3+x4, we could apply the definition as follows:
x1+x2+x3+x4= (x1+x2+x3) + x4;x1+x2+x3= (x1+x2) + x3; compute x1+x2; use the result to compute
(x1+x2) + x3=x1+x2+x3. Then use this second result to compute (x1+x2+x3) + x4=x1+x2+x3+x4.
Definition 8.3 Let Rbe a ring, and let xR. The the expression 1xand x1are both defined to be equal to x; that is,
1x=xand x1=x.
Furthermore, for every integer n2, we define the expressions nx and xnrecursively as follows:
nx =x+x+···+x
|{z }
nterms
=x+x+· · · +x
|{z }
n1 terms
+x= (n1)x+x.
xn=x·x···x
|{z }
nfactors
= (x·x···x)
|{z }
n1 factors
x=xn1x.
Note: We would like to extend these ideas to subtraction, to negative exponents, and to be able to use zero as an exponent.
As we will soon see, some of these notions will work for arbitrary elements in any ring, but others will require our ring and/or
element to have additional properties. For example, we can only take x0= 1 if our ring has a multiplicative identity. Also,
xn=x1nonly makes sense when xis a unit (otherwise, x1does not exist!).
Definition 8.4 Let Rbe a ring, and let nbe a positive integer.
For all xR, we define 0x= 0Rand (n)x=n(x), where xis the additive inverse of x.
If Ris a ring with identity, then for each nonzero xR, we define x0= 1R. If Rdoes not have identity, then x0
remains undefined.
If Ris a ring with identity, then for each unit xR, we define xn= (x1)n, where x1denotes the multiplicative
inverse of x. If Rdoes not have identity, or if xis not a unit in R, then xnremains undefined.
Note: If nis a negative integer, then Definition 8.4 implies that nx = (n)(x) and xn=x1n, where n > 0. These
methods of expressing elements will be useful when proving later results in this section.
Theorem 8.5 Let Rbe a ring and let x, y R, and let mand nbe integers. Then
i). m(x+y) = mx +my. ii). (mx) = m(x) = (m)x
iii). (m+n)x=mx +nx iv). m(nx) = (mn)x
v). m(xy) = (mx)y=x(my) vi). (mx)(ny) = mn(xy).
1. The goal for this activity is to outline a proof for Theorem 8.5 part i).
(a) Briefly explain why parts i) and iii) of Theorem 8.5 are not an immediate consequence of our Ring Axioms.
(b) Our strategy for proving Theorem 8.5 part i) will be to consider three cases: m= 0, m > 0, and m < 0. Prove
the first case, when m= 0.
pf2

Partial preview of the text

Download Abstract Algebra: Integer Multiples and Exponents and more Schemes and Mind Maps Abstract Algebra in PDF only on Docsity!

Math 476 - Abstract Algebra 1 Day 28 Group Assignment Name:

Integer Multiples and Exponents

Definition 8.2 Let R be a ring, let n ≥ 3 be an integer, an let x 1 , x 2 , · · · , xn ∈ R. Then we define x 1 + x 2 + · · · + xn = (x 1 + x 2 + · · · + xn− 1 ) + xn and x 1 x 2 · · · xn = (x 1 x 2 · · · xn− 1 )xn.

Note: Definition 8.2 is an example of a recursive definition. That is, it defines the next instance in terms of one or more previous instances. To complete a particular computation, one would need to apply the recursive definition multiple times. For example, to compute x 1 + x 2 + x 3 + x 4 , we could apply the definition as follows:

x 1 + x 2 + x 3 + x 4 = (x 1 + x 2 + x 3 ) + x 4 ; x 1 + x 2 + x 3 = (x 1 + x 2 ) + x 3 ; compute x 1 + x 2 ; use the result to compute (x 1 + x 2 ) + x 3 = x 1 + x 2 + x 3. Then use this second result to compute (x 1 + x 2 + x 3 ) + x 4 = x 1 + x 2 + x 3 + x 4.

Definition 8.3 Let R be a ring, and let x ∈ R. The the expression 1x and x^1 are both defined to be equal to x; that is, 1 x = x and x^1 = x.

Furthermore, for every integer n ≥ 2, we define the expressions nx and xn^ recursively as follows:

  • nx = x ︸ + x +︷︷ · · · + x︸ n terms

= x ︸ + x +︷︷ · · · + x︸ n−1 terms

+x = (n − 1)x + x.

  • xn^ = x︸ · x︷︷ · · · x︸ n factors

= (x · x · · · x) ︸ ︷︷ ︸ n−1 factors

x = xn−^1 x.

Note: We would like to extend these ideas to subtraction, to negative exponents, and to be able to use zero as an exponent. As we will soon see, some of these notions will work for arbitrary elements in any ring, but others will require our ring and/or element to have additional properties. For example, we can only take x^0 = 1 if our ring has a multiplicative identity. Also, x−n^ =

x−^1

)n only makes sense when x is a unit (otherwise, x−^1 does not exist!).

Definition 8.4 Let R be a ring, and let n be a positive integer.

  • For all x ∈ R, we define 0x = 0R and (−n)x = n(−x), where −x is the additive inverse of x.
  • If R is a ring with identity, then for each nonzero x ∈ R, we define x^0 = 1R. If R does not have identity, then x^0 remains undefined.
  • If R is a ring with identity, then for each unit x ∈ R, we define x−n^ = (x−1)n, where x−^1 denotes the multiplicative inverse of x. If R does not have identity, or if x is not a unit in R, then x−n^ remains undefined.

Note: If n is a negative integer, then Definition 8.4 implies that nx = (−n)(−x) and xn^ =

x−^1

)−n , where −n > 0. These methods of expressing elements will be useful when proving later results in this section.

Theorem 8.5 Let R be a ring and let x, y ∈ R, and let m and n be integers. Then

i). m(x + y) = mx + my. ii). −(mx) = m(−x) = (−m)x

iii). (m + n)x = mx + nx iv). m(nx) = (mn)x

v). m(xy) = (mx)y = x(my) vi). (mx)(ny) = mn(xy).

  1. The goal for this activity is to outline a proof for Theorem 8.5 part i).

(a) Briefly explain why parts i) and iii) of Theorem 8.5 are not an immediate consequence of our Ring Axioms.

(b) Our strategy for proving Theorem 8.5 part i) will be to consider three cases: m = 0, m > 0, and m < 0. Prove the first case, when m = 0.

(c) Now let m > 0, and let P (m) be the statement “m(x + y) = mx + my”. Prove that P (1) is true.

(d) Let k be a positive integer, and assume that P (k) is true. Use this to show that P (k + 1) is true (note that we often use inductive proofs to verify theorems involving recursive definitions). Use this and the previous part to conclude that the result is true for all m ≥ 0

(e) Fill in the missing details for the proof outline on page 95 in your book to prove the case when m < 0.

Theorem 8.7: Let R be ring, let x, y ∈ R, and let m and n be positive integers. Then:

  • xm+n^ = xmxn
  • (xm)n^ = xmn

Note: If R is a ring with identity, then the properties in the Theorem above hold for all non-negative integers m and n (provided that x 6 = 0 since we have not defined 0^0 ). Furthermore, if R is a ring with identity and x is a unit in R, then the above properties hold for all integers m and n.

  1. The proof for each part of Theorem 8.7 are presentation problems (either for today or in class on Wednesday).

Lemma 8.8 Let R be a ring with identity, and let x be a unit in R. Then:

(a) The element x−^1 is a unit in R and

x−^1

= x. (b) For every integer n, xn^ = x · xn−^1. (c) For every integer n, xn^ is a unit and (xn)−^1 =

x−^1

)n .

  1. Prove Lemma 8.8 part (a).
  2. Fill in the missing details to complete the proof of part (b) given on p. 98 of your textbook.