SET

■Sets was formally introduced

in
1879 by Georg Cantor.

■By definition, a SET is an

unordered collection of
objects, called elements or
members of the set.
■We write a ∈ A to denote that a
is an element of the set A. The
notation a ∉ A denotes that a
is not an element of the set A.

■Sets are usually to be denoted

using uppercase letters.
 CLASSIFICATIONS OF
SETS
■FINITE SETS

■INFINITE SETS
FINITE SETS
- elements can be enumerated or
counted.
A= 𝟏, 𝟐, 𝟑, 𝟒, 𝟓
S=𝒕𝒉𝒆 𝒏𝒖𝒎𝒃𝒆𝒓 𝒐𝒇 𝒔𝒉𝒐𝒑𝒑𝒊𝒏𝒈
𝒎𝒂𝒍𝒍𝒔 𝒊𝒏𝑶𝒓𝒎𝒐𝒄 𝑪𝒊𝒕𝒚
INFINITE SETS
- elements are uncountable.
B= 𝟏, 𝟐, 𝟑, …
S=𝒕𝒉𝒆 𝒔𝒆𝒕𝒐𝒇 𝒂𝒍𝒑𝒐𝒔𝒊𝒕𝒗𝒆 𝒊𝒏𝒕𝒆𝒈𝒆𝒓𝒔

The symbol to represent an infinite sets

is an ellipses, “…”.
■ Determine whether each of these sets is finite
or infinite.

1. Negative integers

2. Even Integers greater than 50

3. Positive integers less than 1000

4. Odd integers less than 50

 SET C A R D I N A L I T Y
■ The number of elements in a finite set A is
termed as the cardinality of set A, denoted
by |A|.
■ The term cardinality comes from the common
usage of the term cardinal number as the
size of a finite set.
■ Example:

Let A be the set of odd positive integers less than 10.Then,

|A| = 5.

Let S be the set of letters in the English alphabet. Then,

|S| = 26.

Let A = {1, 2, 3}, then |A| = 3.

Because the null set has no elements, it follows that |∅| = 0.

SET NOTATIONS:
ℕ = the set of natural numbers.
ℚ = the set of rational numbers.
ℝ = the set of all real numbers.
ℤ = the set of all integers.
W= the set of all whole
numbers.
C= the set of all complex
SET REPRESENTATION
■ ROSTER METHOD

■ DESCRIPTIVE FORM

■ SET BUILDER NOTATION

ROSTER M E T H O D
■ Listing all the elements of a set, separated by
commas and enclosed within braces [ ] or
brackets { }.

V = {a, e, i, o, u}

O = {1, 3, 5, 7, 9}
 DESCRIPTIVE FORM
■ Stating in words the elements of a set.

V = set of all vowels in the English alphabet

O = set of odd positive integers less than 10

B = set of positive even integers less or equal to 50.

Write the given Descriptive form to Roster form:

a. X= all positive integer less than 20 but greater than 16

b. C= all square of integers less than 50

c. D= even integer less than 40 and x can be factored by 3

d. V= an odd integer less than 30 and x is a prime number

 SET
BUILDER
■All elementsNOTATION
in the set are characterized by
stating the property or properties they must
have to be members.
 SET B U I L D E R NOTATION
For instance,
The set O of all odd positive integers less than
10 can be written as:

O = {x | x is an odd positive integer less than

10} or
O = {x ∈ 𝐙+ | x is odd and x < 10}.
INTERVAL NOTATION/ SET NOTATION
When a and b are real numbers, we write

– [a, b] = {x | a ≤ x ≤ b}
– [a, b) = {x | a ≤ x < b}
– (a, b] = {x |a < x ≤ b}
– (a, b) = {x |a < x < b}
Represent the given below using Set Builder Form.
a. All negative integers greater than equal to -4

b. All integers greater than -3 but less than 5

c. Real number less than equal to -1 but greater than -6

