sets

A set is a well defined collection of

object.
Eg-Collection of object of a
particular kind, such as, a pack of
cards, a crowed of peoples, a cricket
team, etc, In mathematics of
natural no., points, prime no., etc.
 HISTORY OF SETS

The theory of sets was developed by

German mathematician Georg Cantor
(1845-1918) . He first encountered
sets while working on “ Problems on
Trigonometric series”. SETS are being
Used in solving mathematics
problems since they were discovered .
 sets representation
There are two ways to represent sets :

1) Roster or tabular form .

2) Set-builder form .
1)Elements of a set are synonymous terms.
2)Sets are usually denoted by capital letters.
3)Elements of a set are represented by small
letters.
 set-builder form
In set-builder form, all the elements of a
set possess a single common property
which is not possessed by any element
outside the set .
e.g. :
set of natural numbers k .
k= { x : x is a natural no }
 roster form
In roster form all the elements of sets
are listed, the elements are being
separated by commas & are enclosed
within braces { } .
e.g. :
set of 1,2,3,4,5,6,7,8,9,10 .
{ 1,,2,3,4,5,6,7,8,9,10 }
examples of sets in maths
N : The set of all natural numbers.
z : The set of all integers.
Q : The set of all rational numbers.
R : The set of all real numbers.
Z+ : The set of all positive integers.
Q+ : The set of all positive rational numbers.
R+ : The set of all positive real numbers.
 types of sets
1) Empty set.
2) Finite & Infinite sets.
3) Equal sets.
4) Subset.
5) Power set.
6) Universal set.
 the empty set
A set which doesn’t contain any element
is called the empty set or null set or void set,
donated by symbol φ or { } .

e.g. : let R = { x : 1 < x < 2, x is a natural

number }
 finite & infinite sets
A set which is, empty or consist of a
definite no. of elements is called finite
otherwise, the set called infinite .

e.g. : let k be the set of the days of the week .

Then k is finite. (finite)
let r be the set of points on a line.
Then R is infinite. (infinite)
 equal sets
Two sets k & R are said to be equal if
they have exactly the same elements and
we write k=R . Otherwise, the sets are
said to be unequal and we write k≠R.
e.g. :
let k = { 1,2,3,4,} & R= { 1,2,3,4 }.
then k=R
 subsets
A set R is said to be a subset of a set k
if every element of R is also an element
k.
=> R k
∩

This means all the elements of R

contained in k.
 power set
The set of all the subsets of a given
set is called power set of that set.
The collection of all subsets of a set k
is called the power set of k denoted by
P ( k ) . In P ( k ) every element is a set.
if k = { 1,2 }
P(k)={φ,{1},{2},{1,2}}
 universal set
The super set of all the given type of
sets would be called as universal set
of all the other given type of sets.
e.g. : the set of real numbers would be the
universal set of all the other sets
of numbers.
Note : [excluding negative roots]
 Subsets of r
1) The set of natural no. N={ 1,2,3, …}
2) The set of integers Z={… , -2,-1,0,1,2,…}
3) The set of rational no. Q={ x : x = p/q ,
p,q are integers and q ≠ 0 }

Note : members of Q also include negative

numbers.
history of Venn diagrams

Most of the relationships of sets

can be represented using Venn
diagrams . Venn are named after
the English logician, Johan Venn
(1834-1883).
Venn consist of rectangles &
closed cure usually circles. The
universal set is represented
usually by rectangle & its
subsets by circle.
illustration 1. In fig 1., U =
{ 1, 2, 3, …, 10 } is the universal set of which
A = { 2, 4, 6, 8, 10 } is a subset.

U
fig .1 A .2 .3
1. .5
.4
.8 .6
. 10 .7
.9
illustration 2. In fig 2., U =
{ 1, 2, 3, …, 10 } is the universal set of which
A = { 2, 4, 6, 8, 10 } & B = { 4, 6 } are subsets,
& also B A.
∩

U
A
fig .1 .2 .3
2. B
.8 .4 .5
.6
.9 . 10 .7
Union of sets : The union of
two sets A & B is the set C which consists
of all those elements which are either in
A or B or in both.
GREEN part is
the union.
some properties of union
1. ∩
A B=B A
∩
(commutative law)
2. ∩
(A B) C=A
∩ ∩ ∩
(B C)
( associative law )
3. A
∩
φ=A ( law of identity element )
4. A
∩
A=A (idempotent law)
5. U
∩
A=U ( law of U )
intersection of sets : The
intersection of two sets A & B is the set of all
those elements which belong to both A & B.

GREEN part
shows the
intersection.
some properties of intersection :

1) A ∩B = B ∩A ( commutative law )
2) ( A ∩B ) ∩C = A ∩( B ∩C )
( associative law )
3) φ ∩A = φ, U ∩A = A ( law of φ & U)
4) A ∩A = A ( idempotent law )
5) ∩ ∩
A ∩( B C ) = ( A ∩B ) ( A ∩C )
( distributive law )
THANK
YOU
 MADE BY-
DISHA GOYAL
CLASS-XI B