Mathematics

in the Modern World

Model of Learning Mathematics (Role of Language)
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
Role of Mathematical Language in Learning Mathematics
 Section 1
Mathematics as a Language
Characteristics of mathematical language
• PRECISE: it can be stated clearly
• CONCISE: it can be stated briefly
• POWERFUL: can express complex ideas into simpler forms
• NONTEMPORAL (no tense): this makes the language unique as
compared to other languages
• COMPREHENSIVE: has vocabulary and parts of speech
Parts of Speech in Mathematics
1. Numbers – play the role of nouns (objects), used to represent
quantity
2. Operations Symbols – act as connectives in mathematical sentence
(e.g., +, ÷, ∨, ∧, …)
3. Relation Symbols – used for comparison and act as verbs
(e.g., =, <, ≥, ∼, ≅, …)
4. Grouping Symbols – used to gather and cluster a group of number
and operators)
5. Variables – letters or symbols that represent quantities, act as
pronouns
Mathematical Expression and Sentence
Mathematical Expression : objects of interest, the subject in
the ordinary language

Mathematical Sentence : a statement that combines

mathematical expressions to form a complete
thought, it can regarded as true or false
Examples
Mathematical Expressions: 4, -5, 5 + 2, 2x, 5𝜋

Mathematical Sentence:
5 plus 2 is equal to the square root of 49
5 + 2 = 49

==> “+” is the connective

==> “=” is the verb
==> sentence is TRUE
Exercise: Answer Exercise 1.1 page 41-42.
 Section 2
Basic Concepts of
Mathematical Language
At the end of this lesson, students should be able to:

1. 2. 3. 4.
perform binary operations
know and identify if a given set is a
represent function.
on sets.
demonstrate
understanding of
sentences using
the basic concepts set notations
in sets, functions
and binary
operations.
SETS

Set : a well-defined collection of “objects”

Notations:
a ∈ S, a ∉ S ==> object “a” belongs (resp. does not
belong) to the set S
Methods of Writing Sets
1. Roster Method : elements are listed down or enumerated
==> appropriate when set is finite
ex: S = {a1, a2, a3, …}

2. Set Builder Notation : specifies the common property of the

elements
==> appropriate for infinite sets
Format: S = { x : x is “__________” }
Functions
Function : a rule that assigns elements of one set to another
set
If A and B are sets, then a function 𝑓 from A to B assigns
each element 𝑥 of A to a unique element 𝑦 of B.

Notation: 𝑦 = 𝑓(𝑥)
Writing Functions
Let A = {1,2,3,4} and B={2,3,4,5}. Define a function 𝑓 which
assigns each element of A to an element of B by increasing the
value by 1.

1. Set Notation : 𝑓 = { 1,2 , 2,3 , 3,4 , 4,5 }

2. Tabular form:

𝒙 1 2 3 4
𝑦 2 3 4 5
Writing Functions
Let A = {1,2,3,4} and B={2,3,4,5}. Define a function 𝑓 which
assigns each element of A to an element of B by increasing the
value by 1.

3. Mapping form 1 2
(Diagram) 2 3
3 4
4 5
f
A B
Writing Functions
Let A = {1,2,3,4} and B={2,3,4,5}. Define a function 𝑓 which
assigns each element of A to an element of B by increasing the
value by 1.

4. Formula: 𝑦 = 𝑓 𝑥 =𝑥+1
𝑦=𝑓 1 =1+1=2
𝑦=𝑓 2 =2+1=3
𝑦=𝑓 3 =3+1=4
𝑦=𝑓 4 =4+1=5
Binary Operation
A binary operation is an operation that takes two input elements from
a set and gives a unique result that also belongs to the same set.

Example: 3 + 5 = 8
==> the operation “+” takes two real numbers 3 and 5 and gives
the result 8 which is also a real number
Binary Operation
More formally, a binary operation on a set 𝑆 is a mapping
denoted by ∗ which assigns to each ordered pair of elements of 𝑆 a
uniquely determined element of 𝑆. The set 𝑆 is said to be closed under
the operation ∗ which means taking the binary operation with any two
elements of 𝑆 will give a result that belongs also to 𝑆.

A binary operation ∗ on a set S is a function on 𝑆 × 𝑆:

