Professional Documents
Culture Documents
M1(Set Theory1)-1
M1(Set Theory1)-1
M1(Set Theory1)-1
MATHEMATICS
JEMSHEENA P S
ASSISTANT PROFESSOR
Module I
Set The y
Introduction
Concept of set e y
A set is a well-defined collection of objects.which may
or may not be of a mathematical nature, such as
numbers or functions.
The theory of sets was given by German
mathematician Georg Cantor (1845-1918).
It is usually represented in flower braces.
For example:
Set of natural numbers = {1,2,3,…..}
Set of whole numbers = {0,1,2,3,…..}
Each object is called an element or member of the set.
Let A={4,5} then we can write 4 ∈A and 5∈A .Here
2∉A
The number of elements present in a set
is known as cardinality or cardinal number of the
set.It is denoted by n(A)or |A|
Sets can be represented by two ways
Finite Set
Finite set is a set in which there are definite
number of elements. Infinite Set
For example: Infinite set is a set in which there are infinite number of
A= {1,2,3} elements.
For example:
A={x/x is a real number}
Null Set and Universal Set
Null Set
Universal Set
A Set having no elements is called Null Set.It is
The set that contains all the elements of a given collection is
denoted by ∅ or { }.Null Set is a finite Set.
called the universal set and is represented by the symbol 𝗨 or
For example:
𝗦 or E
A= {x/ x is an even natural number between 6 and 8}
For example:
if we discuss natural number,then
Equal Set
Two sets are equal if they have exactly same Equivalent Sets
elements. Two sets are said to be equivalent if they have the
For example: same number of elements.
A= {2,3,4} and B={3,4,2} , Here A and B are equal For example:
sets
A={1,2,3} and B={a,c,d } , Here A and B are equivalent
sets.
Disjoint Set and Singleton Set
Disjoint Set
Two sets A and B are said to be disjoint sets if no
element of A is in B and no element of B is in A ,i.e.,
Singleton Set
They have no common elements
A Set having only one element .
For example:
For example:
A= {2,3} and B = {4,5}
A={3}
SubSet and Super Set
SubSet
A set A is said to be a sub set of a set B Super Set
Find the power set of Z = {2,7,9} and total number of elements. How many elements are there for power set of empty set?
Solution: Given, Z = {2,7,9}
Solution: An empty set has zero elements.
Total number of elements in powerset = 2ⁿ
Therefore, no. of elements of powerset = 2⁰= 1
Here, n = 3 (number of elements in set Z)
So, 2³= 8, which shows there are eight elements of power set of Z
Hence, there is only one element of the powerset which is the empty
ie.
The difference (subtraction) of two sets,denoted by A−B , is a set consists of elements that are in A but
not in B.
For example:
A= {2,3,4,5} and B={3,4,2} , Then A-B ={5}
Complement of a set
ie.
symmetric difference( disjunctive union) of two sets is the set of elements which are in either of the sets
and not in their intersection. It is denoted by A⊕B or AΔB or A+B
For example,
A={1,2,3} and B={ 3,4} ,then A⊕B={1,2,4}.
The Intersection and Union of Two sets A and B is shown by the
shaded area using a Venn diagram.
The shaded area shows the The shaded area shows the
set B∩A. set B∪A.
The Difference and Symmetric Difference of Two sets A and B is
shown by the shaded area using a Venn diagram.
The shaded area shows the set Sets A,B, and C are disjoint.
Aᶜ
Important Laws of Set Operation
Commutative Laws:
01 Associative Laws:
For any two finite sets A and B;
(i) A U B = B U A
02 For any three finite sets A, B and
(ii) A ∩ B = B ∩ A C;
(i) (A U B) U C = A U (B U C)
(ii) (A ∩ B) ∩ C = A ∩ (B ∩ C)
Distributive Laws:
03 For any three finite sets A, B and C; De Morgan’s Laws:
(i) A U (B ∩ C) = (A U B) ∩ (A U C) 04 For any two finite sets A and B;
(ii) A ∩ (B U C) = (A ∩ B) U (A ∩ C) (i) (A U B)’ = A' ∩ B'
(ii) (A ∩ B)’ = A' U B′
Prove That
Prove That A∪(B∩C)⇔ (A∪B)∩(A∪C)
Prove That A∪(A∩B)=A
Proof by venn diagram - Commutative law
For any two finite sets A and B;
(i) A U B = B U A
(ii) A ∩ B = B ∩ A
Proof by venn diagram - Associative law
For any three finite sets A, B and C;
(i) (A U B) U C = A U (B U C) (ii) (A ∩ B) ∩ C = A ∩ (B ∩ C)
Solution:
1. The union contains all the elements in either set: A ⋃ B = {red, green, blue, yellow, orange} Notice w
only list red once.
2. The intersection contains all the elements in both sets: A ⋂ B = {red}
3. Here we’re looking for all the elements that are not in set A and are also in C. Aᶜ ⋂ C = {orange, yel
purple}
Question:
Question:
Question:For the given sets A = { -10, 0, 1, 9, 2, 4, 5 } and B = {-1, -2, 5, 6, 2, 3, 4 }, verify that
(i) Set union is commutative.
(ii) Set intersection is commutative.
Solution :
(i) Let us verify that union is commutative.
A u B = { -10, 0, 1, 9, 2, 4, 5 } u {-1, -2, 5, 6, 2, 3, 4 }
A u B = { -10, -2, -1, 0, 1, 2, 3, 4, 5, 6, 9 } ---------(1)
B u A = {-1, -2, 5, 6, 2, 3, 4 } u { -10, 0, 1, 9, 2, 4, 5 }
B u A = { -10, -2, -1, 0, 1, 2, 3, 4, 5, 6, 9 } ---------(2)
From (1) and (2), we have
AuB = BuA
Aᶜ will contain all elements not in the set A. Aᶜ ⋂ B will contain the elements in set B that are not in set A.
Question: Use a Venn diagram to illustrate (H ⋂ F)ᶜ ⋂W
Now, (H ⋂ F)ᶜ ⋂ W will contain everything not in the set identified above that is also in set W.
Question:
THANK YOU