MATHEMATICAL

LANGUAGE
AND
SYMBOLS

Relations
and
1
Functions

Prepared by: ARMANDO C. MANZANO

Ordered Pair
• Given elements a and b, the symbol (a, b) denotes the
ordered pair consisting of a and b together with the
specification that a is the first element of the pair and b is
the second element. Two ordered pairs (a, b) and (c, d )
are equal if, and only if, a = c and b = d .

• Example:
• {(1, 2), (1, 5), (3, 7), (8, 1 )} is a set of ordered pairs
• First elements={1, 3, 8}
• Second elements={1, 2, 5, 7,}

(a,b) ≠(b,a)
Cartesian Product
• Given setsA and B , the Cartesian product of A and B ,
denoted by A × B and read as "A cross B " is the set of all
ordered pairs (a, b), where a is in A and b is in B .
Symbolically:

• A × B = {(a, b)|a ∈ A and b ∈ B}.

• Example:
• Let A = {1, 2, 3 } and B = {u, v } . Find A × B .
• Then A × B ={ (1, u),(1,v),(2,u),(2,v),(3,u), (3,v)}
B × A= {(u,1),(u,2),(u,3),(v,1),(v,2),(v,3)}
A×B ≠B× A
 Mathematical
24 &
Language
Symbols
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)}
R: {(a,b)|b=2a, a,b ϵ Z}
R: x→y,y=2x,x,y is an integer

R={(1, 2), (2, 4), (3, 6), (4, 8), (5,10),....}

Domain: {…,-1,0,1,2,3,4,5,…}, set of all integer

Range:{-4,-2,0, 2,4,6,8,10,…}, set of all even
number
N={(a,b)|a,b ϵ R, b=2a}

N= {(1, 2), (2, 4), (3, 6), (4, 8), (5,

10),....., (a , 2a)}

Domain: all real number

Range: all real number
 Mathematical
25
Language
&
Symbols

Types of Relations
1.one - to – one relation
2.one – to – many relation
3.many – to – one relation
4.many- to-many relation
 Mathematical
25
Language
&
Symbols
Equivalence Relation
A relation R from a set A to itself is called an equivalence
relation if it satisfy the following properties:

1. Reflexive Property: For any x ∈ A, xRx .

2. Symmetric Property: For any x, y ∈ A if xRy , then

yRx .
3. Transitive Property: For any x, y, z ∈ A if xRy and
yRz , then xRz .
Show that R ={(1,1), (1,3), (2,2), (2,3), (3,2), (3,1), (3,3)} is an
equivalence relation from a set A ={1,2, 3}.
 Show that R ={(1,1), (1,3), (2,2), (2,3), (3,2), (3,1), (3,3)} is an
equivalence relation from a set A ={1,2,3}.
 Mathematical
26 &
Language
Symbols

Relations in Language of Math

Grammatical rules for the use of symbols
To use <in a sentence, one should
precede it by a noun and follow it by a
noun.
Other examples of relations are “equals”
and “ is an element of”
It is important when specifying a relation
to be careful about which objects are to
be related.
\ Mathematical
27 &
Language
Symbols
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.
Example: Let A = {2, 4, 6} and B = {1, 3, 5}. Which of the
relations
R, S, f defined below are functions from A to B?

1. R = {(2, 5), (4, 1), (4, 3), (6, 5)}

2. For all (x, y ) ∈ A × B, (x, y ) ∈ S means
that y = x + 1.
S={(2,3),(4,5)}
3. f defined by the arrow diagram
 28

The notation f : A → B is used to

denote a function which means that f is
a function with domain A and range B;
f(x) = y means that f transform x (which
must be an element of A) into y ( which
must be an element of B)
Evaluating Functions

• The functional notation 𝒇(𝒙) = 𝒚 allows us to denote

specific values of a function. To evaluate a function is to
substitute the specified values of the independent
variable x in the formula and simplify.

• Example: When 𝒇 𝒙 = 𝟐𝒙 − 𝟑,
• find 𝒇(𝟐) x=2
• . y= 𝟐𝒙 − 𝟑,
• Solution:
• 𝒇(𝟐)=2(2) –3 =4 – 3
• 𝒇(𝟐)=1
• 𝒇 𝒙 = 𝟐𝒙 − 𝟑,
 Mathematical
29 &
Language
Symbols
Evaluating Functions
Exercises

Given :𝑓 𝑥 = 2𝑥 2 − 5𝑥 + 12
Find:
𝑓 −3 , 𝑓 4 , 𝑓 −8 ,

