Module 3 Lesson 3
Module 3 Lesson 3
Module 3 Lesson 3
1. Set
- A collection of well-defined objects that contains no duplicates.
- The objects in the set are called the elements of the set.
- To describe a set, we use braces { }, capital letters as A, B, C to represent the
set, and lower case letters as a, b, c to denote elements of the set.
Examples of a set: The set of students in University of La Salette.
The set of natural numbers N = {1, 2, 3, 4, …}
- The three dots in enumerating the elements of the set are called ellipsis and
indicate a continuing pattern or there are elements in the set that have not been
written down.
- To indicate that an object is an element of a set, we use the symbol ∈.
Example: Given the set of natural numbers N = {1, 2, 3, 4, …}
1 ∈ 𝑁 (Read as 1is an element of N)
b. List Notation/Roster Method – by listing each element of the set inside the
braces {}
Example: A = {1, 2, 3, 4}
B = {p, h, i, l, n, e, s}
c. Set Builder Notation – a method that lists the rules that determine whether
an object is an element of the set rather than the actual elements
THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION,
UPLOADING, OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS
STRICTLY PROHIBITED.
1
B = { x ׀x is a letter in the word “Philippines”}
Types of Set
a. A finite set contains elements that can be counted and terminates at certain
natural number, otherwise it is infinite set.
b. A set with only one element is called a singleton or a singleton set.
c. A set with no elements or has no members is called empty set, or null set ∅
or { }.
d. Equal sets are sets that contain exactly the same elements.
e. Equivalent sets are sets that contain the same number of elements.
2. Relation
- A rule that pairs each element in one set, called the domain, with one or more
elements from a second set called the range.
- It creates a set of ordered pairs (x, y)
3. Function
- A rule that pairs each element in one set, called the domain, with exactly one
element from a second set called the range. For every first element of x, there
corresponds a unique second element y.
Example: In X = {1, 2, 3} and Y = {4, 5, 6}, when each element of set X is
paired to exactly one in set Y, they will form a function. It will create a set of
ordered pairs
{(1, 4), (2, 5), (3, 6)} or {(1, 4), (2, 4), (3, 4)}
Functions can be represented using the following:
THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION,
UPLOADING, OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS
STRICTLY PROHIBITED.
2
a. Table
X 1 2 3
Y 4 5 6
The set {1, 2, 3} is the domain and the set {4, 5, 6} is the range
b. Ordered Pairs
c. Graph
Figure 1 Figure 2
(3, 6)
(2, 5) (2, 4)
(3, 4)
(1, 4) (1, 4)
Function Function
Figure 3 (1, 6)
(1, 5)
(1, 4)
Not a function
THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION,
UPLOADING, OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS
STRICTLY PROHIBITED.
3
- A binary operation on a set is a combination of two elements of the set to
produce another element of the set
- Common notation for binary operations on set is the infix notation S1 * S2 ∈ S
- * can be any of the following common operations: + −×÷
- Aside from the common operations+ −×÷, we can define other binary
operations such as a*b = 3a+ b or a*b = ab.
THIS MODULE IS FOR THE EXCLUSIVE USE OF THE UNIVERSITY OF LA SALETTE, INC. ANY FORM OF REPRODUCTION, DISTRIBUTION,
UPLOADING, OR POSTING ONLINE IN ANY FORM OR BY ANY MEANS WITHOUT THE WRITTEN PERMISSION OF THE UNIVERSITY IS
STRICTLY PROHIBITED.
4