GEC3

MATHEMATICS IN THE MODERN

WORLD
CHAPTER 2: MATHEMATICAL LANGUAGE AND SYMBOLS
FOUR BASIC CONCEPTS: LANGUAGE OF
FUNCTIONS AND RELATIONS
A relation is a set of ordered pairs. If x and y are
elements of these sets and if a relation exists between x and y,
then we say that x corresponds to y or that y depends on x
and is represented as the ordered pair of (x,y).
A relation from set A to set B is defined to be any subject
of AxB. If R is a relation to A to B and (a,b)∈ R, then we say that
“a is related to b” and it is denoted as aRb.
For example, A={a,b,c,d} be the set of car brands, and let
B={s,t,u,v} be the set of countries of the car manufacturer. Then
AxB gives all possible pairings of the elements of A and B, let
the relation from A to B be given by R={(a,s), (a,t), (a,u), (a,v),
(b,s), (b,t), (b,u), (b,v), (c,s), (c,t), (c,u), (c,v), (d,s), (d,t), (d,u),
(d,v)}.
FOUR BASIC CONCEPTS: LANGUAGE OF
FUNCTIONS AND RELATIONS
A special kind of relation is function, one
of the most important concepts in the study of
mathematics. A function is a relation in which,
for each value of the first component of the
ordered pairs, there is exactly one value of the
second component.
The set X is called the domain of the
function. For each element of x is in X, the
corresponding element of y in Y is called value
of the function at x, or the image of x. The set of
all images of the elements of the domain called
range of the function. A function can also be
expressed as a correspondence or mapping
from one set to another.
FOUR BASIC CONCEPTS: LANGUAGE OF
FUNCTIONS AND RELATIONS
In the example represented on Figure 1, it could
also be written as {(3, 5), (3, 6), (-3, -6), (2, -6)}. Then
noticed that the domain value “3” is mapped both to
range values “5” and “6”. Thus, making it not a function.
On the other hand, in the example represented on
Figure 2, in the same way, it could also be written as {(5,
3), (6, -3), (-6, 2)}. Then, all values in the domain are
mapped to different range values. Thus, making it a
function.
FOUR BASIC CONCEPTS: LANGUAGE OF
FUNCTIONS AND RELATIONS
Vertical Line Test is a test for functions. If you
take your pencil and draw a straight line through
any part of the graph, and the pencil hits the
graph more than once, the graph is not a function.
Therefore a graph will represent a function if the
vertical like test passes. In other words, no
vertical line intersects the graph more than once.
Referring to the graph as presented in the given
figure, we will apply the vertical line test.
Since the vertical line hits the graph more than
once (indicated by the two green circles), the
graph does not represent a function.
FOUR BASIC CONCEPTS: LANGUAGE OF
FUNCTIONS AND RELATIONS
Next, referring to the graph as
presented in the given figure, we will
apply the vertical line test (Refer to the
figure on the left).
Since the vertical line hits the graph
only once (indicated by the green dot),
the graph does represent a function.
FOUR BASIC CONCEPTS: LANGUAGE OF
FUNCTIONS AND RELATIONS
Give the domain and range of each relation, illustrate
and determine whether it represents a function.
1. {(-1,0),(1,0),(0,1),(0,-1)}
2. {(5,2),(4,1),(3,0),(2,-1)}
ACTIVITY 5
Identify each item if it corresponds to a function or not by writing “F” for function
and “N” for not a function.
1) {(3, 4), (5, -3), (6, 2)} Answer: __________
2) {(0, 3}, (0, 2), (0, 1), (0, 0)} Answer: __________
3) {(2, -2), (2, -3), (2, -4), (2, -5)} Answer: __________
4) {(1, -2), (2, -2), (3, -2), (4, -2)} Answer: __________
5) 6)

Answer: __________ Answer: __________

FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Binary operation is for a single number and
assigns another number to it, addition (+),
subtraction (-), multiplication (x), and division (÷)
are examples of binary operations. The word
“binary” means composition of two pieces. A binary
operation refers to joining two values to create a new
one.
FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
We first define what binary operation is. Let S be a set.
A binary operation on S is a function that assigns each
ordered pair of element of S. Symbolically, 𝑎 ∗ 𝑏 = 𝑆, ∀𝑎, 𝑏 ∈
𝑆.
A group is a set of elements, with one operation, that
satisfies the following properties: (i) the set is closed with
respect to the operation, (ii) the operation satisfies the
associative property, (iii) there is an identity element, and
(iv) each element has an inverse.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Closure Property
Let 𝑆 be a non-empty set. A binary
operation ∗ on 𝑆 is said to be a closed binary
operation on 𝑆, 𝑎 ∗ 𝑏 = 𝑐 ∈ 𝑆, ∀𝑎, 𝑏, 𝑐 ∈ 𝑆.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Associative Property
Let 𝑆 be a subset of ℤ.
A binary operation ∗ on 𝑆 is said to be
associative, when 𝑎∗𝑏 ∗𝑐 =𝑎∗ 𝑏∗𝑐 ,
∀𝑎, 𝑏, 𝑐 ∈ 𝑆.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Identity Property
A non-empty set 𝑆 with binary operation ∗,
is said to have an identity, 𝑒 ∈ 𝑆, if 𝑒 ∗ 𝑎 = 𝑎 ∗ 𝑒 =
𝑎, ∀𝑎 ∈ 𝑆.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Inverse Property
For each a ∈ 𝑆, there is an element 𝑎−1 of 𝑆 if
a ∗ 𝑎−1 = 𝑎−1 ∗ 𝑎 = 𝑒.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Commutative Property
Let 𝑆 be a non-empty set.
A binary operation ∗ on 𝑆 is said to be
commutative, if 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎, ∀𝑎, 𝑏 ∈ 𝑆.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Distributive Property
Let 𝑆 be a non-empty set. Let ∗1 and ∗2 be
two different binary operations on 𝑆. Then ∗1 is
said to be distributive over ∗2 on 𝑆 if
𝑎 ∗1 (𝑏 ∗2 𝑐) = (𝑎 ∗1 𝑏) ∗2 (𝑎 ∗1 𝑐), ∀𝑎, 𝑏, 𝑐 ∈ 𝑆.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Definition: Binary Operations
Let 𝑆 be a non-empty set and ∗ said to be a binary
operations on 𝑆, if 𝑎 ∗ 𝑏 is defined for all 𝑎, 𝑏 ∈ 𝑆.

In other words, ∗ is a rule for any two elements in

the set 𝑆.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

1. The arithmetic operations, addition +, subtraction −,

multiplication ×, and division ÷.
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Evaluate the following viral expressions:
1. 8 ÷ 2 2 + 2
1
2. 9 − 3 ÷ + 1
3
3. 9 ÷ 3 × 2 ÷ 6
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

2. Define an operation oplus (circled plus) on ℤ

by 𝑎 ⊕ 𝑏 = 𝑎𝑏 + 𝑎 + 𝑏, ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2 ⊕ 3
Solution: 𝑎 ⊕ 𝑏 = 𝑎𝑏 + 𝑎 + 𝑏
2⊕3= 2 3 +2+3
=6+2+3
= 11
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

3. Define an operation ominus (circled minus) on ℤ

by 𝑎 ⊖ 𝑏 = 𝑎𝑏 + 𝑎 − 𝑏, ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2 ⊖ 3
Solution: 𝑎 ⊖ 𝑏 = 𝑎𝑏 + 𝑎 − 𝑏
2⊖3= 2 3 +2−3
=6+2−3
=5
 BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

4. Define an operation otimes (circled times) on ℤ

by 𝑎 ⊗ 𝑏 = 𝑎 + 𝑏 𝑎 + 𝑏 , ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2 ⊗ 3
Solution: 𝑎⊗𝑏 = 𝑎+𝑏 𝑎+𝑏
2 ⊗ 3 = 2 + 3 (2 + 3)
= (5)(5)
= 25
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

5. Define an operation oslash (circled division) on ℤ

by 𝑎 ⊘ 𝑏 = 𝑎 + 𝑏 𝑎 − 𝑏 , ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2 ⊘ 3
Solution: 𝑎⊘𝑏 = 𝑎+𝑏 𝑎−𝑏
2 ⊘ 3 = 2 + 3 (2 − 3)
= (5)(−1)
= −5
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

6. Define an operation min on ℤ

by 𝑎⋁𝑏 = 𝑚𝑖𝑛{𝑎, 𝑏}, ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2⋁3
Solution: 𝑎⋁𝑏 = 𝑚𝑖𝑛{𝑎, 𝑏}
2⋁3 = 𝑚𝑖𝑛{2,3}
=2
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

7. Define an operation max on ℤ

by 𝑎⋀𝑏 = 𝑚𝑎𝑥{𝑎, 𝑏}, ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2⋀3
Solution: 𝑎⋀𝑏 = 𝑚𝑎𝑥{𝑎, 𝑏}
2⋀3 = 𝑚𝑎𝑥{2,3}
=3
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example 1:
The following are binary operations on ℤ

8. Define an operation defect on ℤ

by 𝑎 ∗3 𝑏 = 𝑎 + 𝑏 − 3, ∀𝑎, 𝑏 ∈ ℤ
 FOUR BASIC CONCEPTS: LANGUAGE OF
BINARY OPERATIONS
Example:
Evaluate 2 ∗3 3
Solution: 𝑎 ∗3 𝑏 = 𝑎 + 𝑏 − 3
2 ∗3 3 = 2 + 3 − 3
=2+0
=2
 ACTIVITY 6
Perform the indicated binary operations.
1. −2 ⊕ 3
2. −2 ⊗ 3
3. −2 ⊘ 3
4. −2 ⊖ 3
5. −2⋁3
6. −2⋀3
7. −2 ∗3 3