Pamantasan NG Cabuyao College of Education, Arts and Sciences
Pamantasan NG Cabuyao College of Education, Arts and Sciences
LEARNING MATERIAL
FOR WEEK NUMBER:
3-4
I. TITLE: Module 2: Mathematical Language and Symbols
Section 1 : Mathematics as a Language
Section 2: Basic Concepts of Mathematical Language: Sets, Functions , and Binary
Operations
Section 3: Mathematical Logic
III. INTRODUCTION: In everyday living, we may encounter and even use expressions in English that may
connote mathematical values or symbols without our knowing it. These encounters
include riding a vehicle, re-loading cellular phones in a station; buying a particular
items from a store; taking allowances from parents or guardians; expectations of
grades in a particular subject; number of friends in Social Media who are sincere,
honest, or the opposite; friends who like a photo uploaded on Facebook; number of
crushes in this school; number of hours spent using the Internet; and many more.
The translation of these encounters into mathematical expressions and vice versa,
however, is found to be a little complicated, especially if our knowledge of English
grammar is limited.
IV. CONTENTS:
SECTION 1
Definition of Language:
Language – is a systematic way of communication with other people use of sounds or convention symbols.
Importance of Language:
1. Language was invented to communicate ideas to others.
2. The language of mathematics was designed:
Numbers
Sets
Functions
Perform operations
A 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
a. The following are examples of mathematical expressions:
4, - 5, 5 + 2, 2e
b. The following are mathematical sentences:
1. 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.
Test yourself:
Which of the following are sentences?
1. Manila is the capital of the Philippines.
2. The province of Cavite
3. The number 5 is a composite number.
4. x 12
5. x 1 3
SECTION 2
Example: 1
Set A is the set of counting numbers less than 6.
Set notation: A = {1, 2, 3, 4, 5}
This is finite set with cardinality of 5.
Example: 2
Set B is the set of positive even integers greater than 8.
Set notation: B = {10, 12, 14, …}
B is an infinite set which uses dots to denote infinite sequence.
2. Set Builder Notation – presents the elements by stating their common properties. It is also useful when
describing infinite sets.
Example: 3
Set A is the set of counting numbers greater than 6.
Set notation: A ={x/x N and x 6 } Where N is the set of counting numbers.
It is read as “The set of all x such that x is a counting number and greater than 6.”
SUBSET
A subset of a set A is another set that contains only elements from the set A, but may not contain all the
elements of A.
If B is a subset of A, we write B ⊆ A
A proper subset is a subset that is not identical to the original set—it contains fewer elements.
If B is a proper subset of A, we write B ⊂ A
Example:
Consider these three sets:
A = the set of all even numbers
B = {2, 4, 6}
C = {2, 3, 4, 6}
The union of two sets contains all the elements contained in either set (or both sets). The union is
notated A ⋃ B. More formally, x ∊ A ⋃ B if x ∈ A or x ∈ B (or both)
The intersection of two sets contains only the elements that are in both sets. The intersection is
notated A ⋂ B. More formally, x ∈ A ⋂ B if x ∈ A and x ∈ B.
The complement of a set A contains everything that is not in the set A. The complement is notated A’, or Ac,
or sometimes ~A.
Example.
Consider the sets:
A = {red, green, blue}
B = {red, yellow, orange}
C = {red, orange, yellow, green, blue, purple}
Answers
1. The union contains all the elements in either set: A ⋃ B = {red, green, blue, yellow, orange} Notice we only
list red once.
2. The intersection contains all the elements in both sets: A ⋂ B = {red}
3. Here we’re looking for all the elements that are not in set A and are also in C. Ac ⋂ C = {orange, yellow,
purple}
UNIVERSAL SET
A universal set is a set that contains all the elements we are interested in. This would have to be defined by
the context.
A complement is relative to the universal set, so Ac contains all the elements in the universal set that are not
in A.
Example: 1
1. If we were discussing searching for books, the universal set might be all the books in the library.
2. If we were grouping your Facebook friends, the universal set would be all your Facebook friends.
3. If you were working with sets of numbers, the universal set might be all whole numbers, all integers, or all
real numbers
Example: 2
Suppose the universal set is U = all whole numbers from 1 to 9. If A = {1, 2, 4}, then Ac = {3, 5, 6, 7, 8, 9}.
Example: 3
Suppose H = {cat, dog, rabbit, mouse}, F = {dog, cow, duck, pig, rabbit}, and W = {duck, rabbit, deer, frog, mouse}
1. Find (H ⋂ F) ⋃ W
2. Find H ⋂ (F ⋃ W)
3. Find (H ⋂ F)c ⋂ W
Solutions
1. We start with the intersection: H ⋂ F = {dog, rabbit}. Now we union that result with W: (H ⋂ F) ⋃ W = {dog,
duck, rabbit, deer, frog, mouse}
2. We start with the union: F ⋃ W = {dog, cow, rabbit, duck, pig, deer, frog, mouse}. Now we intersect that
result with H: H ⋂ (F ⋃ W) = {dog, rabbit, mouse}
3. We start with the intersection: H ⋂ F = {dog, rabbit}. Now we want to find the elements of W that
are not in H ⋂ F. (H ⋂ F)c ⋂ W = {duck, deer, frog, mouse}
CARDINALITY
Example:
Answers
Test yourself:
1. Express the set using set-builder notation: {spring, summer, winter, fall}
2. Express the set using the roster method: “The set of months of the year that start with the letter J.”
3. Find the cardinal number for set A. Set A = {Cabrini College, Villanova University, Eastern College, Rosemont
College, Immaculate University}
4. Are the sets equal? Give a reason for your answer. {a, b, c, d, e} {a, b, b, c, c, c, d, d, d, d, e, e, e, e, e}
5. Are these sets equivalent? Give a reason for your answer. {a, b, c, d, e} {a, a, a, a, a, b, b, b, c, c, c, d, d, e}
A relation is a set of ordered pairs. 1,2, 2,3, 2,4, 1,0is an example of a relation.
The x-values in each coordinate make up what is referred to as domain. {-2, -1, 1, 2} is the domain of the
relation.
The y-values in each coordinate make up what is referred to as the range. {-3, 0, 2, 4} is the range of the
relation.
So what are functions?
Functions are relations, so they are sets of ordered pairs!
What makes them special is that the x-values don’t repeat!
Each x-values is paired with exactly one y-values.
There are many ways to express functions.
They can be expressed as ordered pairs, in tables, in a graph, or as a mapping.
Functions cab be expresses as:
Let’s use the relation 2,3, 1,4, 0,4, 1,2 .
This relation is a function because the x-values don’t repeat.
It is expressed here as a set of ordered pairs.
We can also use a table to express this function.
x y
-2 3
-1 2
0 4
1 4
You can express a function as a mapping. A mapping is two ovals. The first oval contains the domain (x-values).
The second oval contains the range (y-values).
For example:
-1 -2
0 1
1
2
2
This is an example of a mapping. Each x-value is mapped or paired with exactly one y-value.
Functions in a graph
Here are some examples of functions in graphs:
Graphs of Functions
** Binary Operations **
The word "binary" means composed of two pieces. A binary operation is simply a rule for combining two
values to create a new value. The most widely known binary operations are those learned in elementary school:
addition, subtraction, multiplication and division on various sets of numbers.
A binary operation on a set is a calculation involving two elements of the set to produce
another element of the set.
Situation 1:
It is possible to define "new" binary operations. Consider this example:
Question Explanation
1. What is 8 Φ 3 ? Substitute the values of a and b into the right-hand side of the definition,
namely 3a + b.
8 Φ 3 = 3•8 + 3 = 24 + 3 = 27
3. Is a Φ b associative? Does a Φ (b Φ c) = (a Φ b) Φ c ?
a Φ (3b + c) = (3a + b) Φ c ?
3a + (3b + c) = 3(3a + b) + c ? Not true for all reals.
If a = 2, b = 3, c = 4; 3•2 + (3•3 + 4) ≠ 3(3•2 + 3) + 4;
6 + 13 ≠ 3(9) + 4; 19 ≠ 31.
The operation Φ is not associative for real numbers.
Situation 2:
Sometimes, a binary operation on a finite set (a set with a limited number of elements) is displayed in a table which
shows how the operation is to be performed.
Question Explanation
4 (3 2) = (4 3) 2 4 (4) = (3) 2
4 = 4 YES, this example is associative.
Unfortunately, if you were asked the general question, "Is associative?", instead of just checking one single case
as shown in #4, you would have to check ALL possible arrangements. Unlike the commutative property, there is NO
shortcut for checking associativity when working with a table. But remember, it only takes one arrangement which
does not work to show that associativity fails.
SECTION 3
** Mathematical Logic **
Symbolic Logic is a powerful tool for analysis and communication in mathematics. It represents the natural
language and mathematical language with symbols and variables.
A statement is an assertion which can be regarded as true or false. A simple statement is a single statement
which does not contain other statements as parts. A compound statement contains two or more statements.
A logical connectives combines simple statements into compound statements.
Example1:
The following sentences are simple statements.
Example 2:
Consider the following statements.
h : Harry is not happy.
v : Harry is going to watch a volleyball game.
r : It is going to rain.
s : Today is Sunday.
Solution:
a. s h c. r ~v e. ~h→~r
b. s ~v d. v ~h f. v r
Example 3:
Convert the following symbolic statements into words given the following propositions.
p : Gian plays volleyball.
q : Lanz plays basketball.
a. ~p c. p→~q
b. p q d. p (~p→q)
Solution:
a. Gian does not play volleyball.
b. Gian plays volleyball while Lanz plays basketball.
c. If GIan play volleyball, then Lanz does not play basketball.
d. Gian plays volleyball, or if Gian does not play volleyball, then Lanz plays basketball.
Example 4:
Consider the following statements
p : Adele is a singer.
q : Adele is a songwriter.
r : Adele is an actress.
Solution:
a. If Adele is a singer and Adele is a songwriter, then Adele is not an actress.
b. r→(~p ~q)
Example 5:
Solution:
s t
Example 6:
Consider the following statements.
p : x is a prime number.
q : x is odd.
Solution:
a. p q
b. pq
Example 7:
Write each statement in the form “If p, then q.”
a. I will 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.
There are three ways to restate a conditional statement – the converse, the inverse and the contrapositive.
However, restating the statement into one of these forms may change the meaning of the original statement. The
conditional statement, p → q, may be restated in the following forms.
Example 8:
Write the converse, inverse, and contrapositive of the given sentence.
“She is allowed to join the volleyball team, only if she knows how to receive the ball.”
Solution:
q → p: If she 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 9:
Solution:
p → q: If it is a rectangle, then it is a parallelogram.
Truth Tables
A logical statement may either be true or false. If the statement is true, then the truth value corresponding to the
statement is true and denoted by the letter T. If it is false, the statement has a value denoted by F. The truth table
is a summary of all possible truth values of a statement. Here are some examples.
A. Assertion D. Disjunction
p p q pq
T T T T
F T F T
F T T
B. Negation F F F
p ~p
T F E. Conditional
F T p q p→q
C. Conjunction T T T
p q pq T F F
T T T F T T
T F F F F T
F T F F. Biconditional
F F F p q pq
T T T
T F F
F T F
F F T
Example 10:
p q ~p
p q pq ~p p q ~p
T T T F F
T F T F F
F T T T T
F F F T F
Example 11:
Solution:
p q ~p ~q ~q → p ~p (~q → p)
T T F F T T
T F F T T T
f T T F T T
F f T T F T
If the truth value of a compound statement is always true regardless of the truth values of each of the
component statements, then the statement is said to be a tautology. If the truth table value of compound
statement is always false, regardless of the truth values of each of the compound statement, then the statement
is a contradiction.
Logical Equivalence
Two mathematical statements are logically equivalent if the final output of their truth tables are exactly the
same. For example, the statement p → q is not logically equivalent to q → p. If P and Q are compound statements,
then P and Q are logically equivalent if and only if p q is a tautology.
Example 12:
Verify if the statement p → q and ~ p q are logically equivalent. What is the logical content equivalent of “If the
price is right, then I will accept the job offer”?
Solution:
p q ~p pq ~ pq
T T F T T
T F F F F
F T T T T
F F T T T
Since the last two column are identical, the given statements are logically equivalent.
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.”
De Morgan’s Laws
~ p q (~p) (~q)
~ p q (~p) (~q)
Example 13:
Prove: p q (~q)→(~p)
Proof
p q (~p) q Logical equivalence of p → q
q (~p) The operator is commutative
~(~ q) (~ p) For any statement p, ~(~ p) = p
(~ q) →(~p) The converse of p q is also true
Quantifiers
Special words like “all”, “any”, “every”, and “some” are called quantifiers. They can be used to analyze
mathematical sentences or may be used to define mathematical terms. Quantifiers are categorized into universal
quantifiers and existential quantifiers.
Universal quantifiers such as “all”, and “every” are used to denote that all elements in the set satisfy a given
property. The following statements contain universal quantifiers.
All professors handling professional courses are licensed engineers.
Each of the students attending field trip must have the waiver form signed by the parents.
Every right triangle has an angle that measure 90°.
Existential quantifiers such as “some” and “there exists” are used to denote that one or more elements of a set
satisfy a given property. The following statements contain existential quantifiers.
If S is a set and P(x) is a statement about the element x, then the notation
x S Px
means that “For all x in S, P of x is true” or “P(x) is true for every x in set S.” The notation
x S Px
means “There exists x in S, for which P of x is true” or “There exists t least one element x of S for which P(x) is
true.”
Example 14:
Solution:
a. An integer x is even if there exists an integer y such that x 2 y . In symbols,
y x 2 y
b. An integer x is odd if there exists an integer y such that x 2 y 1 . In symbols,
y x 2 y 1
VI. ASSESSMENT
TASK:
CHALLENGE YOURSELF