Scribd
Upload
9 views20 pages

Set Theory and Classification of Sets

The document provides an overview of set theory, defining sets as collections of well-defined objects and introducing standard notations for various types of numbers. It explains different methods of representing sets, including roster and set-builder forms, and classifies sets into categories such as null sets, singleton sets, finite sets, infinite sets, equal sets, and equivalent sets. Additionally, it emphasizes the concept of order or cardinality of sets and includes examples for clarity.

Uploaded by

sandhya.mamudala
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views20 pages

Set Theory and Classification of Sets

The document provides an overview of set theory, defining sets as collections of well-defined objects and introducing standard notations for various types of numbers. It explains different methods of representing sets, including roster and set-builder forms, and classifies sets into categories such as null sets, singleton sets, finite sets, infinite sets, equal sets, and equivalent sets. Additionally, it emphasizes the concept of order or cardinality of sets and includes examples for clarity.

Uploaded by

sandhya.mamudala
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Functions

Set Theory &


Classification
of Sets
Set Theory

The collection of well-defined things/objects is called set. A set is


represented by capital alphabets like A, B, P, Q etc.
Example

(i) A = { x : x is a prime number} means A =

, , , , , .....

(ii) W = { x : x is a whole number } means W =

, , , , , .....
Some Standard Notations

N the set of natural numbers

W the set of whole numbers

Z or I the set of integers

Z+ the set of positive integers

Z− the set of negative integers

Q the set of rational numbers


Some Standard Notations

R the set of real numbers

C the set of complex numbers

∈ belongs to

∈ does not belong to

 There exists

 There does not exist.


Number System

Complete development of the number system can be


summarised as
𝐂

𝐖
𝐍

𝐐 𝐙
Representation of Sets

Roster Method
Set Builder Form
(Tabular form)
Representation of Sets

Roster Method
Set Builder Form
(Tabular form)

In this method, a set is In this case we write down a


described by listing elements property or rule which gives
which are separated by commas us all the element of the
and enclosed them by curly given set.
brackets.
Example

Write the following set in Roster form :


(a) The set of squares of integers.
(b) B = {x : x is a prime number which is a divisor of 60}

Solution

Ans. (a) 𝟎, 𝟏, 𝟒, 𝟗, 𝟏𝟔, …


(b) 𝟐, 𝟑, 𝟓
Example

Write the following set in set -builder form :


𝟏 𝟐 𝟑 𝟒 𝟓 𝟔 𝟕 𝟖 𝟗
(a) A = , , , , , , , ,
𝟐 𝟑 𝟒 𝟓 𝟔 𝟕 𝟖 𝟗 𝟏𝟎

(b) B = {5, 25, 125, 625}

Solution

𝐧
Ans. (a) 𝐱: 𝐱 = ,𝐧 ∈ 𝐍, 𝐧 ≤ 𝟗
𝐧+𝟏
(b) 𝟓𝐧 : 𝐧 ∈ 𝐍, 𝟏 ≤ 𝐧 ≤ 𝟒
Classification of Sets

Null set or Empty set :

A set having no element in it is called an Empty set or a null


set or void set ,it is denoted by Ø or { }.

Example

A = {x ∈ N : 5 < x < 6} = Ø
Singleton set:

A set consisting of a single element is called a singleton set.

Example

A = {8}, is a singleton set.


Finite set:

A set which has finite number of elements is called a finite set.

Example

A = {a, b, c}
Order of a finite set:
The number of elements in a finite set is called the order of
the set A and is denoted O(A) or n(A). It is also called
cardinal number of the set.

Example

A = {a, b, c, d} ⇒ n(A) = 4
Infinite set:
A set which has an infinite number of elements is called an
infinite set.

Example

A = {1, 2, 3, 4, ....} is an infinite set.


Equal sets:
Two sets A and B are said to be equal if every element of A is
a member of B, and every element of B is a member of A.
If sets A and B are equal, we write A = B and A and B are not
equal then A ≠ B.

Example

A = {1, 2, 6, 7} and B = {6, 1, 2, 7}, So, A = B


Equivalent sets:
Two finite sets A and B are equivalent if their number of
elements are same i.e. n(A) = n(B).

Example

A = {1, 3, 5, 7}, B = {a, b, c, d}

n(A) = 4 and n(B) = 4 . So, n(A) = n(B)

Note

Equal set always equivalent but equivalent sets may not be equal.
Subsets:
Homework

DPP-1 : Q 3 & Q 6

CYL-1 : Q 8 & Q 13

You might also like