Lecture 07
Lecture 07
Sets Continued
UNION:
Let A and B be subsets of a universal set U. The union of sets A and B is the set of all
elements in U that belong to A or to B or to both, and is denoted A ∪ B.
Symbolically:
A ∪ B = {x ∈U | x ∈A or x ∈ B}
EMAMPLE:
Let U = {a, b, c, d, e, f, g}
A = {a, c, e, g}, B = {d, e, f, g}
Then A ∪ B = {x ∈U | x ∈A or x ∈ B}
={a, c, d, e, f, g}
VENN DIAGRAM FOR UNION:
U
B
A ∪ B is shaded
REMARK:
1. A ∪ B = B ∪ A that is union is commutative you can prove
this very easily only by using definition.
2. A⊆A∪B and B⊆A∪B
The above remark of subset is easily seen by the definition of union.
MEMBERSHIP TABLE FOR UNION:
A B A∪B
1 1 1
1 0 1
0 1 1
0 0 0
REMARK:
This membership table is similar to the truth table for logical
connective, disjunction (∨).
INTERSECTION:
Let A and B subsets of a universal set U. The intersection of sets
A and B is the set of all elements in U that belong to both A and B and is denoted
A ∩ B.
Symbolically:
A ∩ B = {x ∈U | x ∈ A and x ∈B}
EXMAPLE:
Let U = {a, b, c, d, e, f, g}
A = {a, c, e, g}, B = {d, e, f, g}
Then A ∩ B = {e, g}
U
B
A ∩ B is shaded
VENN DIAGRAM FOR INTERSECTION:
REMARK:
1. A ∩ B = B ∩ A
2. A ∩ B ⊆ A and A∩B⊆B
3. If A ∩ B = φ, then A & B are called disjoint sets.
MEMBERSHIP TABLE FOR INTERSECTION:
A B A∩B
1 1 1
1 0 0
0 1 0
0 0 0
REMARK:
This membership table is similar to the truth table for logical
connective, conjunction (∧).
DIFFERENCE:
Let A and B be subsets of a universal set U. The difference of “A and B” (or relative
complement of B in A) is the set of all elements in U that belong to A but not to B, and is
denoted A – B or A \ B.
Symbolically:
A – B = {x ∈U | x ∈ A and x ∈B}
EXAMPLE:
Let U = {a, b, c, d, e, f, g}
A = {a, c, e, g}, B = {d, e, f, g}
Then A – B = {a, c}
VENN DIAGRAM FOR SET DIFFERENCE:
U
A B
A-B is shaded
REMARK:
1. A – B ≠ B – A that is Set difference is not commutative.
2. A – B ⊆ A
3. A – B, A ∩ B and B – A are mutually disjoint sets.
MEMBERSHIP TABLE FOR SET DIFFERENCE:
A B A–B
1 1 0
1 0 1
0 1 0
0 0 0
REMARK:
The membership table is similar to the truth table for ~ (p →q).
COMPLEMENT:
Let A be a subset of universal set U. The complement of A is the set of all element
in U that do not belong to A, and is denoted AΝ, A or Ac
Symbolically:
Ac = {x ∈U | x ∉A}
EXAMPLE:
Let U = {a, b, c, d, e, f, g]
A = {a, c, e, g}
Then Ac = {b, d, f}
VENN DIAGRAM FOR COMPLEMENT:
U
Ac
A
Ac is shaded
REMARK :
1. Ac = U – A
2. A ∩ Ac = φ
3. A ∪ Ac = U
MEMBERSHIP TABLE FOR COMPLEMENT:
A Ac
1 0
0 1
REMARK
This membership table is similar to the truth table for logical connective
negation (~)
EXERCISE:
Let U = {1, 2, 3, …, 10}, X = {1, 2, 3, 4, 5}
Y = {y | y = 2 x, x ∈X}, Z = {z | z2 – 9 z + 14 = 0}
Enumerate:
(1)X ∩ Y (2) Y ∪ Z (3) X – Z
(4)Yc (5) Xc – Zc (6) (X – Z) c
Firstly we enumerate the given sets.
Given
U = {1, 2, 3, …, 10},
X = {1, 2, 3, 4, 5}
Y = {y | y = 2 x, x ∈X} = {2, 4, 6, 8, 10}
Z = {z | z2 – 9 z + 14 = 0} = {2, 7}
(1) X ∩ Y = {1, 2, 3, 4, 5} ∩ {2, 4, 6, 8, 10}
= {2, 4}
(2) Y ∪ Z = {2, 4, 6, 8, 10} ∪ {2, 7}
= {2, 4, 6, 7, 8, 10}
(3) X – Z = {1, 2, 3, 4, 5} – {2, 7}
= {1, 3, 4, 5}
(4) Yc = U – Y = {1, 2, 3, …, 10} – {2, 4, 6, 8, 10}
= {1, 3, 5, 7, 9
(5) Xc – Zc = {6, 7, 8, 9, 10} – {1, 3, 4, 5, 6, 8, 9, 10}
= {7}
(6) (X – Z)c = U – (X – Z)
= {1, 2, 3, …, 10} – {1, 3, 4, 5}
= {2, 6, 7, 8, 9, 10}
NOTE (X – Z)c ≠ Xc - Zc
EXERCISE:
Given the following universal set U and its two subsets P and Q, where
U = {x | x ∈ Z,0 ≤ x ≤ 10}
P = {x | x is a prime number}
Q = {x | x2 < 70}
(i) Draw a Venn diagram for the above
(ii) List the elements in Pc ∩ Q
SOLUTION:
First we write the sets in Tabular form.
U = {x | x ∈Z, 0 ≤ x ≤ 10}
Since it is the set of integers that are greater then or equal 0 and less or equal to 10. So
we have
U= {0, 1, 2, 3, …, 10}
P = {x | x is a prime number}
It is the set of prime numbers between 0 and 10. Remember Prime numbers are those
numbers which have only two distinct divisors.
P = {2, 3, 5, 7}
Q = {x | x2 < 70}
The set Q contains the elements between 0 and 10 which has their square less or equal to
70.
Q= {0, 1, 2, 3, 4, 5, 6, 7, 8}
Thus we write the sets in Tabular form.
VENN DIAGRAM:
U
Q
2,3,5,7P
0,1,4,6,8
9,10
(i) P ∩Q=?
c
SOLUTION
When A ⊂ B, then A ∪ B = B = {4, 5}
Also A being a proper subset of B implies
A = {4} or A = {5}
SOLUTION
A U
4 3 B
2
C 1
U
3 B
A 2
6
5
1 1
4 C
7 8
(1) (A ∩ B) ∩ Cc
B U
3
2
A 5 6
1 4 7
C 8
(A ∩ B) ∩ Cc is shaded
(ii) Ac ∪ (B ∪ C) is shaded.
B U
A 3
2
5 6
1
4
7 C
8
(iii) (A – B) ∩ C
3 B U
A 2
5 6
1
4 7
C
8
(A – B) ∩ C is shaded
(iii) (A – B) ∩ C
3 B U
A 2
5 6
1
4 7
C
8
(A – B) ∩ C is shaded
(iii)
(A ∩ Bc) ∪ Cc is shaded.
B
U
3
2
A 5 6
C
1 4
7
8
SOLUTION (i)
A - (A – B) = A ∩ B
(a) U A = { 1, 2 }
A
B B = { 2, 3 }
1 2 3 A – B ={ 1 }
A – B is shaded
(b)
U
A B A = { 1, 2 }
1 2 A–B={1}
3
A – (A – B) = { 2 }
4
A – (A – B) is shaded
(c) U
A B
1 2 3
4
A ∩ B is shaded
A= { 1, 2 }
B = { 2, 3 }
A ∩ B = {2}
RESULT: A – (A – B) = A ∩ B
SOLUTION (ii)
(A ∩ B)c = A c ∪ B c
(a) U
A B
2
3
1
4
A∩B
U
(b)
A B
1 2 3
4
(A ∩ B)c
(c) U
A B
1 A2 3
Ac is shaded.
(d)
U
A
A B
2 3
1
4
Bc is shaded.
(e)
A B
2 3
1
4 U
Ac ∪ Bc is shaded.
(a)
U
A B
1 2 3
A – B is shaded.
(b)
A B U
1 2 3
Bc is shaded.
(c)
U
A A B
2
1 3
A ∩ Bc is shaded
RESULT: A – B = A ∩ Bc
PROVING SET IDENTITIES BY MEMBERSHIP TABLE:
Prove the following using Membership Table:
(i) A – (A – B) = A ∩ B
(ii) (A ∩ B)c = A c ∪ B c
(iii) A – B = A ∩ Bc
SOLUTION (i)
A – (A – B) = A ∩ B
Since the last two columns of the above table are same hence the corresponding
set expressions are same. That is
A – (A – B) = A ∩ B
SOLUTION (ii)
(A ∩ B)c = A c ∪ B c
(A∩B)c A B A c ∪ B c
c c
A B A∩B
1 1 1 0 0 0 0
1 0 0 1 0 1 1
0 1 0 1 1 0 1
0 0 0 1 1 1 1
Since the fourth and last columns of the above table are same hence the
corresponding set expressions are same. That is
(A ∩ B)c = A c ∪ B c
SOLUTION (iii)
A B A–B Bc A ∩ Bc
1 1 0 0 0
1 0 1 1 1
0 1 0 0 0
0 0 0 1 0