𝑓 2𝑎 + 3𝑏 − 3

𝑓 −3𝑎 − 𝑏 + 8 ,
 Mathematical
30 &
Language
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.

What is the inverse of 𝒚 = 𝟐𝒙 − 𝟏?

in
 𝒚 = 𝟐𝒙 − 𝟏

Interchange x by y and y by x
𝒙 = 𝟐𝒚 − 𝟏

Then solve for y

𝟐𝒚 − 𝟏 = 𝒙
𝟐𝒚 = 𝒙 + 𝟏
2y/2=(x+1)2
𝒙+𝟏
𝒚=
𝟐

Given 𝒇(𝒙) 𝒇(𝒙) = 𝟐𝒙 − 𝟏

𝒙+𝟏
Its inverse 𝒇−𝟏 (𝒙) = 𝟐
 𝒚 = 𝟐𝒙 − 𝟏

Solve for x
𝟐𝒙 − 𝟏 = 𝒚
𝟐𝒙 = 𝒚 + 𝟏

𝒚+𝟏
𝒙=
𝟐

Interchange x by y and y by x
𝒙+𝟏
𝒚=
𝟐

Given 𝒇(𝒙) 𝒇(𝒙) = 𝟐𝒙 − 𝟏

𝒙+𝟏
Its inverse 𝒇−𝟏 (𝒙) = 𝟐
 Mathematical
30 &
Language
Symbols
Operations on Function
Let f and g be functions of x

1. (f+g)(x)= f(x) +g(x)

2. (f-g)(x) = f(x) - g(x)

3. (f.g)(x) = f(x)(g(x))

4. (f/g)(x) = f(x)/g(x)
 Mathematical
30 &
Language
Symbols
Operations on Function
Exercises:

Let f(x)=3x +5 and g(x)= 7x-4

Find
1. (f+g)(x)=f(x) +g(x)=3x+5)
2. (f-g)(x)
3. (f.g)(x)
4. (f/g)(x)
 Mathematical
30 &
Language
Symbols
Operations on Function
Exercises:

Let f(x)=3x +5 and g(x)= 7x-4

Find
1. (f+g)(x)=f(x) +g(x)=(3x+5)+(7x-4)
=3x+5+7x-4
=10x+1

2. (f-g)(x)= f(x) -g(x)=(3x+5)-(7x-4)

=3x+5-7x+4
=-4x+9
3. (f.g)(x)=f(x)g(x)= (3x+5)(7x-4)
=21𝑥 2 − 12x + 35x -20
=21𝑥 2 + 23x -20
3𝑥+5
4. (f/g)(x)=(3x+5)/(7x-4)or
7𝑥−4
 Mathematical
31 &
Language
Symbols
Binary Operations

A binary operation on a set A is a function

that takes pairs of elements of A and produces
elements of A from them.
We use the symbol *to denote arbitrary
binary operation on a set A.
Four Properties:
1. Commutative x*y =y *x
2. Associative x*(y*z) =(x*y)* z
3. Identity e*x =x*e
4. Inverse x*y =y*x =e
 Mathematical
31 &
Language
Symbols
Elementary Logic
Propositions
A simple proposition is a statement or declarative
sentence that is either true or false, but not both true
and false.
Example. Determine if each statement is a proposition.
1. All parallelograms are quadrilaterals.
2. The word dog has four letters.
3. How are you?
57
4. 9 + 2 is a prime number.
5. Draw two parallel lines that are cut by a
transversal
Consider relating propositions p to another propositions q to form a
new proposition.
To connect p The resulting
to q, use the which is read In symbols...
proposition is
connective as...
called...
symbol...

∧ and conjunction p ∧q
(p and q)

∨ or disjunction p ∨q
(p or q)

→ implies Implication p→ q
If..., then (p implies q)
conditional
is equivalent p↔ q
↔ to... Equivalence
(p is equivalent to q)
if and only if biconditional

∼ not negation ∼p
(not p)

38 / 45
 Mathematical
31 &
Language
Symbols
Elementary Logic
A logical connective is the mathematical equivalent
of a conjunction.

If P and Q are propositions, then P ∧ Q

(conjunction) is the statement that is true if and
only if both P and Q are true. Otherwise, P and Q
are false.

Another connective is the word “or,” and its

symbol is " ∨ " . The statement 𝑃 ∨ 𝑄
(disjunction) is false if and only if both P and Q
are false. Otherwise, P or Q is true.
 Mathematical
31 &
Language
Symbols

Another important connective is “implies,”

