Abstract algebra

Abstract Algebra
Algebraic and Ordering Properties of Real Number

(A1) Properties of equality:

(a) For everyaR, a=a (Reflexive property);
(b) Ifa=b, then b=a (Symmetric property);
(c) Ifa=b and b=c, then a=c (Transitive property).
(A2) Addition is well defined: That is, if a,b,c,dR,where a=b and c=d, then a+c=b+d.
(A3) Closure property of addition: For every a,bR, a+bR.
(A4) Associative property of addition: For every a,b,c R, (a+b)+c=a+(b+c)
(A5) Commutative property of addition: For everya,bR, a+b=b+a.
(A6) Existence of an additive identity: There exists an element 0 R with the property
that a+0=a for everyaR.
(A7) Existence of additive inverses: For everyaR, there exists somebRsuch
That a+b=0. Such an element bis called anadditive inverseofa, and is typically
Denoted a to show its relationship to a.We do not assume that only one such b
exists.
(A8) Multiplication is well defined: That is, ifa,b,c,dR,wherea =band c=d,
thenac=bd.
(A9) Closure property of multiplication: For all a,bR,abR. The closure property of
multiplication also holds forN,W,Z, andQ.
(A10)

Associative

property

of

multiplication:

For

everya,b,c R,

(ab)c=

a(bc)or(ab)c=a(bc).
(A11) Commutative property of multiplication: For everya,bR,ab=ba.
(A12) Existence of a multiplicative identity: There exists an element 1R with the
property that a1=a for everyaR.
(A13) Existence of multiplicative inverses: For everyaRexcepta=0, there exists some
bR such that ab=1. Such an element b is called a multiplicative inverse of a and is
typically denoted a-1 to show its relationship to a. As with additive inverses, we do not
assume that only one such b exists. Furthermore, the assumption that a-1 exists for all
a0 does not assume that zero doesnothave a multiplicative inverse. It says nothing
about zero at all.

Abstract algebra

(A14) Distributive property of multiplication over addition: For every a,b,

cR,a(b+c)=(ab)+(ac)=ab+ac,where the multiplication is assumed to be done before
addition in the absence of parentheses.

Theorem 2.3.1 (Cancellation of addition). For all a,b,cR, if a+c = b+c, then a = b.
Proof:
Suppose a+c = b+c
a+c+ (-c) = b+c(-c)

(A7, A2)

a+0 = b+0

(A7)

a=b

(A6)

Theorem 2.3.2. For every aR , a0 = 0

Proof:
Pick aR
a.0 = a.(0+0)

(A7)

a.0 = a.0+a.0

(A14)

0+a.0 = a.0+a.0

(theorem 2.3.1)

0=a.0
Theorem 2.3.3. The additive inverse of a real number is unique.
Proof:
Pick aR
Suppose b, c R inverse of a
Then, a + b = 0 and a + c = 0
Show that b = c
Since a +b = 0 and a + c = 0, then

Abstract algebra

a+b=a+c

(A1, transitive)

b=c

(Theorem 2.3.1)

Thus additive inverse is unique

Theorem 2.3.4. For every aR, (a) = a.
Proof:
Pick (a)R, it means (-a), such that (-a)+ (-(-a)) = 0
(-a) + (-(-a)) = (-a) + a
a + (-a)+ (-(-a)) = a + (-a) + a
0 + (-(-a)) = 0 +a
(-(-a)) = a
Theorem 2.3.5 0 =0
Proof:
Since 0 is additive inverse of 0, then
0 + (- 0) = 0

(A7)

But, for every aR, 0 + a = a. Thus 0 + (-0) = - 0

(A6)

We have 0 + (-0) = 0 and 0 + (-0) = - 0

Thus 0 = - 0
Theorem 2.3.6: If a,bR, then:
(a) (a)b = (ab).
(b) (a)(b) = ab.

Corollary 2.3.7 , 1 =
Corollary 2.3.8 , , + = +

(A1, transitive)

Abstract algebra

Theorem 2.3.9 = 0, =
Theorem 2.3.10 0
Theorem 2.3.11 0, 1

Theorem 2.3.12 , ,
Theorem 2.3.13 ,

= 1 1

= 1

2.3.2 Ordering of Real Numbers

Theorem 2.3.14 > , <
Corollary 2.3.15 . > 0 < 0

2.3.3 Absolute Value

Definition 2.3.16 , ,
=

0;
< 0

