Olsen R.

Palacay BSNED – 1D
Shanelle B. Escarola Januanry 28, 2022
Juztine F. Avenido Sub: MATH 100

Mathematical Language and Symbols

Language facilitates communication and mean-making. It allows the people to express
themselves and maintain the their own identity. Similarly, it unites people in the world despite of
the differences in their origin. Moreover, language can have characters taking the for example
the chinese characters or so called Mandarin, each characters symbolizes and mean something
may it be an object or relationships. The unfamiliar characteres of it may add to the difficulty in
learning Mandarin compare to learning Greek even if is also different from English alphabets.
And so as Mathematics, it is also a language because it has its own symbol system, the same way
like on how English or Greek have their own alphabet. Mathematical language is precise and
concise. Which means that the can make very fine distinctions and definitions among a set of
mathematical symbols and it can express long expositions or sentences briefly. It is powerful

numbers is also a real number” which can be written as ∀⍺,b ∊ ℝ, ⍺ + b ∊. Mathematics is a

because it can express complex thoughts easily. For example is, “the sum of any two real

symbolic language, such as ∀ for any,∈ for element,∉ for not element,⊆ as subject of, ⟹ if ….
Then, ⟺ if and only if, ℝ real numbers, ℕ set of natural numbers, ℤset of integers, ℚ set of
rational numbers, ∞ infinity and more. The said symbols can be used in solving problems for
speed acceleration and etc.. The language of mathematics has different uses may it be in the field
of science, business, politics, music, architecture, arts or even economics. It has a relation with
the English language. Furthermore, when you think about something you first identify what you
know and relate it with your existing knowledge and you do this mental task using the language.
So as Mathematics, you first look at the definition of the mathematical word or concept you have
heard. Then apply this concept based on the meaning attributed to it, most likely identifying
valid applications or operations of the concept. And through practices you now learned the rules
that governs the application. Comparably language such as Chinese, Greek and English can
sometimes create confusions, but not the language of mathematics because it is applicable,
understandable and universal use by all people around the world. And on the other hand, on the
Expressions and Sentences. A mathematical sentence, alike any English sentence, tells a

true or false but can never be both. Ɐx,y ∈R, x2 ≥0 is an example of a mathematical sentence
complete thought or states an understandable and clear idea. These types of sentences may be

that when translated to English states that: For any real number x, its square is greater than or
equal to 0, which is a true thought. The word “is” is usually used in translating or understanding
mathematical sentences and it could mean equality, inequality or membership in a set. On the
other hand, a mathematical expression is a mathematical object of interest. Examples of this
would be 1+2, an ordered triple (a,b,c), a function f(x), and a set (1,3,5). Numbers can all be
nominal numbers, cardinal numbers, and ordinal numbers. A number told to be a nominal
number is used as a name or to identify a thing. An example of a nominal number is the postal
zip code of Marilao being 3019, a shop with the name “680” is also a good example. Cardinal
numbers answer the question ‘how many?’ and are used in counting. Finally, ordinal numbers
state the position or order of things by the words first, second, third and so on. Mathematical
objects can also be expressed as sets and functions. Meanwhile, There are many Unary
Operations on R. For example, negation is a unary set operation that maps R→R, for example if f
is a function that takes a real number and negates it, then 5→−5, or −5→−(−5). Some are only
partially unary. One example is reciprocation on real numbers. Since 1/0 is undefined, R→R
except for 0.There are also many Binary Operations on the real numbers. Such operations take
two real numbers and produce another real number. If we let X denote a binary operation, then R
X R → R.For example, addition is a binary operation (e.g. 4 + 5 = 9). Subtraction and
multiplication are also some examples of binary operations.A binary operation is said to be

multiplication on the real numbers is said to be commutative since ∀ x, y ∈ R, x+y=y+x. A

commutative if a change in the order of the arguments results in equivalence. For example,

equivalent.For example, addition is associative since ∀x,y,z∈R, (x+y)+z=x+(y+z), for example,

binary operation is said to be associative if parentheses can be reordered and the result is

multiplication and addition. For example, on the real numbers ∀ x, y, z ∈ R, z(x+y)= zx + zy.
(1 + 2) + 3 = 1 + (2 + 3). Distributivity of Binary Operations applies when we combined

