BULACAN STATE UNIVERSITY

COLLEGE OF SCIENCE

MMW 101
MATHEMATICS IN THE MODERN WORLD

Module 6
The Language of Sets
“Achieving Universal Understanding and
Peace Through the Language of
Mathematics”
 The Language of Sets

Objectives of the Module

At the end of the module, you should be able to:

1. Discuss what a set is in mathematics
2. Identify the different set of symbols and notations
3. Write sets using two methods
4. Differentiate the kinds of sets
5. Show the union and intersection of sets

Sets become a powerful building block of mathematics when applied to different

situations. Some of the higher mathematics disciplines whose common denominator
is set are the following: Graph Theory, Abstract Algebra, Real Analysis, Complex
Analysis, Linear Algebra, Number Theory.

Set and Set Notations

The idea of a set in Mathematics is not different from how we think of it in

everyday living. Words such as collection, group, batch, class, and bundle all convey
the idea of a set.
However, mathematically speaking, a set is a collection of distinct objects. The
objects must be well-defined, which means that we can tell whether any given object
is or is not in the set. Distinct means no duplication of the object in the set (it is listed
only once).

Consider these examples to distinguish well-defined sets.

Well -defined Sets Not Well-defined Sets (listing of

elements are not clear)
1. The set of female presidents 1. The set of good Filipino writers.
of the Philippines.
2. The set of quadrilaterals. 2. The set of best books in the
library.
3. The set of rainbow colors. 3. The set of difficult subjects in
SHS.
4. The set of even numbers 4. The set of delicious smoothies.
less than 80.
5. The set of ASEAN Member 5. The set of smart people in the
countries. meeting.

In writing sets, you need to follow these rules:

1. Name the set in capital letters of the English alphabet (A, B, C, …, X, Y, Z).
2. The objects in the set are known as elements. We write them in lower case
letters (a, b, c, …, x, y, z).
3. The elements are written in braces { }.

1
 For example, Set A has as its elements the letters in the word freshmen. Writing
the set, we have A = {𝑓, 𝑟, 𝑒, 𝑠, ℎ, 𝑚, 𝑛}.

Note: The letter 𝑒 must be written only once.

Another thing, if an object is an element of the set, use the symbol ∈.

In the above example, 𝑓 is an element of set A or 𝑓 is a member of set A or

𝑓 is in A, or 𝑓 belongs to A. We write𝑓 ∈ 𝐴 .

On the other hand, if an object is not an element of the set, we use the symbol
∉ as in 𝑎 is not an element of set A, 𝑎 ∉ 𝐴.
Before moving further, to help you understand some concepts/examples in this
lesson, a review of the set of real numbers is given in the table that follows.

The Set of Real Numbers

Symbol Name Description Examples

Natural Counting numbers (also called

N 1, 2, 3, . . .
Numbers positive integers)

Naturals numbers, their …-4, -3, -2, -1, 0, 1, 2,

Z Integers
negatives and 0 3, 4, ...

Numbers that can be

-15, -2, 0, 23,
represented as a/b, where a
Rational -1/4, 3/7, 15/2,
Q and b are integers and b ≠
Numbers -2.75, 1.625,
0.The decimal representations
-0.3333, 5.272727
are terminating or repeating
Numbers that can be
Irrational √2 = 1.414213562 … ,
Q' represented as non-repeating
Numbers 𝜋 = 3.141592654 …
and non-terminating decimals

Real
R Rational and Irrational
Numbers

Methods of Writing a Set

Enumeration or Roster Method Defining or Rule Method

• The elements of a set are • The members of the set are
listed or enumerated in any defined by stating their
order but no repetition and common properties. The set-
enclosed by curly braces. builder notation of
{𝑥 |𝑃(𝑥)} 𝑜𝑟 {𝑥: 𝑃(𝑥)} is used
and is read as "the set of all 𝑥
such that"

2
Here are some examples for you.

Enumeration or Statement Rule Method