Theorem 2.3.17 , =
Theorem 2.3.18 0. = =
Theorem 2.3.19 0. < < <
Corollary 2.3.20 0.
Theorem 2.3.21 0. > > <
Theorem 2.3.22 (N3:Triangle Inequality) , , + +
Theorem 2.3.23 , ,

Abstract algebra

Theorem 2.3.24 , ,
Some theorems will prove in the following exercise.

Exercise Page 59
1. Prove Theorem 2.3.6: If a, b , then:
(a) (a)b = (ab).
(b) (a)(b) = ab.
Answer :
(a) If a, b , then (a)b = (ab)
Proof :
Pick (-a)b , then
(-a)b + (-(-a)b) = 0..(A7)
(-a)b + ab = 0..(Theorem 2.3.4)
Pick (ab) , then
(ab) + ab = 0..(A7)
(-a)b + ab

= - (ab) + ab..(Theorem 2.3.1)

(-a)b = -(ab)

(b) If a, b , then (a)(b) = ab

Proof :

For every ab , there is (ab) is an inverse of ab such that

(ab) + ((ab))= 0

(a)(b) + (a)(b) = a(b+b) (A14)

=(a).0 .(Theorem 2.3.2)
=0

(a)(b) + (a)(b) = (ab) + ((ab)) .(Theorem 2.3.6 (1))

Abstract algebra

(a)(b) + ((ab)) = (ab) + ((ab)) .(Theorem 2.3.1)

(a)(b) = (ab)

2. Prove Theorem 2.3.9: If ac = bc and c = 0, then a = b.

If ac = bc and c 0, then a = b
Proof :
Suppose ac = bc for a, b, c R and c 0
c , there is a 1 , such that . 1 = 1
ac = bc
. 1 = . 1
. 1 = . 1 (12)
=

3.

Prove Theorem 2.3.10: The multiplicative inverse of a = 0 is unique.

Proof:
Pick a, b, c
Supposed that b, c are multiplicative inverse of a.
a.b=1
a.c=1
a.b=a.c
b=c
So that, the multiplicative inverse is unique.

Abstract algebra

4.

Using reasoning similar to the argument for Theorem 2.3.4, prove Theorem 2.3.11:
For all a = 0, (a 1 )1 = a.
Proof:
Pick a , a 0.
a . a 1= 1
a 1. (a 1) 1= 1

a . a 1= a 1. (a 1) 1 (A11)
a 1 . a = a 1. (a 1) 1 (Theorem 2.3.1)
a =(a 1) 1 (A11)
(a 1) 1= a

5.

Prove Theorem 2.3.12: For all nonzero a, b , (ab)1 = a 1 b 1 .

Proof :
Pick a,b , a 0, b 0.

1

6.

=1
= 1 . 1

1 .

= 1

= 1

= 1 1

= 1 1 . (A11)

= 1 1

(12)

Prove the principle of zero products: If ab = 0, then either a = 0 or b = 0.

Proof:

Abstract algebra

ab = 0
ab = a . 0 .(Theorem 2.3.2)
b = 0 .(Theorem 2.3.9)
or
ab = 0
ab = b . 0 .(Theorem 2.3.2)
a = 0 .(Theorem 2.3.9)

7.

Prove (a + b)(c + d ) = ac + ad + bc + bd for all a, b, c, d .

Proof:
(a + b)(c + d ) = ((a + b)c) + ((a+b)d) (A14)
= (c(a+b)) + (d(a+b)) .(A11)
= ca + cb + da + db (A14)
= ac + bc + ad +bd (A5)
= ac + ad + bc + bd

8.

Suppose we replace assumption A15 with the assumption that 1 = 0. Show that, with
this assumption, there are no nonzero real numbers.
Proof:
Pick , 0, suppose 1 = 0
a. 1 = a

(A12)

a. 0 = a

(1 = 0)

0=a

(Theorem 2.3.2)

a = 0 contradict with 0

Abstract algebra

9.

Prove the following.

