Department of Mathematics and Physics MATH 1100

2.2 Functions and Relations

A relation 𝑅 is any set of ordered pairs (𝑥, 𝑦).

The set of all 𝑥-components is called the domain while the set of all 𝑦-components is
called the range.

Example:
The set 𝑅 = {(1, 2), (3, 4), (5, 6)} is a relation.
The first components 1, 3, 5 of the ordered pairs are respectively related to the second
components 2, 4, 6. The set {1, 3, 5} is called the domain of the relation while the set
{2, 4, 6} is called its range.

Consider the relation 𝐴 = {(1, 𝑎), (2, 𝑏), (3, 𝑏), (2, 𝑑), (1, 𝑒)}.
What is its domain? How about its range? (Answer5)

A function is a special kind of relation. In a function, every element of the domain is

related with one and only one element of the range . This means that no two distinct
ordered pairs have the same first components.

Illustrations:
1. The relation 𝐵 = {(1,2), (2,3), (3,4), (4,5), (5,6)} is a function.
2. The relation 𝐶 = {(1,2), (𝟐, 𝟑), (4,5), (𝟐, 𝟕)} is not a function.
Ordered pairs (2,3) and (2,7) have the same first components.

Aside from observing functions and relations in sets of ordered pairs, they may also
be described in other ways such as in graphs, and most often in equations that specify
the relationship between two variables 𝑥 and 𝑦.

In equations, functions are exclusively identified with the notation

𝑦 = 𝑓(𝑥).
With this notation, the function is given the name 𝑓; 𝑥 is called the independent
variable (also called argument) and 𝑦 is the dependent variable. The value of 𝑦 depends
upon the value of 𝑥.

5
Domain: {1, 2, 3} ; Range: {𝑎, 𝑏, 𝑑, 𝑒}

12
 Department of Mathematics and Physics MATH 1100

The function 𝑓 may be likened into a machine where if

we input 𝑥 into it, it produces the output 𝑦.

Say, the machine (function 𝑓) is a juice-maker. If we put in a mango, then mango

juice will come out; if we put in a pineapple, then pineapple juice comes out. But if we
put in a stone (not in its domain!), what happens? Functions are similar to the machine.

Now suppose we have two functions 𝑓 and 𝑔 defined by

𝑓(𝑥) = 2𝑥 + 3 and 𝑔(𝑥) = 𝑥 2 – 3𝑥 + 2.

Then, 𝑓(7) means inputting 7 into function f which processes it accordingly as 2(7) + 3
that produces the output 17.

Similarly, 𝑔(−4) means inputting −4 into function 𝑔 which processes it accordingly as

(– 4)2 – 3(– 4) + 2 and produces the output 30.

Depending on how the function is defined (how the machine is designed), inputs
(expressions) are processed accordingly to produce an output.

Example: Consider 𝑓(𝑥) = 3𝑥 2 – 5𝑥 + 2 and 𝑔(𝑥) = 2 – 3𝑥. Find each of the following:
a. 𝑓(2) d. 𝑓(1/2) – 𝑔(2) + 3/2
b. 𝑔(– 3/2) e. 𝑓(3) + 𝑔(2𝑥– 7)
c. 𝑓(– 2) – 𝑔(4/3) f. 𝑓(𝑔(𝑥))
Solutions.
a. 𝑓(2) = 3(2)2 – 5(2) + 2 = 3(4) – 10 + 2 = 4

3 3 9 13
b. 𝑔 (– ) = 2 – 3 (– ) = 2 + =
2 2 2 2

4 4
c. 𝑓 (– 2) − 𝑔 ( ) = [3(– 2)2 – 5(– 2) + 2] − [2 – 3 ( )]
3 3
= [12 + 10 + 2] – [2 – 4]
= 24 – (– 2)
= 26

13
 Department of Mathematics and Physics MATH 1100

1 2 1 2 1 3
d. 𝑓 ( ) – 𝑔(2) + = [3 ( ) – 5 ( ) + 2] – [2 – 3(2)] +
2 3 2 2 2
3 5 3
= [ – + 2] – [2 – 6] +
4 2 2
1 3
= – [– 4] +
4 2
23
=
4

