GENSANTOS
FOUNDATION COLLEGE, INC.
SELF-LEARNING
MODULES
Prelim
Midterm
Semi-Final
Final
NAME : ______________________
SUBJECT: ______________________
SECTION: ______________________
SEMESTER: ________ DATE: ______
COURSE & YEAR: ________________
INSTRUCTOR: __________________
GENSANTOS FOUNDATION COLLEGE, INC.
Bulaong Extension, General Santos City
College Department
Mathematics in the Modern World
Quarter: Prelim Date: September 12-13, 2020
Teacher: Cyrus John A. Calaque Week No.: 2
Topic: Set Theory
Learning Targets:
After completing the week 3 module, the students will be able to:
1. Identify and discuss the basic concepts in mathematical language.
2. Perform operations on mathematical correctly.
References/Materials:
Merlita Castillo Medallon, Ed.D and Felix M. Calubaqub, Ph. D (2018). Mathematics in the
Modern World
Winston S. Sirug, Ph.D (2018). Mathematics in the Modern World
III. Introduction/Review/Content:
Set theory is the branch of mathematics that studies sets of the mathematical science of the infinite. A set
is a well-defined collection of objects; the objects are called the elements or members of the set. The symbol
∈ is used to denote that an object is an element of a set, and the symbol ∉ denotes that an object is not an
element of a set.
Sets Representation
1. Rooster method is when elements
of the set are enumerated and
separated by comma, it is also called
tabulation method.
2. Rule method is used to describe the
elements or members of the set, it is
also called set builder notation,
symbol written as {x|x P(x)}.
A finite set is a set whose elements are limited or countable, and the last element can be identified. On
the contrary, an infinite set is a set whose elements are unlimited or countable, and the last element cannot
be specified.
Some examples of finite sets are A = {x|x is a positive integer less than 10} and C = {d, i, r, t}; while
examples of infinite sets are F = {..., -2, -1, 0, 1, 2, ...}.
A unit set is a set with only one element, it is also called singleton. On contrary, the unique set with no
elements is called the empty set (or null set) it is denoted by the symbol ∅ or { }. In addition, all sets under
investigation in any application of set theory are assumed to be contained in some large fixed set called the
universal set, denoted by the symbol U.
Examples of unit set is I = {x|x is a whole number greater than 1 but less than 3} and J = {w}; and
examples of empty set are L = {x|x is an integer less than 2 but greater than 1} since there is no integer
between 1 and 2. In addition, example of universal set are U = {x|x is a positive integer, x 2=4 }; U = {1, 2,
3, ... , 100}.
The cardinal number of a set is the number of elements or members in the set, cardinality of a set A is
denoted by n(A). For example, given set E = {a, e, €, o, u}, the cardinal number of E is 5 or n€ = 5.
If A and B are sets, A is called subset of B, written A ⊆ B, if an only if, every element of A is also an
element of B. A is a proper subset of B, written A ⊂ 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. On contrary, the symbol ⊄ denotes that it is not a proper subset. A
equals B, written, A=B if and only if, every element of A is in B and every element of B is in A.
Example 2: Supposed A = {c, d, e}, B = {a, b, c, d, e}, and U = {a, b, c, d, e, f, g}, then A ⊆ B, since all
elements of A is in B.
Example 3: Supposed A = {c, d, e}, B = {a, b, c, d, e}, and U = {a, b, c, d, e, f, g}, then A and C are both
subsets of B; but A ⊂ B, whereas C ⊄ B. It can also be observed that only A is a proper subset of B and not
C because B and C are with the same elements (notice) that set A is inside sets B and C.
Example 4: Supposed A = {c, d, e}, B = {a, b, c, d, e}, and U = {a, b, c, d, e, f, g}, then A ⊆ B and B ⊆ A,
therefore A = B. It can be noted that all elements of A are also elements of B (notice that set A is also set B).
Basic Operations on Sets
The operations on sets are union sets, intersection of sets, complement of a set and difference of two sets.
1. The union of A and B, denoted by A ∪ B, is the set of all elements x in U such that x is in A or x is in
B.
For example: A = {a, b, c}; B = {c, d, e}; and U = {a, b, c, d, e, f, g}
A ∪ B = {a, b, c} ∪ {c, d, e} = {a, b, c, d, e}
2. The intersection of A and B, denoted A∩B, is the set of all elements x in U such that x is in A and x is
in B.
For example: A = {a, b, c}; B = {c, d, e}; and U = {a, b, c, d, e, f, g}
A ∩ B = {a, b, c} ∩ {c, d, e} = {c}
3. The complement of A (or absolute complement of A), denoted A', is the set of all elements x in U
such that x is not in A.
For example: A = {a, b, c}; B = {c, d, e}; and U = {a, b, c, d, e, f, g}
A'= {d, e, f, g} B'={a, b, f, g}
4. The difference of A and B (or relative complement of B with respect to A), denoted A - B, is the set
of elements in x in U such that x is in A and x is not in B.
For example: A = {a, b, c}; B = {c, d, e}; and U = {a, b, c, d, e, f, g}
A - B = {a, b, c} - {c, d, e} = {a, b}
