Union

Chapter 1  The union of two sets A and B, denoted by A È B, is

defined to be the set
A È B = { x | x  A or x  B}
 The union consists of all elements belonging to either A
SET THEORY or B (or both)
[Part 2: Operation on Set]
Venn diagram of A È B

Example Union

A={1, 2, 3, 4, 5}, B={2, 4, 6} and C={8, 9} If A and B are finite sets, the cardinality of A È B,

A È B = {1, 2, 3, 4, 5, 6} | A È B| = |A| + |B| - |A  B|

A È C = {1, 2, 3, 4, 5, 8, 9}
B È C = {2, 4, 6, 8, 9}
A È B È C = {1, 2, 3, 4, 5, 6, 8, 9}

Intersection Example
 The intersection of two sets A and B, denoted by A  B, is
defined to be the set A={1, 2, 3, 4, 5, 6}, B={2, 4, 6, 8, 10} and C={ 1, 2, 8, 10 }
A  B = { x | x  A and x  B}
A  B = {2, 4, 6}
 The intersection consists of all elements belonging to both A  C = {1, 2}
A and B.
C  B = {2, 8, 10}
A  B  C = {2}

Venn diagram of A  B

1
 Disjoint Difference
The set,
Two sets A and B are said to be disjoint if, AB=
A-B= {x | x  A and x  B}
is called the difference.
Venn diagram, A  B = 
The difference A- B consists of all elements in A that are
not in B.
Venn diagram of A-B
Example Example
A = {1, 3, 5, 7, 9, 11}, B = {2, 4, 6, 8, 10} A= { 1, 2, 3, 4, 5, 6, 7, 8 }
B= { 2, 4, 6, 8 }
AB=
A-B = { 1, 3, 5, 7 }

Symmetric Difference Example

The symmetric difference of set A and set B, denoted by A U = {0,1,2,3,4,5,6,7,8,9,10}

Å B is the set (A - B) U (B - A)
A = {1, 2, 3, 4, 5}; B = {4, 5, 6, 7,8}

A Å B = (A - B)È(B - A) = {1, 2,3, 6, 7,8}

B-A ={6, 7,8}

A - B = {1, 2, 3}

Complement Example

The complement of a set A with respect to a universal set

U, denoted by A is defined to be Let U be a universal set,
A = {x U| x  A}
A = U-A U= { 1, 2, 3, 4, 5, 6, 7 }
A= { 2, 4, 6 }
Venn diagram of A’
A = U – A = { 1, 3, 5, 7 }

2
 Exercise Exercise

Let the universe be the set U={1, 2, 3, 4,…..,10}.

Let,
U = { a, b, c, d, e, f , g, h, i, j, k, l, m }
A = { a, c, f, m} Let A={1, 4, 7, 10}, B={1, 2, 3, 4, 5} and C={2, 4, 6, 8}.

B = { b, c, g, h, m }
List the elements of each set:
Find: a) U
A È B , A  B , | A È B| , A - B dan A. b) B (C-A)
c) B - A
d) (AÈB)  (C - B)

Set Identities (Properties of Set) Set Identities (Properties of Set)

 Commutative laws  Absorption laws

A  B=B  A, A È B=B È A A È (A  B) = A
A  (A È B) = A
 Associative laws
A  (B  C) = (A  B)  C  Idempotent laws
A È (B È C) = (A È B) È C A  A=A, A È A=A

 Distributive laws  De Morgan’s laws

A È (B  C) = (A È B)  (A È C) (A  B) = A È B
A  (B È C) = (A  B) È (A  C) (A È B) = A  B

Set Identities (Properties of Set) Set Identities (Properties of Set)

 Properties of universal set
 Complement laws AÈU=U AU=A
A  A =  A È A = U
 Set difference laws
 Double complement laws A – B = A  B’
(A) = A
 Identity laws
 Complement of U and  AÈ=A AU=A
 =U U = 
 Properties of empty set
AÈ=A A=