SET EQUALITY
■ Two sets are equal if and only if they have the same
elements.

■ Therefore, if A and B are sets, then A and B are equal

if and only if (x ∈ A ↔ x ∈ B).

■ We write A = B if A and B are equal sets.

■ Example:

A = {1, 2, 3, 6}

C = {3, 1, 6, 2}

D = {1, 2, 2, 3, 6, 6, 6}
A, C, and D are all equal sets.
■ Note that the order in which the elements
of a set are listed does not matter.

■ Note also that it does not matter if an

element of a set is listed more than once,
so
{1, 2, 2, 3, 6, 6, 6} is the same as the set {3, 1,
6, 2} because they have the same elements.
N u l l set
■ A special set that has no elements. This set is
called the empty set, or null set, and is
denoted by ∅.

■ The empty set can also be denoted by { }.

■ Example:

B = {x | 𝒙𝟐 = 4, x is odd number}
= ∅
There is no existing odd number whose square is 4.

Z+ = {x | x < 0 }= ∅
There is no existing positive integer whose value is less than 0
■ A set with one element is called a
singleton set.
■ The set {∅} is a singleton set.

■ The set {∅} is different from a set

∅.
SUBSET
■ The set A is a subset of B if and only
if
every element of A is also an element of B.
■ We use the notation A ⊆ B to
indicate that A is a subset of the set B.

■ When A ⊆ B , B is called the superset of A.

 PROPER SUBSET
■ Let A and B be sets. A is a proper subset
of B. If, and only if, every element of A
is in B but there is at least one element
of B that is not in A, it is denoted as A ⊂
B.
■ Let 𝑨= ℤ+,
𝑩 = 𝒏 ∈ ℤ 𝟎 ≤ 𝒏 ≤ 𝟏𝟎𝟎 ,
𝐶= 100, 200, 300, 400, 500 .
Evaluate the truth value and falsity of the
following.
1. 𝐵 ⊆ 𝐴
2. C ⊂ A
3. C and B have at least one element in
common.
4. 𝐶 ⊆ 𝐵
5. 𝐶 ⊆ 𝐶
Universal Set
■ The set of all elements under consideration is
called the Universal Set.

■ The Universal Set is usually denoted by U and

is represented by a rectangle.

U
Venn diagrams are often used to indicate the
relationships between sets.

The Universal Set is represented by the

interior of a rectangle, and the other sets are
represented by circle within the rectangle.
Draw a Venn Diagram that represents V, the set of
vowels in the English Alphabet.

U
m, n, V
p j, k, l
a, e, i, o, b, c, d
q, r, s u
f, g,
t, v, w h
x, y, z
■𝐴
⊆𝐵
U

B
A
■𝐴
⊆𝐵
U

A
B
 TRY!
■!Suppose that
A = {2, 4, 6}, B = {2, 6},
C = {4, 6}, D = {4, 6, 8}.

Use a Venn diagram to illustrate

the relationship between the sets.
 OPERATION OF
SETS
■ Two or more sets can be combined together.
■ For example, the different strands in grade 11 belong to
different sets. Say,
set A = all ACLC ACT Students.
set B = all ACLC BSIT
students,

But all these students are taking the subject “Mathematics in

