Unit 2 - Mathematical Language and Symbols (GCSGaetos)
Unit 2 - Mathematical Language and Symbols (GCSGaetos)
Unit 2 - Mathematical Language and Symbols (GCSGaetos)
Language is important in performing man's everyday activities. People use language to develop ideas and to
express them to other people. Similarly, in the field of mathematics, mathematical language is adapted to express
mathematical ideas. The purpose of using the language in mathematics is to arrive at a common understanding, that is, to
avoid difficulties in expressing mathematical ideas. These ideas can be anything from numbers and geometrical shapes to
more complicated ones, usually constructed from numbers, points, and functions. We need to be able to discuss the ideas
using precise language, which should be interpreted in the same way by everyone. Mastering the language of
mathematics is not easy. It requires understanding and interpreting oral expressions, and decoding written and graphical
representations of mathematical ideas. It also requires the ability to express quantitative ideas and statements orally and
write the same in varied contexts. Mathematics has its symbols, syntax, and rules that are observed to express ideas and
communicate such. In this unit, we will be discussing the basic mathematical language needed to express a range of
mathematical concepts.
Learning Objectives:
Setting Up (Unit 2)
Match words to the operator. Write the number preceding each word/s that best describes to the operating symbol.
x - / +
2, 5, 3, 4, 1,
Lesson Proper
MATHEMATICAL LANGUAGE
Characteristics of Mathematical Language
In general, the language of mathematics is non-temporal; it has no past, present or future tense. It is also devoid
of emotions and has no hidden agenda and unspoken cultural assumptions. Specifically, it has the following
characteristics:
14
Precise
Mathematical expressions or statements are very precise and has own distinct meaning. Mastery of such
characteristics is best learned through understanding the language of mathematics. For example, reducing the long
English sentence,
“The total number of male students in BS Biology 1-A, which can be called x, is always greater than the total number of
female students, which can be called y.”
symbolically into
x>y
greatly simplifies the sentence. The symbols retain the important information and the context needs only to be referred to
again when stating a solution.
Concise
The language of mathematics is concise because it uses symbols instead of spelled-out words. For example in
English sentence
7 + 5 = 12
By the use of symbols, mathematical expressions become brief, and ambiguities are avoided. The table below
illustrates more on this.
Powerful
Mathematics is powerful because you can only perform efficiently in problem solving if you understand the
language of mathematics. To express mathematical ideas, you need to master particular requirements and conventions.
In this way, complex ideas may be expressed in a greatly simplified manner. In other words, learning the language of
mathematics empowers you to be efficient problem solvers. You also gain confidence in talking about your mathematical
learning and articulate for yourself what else you need to learn. Overall, the mathematical language skills include the
ability to read comprehensively, express mathematical thoughts easily and clearly, to reason logically and to recognize
and employ common patterns of mathematical thought.
Mathematical language is composed only of expressions and sentences. Expressions can refer to a problem as
simple as 5 + 2. We could change the (+) to make different mathematical expressions such as 5 – 2, 5 * 2, and 5 / 2.
Addition, subtraction, multiplication and division are called operations. There are many more operations that can be used
in a mathematical expression, which usually includes numbers, sets, and functions, ordered pairs, matrices and many
more.
An expression is any correct arrangement of mathematics symbols, used to represent a mathematical object of
interest; it does not state a complete thought and so it doesn’t make sense to ask if it is true or false. Instead, expressions
are those that one is asked to simplify into an equivalent form that usually involves fewer symbols and operations, or into
a form that is best suited to a current application, or into a preferred form or style.
Verbal phrases can be translated into variable expressions. Some examples are shown below:
Whenever possible, you need to select a single variable to represent an unknown quantity. Then, express related
quantities in terms of the selected variable. Look at the following examples. For each relationship, select a variable to
represent one quantity and state what that variable represents. Then express the second quantity in terms of the variable
selected.
A mathematical sentence is a correct arrangement of mathematical symbols that states a complete thought. The
most common mathematical statements or sentences are called equations and inequalities. To show the comparison
between mathematical expression and mathematical sentence, refer to the table below.
A mathematical sentence is one that makes a statement about the relationship of two expressions. These two
expressions are written in symbols such as numbers and variables, or a combination of both. The relationship of the two
expressions is usually stated by using symbols or words such as equals (=), greater than (>), less than (<), greater than or
equal to (≥), and/or less than or equal to (≤).
Moreover, a mathematical sentence that is sometimes true or sometimes false is called an open sentence. Open
sentences usually arise when variables are used. To give you examples,
1. 2 – z < 2z – 7
2. An octagon has x sides
3. 3x – 2 = y – 5
In the above illustrations, the mathematical sentences may or may not be true depending on the values of the
variables x and y. The veracity of such sentences is open, depending on the values of the variables.
On the other hand, a closed sentence is a mathematical sentence in which we are sure that it is true or false. For
example,
Sets
A set is a collection or grouping of elements. These elements can be anything such as numbers, letters, names,
sentences, etc. The capital letters A, B, C, … are usually used to name sets; if the elements are also letters, the small
letters a, b, c, … are used. Sets can be described or expressed in different ways. The simplest way is to just list the
elements of the set, separated by commas inside a pair of braces. For example, a set A whose elements are a, b, and c
can be expressed as:
A = {a, b, c}
16
The order by which the elements are listed is irrelevant; a set is defined by what elements it contains, not by any
ordering or priority among those elements. Thus, each of the following refers to the same set:
A = {a, b, c} A = {b, a, c} A = {c, a b}
A = {a, c, b} A = {b, c, a} A = {c, b, a}
This way of describing a set, called Roster or List Method is easy to use especially if the set has only a few
elements no matter what they are. For example,
A = {m, a, t, h}
B = {plants, animals, microorganisms}
C = {-2, 1, 3, 5, 8, 9, 11, …, 2019}
Alternatively, you can describe a set by giving a description that fits each and all of the elements. This is called
the Rule or Description Method. For example,
A = {x|x is a vowel of the English alphabet},
which is read as “x such that x is a vowel of the English alphabet”, which means that “A is composed of any x,
where x is a vowel of the English alphabet”.
We define the size, or cardinal number, of any set A as |A|. For example, if A = {a, b, c, d, e, f, g}, then |A| = 7.
If an element x is a member of the set A, we write x ∈ A; otherwise, we write x ∉ A. For example, if A = {a, b, c, d,
e, f, g}, then f ∈ A but note that F ∉ A.
Now, we have what we call subset/s. By definition, set A is a subset of set B, written as A ⊂ B, if every member
of A is also a member of B. Otherwise, we write A ⊄ B, read as “A is not a subset of B” to mean there is at least one
element of A that is not in B.
For example, given A = {a, b, c} and B = {a, b, c, d}, then A ⊂ B because all members of A are members of B. On
the other hand, B ⊄ A; it follows from the definition that any set A is a subset of itself, such as A ⊂ A.
Note that ∈ and ⊂ are two different concepts. To illustrate,
Moreover, we can say that two sets are equal (or identical), written as A = B, if an only if they have the same
elements. Equivalent sets compose of two or more sets with the same number of elements. Alternatively, we can say that
A = B, if and only if A ⊂ B and B ⊂ A. Any set that has no element at all is called a null or empty set, denoted by { } or Ø.
The null set is a subset of any other set. Any set that contains all elements under consideration is called the universal
set, denoted by U. Finite set consist of countable number of elements and has a determinate number of elements.
Infinite set has indeterminate number of elements. Disjoint sets compose of two or more sets with no common
elements. Join sets compose of two or more sets with at least one common element.
Operations on Sets
Given a list of sets, other sets may be formed by performing one or more operations on the given sets.
Basically, these operations are the union (⋃), intersection (⋂), complement ( ‘ ), difference ( - ), and the Cartesian
or cross product (x).
Union
The union (⋃) operation combines all elements of two sets. Any element that occurs in both sets
only occurs once in the new set.
Example:
If A = {a, b, c} and B = {c, d}, then
A ⋃ B = {a, b, c, d} or A ⋃ B = {x|x are the English lower case letters from a to d}.
A B
Intersection
The intersection (⋂) operation contains all elements found in two sets. In other words, the
intersection of two sets contains only the elements common to both sets.
Example:
If A = {a, b, c} and B = {c, d}, then
a. A ⋂ B = {c}
b. (A ⋂ B) ⋃ B = {c} ⋃ {c, d} = {c, d}
17
A B
Complement
The complement (‘) of a set, denoted by A’, identifies the elements of the universal set that are
not in A.
Example:
1. If A = {x, y} and U = {x, y, z} then A’ = {z}
2. Ø’ = U
Difference
The difference of two sets A and B denoted by A – B, is defined to be the set whose elements
are those of A that are not in B.
Example:
If A = {x, y} and B = {x, y, z}, then
A–B=Ø
B – A = {z}
Cartesian Product
The Cartesian product or cross product of two sets A and B, denoted by A x B, is the set of all
ordered pairs {x, y} such that x ∈ A and y ∈ B.
Example:
If A = {a, b} and B = {c, d}, then
A x B = {(a, c), (a, d), (b, c), (b, d)}
B x A = {(c, a), (c, b), (d, a), (d, b)}
Source: https://www.onlinemathlearning.com/union-set.html
We can define a relation as any set of ordered pairs (x, y). The set of all x-components is called the domain while
the set of all y-components is called the range. For example, the set R = {(1, 2), (3, 4), (5, 6)} is a relation, where we see
that 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.
A function is a special kind of relation. In functions, 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 B = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)} is a function.
2. The relation C = {(1, 2), (2, 3), (4, 5), (2, 7)} is not a function. Ordered pairs (2, 3) and (2, 7) have the same first
component.
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 x and y.
With this notation, the function is given the name f; x is called the independent variable and y is the dependent
variable. The value of y depends upon the value of x.
The function f may be likened into a machine where if we input x into it, it produces the output y. Say for example, the
machine (function f) is a juice maker. If we put in a mango, then the mango juice will come out; if we put in a pineapple,
then pineapple juice comes out. But if we put in a rock or stone (not in its domain), what will happen? Functions are
similar to the machine.
Now, let’s say for example that we have two machines: f and g, which is defined by f(x) = 2x + 3 and g(x) = 𝑥 ! − 3𝑥 +
2. Then f(7) means inputting 7 into machine f which processes it accordingly as 2(7) + 3 that produces the output 17.
Similarly, g (-4) means inputting – 4 into machine g which processes it accordingly as ( −4)! − 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.
To illustrate, consider f(x) = 3𝑥 ! − 5𝑥 + 2 and g(x) = 2 – 3x. Find each of the following:
a. f(2)
b. g(-3/2)
c. f(-2) – g(4/3)
d. f(1/2) – g(2) + 3/2
e. f(3) + g(2x – 7)
f. f(g(x))
19
Solutions:
#
c. f(-2) – g(4/3) = [3(−2)! − 5(−2) + 2] − [2 − 3 8 9] = [12+10+2] – [2 – 4] = 24 – (-2) = 26
"
d. f (1/2) – g(2) + 2/3 = [3(1/2)! − 5(1/2) + 2] − [2 − 3(2)] + 2/3 = [3/4 – 5/2 + 2] – [2 – 6] + 2/3 = ¼ - [- 4] + 2/3 =
4.92
f. f(g(x)) = 3𝑔 (𝑥)! − 5𝑔(𝑥) + 2 = 3(2 − 3𝑥)! − 5(2 − 3𝑥) + 2 = 3(4 − 12𝑥 + 9𝑥 ! ) − 10 + 15𝑥 + 2 = 27𝑥 ! − 21𝑥 + 4
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 S is a rule that assigns to each ordered pair (a, b) of
elements of S a unique element a*b ∈ S.
1. On the set of natural numbers N = {1, 2, 3, 4, 5, …}, addition and multiplication are binary operations because
adding or multiplying any two elements of N produces an element that also belongs to N.
2. On the set of natural numbers N = {1, 2, 3, 4, 5, …}, subtraction and division are not binary operations. Why?
Because it doesn’t satisfy all the conditions.
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 f a sound argument. An argument is said to be sound
(valid or correct) if its conclusions follows from, or is a consequence of its premises; otherwise it is unsound or invalid or
incorrect.
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 value is said to be T (true), otherwise it is F (false).
To illustrate:
1. “20 + 5 = 25” is a statement that is true.
2. “Letter g is a vowel” is a statement that is false.
3. “Apple (Machintosh) makes laptops” is a statement that is true.
4. “Apple (Machintosh) makes the best laptops” is not a statement but an opinion that may be true to some
people but false to others.
5. “2x – 5 = y + 3” is not a statement. It is sometimes true or false.
Symbolically, small letters represents statements, most frequently used are p, q, r, s, and t. For example, the
statement, “it is raining” may be represented by p as in:
p: it is raining .
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”.
For example, “Kay donated P 10, 000.00 and he did not take a bath or attended his class” is a compound
statement that is composed of 3 simple statements:
a. Kay donated P 10, 000.00.
b. Kay did not take a bath.
c. Kay did not attend 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. For
example:
20
Statement Negation
p: It is raining. ~p: It is not raining.
q: Leni is LP ~q: Leni is not LP
r: Some of my classmates are ~r: No classmate is upperclassman.
upperclassmen
Note: It is not a negation of r. Why? ~r: Some of my classmates are not
upperclassmen.
s: BS Biology students are good-looking. ~s: BS Biology students are not good-
looking.
You may also write ~s: It is not true (false) that BS Biology students are good-
looking.
A negation is true (false) if and only if the statement itself is false (true).
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”. For example:
p: Errol is a veterinarian.
q: Errol is 30 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 “ v ” . That is the disjunction p v q represents the compound statement “p or q”. For example:
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 v ~q
ii. ~(p v q) = ~p ^ ~q
Conditional (à)
A conditional (or implication) consists of two cause-and-effect statements. One is a premise and the other is a
consequence that is 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
a. “p is sufficient for q”
b. “q when p”
c. “a necessary condition for q is p”
d. “q unless not p”
e. “q follows from p”
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: If you are more than 59 years old, then you are entitled to a senior citizen’s discount.
Converse: If you are entitled to a senior citizen’s discount, then you are more than 59 years old.
21
Inverse: If you are not more than 59 years old, then you are not entitled to a senior citizen’s discount.
Contrapositive: If you are not entitled to a senior citizen’s discount, then you are not more than 59 years
old.
Biconditional (ßà)
A biconditional (also called double implication) is a statement of the form (p à q) ^ (q à p), and is written as
pßà q. The double implication pßàq is read as “p if and only if q” and is frequently abbreviated by “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.
A biconditional p ßà is considered true if and only if p and q are both true or are both false.
References
The following are the video-graphic references used to make transcripts of this lesson. You may opt to visit the link for
review.
1. https://www.youtube.com/watch?v=M7xYj7cAzog
2. https://www.youtube.com/watch?v=BouqkWYlfzg
3. https://www.youtube.com/watch?v=jUNajHYVRz8
4. https://www.youtube.com/watch?v=oQb1hlA3vVk&list=PLlRMIfeXw7gno95CngI8OumsBnisJCDmV
5. https://www.youtube.com/watch?v=kgsettTSGfI
6. https://www.youtube.com/watch?v=ycdCqpS8_SA
7. https://www.youtube.com/watch?v=FotzX-2ZlCs
22
Assessing Learning (Unit 2-A)
I. Write E if the given is an expression or S if sentence. Place your answer before the item number.
1. 3x – 4y
2. 3x – 4z = 12
3. 3x < 6
4. 5e = 10
5. 8x2 – 27 = 37
6. x + y = 1
7. 3x – {2x + 1 – 3(x+1)}
8. (3, 5x)
9. 5z > 10
10. x + y + z = 0
II. Translate the given phrase into a mathematical expression. Write your answers on the space provided for
each item.
15. the length of a rectangle if it is 9 units longer than half its width w
16. 3x – 1
17. (x – 5 )(x + 5)
18. 1 + 2 + 3 + … +10
19. 5x + y + 0.25z
20. (x+y+z)/3
I. TRUE OR FALSE. Consider M = {x|x is a distinct letter in “mathematics”}. Write T if true, otherwise F, before
each number item.
1. M = {m, a, t, h}
2. M = {m, a, t, h, e, m, a, t, i, c, s}
3. |M| = 8
4. h ⊂ M
5. {m, a, t, h} ⊂ M
6. M = M
7. shame ⊂ M
8. {h, a, m} ⊂ M
9. M = {t, h, e}
II. 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)
5. |AxB|
24
Assessing Learning (Unit 2-C)
1. f(3/2) + g( - 9)
$(&!) )
2. (())
+ !
3. f(2x – 3) – g(x + 4)
4. g(f(x+1))
((!*+)&((!)
5. +
25
Assessing Learning (Unit 2-D)
Certain number of pilots is asked which they prefer more, travelling to Asian countries or to European countries, 27 pilots
prefer travelling to Asian counties, 22 prefer travelling to Europe while 13 pilots do not like travelling to Asian countries.
a. Draw the diagrams of the given condition
b. How many people prefer travelling to either Asian or European countries?
c. How many pilot prefer travelling to Asian countries only?
d. How many pilot prefer travelling to European countries only?
26
Assessing Learning (Unit 2-E)
Directions: Answer the following items. Write your answer on the space provided at the bottom part of the page.