Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 11

BASIC SET

THEORY
SET THEORY
Set theory is branch of mathematics that deals with the
properties of well-defined collections of objects -may or may
not be of a mathematical nature, such as numbers or functions.
The theory is less valuable in direct application to ordinary
experience than as a basis for precise and adaptable
terminology for the definition of complex and sophisticated
mathematical concepts.
In Mathematics, a SET is a term that describes
the collection of distinct objects or items that have
something in common. A set is “WELL-
DEFINED” collection of distinct objects. The
individual objects in a set are called MEMBERS
or ELEMENTS.
It means that it must be
Well-defined absolutely clear that which
object belongs to the set and
which does not.
Tell whether or not the given collection is well-defined.
1. A collection of beautiful women
The collection is not well- defined

2. A collection of Harry Potter Books


The collection is well- defined
Between the years 1874 and 1897, the German
mathematician and logician Georg Cantor created a
theory of abstract sets of entities and made it into a
mathematical discipline. This theory grew out of his
investigations of some concrete problems regarding
certain types of infinite sets of real numbers. A set,
wrote Cantor, is a collection of definite, distinguishable
objects of perception or thought conceived as a whole.
The objects are called elements or members of the set.
• A set is a structure, representing an unordered collection (group,
plurality) of zero or more distinct (different) objects.
• Set theory deals with operations between, relations among, and
statements about sets.

Basic notations for sets


Basic notations for sets
• For sets, we’ll use variables S, T, U, …
• We can denote a set S in writing by listing all of its elements
in curly braces:
– {a, b, c} is the set of whatever 3 objects are denoted by a, b, c.
• Set builder notation: For any proposition P(x) over any
universe of discourse, {x|P(x)} is the set of all x such that
P(x).
e.g., {x | x is an integer where x>0 and x<5 }
Definition of Set Equality
• Two sets are declared to be equal if and only if they contain
exactly the same elements.
• In particular, it does not matter how the set is defined or
denoted.
• For example: The set {1, 2, 3, 4} =
{x | x is an integer where x>0 and x<5 } =
{x | x is a positive integer whose square
is >0 and <25}
Infinite Sets
• Conceptually, sets may be infinite (i.e., not finite, without
end, unending).
• Symbols for some special infinite sets:
N = {0, 1, 2, …} The natural numbers.
Z = {…, -2, -1, 0, 1, 2, …} The integers.
R = The “real” numbers
• Infinite sets come in different sizes!
Ways of Describing Sets

• List the elements

A= 1,2,3,4,5,6
Give a verbal description
“A is the set of all integers from 1 to 6,
inclusive”
Give a mathematical inclusion rule

A= Integers x 1  x  6

You might also like