the Modern World, so we can combined all these sets and
can make another set.
Set C= all ACLC students taking Mathematics in the Modern World.
UNION OF
SETS
■ Let A and B be sets. The union of the sets A and B, denoted by
A
∪orB,
in is
B,the
or in both.
set that contains those elements that are either in A
■ A ∪ B = {x | x ∈ A and x ∈ U
B}.
■ Example: A B
■ The union of the sets
{1, 3, 5} and {1, 2, 3}
{1, 3, 5} ∪ {1, 2, 3} = {1, 2, 3,
5}.
INTERSECTION OF
SETS
■ Let A and B be sets. The intersection of the sets A and
B, denoted by A ∩ B, is the set containing those
both A andinB.
elements
■ A ∩ B = {x | x ∈ A or x ∈ U
■ B}.
Example:
■ The intersection of the sets A B
{1, 3, 5} and {1, 2, 3}
{1, 3, 5} ∩ {1, 2, 3} = {1,
3}.
DIFFERENCE OF
■ Let A and B be sets. The difference of A and B, denoted by A
SETS −
B, is the set containing those elements that are in A but not in
B. The difference of A and B is also called the complement of B
with respect to A.
■ A − B = {x | x ∈ A or x ∉ B}.
■ Example:
The difference of {1, 3, 5} and {1, 2, 3}
{1, 3, 5} − {1, 2, 3} = {5}.
The difference of {1, 2, 3} and {1, 3,
5}, which is the set {2}.
DISJOINT
SETS
■ Two sets are called disjoint if their intersection
is the empty set.
■ Let A = {1, 3, 5, 7, 9} and B = {2, 4, 6, 8, 10}.
Because A ∩ B = ∅,
A and B are disjoint.
 COMPLIMENT OF
■SET
Let U be the universal set. The complement of the set
A, denoted by 𝐴, is the complement of A with respect
to U. Therefore, the complement of the set A is U − A.
■ 𝐴 = {x ∈ U | x ∉ A}.

■ Let U= the letter in the English alphabet,

■ Let A = {a, e, i, o,
u} Then
■ 𝐴 = {b, c, d, f, g, h,
j, k, l,m, n, p, q, r,
s, t, v,w, x, y, z}.
SYMMETRIC DIFFERENCE OF
SETS
■ The symmetric difference of A and D, denoted by AΔ B or A⨁B, is the set
of all elements that are in either A or B but not both, or also called the
union of the difference of A and B and B and A.
■ AΔ B= 𝑥 ∈ 𝑈 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥∉ 𝐵 ∪ 𝑥 ∈ 𝑈 𝑥 ∈ 𝐵 𝑎𝑛𝑑 𝑥∉ 𝐴
■ Let
U = {a, b, c, d, e, f,
g} A = {a, c, e, g}
B = {d, e, f,
g} Then
A𝜟 B = {a,
c, d, f}
■ Let A = {1, 2, 3, 4, 5} and B = {0, 3, 6}. Find
a) A ∪ B.
b) A ∩ B.
c) A − B.
d) B − A.
■ Let A = {a, b, c, d, e} and B = {a, b, c, d, e, f, g, h}.
Find
a) A ∪ B.
b) A ∩ B.
c) A − B.
d) B − A.
Find the symmetric difference of {1, 3, 5} and {1, 2, 3}.
 CARTESIAN
PRODUCTS
■ Let A and B be sets. The Cartesian product of A and
B, denoted by A × B, is the set of all ordered pairs (a,
b), where a ∈ A and b ∈ B. Hence,

A × B = {(a, b) | a ∈ A and b ∈ B}.

■Given: A = {1, 2} and B = {a, b,
c} Find A x B and B x A.

A × B = {(1, a), (1, b), (1, c), (2, a),

(2, b), (2, c)}
B × A = {(a, 1), (a, 2), (b, 1), (b,
2), (c, 1), (c, 2)}.

Note that the Cartesian products A×B and

B×A are not equal.
■ What is the Cartesian product A × B × C, where A = {0, 1}, B
=
{1, 2}, and C = {0, 1, 2} ?

Solution: The Cartesian product A × B × C consists of all

ordered triples (a, b, c), where a ∈ A, b ∈ B, and c ∈ C.
Hence,

A × B × C = {(0, 1, 0), (0, 1, 1), (0, 1, 2), (0, 2, 0), (0, 2, 1),
(0, 2, 2), (1, 1, 0), (1, 1, 1), (1, 1, 2), (1, 2, 0),
(1, 2, 1), (1, 2, 2)}.