∗∶ 𝑆 × 𝑆 → 𝑆
(a,b) ---> c
Properties of Binary operation
1. Closure property: For 𝑎, 𝑏 ∈ S , 𝑎 ∗ 𝑏 ∈ 𝑆
2. Commutative Property: 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎
3. Associative Property : 𝑎 ∗ 𝑏 ∗ 𝑐 = 𝑎 ∗ (𝑏 ∗)
4. Identity element: There is an element 𝑒 ∈ 𝑆 (unique) such that
𝑒∗𝑎 =𝑎∗𝑒 =𝑎
5. Inverse element: For each 𝑎 ∈ 𝑆 we can find 𝑏 ∈ 𝑆 such that
𝑎∗𝑏 =𝑏∗𝑎 =𝑒
Example: S = set of real numbers
The usual addition “+” is a binary operation in the set of real numbers.
==> it is closed
==> it is commutative
==> it is associative
==> the identity element is 0
==> the additive inverse of 𝑎 ∈ 𝑅 is −𝑎 since 𝑎 + −𝑎 = 0

The usual product “×” is also a binary operation that is closed,

commutative and associative. The identity element is 1 and the
−1 1
multiplicative inverse of 𝑎 ∈ 𝑅 is 𝑎 or (called the reciprocal).
𝑎
Example: S = set of natural numbers (N)
Define 𝑎 ∗ 𝑏 = 𝑎𝑏 .

Is N closed under ∗ ?

Is ∗ commutative? Associative?

What is the identity element?

What is the inverse element of 𝑛 ∈ 𝑁?

Exercises:
Exercise 2.1
Exercise 2.2
Exercise 2.3 .
 Section 3
Mathematical Logic
This section deals with the relationship
between the natural language and the
mathematical language using symbols
and variables.

Intended Learning Outcomes:

At the end of this lesson, students should be able to:

1. write statements in symbolic forms.
2. write symbolic statements in words.
3. construct a truth table for a given compound
statement.
4. Use truth table for logical equivalence.
5. write a conditional statement in other forms.
Statements

Symbolic logic is a powerful tool for analysis and

communication in mathematics. It represents the natural
language and mathematical language with symbols and
variables. The main parts of symbolic logic are statements and
connectives.
Statements

A statement (or proposition) is an assertion which can be

regarded as true or false. A statement is simple if it conveys a
single thought, otherwise, it is a compound statement.

A compound statement is formed by using logical

connectives.
Compound Statements
Proposition
Connectives Symbols Example Read
Type
Negation ~
Not ~𝑝 Not p (p is false)
p and q
And/But conjunction ∧ 𝑝∧𝑞
(both p and q are true)
p or q
Or disjunction ∨ 𝑝∨𝑞 (Either p is true or q is true
or both are true)
If p then q
Implies Conditional → 𝑝→𝑞
p implies q and q implies p
If and only if Biconditional ↔ 𝑝↔𝑞 p if and only if q
Example
Consider the following statements.
ℎ: Harry is not happy. 𝑣: Harry is going to watch a volleyball game.
𝑟: It is going to rain. 𝑠: Today is Sunday.
Write the following compound statements in symbolic form.
a) Today is Sunday and Harry is not happy.
b) Today is Sunday and Harry is not going to watch a volleyball game.
c) If it is going to rain, then Harry is not going to watch a volleyball game.
d)Harry is going to watch a volleyball game if and only if he is happy.
e) Harry is happy only if it is not going to rain.
f) Harry is going to watch a volleyball game or it is going to rain.
Example (Answers)
Consider the following statements.
ℎ: Harry is not happy. 𝑣: Harry is going to watch a volleyball game.
𝑟: It is going to rain. 𝑠: Today is Sunday.
Write the following compound statements in symbolic form.
a) 𝒔 ∧ ∼ 𝒉
b) 𝒔 ∧ ∼ 𝒗
c) ∼ 𝒓 → ~𝒗
d) 𝒗 ↔∼ 𝒉
e) ∼ 𝒉 →∼ 𝒓
f) 𝒗 ∨ 𝒓
Example

Convert the following symbolic statements into words given the

following propositions.
p : Gian plays volleyball. q : Lanz plays basketball.
a) ~𝑝
b) 𝑝 ∧ 𝑞
c) 𝑝 → ~𝑞
d) 𝑝 ∨ (~𝑝 → 𝑞)
Example (Answers)

Convert the following symbolic statements into words given the

following propositions.
p : Gian plays volleyball. q : Lanz plays basketball.
a) Gian does not play volleyball.
b) Gian plays volleyball while Lanz plays basketball.
c) If Gian plays volleyball then Lanz does not play basketball.
d) Gian plays volleyball or if Gian does not play volleyball then Lanz plays
basketball.
Example:
Given, s : A polygon has three sides.
t : A polygon is a triangle.
Write the given statement in symbolic form.
“A polygon having three sides is a necessary and sufficient condition for a polygon to be a triangle”

Answer: 𝑠↔𝑡