a. If a < b, then a + c < b + c
Proof:
Suppose a < b. Then a b < 0. So that (a + c) (b + c) = a b < 0. Hence, a + c
< b + c.
b. If a < b and b < c, then a < c.
Proof:
Suppose a < b and b < c . Then a b < 0 and b c < 0 . So that, by A16 we will
find (a b) (b c) = a c < 0. Hence, a < c.
c. If a > b and b > c, then a > c.
Proof:
Suppose a > b and b > c . Then a b > 0 and b c > 0 . So that, by A16 we will
find (a b) (b c) = a c > 0. Hence, a > c.
d. If a < 0 and b < 0, then a + b < 0.
Proof :
If a < 0 and b < 0 0 a > 0 and 0 - b > 0
( 0 - a) + ( 0 - b) > 0
0 ( a + b) > 0
0 > (a + b) or a + b < 0
e. If a > 0 and b < 0, then ab < 0.
Proof :
If a > 0 and b < 0 a > 0 and 0 - b > 0
a (0 b) > 0
a(0) ab > 0
0 ab > 0

ab > 0

Abstract algebra

ab < 0

f. If a < 0 and b < 0, then ab > 0.

Proof :
If a < 0 and b < 0 0 - a > 0 and 0 - b > 0
-a ( b) > 0

ab > 0

g. If a < b and c > 0, then ac < bc.

Proof :
If a < b and c > 0 b - a > 0 and c > 0
( b - a) c > 0
bc ac > 0

bc > ac or ac < bc

h. If a < b and c < 0, then ac > bc.

Proof:
If a < b and c < 0 b - a > 0 and 0 - c > 0
( b - a) (0 c) > 0
(b a) (-c) > 0
-bc + ac > 0
ac > bc
i. If 0 < a < b, then a 2 < b 2 .
Proof:
If 0 < a < b 0 < a and a < b and also b > 0
a > 0 and a < b a2 < ab

.......... (1)

b > 0 and a < b ab < b2 .......(2)

From equation (1) and equation (2) we have

Abstract algebra

a2 < ab < b2, so a2 < b2

j. If a < b < 0, then a 2 > b 2 .
Proof:
If a < b < 0 0 > a , 0 > b and a < b
-a > 0 and a < b -a (b-a) > 0 a2 > ab

(1)

-b > 0 and a < b - b (b a) > 0 ab > b2 ..... (2)

From equation (1) and equation (2) we have
a2 > ab > b2, so a2 > b2
k. 1 > 0.
Proof:
Suppose 1 0
There are two possibilities 1 = 0 or 1 < 0
1 = 0 is false because 1 is identity of multiplication and unique
1 < 0 if a 0 a.1 a.0 or

a 0 is false because a > 0

Therefore 1 > 0
l. For a R, write a 2 = a a. Show that for every a R, a 2 0.
Proof:
a R a2 0
if a = 0 a. a = 0.0 = 0
if a < 0 -a(-a) = a2 > 0
if a > 0 a. a > 0
Therefore for every a R, a2 0
m. Explain why the equation x 2 = 1 has no solution x R.
Suppose x2 = 1 has a solution, suppose a is the solution, so we get
If a > 0, a2 = a.a= -1 (contradiction A18)

Abstract algebra

If a<0, a2=a.a=-1 (contradict 9f)

If a=0, a.a=-1 (contradict thoe 2.3.2)
Thus, x2=-1 has no solution.
10.
a. 01 does not exist in
ans.
b. if > 1 then 1 > 0
Pick > 0, we suppose that 1 0 meaning that 1 < 0 or 1 = 0, we will
prove that 1 > 0

1 . = 1 (Property of A13)
0. = 1
0 = 1 This contradicts the Property of A15

1 . = 1 We know that 1 > 0 meaning that 1 is positive

if > 0 and 1 < 0 then . 1 < 0
1 . = 1 , it contradicts the proof of 9.e

c. if < 0 , then 1 < 0

We can prove this by using its contraposition
if 1 > 0, then > 0 (we dont use 1 = 0 since weve already proven 10.a)
Pick 1 > 0, we suppose that 0 meaning that < 0 or = 0, we will prove
that > 0

1 . = 1 (Property of A13)
1 . 0 = 1
0 = 1 This contradicts the Property of A15

1 . = 1 We know that 1 > 0 meaning that 1 is positive

if 1 > 0 and < 0 then . 1 < 0
1 . = 1 , this contradicts the proof of 9.e
Since the contraposition is correct, then

d. > 1 if and only if 0 < 1 < 1

Abstract algebra

firstly > 1 1 > 0 1 < 1

> 1 1 > 0 has been already proven by 10.b

> 1 1 < 1
>1
. 1 > 1. 1
1 > 1
Secondly, 0 < 1 < 1 > 1
1 > 0 1 < 1 > 1
1 > 0 then we directly know (has been proven) that > 1
1 < 1
. 1 < . 1 Property of A8
1<