which is usually written “⇒ " The statement
𝑃 ⇒ 𝑄 (conditional) means that Q is a
consequence of P, and is usually read as “if P
then Q.” The statement 𝑃 ⇒ 𝑄 is considered to
be true under all circumstances except one: it
is not true if P is true and Q is false.
 Mathematical
31 &
Language
Symbols

Another connective is “⇔, " which is

usually read as “if and only if.” The
statement 𝑃 ⇔ 𝑄 (biconditional)
means that P is a necessary and
sufficient condition for Q. The
statement 𝑃 ⇔ 𝑄 is true whenever P
and Q have the same truth value,
otherwise false.
 Example:
Write the negation of each statement .

1. Bill Gates has a yacht.

1

2
2. The number 10 is a prime number.
3. The Dolphins lost the game.
4. 1001 is divisible by 7.
5. 5 is an even number.
6. The red engine is not red.

39 / 45
 Exercise:
Consider the following statements.
p: Today is Friday.
q: It is raining.
r : I am going to a movie.
s: I am not going to the basketball game.
Write the following compound propositions in symbolic form.

1. Today is Friday and it is raining.

2. It is not raining and I am going to a movie.
3. I am going to the basketball game or I am going to a movie.
4. If it is raining, then I am not going to the basketball game.
4
Exercise:
Consider the following statements.
p: The game will be played in PSU.
q: The game will be shown on GMA.
r : The game will not be shown on ABS.
s: Our team are favored to win.
Write each of the following symbolic propositions in
words.
1. q ∧p
2. ∼ r ∧ s
3. s ↔∼ p
The truth value of a proposition is true (T) is the statement is
true and false (F) if the statement is false. A truth table is a
table that shows the truth value of a proposition for all possible
truth values of its components.

The conjunction p ∧ q is true if and only if both p and q are true.

The disjunction p ∨ q is true if p is true, if q is true, or if both p and q
are true.
The implication or conditional p → q is false if p is true and q is false.
It is true in all other cases.

42 / 45
 Mathematical
31 &
Language
Symbols
Truth Tables

P Q 𝑷∧𝑸 𝑷∨𝑸 𝑷⇒𝑸 𝑷⇔𝑸

T T T T T T
T F F T F F
F T F T T F
F F F F T T
 Mathematical
31 &
Language
Symbols

Exercise:
1. Let p and q be propositions “Vigan City
is in Ilocos Sur” and “The capital of Ilocos
Sur is Narvacan,” respectively. Find
a. 𝑝 ∧ 𝑞
b. 𝑝 ∨ 𝑞
c. 𝑝 ⇒ 𝑞
d. 𝑝 ⇔ 𝑞

2. Find its truth value.

Exercise. Determine the truth
value of each proposition.
1. ∼ (p ∧ q)
2. ∼ (p →∼ q)
3. ∼ q →∼ p
4. ∼ [(p ∨ q) → r ] ∧ ∼ q
Exercise. Determine
the truth value of each
proposition.
1. ∼ (p ∧ q)
2. ∼ (p →∼ q)
3. ∼ q →∼ p
4. ∼ [(p ∨ q) → r ]
∧∼q
Exercise. Determine the truth value of
each proposition.
1. ∼ (p ∧ q)
2. ∼ (p →∼ q)
3. ∼ q →∼ p
4. ∼ [(p ∨ q) → r ] ∧ ∼ q
Exercise. Determine the truth value of each proposition.
1. ∼ (p ∧q)
2. ∼ (p →∼ q)
3. ∼ q →∼ p
4. ∼ [(p ∨q) → r] ∧ ∼ q
Exercise. Determine the truth value of
each proposition.
1. ∼ (p ∧q)
2. ∼ (p →∼ q)
3. ∼ q →∼ p
4. ∼ [(p ∨q) → r] ∧ ∼ q
Tautologies

If it can be shown that the truth values for a proposition formed by

connectives are all true, then the proposition is called a tautology.

Exercise. Determine whether each proposition is a tautology.

1 p∨ ∼ p

2 ∼ [(p ∨q) → r] ∧ ∼ q → (p∧ ∼ r)

3 ∼ (p ∧ q) ↔(∼ p∨ ∼q)
p∨ ∼ p
∼ [(p ∨q) → r]∧∼ q → (p∧ ∼ r)
∼ (p ∧q) ↔(∼ p∨ ∼q)
 35

Possible activity:
Video Watching
Math isn't hard_ it's a language _ Randy
Palisoc _TEDxManhattanBeach.mp4