3
 Example Example
 Let A, B and C denote the subsets of a set S and By referring to the properties of set operations, show
let C  denote a complement of C in S.
that:
 If A  C=B  C and A  C  = B  C , then prove set difference
that A=B A - (A  B) = A - B A – B = A  B’

A =AS (identity laws)

= A  (C È C) (complement laws) A - (A  B) = A  (A  B)’ [set difference laws]
= (A  C) È (A  C) (distributive laws) = A  (A’ È B’) [De Morgan’s laws]
= (B  C) È (B  C) (the given conditions) = (A  A’) È (A  B’) [distributive laws]
= B  (C È C) (distributive laws) =  È (A  B’) [complement laws]
=BS (complement laws) = (A  B’) È  [commutative]
=B (properties of universal set) = A  B’ [Identity laws]
=A-B [set difference laws]

Exercise Generalized Unions and Intersections

The union of a collection of sets is the set that contains those

elements that are members of at least one set in the collection.
1) Let A, B and C be sets. Show that
Notation:
(A È (B  C))’= A’  (B’ È C’ )
n

A = A ÈA i 1 2 È  È An = x  U x  Ai for at least one i = 0,1,2,....., n

i =1
2) Let A, B and C be sets such that
A  B = A  C and A È B = A È C 

A = A ÈA
i 1 2 n = x  U x  Ai for at least one nonnegative integer i
È  È A
Prove that B = C i =1

Generalized Unions and Intersections Cartesian Product

The intersection of a collection of sets is the set that contains  Let A and B be sets. An ordered pair of elements aA dan
those elements that are members of all the sets in the collection. bB written (a, b) is a listing of the elements a and b in a
specific order.
Notation:
 The ordered pair (a, b) specifies that a is the first element and
n b is the second element.
A = A A i 1 2    An = x U x  Ai for all i = 0,1,2,....n
i =1
 An ordered pair (a, b) is considered distinct from ordered pair

(b, a), unless a=b.
A = A A
i 1 2    An = x  U x  Ai for all nonnegative integer i
i =1
Example (1, 2)  (2, 1)

4
 Cartesian Product Cartesian Product

 The Cartesian product of two sets A and B, written AB is the  if A  B, then AB  BA.
set,
 if |A| = m and |B| = n, then |AB|=mn.
AB = {(a,b)| aA, bB}
 For any set A,
Example A= {1, 3}, B={2, 4, 6}.
A = A = 

AB = {(1, 2), (1, 4), (1, 6), (3, 2), (3, 4), (3, 6)}
Example
BA = {(2, 1), (2, 3), (4, 1), (4, 3), (6, 1), (6, 3)}
A= {a, b}, B={1, 2}.
AB = {(a, 1), (a, 2), (b, 1), (b, 2)}
A  B, AB  BA
BA = {(1, a), (1, b), (2, a), (2, b)}
|A| = 2 , |B| = 3, | AB |= 2.3= 6.

Cartesian Product Example

 The Cartesian product of sets A1, A2, …., An is defined A= {a, b}, B={1, 2}, C={x, y}
to be the set of all n-tuples
(a1, a2,…an) where aiAi for i=1,…,n;
ABC = {(a,1,x),(a,1,y), (a,2,x), (a,2,y),
(b,1,x), (b,1,y), (b,2,x), (b,2,y)}
 It is denoted A1  A2  ….  An
|A1  A2  ….  An |= |A1 |.|A2 | …. |An |
|ABC|= 2. 2. 2 = 8

Exercise Exercise
Let A= {w, x}, B={1, 2} and C={nm, ds, ps}. Let X= {1,2}, Y={a} and Z={b,d}.

1) Find |AB|, |BC|, |AC|,|ABC|,|BCA|, |ABAC| List the elements of each set.
a) XY
2) Determine the following set, b) YX
a) AB, BC, AC c) XYZ
b) ABC d) XYY
c) BCA e) XXX
d) ABAC f) YXYZ

5
Thank You