Basic Set Theory
Basic Set Theory
Basic Set Theory
MATHEMATICS
Sets
What is a Set?
• A Set is a Collection of well-defined objects.
• Example:
• Odd natural number less than 10 i.e. 1,
3, 5, 7, 9.
• Rivers of India
• The vowels in English alphabets
• Various kinds of Triangles
• Prime factors of 210
• Solution of equation x 2 - 5x + 6=0
Set Notation
• Set-builder notation is a notation for describing a set by
indicating the properties that its members must satisfy.
• Reading Notation :
• ‘|’or ‘:’ such that
• A = { x : x is a letter in the word dictionary }
• We read it as
• “A is the set of all x such that x is a letter in the word
dictionary”
• For example,
• (i) N = "x : x is a natural number,
• (ii) P = "x : x is a prime number less than 100,
• (iii) A = "x : x is a letter in the English alphabet
Roster form :
Point to be Noted
TYPES OF SETS
1) Empty set – Denoted by ø (phi) or { }
2) Singleton set – Set containing only one element
for e.g {2},{a} etc.
3) Cardinal no. of finite set- Number of elements
present in a set denoted by n(A) or n(B) etc.
4) Equivalent set- Two sets having same number of
element n(A)=n(B) for e.g {1,2,3} and {a,b,c}
5) Equal set – Each and every element of sets are
equal for e.g {1,2,3} and {1,2,3}.
6) Subset- a set of which all the elements are contained in
another set,
For e.g
A = {1, 3, 5},
B = {1, 2, 3, 4, 5},
A is a subset of B, A ⊆ B. because every element in A is
also in B.
A is also proper subset of B, A ⊂ B
6) POWER SET-The power set of any set S is the set of
all subsets of S, including the empty set and S itself,
variously denoted as P(S).
For e.g
If S is the set {x, y, z}, then the subsets of S are
1. {} (also denoted by ø or empty set or the null set)
2. {x}
3. {y}
4. {z}
5. {x, y}
6. {x, z}
7. {y, z}
8. {x, y, z}
and hence the power set of S is {{}, {x}, {y}, {z}, {x, y},
{x, z}, {y, z}, {x, y, z}}
7) Universal set-In set theory, a universal set is a set which
contains all objects, including itself. It is usually denoted by the
symbol ‘U’
For e.g.
There are three sets named as A, B and C. The elements of
all sets A, B and C is defined as;
A={1,3,6,8}
B={2,3,4,5}
C={5,8,9}
U={1,2,3,4,5,6,8,9}
∀- for all e.g Something is true for all (any) value of x (usually
with a side condition like ∀x > 0).
∃ there exists.
∃! there exists a uniques
P iff Q P if and only if Q
a ∈ B a is an element of B The variable a lies in the set (of
values) B.
a ∉B a is not an element of B
: Such that
EXAMPLE:
A= {1, 2, 3} and B = {1, 3, 5, 7}
A U B = {1, 2, 3, 5, 7}
Question
If A = {x : x = 2n+1, n ∈ Z} and B = {x : x = 2n, n ∈ Z} then A U B ?
Ans – {……-6,0,6,12,18…….}
• Disjoint set
Set which donot have any common element
So A ∩ B= ø or { }
Ans – { }
• Difference of sets
• B-A is set of all element of B which do not belong to A
• E.g
A={2,3,4,5,6,7,}
B={3,5,7,9,11,13}
So B-A= {9,11,13}
And A-B={2,4,6}
• Symmetric difference of two sets
• Symmetric difference= (A-B) U (B-A)
and is denoted by A △ B
E.G
A={1,2,3,4,5,6}
B={5,6,7,8,9}
A-B={1,2,3,4}
B-A={7,8,9}
A △ B= {1,2,3,4,7,8,9}
• Complement of set
• A`= U-A
E.G
U={1,2,3,4,5,6,7,8,9}
A={1,3,5,7,9}
Then A`={2,4,6,8}
Quizlet Time
Question 1
If A and B are two sets such that A ⊂ B then find a) A ∩ B (b) A U B
Ans- a) A
b) B
Question 2
If A={1,2,3,4,5} , B={4,5,6,7,8,} ,
C={7,8,9,10,11}, D= {10,11,12,13,14}
Find
(a) A U B (b) A U C (c) B U C (d) B U D
(e) A U B U C (f) A U B U D (g) B U C U D
(h) A ∩ (B U C) (i) (A ∩ B) ∩ (B ∩ C)
(j) A-B (k) B-C (l) C-D (m) D-A
(n) C-A (o) (A U D) ∩ (B U C)
Laws of algebra of sets
1) Idempotent law {unchanged}
For example A U A = A and A ∩ A = A.
2) Identity law
AU ø =A and A ∩ U = A
3) Cumulative law
A U B = B U A and A ∩ B = B ∩ A
4) Associative law
(A U B) ∩ C= A U (B U C)
A ∩ (B ∩ C)=(A ∩ B) ∩ C
5) Distributive law
A U (B ∩ C) = (A U B) ∩ (A U C)
A ∩ (B U C) = (A ∩ B) U (A ∩ C)
6) De-morgan’s law
(A U B)’ = A’ ∩ B’
(A ∩ B)’= A’ U B’
1) n(A U B)=n (A) + n (B)- n (A ∩ B)
2) n(A U B)=n (A) + n (B) {if A and B are disjoint set}
3) n(A – B)=n(A) – n(A ∩ B)
4) n(A△B) =n (A) + n (B)- 2n(A ∩ B)
5) n(A U B U C)=n (A)+n (B)+n (C)- n(A ∩ B)-n(B ∩ C)-n(A ∩ C)+n (A ∩ B ∩ C)
6) n(A` U B`)= n (A ∩ B)`=n(U)-n(A ∩ B)
7) n(A` ∩ B`) = (A U B)`=n(U)-n(A U B)