𝑓(3) + 𝑔(2𝑥– 7) = [3(3)2 – 5(3) + 2] + [2 – 3(2𝑥– 7)]

e.
= [14] + [2 – 6𝑥 + 21]
= 37 − 6𝑥

f. 𝑓(𝑔(𝑥 )) = 3[𝑔(𝑥 )]2 – 5[𝑔(𝑥 )] + 2

= 3(2 – 3𝑥 )2 – 5(2 – 3𝑥) + 2
= 3(4 – 12𝑥 + 9𝑥2) – 10 + 15𝑥 + 2
= 27𝑥 2 – 21𝑥 + 4

SUPPLEMENTARY VIDEOS:
For better understanding on operations and compositions of functions, video links are
provided below.

Algebra - Function Operations in Filipino - YouTube

Composition of Functions in Filipino | ALGEBRA | PAANO | COMPOSITE - YouTube

14
 Department of Mathematics and Physics MATH 1100

2.3 Binary Operations

A binary operation on a set is a rule for combining two elements of the set, to produce
another element of the same set. A binary operation ＊ defined on a non-empty set 𝑆 is
a rule that assigns to each ordered pair (𝑎, 𝑏) of elements of 𝑆 a unique element 𝑎＊𝑏 ∈
𝑆.

Illustrations:
1. On the set of natural numbers 𝑁 = {1, 2, 3, 4, 5, . . . }, addition and multiplication
are binary operations because adding or multiplying any two elements of 𝑁
produces an element that also belongs to 𝑁.

2. On the set of natural numbers 𝑁 = {1, 2, 3, 4, 5, . . . }, subtraction and division are

not binary operations. Why? (Answer6)

Properties of a Binary Operation

1. Closure Property
The binary operation ＊ defined on a set 𝐴 is closed on set 𝐴 if and only if
𝒂＊𝒃 ∈ 𝑨 for any 𝒂, 𝒃 ∈ 𝑨.

Example:
The binary operation addition “+” is closed on the set of integers because when we add
any two integers, the result is also an integer.

However, division “/” is not closed on the set of integers because when we divide any
two integers such as 5/3, the result may happen to be not integer.

2. Commutative Property
A binary operation＊ defined on a set A is said to be commutative if
𝒂＊𝒃 = 𝒃＊𝒂 for any 𝒂, 𝒃 ∈ 𝑨.

Example:
The binary operations addition and multiplication are commutative on the set of real
numbers.

Subtraction and division are not commutative because for example,

2– 5 ≠ 5– 2 and 8/4 ≠ 4/8.

6
If you consider two elements in 𝑁, say 1 and 5, 1 − 5 = −4 or 1 ÷ 5 = 1/5 is not an element of 𝑆. So subtraction
and division are not binary operations in 𝑁.

15
 Department of Mathematics and Physics MATH 1100

3. Associative Property
A binary operation ＊ defined on a set 𝐴 is said to be associative if
(𝒂＊𝒃)＊𝒄 = 𝒂＊(𝒃＊𝒄) for any 𝒂, 𝒃, 𝒄 ∈ 𝑨.

Example:
Both addition and multiplication are associative operations on natural numbers.
Subtraction is not an associative operation because for example,
(11 – 18) – 7 ≠ 11 – (18 – 7) .

4. Existence of an Identity Element

If ＊ is a binary operation on 𝐴, an element 𝑚 ∈ 𝐴 is an identity element of 𝐴 with
respect to ＊ if
𝒂 ＊ 𝒎 = 𝒎 ＊ 𝒂 = 𝒂 for any 𝒂 ∈ 𝑨

Example:
In the set of real numbers, the identity element for multiplication is 1 while the identity
element for addition is 0.

5. Existence of an Inverse Element

Let ＊ be a binary operation on 𝐴 with identity 𝑚, and let 𝑎 ∈ 𝐴.
If there exists an element 𝑏 ∈ 𝐴 such that 𝒂＊𝒃 = 𝒃＊𝒂 = 𝒎, then 𝑏 is called the
inverse element of 𝑎.

Note: An inverse may or may not exist for some elements.

