Mathematical Language
Mathematical Language
LANGUAGE
Language
Language is “a systematic
means of communicating by the use of
sounds or conventional symbols”(Chen,
2010, p.353)
Components of Language
a vocabulary of symbols or words
a grammar consisting of rules on the use
of these symbols
a community of people who use and
understand these symbols
a range of meanings that can be
communicated with these symbols
Vocabulary
Range of meanings
Mathematical Language
& Symbols
A. Characteristics
Precise
- be able to make very fine distinctions
Concise
- use symbols to be able to express
more
Powerful
- be able to express complex thoughts
with relative ease
MATHEMATICS
Mathematics is a system of
communication about objects like numbers,
variables, sets, operations, functions and
equations. It is a collection of both symbols
and their meaning shared by a global
community of people who have an interest
in the subject.
Elements of the Mathematical
Language
Like other languages, mathematics
has nouns, pronouns, verbs and sentences. It
has its own vocabulary, grammar, syntax,
synonyms, negations, sentence structure,
paragraph structure, conventions and
abbreviations.
Illustration
Even though the words “noun”, “verb”, or
“pronoun” are not used in Mathematics, the
similarities with the English language can be
observed:
Nouns could be constants, such as
numbers or expressions with numbers.
A verb could be the equal sign =, or the
inequality symbols like < or >.
Pronouns could be variables like x or y.
Elements of the
Mathematical Language
Mathematics uses many symbols.
There are ten digits (0,1,2,3,…,9), symbols
for operations ( +, −,×,÷), symbols that
represent values (x,y,z,etc.) and many other
special symbols (=, <, ≠, 𝜋 etc.).
Letters often (but not always) have
special uses as follows:
Start of the a,b,c For constants
alphabet (fixed values)
From i to n i,j,k,n Positive
integers(for
counting)
End of the x,y,z For variables
alphabet (unknowns)
Illustration
In the equation 𝑦 = 𝑎𝑥 + 𝑏, it is
assumed that a and b are constants and x is
a variable whose value changes, which in
turn makes the variable y change its value as
well.
Mathematical Language
6
& Symbols
Noun Sentence
(name given to object (must state a complete
of interest thought)
MATHEMATICS
Expression Sentence
(name given to (must state a complete
mathematical object of thought)
interest
• Number
• TRUE :1+ 2 =3
• Set
• FALSE: 1+2 =4
• Ordered pair
• ST/SF :x=1
• Average
Mathematical Language
8
& Symbols
B. Conventions in the
Mathematical Language
Ideas Regarding Expressions
Mathematical Sentence
A mathematical sentence is the
analogue of an English sentence; it is a
correct assignment of mathematical
symbols that states a complete thought.
Mathematical Language
11 &Symbols
Activity
2.1.docx
Mathematical Language
14 &Symbols
Variable
A variable is any letter used to
stand for a mathematical object.
Mathematical Language
20 &Symbols
Sets
Definition of a Set
Methods of naming a set
Properties of Sets
Operation on Sets
Venn Diagram
22
Relations
A relation is a correspondence between
two things or quantities. It is a set of ordered
pairs such that the set of all first coordinates
of the ordered pairs is called Domain and
the set of all the second coordinates of the
ordered pairs is called Range.
A relation maybe expressed as a statement,
arrow diagram, table, equation, set-builder
notation and graph.
Example: R={(1, 2), (2, 4), (3, 6), (4, 8), (5,10)}
Mathematical Language
25
&Symbols
Types of Relations
1.one - to –one relation
2.one –to –many relation
3. many –to –one relation
Functions
A function is a relation such that each
element of the domain is paired with exactly one
element of the range. To denote this relationship,
we use the functional notation:
y =f(x)
where f indicates that a function exists between
variables x and y.
Mathematical Language
28 &Symbols
Evaluating Functions
The functional notation y = f(x) allows us to
denote specific values of a function. To
evaluate a function is to substitute the specified
values of the independent variable in the
formula and simplify.
Example:
When f(x) =2x –3, find f(2)
Solution:
f(2) =2(2) –3 =4 – 3
f(2) =1
Mathematical Language
30 &Symbols
Inverse of a Function
The inverse of a function is another
function that undoes it, and that it undoes.
For example, the function that takes a
number n to n – 5 is the inverse of the function
that takes n to n +5.
Binary Operations
Possible activity:
Video Watching
Math isn't hard_ it's a language _ Randy
Palisoc _TEDxManhattanBeach.mp4
Propositional Calculus
A proposition is a complete declarative
sentence that is either true or false, but not
both.
Illustration
1. Manila is the capital of the Philippines.
2. Shanghai is the capital of China.
3. 1 + 1 = 2
4. 2 + 2 = 3
Illustration
1. Is it time?
2. Pay attention to this.
3. 𝑥 + 1 = 2
4. 𝑥 + 𝑦 = 𝑧
Compound Propositions
Propositions built up by combining
propositions using propositional connectives
are called compound propositions.
Propositional Connectives
A propositional connective is an
operation that combines two propositions
to yield a new one whose truth value
depends only on the truth values of the two
original propositions.
The propositional connectives ∧,∨
, ۩, ⇒, and ⟺ are called conjunction,
disjunction, exclusive or, implication, and
biconditional respectively.
Example
Let p and q be the propositions “Today is
Friday” and “It is raining today”, respectively.
Find
(a)𝑝 ∧ 𝑞
(b) 𝑝 ∨ 𝑞
(c) 𝑝 ⇒ 𝑞
(d)𝑝 ⇔ 𝑞
Negation
The expression ¬𝑝 is read as
“not p”. The symbol ¬ is called the negation
connective. It should be noted that ¬ is a
unary rather than a binary connective.
Example
Find the negation of the proposition “Today
is Friday.”
Tautology, Contradiction and
Contingency
Tautology
A compound proposition that is always true,
regardless of the truth values of the
propositions that occur in it, is called a
tautology.
Example: 𝑝 ∨ ¬𝑝
Contradiction
A contradiction is a compound proposition
that is always false.
Example: 𝑝 ∧ ¬𝑝
Contingency
Contingency is neither a tautology nor a
contradiction.
Example: ¬(𝑝 ∨ 𝑞)
Logical Equivalent Statements
Logical Equivalent Statements are
statements with the same truth value(s).
Example:
1. Prove that¬(𝑝 ∨ 𝑞) and ¬p ∧ ¬q are
logically equivalent.
Logical Equivalence Laws
Implications
In an implication of the form
𝑝 ⇒ 𝑞, the proposition p is called the
hypothesis (or the antecedent) and the
proposition q is called the conclusion (or
the consequence).