The conditional statement, 𝑝 𝑎𝑛𝑡𝑒𝑐𝑒𝑛𝑑𝑒𝑛𝑡 → 𝑞(𝑐𝑜𝑛𝑠𝑒𝑞𝑢𝑒𝑛𝑡) is equivalent to any of the following:

e. Every p is q.
a. If p, then q.
f. q, if p.
b. p imlies q.
g. q provided that p.
c. p only if q.
h. q is a necessary condition for p.
d. Not p or q.
i. p is a sufficient condition for q.
Example:
Consider the following statements.
𝑝: 𝑥 is a prime number.
𝑞: 𝑥 is odd.
Formalize the following statements.
𝑎. 𝑥 being prime is a sufficient condition for 𝑥 being odd.
𝑏. 𝑥 being odd is a necessary condition for 𝑥 being prime.

Solution
𝑝→𝑞
𝑝→𝑞
Example:
Write each statement in the form “If p, then q”.
a. I will be able to tour abroad next year provided that I have my passport renewed.
b. Every triangle that is not a right triangle is an oblique triangle.

Solution
a. If I have my passport renewed then I will be able to tour abroad next year.
b. If a triangle is not a right triangle then it is an oblique triangle.

If the conditional statement is given by 𝑝 → 𝑞 then the following are three related
statements.

Converse : 𝑞→𝑝
Inverse : ~𝑝 → ~𝑞
Contrapositive: ~𝑞 → ~𝑝
Example:
Write the converse, inverse, and contrapositive of the given sentence.
“She is allowed to join the volleyball team, only if she knows how receive the ball.”
Solution

𝒑 → 𝒒 : If she is allowed to join the volleyball team, then she knows how to receive the ball.

Converse: If she knows how to receive the ball, then she is allowed to join the volleyball team.

Inverse: If she is not allowed to join the volleyball team, then she does not know how to
receive the ball.

Contrapositive: If she does not know how to receive the ball, then she is not allowed to
join the volleyball team.
Example:
Write the converse, inverse, and contrapositive of the given sentence.
“ Every rectangle is a parallelogram”
Solution
𝑝→𝑞 : If it is a rectangle, then it is a parallelogram.

Converse: If it is a parallelogram, then it is a rectangle.

Inverse: If it is not a rectangle, then it is not a parallelogram.

Contrapositive: If it is not a parallelogram, then it is not a rectangle.

Propositional Logic

Recall: A proposition is a statement that is either “true” of “false”.

Examples:
1) p: 1 is a prime number
truth value: F
2) q: The BS Civil Engineering program in Mapua is
ABET accredited.
truth value: T
Propositional Logic

Propositional logic is concerned with the evaluation of the “truth

value” of a (simple or compound) proposition. If a proposition is true,
then its truth value is assigned “T” (or “1”), otherwise, it is “F” (or “0”).
For compound propositions, the truth value may be determined by
using truth tables, which shows all possible combinations of the truth
values of the component (simple) propositions and the corresponding
truth value of the entire compound proposition.
Truth Tables
A. Assertion B. Negation C. Conjunction

p p ~𝑝 p 𝑞 𝑝∧𝑞

T T F T T T
F T T F F
F
F T F
F F F

D. Disjunction E. Conditional F. Biconditional

p 𝑞 𝑝∨𝑞 p 𝑞 𝑝→𝑞 p 𝑞 𝑝↔𝑞

T T T T T T T T T
T F T T F F T F F
F T T F T T F T F
F F F F F T F F T
Example:
Construct the truth table for the compound statement. (𝑝 ∨ 𝑞) ∧ ~ 𝑝

Solution:
Applying the basic rules discussed previously, we obtain the following table.

p 𝑞 𝑝∨𝑞 ~𝑝 (𝑝 ∨ 𝑞) ∧ ~ 𝑝

T T T F F
T F T F F
F T T T T
F F F T F
Logical Equivalence
Two mathematical statements are logically equivalent if the final output of their truth tables are exactly alike.

Example:
Verify that the statements 𝑝 → 𝑞 and ~𝑝 ∨ 𝑞 are logically equivalent. What is the logical content equivalent of
“If the price is right then I will accept the job offer”?
Solution
We construct the truth table to show equivalence.

p 𝑞 ~𝑝 𝒑→𝒒 ~𝒑 ∨ 𝒒