Example:
In the set of integers ℤ, every element has an additive inverse.
However, not one of the elements has a multiplicative inverse.

In the set of whole numbers 𝑊 = {0, 1, 2, 3, 4, . . . }, the only element that has an additive
inverse is zero; its inverse is itself.

SAQ: Suppose ＊is defined on the set of integers ℤ by 𝑎＊ 𝑏 = √𝑎𝑏 − 3 . Find

a. 4＊ 3 b. – 3 ＊– 13 c. 0 ＊4 d. Is ＊ a binary operation? Why?
Solutions:
a. 4＊3 = √4(3) − 3 = √12 − 3 = √9 = 3
b. – 3＊– 13 = √(−3)(−13) − 3 = √39 − 3 = √36 = 6
c. 0＊4 = √0(4) − 3 = √−3 = ? , does not exists
d. Item (c) shows that ＊ is not a binary operation.

16
 Department of Mathematics and Physics MATH 1100

2.4 Elementary Logic

Logic is the primary basis of all mathematical reasoning. As such, it is concerned with the
investigation of consequences that hold between the premises and the conclusion of a
sound argument.

An argument is said to be sound (valid, correct) if its conclusions follows from, or is a

consequence of its premises; otherwise it is unsound.

Statements (Propositions)
A statement (or proposition) is the basic building block of logical reasoning. It is a
declarative sentence that is either true or false, but not both. If it is true, its truth value
is said to be T (true); otherwise, it is an F (false).

Illustrations:
1. “10 + 12 = 22” is a statement that is true.
2. “The letter s is a vowel” is a statement that is false.
3. “Samsung creates cellphones” is a statement that is true.
4. “Samsung creates the best cellphones” is not a statement;
it is an opinion that may be true to some people but false to others.
5. “2𝑥 + 5 = 𝑦 − 3” is not a statement;
it is sometimes true and sometimes false.

Statements are commonly represented by small letters; most frequently used are p, q, r,
s, and t.

For example, the statement “It is raining” may be represented by p as in the following:
p: It is raining.

If it is truly raining, its truth value is T; if not, it is F.

Compound Statements

Statements constructed by connecting one or more simpler statements are

called compound statements. The simpler statements are connected together by
using connectives such as “not”, ‘‘and”, “or”, “if…then”, “only if”, and “if and only if”.

17
 Department of Mathematics and Physics MATH 1100

Example:
“Ben donated ₱10,000 and he did not take a bath or attended his class”
is a compound statement that is composed of 3 simpler statements:
p: Ben donated P10000.
q: He did not take a bath.
r: He attended his class.

To determine the truth value of a compound statement, we need to first consider and
examine the way the simpler statements are connected. The resulting compound
statement can be a negation, a conjunction, a disjunction, an implication, a double
implication or any combination of these.

Negation (¬)
The negation of a statement is denial of the statement. To negate a statement, the
symbol ¬ is used. To illustrate,

Statement Negation
p: It is raining. ¬p: It is not raining.

q: The land is wet. ¬q: The land is not wet.

r: Some classmates are upperclassmen. ¬r: No classmates are upperclassmen.

Note:
“Some classmates are not upperclassmen”
is not a negation of r (why?)

s: All CLSU students are optimistic. ¬s: Not all CLSU students are optimistic.
Note:
“All CLSU students are not optimistic.”
is not a negation of s (why?)

The statement “r: Some classmates are upperclassmen.” means that at least one of the
classmate is upperclassman. The negation of the statement should mean that none of
the classmates are upperclassmen.

The statement “s: All CLSU students are optimistic.” means that every CLSU student is
optimistic. The negation of the statement should mean that there is at least one CLSU
student that is not optimistic.

18
 Department of Mathematics and Physics MATH 1100

A negation is true T if and only the statement itself is false F. Similarly, a negation is false
F if and only the statement itself is true T.

Conjunction (∧)
A conjunction consists of 2 or more simpler statements that are connected by the word
“and ”, represented by the symbol ∧. That is, the conjunction p ∧ q represents the
compound statement “p and q”.

Illustration: If p: Janre is a CLSU graduate.