Roster Method
B = {11, 13, 17, 19, 23, B is the set of all prime B = {xIx is a prime
29} numbers between 10 and number between 10 and
30. 30}
D = {e,i} D is the set of vowels in D = {xIx is a vowel in the
the word little. word little}
E = {c, d, n, y} Set E is the set of E = {xIx is a consonant in
consonants in the word the word decency}
decency.
N = {1, 2, 3, . . .} N is the set of Natural N = {xIx is a natural
numbers. number}
R = {22,24, 26, 28, 30, R is the set of positive R = {xIx is a positive even
32, 34, 36, 38} even numbers greater number greater than
than 20 but less than 40. 20 but less than 40}
M = {0, 2, 4, 6, …, 22} M is the set of whole M = {xIx is a whole
numbers less than 21. number less than 21}
O = {-15, -10, -5, 0, 5, O is the set of multiples O = {xIx is a multiple of 5
10} of 5 greater than -20 but greater than -20 but
less than positive 15. less than positive 15
S = {13, 14, 15, …} S is the set of natural S = {xIx is a natural
numbers greater than 12. number greater than 12

Kinds of Sets

These are simple descriptions and examples to help you distinguish one kind
of set from another.
Kind of Set Definition / Notation Examples
A = {x | x is a positive
integer less than 17}
• A set whose elements
A = {1,2,3,…,16}
are limited or countable
n(A) = 16
• The cardinality of a set is
1. Finite Set
the number of its
B = {x | x is an odd integer
elements. The cardinality
between 50 and 60}
of set A is denoted by
B = {51,53,55,57,59}
n(A).
n(B) = 5
W = {0, 1, 2, 3, ...}
• A set whose elements
n(W) = ∞
are unlimited or cannot
2. Infinite Set
be counted
D = {x | x is a negative odd
integer}

3
 Note: the infinity of the set D = { -1, -3, -5, . . .}
is denoted by three dots (...)
called an ellipsis and is read E = {x | x is a proper
"and so forth." fraction}
E = {1/2, -3/4, 5/7, . . .}
F = {x | x is an integer
greater than 10 but
less than 12}
3. Unit Set F = { 11 }
• A set with only one
or n(F) = 1
element
Singleton Set
G = {x l x is the vowel in
the word day}
G={a}
H = { x I x is an integer
greater than -1 but
• A set with no object or less than 0}
element. H = { } or H = ∅
4. Empty Set
n(H) = 0
or
• The symbols "{ }" and
Null set
"∅" are used to denote I = {x l x is a counting
an empty set. number between 45
and 46}
I = { } or I = ∅
Let A = {l3, 14, 15, 16}
• Two sets containing the
B = {14, 15}
same elements are
C = { integers
equal.
between 13 and 16}
• Symbolically, A = B.
D = { natural numbers
5. Equal Sets greater than 12 but
less than 17}.
• The symbol "≠" is used
Then, A = D and B = C
to denote that two sets
are not equal.
and A ≠ B, A ≠ C, B ≠ D
• If Sets A and B have the
same number of
elements or the same
cardinality, then they are Let A = {11,12, 13}
equivalent sets. B = {x, y, z}
C = {𝜆, 𝛽, 𝛼}
6. Equivalent
• They may have different
Sets
elements or some
common elements only. Then A ≈ B, A ≈ C, and
B ≈ C.
• The symbol for set
equivalence is ≈.

4
 • Two sets with no
common elements are Let R = {2, 4, 6},
disjoint. S = {11, 13, 15}
7. Disjoint
Sets
• Note: The empty set is Then, R and S are disjoint.
or
non- intersection from
non-
any set and from itself The set of whole numbers
intersection
since it has no element and the set of negative
common with the numbers are disjoint.
elements of the sets.

Subsets, Supersets, and Power Sets

• A is a subset of B denoted
by A ⊆ B if every element Consider the sets:
of A is contained in B. J = {5, 6, 7}
K = [8,7, 6, 5}
A is a subset of B if every L = {5, 6, 7, 8, 9}
element of A is in B. The
phrases "A is contained in then, we can say that
B" and "B contains A" are J⊆K, J ⊆ L, and K ⊆ L.
other ways of saying that A
is a subset of B.
Subsets Given: M = {7, 8, 9}
Symbolically, A ⊆ B. c(M) = 3

The number of subsets of a 2n

given set with "n" elements 23 = 8 subsets
can be computed using the
formula 2n. Subsets of M are:
{7}, {8}, {9},
Note: Every set is a subset {7, 8}, {7, 9}, {8, 9},
of itself. {7, 8, 9}, ∅
The empty set is a subset
of every set.
If every element of A is in Consider the sets:
B, but there is at least one J = {7, 6, 5}
element in B that is not in K = {8,7, 6, 5}
A, then A is a proper L = {9, 8, 7, 6, 5}
subset of B.
then, we can say that
In symbols, we have A ⊂B. J ⊂ K, J ⊂ L, and K ⊂ L.
Proper Subset
If a set has "n "elements, Given: J = {5, 6, 7}
the number of proper
subsets can be verified For number of proper
using subsets of J:
2n – 1. 2n - 1
23- 1 = 8 - 1 = 7

5
 Proper subset of J are:
{5}, {6}, {7},
Note: Every set is not a {5, 6}, {5, 7}, {6, 7},
proper subset of itself. ∅
A null set is a proper subset
of every set.

Consider the sets:

J = {2, 4, 6}
• If A is a subset of B, then
K = {2, 4, 6, 8}
we can say that B is a
Superset L = {2, 4, 6, 8, 10}
superset of A, denoted by
B ⊇ A.
Then, we can say that
K ⊇ J, L ⊇ J, and L ⊇ K.

• The set of all subsets of a

set A is called the power Let N = { q, r, s }
set of A, denoted as P(A). n(N) = 3

Power Sets • The cardinality (or the |P(N)| = 23 = 8

number of elements) in the
power set of A can be P(N) = [∅, {q}, {r}, {s},
verified by the formula {q, r}, {q, s}, {r, s},
|P(A)| = 𝟐𝒏 . {q, r, s} ]

Universal Set and Complementary Sets

Let A = {a, c, e, g}
B = {b, d, f}
• The set containing all the
C = {a, d, g, h}
Universal Set possible elements under
consideration
Then, U = {a, b, c, d, e,
f, g, h}
Let U = {10, 11, 12, 13,
14, 15, 16, 17}
• Sets A and B are
A = {10, 12, 14}
complementary if they have
B = {11, 13, 15, 17}
no common elements, and
C = {10, 12, 13,14,
Complementary their union is the universal
16}
Sets set.
Then, Ac = {11, 13, 14,
• In symbol, the complement
15, 16, 17}
of A is 𝐀𝐜 .
Bc = {10, 12, 14, 16 }
Cc = {11, 15, 17}

6
Union and Intersection of Sets

Operations of Sets

The union of two sets A and Let A = {1, 3, 5}

B is the set containing all the B = {1, 5, 8, 10}
elements of both sets. C = (3, 6, 12, 14}
Union D={ }
In symbols, we write A ∪ B.
A U B = {1, 3, 5, 8, 10}
B U C ={1,3,5,6,8,10,12,14}
C U D = {3, 6, 12, 14}
The intersection of two sets A Let A = {1, 3, 5}
and B is the set containing B = {1, 5, 8, 10}
the common elements of both C = (3, 6, 12, 14}
Intersection sets. D={ }

In symbols, we write A ∩ B. A ∩ B = {1, 5}

B ∩ C = { } or ∅
C ∩ D = { } or ∅
Let U = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 }
A = {1, 3, 5}
B = {1, 5, 8, 10}
C = (3, 6, 12, 14}
D={ }

Examples:
Combinations (A U B) ∩ C = {1, 3, 5, 8, 10} ∩ (3, 6, 12, 14}
={3}

(A ∩ C) U B = { 3 } U {1, 5, 8, 10}
= {1, 3, 5, 8, 10}

A U B U C = {1, 3, 5, 6, 8, 10, 12, 14}

A ∩B∩C={ }

(A U B) ∩ (C U D) = {1, 3, 5, 8, 10} ∩ {3, 6, 12, 14}

={3}
(A ∩ B) U (C ∩ D) = {1, 5} U { }
= {1, 5}

(A U D) ∩ (B ∩C) = {1, 3, 5} ∩ { }
= {1, 3, 5}

Ac ∩ Bc = {2,4,6,7,8,9,10,11,12,13,14}∩
{2,3,4,6,7,9,11,12,13,14}
= {2, 4, 6, 7, 9, 11, 12, 13, 14 }

Bc ∩ Cc = {2,3,4,6,7,9,11,12,13,14}∩ {1,2,4,5,7,8,9,10,11,13}
= { 2, 4, 7, 9, 11, 13}
7
Product Sets

Let A = {5, 7, 9},

B = {r, s, t}

Find: A x B
• The product set of two non-
empty sets A and B is the
Solution:
set of all ordered pairs
(a, b). The first element a is
A x B = {(5, r), (5, s),
from set A, and the second
(5, t), (7, r),
element b is from set B.
(7, s), (7, t),
|
Product Sets (9, r), (9, s),
(9, t)}
Note: The symbol "x" is used for
the operation.
Find: B x A
Read A x B as A cross B.
Solution:
B x A = {(r, 5), (r, 7),
AxB≠BxA
(r, 9), (s, 5),
(s, 7), (s, 9),
(t, 5), (t, 7),
(t, 9)}