CHAPTER - 2

SET THEORY
FORMULAE :
(1) Theorem 1 : For a set A, A c A.
(2) Theorem 2 : For any set A, C c A.
(3) Results of Union operation :
(a) A e P (U), B e P (U) then A (A B) e P (U)
(b) A c (A B), B c (A B)
(c) A A = A
(d) A c B, C c D then (A C) c (B D)
(e) If x e A B, then x e A and x e B
(f) A B = B A (Commutative law)
(g) A (B C) = (A B) C (Associative law)
(h) A C = A (C is an identity element)
(i) A U = U
(4) Results of Intersection operation :
(a) A e P (U), B e P (U), then A B e P (U)
(b) A B c A, A B c B
(c) A A = A
(d) A c B, C c D, then (A C) c (B D)
(e) If x e A B, then x e A or x e B
(f) A B = B A (Commutative law)
(g) A (B C) = (A B) C (Associative law)
(h) A U = A (U is an identity element.)
(i) A C = C
(5) Distributive law :
(a) A (B C) = (A B) (A C)
(Distribution of intersection operation on union operation)
(b) A (B C) = (A B) (A C)
(Distribution of union operation on intersection operation)
(6) Properties for complement set :
(a) A e P (U) (b) a e A a e A (c) A A = U
(d) A A = C (e) U = C (f) C = U
(7) DeMorgans laws :
(a) (A B) = A B
(b) (A B) = A B
(8) Some properties of difference operation :
(a) A = B, then A B = C
(b) A B = A B = A A B
(c) A C = A and C A = C
(d) A B c A, B A c B
(e) A c B A B = C
(f) U A = A and A U = C
(h) For A B, A B B A
(9) A A B = {x | (x e A and x e B) or (x e B and x e A)}
= {x | x e A B or x e B A}
= (A B) (B A)
(10) Results of symmetric difference set :
(a) A A B = B A A
(b) A A A = C
(c) A A C = A
(d) A A B = (A B) (B A)
(11) A e P (U) and B e P (U), A c B, A B = A and A B = B are
the equal statements.
(12) Some diagrammatic representations :
Set A and A Subset : A c B
(13) Union of sets : A B :
(14) Intersection of sets : A B
(15) Difference set :
(16) Symmetric difference set : A A B
(17) If A and B are disjoint sets, then we have
n (A B) = n (A) + n (B)
Similarly, n (A B C) = n (A) + n (B) + n (C);
Where, A B = B C = C A = C
(18) n (A B) = n (A) + n (B) n (A B)
(19) n (A B C) = n (A) + n (B) + n (C) n (A B) n (B C)
n (C A) + n (A B C)
(20) The number of elements which are in only one of the three
sets :
n (A B C ) n (A B) - n (B C) - n (C A) + 2n
(A B C)
(21) The number of elements which are exactly in two of the three
sets :
n (A B) + n (B C) + n (C A) 3n (A B C)
n (A B) = n (A B) = n (A A B) = n (A) n (A B)
(22) Ordered pair : For, a e A and b e B,
(a, b) is called ordered pair; where A, B C.
(a) (a, b) (b, a) where, a b
(b) (a, b) = (c, d) a = c and b = d
(23) n (A B) = n (A) n (B)
n (A A) = [n (A)]
2
n (A B C) = n (A) n (B) n (C)