q: Janre is 30 years old.
Then, p ∧ q: Janre is a CLSU graduate and Janre is 31 years old.
p ∧ ¬q: Janre is a CLSU graduate and Janre is not 31 years old.
¬p ∧ q: Janre is not a CLSU graduate and Janre is 31 years old.
¬p ∧ ¬q: Janre is not a CLSU graduate and Janre is not 31 years old

A conjunction of 2 statements p and q is true if and only if both p and q are true.

Disjunction (∨)
A disjunction consists of 2 or more simpler statements that are connected by the word
“or ”, represented by the symbol ∨. That is, the conjunction p ∨ q represents the
compound statement “p or q”.

Illustration: If p: Tom is a BSMath student.

q: Jerry is a BSAgri student.
Then, p ∨ q: Tom is a BSMath student or Jerry is a BSAgri student.
¬p ∨ q: Tom is not a BSMath student or Jerry is a BSAgri student.

A disjunction of 2 statements p and q is true if and only if at least one of p and q is true.

 A popular compound statement, known as De Morgan’s Law, is the equivalent

of negating a conjunction or negating a disjunction. Namely,
i. ¬(p ∧ q) = ¬p ∨ ¬q
ii. ¬ (p ∨ q) = ¬p ∧ ¬q

19
 Department of Mathematics and Physics MATH 1100

Implication (  )
An implication (also called conditional) consists of two cause-and-effect statements. One
is a premise and the other is a consequence that are connected by the words “if…then”.
The symbol  is used. That is, the implication p  q represents the compound
statement “if p then q”. Equivalently, it means

 "p is sufficient for q"

 "q when p"
 "a necessary condition for q is p"
 "q unless not p"
 "q follows from p

Illustration: p: It is raining.
q: The ground is wet.
p  q: If it is raining then the ground is wet.
¬p  q: If it is not raining then the ground is wet.

An implication p  q is considered false only if p is true and q is false.

Sometimes, we are interested in taking the converse, the inverse, or the contrapositive
of an implication p  q. These are defined as

Converse : q  p
Inverse: ¬p  ¬q
Contrapositive: ¬q  ¬p

Example:
Statement: If you are more than 60 years old, then you are entitled to a senior
citizen’s card.
Converse: If you are entitled to a senior citizen’s card, then you are more than 60
years old.
Inverse: If you are not more than 60 years old, then you are not entitled to a
senior citizen’s card.
Contrapositive: If you are not entitled to a senior citizen’s card, then you are not more
than 60 years old.

20
 Department of Mathematics and Physics MATH 1100

Double Implication (  )
A double implication (also called biconditional) is a statement of the form
(p  q)  (q  p),
and is written as p  q.

The double implication p  q is read “p if and only if q” and is frequently abbreviated “p

iff q”. It is a conjunction of the two implications p  q and q  p which are conversely
related; one statement is a necessary and sufficient condition for the other.

Illustration: p: ∆ABC is a right triangle.

q: c2 = a2 + b2 .
p  q: ∆ABC is a right triangle iff c2 = a2 + b2 .
: c2 = a2 + b2 iff ∆ABC is a right triangle.

A biconditional p  q is considered true if and only if p and q are both true or are both
false.

SUMMARY

 The three characteristics of mathematical language are precise, concise and

powerful.
 An expression is just a mathematical phrase; a part of a sentence while sentence
is complete mathematical statement with a complete thought.
 There are two types of sentences; open sentences (mathematical sentence that
is sometimes true or sometimes false) and closed sentence (mathematical
sentence that is definitely true or definitely false).
 A set is collection or grouping of elements which can be written in roster and rule
method.
 The five operations on sets are union, intersection, complement, difference, and
Cartesian product.
 A function is a special kind of relation with 𝑥-components called domain and 𝑦-
components called range.
 A binary operation on a set is a rule for combining two elements of the set, to
produce another element of the same set with the following properties: closure,
commutative, associative, existence of an identity element, and existence of an
inverse element.
 A statement (or proposition) is a declarative sentence that is either true or false,
but not both.

21
 Department of Mathematics and Physics MATH 1100

 Compound statements are simpler statements connected together by using logical

