Set Theory

Prove that, for all sentences P, Q and R, if Q R is true, then the following sentences are
true.
(a) P Q P R
(b) P Q P R
(c) (P Q) (P R)
Prove that for all sentences P, Q, R and S, if P Q and R S are true, then the following
sentences are true.
(a) P R Q S
(b) P R Q S
Prove that if A B, then B A .
Suppose that A = B and C = D. Prove that (a) A C = B D and (b) A C = B D.
Define S + T = (S T ) (T S) for two sets S, T . Prove each of the following.
(a) A B = 0/ A = 0/ and B = 0/
(b) A B = 0/ A B
(c) A + B = 0/ A = B
(d) A C = B C A + B C
(e) (A C) + (B C) = (A + B) C
Prove that if A B and C = B A, then A = B C.
If A, B,C are sets, prove the following.
(a) A (B C) = (A B) (A C)
(b) (A A) (B C) = (A B) (A C)
(c) (A B) (C C) = [(A C) B] [A (B C)]
(d) (A A) (B C) = [(A B) A] [A (A C)]
Let {Ai }iI and {B j } jJ be indexed families of sets. Suppose that for all i I, there exists
j J such that B j Ai . Prove that

Bj

jJ

iI

Ai .

Prove that (A B) = (A ) (B).

Let A and B be sets. Prove the following.
(a) A B if and only if P(A) P(B)
(b) A = B if and only if P(A) = P(B)
(c) P(A) P(B) = P(A B)
(d) P(A) P(B) P(A B)
(e) A B = 0/ if and only if P(A) P(B) = {0}
/
Exhibit the set P(P(0))
/ and P(P(P(0))).
/
Let f : A B and g : A B be functions. Prove that if f g then f = g.
Let f : A B and g : C D be functions. The product of f andg is the function defined
as follows:
( f g)(x, y) = ( f (x), g(y)) for all (x, y) A C
Prove the following.
(a) If f and g are injective then f g is injective.
(b) If f and g are surjective then f g is surjective.
(c) ran( f g) = ran( f ) ran(g).
Let f : A B be a function. Prove that f is in one-to-one correspondence with A, that is,
there is a bijective function g : f A.
Let g : B C and h : B C be functions. Suppose that g f = h f for every function
f : A B. Prove that g = h.
Let f : A B be a function. Prove that f is surjective if and only if, for every pair of
functions g : B C and h : B C, g f = h f implies g = h.
Let f : A B be a function and let C A. Prove that f ( f 1 ( f (C))) = f (C).

Let {Ai }iI and {Bi }iI be the families of sets with the same index set I. Show that if
iI Ai iI Bi , then Ai Bi for all i I.
Let f : A B be a function. Prove the following.
(a) If C A and D A, then f (C) f (D) f (C D).
(b) f (C) f (D) = f (C D) for every pair of subsets C A and D A if and only if f
is injective.
Let H be a reflexive relation in A. Prove that for any relation G in A, G H G and
G G H.
Let G, H be equivalence relations in A. Show that G H is an equivalence relation in A if
and only if G H = H G.
Let {Ai }iI be a partition of A and let {B j } jJ be a partition of B. Prove that {Ai
B j }(i, j)IJ is a partition of A B.
Let G, H be equivalence classes in A. Prove that G H is an equivalence class in A. Also,
prove that (G H)x = Gx Hx for all x A.
Let A be the partially ordered set defined by the line diagram in Figure 1.
(a) List all chains of A.
(b) Draw the line diagram of the set of all chains of A, ordered by inclusion.

F IGURE 1
Let A, B be partially ordered sets and let C be a chain of A and let D be a chain of B. If
A B is ordered lexicographically, prove that C D is a chain of A B.

A subset X of a partially ordered set is called convex if it satisfies the following condition: if a X and b X and a x b, then x X. Let A, B be partially ordered sets, let
f : A B be an increasing function and let C be a convex subset of B. Prove that f 1 (C)
is a convex subset of A.
Let A and B be partially ordered sets, let f : A B be an increasing function and let
H = {(x, y) A A | f (x) = f (y)}. Prove the following.
(a) H is an equivalence relation in A.
(b) Each equivalence class modulo H is a convex subset of A.
Let A be a partially ordered set. For each a A, let Ia = {x A | x a} and let I =
{Ia | a A} ordered by inclusion. Prove that I is isomorphic with A.