MODULE 2: MATHEMATICAL LANGUAGE AND SYMBOLS

I. INTRODUCTION
This module focuses on Mathematical language and symbols. Like English as the international
language, Mathematics also has its own language. You will encounter here that English and Mathematical
languages are associated. This module also tackles sets, functions and relations, and elementary logic.

II. OBJECTIVES. Specifically, after working on this module, you should be able to do the following:
1. Explain the nature of mathematics as a language.
2. Translate Mathematical sentences and phrases into expressions and equations and vice
versa.
3. Define and prerform operations on sets.
4. Define and identify relations and functions.
5. Identify propositions and apply the different logial operators.

IV. LESSON PROPER

Language
- a systematic means of communicating by the use of sounds or conventional symbols
- It is the code humans use as a form of expressing themselves and communicating with others
- It may also be defined as a system of words used in a particular discipline

Characteristics of the mathematics language

• Precise
• Concise
• Powerful

Expression
- A name given to mathematical object of interest
- Number, set, function, ordered pair, matrix
Mathematical sentence
- Must state a complete thought
- A mathematical sentence can be true, false or sometimes true/sometimes false

Languages have conventions. In English, for example, it is conventional to capitalize proper names
(like “Carol” and “Manila”). This convention makes it easy for a reader to distinguish between a common
noun (like “carol”, a Christmas song) and a proper noun (like “Carol”). Mathematics also has its conventions,
which help readers distinguish between different types of mathematical expressions.
GE-MMW - Mathematics in the Modern World
Algebraic Translation

The skill in translating mathematical phrases and sentences into expressions and equations are
useful in solving worded problems.

The table below shows the common phrases and their translation.

Addition Subtraction Multiplication Division Equals

increased by, decreased from, of, times, out of, per, Is, are, was, were,
more than, decreased by, multiplied by, ratio of, will be,
added to minus, less, product of, quotient of, gives, yields,
combined, reduced by, twice, thrice divided by result of,
together, subtracted from, equals
total of, less than, less,
sum of, difference
plus between/of

Sets, Relation and Functions

Basic Properties of Sets

Set – a collection of well-defined objects

Two ways of representing a set

1. The Roster Method - The roster method is used to represent a set by listing each element of the set inside
a pair of braces. Commas are used to separate the elements.
2. Set-Builder Notation - Set-builder notation is used to represent a set, by describing its elements.
Examples:
The following are sets in roster method:
A = {red, blue, white, yellow}
B = {1, 2, 3, 4, 5}
C = {0,1, 2, 3}
D = {a, e, i, o, u}
While the following are in set-builder notation
A = {x/x is the color of the Philippine flag}
Note: The notation “x/x is read as x such that x”.
B = x / xN , x  5 = x such that x is an element of the Natural numbers and x is less than or
equal to 5
C = x / xW , x  4
D = {x/x is a vowel from the English alphabet}

(Note: N is the set of natural numbers while W is the set of whole numbers}

 The empty set, or null set, is the set that contains no elements.
 or { }
 Cardinal Number of a Finite Set - The cardinal number of a finite set is the number of elements in
the set. The cardinal number of a finite set A is denoted by the notation n(A).

Examples:
A = { a, b, c, d, e } n(A) = 5

PDM Page 2 of 10
GE-MMW - Mathematics in the Modern World
B = { 1, 2, 3, 4 } n (B) = 4
C = { coke, royal, sprite, royal } n(C) = 3 (Note: In case that an element is being
repeated, it will just be counted as 1.
 Equal Sets and Equivalent Sets. Two sets are equal if and only if they have exactly the same
elements. Two sets are equivalent if and only if they have the same number of elements.

Examples:
A = {red, blue, white, yellow} B= {red, blue} B’={white, yellow}
B = {1, 2, 3, 4, 5}
C = {0,1, 2, 3}
D = {a, e, i, o, u}
E = {x/x is a vowel from the English alphabet}
F = {x/x is the color of the Philippine flag}
A and C – Equivalent sets since they just have the same number of elements
which is 4
B and D - Equivalent sets since they just have the same number of elements
which is 5
A and F – Equal sets since they have exactly the same elements
D and E - Equal sets since they have exactly the same elements
Note: Equal sets are also equivalent since they have exactly the same elements, that also mean that
they have the same number of elements.

Universal Set - the set of all elements that are being considered
Complement of set A – denoted by A’ is the set of all elements of the universal set that are not elements of
A.

Let U = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, S= {2, 4, 6, 7}, and

T = {x/x <10 and x is odd counting numbers}.
Find a). S’ and b). T’
Solution: S’ = {1, 3, 5, 8, 9, 10}
Let us convert T in terms of roster method: T = { 1, 3, 5, 7, 9}
T’ = {2, 4, 6, 8, 10}

 Subset of a Set - Set A is a subset of set B, denoted by A  B if and only if every element of A is also
an element of B.
 Proper Subset of a Set - Set A is a proper subset of set B, denoted by A  B, if every element of A is
an element of B and A ≠ B.
 The Number of Subsets of Set A with n elements is 2n subsets.