connectives such as “not”, ‘‘and”, “or”, “if…then”, “only if”, and “if and only if”.
 Compound statement can be a negation, a conjunction, a disjunction, an
implication, a double implication or any combination of these.

POST ASSESSMENT:

I. Tell whether the given is an expression or a sentence.

1. 3𝑥 – 4𝑦
2. (Ø, – 5)
3. 4𝑥 – 3 = 5
4. 3𝑥 < 6
2 0
5.  
 1 7

II. Translate the given phrase into a mathematical expression.

1. The sum of twice a number x and another number y.
2. Twice the sum of two numbers x and y.
3. The age of Ted 3 years ago if he is x years old now.
4. The product of 3 consecutive odd numbers if the middle number is x.
5. The length of a rectangle if it is 9 units longer than half its width w.

III. Translate the given mathematical expressions into a verbal phrase.

1. 3𝑥 – 1
2. (𝑥 – 5)(𝑥 + 5)
3. 1 + 2 + 3 + … + 10

IV. (Sets) Perform the indicated operations on sets.

Consider U = (0, 1, 2, 3, 4, 5, 6, 7, 8, 9}, A = {0, 2, 4, 6, 8},
B = {1, 3, 5, 7, 9} and C= {3, 4, 5, 6, 7}.
Find: 1. (A  B)  C

2. A  (C  B)

3. (A  C ')  (B  C )

22
 Department of Mathematics and Physics MATH 1100

V. (Functions) Suppose f(x) = 2x – 9 and g(x) = 3x2 – 5x + 2. Find the following:

1. f(3/2) + g(–9)
f (2) 1
2. 
g (1) 2

3. f(2x – 3) – g(x + 4)

VI. Binary Operations

1. If x＊ y = 5y – 3x, find a. 3＊ 2 b. –4＊3/4 c. –4＊b/2
2. Which of the following definitions of ＊is commutative?
𝑥+𝑦
a. x＊y = 3x + 2y b. x＊y = xy c. x＊y = 𝑥𝑦 d. x＊y = y – 2x

3. Given x＊y = 2x + 3y, what is the value of 3＊(4＊5) ?

VII. Elementary Logic

1. Which of the following are statements? Not statements? Why?
a. When is your birthday?
b. I will pass in this subject.
c. The number 3.2 is an even number.

2. Suppose p: The sun is shining; q: It is raining; and r: The ground is wet.

Write each of the following in symbolic forms.
a. If it is raining, then the sun is not shining.
b. It is raining and the ground is wet.
c. The ground is not wet.
d. Either the sun is shining or it is raining.
e. The ground is wet if and only if it is raining and the sun is not shining.

23
 Department of Mathematics and Physics MATH 1100

REFERENCES:

Badua, P. M., Daquioag, A. Z., Daquioag, R. R., Florendo, D. R., Ibanez, E. D., Pagay,
A. M., Romano, M. G., Seeping, A. V., Taganap, E. C., & Tumaliuan, M. N. (2012).
Functions, Relations and Graphs. In Pre-Calculus Math (Plane Trigonometry) (pp. 62-
75). Love Printing Press, Cabanatuan City.

Badua, P. M., Daquioag, A. Z., Daquioag, R. R., Florendo, D. R., Ibanez, E. D., Pagay,
A. M., Romano, M. G., Seeping, A. V., Taganap, E. C., & Tumaliuan, M. N. (2012).
Sets. In Pre-Calculus Math (College Algebra) (pp. 1-24). Love Printing Press,
Cabanatuan City.

Aufman, R. N., Lockwood, J., & Richard, D. (2013). Logic. In Mathematical Excursions
(3rd ed., pp. 111-119). Brooks/Cole, Cengage Learning.

Aufman, R. N., Lockwood, J., & Richard, D. (2013). Logic. In Mathematical Excursions
(3rd ed., pp. 133-137). Brooks/Cole, Cengage Learning.

Aufman, R. N., Lockwood, J., & Richard, D. (2013). Logic. In Mathematical Excursions
(3rd ed., pp. 141-144). Brooks/Cole, Cengage Learning.

24