Professional Documents
Culture Documents
Chapter 2
Chapter 2
Chapter 2
Mathematical
Language and
Symbols
Topic Outline
I. Characteristics of Mathematical Language
V. Elementary Logic
VI. Formality
Special terms—
tensor fractal function
Mathematical Taxonomy —
Axiom conjecture theorems lemma corollaries
Mathematical expressions
= (equal) < (less-than) > (greater-than)
+ (addition) – (subtraction) (multiplication)
(division) (element) (for all)
(there exists) (infinity) (implies)
(if and only if) (approximately) (therefore)
A. Language of Sets
B. Language of Functions
C. Language of Relations
D. Language of Binary Operations
element of a set
D = {xx is an integer, 1 x 8}
Example:
E = {a, e, i, o, u} Roster method
E = {xx is a collection of vowel letters} Rule method
b. B = {x3 x 8, x Z}
Answer: B = {4, 5, 6, 7}
Unit Set
Empty Set
Universal Set
Cardinality
Example:
a. A = {xx is a positive integer less than 10}
b. C = {d, i, r, t}
c. E = {a, e, i, o, u}
Example:
a. F = {…, –2, –1, 0, 1, 2,…}
Example:
a. I = {xx is a whole number greater than 1 but less than 3}
b. J = {w}
c. K = {rat}
Example:
a. L = {xx is an integer less than 2 but greater than 1}
Example:
a. U = {xx is a positive integer, x2 = 4}
b. U = {1, 2, 3,…,100}
Theorem 1.1: Uniqueness of the Empty Set: There is only one set
with no elements.
Subset
Proper Subset
Equal Set
Power Set
Symbolically: A B x, x A x B.
Example: Suppose
A = {c, d, e}
B = {a, b, c, d, e}
U = {a, b, c, d, e, f, g}
Symbolically: A B x, x A x B.
Example: Suppose
A = {c, d, e}
B = {a, b, c, d, e}
C = {e, a, c, b, d}
U = {a, b, c, d, e, f, g}
Symbolically: A = B A B B A.
Example:
Suppose A = {a, b, c, d, e},
B = {a, b, d, e, c}
U = {a, b, c, d, e, f, g}
(b) B = {1, 2, 3} (B) = {{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3},
{1, 2, 3}, }.
Union
Intersection
Complement
Difference
Symmetric Difference
Disjoint Sets
Ordered Pairs
Symbolically: A’ = {x U x A}.
If set A and B are two sets, their symmetric difference as the set
consisting of all elements that belong to A or to B, but not to
both A and B.
Suppose
A = {a, b, c} B = {c, d, e} U = {a, b, c, d, e, f, g}
b. AB
c. A’
d. A B
e. A B
a. AB = {a, b, c, d, e}
b. AB = {c}
c. A’ = {d, e, f, g}
d. A B = {a, b}
e. A B = {a, b, d, e}
Two set are called disjoint (or non-intersecting) if and only if,
they have no elements in common.
a. (2, 5) = (9 – 7, 2 + 3) Since
True2 = 9 – 7 and 2 + 3 = 5, the ordered pair
is equal.
a. AxB = {(2, 7), (2, 8), (3, 7), (3, 8), (5, 7), (5, 8)}
b. BxA = {(7, 2), (7, 3), (7, 5), (8, 2), (8, 3), (8, 5)}
c. AxA = {(2, 2), (2, 3), (2, 5), (3, 2), (3, 3), (3, 5), (5, 2), (5, 3),
(5, 5)}
Language of Functions and Relations
R = {(a, s), (a, t), (a, u), (a, v), (b, s), (b, t), (b, u), (b, v), (c, s),
(c, t), (c, u), (b, v), (d, s), (d, t), (d, u), (d, v)}.
Applications of Functions:
financial applications economics medicine
Engineering sciences natural disasters
calculating pH levels measuring decibels
designing machineries
Solution:
Apply the four properties to test the set of all non-negative
integers under addition is a group.
Four Divisions:
Set Theory Recursion Theory
Proof Theory Model Theory
1. Mathematics is fun.
p p
T F
F T
1. 3 + 5 = 8. 3 + 5 8.
p q pq
T T T
T F F
F T F
F F T
Example:
“x is an even number” is a predicate whose truth depends
on the value of x.
Example:
The given sentence has the logical form P(x) Q(x) and its
truth value can be determine for a specific value of x.
The statement “x P(x)”is true if only if P(x) is true for every
value of x.
Statement Negation
All A are B. Some A are not B.
No A are B. Some A are B.
Some A are not B. All A are B.
Some A are B. No A are B.