Mathematical Language and Symbols
Mathematical Language and Symbols
• Precise
• Concise
• Powerful
• Nontemporal
• Has vocabulary and parts of speech
Parts of Speech for Mathematics
❖Mathematics has syntax and structure which can be categorized into five
forms:
❖Numbers – very first symbols that can be used to represent quantity. These are nouns
(objects) in the English language.
❖Operation symbols like +,Ʌ, and ꓦ can act as a connectives in a mathematical sentences.
❖Relation symbols such as =, ≤ and ~ are used for comparison and act as a verbs in the
mathematical language.
❖Grouping symbols such as (), {}, and [] are used to associate groups of numbers and
operators.
❖Variables are letters that represent quantities and act as pronouns.
• Mathematical expression refers to objects of
interest acting as the subject in the ordinary
language. A sentence with a complete thought
is a mathematical sentence which can be
regarded as true or false.
Example 1
1. The following are examples of mathematical expressions:
• 4, -5,5+2,2e (All do not state complete thoughts)
2. The following are mathematical sentences:
a. 5 plus 2 is equal to the square root of 49.
5+2= 49 Here the symbol “+” is a connective while “=“ is the verb.
The sentence is true.
b. 10 divided by 2 is less than 3.
10÷2<3, The symbol “÷” is connective while the operator “<“ act as the verb. The
statement is false.
Example 2
• Solution
• Which of the following are sentences/
• A. This is an English sentence with “is” as the verb.
• Manila is the capital of the Philippines, The truth value is T since it is true that Manila is the
capital of the Philippines.
• The province of Cavite.
• This is not a complete thought because it does
• The number 5 is a composite number, not contain any verb.
• (𝑥 + 1)2 • This is a mathematical sentence with “is” acting
as verb. The statement is false.
• 𝑥−1=3
• This is a mathematical expression which do not
contain any relational symbols.
• This is a mathematical sentence with a symbol
“=“ acting as verb, This sentence is true only for
x=10.
Basic Concepts of Mathematical
Language: Sets, Functions, and Binary
Operations
• Functions
SETS
• - is a collection of objects which are called • A function f assigns each element x of set
elements of the set. A to a unique element, y of set B. In
symbols, y= f(x)
• 2 ways to represents the elements of the
set • Can be described in the following ways:
• Roster Method lists down all the elements • Verbally
• Equations or formulas
• Set Builder Notation presents the elements
• Diagrams
by stating their common properties. It is
also useful when describing infinite sets.
• Ex. Set A is the set of counting numbers
greater than 6. Set notation:
• A=ሼ𝑥|𝑥 ∈ 𝑁 𝑎𝑛𝑑 𝑥 >
6ሽ 𝑤ℎ𝑒𝑟𝑒 𝑁 𝑖𝑠 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑐𝑜𝑢𝑛𝑡𝑖𝑛𝑔 𝑛𝑢𝑚𝑏𝑒𝑟𝑠.
BINARY Operations
• Is an operation that takes two input elements
from a set and gives a unique result that also
belongs to the same set. Ex. Operation addition,
3+5=8, “+” take two real number and gives result
to a real number.
BINARY Operations
• The binary operations * on a non-empty set A are functions from A × A to A. The
binary operation, *: A × A → A. It is an operation of two elements of the set
whose domains and co-domain are in the same set.
• Associative
The associative property of binary operations hold if, for a non-empty set A, we can write
(a * b) *c = a*(b * c). Suppose N be the set of natural numbers and multiplication be the
binary operation. Let a = 4, b = 5 c = 6. We can write (a × b) × c = 120 = a × (b × c).
Types of Binary Operations
• Distributive
Let * and o be two binary operations defined on a non-empty set A. The binary operations are distributive if a*(b o
c) = (a * b) o (a * c) or (b o c)*a = (b * a) o (c * a). Consider * to be multiplication and o be subtraction. And a = 2, b
= 5, c = 4. Then, a*(b o c) = a × (b − c) = 2 × (5 − 4) = 2. And (a * b) o (a * c) = (a × b) − (a × c) = (2 × 5) − (2 × 4) = 10
− 6 = 2.
• Identity
If A be the non-empty set and * be the binary operation on A. An element e is the identity element of a ∈ A, if a * e
= a = e * a. If the binary operation is addition(+), e = 0 and for * is multiplication(×), e = 1.
• Inverse
If a binary operation * on a set A which satisfies a * b = b * a = e, for all a, b ∈ A. a-1 is invertible if for a * b = b * a=
e, a-1 = b. 1 is invertible when * is multiplication.