KENDRIYA VIDYALAYA

AIR FORCE STATION

SARSAWA
 MATHS PROJECT

Made By :- Aniket Sharma

Class :- XI A
Roll No. :- 06
 BASIC CONCEPTS
✕ Set theory begins with a fundamental binary relation
between an object o and a set A. If o is a member (or
element) of A, we write . Since sets are objects, the
membership relation can relate sets as well.
✕ A derived binary relation between two sets is
the subset relation, also called set inclusion. If all the
members of set A are also members of set B, then A is a
subset of B, denoted . For example, {1,2} is a subset
of {1,2,3}, but {1,4} is not. From this definition, it is clear
that a set is a subset of itself; in cases where one wishes
to avoid this, the term proper subset is defined to
exclude this possibility.
 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 mathematics problem since they
were discovered.
 SETS
Collection of object of a particular kind,
such as, a pack of cards, a crowed of
people, a cricket team etc. In mathematics
of natural number, prime numbers etc.
 A set is a well defined
collection of objects.
➢Elements of a set are
synonymous terms.
➢Sets are usually denoted by
capital letters.
➢Elements of a set are
represented by small
letters.
 SETS REPRESENTATION
There are two ways to represent sets

 Roster or tabular form.

 Set-builder form.
 ROSTER OR TABULAR
FORM
In roster form, all the elements
of set are listed, the elements
are being separated by commas
and 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}
 SET-BUILDER FORM
In set-builder form, all the elements of a
set possess a single common property
which is not possessed by an element
outside the set.
e.g. : set of natural numbers k
k= {x : x is a natural number}
 EXAMPLE 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 positive integers
Q+ : the set of positive rational
numbers
R+ : the set of positive real numbers.
 TYPES OF SETS
 Empty sets.
 Finite &Infinite sets.
 Equal sets.
 Subset.
 Power set.
 Universal set.
 THE EMPTY SET
A set which doesn't contains any element is
called the empty set or null set or void set,
denoted 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 numbers of elements is
called finite otherwise, the set is
called infinite.
e.g. : let k be the set of the days of
the week. Then k is finite
let R be the set of points on
a line. Then R is infinite
 EQUAL SETS
Given two sets K & r are said to
be equal if they have exactly
the same element 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 subset of a set K if
every element of R is also an element K.
R⊂K
This mean all the elements of R contained
in K
 POWER SET
The set of all subset 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
denoted by P(K).In P(K) every
element is a set.
If K= [1,2}
P(K) = {ϕ, {1}, {2}, {1,2}}
 UNIVERSAL SET
Universal set is set which contains all object,
including itself.
e.g. : the set of real number would be the
universal set of all other sets of number.
NOTE : excluding negative root
 100 people were surveyed. 52 people in a
survey owned a cat. 36 people owned a dog.
Draw a Venn diagram.

24 did not own a dog or cat.

universal set is 100 people surveyed Since 24
52 + 36 = 88 so
did not own
there must be
24 a dog or
88 - 76 = 12 C D
cat, there
people that own 12
40 24 must be 76
both a dog and
that do.
a cat.

n(C  D) = 76
Set C is the cat owners and Set D is the dog owners. The sets are NOT disjoint. Some people could own both a
dog and a cat.

This n means the

Counting Formula:
number of elements
n(A  B) = n(A) + n(B) - n(A  B)
in the set
 SUBSETS OF R
➢ The set of natural numbers N=
{1,2,3,4,....}
➢ The set of integers Z= {…,-2, -1, 0,
1, 2,
3,…..}
➢ The set of rational numbers Q= {x :
x = p/q, p, q ∈ Z and q ≠ 0

NOTE : members of Q also include

Number of Elements in Set Possible Subsets Total Number of Possible Subsets

1. {A} {A}  2

2. {A , B}
{A , B} {A} {B}  4

{A , B , C} {A , B} {A , C} {B , C} {A} {B} {C} 

8
3. {A , B , C}

4. {A , B , C, D} {A , B , C , D} {A , B , C} {A , B , D} {A , C , D}
{B , C , D} {A , B} {A , C} {A , D} {A , B} …… {D} 

?
16

n
The number of possible subsets of a set of size n is ?

2
INTERVALS OF SUBSETS R

 OPEN INTERVAL

The interval denoted as (a, b), a &b are

real numbers ; is an open interval, means
including all the element between a to b
but excluding a &b.
➢ CLOSED INTERVAL

The interval denoted as [a, b],

a &b are Real numbers ; is an
open interval, means including
all the element between a to b
but including a &b.
 TYPES OF INTERVALS

 (a, b) = {x : a < x < b}

 [a, b] = {x : a ≤ x ≤ b}
 [a, b) = {x : a ≤ x < b}
 (a, b) = {x : a < x ≤ b}
 HISTORY OF VENN
DIAGRAM
A Venn diagram or set diagram is a diagram that shows
all possible logical relations between a finite collection
of sets. Venn diagrams were conceived around 1880
by John Venn. They are used to teach elementary set
theory, as well as illustrate simple set relationships
in probability, logic, statistics linguistics and computer
science.
Venn consist of rectangles and closed
curves usually circles. The universal is
represented usually by rectangles and its
subsets by circle.
ILUSTRATION 1. in fig U= { 1, 2 , 3, …..,
10 } is the universal set of which A = { 2, 4, 3,
……, 10} is a subset.

.1 .2 .3

.4
.5 .8
.6

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

.8 .4 .5

.6
.9 .7
. 10
 OPERATIONS ON SETS

UNION OF SETS : the union of two sets A and B

is the set C which consist of all those element which
are either in A or B or in both.
PURPLE part is
the union

AUB
(UNION)
 COMPLEMENT OF SETS
Let U = { 1, 2, 3, } now the set of all those
element of U which doesn’t belongs to A will
be called as A compliment.

GREY part
shows A
A compleme
nt
 PROPERTIES OF
COMPLEMENTS OF SETS
1) Complement laws : 1) A U A’ = U
2) A ∩ A’ = Φ
2) De Morgan’s law : 1) ( A U B )’ = A’ ∩
B’
2) ( A ∩ B )’ = A’ U B’
3) Laws of double complementation : ( A’ ) ‘
=A
4) Laws of empty set and universal set :
Φ ‘ = U & U’ = Φ
 SOME PROPERTIES OF THE
OPERATION OF UNION

1) A U B = B U A ( commutative
law )
2) ( A U B ) U C = A U ( B U C )
(
associative law )
3) A U ϕ = A ( law of identity
element )
4) A U A = A ( idempotent law )
 SOME PROPERTIES OF THE
OPERATION OF
INTERSECTION
1) A ∩ B = B ∩ A ( commutative law )
1.( A ∩ B ) ∩ C = A ∩ ( B ∩ C )
( associative law
)
1) Φ ∩ A = Φ, U ∩ A = A ( law of Φ
and U )
2) A ∩ A = A ( idempotent law )
3) A ∩ ( B U C ) = ( A ∩ B ) U ( A ∩ C )
THE END