Exercise 4.1

Prove the following “laws of algebra” for , using only axioms (1)-(5):

(a)
If x + y = x, then y = 0.
(b)
0 x = 0. [Hint: Compute (x + 0) x.]
(c)
0 = 0.
(d)
(x) = x.
(e)
x(y) = (xy) = (x)y.
(f)
(1)x = x.
(g)
x(y z) = xy xz.
(h)
(x + y) = x y; (x y) = x + y.
(i)
If x0 and x y = x, then y = 1.
(j)
xx = 1 if x0.
(k)
x1 = x.
(l)
x0 and y0 xy0.
(m)
(1y)(1z) = 1(yz) if y,z0.
(n)
(xy)(wz) = (xw)(yz) if y,z0.
(o)
(xy) + (wz) = (xz + wy)(yz) if y,z0.
(p)
x0 1x0.
(q)
1(wz) = zw if w,z0.
(r)
(xy)(wz) = (xz)(yw) if y,w,z0.
(s)
(ax)y = a(xy) if y0.
(t)
(x)y = x(y) = (xy) if y0.

Answers

Lemma 1. x + y = x + z if and only if y = z.

Proof. (⇐) Clearly if y = z then x + y = x + z since the + operation is a function.

(⇒) If x + y = x + z then we have

y = y + 0 (by (3)) = 0 + y (by (2)) = (x + (x)) + y (by (4)) = (x + x) + y (by (2)) = x + (x + y) (by (1)) = x + (x + z) (by what was just shown for (⇐)) = (x + x) + z (by (1)) = (x + (x)) + z (by (2)) = 0 + z (by (4)) = z + 0 (by (2)) = z (by (3))

as desired. □

Lemma 2. If x0 then x y = x z if and only if y = z.

Proof. (⇐) Clearly if y = z then x y = x z since the operation is a function.

(⇒) If x y = x z then we have

y = y 1 (by (3)) = 1 y (by (2)) = (x 1 x ) y (by (4), noting that x0) = (1 x x) y (by (2)) = 1 x (x y) (by (1)) = 1 x (x z) (by what was just shown for (⇐)) = (1 x x) z (by (1)) = (x 1 x ) z (by (2)) = 1 z (by (4)) = z 1 (by (2)) = z (by (3))

as desired. □

Lemma 3. 1(yz) = 1(zy) if y,z0.

Proof. We have (zy) 1(yz) = (yz) 1(yz) = 1 by (2) followed by (4) so that 1(yz) is a reciprocal of zy. Since this reciprocal is unique, however, it must be that 1(yz) = 1(zy) as desired. □

Main Problem.

(a)
If x + y = x, then y = 0.

Proof. Clearly by (3) we have x + 0 = x = x + y so that it has to be that y = 0 by Lemma 1 . □

(b)
0 x = 0. [Hint: Compute (x + 0) x.]

Proof. We have

x x + 0 x = x x + x 0 (since 0 x = x 0 by (2)) = x (x + 0) (by (5)) = x x. (since x + 0 = x by (3))

Thus it must be that 0 x = 0 by part (a). □

(c)
0 = 0.

Proof. By (4) we have 0 + (0) = 0 so that it has to be that 0 = 0 by part (a). □

(d)
(x) = x.

Proof. We have

(x) = (x) + 0 (by (3)) = (x) + (x + (x)) (by (4)) = (x) + ((x) + x) (by (2)) = ((x) + (x)) + x (by (1)) = ((x) + ((x))) + x (by (2)) = 0 + x (by (4)) = x + 0 (by (2)) = x (by (3))

as desired. □

(e)
x(y) = (xy) = (x)y.

Proof. First we have

x(y) = x(y) + 0 (by (3)) = x(y) + (xy + ((xy)) (by (4)) = (x(y) + xy) + ((xy)) (by (1)) = x(y + y) + ((xy)) (by (5)) = x(y + (y)) + ((xy)) (by (2)) = x 0 + ((xy)) (by (4)) = 0 x + ((xy)) (by (2)) = 0 + ((xy)) (by part(b)) = (xy) + 0 (by (2)) = (xy). (by (3))

We also have

(x)y = y(x) (by (2)) = (yx) (by what was just shown) = (xy) (by (2))

so that the result follows since equality is transitive. □

(f)
(1)x = x.

Proof. We have

(1)x = (1 x) (by part(e)) = (x 1) (by (2)) = x (since x 1 = x by (3))

as desired. □

(g)
x(y z) = xy xz.

Proof. We have

x(y z) = x(y + (z)) (by the definition of subtraction) = xy + x(z) (by (5)) = xy + ((xz)) (by part(e)) = xy xz (by the definition of subtraction)

as desired. □

(h)
(x + y) = x y; (x y) = x + y.

Proof. We have

(x + y) = (1)(x + y) (by part (f)) = (1)x + (1)y (by (5)) = x + (y) (by part (f) twice) = x y (by the definition of subtraction)

and

(x y) = (x + (y)) (by the definition of subtraction) = x (y)) (by what was just shown) = x + ((y)) (by the definition of subtraction) = x + y (by part (d))

