Module2-Mathematical Language and Symbols
Module2-Mathematical Language and Symbols
⇐⇒ if and only if
X
the sum of R set of Real Numbers
∃ there exists C set of Complex Numbers
∀ for all N set of Natural Numbers
∈ element Z set of Integers
∈/ not an element Q set of rational Numbers
0
⊂ proper subset Q set of irrational Numbers
⊆ subset or equal
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
Definition (Set)
A set is a collection of well-defined distinct objects.
Example
The following are examples of a set:
1 The collection of all municipalities in the Philippines.
2 The collection of the names of the males in a classroom.
3 The set of all car models.
4 The set of all subjects you take this semester.
Example
The following is not a sets:
1 The set of all goodlooking classmates in your block.
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
a ∈ A.
Remark
The symbol ∈ denotes that a is in A or a is a
member/element of A.
Remark
If an element x is not a member or not in the collection of the
set X , then we say
x∈/ X.
Remark
In case that a set A does not contain any elements, we say
that A is an empty set or null set denoted by ∅.
Note: Do not be confuse of the X,A,x,a or whatever letters,
they are just symbols.
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
Example
Let V be the collection of vowels in the English alphabet.
Then we can write the set V as:
V = {a, e, i, o, u}.
Example
Consider the following sets:
1 A : x ∈ Z+ : x ≤ 6.
2 B: The set of all positive even numbers less than or equal
to 10.
3 C : x ∈ Z : −4 < x < 4.
4 D : Set of all odd numbers from −3 to 5.
5 E : Set of all positive prime numbers less than 7.
Write the sets in Roster form and do the following operations:
0
(i) A ∪ C (iii) D ∩ E (v) (B ∩ D)
(ii) A ∪ E (iv) A × D
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
Solution:
We can write the sets as:
1 A = {1, 2, 3, 4, 5, 6}
2 B : {2, 4, 6, 8, 10}
3 C : {−3, −2, −1, 0, 1, 2, 3}
4 D : {−1, 1, 3, 5}
5 E : {2, 3, 5}
Now, we will solve
(i) A ∪ C
Solution:
(ii) A ∪ E
A ∪ E = {1, 2, 3, 4, 5, 6} ∪ {2, 3, 5}
= {1, 2, 3, 4, 5, 6}
(iii) D ∩ E
D ∩ E = {−1, 1, 3, 5} ∩ {2, 3, 5}
= {3, 5}
Solution:
(iv) A × D
A × D = {1, 2, 3, 4, 5, 6} × {−1, 1, 3, 5}
= {(1, −1), (1, 1), (1, 3), (1, 5), (2, −1), (2, 1),
(2, 3), (2, 5), (3, −1), (3, 1), (3, 3), (3, 5),
(4, −1), (4, 1), (4, 3), (4, 5), (5, −1), (5, 1),
(5, 3), (5, 5), (6, −1), (6, 1), (6, 3), (6, 5)}
0
(v) (B ∩ D)
0 0
(B ∩ D) = ({2, 4, 6, 8, 10} ∩ {−1, 1, 3, 5})
0
= (∅) = A ∪ B ∪ C ∪ D ∪ E .
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
Definition (Function)
Let A and B be sets. A function is a mapping f : A → B
such that for all a ∈ A, there exists a unique b ∈ B.
Remark
In the function f : A → B, we call the set A as the domain of
the function f and the set B is called as the co-domain of the
function f . The set of elements in B where the elements in A
is mapped is called the range R(f ) of the function f . Hence
R(f ) ⊆ B. (3)
Remark
We define R(f ) as
Example
Consider the following mapping:
f : {0, 1, 2, 3, 4, 5} → R,
defined by
f (x) = x − 2.
Example
Consider the following mapping:
f : {0, 1, 2, 3, 4, 5} → R,
defined by
f (x) = x − 2.
Example
Consider the following mapping:
f : Z+ → R+ ,
defined by
f (x) = x.
Definition
A function f : A → B is one-to-one or injective if for all
elements a, b ∈ A,
Remark
We can say also that a function f is one-to-one if for all
a, b ∈ A
f (a) = f (b) =⇒ a = b. (6)
Definition
A function f : A → B is onto or surjective if for every element
b ∈ B, there exists a ∈ A such that f (a) = b.
Remark
We can say also that a function f is onto if and only if
R(f ) = B, that is
Example
Consider again the function:
f : {0, 1, 2, 3, 4, 5} → R,
defined by
f (x) = x − 2.
Example
Consider again the function:
f : Z+ → R+ ,
defined by
f (x) = x.
Example
The function
f : Z+ → Z+
defined by
f (x) = x 2
is not one to since −2 6= 2 but f (−2) = 4 and f (2) = 4, which
means f (−2) = f (−2). This is not an onto function also since
2 ∈ Z+ but there is no element in the domain that yields 2.
Example
The function f : R → R defined by f (x) = −x is both
one-to-one and onto.
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
Exercise
Consider the function
f : Z+ → R
defined by
f (x) = e x .
Find the following:
1 Domain
2 Co-domain
3 Range
4 Is this function one-to-one?
5 Is this function onto?
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
f : S ∗ S → S. (8)
Solution:
Let a, b ∈ R. Supposed a + b = c, then by the closure of the
real numbers, c ∈ R. Therefore, the normal addition is a
binary operation in R.
Example
Consider the set of all integers R and the operation × which is
the normal multiplication. We will show that the normal
multiplication × is a binary operation under the set Z.
Solution:
Let a, b ∈ Z. Supposed a × b = c, then by the closure of the
integers, c ∈ Z. Therefore, the normal addition is a binary
operation in Z.
Example
Consider the set of all positive integers Z+ and the operation
− which is the normal subtraction. We will show that the
normal subtraction − is not a binary operation under the set
Z+ .
Solution by Counterexample:
Let 2, 5 ∈ Z+ . Now, 2 − 5 = −3. But −3 is not an
element/member of the positive integers. Therefore, the
normal subtraction is not a binary operation under Z+ .
(ii) Commutativity
(iii) Associativity
and (x × y ) × z = x × (y × z).
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
and x × (y + z) = (x × y ) + (x × z).
(v) Has Identity
For any x ∈ R, there exists identity element e such that
e + x = x and e × x = x.
(vi) Inverse Exists
For any x ∈ R, there exists an inverse i such that
x + i = e and x × i = e.
Example
(i) Closure
2, 5 ∈ R, 2 + 0 = 7 ∈ R and 2 × 7 = 14 ∈ R. (13)
(ii) Commutativity
5, 1 ∈ R, 5 + 1 = 6 = 1 + 5 and 5 × 1 = 5 = 1 × 5. (14)
(iii) Associativity
1, 2, 3 ∈ R, (1 + 2) + 3 = 3 + 3 = 6 = 1 + 5 = 1 + (2 + 3)
(15)
and (1 × 2) × 3 = 2 × 3 = 6 = 1 × 6 = 1 × (2 × 3).
Eric G. Lauron, M.Sc. THE NATURE OF MATHEMATICS Mathematical Language a
Mathematical Language and Symbols
Basic concepts of sets, functions and binary operations
Example
(iv) Distributivity
0, 1, 2 ∈ R, (0 + 1) × 2 = (0 × 2) + (1 × 2) (16)
and 0 × (1 + 2) = (0 × 1) + (0 × 2).