Sets Theory Lecture
Sets Theory Lecture
SET THEORY
Introduction
In this chapter we will understand the various concepts in relation to set
theory from the basic understanding, what is a set? 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.
Some of the key contributors are Georg Cantor (1845-1918) from whose
work the modern set theory was largely originated and other prominent
contributors are 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 of the set. But we need to elaborate on the
term “well-defined” it means that each element bears certain
characteristics with which it can be identified under a particular head.
For example
(i) The set {a, e, i} 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}
1
2 Business Mathematics
= {1, 2, 3, 4, 5}
=A∪B
Clearly A ∪ B = B ∪ A
Alternative Proof
Union of sets is Communicative i.e. if Set A and Set B are two sets
then A ∪ B = B ∪ A.
In order to prove A ∪ B = B ∪ A,
We first prove that A ∪ B ⊆ B ∪ A and then B ∪ A ⊆ A ∪ B, if both
of them holds good then A ∪ B = B ∪ A.
Let x be any element belongs to A ∪ B.
So x ∈ A ∪ B x ∈ A or x ∈ B
x ∈ B or x ∈ A
x∈B∪A
So A ∪ B ⊆ B ∪ A ………… (1)
Again let’s assume y be an element such that
y ∈ B ∪ A y ∈ B or y ∈ A
y ∈ A or y ∈ B
y∈A∪B
So B ∪ A ⊆ A ∪ B ………… (2)
From (1) and (2) we get A ∪ B ⊆ B ∪ A and B ∪ A ⊆ A ∪ B, therefore
we get A ∪ B = B ∪ A.
(iii) Union of sets is associative i.e. If Set A, Set B and Set C are
three sets then A ∪ (B ∪ C) = (A ∪ B) ∪ C
For example
If Set A = {1, 2, 3}, Set B = {3, 4, 5} and Set C = {5, 6}, then
(A ∪ B) = {1, 2, 3, 4, 5}
Therefore
(A ∪ B) ∪ C = {1, 2, 3, 4, 5} ∪ {5, 6}
= {1, 2, 3, 4, 5, 6}
Similarly,
(B ∪ C) = {3, 4, 5, 6}
Set Theory 7
Therefore,
A ∪ (B ∪ C) = {1, 2, 3} ∪ {3, 4, 5, 6}
= {1, 2, 3, 4, 5, 6}
and hence,
A ∪ (B ∪ C) = (A ∪ B) ∪ C
Alternate Proof
If Set A, Set B and Set C are three sets then
A ∪ (B ∪ C) = (A ∪ B) ∪ C
Let x be an element which belongs to A ∪ (B ∪ C)
Then x ∈ A ∪ (B ∪ C),
x ∈ A or x ∈ (B ∪ C)
x ∈ A or (x ∈ B or x ∈ C)
(x ∈ A or x ∈ B) or x ∈ C
x ∈ (A ∪ B) ∪ C
Thus, A ∪ (B ∪ C) = (A ∪ B) ∪ C.
(iv) If Set A is a set, then A ∪ Ø = A where Ø is a null set
For example
If Set A = {1, 2, 3}, then A ∪ Ø = {1, 2, 3} ∪ {Ø}
= {1, 2, 3}
=A
Alternate Proof
If Set A is any set then A ∪ Ø = A
Let x be any element such that x ∈ A ∪ Ø then x ∈ A or x ∈ Ø but
{ Ø } being null set therefore x ∉ {Ø}, thus x ∈ A.
Hence A ∪ Ø = A
(v) Union of sets is idempotent
If Set A is any set then A ∪ A = A.
For example
If A = {1, 2, 3} then A ∪ A = {1, 2, 3} ∪ {1, 2, 3}
= {1, 2, 3}
=A
8 Business Mathematics
Alternate Proof
If Set A is any set then A ∪ A = A
Let x be any element so that x ∈ A ∪ A
x ∈ A or x ∈ A
x ∈ A thus A ∪ A = A
(vi) If Set A is a subset of universal Set ∪ then A ∪ ∪ = ∪
For example
If Set ∪ = {1, 2, 3, 4, 5, 6, 7} and Set A = {1, 2, 3}
A ∪ ∪ = {1, 2, 3} ∪ {1, 2, 3, 4, 5, 6, 7}
= {1, 2, 3, 4, 5, 6, 7}
= ∪.
(vii) If Set A and Set B are two sets such that A ⊆ B then A ∪ B = B
and if B ⊆ A then A ∪ B = A
For example
If Set A = {1, 2, 3} and Set B = {1, 2, 3, 4, 5}
Then A ⊆ B
A ∪ B = {1, 2, 3} ∪ {1, 2, 3, 4, 5}
= {1, 2, 3, 4, 5} = B
Similarly If A = {1, 2, 3, 4, 5}
B = {1, 2, 3}
In this case B ⊆ A
A ∪ B = {1, 2, 3, 4, 5} ∪ {1, 2, 3}
A ∪ B = {1, 2, 3, 4, 5} = A
Alternate Proof
If A and B are two sets then A ⊆ A ∪ B and B ⊆ A ∪ B
let x be any element of the Set A such that
x ∈ A x ∈ A or x ∈ B
x ∈ (A ∪ B) A ⊆ A ∪ B
Similarly B ⊆ A∪B can be proved.
Set Theory 9
Intersection of Sets
Let A and B are two sets then intersection set of Set A and Set B is
the set which consist of common elements which belongs to both
A and B 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} and Set B = {3, 4, 5} then A ∩ B = {3}
The Venn diagram representation is shown below as:
A∩B S
A B
The following are the properties which hold with respect to intersection
of sets
(i) Communicative Property
Intersection of sets is communicative i.e. if Set A and Set B are two
sets then A ∩ B = B ∩ A
For example
If Set A = {1, 2, 3} and Set B = {3, 4, 5}
then A ∩ B = {1, 2, 3} ∩ {3, 4, 5}
= {3}.
Similarly,
B ∩ A = {3, 4, 5} ∩ {1, 2, 3}
= {3}.
10 Business Mathematics
Therefore A ∩ B = B ∩ A.
Alternative Proof
Let x A ∩ B then x A and x є B x B and x A i.e.
x B ∩ A.
Hence A ∩ B = B ∩ A.
(ii) Associative Property
The intersection of sets are associative i.e. if Set A, Set B and Set C
are three sets then (A ∩ B) ∩ C = A ∩ (B ∩ C).
For example
If Set A = {1, 2, 3, 4}, Set B = {3, 4, 5} and Set C = {4, 5, 6}
Then A ∩ B = {1, 2, 3, 4} ∩ {3, 4, 5}
= {3, 4}.
Hence (A ∩ B) ∩ C = {3, 4} ∩ {4, 5, 6}
= {4}.
Similarly,
B ∩ C = {3, 4, 5} ∩ {4, 5, 6}
= {4, 5}.
Hence,
A ∩ (B ∩ C) = {1, 2, 3, 4} ∩ {4, 5}
= {4}
Therefore (A ∩ B) ∩ C = A ∩ (B ∩ C)
Alternative Proof:
Let x (A ∩ B) ∩ C then x (A ∩ B) and x C
(x A and x B) and x C
x A and (x B and x C).
x A ∩ (B ∩ C ).
Hence (A ∩ B) ∩ C = A ∩ (B ∩ C).
(iii) Idempotent Property
The intersection of sets is idempotent i.e. if Set A is any set, then
A∩A=A
Set Theory 11
For example
If Set A = {1, 2, 3, 4} then
A ∩ A = {1, 2, 3, 4} ∩ {1, 2, 3, 4}
= {1, 2, 3, 4}
=A
Alternative Proof
Let x be any element such that x A ∩ A, then x A and
xA
xA
Hence A ∩ A = A.
(iv) If Set A is any set then A ∩ Ø = Ø, Ø is the null set
For example
If Set A = {1, 2, 3, 4} and Ø = { } then,
A ∩ Ø = {1, 2, 3, 4} ∩ { }
={ }
= Ø.
(v) If Set A is any set subset of an Universal Set U then A ∩ U = A
For example
If Set U = {1, 2, 3, 4, 5, 6, 7} and Set A = {1, 2, 3, 4}
then A ∩ U = {1, 2, 3 ,4, 5, 6, 7} ∩ {1, 2, 3, 4}
= {1, 2, 3, 4}
=A
Alternative Proof
Let x be any element such that x A x A and x U since
A ⊆U
Therefore x A ∩ U,
And hence A ⊆ A ∩ U …………………1
But A ∩ U ⊆ A … ……………………2
From 1 and 2, we get,
A A ∩ U.
12 Business Mathematics
Thus,
(A ∩ B) ∪ (A ∩ C) = {3, 4} ∪ {4}
= {3, 4}
Therefore A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
Alternative Proof
Let x be any element belonging to A ∩ (B ∪ C), then,
x A ∩ ( B ∪ C) x A and x (B ∪ C)
x A and ( x B or x C )
(x A and x B ) or (x A and x C )
x ( A ∩ B ) or x ( A ∩ C )
x(A∩B)∪(A∩C)
Hence A ∩ (B ∪ C) = ( A ∩ B ) ∪ ( A ∩ C )
Result 2
If Set A, Set B and Set C are three sets, then
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
If Set A = {1, 2, 3, 4}, Set B = {3, 4, 5} and Set C = {4, 5, 6}
Then
(B ∩ C) = {3, 4, 5} ∩ {4, 5, 6}
= {4, 5}
and
A ∪ (B ∩ C) = {1, 2, 3, 4 } ∪ {4, 5 }
= {1, 2, 3, 4, 5 }
Similarly
(A ∪ B) = {1, 2, 3, 4} ∪ {3, 4, 5}
= {1, 2, 3, 4, 5}
(A ∪ C) = {1, 2, 3, 4} ∪ {4, 5, 6}
= {1, 2, 3, 4, 5, 6}
Then (A ∪ B) ∩ (A ∪ C) = {1, 2, 3, 4, 5} ∩ {1, 2, 3, 4, 5, 6}
= {1, 2, 3, 4, 5}
Therefore A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
14 Business Mathematics
Alternative Proof
Let x be any element belonging to A ∪ (B ∩ C), then,
x A ∪ ( B ∩ C) x A or x (B ∩ C)
x A or (x B and x C)
(x A or x B) and (x A or x C)
x (A ∪ B) and x (A ∪ C)
x (A ∪ B) ∩ (A ∪ C)
Hence A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C).
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′, 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}
= {Ø}
Alternative Proof
Let x be an element such that
x A ∩ A′ x A and x A′ x {Ø}
(ii) The union of Set A and its complement is the universal set i.e.
A ∪ A′ = U, the universal set.
Set Theory 15
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}
= {1, 2, 3, 4, 5, 6, 7, 8, 9}
= Set U.
Alternative Proof
As every set is the subset of the universal set, therefore A ∪ A′ ⊆ U.
Let x U that implies x A or x A′ x A ∪ A′. Therefore
U ⊆ A ∪ A′. Hence A ∪ A′ = U.
(iii) Complement of complement a Set A is the set itself i.e. (A′)′ = A
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′)′ = U - A′ = {1, 2, 3, 4, 5} = Set A
Alternative Proof
Let x (A′)′ x ∉ A′ x A.
(iv) If the Set A is equal to the universal Set U then A′ = {Ø}.
(v) If Set A and Set B are two sets then A – B = A ∩ B′
For example
If the Set U = {1, 2, 3, 4, 5, 6, 7, 8, 9} , 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}.
But B′ = U – B = {1, 2, 3, 4, 5, 6, 7, 8, 9} – {4, 5, 6, 7}
= {1, 2, 3, 8, 9}
Thus A ∩ B′ = {1, 2, 3, 4, 5} ∩ {1, 2, 3, 8, 9}
= {1, 2, 3}
=A–B
16 Business Mathematics
Alternate Proof
Let x A – B x A and x ∉ B x A and x B′ x
(A ∩ B′) and hence A – B = A ∩ B′.
(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
Alternate Proof
As given A ⊆ B let x A ∪ (B – A) x A or x (B – A)
(x A or x B) and (x A or x A′)
x (A ∪ B) and x є B as (A ∪ A′ = B as A ⊆ B)
x (A ∪ B)
x B, hence A ∪ (B – A) = B
Difference of Sets
Let 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
B – 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
B – A = {3, 4, 5} – {1, 2, 3, 4}
= {5}
Set Theory 17
Alternate Proof
We need to prove that (A – B) ∩ (A ∩ B) = Ø
Let x (A – B) ∩ (A ∩ B) then x (A – B) and x (A ∩ B)
(x A and x ∉ B) and (x A and x B)
x A and x Ø as there cannot be an element
satisfying both the condition i.e. x B and x ∉ B)
x Ø.
Similarly other results can be equally proved in the same lines.
(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}.
Alternate Proof
Let x belongs to (A – B) ∪ A then x (A – B) or x A
(x A and x ∉ B) or x A
x A and x ∉ B
xA
Hence, (A – B) ∪ A = A
(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}.
=Ø
Set Theory 19
Alternate Proof
Let x belongs to (A – B) ∩ B then x (A – B) and x B
(x A and x ∉ B) and x B
Note there cannot be element satisfying both the condition i.e.
x B and x ∉ B)
x A and x Ø
x Ø, hence (A – B) ∩ B = Ø
De Morgan’s Law
1st Law
Let Set A and Set B are two sets then (A ∪ B)′ = A′ ∩ B′
For example
Set U = {1, 2, 3, 4, 5, 6, 7, 8, 9},
Set A = {1, 2, 3, 4} and
Set B = {6, 7, 8, 9}
Then
(A ∪ B) = {1, 2, 3, 4} ∪ {6, 7, 8, 9}
= {1, 2, 3, 4, 6, 7, 8, 9}
Now,
(A ∪ B)′ = U – (A ∪ B)
= {1, 2, 3, 4, 5, 6, 7, 8, 9} – {1, 2, 3, 4, 6, 7, 8, 9}
= {5}.
A′ = U – A = {1, 2, 3, 4, 5, 6, 7, 8, 9} – {1, 2, 3, 4}
= {5, 6, 7, 8, 9}
B′ = U – B = {1, 2, 3, 4, 5, 6, 7, 8, 9} – {6, 7, 8, 9}.
= {1, 2, 3, 4, 5}
Now,
A′ ∩ B′ = {5, 6, 7, 8, 9} ∩ {1, 2, 3, 4, 5}
= {5}
Therefore (A ∪ B)′ = A′ ∩ B′
20 Business Mathematics
Alternate Proof
(A ∪ B)′ = A′ ∩ B′
Let x be any element of (A ∪ B)′,
Then x (A ∪ B)′ x U and x ∉ (A ∪ B)
x U and (x ∉ A or x ∉ B)
(x U but x ∉ A) and (x U but x ∉ B)
x A′ and x B′
x A′ ∩ B′
Hence (A ∪ B)′ = A′ ∩ B′
2nd Law
Let Set A and Set B are two sets then (A ∩ B)′ = A′ ∪ B′
For example
Set U = {1, 2, 3, 4, 5, 6, 7, 8, 9},
Set A = {1, 2, 3, 4} and
Set B = {6, 7, 8, 9}
Then
(A ∩ B) = {1, 2, 3, 4} ∩ {6, 7, 8, 9}
= {Ø}
Now,
(A ∩ B)′ = U – (A ∩ B) = {1, 2, 3, 4, 5, 6, 7, 8, 9} – {Ø}
= {1, 2, 3, 4, 5, 6, 7, 8, 9}.
A′ = U – A = {1, 2, 3, 4, 5, 6, 7, 8, 9} - {1, 2, 3, 4}
= {5, 6, 7, 8, 9}
B′= U – B = {1, 2, 3, 4, 5, 6, 7, 8, 9} - {6, 7, 8, 9}.
= {1, 2, 3, 4, 5}
Now,
A′ ∪ B′ = {5, 6, 7, 8, 9} ∪ {1, 2, 3, 4, 5}
= {1, 2, 3, 4, 5, 6, 7, 8, 9}
Therefore (A ∩ B)′ = A′ ∪ B′
Set Theory 21
Alternate Proof
(A ∩ B)′ = A′ ∪ B′
To prove the above result, let x be any element belonging to (A ∩ B)′ then
x (A ∩ B)′ x ∉ (A ∩ B)
x ∉ A or x ∉ B
x A′ or x B′
x A′ ∪ B′.
Hence,(A ∩ B)′ = A′ ∪ B′
De Morgan’s Law on Difference of Sets
A – (B ∪ C) = (A – B) ∩ (A – C)
For example
Set A = {1, 2, 3, 4, 5, 6, 7, 8, 9},
Set B = {1, 2, 3, 4} and
Set C = {6, 7, 8, 9}
Then
(B ∪ C) = {1, 2, 3, 4, 6, 7, 8, 9}
And A – (B ∪ C) = {5}.
But (A – B) = {5, 6, 7, 8, 9} and (A – C) = {1, 2, 3, 4, 5}
Therefore (A – B) ∩ (A – C) = {5}
Hence A – (B ∪ C) = (A – B) ∩ (A – C)
Alternate Proof
Let x be any element such that
x A – (B ∪ C) x A and x ∉ (B ∪ C)
x A and (x ∉ B or x ∉ C)
(x A but x ∉ B) and (x A but x ∉ C)
x (A – B) and x (A – C)
x (A – B) ∩ (A – C)
Hence A – (B ∪ C) = (A – B) ∩ (A – C)
22 Business Mathematics
(ii) A – (B ∩ C) = (A – B) ∪ (A – C)
For Example
Set A = {1, 2, 3, 4, 5, 6, 7, 8, 9},
Set B = {1, 2, 3, 4} and
Set C = {6, 7, 8, 9}
Then
(B ∩ C) = {Ø}
And A – (B ∩ C) = {1, 2, 3, 4, 5, 6, 7, 8, 9}.
But (A – B) = {5, 6, 7, 8, 9} and (A – C) = {1, 2, 3, 4, 5}
Therefore (A – B) ∪ (A – C) = {1, 2, 3, 4, 5, 6, 7, 8, 9}
Hence A – (B ∩ C) = (A – B) ∪ (A – C)
Alternate Proof
Let x be any element such that
x A – (B ∩ C) x A and x ∉ (B ∩ C)
x A and (x ∉ B and x ∉ C)
(x A and x ∉ B) or (x A and x ∉ C)
x (A – B) or x (A – C)
x (A – B) ∪ (A – C)
Hence A – (B ∩ C) = (A – B) ∪ (A – C).
Some Important results on Difference, Union and Intersection
(i) If Set A and Set B are two sets then A ∪ B = (A – B) ∪ B
For example
Set A = {1, 2, 3, 4, 5, 6, 7, 8, 9} and Set B = {1, 2, 3, 4} then
A ∪ B = {1, 2, 3, 4, 5, 6, 7, 8, 9}
And
(A – B) = {5, 6, 7, 8, 9}, then,
(A – B) ∪ B {1, 2, 3, 4, 5, 6, 7, 8, 9}
Hence
A ∪ B = (A – B) ∪ B
Set Theory 23
For example
Set A = {1, 2, 3, 6, 7, 8, 9} and Set B = {1, 2, 3, 4} then
(A – B) = {6, 7, 8, 9} and (B – A) = {4}
Therefore,
(A – B) ∪ (B – A) = {4, 6, 7, 8, 9}.
Similarly,
(A ∪ B) = {1, 2, 3, 4, 6, 7, 8, 9} and (A ∩ B) = {1, 2, 3}
Therefore
(A ∪ B) – (A ∩ B) = {1, 2, 3, 4, 6, 7, 8, 9} – {1, 2, 3}.
= {4, 6, 7, 8, 9}, hence proved.
(vi) If Set A, Set B and Set C are three sets then
(A ∩ B) – C = (A – C) ∩ (B – C).
For example
Set A = {1, 2, 3, 4, 5, 6, 7, 8, 9},
Set B = {1, 2, 3, 4, 5, 6} and
Set C = {3, 5, 6, 7, 9}, then,
(A ∩ B) = {1, 2, 3, 4, 5, 6}.
Therefore
(A ∩ B) – C = {1, 2, 3, 4, 5, 6} – {3, 5, 6, 7, 9}
= {1, 2, 4}.
Similarly
(A – C) = {1, 2, 4, 8} and (B – C) = {1, 2, 4}.
Therefore
(A – C)∩ (B – C) = {1, 2, 4, 8} ∩ {1, 2, 4}
= {1, 2, 4}.
And hence (A ∩ B) – C = (A – C) ∩ (B – C)
(vii ) If Set A, Set B and Set C are three sets then
A ∩ (B – C)=(A ∩ B) – (A ∩ C).
For example
Set A = {1, 2, 3, 4, 5, 6, 7, 8, 9},
Set Theory 25
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).
28 Business Mathematics
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}.
Set Theory 29
(vi) (A ∆ B) ∪ (A ∩ B) = A ∪ B.
(vii) A ∆ B = (A – B) ∪ B – A
(viii) A ∆ B = (A ∪ B) – (A ∩ B).
(ix) A ∆ B = {Ø} A = B.
(x) (A ∆ B) ∪ A ∩ B) = A ∪ B.
Illustration No. 1
If Set A = {1, 2, 3, 5, 6} and Set B = {1, 3, 4, 8, 9} then verify that
A ∆ B = B ∆ A and also prove that A ∆ B = (A ∪ B) – (A ∩ B) ?
Solution:
A ∆ B = (A – B) ∪ B – A
= {2, 5, 6} ∪ {4, 8, 9}
= {2, 4, 5, 6, 8, 9}
And
B ∆ A = (B – A) ∪ A – B
= {4, 8, 9} ∪ {2, 5, 6}.
= {2, 4, 5, 6, 8, 9}
Similarly, in order to prove that A ∆ B = (A ∪ B) – (A ∩ B)
As (A ∪ B) = {1, 2, 3, 5, 6} ∪ {1, 3, 4, 8, 9}.
= {1, 2, 3, 4, 5, 6, 8, 9}.
And
(A ∩ B) = {1, 3}.
(A ∪ B) – (A ∩ B) = {1, 2, 3, 4, 5, 6, 8, 9} – {1, 3}.
= {2, 4, 5, 6, 8, 9}.
Hence
A ∆ B = (A ∪ B) – (A ∩ B)
Illustration No. 2
If Set A = {1, 3, 6, 9}, Set B = {3, 4, 7, 9} and Set C = {2, 4, 5, 7} then find
(i) (A ∆ B) ∆ C = A ∆ (B ∆ C)
(ii) A ∆ (A ∩ B) = A – B
(iii) (A ∆ B) ∪ (A ∩ B) = A ∪ B.
32 Business Mathematics
Solution:
(A ∆ B) = (A – B) ∪ B – A
= {1, 6} ∪ {4, 7}
= {1, 4, 6, 7}
Therefore,
(A ∆ B) ∆ C = {1, 6} ∪ {2, 5}
= {1, 2, 5, 6}.
Similarly,
(B ∆ C) = {3, 9} ∪ {2, 5}
= {2, 3, 5, 9}.
Therefore,
A ∆ (B ∆ C) = {1, 6} ∪ 2, 5
= {1, 2, 5, 6}
Hence,
(A ∆ B) ∆ C = A ∆ (B ∆ C)
(ii) A ∆ (A ∩ B) = A – B
(A ∩ B) = {3, 9}
And
A ∆ (A ∩ B) = {1, 6} ∪ Ø
{1, 6}.
And
A – B = {1, 3, 6, 9} – {3, 4, 7, 9}.
= {1, 6}.
And hence,
A ∆ (A ∩ B) = A – B.
(iii) (A ∆ B) = (A – B) ∪ B – A
= {1, 6} ∪ {4, 7}.
= {1, 4, 6, 7}.
And (A ∩ B) = {3, 9}
Set Theory 33
Therefore,
(A ∆ B) ∪ (A ∩ B) = {1, 4, 6, 7} ∪ {3, 9}
= {1, 3, 4, 6, 7, 9}.
And
A ∪B {1, 3, 4, 6, 7, 9}.
And hence (A ∆ B) ∪ (A ∩ B) = A ∪ B.
Cardinal Number of a Set
The numbers of elements in a finite set say Set A is called as cardinal
number of A and symbolically represented as n (A).
For example
If Set A = {1, 2, 3, 4, 5, 6, 7} then n(A) = 7 as A contains only seven
elements.
Some Important Results
(i) n (A ∪ B) = n(A) + n(B) – n (A ∩ B).
Note: If Set A and Set B are disjoint sets then (A ∩ B) = {Ø}.
Therefore n(A ∪ B) = n(A) + n(B)
(ii) n (A ∪ B ∪ C) = n(A) + n(B) + n(C) – n (A ∩ B) – n (B ∩ C)
– n (A ∩ C) + n (A ∩ B ∩ C).
(iii) n (A′) = n(U) – n(A).
(iv) n(A) = n [ (A ∩ B′) ∪ (A ∩ B) ]
= n [ (A – B) ∪ (A ∩ B) ]= n(A – B) + n (A ∩ B).
(v) n(A ∪ B n(A – B) + n (A ∩ B) + n(B – A).
Illustration No. 1
In a class of 30 students, 14 has taken mathematics, 10 has taken
mathematics but not economics. Find the number of students who had
taken mathematics and economics also find the number of students who
had taken economics but not mathematics?
Solution:
Let
A = Set of students who have taken mathematics as subject.
B = Set of students who have taken economics as subject.
34 Business Mathematics
Then given are n(A ∪ B 30, n(A) = 14 and n(A ∩ B′) = 10.
Now we need to find the students who have taken both the subjects
i.e. n(A ∩ B) and the number of students who have taken economics as
subject but not mathematics i.e. n(B ∩ A′)
But
n(A) = n(A ∩ B′) + n(A ∩ B)
14 = 10 + n(A ∩ B).
n(A ∩ B) = 14 – 10.
=4
But
n(A ∪ B) = n(A) + n(B ) – n(A ∩ B).
30 = 14 + n(B ) – 4.
n(B) = 30 – 10 = 20.
Therefore,
n(B) = n(B ∩ A′) + n(A ∩ B)
20 = n(B ∩ A′) + 4.
n(B ∩ A′) = 20 – 4 = 16.
Illustration No. 2
Out of 200 students in a management school 120 students read Indian
Economic Review and 100 read Harvard Business Review if the number
of students who read neither of the journals is 40 then find the number
of students who read both them?
Solution:
Let
A = Set of students who read Indian Economic Review.
B = Set of students who read Harvard Business Review.
Then given are n(U 200 , n(A) = 120, n(B) = 100 and
n(A′ ∩ B′) = 40.
We need to find the number of students who read both the journals
i.e. Indian Economic Review and Harvard Business Review i.e. n (A ∩ B)
But,
A′ ∩ B′ = (A ∪ B)′ therefore n(A ∪ B)′ = 40.
Set Theory 35
Solution:
Let
S = City polluted by Sulphur compounds.
L = City polluted by Lead.
F = City polluted by Fly Ash.
(i) Since we need to find the number of cities polluted by at least one
of the pollutants is given by
n(S∪L∪ F) = n(S) + n(L ) + n(F) – n(S ∩ L) – n(L ∩ F)
– n (S ∩ F) + n (S ∩ L ∩ F)
= 70 + 60 + 80 – 40 – 30 – 35 + 10
= 115.
Thus 115 cities are polluted by atleast one of the pollutants.
(ii) Cities polluted by only one pollutant are
Case I: By Sulphur Compounds,
n(S ∩ L′ ∩ F ′) = n [ S ∩ (L∪ F ′
= n(S) – n (S ∩ L) – n (S ∩ F) + n(S ∩ L ∩ F)
= 70 – 30 – 40 + 10.
= 10
Case II By Lead,
n(L ∩ S′ ∩ F ′) = n [ L ∩ (S∪ F ′
n(L) – n (L ∩ S) – n (L ∩ F) + n (S ∩ L ∩ F)
= 60 – 30 – 35 + 10.
=5
Case III : By Fly Ash,
n( F ∩ S′ ∩ L ′) = n [ F ∩ (S∪ L ′
n(F) – n (F ∩ S) – n (F ∩ L) + n (S ∩ L ∩ F)
= 80 – 35 – 40 + 10
= 15
(iii) To find the number of cities which are not polluted were
= n(U) – n((S∪L∪ F)
= 200 – 115 = 85
Set Theory 37
Ordered Pairs
An ordered pair consists of two elements, say a and b represented within
parenthesis as (a, b) where a is the first member and b the second
member.
For example: the odd numbers and their squares can be represented in
the form of ordered pairs as
(1, 1); (3, 9); (5, 25); (7, 49)…………………………
Note
Two ordered pair (a, b) and (c, d) are said to be equal if and only if
a = c and b = d. In other words (a, b) = (c, d) a = c and b = d.
Cartesian Products
If Set A and Set B are two sets then the set of all ordered pairs whose
first member belongs to Set A and the second member belongs to Set B is
the Cartesian product of A and B in that order and read as A cross B and
symbolically represented as
A × B = { (x , y) ; x A and y B}
Note
(i) If A × B and B × A have same number of elements then A × B ≠
B × A unless and until A = B . Therefore the Cartesian product of
two sets is commutative if the two sets are equal.
(ii) If Set A has m elements and Set B has n elements then A × B has
mn elements.
(iii) If Set A and Set B are disjoint then the Cartesian product A × B is
also disjoint.
(iv) If either of Set A or Set B is a null set then the set A × B is also a
null set.
(v) If either of Set A or Set B is a infinite set and the other is a non
empty set then the set A × B is also an infinite set.
(vi) If Set A or Set B are finite sets then n(A × B) = n(A) × n(B).
Some Important Properties
(i) If Set A, Set B and Set C are three sets and A ⊆ B, then
(A × C) ⊆ B × C)
For example
Let {1, 2} A × C then 1 A and 2 C
38 Business Mathematics
1 B and 2 C (Since A ⊆ B
{1, 2} (B × C)
Hence (A × C) ⊆ B × C)
Alternate Proof
Let { x, y } A × C then x A and y C
x B and y C (Since A ⊆ B
{ x, y} (B × C)
Hence (A × C) ⊆ B × C)
(ii) If Set A, Set B and Set C are three sets and A ⊆ B , and C ⊆ D then
(A × C) ⊆ B × D)
For example
let {1, 2} A × C then 1 є A and 2 C
1 B and 2 D ( Since A ⊆ B and C ⊆ D
{1, 2} (B × D)
Hence (A × C) ⊆ B × D)
Alternate Proof
let {x, y} A × C then x A and y C
x B and y D ( Since A ⊆ B and C ⊆ D
{x, y} (B × D)
Hence (A × C) ⊆ B × D)
(iii) If Set A and Set B are two sets and A ⊆ B , then
(A × A) A × B) ∩ (B × A).
For example
Let {1, 2} A × A then 1 A and 2 A
(1 A and 2 A) and (1 A and 2 A)
(1 A and 2 B) and (1 B and 2 A) (Since A ⊆ B
{1, 2} (A × B) and {1, 2} (B × A)
{1, 2} A × B) ∩ (B × A)
Hence (A × A ) = A × B ) ∩ (B × A)
Set Theory 39
Alternate Proof:
Let { x, y } A × A then x A and y A
(x A and y A ) and (x A and y A)
(x A and y B ) and (x B and y A ) { Since A ⊆ B
{x, y} (A × B) and {x, y} (B × A)
{x, y} A × B) ∩ (B × A)
Hence (A × A) = A × B) ∩ (B × A).
(iv) If Set A, Set B and Set C are three sets then
A × (B – C) = A × B) – A × C)
For example
Let (1, 2) A × (B – C) then 1 A and 2 (B – C)
1 A and 2 B and 2 ∉ C
(1 A and 2 B ) and (1 A and 2 ∉ C)
{1, 2} (A × B) and { 1, 2} ∉ (A × C)
{1, 2 } [ A × B) – (A × C)]
Hence A × (B – C) = A × B) – A × C).
Alternate Proof
Let (x, y) A × (B – C) then x A and y (B – C)
x A and y B and y ∉ C
(x A and y B) and (x A and y ∉ C)
{x, y} (A × B) and {x, y} ∉ (A × C)
{ x, y } [ A × B) – (A × C)]
Hence A × (B – C) = A × B) – A × C).
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)}
40 Business Mathematics
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)
Summary
A set is a well defined collection of objects and these objects are tended
as the members or elements of the 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.
If for a given set A, a set consisting of all the subsets of A is called the
power of the set. The power set this is denoted by P (A).
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
i. e. A ∪ B = {x : x €A or x € B or x € both A and B}
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′ , A or ~ A. It can symbolically written
as
A′ = U – A = { x: x U and x ∉ A }
The number of elements in a finite set say Set A is called as cardinal
number of A and symbolically represented as n (A).
If Set A and Set B are two sets then the set of all ordered pairs whose
first member belongs to Set A and the second member belongs to Set B is
the Cartesian product of A and B in that order and read as A cross B and
symbolically represented as
A × B = { (x , y) ; x A and y B}
42 Business Mathematics
16. In a picnic party it was found that 20 people like all three beverages
tea, coffee and cold drink. It was found that 40 people like coffee
and tea, 50 like coffee and cold drink and 50 like tea and cold
drink. It was noticed that 110 liked coffee, 100 tea and 100 cold
drink. From the above mentioned information find
(i) How many picnic goers preferred only coffee, only tea and only
cold drink?
(ii) How many of the picnic goers liked both tea and cold drink but
not coffee?
(iii) How many of the picnic goers liked at least two of the
beverages?
17. The combined membership of Accounts Society and Mathematical
society is 100. Find the number of members in Mathematical
society knowing that 60 members are the members of accounts
society and 25 are the members of both the institutions?
18. If Set A = { 1, 3 } , Set B = { 2, 4 } and Set C = { 3, 4} then find
(i) A × ( B ∪ C ) (ii) A × ( B ∩ C ) (iii) ( A × B ) ∩ A × C )
19. If Set A ={ a, b} , Set B = { c, d } and Set C = { e, f } show that
A × B ≠ B × A and also find ( A × B ) ∪ A × C )?
20. If Set A = { 1, 2, 3 } , Set B = { 1, 2 } and Set C = { 2, 4} then find
(i) A × ( B ∩ C ) (ii) ( A × B ) ∩ A × C )
Answers
1. (i) {1, 2, 3, 4, 5, 6}
(ii) {3, 4}
2. (i) {2, 3, 4, 5}
(ii) {1, 2, 3, 4, 5, 6, 7}
3. (i) {2, 3, 4, 5}
(ii) {2, 3, 5}
4. (i) {1, 3, 4, 5, 6}
(ii) {1, 2}
(iii) {1, 2}
(iv) { 2 }
5. (i) {3, 4, 5} , (ii) { Ø }, (iii) {1, 2, 6, 7, 8}
Set Theory 45