Set Theory Notes BS-II Unit IV
Set Theory Notes BS-II Unit IV
Introduction
In daily life we often used the word set in various situations, but in mathematical
terminology it represents a group or a collection of books, toys or numbers etc., these
objects which are the part of the set are called as elements of the set.
It was developed by Georg Cantor (1845-1918) and Ernst Zermelo, Abraham Fraenkel
and John Von Neumann.
Definition of Set
A set is a well-defined collection of objects and these objects are termed as the
members or elements or vector of the set. The term “well-defined” means that each
element has certain characteristics with which it can be identified under a particular
head.
For example
(i) The set {a, e, i, o, u} belongs to family of vowels
(ii) The set {1, 2, 3, 4} belongs to natural numbers (N).
Set Notation
The two most common way of expressing a set are:
(i) Roster, Tabular or Enumeration Form: In this method all the elements are
listed within braces { } or brackets [ ] or parentheses ( ) separated by commas.
For example
All natural numbers less than six can be written as {1, 2, 3, 4, 5}
(ii) Set builder Form: In this method all the elements are listed according to
Characteristics or properties.
For example
(i) The Set A = {a, e, i, o, u} can be written as
A = {x | x is vowel in English alphabet} or
A = {x : x is vowel in English alphabet}
(ii) The Set B = {1, 3, 5, 7………..} can be written as
B = {x : x is a odd number integer}
A Colon (:), a vertical line (|) or a semi colon ( ; ) can be used after x and read as “such
that”
Types of Set
(i) Finite set:
A Set which is in countable form is a finite set. Each element of this kind of set can be
counted physically. In this element are limited.
For example
Set A = {x: x is the numbers on a dice} – finite set having 6 elements
Set B = (x: x is the days in a week} is a finite set with 7 elements.
(ii) Infinite set
A set which is in uncountable form is an infinite set. The elements in this set cannot be
counted. In this element are Unlimited.
For example
Set A = {x : x is a Natural Number}
Set B = {x : x is stars in Sky}
(iii) Null, empty or void set
A set which has no elements is called as null, empty or void set denoted by {Ø} and
read as phi in Greek and Latin.
For example
Set A = {Ø} is a null set.
Set B = {x: x is the eight days in a week} will be Null Set as a week has 7 days only.
(iv) Singleton set
A set containing only one element is called as singleton set.
For example Set A = {x : x is the Sundays in a week} only one Sunday in a week.
(v) Equality of sets
Two sets A and B are termed equal if every element of Set A is also an element of Set
B and also every element of Set B is an element of Set A i.e. A = B. it is also called as
Axiom of Extension or Axiom of Identity. In this order of elements in both set can be
differ. The elements of both sets should be equal in no. of element (count) as well
value of element.
For example
If Set A = {2, 3, 4} and Set B = {4, 3, 2}.
Here Set A = Set B because both sets have same values and equal numbers of
elements.
(vi) Equivalent set
If two sets have same number of elements (In Count) then the sets are called
equivalent set and denoted by the symbol ~. The values of the elements can be
differ.
For example
Set A = {a, b, c} and Set B = {x, y, z} ,
here A and B both have 3 elements so Set A ~ Set B (A~B).
(vii) Subset :
If A and B are two sets such that every element of Set A is also an element of Set B
then Set A is said to be a subset of Set B or read as “Set A is contained in Set B” or
“Set A is a subset of Set B”
It can write as A ⊆ B (x є A ) or B ⊇ A (x є B )
For example
Set A = {1, 2, 3} and Set B = {1, 2, 3, 4, 5} then all elements of Set
A are also elements of Set B which means A ⊆ B
Properties of Subsets
(i) If Set A is subset of Set B then Set B is called the super set of Set A.
(ii) If Set A ⊆ Set B and Set B ⊆ Set A then Set A = Set B.
(iii) If Set A ⊆ Set B, Set B ⊆ Set C then Set A ⊆ Set C
For example
U = {x: x is all English alphabets}
Further Subsets can be formed from this:
V = {x: x is vowels in English}
C = {x: x is consonants in English}
SET OPERATIONS
1.Union of Set
If A and B are two sets then the union of Set A and Set B is the set consisting of either
all the elements of Set A or Set B or both and denoted by “A ∪ B” and read as A union
B or A cup B
Symbolically presents: A ∪ B = {x : x A or x B or x both A and B}
Probability function: (Union A or B)
A ∪ B = P(A) + P(B)
Venn Diagram : Both set not having common elements so A disjoints B (A or B).
For example
A ∪ B = P(A) + P(B)
A ∪ B = (1,2,3) + (4,5,6)
A ∪ B = {1,2,3,4,5,6}
And hence the union of two Sets A and B is the logical sum of A and B where each
element is written only once.
Set A Set B
1,2,3 4,5,6
2. Intersection of Sets
When two or more sets are not disjoint, are called intersection of sets. It means two or
more sets have some common elements. It is denoted by A ∩ B and read as “ A Cap B
” or “A intersection B”. Symbolically represented as
A ∩ B = {x : x A and x B}
Otherwise if x A ∩ B: x A and x B
For example
If Set A = {1, 2, 3. 4} and Set B = {3, 4, 5, 6} then A ∩ B = {3, 4}
A B
Complement of a Set
The complement of a Set A is that set which contains all those elements of the
universal set U which are not in A. The complement of set A is the set U – A and is
denoted by Ac, A′, or ~ A. It can symbolically written as A′ = U – A = { x: x U and x
A}
For example
If Set U = {1, 2, 3, 4, 5, 6, 7, 8} and the Set A = {1, 2, 3, 4, 5} then
A′ = U – A = {6, 7, 8}.
Properties of the Complement of Set
(i) The intersection of Set A and its complement A′ are disjoint sets
i.e. A ∩ A′ is a null set {Ø}
For example
If the Set U = {1, 2, 3, 4, 5, 6, 7, 8, 9} and Set A = {1, 2, 3, 4, 5}
then A′ = U – A = {6, 7, 8, 9}
Therefore A ∩ A′ = {1, 2, 3, 4, 5} ∩ {6, 7, 8, 9} = {Ø}
(vi) If A ⊆ B then A ∪ (B – A) = B
For example
If the Set B = {1, 2, 3, 4, 5, 6, 7, 8, 9} and Set A = {1, 2, 3, 4, 5}
B – A = {1, 2, 3, 4, 5, 6, 7, 8, 9} – {1, 2, 3, 4, 5} = {6, 7, 8, 9}.
Therefore A ∪ (B – A) = {1, 2, 3, 4, 5} ∪ {6, 7, 8, 9}. = {1, 2, 3, 4, 5, 6, 7, 8, 9} = B
Difference of Sets
Set A and Set B are two sets then the difference of Set A and B is the set which
consist of those elements which belongs to A but does not belong to B denoted by A
– B and read as “A difference B “or A minus B” and also denoted by A ~ B.
The symbolical representation is A – B = (x : x A and x ∉ B)
similarly A – A = (x : x B and x ∉ A).
For example
If Set A = {1, 2, 3, 4}, Set B = {3, 4, 5} then A – B = {1, 2, 3, 4} – {3, 4, 5} = {1,
2}.
Similarly A – A = {3, 4, 5} – {1, 2, 3, 4} = {5}
Properties of Difference of Sets
(i) A – A = Ø.
For example
If Set A = {1, 2, 3, 4, 5) then A – A = {1, 2, 3, 4, 5} – {1, 2, 3, 4, 5} = Ø
(ii) A – Ø = A.
For example
If Set A = {1, 2, 3, 4, 5} and Ø be a null set
then A – Ø = {1, 2, 3, 4, 5} – {Ø} = {1, 2, 3, 4, 5} =A, hence A – Ø = A.
(iii) A – B, A ∩ B and B – A are mutually disjoint.
For example
If Set A = {1, 2, 3, 4, 5} and Set B = {4, 5, 6, 7}
then A – B = {1, 2, 3, 4, 5} – {4, 5, 6, 7} = {1, 2, 3}
A ∩ B = {1, 2, 3, 4, 5} ∩ {4, 5, 6, 7} = {4, 5} and B – A = {4, 5, 6, 7} – {1, 2, 3, 4, 5}
= {6, 7} (iv) (A – B) ∪ A = A
For example
If Set A = {1, 2, 3, 4, 5} and Set B = {4, 5, 6, 7} then
A – B = {1, 2, 3, 4, 5} – {4, 5, 6, 7} = {1, 2, 3}.
Therefore, (A – B) ∪ A = {1, 2, 3} ∪ {1, 2, 3, 4, 5} = {1, 2, 3, 4, 5}.
(v) (A – B) ∩ B = Ø
For example
If Set A = {1, 2, 3, 4, 5} and Set B = {4, 5, 6, 7} then
A – B = {1, 2, 3} = {1, 2, 3, 4, 5} – {4, 5, 6, 7} = {1, 2, 3}.
Therefore, (A – B) ∩ B = {1, 2, 3} ∩ {4, 5, 6, 7}. = Ø
Illustration No. 1
If Set A = {1, 2, 3, 4, 5, 6}, Set B = {4, 5, 6, 7} and Set
C = { 3, 5, 6, 7, 9}, then, find (i) A – (B ∩ C) = (A – B) ∪
(A – C)
(ii) A ∪ B ∩ C) = (A ∪ B) ∩ (A ∪ C)
(iii) A ∩ (B – C) = (A ∩ B) – (A ∩ C)
Solution:
(B ∩ C) = {4, 5, 6, 7} ∩ {3, 5, 6, 7, 9}
= {5, 6, 7}
Therefore
A – (B ∩ C) = {1, 2, 3, 4, 5, 6} – {5, 6, 7}
= {1, 2, 3, 4}
Similarly
(A – B) = {1, 2, 3}
and
(A – C) = {1, 2, 4}
Therefore (A – B) ∪ (A – C) = {1, 2, 3, 4}
Hence, A – (B ∩ C) = (A – B) ∪ (A – C)
(ii) (B ∩ C) = {4, 5, 6, 7} ∩ {3, 5, 6, 7, 9}
= {5, 6, 7}
Therefore
A ∪ B ∩ C) = {1, 2, 3, 4, 5, 6} ∪ {5, 6, 7}
= {1, 2, 3, 4, 5, 6, 7}
Similarly,
(A ∪ B) = {1, 2, 3, 4, 5, 6} ∪ {4, 5, 6, 7}
= {1, 2, 3, 4, 5, 6, 7}
And
(A ∪ C) = {1, 2, 3, 4, 5, 6} ∪ {3, 5, 6, 7, 9},
= {1, 2, 3, 4, 5, 6, 7, 9}
Therefore,
(A ∪ B) ∩ (A ∪ C) = {1, 2, 3, 4, 5, 6, 7} ∩ {1, 2, 3, 4, 5, 6, 7, 9},
= {1, 2, 3, 4, 5, 6, 7}.
Hence A ∪ B ∩ C) = (A ∪ B) ∩ (A ∪ C).
(iii) (B – C) = {4}
Therefore
A ∩ (B – C) = {4}
But (A ∩ B) = {4, 5, 6}
And
(A ∩ C) = {3, 5, 6}
Therefore,
(A ∩ B) – (A ∩ C) = {4}
Hence A ∩ (B – C) = (A ∩ B) – (A ∩ C).
Illustration No. 2
If Set U = {1, 2, 3, 4, 5, 6, 7, 8, 9}, Set A = {1, 2, 3, 4, 5}, Set B = {4,
5, 6, 7} and Set C = {5, 6, 7, 8} then find
(i) (A ∪ B) ∩ (A ∪ C)
(ii) (A ∩ B) ∪ (A ∩ C)
(iii) (A ∪ B ∪ C)′ (iv) (A ∪B′) ∩ (A′ ∪ B) Solution:
(i) (A ∪ B) = {1, 2, 3, 4, 5} U {4, 5, 6, 7}
= {1, 2, 3, 4, 5, 6, 7}.
And
(A ∪ C) = {1, 2, 3, 4, 5} ∪ {5, 6, 7, 8}
= {1, 2, 3, 4, 5, 6, 7, 8}.
Therefore,
(A ∪ B) ∩ (A ∪ C) = {1, 2, 3, 4, 5, 6, 7} (ii)
(A ∩ B) = {1, 2, 3, 4, 5} ∩ {4, 5, 6, 7}.
= {4, 5}
And
(A ∩ C) = {1, 2, 3, 4, 5} ∩ {5, 6, 7, 8}
= {5}
Therefore,
(A ∩ B) ∪ (A ∩ C) = {4, 5} ∪ {5}.
= {4, 5}.
(iii) (A ∪ B ∪ C)′ = U – (A ∪ B ∪ C)
But,
(A ∪ B ∪ C) = {1, 2, 3, 4, 5, 6, 7, 8}
Therefore,
(A ∪ B ∪ C)′ = {1, 2, 3, 4, 5, 6, 7, 8, 9} – {1, 2, 3, 4, 5, 6, 7, 8}
= {9}.
(iv) (A ∪ B′) = {1, 2, 3, 4, 5} ∪ {1, 2, 3, 8, 9}, = {1, 2, 3, 4, 5,
8, 9}.
And
(A′ ∪ B) = {6, 7, 8, 9} ∪ {4, 5, 6, 7, 8},
= {4, 5, 6, 7, 8, 9}.
Therefore,
(A ∪ B′) ∩ (A′ ∪ B) = {1, 2, 3, 4, 5, 8, 9} ∩ {4, 5, 6, 7, 8, 9 }
= { 4, 5, 8, 9 }.
Illustration No. 3
If Set U = {1, 2, 3, 4, 5, 6, 7, 8}, Set A = {2, 3, 4}, Set B = {1, 4, 5, 6} and Set C =
{1, 2, 4, 5, 7} then find (i) (A ∩ B) ′ = A′ ∪ B′.
(ii) A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).
Solution:
(i) (A ∩ B) = {2, 3, 4} ∩ {1, 4, 5, 6}.
= {4}
Therefore (A ∩ B)′ = U – (A ∩ B)
= {1, 2, 3, 4, 5, 6, 7, 8} – {4}
= {1, 2, 3, 5, 6, 7, 8}.
Similarly
A′ = U – A = {1, 2, 3, 4, 5, 6, 7, 8} – {2, 3, 4},
= {1, 5, 6, 7, 8}.
And
B′ = U – B = {1, 2, 3, 4, 5, 6, 7, 8} – {1, 4, 5, 6},
= {2, 3, 7, 8}
Therefore,
A′ ∪ B′ = {1, 5, 6, 7, 8} ∪ {2, 3, 7, 8},
= {1, 2, 3, 5, 6, 7, 8}.
Hence (A ∩ B) ′ = A′ ∪ B′.
Illustration No. 1
If Set A = {1, 2, 3} and Set B = {1, 2} then prove that A × B ≠ B × A
Solution:
The Cartesian product A × B = {(1, 1) , (1, 2) , (2, 1), (2, 2) ,(3, 1) (3, 2)}
Similarly B × A = {(1, 1), (1, 2), ( 1, 3), (2, 1), (2, 2), ( 2, 3)}
Thus (3, 1) and (3, 2) are elements of A × B are not elements B × A.
Similarly (2,3) is a element in B × A but not A × B, therefore A ×B ≠ B × A
Illustration No. 2
If Set A = {1, 2} , Set B = {2, 3} and Set C {3, 4} then find
(i) A × (B ∪ C
(ii) (A × B) ∩ (A × C).
(iii) A × (B ∩ C).
Solution:
(i) (B ∪ C {2, 3} ∪ {3, 4}
= {2, 3, 4}.
Therefore,
A × (B ∪ C {1, 2} × {2, 3, 4}.
= { ( 1, 2 ), ( 1, 3), ( 1, 4), (2, 2), (2, 3) ,( 2, 4) }.
(ii) ( A × B ) = { 1, 2} × { 2, 3}
= { ( 1,2 ) , ( 1,3), (2,2), (2,3) }.
And ( A × C ) = { 1, 2} × { 3, 4}
= { ( 1, 3 ) , ( 1, 4), (2, 3), (2, 4) }
Therefore
( A × B ) ∩ (A × C ) = { ( 1, 3 ), (2, 3) }.
(iii) ( B ∩ C ) = { 2, 3 } ∩ {3, 4}
= { 3 }.
Therefore A × ( B ∩ C ) = { 1, 2} × { 3 }.
= { (1, 3 ) , ( 2, 3) }.
Illustration No. 3
If Set A = {1, 2} , Set B = {1, 2, 3} and Set C {1, 2, 3, 4} then verify whether A × (B
∩ C) = (A × B) ∩ (A × C) ?
Solution:
(B ∩ C) = {1, 2, 3} ∩ {1, 2, 3, 4}
= {1, 2, 3}
Therefore
A × (B ∩ C) = {1, 2 } × {1, 2, 3}.
= { ( 1, 1 ), ( 1, 2 ), ( 1, 3), (2, 1), (2, 2), ( 2, 3) }
But,
(A × B) = {1, 2} × {1, 2, 3}
= { (1, 1), (1, 2), (1, 3), (2, 1), (2, 2), ( 2, 3) }
And
(A × C ) = { (1, 1), (1, 2 ), (1, 3), (1, 4 ), (2, 1), (2, 2) ,( 2, 3), (2, 4) }.
Therefore,
(A × B) ∩ (A × C ) = { (1, 1), (1, 2), (1, 3), (2, 1), (2, 2), ( 2, 3) }.
Hence A × (B ∩ C ) = (A × B) ∩ (A × C)