as desired. □

(i)
If x0 and x y = x, then y = 1.

Proof. By (3) we have x 1 = x = x y so that it has to be that y = 1 by Lemma 2 , noting that this applies since x0. □

(j)
xx = 1 if x0.

Proof. By the definition of division we have xx = x (1x) = 1 by (4) since x0 and 1x is defined as the reciprocal (i.e. the multiplicative inverse) of x. □

(k)
x1 = x.

Proof. First, we have by (4) that 1 (11) = 1, where 11 is the reciprocal of 1. We also have that 1 (11) = (11) 1 = 11 by (2) and (3). Therefore 11 = 1 (11) = 1 so that 1 is its own reciprocal. Then, by the definition of division, we have x1 = x (11) = x 1 = x by (3). □

(l)
x0 and y0 xy0.

Proof. Suppose that x0 and y0. Also suppose to the contrary that xy = 0. Since y0 it follows from (4) that 1y exists. So, we have (xy) (1y) = 0 (1y) = 0 by part (b). We also have

(xy) 1 y = x (y 1 y ) (by (1)) = x 1 (by (4)) = x (by (3))

so that x = (xy) (1y) = 0, which is a contradiction since we supposed that x0. Hence it must be that xy0 as desired. □

(m)
(1y)(1z) = 1(yz) if y,z0.

Proof. We have

(yz) (1 y 1 z ) = (yz) (1 z 1 y ) (by (2)) = ((yz) 1 z ) 1 y (by (1)) = (y (z 1 z )) 1 y (by (1)) = (y 1) 1 y (by (4)) = y 1 y (by (3)) = 1 (by (4))

so that (1y)(1z) is a multiplicative inverse of yz. Since this inverse is unique by (4), however, it has to be that (1y)(1z) = 1(yz) as desired. □

(n)
(xy)(wz) = (xw)(yz) if y,z0.

Proof. We have

x y w z = (x 1 y ) (w 1 z ) (by the definition of division) = (x 1 y ) (1 z w) (by (2)) = ( (x 1 y ) 1 z )w (by (1)) = (x (1 y 1 z ))w (by (1)) = (x)w (by part (m) since y,z0) = (x)w (by (2)) = (xw) (by (1)) = (xw) (by (2)) = xw yz (by the definition of division)

as desired. □

(o)
(xy) + (wz) = (xz + wy)(yz) if y,z0.

Proof. We have

x y + w z = x y 1 + w z 1 (by (3)) = x y z z + w z y y (by part (j)) = xz yz + wy zy (by part(n)) = (xz) 1 yz + (wy) 1 zy (by the definition of division) = (xz) 1 yz + (wy) 1 yz (by Lemma 3 ) = 1 yz(xz) + 1 yz(wy) (by (2)) = 1 yz (xz + wy) (by (5)) = (xz + wy) 1 yz (by (2)) = xz + wy yz (by the definition of division)

as desired. □

(p)
x0 1x0.

Proof. Suppose that x0 but 1x = 0. Then we first have that x (1x) = x 0 = 0 x = 0 by (2) and part (b). However, we also have x (1x) = 1 by (4). Hence we have 0 = x (1x) = 1, which is a contradiction since we know that 0 and 1 are distinct by (3). So, if we accept that x0, then it must be that 1x0 also. □

(q)
1(wz) = zw if w,z0.

Proof. We have

w z z w = wz zw (by part (n) since w,z0) = (wz) 1 zw (by the definition of division) = (wz) 1 wz (by Lemma 3  since w,z0) = 1 (by (4))

so that by definition zw is the reciprocal of wz. Since this is unique by (4) we then have zw = 1(wz) as desired. □

(r)
(xy)(wz) = (xz)(yw) if y,w,z0.

Proof. We have

xy wz = x y 1 wz (by the definition of division) = x y z w (by part (q) since w,z0) = xz yw (by part (n) since y,w0)

as desired. □

(s)
(ax)y = a(xy) if y0.

Proof. We have

ax y = (ax) 1 y (by the definition of division) = a (x 1 y ) (by (1)) = a x y (by the definition of division)

as desired. □

(t)
(x)y = x(y) = (xy) if y0.

Proof. We have

x y = (x) 1 y (by the definition of division) = ((1)x) 1 y (by part (f)) = (1) (x 1 y ) (by (1)) = (1)x y (by the definition of division) = (x y ). (by part (f))

Now, we have (1)(1) = (1) = 1 by parts (f) and (d) so that 1 is its own reciprocal, since the reciprocal is unique, i.e. 1(1) = 1. We also have

x y = (x) 1 y (by the definition of division) = ((1)x) 1 y (by part (f)) = (x(1)) 1 y (by (2)) = x ((1)1 y ) (by (1)) = x ( 1 1 1 y ) (by what was just shown above) = x 1 (1)y (part (m) since y0) = x 1 y (by part (f))

so that (xy) = (x)y = x(y) as desired. □

User profile picture
2019-12-01 00:00
Comments