Given 1. S = {a, b}, determine the number of subsets that can be formed.
n = 2 so using the formula 2n=22 = 4, so this means that there are 4 subsets.
{a}, {b}, {a,b}, { }
(Note: the given set itself and the empty set are subsets of any set)
2. A = {a, b, c}, n = 3 so 23 = 8
{a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}, { }
All of the subsets in examples 1 and 2 are proper subsets except for {a,b} in Example 1 and {a, b, c}
in Example 2. This is because of the definition of a proper subset which is not equal to the given set.

PDM Page 3 of 10
GE-MMW - Mathematics in the Modern World

Set Operations

Intersection of Sets – the set of elements common to A and B

A∩B = { x/ x  A and x  B}

Let A = {1, 4, 5, 7}, B ={ 2, 3, 4, 5, 6}, and C = {3, 6, 9}.

Find a. A ∩ B = { {4, 5}
b. A ∩ C = { }
c. B ∩ C = { 3, 6}

Union of Sets - the set that contains all the elements that belong to A or to B or to both
AUB = { x/ x  A or x  B}

Let A = {1, 4, 5, 7}, B={2, 3, 4, 5, 6}, and C= {3, 6, 9}.

Find a. A U B = {1, 2, 3, 4, 5, 6, 7}
b. A U C = {1, 3, 4, 5, 6, 7, 9}
c. B U C = {2, 3, 4, 5, 6, 9}

Relation
 a set of ordered pair of mathematical quantities.
 The domain of a relation is the set of first coordinates of the ordered pairs of that relation.
 The range of a relation is the set of second coordinates of the ordered pairs of that relation.
 The graph of a relation is the set of points in the plane that correspond to the ordered pairs of that
relation.

Types of Relation

1. One-to-one Relation 2. One-to-many Relation

A B F G

1 a a
2 b 1 b
3 c 2 c
4 d 3 d
5 e e

3. Many-to-many Relation 4. Many-to-one Relation

J K M N

a 1
1 b 2
3 c 3 c
4 d 4
e 5
PDM Page 4 of 10
GE-MMW - Mathematics in the Modern World

Functions
 A function f is a special type of a relation such that no two ordered pairs of the set have different
second coordinates corresponding to the same first coordinate.
 The set of all the first coordinates of the ordered pair is the domain of the function.
 The set of all second coordinates of the ordered pairs is the range of the function.
 In symbol, y = f(x) is read as “ y is a function of x” where y is the dependent variable and x is the
independent variable.
 From the four types of relations, only one-to-one and many-to-one are considered as functions.
 Identify which are functions from the given relations.
1. {(1,2), (3,4), (5,6)} 6.
2. {(1,2), (1,3), (1,4)}
3. {(a,2), (b,3), (b,4)}
4. {(-1,1), (1,-1), (-1,2)}
5.

From the above examples, nos. 1 and 5 are the only functions.1 is repeated as part of the domain in
number 2, b is also used twice as part of the domain in number 3, and -1 in number 4. Number 6 is not a
function by using the Vertical Line Test. This means that if you draw a vertical line along the graph, there will
be two points of intersection unlike in number 5 wherein if you draw any vertical line along the graph, there
will only be one point of intersection.

Elementary Logic
Proposition - a declarative sentence that is either true or false, but not both

Determine which are propositions from the following.

1. 3 is an odd integer.
2. Quezon City was once the capital of the Philippines.
3. 12 ÷ 4 = 3
4. 3 is an integer.
5. Who are you talking to?
6. Read this sentence carefully.
7. x + 4 = 7
8. u + v = w

Propositions from the above examples are numbers 1, 2, 3, and 4 since each has one value only,
either true or false. Numbers 1 and 3 are true while numbers 2 and 3 are false. The remaining numbers are
not propositions. Numbers 5 and 6 are not declarative sentences but rather an interrogative and imperative
sentences respectively. The last two examples are not propositions because you cannot determine its value,
it can be true or false depending on the values of the variables.
An acceptable proposition is given the decision value true (1), while an unacceptable statement is
assigned a decision value false (0). An array of decision value (truth value) is called a logical matrix (or truth
table)

Logical Operators

PDM Page 5 of 10
GE-MMW - Mathematics in the Modern World
Connectives – logical operators that are used to form new propositions from two or more existing
propositions

Negation
Say p is a proposition. The statement “It is not the case that p” is another proposition, called the negation of
p, denoted by p . The proposition p is read “not p”.
Example: Let p : 3 is a rational number.
 p : 3 is not a rational number.
: It is not the case that 3 is a rational number.

Truth Matrix of the Negation of a Proposition

p p
T F
F T

Conjunction and Disjunction

Say p and q are propositions.
1. (Conjunction of p and q) p and q, denoted by p  q
2. (Disjunction of p and q) p or q, denoted by p  q
Examples:
Let p and q be propositions
p: The clock is slow.
q: The time is correct.
Conjunction: p  q (The clock is slow and the time is correct.)
Disjunction: p  q (The clock is slow or the time is correct.)

Truth Matrix of the Conjunction and Disjunction of Propositions

p q pq pq
T T T T
T F F T
F T F T
F F F F
Implication / Conditional
Say p and q are propositions.
The proposition p  q (If p then q) is called an implication.
p is called the hypothesis/antecedent and q is called the conclusion/consequent.

• P implies Q
• Q if P
• Q is implied by P
• P only if Q

Truth Matrix of the Implication of a Proposition

p q pq
T T T
T F F

PDM Page 6 of 10
GE-MMW - Mathematics in the Modern World
F T T
F F T

Converse, Contrapositive, and Inverse

There are some related implications that can be formed from c.
The proposition q  p is called the converse of p  q .
The proposition q  p is called the contrapositive of p  q .
The proposition p  q is called the inverse of p  q .

Truth Matrix of the Implication of a Proposition

p q pq q p q  p p  q
T T T T T T
T F F T F T
F T T F T F
F F T T T T
Examples:
Let p: You are enrolled
q: You can access the school WIFI.
Implication: ( p  q ) If you are enrolled, then you can access the school WIFI.
Converse: ( q  p ) If you can access the school WIFI, then you are enrolled.
Contrapositive: ( q  p ) If you cannot access the school WIFI, then you are not
enrolled.
Inverse: ( p  q ) If you are not enrolled, then you cannot access the school WIFI.

Bi-conditional
Say p and q are propositions.
The proposition p  q (p if and only if q) is called a bi-conditional statement.
It is equivalent to ( p  q)  (q  p) .

Truth Value Table

p q pq
T T T
T F F
F T F
F F T

Examples:
Let p, q, and r represent the following.
p: You get a promotion.
q: You complete the training.
r: You will receive a bonus.
Write the following symbolic form into statements.
a. p v q
b. p  q
c. r  q
d. q  p

PDM Page 7 of 10
GE-MMW - Mathematics in the Modern World
e. q p

Answers:
a. You get a promotion or you complete the training.
b. If you get a promotion, the you complete the training.
c. You will receive a bonus if and only if you complete the training.
d. If you will not complete the training, then you will not get a promotion.
e. If you will complete the training, then you will get a promotion.

Consider the following simple statements.

p: Today is Friday.
q: It is raining.
r: I am going to a movie.
s: I am not going to the basketball game.

Write the following compound statements in symbolic form.

a. Today is Friday and it is raining.
b. It is not raining and I am going to a movie.
c. I am going to the basketball game or I am going to a movie.
d. If it is raining, then I am not going to the basketball game

Answers:
a. p  q
b. q  r
c. s  r
d. q  r

Tautology, Contradiction and Contingency

A tautology is a statement that is always true.

A contradiction is a statement that is always false.
A contingency is a statement that is neither a tautology nor a contradiction.

Example: 1. Show that p  (p  q) is a tautology.

Solution:
p q p p  q p  (p  q)
T T F T T
T F F F T
F T T T T
F F T T T

Since the results in the last column are all TRUE, then the given proposition is a tautology.
2. Determine if the given is a tautology, contradiction or contingency: (p  r )  ( p  r ) .
p r p p  r pr (p  r )  ( p  r )
T T F F T F
T F F F T F
F T T T T T
F F T F F T
Since the results in the last column are TRUE and FALSE, then the given proposition is a contingency.

PDM Page 8 of 10
GE-MMW - Mathematics in the Modern World

Let proposition p be True and proposition q be False. Find the truth value of the following.
1. p  p
TɅF
False

2. p  ( p  q)
F V (T  F)
FVF
False

Quantifiers and Negation

Existential quantifiers
- there exists and at least one
- used as prefixes to assert the existence of something.
Universal quantifiers
- none, no, all, and every
- none and no deny the existence of something
- all and every are used to assert that every element of a given set satisfies some condition

Quantifiers are used to described the variable/s in a statement.

1. Universal quantifier means “for all”, “for every”
written denoted by  .
2. Existential quantifier means “there exist”, “for some”
written denoted by  .

Quantified Statements and Their Negations

Statement Negation
All X are Y. Some X are not Y.
No X are Y. Some X are Y.
Some X are not Y. All X are Y.
Some X are Y. No X are Y.

Write the negation of each of the following statements.

a. Some airports are open.
b. All movies are worth the price of admission.
c. No odd numbers are divisible by 2.

Answers:
a. No airports are open.
b. Some movies are not worth the price of admission.
c. Some odd numbers are divisible by 2.

VI. ADDITIONAL RESOURCES:

 https://www.youtube.com/watch?v=dwKfiXGdo1A
 https://www.youtube.com/watch?v=6BxufcZ_OmM
 https://www.youtube.com/watch?v=NKCZDbA-JcM
 https://www.youtube.com/watch?v=1LUOJqlu81c

PDM Page 9 of 10
GE-MMW - Mathematics in the Modern World

VII. ASSESSMENT
(To be given in a separate worksheet)

VIII. REFERENCES
 Aufmann, R.N., et’al (2013). Mathematical Excursions, Third Edition. CA:Brooks/Cole, Cengage
Learning.
 Nocon, R.C. and Nocon, E.G.(2016). Essential Mathematics for the Modern World First Edition.
Quezon City: C & E Publishing Inc.

PDM Page 10 of 10