T T F T T
Since the last two columns are identical, the given statements are
T F F F F
logically equivalent.
F T T T T
F F T T T Using the above results, the logical content equivalent of “If the price is
right then I will accept the job offer” is “The price is not right or I will
accept the job offer”.
Exercise: Show, using truth table, that an
implication is logically equivalent to its
contrapositive (but not to its converse and
inverse).
Predicate Logic
Recall: a proposition is a statement that is either true or false
A predicate is a proposition that contains one or more
variables. Thus, a predicate is a proposition with parameters.
Example:
Proposition: “p: 2 is even”
Predicate: “p(x): x is even”
Predicate logic deals with “sets of entities” (as compared to
propositional logic – deals with propositions with
specific domain)
Quantifiers in Predicate Logic
1. Universal : “all”, “every”
Symbolism: If S is a set and P(x) is a statement about the
element x, then the expression
∀𝑥𝜖𝑆 𝑃(𝑥)
means “For all x in S, P(x) is true” or “P(x) is true for
every x in S”.
Quantifiers in Predicate Logic
2. Existential : “some”, “there exists”
Symbolism: If S is a set and P(x) is a statement about the
element x, then the expression
∃𝑥𝜖𝑆 𝑃(𝑥)
means “There exists x in S for which P(x) is true” or
“There is at least one x in S for which P(x) is true for”.
Translating quantified statements
1. Every odd integer is a prime number.
Symbolism: ∀𝑥, 𝑖𝑛𝑡𝑒𝑔𝑒𝑟(𝑥, 𝑜𝑑𝑑 → 𝑥, 𝑝𝑟𝑖𝑚𝑒)
or ∀𝑥𝜖𝑍(𝑜 𝑥 → 𝑝 𝑥 )
Here, we use ``𝑜(𝑥)′′ to symbolize “x is odd” while
“𝑝(𝑥)” means “𝑥 is prime”
Common Mistake: ∀𝑥𝜖𝑍(𝑜 𝑥 ⋀ 𝑝 𝑥 )
Truth Value : False or “F” (why?)
Translating quantified statements
2. Some right triangles are also isosceles.
Symbolism: ∃𝑥, 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒(𝑟(𝑥) ∧ 𝑖(𝑥))
Common Mistake: ∃𝑥, 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒(𝑟 𝑥 → 𝑖 𝑥 )
Truth Value : True or “T”
Translating quantified statements
3. No real number is divisible by 0.
Symbolism: ∀𝑥(𝑥𝜖R) → ~𝑑 𝑥
Here, we use ``𝑑(𝑥)′′ to symbolize “x is divisible by 0”
Common Mistake: ~∃𝑥(𝑟 𝜖 R ⋀ 𝑑 𝑥 )
Truth Value : T
Translating quantified statements
4. Not every real number is divisible by 0.
Symbolism: ~∀𝑥(𝑥𝜖R → 𝑑 𝑥 )
Common Mistake: ∃𝑥(𝑟 𝜖 R ⋀ ~𝑑 𝑥 )
Truth Value : F
Exercise: Write in symbols
1. Lahat ng Mapuan ay magaling sa Math.
2. Walang Mapuan na bobo sa Math.
3. Hindi lahat ng Mapuan ay magaling sa Math.
More Examples
1. An integer 𝑥 is even if there exists an integer 𝑦 such that
𝑥 = 2𝑦
Symbolism: (∃𝑦 𝜖 Z(𝑥 = 2𝑦)) → 𝑥, 𝑒𝑣𝑒𝑛
or: (∃𝑦 𝜖 Z(𝑥 = 2𝑦)) → 𝑒(𝑥)

2. An integer 𝑥 is odd if there exists an integer 𝑦 such that

𝑥 = 2𝑦 + 1
Symbolism: (∃𝑦 𝜖 Z(𝑥 = 2𝑦 + 1)) → 𝑥, 𝑜𝑑𝑑
or: (∃𝑦 𝜖 Z(𝑥 = 2𝑦 + 1)) → 𝑜(𝑥)
Logical Equivalences in Predicate Logic
1. ~∀𝑥 𝑃 𝑥 ↔ ∃𝑥(~𝑃 𝑥 )
Example: “Not all college graduates have good manners” is
equivalent to any of the following:
“There are some college graduates who does not
have good manners”
“There exists a college graduate who has no
good manners”
Logical Equivalences in Predicate Logic
2. ∀𝑥 𝑃 𝑥 ↔ ~∃𝑥(~𝑃 𝑥 )
Example: “All college graduates have good manners”
is equivalent to any of the following:
“There are no college graduates who does not
have good manners”
“It is not true that there are some college
graduates who have no good manners”
Logical Equivalences in Predicate Logic
3. ~∀𝑥 ~𝑃 𝑥 ↔ ∃𝑥(𝑃 𝑥 )
Example: provide!
Logical Equivalences in Predicate Logic
4. ∀𝑥 ~𝑃 𝑥 ↔ ~∃𝑥(𝑃 𝑥 )
Example: provide!