That is we have distributed the term z over the sum (x + y). Identity Elements of Binary
Operations. An element e is said to be an identity element (or neutral element) of a binary
operation if under the operation any element combined with e results in the same element. One
common example arises in addition on real numbers when our identity element e is 0. That is
x+e=x only when e = 0. The identity element is not always 0 though. In multiplication on real
numbers, xe=x only when our identity element e is 1, and if A is an mxm square matrix then
Ae=A only if e is the mxm identity matrix Imxm. Inverses of Binary Operations. For an element
x, the inverse denoted x−1 when combined with x under the binary operation results in the

element is 0. Hence x+x−1=0 only when our inverse is -x since ∀ x ∈ R, x+(−x)=0.

identity element for that binary operation. For example, for addition on real numbers, the identity

Other than those, there are also some fundamentals of logics like, Proposition,
disagreement revolves around when there is a disagreement between to parties and in some cases
theis because of the failure to present logical evidences or not being able to convince the other
contending side. Hence, in mathematics, to avoid this from happening and uphold certainty and
validity of mathematical statements, mathematics employs a powerful language of logic in
asserting truths of statements. The use of logic illustrates the importance of precision and
conciseness in communicating mathematics. Thus, here comes proposition in mathematics.
Many time propositions are made in people’s statements that can be either true of false and even
neither of them. Proposition in mathematics can also be true or false or perhaps both of them are
also not. Taking for example 9 is a prime number or 5+3= 8 are they true of false? A truth table
is a table that displays the truth value of a compound statement for each of its simple statements’
possible truth values. Negation is if the word is not introduced in the negative statement, the

P’ or -P. Implication is the compound statement of the form “if p , then q .” It is denoted p ⇒q ,
statement is a negation of another. Take P and make it a proposition wherein its negation is ‘not

which is read as “ p implies q .” It is false only when p is true and q is false, and is true in all
other situations. The statement p in an implication p⇒q is called its hypothesis, premise, or
antecedent, and q the conclusion or consequence. Implications come in many disguised forms.

only if q , q if p , q provided that p .All of them mean p ⇒q . An implication and its

There are several alternatives for saying p⇒q . The most common ones are P implies q , P

contrapositive is not always have the same truth value, we know p⇒q is true, there is no
guarantee that q⇒p is also true. Accordingly, if you only know that p⇒q is true, do not
assume that its converse q⇒p is also true. Likewise, if you are asked to prove that p⇒q is
true, do not attempt to prove q⇒p , because these two implications are not the same. They are
completely different from the ones we have seen thus far. They focus on whether we can tell one
of the two components p and q is true or false if we know the truth value of the other. P is a
sufficient condition for q, Q is a necessary condition for p . Sufficient condition⇒necessary
condition. The idea is, assuming that p⇒q is true, then tor q to be true, it is enough to know or
show that p is true. Hence, knowing p is true alone is sufficient for us to draw the conclusion
the q must also be true. For p to be true, it is necessary to have q be true as well. Compound
Quantifier. Recall that a formula is a statement whose truth value may depend on the values of
some variables. For example,“x≤5∧x>3’’ Is true for x=4 and false for x=6. Compare this with
the statement “For every x, x≤5∧x>3,’’ Which is definitely false and the statement “There exists

x’’) is called a universal quantifier and is denoted by ∀x. The phrase “there exists an x such
an x such that x≤5∧x>3,’’ Which is definitely true. The phrase “for every x’’ (sometimes “for all

that’’ is called an existential quantifier and is denoted by ∃x. A formula that contains variables is
not simply true or false unless each of these variables is bound by a quantifier. If a variable is not
bound the truth of the formula is contingent on the value assigned to the variable from the

same for ∀xP(x) and ∃xP(x), though the intended meanings of these are clear. The Universal
universe of discourse. To define the truth values of compound statements precisely. We do the

Quantifier. A sentence ∀xP(x) is true if and only if P(x) is true no matter what value (from the
universe of discourse) is substituted for x. The Existential Quantifier. A sentence ∃xP(x) is true
if and only if there is at least one value of x (from the universe of discourse) that makes P(x)
true.