Math 101 Exam
Math 101 Exam
Math 101 Exam
Therefore, A B = C.
Therefore, g f is a permutation of A.
Show (g f )1 = f 1 g1.
() Let (z, x) (g f )1 .
= (x, z) g f = y A such that (x, y) f and (y, z) g
= (y, x) f 1 and (z, y) g 1 .
= (z, x) f 1 g 1 .
(g f )1 f 1 g1.
() Let (z, x) f 1 g1
= y A such that (z, y) g 1 and (y, x) f 1 .
= (x, y) f and (y, z) g
= (x, z) g f
= (z, x) (g f )1 .
(g f )1 = f 1 g1.
7. Here, x y iff x is a multiple of y.
8. 8.1 Reflexivity: Consider (x, y) A A. Since x x and y = y, then (x, y)(x, y).
Antisymmetry: Consider (x1 , y1 ) and (x2 , y2 ) AA such that (x1 , y1 )(x2 , y2 ) and (x2 , y2 )(x1 , y1 ).
= x1 x2 , x2 x1 , and y1 = y2 .
= x1 = x2 and y1 = y2 .
Thus, (x1 , y1 ) = (x2 , y2 ).
Transitivity: Consider (x1 , y1 ), (x2 , y2 ), (x3 , y3 ) AA such that (x1 , y1 )(x2 , y2 ) and (x2 , y2 )(x3 , y3 ).
= x1 x2 x3 and y1 = y2 = y3
Hence, (x1 , y1 )(x3 , y3 ).
Therefore, is a partial order on A A.
8.2 Below is the poset diagram.
8.3 Maximal Elements: (5, 1), (5, 2), (5, 3), (5, 4), (5, 5)
Minimal Elements: (1, 1), (1, 2), (1, 3), (1, 4), (1, 5)
8.4 is not a linear order because there are elements which are not comparable. Take (1, 1) and (1, 2)
as examples.
8.5 Take any totally ordered subset. Consider {(1, 1), (2, 1), (3, 1), (4, 1), (5, 1)}.
9. 9.1 Z has subsets which do not have a first element. Take Z which doesnt have a first element.
9.2 The Well Ordering Principle: If A is a non-empty set then there exists a total ordering of A
such that A is well-ordered.
Consider f1 = {(A1 , a1 ), (A2 , a2 ), ..., (An , an ), ...}, f2 = {(A1 , a01 ), (A2 , a02 ), ..., (An , a0n ), ...} F .
Suppose f1 6= f2 .
= k I such that (Ak , ak ) 6= (Ak , a0k ).
= ak 6= a0k
= (a1 , a2 , ..., an , ...) 6= (a01 , a02 , ..., a0n , ...)
Hence, is a function.
Consider f1 F . Then f1 = {(A1 , a1 ), (A2 , a2 ), ..., (An , an ), ...}, for some ai Ai . We see
that (a1 , a2 , ..., an , ..) = f1 . Hence, is injective.
Q Q
Therefore, : iI Ai F is a bijection, and iI Ai and F are equivalent.
10.2 Any choice function would do.
Take for instance {([1], 1), ([2], 2), ([3], 3), ([4], 4), ([0], 5)}.