UNIT 1 Sets
UNIT 1 Sets
UNIT 1 Sets
MATHEMATICS
➢ Notation
The set is represented by listing all the elements comprising it. The
elements are enclosed within brackets and separated by commas.
Example − |{1,4,3,5}|=4
- |{1,2,3,4,5,…}|=∞
Here set Y⊂X since all elements in Y are contained in X too and X
has at least one element is more than set Y.
8. Equal Set - If two sets contain the same elements they are
said to be equal.
10. Overlapping Set - Two sets that have at least one common
element are called overlapping sets.
⚫ n(A∪B)=n(A)+n(B)−n(A∩B)
⚫ n(A∪B)=n(A−B)+n(B−A)+n(A∩B)
⚫ n(A)=n(A−B)+n(A∩B)
⚫ n(B)=n(B−A)+n(A∩B)
⚫ n(A∩B)=∅
⚫ n(A∪B)=n(A)+n(B)
PRACTICE QUESTIONS
(a) The collection of all the days in a week beginning with the letter
‘T’.
2. If,
A = {3, 5, 7, 9}
B = {2, 4, 6, 8, 10}
(i) 13 ∈ C
(ii) 6 ∉ A
(iii) 9 ∉ A
(iv) 24 ∈ C
(v) 31 ∈ D
(vi) 36 ∉ D
(vii) 20 ∉ C
(viii) 9 ∈ A
ANSWER 2. (a)
(i) False
(ii) True
(iii) False
(iv) True
(v) True
(vi) False
(vii) False
(viii) True
(i) 3 ∈ ___
(ii) 4 ___ B
(iii) 26 ___ C
(iv) 8 ∈ ___
(v) 5 ___ A
(vi) 6 ___ C
(vii) 21 ___ D
(viii) 18 ___ B
ANSWER 2 (b)
(i) A
(ii) Є
(iii) ∉
(iv) B
(v) Є
(vi) ∉
(vii) Є
(viii) ∉
3. Write the following sets in the roster form.
(b) B = The set of all prime numbers greater than 1 but less than
29
ANSWER 3.
(c) {-1, 0, 2}
(d) {L, O, Y, A}
(e) {O, I, E}
(j) {-3, 2, 7}
(k) {1, 2, 3, 4, 5, 6}
(m) {O}
(c) C = {P, R, I, N, C, A, L}
(d) D = {0}
(e) E = { }
(i) I = {a, e, i, 0, u}
(l) L = {1, 3, 5, 7, 9}
ANSWER 4.
(l) {x : x is odd, x ≤ 9}
(g) S = {x | x ∈ W, x + 2 < 9}
ANSWER 5.
(a) 12
(b) 6
(c) 5
(d) 1
(e) 0
(f) 6
(g) 7
(h) 3
(i) 6
(j) 24
(c) C = {x : x ∈ N and 3x -2 = 0}
(d) D = {x : x ∈ N and x2 = 9}
ANSWER 6.
(a) infinite
(b) infinite
(c) finite
(d) finite
(e) infinite
(f) finite
(g) finite
(h) finite
(i) infinite
(j) infinite
(k) infinite
7. Identify the following as null set or singleton set.
(e) E = {x : x2 = 9, x is even}
(g) B = {0}
ANSWER 7.
(a) null
(b) singleton
(c) null
(d) singleton
(e) null
(f) singleton
(g) singleton
(h) singleton
(i) null
(j) null
A = {3, 5, 9, 13}
B = {2, 3, 4, 5}
D = {4, 2, 5, 3}
E = {-2, 2}
F = {o, b}
G = {2, -2}
H = {1, 2}
ANSWER 8. B = D and E = G
(d) A = {0}
ANSWER 9.
(a) A = {x : x ∈ N, x ≤ 6}
B = {x : x ∈ W, 1 ≤ x ≤ 6}
(e) A = {x | x ∈ N, x ≤ 5}
B = {x | x ∈ I, 5 < x ≤ 10}
ANSWER 10.
Equal sets (a), (d)
ANSWER 11.
(g) 4 ∈ {x : 4 ≤ x ≤ 10}
(i) If P = {x : x = 2n, n ∈ N}
Q = {x : x 2n + 1, n ∈ N}
ANSWER 12.
(a) True
(b) True
(c) False
(d) False
(e) False
(f) True
(g) False
(h) True
(i) True
(j) True
OPERATIONS ON SETS
In set theory, the operations of the sets are carried when two or
more sets combine to form a single set under some of the given
conditions. The basic operations on sets are:
• Union of sets
• Intersection of sets
• A complement of a set
• Cartesian product of sets.
• Set difference
1.Union of Sets - If set A and set B are two sets, then A union
B is the set that contains all the elements of set A and set B. It is
denoted as A ∪ B.
A ∪ B = {1,2,3,4,5,6}
A ∩ B = { } or Ø
1. P ∪ P′ = U
2. P ∩ P′ = Φ
3. Law of double complement : (P′ )′ = P
4. Laws of empty/null set(Φ) and universal set(U), Φ′ = U
and U′ = Φ.
4. Cartesian Product of sets -If set A and set B are two sets
then the cartesian product of set A and set B is a set of all ordered
pairs (a,b), such that a is an element of A and b is an element of B.
It is denoted by A × B.
A × B = {(a, b) : a ∈ A and b ∈ B}
A × B = {(1,Bat),(1,Ball),(2,Bat),(2,Ball),(3,Bat),(3,Ball)}
5.Difference of Sets- If set A and set B are two sets, then set A
difference set B is a set which has elements of A but no elements
of B. It is denoted as A – B.
A – B = {1}
SETS FORMULAS :
Some of the most important set formulas are:
Practice Questions
Question 1: If ∪ = {1, 3, 5, 7, 9, 11, 13}, then which of the
following are subsets of U.
B = {2, 4}
A = {0}
C = {1, 9, 5, 13}
D = {5, 11, 1}
E = {13, 7, 9, 11, 5, 3, 1}
F = {2, 3, 4, 5}
Solution:
A = {1, 2, 3, 6, 9, 18}
B = {1, 2, 3, 4, 5}
Verify (A ∪ B) ∪ C = A ∪ (B ∪ C)
Solution:
(A ∪ B) ∪ C = A ∪ (B ∪ C)
L.H.S. = (A ∪ B) ∪ C
A ∪ B = {0, 1, 2, 3, 4, 5, 6, 8}
(A ∪ B) ∪ C = {0, 1, 2, 3, 4, 5, 6, 7, 8} ……………….. (1)
R.H.S. = A ∪ (B ∪ C)
B ∪ C = {1, 2, 3, 4, 5, 6, 7, 8}
(A ∪ B) ∪ C = A ∪ (B ∪ C) [verified]
(i) Verify X ∪ Y = Y ∪ X
(ii) Verify (X ∪ Y) ∪ Z = X ∪ (Y ∪ Z)
Solution:
(i) X ∪ Y = Y ∪ X
L.H.S = X ∪ Y
R.H.S. = Y ∪ X
Therefore, X ∪ Y = Y ∪ X [verified]
(ii) (X ∪ Y) ∪ Z = X ∪ (Y ∪ Z)
L.H.S. = (X ∪ Y) ∪ Z
X ∪ Y = {1, 2, 3, 4} U {2, 3, 5}
= {1, 2, 3, 4, 5}
Now (X ∪ Y) ∪ Z
= {1, 2, 3, 4, 5, 6} {4, 5, 6}
= {1, 2, 3, 4, 5, 6}
R.H.S. = X U (Y ∪ Z)
Y ∪ Z = {2, 3, 5} ∪ {4, 5, 6}
= {2, 3, 4, 5, 6}
X ∪ (Y ∪ Z) = {1, 2, 3, 4} ∪ {2, 3, 4, 5, 6}
Therefore, (X ∪ Y) ∪ Z = X ∪ (Y ∪ Z) [verified]
Find A ∪ B and A ∩ B.
Solution:
A = {1, 2, 3, 6, 9, 18}
B = {1, 2, 3, 4, 5}
Therefore, A ∩ B = {1, 2, 3}
Question 10. If P = {multiples of 3 between 1 and 20} and Q =
{even natural numbers upto 15}. Find the intersection of the
two given set P and set Q.
Solution:
Verify (A ∩ B) ∩ C = A ∩ (B ∩ C)
Solution:
(A ∩ B) ∩ C = A ∩ (B ∩ C)
L.H.S. = (A ∩ B) ∩ C
A ∩ B = {2, 4}
R.H.S. = A ∩ (B ∩ C)
B ∩ C = {∅}
(A ∩ B) ∩ C = A ∩ (B ∩ C) [verified]
Question 12.. Let A and B be two finite sets such that n(A) =
20, n(B) = 28 and n(A ∪ B) = 36, find n(A ∩ B).
Solution:
= 20 + 28 - 36
= 48 - 36
= 12
70 = 18 + 25 + n(B - A)
70 = 43 + n(B - A)
n(B - A) = 70 - 43
n(B - A) = 27
= 25 + 27
= 52
Solution:
Given
= 27 + 42 - 60
= 69 - 60 = 9
=9
Solution:
= 35 + 57 - 12
= 92 - 12
= 80
= n(A) + n(B)
= 35 + 57
= 92
Solution:
Given,
= 72 + 43 - 100
= 115 - 100
= 15
= 72 - 15
= 57
= 43 - 15
= 28
Solution:
Given,
= 36 + 12 + 18 + 4 - 45 - 12
= 70 - 57
= 13
We have
Therefore, 40 = 18 + 20 + 27 - 7 - 12 - n(C ∩ A) + 4
40 = 69 – 19 - n(C ∩ A)
40 = 50 - n(C ∩ A) n(C ∩ A) = 50 - 40
n(C ∩ A) = 10
Therefore, Number of students who play chess and carrom are 10.
Also, number of students who play chess, carrom and not scrabble.
= n(C ∩ A) - n(A ∩ B ∩ C)
= 10 – 4
=6
VENN DIAGRAMS
Venn diagram, invented in 1880 by John Venn, is a schematic
diagram that shows all possible logical relations between different
mathematical sets.
Examples
SET OPERATIONS
Set Operations include Set Union, Set Intersection, Set Difference,
Complement of Set, and Cartesian Product.
then A∩B={13}.
⚫ Power Set
Hence,
P(S)={{ø},{a},{b},{c},{d},{a,b},{a,c},{a,d},{b,c},{b,d},{c,d},{a,b,c},{a,b,
d},{a,c,d},{b,c,d},{a,b,c,d}}
|P(S)|=24=16
|P({ø})|=20=1
◆ The union of the subsets must equal the entire original set.
[P1∪P2∪⋯∪Pn=S]
1. ø,{1,2,3}
2. {1},{2,3}
3. {1,2},{3}
4. {1,3},{2}
5. {1},{2},{3}
Hence B3=5
PRACTCE QUESTIONS:
Question 1: In a class of 100 students, 35 like science
and 45 like math. 10 like both. How many like either of
them and how many like neither?
Solution:
Total number of students, n(µ) = 100
→ 45+35-10 = 70
Solution:
30 = 18+ n(F) – 8
n(F) = 20
Solution:
n(C∩H) = 15
n(H∩V) = 20
n(C∩V) = 15
n(C∩H∩V) = 10
= 50 + 50 + 40 – 15 – 20 – 15 + 10
Accordingly, d = n (CnHnV) = 10
Now, n(CnV) = a + d = 15
n(CnH) = b + d = 15
n(HnV) = c + d = 20
The Venn diagram for the given information looks like this.
Subtracting the values in the intersections from the
individual values gives us the number of students who
played only one game.
Solution:
115 = 65+n(V) – 30
n(V) = 80
Solution:
86 = 40+30+30-5-10-7+ n(R∩G∩B)
• A∪B = B∪A
• A∩B = B∩A
Associative Property :
• A ∪ ( B ∪ C) = ( A ∪ B) ∪ C
• A ∩ ( B ∩ C) = ( A ∩ B) ∩ C
Distributive Property :
• A ∪ ( B ∩ C) = ( A ∪ B) ∩ (A ∪ C)
• A ∩ ( B ∪ C) = ( A ∩ B) ∪ ( A ∩ C)
De morgan’s Law :
• Law of union : ( A ∪ B )’ = A’ ∩ B’
• Law of intersection : ( A ∩ B )’ = A’ ∪ B’
Complement Law :
• A ∪ A’ = A’ ∪ A =U
• A ∩ A’ = ∅
• A∪A=A
• A∩A=A
• ∅’ = U
• ∅ = U’
PRINCIPLE OF INCLUSION AND
EXCLUSION (PIE)
In the field of Combinatorics, it is a counting method used
to compute the cardinality of the union set. According to
basic Inclusion-Exclusion principle:
∣A∪B∣=∣A∣+∣B∣−∣A∩B∣
∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣A∩C∣−∣B∩C∣+∣A∩B∩C I
Principle :
Inclusion-Exclusion principle says that for any number of
finite sets , Union of the sets is given by
= Sum of sizes of all single sets – Sum of all 2-set
intersections + Sum of all the 3-set intersections – Sum of
all 4-set intersections .. + Sum of all the i-set
intersections.
Applications :
⚫ Derangement:
A derangement is a permutation of objects that leaves
no object in the original position.