Lesson 2-1. Mathematical Language
Lesson 2-1. Mathematical Language
Contents
The first part of the lesson provides similarities and peculiarities between the English
Language and the Language of Mathematics. This chapter enables us to be enlightened on
the proper use of the Language of Mathematics and it is hoped that everybody becomes well-
versed of the subject matter on hand.
English Language
Nordquist (2018) described English language as a primary language of several
countries in the world. This language serves as a common denominator between different
nationalities when they meet while travelling, doing business or in other contexts.
Definition: A noun is a name given to an object of interest. This object of interest may
refer to a person, a place, or a thing. It can either be a proper noun or a common noun.
2
Remark: It does NOT make sense to ask whether that object of interest is true or false.
Examples:
a. Juan
b. dog
c. New York
A group of words containing an object of interest and what it is about the object is
called a sentence.
Definition : A sentence is a set of words that states a complete thought. It typically has
an object of interest (subject) and what it is about the object of interest (predicate).
Examples:
Mathematical Language
Analogous to the English language is a system used by mathematicians to
communicate mathematical ideas among themselves. This is known as the Language of
Mathematics, or simply Mathematical Language.
This language includes words, technical terms, abstract codes and grammatical
conventions peculiar to mathematical discourse supplemented by a highly specialized
symbolic notation.
Mathematical language uses symbols that are necessary in formulating mathematical
equations and describing mathematical relations and other properties.
e. Greek letters: 𝛼, 𝛽, 𝛾, 𝛿, 𝜀
f. Grouping symbols: { }, ( ), [ ]
g. Equality and order relations: =, <, >, ≤, ≥
h. Logic symbols: ∀, ∃, ∧, ∨, →, ↔
RELATIONS
Example 1: (2, -1) and (𝑥, 1 − 𝑥) where 𝑥 = 2
Example 2: The point of intersection of the relations defined by 𝑅1 : 𝑦 = −2 and 𝑅2 : 𝑥 = 𝑦 2 ;
and the ordered pair (4, -2)
Definition: Simplifying an expression is rewriting the expression in a simpler way,
combining some components by applying operations which leads to less mathematical
symbols and in simplest form.
The word “simpler” can have different connotations:
a) fewer symbols
Example: 1 + 2 + 3 and 6
6 uses fewer symbols.
b) fewer operations
Example: 3 + 3 + 3 + 3 and 4 ∙ 3
4 ∙ 3 uses fewer operations.
c) better suited for current use
1 𝑓𝑜𝑜𝑡
Example: The expression and 1
12 𝑖𝑛𝑐ℎ𝑒𝑠
1 𝑓𝑜𝑜𝑡
may be preferred than 1 if we need to convert units of inches
12 𝑖𝑛𝑐ℎ𝑒𝑠
to units of feet.
d) preferred style/format
Example: The fractions 2/4 and ½
½ is more preferred since it is in reduced form
Remark: In a similar manner to the English language, it makes sense to ask about the truth
of a sentence in mathematical language.
Examples: The following are mathematical sentences.
1. 2 + 5 = 6 (False)
2+5=7 (True)
2. – 23 = –8 (True)
3. 0 ∈ 𝜙 (False)
𝜙 is the so-called empty set, a set without any elements, that is, 𝜙 = { }
4. –5 ∈ ℂ where ℂ is the set of complex numbers (True)
5. 3 ∈ (3, 5] (False)
3 is the left endpoint of the interval which is not included since it is open
6
6. √−4 ∈ 𝑍 (False)
√−4 = ±2i and ±2i are imaginary numbers or complex numbers.
7. If 𝑓(𝑥) = −𝑥 + 2, then 𝑓(2) = 0 . (True)
1
8. 𝑦 = − 𝑥 is the inverse of 𝑦 = 2𝑥. (False)
2
1
The inverse of 𝑦 = 2𝑥 is 𝑦 = 𝑥.
2
The succeeding section talks about four basic concepts of mathematics: sets,
functions, relations (ordered pairs) and binary operations. Conventions on the use of the
mathematical symbols of each concept are illustrated.
I. SETS
Definition: A set is basically a mathematical expression which refers to a well-defined
collection of distinct objects. The objects in a set are called the elements or members of
the set. Capital letters in the English alphabet is used in naming the set.
The set is said to be well-defined if it is possible to determine whether an object
belongs to a given set or not. Otherwise, it is ill-defined.
There are sets however that are commonly used in mathematics. These notations are
popularly utilized such as:
ℕ = set of natural numbers
ℤ = set of integers
ℚ = set of rational numbers
II. RELATIONS
Definition: Let 𝐴 and 𝐵 be any two sets. The product 𝑨 × 𝑩 is the set of ordered pairs
(𝑥, 𝑦) such that 𝑥 ∈ 𝐴 and 𝑦 ∈ 𝐵. This product is referred to as the Cartesian product of sets
𝐴 and 𝐵.
Remarks:
1. In the ordered pair (𝑥, 𝑦), 𝑥 is referred to as the first component and 𝑦 as the second
component.
2. A Cartesian product may be formed using a single set. That is, for any set 𝐴
𝐴 × 𝐴 = { (𝑥, 𝑦)| 𝑥, 𝑦 ∈ 𝐴 }
This product may also be written as 𝐴2 .
8
Example: The xy-plane (or Cartesian plane) is the Cartesian product ℝ × ℝ. This rectangular
plane is also denoted as ℝ2 .
Example 1: Let A = { a, b }. Then A x A = { (a, a), (a, b), (b, a), (b, b) }
Example 2: Let B = {1, 2, 3}. Then
B x B = { (1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3) }.
Example 3: Let A = { a, b } and B = {1, 2, 3}. Then
A x B = { (a, 1), (a, 2), (a, 3), (b, 1), (b, 2), (b, 3) }.
Remark: Cartesian products are not restricted to two sets. They can be extended to a
number of n sets, say A1, A2, … , An, forming an n-fold cross product A1 x A2 x . . . x An
whose elements are n-tuples of the form (a1, a2, . . ., an), ai ∈ A where i = 1, 2, 3, …, n.
Now, if we let A = {0, 1}, can you enumerate all the ordered triples for A x A x A or A3 ?
Different subsets can be formed from a given Cartesian product, S x S. By just looking at
the first and second components of the ordered pairs, a particular kind of relation exists. This
relation may come in any of the following forms: one-to-one relation, one-to-many relation or
many-to-one relation.
EXERCISE: Suppose that S = {1, 2, 3} and the subsets of S x S are any of the following,
describe each relation:
Relation
a. {(1, 1), (2, 2), (3, 3)} __________________
b. {(3, 1), (3, 2)} __________________
c. {(1, 2), (2, 3)} __________________
d. {(1, 2), (2, 3), (3, 3)} __________________
Definition: If R is a relation on the set S, that is, R⊆SxS, and (x,y)∈ R then we say that “x is
related to y” and denote this as xRy. If the relation is represented by ~, we write, “x ~ y”.
9
Types of Relations
1. Reflexive: x ~ x
The relation R on the set S is reflexive if for all x ∈ S, (x, x) ∈ R.
2. Symmetric: If x ~ y then y ~ x.
The relation R on S is symmetric if for all x, y ∈ S, (x, y) ∈ R implies (y, x) ∈ R.
3. Transitive: If x ~ y and y ~ z, then x ~ z.
The relation R on the set S is transitive if for all x, y, z ∈ S, (x, y) ∈ R and (y, z) ∈ R,
then (x, z) ∈ R.
Is R = { (1, 1), (1, 3), (2, 2), (2, 1), (3, 1), (3, 3), (1, 2) } an equivalence relation on the set
A = {1, 2, 3}? Verify your answer.
Equivalence relations are also applicable to infinite sets of numbers. For example, if
we consider the set of integers ℤ = {… , −2, −1, 0, 1, 2, … } and the relation ~ defined as
follows:
𝑥~𝑦 means 𝑥 − 𝑦 is divisible by 5.
Think of other numbers that are related to 26, 6 and 1, including negatives. Can you
add more numbers to the following list: …,–9,–4 , 1, 6, 26, …
10
Given that not all integers will belong to the same list, how many sets will be formed
by the given relation? Make some observations on the sets formed.
III. FUNCTIONS
Definition: A function is a relation for which each value from the set of first components of
the ordered pairs is associated with exactly one value from the set of second components
of the ordered pair.
Examples:
1. { (−1, 1 ), ( 1, 1 ), ( 0, 0 ), ( 2, 4 ) } is a function
2. { (4, 2 ), ( 4, −2 ), ( 0, 0 ), ( 16, −4 ) } is not a function
Using more rigorous mathematical terms, a function 𝑓 is a mapping from a set D (called
the domain of the function) to another set R (called the range of the function) such that
every 𝑥 ∈ 𝐷 is associated with a unique number 𝑦 ∈ 𝑅. The mapping is denoted as 𝑓: 𝐷 → 𝑅
and we have 𝑓(𝑥) = 𝑦 where 𝑥 ∈ 𝐷, 𝑦 ∈ 𝑅.
Among the different forms of relations (i.e., one-to one, one-to-many, and many-to-one),
which of these satisfy the conditions of a function?
A function is often written as an equation which varies in form and degree. The
expressions present in a function can tell a lot about its behavior and can help us describe
its properties.
For example, suppose 𝑓: {0, 1, 2} → {5} where
𝑓(0) = 5
𝑓(1) = 5
𝑓(2) = 5
What do you notice about the function? Yes, the function is an example of a constant
function where 𝑓(𝑥) = 5 for every 𝑥 in the domain. Notice that every element in the domain
of the function is paired with the same element in the range.
For a better view of functions, we can look at the graph of a function, which consists
of all points (𝑥, 𝑦) ∈ 𝐷 × 𝑅 which satisfy the definition of the function 𝑓.
The graph of the function in the previous example drawn on the plane is shown in
Figure 1. Notice that the graph consists of discrete (or separate) points.
11
We can extend this constant function 𝑓 on the set of real numbers ℝ, i.e., 𝑓: ℝ → ℝ
where 𝑓(𝑥) = 5 for all real numbers 𝑥. The graph of this function is a horizontal line parallel
to the x-axis passing through the points (0, 5), (1, 5) and (2,5) as shown in Figure 2.
𝑓(1) = 2
𝑓(2) = 4
𝑓(3) = 6
⋮
𝑓(10) = 20
Can you represent the function 𝑓? Is the graph of the function a set of discrete points or a
continuous line?
12
Is the function defined in the previous example a linear function? Can you give an example
of a linear function in ℝ × ℝ and draw the graph?
f(0) = 0
f(1) = 1
f(2) = 4
f(3) = 9
f(4) = 16
f(5) = 25
Can you represent the function? Extend this function to the set of real numbers and
sketch the graph. Is it linear?
EXERCISE. Represent the given functions below and sketch their graphs.
1. Let 𝑓: ℝ → ℝ where f(-2) = -3, f(0) = 1, f(5) = 11. [Hint: It is a linear function.]
3. Let 𝑓: ℝ → ℝ where f(-1) = -1, f(-1/2) = -0.625, f(0) = 0, f( 2) = 8, f(3) = 27. What type
of function is f?
This section deals with combining two elements in a given set S and producing a third
element that is again in S. The most basic of such processes is performed in arithmetic, i.e.,
addition, subtraction, multiplication and division.
To show that ∗ is a binary operation, one needs to satisfy the two conditions below:
i. (Closure). For any two elements 𝑎 and 𝑏 in the set 𝑆, the product 𝑎 ∗ 𝑏 is an element
of 𝑆.
ii. (Uniqueness). Given that 𝑎, 𝑏 ∈ 𝑆 and 𝑎 ∗ 𝑏 = 𝑐, if there exists another element 𝑑 ∈ 𝑆
such that 𝑑 = 𝑎 ∗ 𝑏, then 𝑑 = 𝑐.
Examples:
1. Let 𝑆 = ℝ and ∗ be “+” (usual addition). For 𝑎, 𝑏 ∈ ℝ, 𝑎 ∗ 𝑏 = 𝑎 + 𝑏 ∈ ℝ.
This is a binary operation.
2. Let 𝑆 = ℤ and ∗ be “⋅” (usual multiplication). For 𝑎, 𝑏 ∈ ℤ, 𝑎 ∗ 𝑏 = 𝑎 ⋅ 𝑏 ∈ ℤ.
This is a binary operation.
3. Let 𝑆 = ℤ and 𝑎 ∗ 𝑏 = max{𝑎, 𝑏}, the largest of a and b. This is a binary operation.
4. Let 𝑆 = ℤ and 𝑎 ∗ 𝑏 = 𝑎/𝑏. This is not a binary operation as 𝑎/𝑏 is not defined when
𝑏 = 0 (condition ii) apart from the fact that 𝑎/𝑏 is not always in ℤ (condition i).
For some finite sets, binary operations can be presented using a “multiplication table”.
The resulting entries in the table after performing the operation can provide relevant
information regarding the set.
Examples:
1. Let 𝑆 = {−1, 0, 1} and the operation be the usual multiplication. Show that is a binary
operation by means of a multiplication table.
Solution:
-1 0 1
-1 1 0 -1
0 0 0 0
1 -1 0 1
One can easily check on the table that the product (as the operation is multiplication) of
each pair of elements of 𝑆 produces a third element of the set.
2. Let ℤ4 = { 0, 1, 2, 3 } and +4 be the operation that gives the remainder when the sum
of two elements in ℤ4 is divided by 4 (e.g., 2 +4 3 = 1). Show that +4 is a binary operation
on ℤ4 . (This is left for the student as an exercise.)
14
A binary operation may exhibit several properties but not necessarily all of the
following:
Definition: Let ∗ be a binary operation on a set 𝑆. Then:
a. ∗ is commutative if for all 𝑎, 𝑏 ∈ 𝑆, 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎.
b. ∗ is associative if for all 𝑎, 𝑏 ∈ 𝑆, 𝑎 ∗ (𝑏 ∗ 𝑐) = (𝑎 ∗ 𝑏) ∗ 𝑐.
c. An element 𝑒 of 𝑆 is an identity for ∗ if for all 𝑎 ∈ 𝑆, 𝑎 ∗ 𝑒 = 𝑒 ∗ 𝑎 = 𝑎.
d. If 𝑒 is an identity for ∗ and 𝑎 ∈ 𝑆, then 𝑎 is invertible if there exists 𝑏 ∈ 𝑆 such that
𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎 = 𝑒. The element 𝑏 is called the inverse of 𝑎.
Examples:
1. Let 𝑆 = ℝ and a ∗ b = a + b.
2. Let 𝑆 = ℝ and a ∗ b = a.
3. Let 𝑆 = {−1, 0, 1} and ∗ be the usual multiplication. What is the identity in 𝑆? Can
you give the inverse of each element of 𝑆?
EXERCISE.
1. Determine whether 𝑆 = ℚ − {0}, a ∗ b = a/b is a commutative or associative binary
operation.
2. Determine if the binary operation ∗ defined by the table below is commutative.
∗ a b c d
a a b c d
b b c d a
c c d a b
d d a b c