Professional Documents
Culture Documents
Nature of Mathematics
Melvin H. Cayabyab
Department of Mathematics
Math 01 – Mathematics in the Modern World College of Arts and Sciences
Mathematical Language and Symbols
2. Relations
3. Functions
4. Binary Operations
Definition
A function is a relation for which each value from the set of
first components of the ordered pairs is associated with
exactly one value from the set of second components of the
ordered pair.
where .
is called the domain of the function and
is called the range of the function
Examples:
1. is a function
2. is not a function
Suppose where
Example:
Let where
Can you represent the function ? Is the graph of the function a set of
discrete points or a continuous line?
f(0) = 0
f(1) = 1
f(2) = 4
f(3) = 9
f(4) = 16
f(5) = 25
Can you represent the function? Extend this function to the set of
real numbers and sketch the graph. Is it linear?
Definition
Let be a set. A binary operation on is a function such that is
defined for every pair of elements in , and uniquely associates each
pair of elements of to some element of .
To show that is a binary operation, one needs to satisfy the two conditions below:
i. (Closure). For any two elements and in the set , the product is an element of .
ii. (Uniqueness). Given that and , if there exists another element such that , then .
Examples:
1. Let and be “+” (usual addition). For .
This is a binary operation.
Examples:
3. Let and , the largest of a and b.
4. Let and .
This is not a binary operation as is not defined when (condition ii) apart
from the fact that is not always in (condition i).
Define , where
Example:
Let S={-1, 0, 1} and the operation be the usual multiplication. Show that is a
binary operation by means of a multiplication table.
Solution: -1 0 1
-1 1 0 -1
0 0 0 0
1 -1 0 1
Example:
Let and be the operation that gives the remainder when the sum of two elements
in is divided by 4 (e.g., ).
Definition
Let be a binary operation on a set . Then:
a. is commutative if for all , .
b. is associative if for all , .
c. An element of is an identity for if for all , .
d. If is an identity for and , then is invertible if there exists such that .
The element is called the inverse of .
2. Is ?
Definition
A proposition is a statement that is either true or false but not both true
and false under the same condition. Generally, a proposition is a
declarative sentence.
Examples:
a) Mayon Volcano is in Naga City.
b) 14 is an even number.
c) (-1, 0) is a point on the y-axis.
Examples:
a) x + 4 = 10.
b) He wrote the book “Mathematics in the Modern World”.
Examples:
p: The base angles of an isosceles triangle are equal.
q: 1 + 7 ≠ 7.
r: The cubic equation x3 – 8 = 0 has a root equal to 2 of multiplicity 3.
Definition
A compound proposition is a proposition formed by combining two or
more simple statements. It is formed with the use of logical connectives
like “and”, “or”, “if ... then”, and “if...and only if...”.
The only way for a conjunction to be true is when all its components are true.
p q p^q Example:
p: June has 31 days.
T T T q: 5 is odd.
The only way for a disjunction to be false is when all its components are false.
p q pvq Example:
p: Taal Volcano is in Laguna.
T T T q: 3 + 2 = 6
T F T
p v q: Taal Volcano is in Laguna or 3 + 2 = 5.
F T T
Truth Value: True since p is true and q is false.
F F F
Examples:
Truth Truth
Proposition Negation of the Proposition
Value Value
1. p: 5 is divisible by 2. False : 5 is not divisible by 2. True
2. q: 4 + 2 = 6. True : 4 + 2 6. False
Converse : q
p
Inverse : ¬p
¬q
Contrapositive : ¬q ¬p
The only way for biconditional to be false is when p and q have different truth values.
p q pq Examples:
p: 52 = 32 + 42
T T T q: 3 - 5
T F F
p q: 52 = 32 + 42 if and only if 3 - 5 .
F T F
Truth Value: False since p is true and q is false
F F T
Definition
Quantifiers are constructs that specify the quantity of specimens in the
domain of discourse that satisfy a formula.
2 Kinds of Quantifiers:
1. Universal Quantifier symbolized by means “for all, for every, for any”.
2. Existential Quantifier symbolized by means “for some, there exists”.
Definition
A statement involving a quantifier is called a quantified statement.
Just like an ordinary statement (proposition), a quantified statement has
also its truth value.
Examples:
1. For all natural numbers x, x + 5 = 10.
2. For every real numbers x and y, x + y = y + x.
3. For some natural numbers x, x - 3 = 5.
4. There exists an integer such that 2x – 7 = 3.
5. For every real numbers x, there exists a real number y such that xy = 1 and yx =
1.
Definition
Universally quantified statements are denoted by
x P(x).
where P(x) is a propositional function with domain of discourse D.
Definition
Existentially quantified statements are denoted by
x P(x).
where P(x) is a propositional function with domain of discourse D.
Examples:
1. P: All math majors are male.
Notation: P(x)
Negation: There is at least one math major who is not a male.