e. if > 0 and > 1 , then <

>1
. > . 1 (A18)
. . 1 > . 1. 1 (A18)
. 1 > . 1
>

f. if , and = 1 , then = = 1
there are five cases : = 1, = 0, = 1, > 1, and < 1
case 1
>1
. = 1 > 0
. = 1 = . 1
> 0 , this

11. If , \{0} and < , does it follow that

1

< ? Use results from Exercises 9 and

1

10 to state and prove the relationship between and depending on the signs of and

Abstract algebra

< where < 0 and < 0

1. < 1.
1

. . < . .
1

() < ()

< (9.f)

< where < 0 and > 0

1. < 1.
1

. . < . .

> () (9.h)

< where > 0 and > 0

1. < 1.
1

. . < . .

() < ()

< (9.f)

Since the values of

and

vary upon the cases, it is obvious that the

relationship between depends on the signs of and

12. Prove that if < are real numbers , then <
1 > 0 or 0 < 1
0+1<1+1
1<1+1= 2
0<1<2
0 < 2 or 2 > 0 (9.c)
1

then 21 = 2 > 0 (10.b)

<
1

. 2 < . 2

(9.g)

/2 < /2

+ 2 < 2 + 2 (9.a)

+
2

< . how do you know that 2 > 0

Abstract algebra

<

+
2

(i)

+ 2 < 2 + 2 (9.a)

+
2

< (ii)

(i) and (ii) using 9.b we get

<

+
2

<

13. For all , =

let 0 then < 0
= if < 0 (def. 2.3.16)
= , 0 then =
let < 0, = (def. 2.3.16)
0 so = then from def. above = =
=

14. For all ,

For 0, = (def.) 0,then 0, 0
so that
For 0

= then = 0 , 0

0, 0 so that
and
We can say that

15. Suppose x, y , . Proof the following.

a.

b. 0, 1 =

c. 0, / = /
Proof:

Abstract algebra

a.

=
0, 0, = , =
0

. = . = .

0, < 0, = , =
. < 0

. = . = () = .

< 0, 0, = , =
< 0

. = = . = .

< 0, < 0, = , =
. 0

. = . = . = .

b. 0, 1 =

1 = 1

Suppose 0, =
1 0

=1

= . 1

1 . .

= 1 . . 1

= 1

Suppose < 0, =

1 = 1

=1

= . 1

= . 1

1 . .

. . 1

= 1

c. 0, / = /
. 1 =
For 1 0
. 1 = 1
. 1 = . 1 . 1

Abstract algebra

. 1 = . 1 .
. 1 = . 1 . .

. 1 = . 1 .
. 1 = .

For 1 < 0
. 1 = 1
. 1 = . 1 . 1
. 1 = . 1 .

. 1 = . 1 . .
. 1 = . 1 .
. 1 = .

16. Prove the direction of Theorem 2.3.19: Suppose 0. Then < if

<
Proof:
Let 0
< 0 >
If = 0 means that 0 < < 0 or 0 < < 0 , so = 0 is impossible
If 0, = , because < , so <
If < 0, = =
<
<

<

Abstract algebra

1 < 1
>

Theorem number 19h

17. Proof Theorem 2.3.21: Suppose 0. Then > if and only if either > 0 <
.
Proof:
() Let >
If 0, = ,

= > , >

If < 0, = ,

>

= ,

<
<

() > < >

For > ,

So, >
18. Proof Theorem 2.3.22: , , + +
Proof:

(+)

+ +
+

We use theorem no.16/2.3.19

So, we get
+ +

Abstract algebra

19. Proof Theorem 2.3.23: , ,

Proof:
Let =

+ +
+

20. Proof Theorem 2.3.24: , ,
Proof:

Suppose =

+


.. (1)
In Theorem in number 19, we have (2)
From (1) and (2), we get

By Theorem 2.3.19

21. There are two theorems and one exercise in this section besides Corollary 2.3.8 that can
be worded as The X of the Y is equal to the Y of the X. Find them, and state them in

Abstract algebra

this form.
Ans:
a) Corollary 2.3.8. A negative of addition is equal to an addition of negative
b) Theorem 2.3.13. An inverse of a negative = is equal to negative of an inverse.
c) Exercise 15.b. An absolute of an inverse is equal to An inverse of an absolute.