Scribd
Upload
81 views

Answer Key To Exercise 6

This document contains the answer key for an exercise on mathematical proofs involving sets, relations, and partitions. It includes: 1) Proofs that the Cartesian product of two sets a and b are equal if and only if a and b are equal. 2) Definitions of several equivalence relations on integers modulo 5. 3) Proofs that two relations defined on sets of positive integers are equivalence relations. 4) Verification that a given collection of sets is a partition. 5) A proof that any partition of a set generates an equivalence relation on that set.

Uploaded by

Ronnie Lloyd Javier
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
81 views

Answer Key To Exercise 6

This document contains the answer key for an exercise on mathematical proofs involving sets, relations, and partitions. It includes: 1) Proofs that the Cartesian product of two sets a and b are equal if and only if a and b are equal. 2) Definitions of several equivalence relations on integers modulo 5. 3) Proofs that two relations defined on sets of positive integers are equivalence relations. 4) Verification that a given collection of sets is a partition. 5) A proof that any partition of a set generates an equivalence relation on that set.

Uploaded by

Ronnie Lloyd Javier
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MATH 101 Y

Answer key for exercise 6

First Semester AY 2015-2016


5 October 2015

1. Proof. Let a, b and c be sets.


(a) (5 points) () Suppose a b = b a. Let x a and y b. Then (x, y) a b. Since
a b = b a, (x, y) b a. This implies that x b and y a. Weve shown that a b and
b a. Thus, a = b.
() Suppose a = b. Now, a b = {(x, y)|x a, y b}. Since a = b, x a is equivalent to
x b. Similarly, y b is equivalent to y a. Thus, a b = {(x, y)|x b, y a} = b a.
(b) (3 points) Suppose a b. Let (x, y) a c. By definition, x a and y c. So, well have
x a. But x a implies x b. Thus, x b and y c. Hence, (x, y) b c.
(c) (5 points) Let (x, y) a (b c). Then x a and, y b or y c. By distribitivity, x a
and y b, or x a and y c. By definition, (x, y) a b or (x, y) a c. Hence,
(x, y) (a b) (a c). Weve shown that, a (b c) (a b) (a c).
Let (x, y) (a b) (a c). Then (x, y) (a b) or (x, y) (a c). x a and y b, or
x a and y c. By distributivity, x a and, y b or y c. x a and y b c. That is,
(x, y) a (b c). Thus, (a b) (a c) a (b c).
Therefore, a (b c) = (a b) (a c)
2. (1.5 points per item)
(a) not reflexive, not symmetric, transitive
(b) not reflexive, symmetric, not transitive
(c) reflexive, not symmetric, transitive

(d) reflexive, not symmetric, transitive


(e) reflexive, symmetric, not transitive

3. (a) (9 points) Proof. Define the relation 5 in Z as follows: x 5 y if and only if 5|x y, that is,
x 5 y if and only if k Z such that 5k = x y.
Now, let x Z. 5 0 = x x. Since 0 Z, x 5 x. Hence, 5 is reflexive.
Let y Z such that x 5 y. Then 5k = x y for some k Z. But 5(k) = y x and k Z.
So, 5 is symmetric.
Let z Z such that y 5 z. Then 5l = y z for some l Z. But 5k = x y = x (5l + z).
Well have 5(k + l) = x z. Since k + l Z, x z. That is, 5 is transitive.
Therefore, 5 is an equivalence relation in Z.
(b) (2.5 points)
[0] = {y|5k = y, k Z}
[1] = {y|5k = 1 + y, k Z}
[2] = {y|5k = 2 + y, k Z}

[3] = {y|5k = 3 + y, k Z}
[4] = {y|5k = 4 + y, k Z}

4. (a) (8 points) Proof. Define the relation R in Z+ Z+ as follows:


(a, b)R(c, d) if and only if ad = bc.
Let (a, b) Z+ Z+ . We know that ab = ba since multiplication is commutative in Z+ . So,
(a, b)R(a, b). Thus, R is reflexive.
Let (c, d) Z+ Z+ such that (a, b)R(c, d). Then ad = bc. But bc = ad since = is symmetric
in Z+ . Moreover, multiplication is commutative. Thus, cb=da. So, (c, d)R(a, b). Thus, R is
symmetric.
Let (e, f ) Z+ Z+ such that (c, d)R(e, f ). Then cf = de. Now ad = bc (ad)f = (bc)f
adf = af d = (af )d = b(cf ) = b(de) = (be)d af = be since d 6= 0. So, (a, b)R(e, f ). Thus, R
is transitive.
Therefore, R is an equivalence relation in Z+ Z+ .
(b) (1 point) [(1, 2)] = {(a, b)|b = 2a}
5. (2 points each)
(a) It is not a partition of a since

bA

b = {1, 3, 6, 8, 11} =
6 a.
1

(b) It is not a partition of a since {4, 6} {6, 8, 11} = {6} =


6 and {4, 6} =
6 {6, 8, 11}.
(c) It is not a partition of a since {{}{1, 3}, {6, 11}, {4, 8}}
(d) Let A = {{1}, {3, 6}, {4, 8}, {11}}. A is a partition of a since
i. If b A, then b 6= ;
ii. If b, c A, b c = whenever b 6= c; and
S
iii. a = bA b.
6. (10 points) Proof. Let A be a partition of a set a. Define the relation in a as follows:
xy if and only if b A such that x, y b.
S
S
Now, let x a. Since A is a partition of a, a = bA b. So, x bA b, that is, b A such that
x b. So, b A such that x b and x b. Hence, xx.
Let y a such that xy. Then by b A such that x b and y b. Hence, b A such that y b
and x b. So, yx.
Let z a such that yz. Then by c A such that y c and z c. Since A is a partition of a,
b 6= c implies b c = . But y b and y c, that is, y b c. Hence, b = c. Thus, z b. Weve
shown that x b and z b. Thus, xz.
Therefore, is an equivalence relation in a.
end of exercise
total points: 59

You might also like