Introduction to Mathematical Language

Main Idea: Math is a language. Like English or Filipino, it has its own symbols, vocabulary,
grammar, and rules.

1. The Tower of Babel Story

○ People were building a tower.
○ They spoke the same language, so they worked well together.
○ God made them speak different languages → they couldn’t understand each
other → project failed.
👉 Lesson: Without a common language, communication breaks down.
2. In math, the “common language” is symbols and rules. Without it, we can’t
communicate ideas clearly.

2. Mathematics as a Language
○ Natural language: “Five plus three equals eight.”
○ Math language: 5 + 3 = 8.
○ Both mean the same, but math is shorter and precise.
3. But some math looks complicated:
f(x)=L∀ε>0,∃δ>0→∣x−a∣<δ,∣f(x)−L∣<ε
👉 This is the definition of a limit in calculus. It looks scary at first, but it’s just a
condensed way to say something very specific.

3. Characteristics of Math Language

○ Precise → no double meanings (e.g., “2 + 2 = 4” is always true).
○ Concise → short but complete (e.g., E = mc² packs a huge idea).
○ Powerful → can express complex ideas simply (e.g., Einstein’s
equations).

4. Vocabulary vs Sentences
○ Like English has nouns and sentences, math has expressions and equations.
○ Expression = noun (represents something).
■ Examples: 3x, 2 + 5, (x + y)².
○ Sentence = complete thought (can be true or false).
■ Examples: 3 + 2 = 5 (true), 5 + 3 = 9 (false).

Expressions, Sentences, and Conventions in Math

1. 🔹 Connectives

In math, connectives join objects to form bigger ones.

● Example: 1 + 2 → the + is the connective.

● It combines 1 and 2 into a new object → 3.

👉 Similar in English:

● Nouns: “cat” and “dog.”

● Compound noun: “cat and dog.”

So in math: objects (numbers) + connective = new object (result).

2. 🔹 Mathematical Sentences

A mathematical sentence = complete thought.

● Example:
○ 3 + 4 = 7 → TRUE.
○ 5 + 3 = 9 → FALSE.

👉 Just like English sentences:

● “Manila is the capital of the Philippines.” ✅ True.

● “Rizal Park is in Cebu.” ❌ False.

The difference? In math, truth is absolute. There’s no debate.

3. 🔹 Truth of Sentences

Every math sentence is either true or false.

● Example:
○ 2 + 2 = 4 → True.
○ 10 is a prime number → False (since 10 is divisible by 2 and 5).

👉 This idea of truth is very important in math logic (will be used later in truth tables).

4. 🔹 Conventions in Language

Just as English has grammar rules, math has conventions to avoid confusion.
 ● English Rule: Capitalize names → “Manila.”
● Math Rule:
○ Use { } for sets → {a, b, c}.
○ Use ∈ for “element of” → x ∈ A means “x is in set A.”
○ Use ⊂ for subset → A ⊂ B means “A is inside B.”

👉 Conventions = standard rules that make math “universal.”

5. 🔹 Expressions vs Sentences (Reminder)

● Expression = incomplete (no truth value).

○ Example: 3x + 2, a² + b².
● Sentence = complete (true/false).
○ Example: 3 + 2 = 5, a² + b² = c².

✅ Key Idea (pp. 44–50):

● Connectives link objects.

● Sentences can be true or false.
● Math conventions (symbols, rules) make ideas clear and universal.

Sets

1. 🔹 What is a Set?

● A set is simply a collection of objects.

● Objects inside are called elements or members.
● Usually written inside curly braces { }.

👉 Example:

● Set of vowels in English alphabet:

V = {a, e, i, o, u}
● Set of prime numbers less than 10:
P = {2, 3, 5, 7}

2. 🔹 Ways of Writing a Set

1. Roster Form → list all elements.

 ○ A = {1, 2, 3, 4, 5}
2. Set-builder Form → describe rule.
○ A = {x | x is a whole number less than 6}

3. 🔹 Symbols in Sets

● ∈ → “element of”
○ 3 ∈ A means 3 is in set A.
● ∉ → “not element of”
○ 6 ∉ A means 6 is not in set A.
● ⊂ → subset
○ {1, 2} ⊂ {1, 2, 3, 4}
● ⊄ → not subset
● ∅ → empty set (no elements).

4. 🔹 Kinds of Sets

● Empty Set: ∅ = { }. Example: {x | x < 0 and x > 5}.

● Finite Set: Countable. Example: {1, 2, 3}.
● Infinite Set: Goes on forever. Example: {1, 2, 3, …}.
● Equal Sets: {1, 2, 3} and {3, 2, 1} → equal (order doesn’t matter).
● Equivalent Sets: Same number of elements. {a, b, c} and {x, y, z}.

5. 🔹 Set Operations

● Union (A ∪ B) → elements in A or B (combine).

○ Example:
■ A = {1, 2, 3}, B = {3, 4, 5}
■ A ∪ B = {1, 2, 3, 4, 5}
● Intersection (A ∩ B) → elements common to both.
○ A ∩ B = {3}
● Difference (A – B) → elements in A not in B.
○ A – B = {1, 2}
● Complement (A′) → all elements not in A (depends on “universal set” U).

✅ Key Idea (pp. 51–60):

Sets are the foundation of math. They let us group objects, describe collections, and operate on
them using union, intersection, and difference.

Relations

1. 🔹 What is a Relation?

● A relation is a way of connecting two sets of elements.

● It is usually written as a set of ordered pairs (x, y).

👉 Example:

● Let A = {1, 2, 3}, B = {a, b}.

● A relation R from A to B could be:
R = {(1, a), (2, b), (3, a)}

This means:

● 1 is related to a
● 2 is related to b
● 3 is related to a

2. 🔹 Cartesian Product

Before relations, we need the idea of a Cartesian product.

● If A = {1, 2} and B = {a, b}, then:

A × B = {(1, a), (1, b), (2, a), (2, b)}

👉 It’s the set of all possible pairs from A and B.

👉 A relation is simply a subset of this Cartesian product.

3. 🔹 Properties of Relations

Relations can have special properties:

● Reflexive: Every element relates to itself.

○ Example: R = {(1,1), (2,2), (3,3)} is reflexive.
● Symmetric: If a relates to b, then b relates to a.
○ Example: If (2,3) is in R, then (3,2) must also be in R.
● Transitive: If a relates to b, and b relates to c, then a relates to c.
○ Example: If (1,2) and (2,3) are in R, then (1,3) must be in R.
● Equivalence Relation: A relation that is reflexive, symmetric, and transitive.
4. 🔹 Real-Life Examples of Relations

● Family relations: “is the parent of,” “is the sibling of.”
● School relations: “is the classmate of,” “is the teacher of.”
● Math relations: “less than” (<), “equal to” (=).

👉 Example in math:

● A = {1, 2, 3}
● Relation R = “less than”
○ R = {(1,2), (1,3), (2,3)}

✅ Key Idea (pp. 61–70):

A relation is simply a connection between elements of sets. It can be reflexive, symmetric,
transitive—or all three (equivalence relation).

Functions

1. 🔹 What is a Function?

A function is a special kind of relation where:

👉 Each input has exactly ONE output.

● If a relation gives an element two or more outputs, it is NOT a function.

Example:

● Relation R = {(1, 2), (2, 3), (3, 4)} ✅ Function (each input has one output).
● Relation R = {(1, 2), (1, 3), (2, 4)} ❌ Not a function (input 1 has two outputs:
2 and 3).

2. 🔹 Terminology in Functions

● Domain → the set of all possible inputs (x-values).

● Codomain → the set of all possible outputs (y-values, whether used or not).
● Range → the set of actual outputs that appear.

👉 Example:

● f(x) = x², Domain = {1, 2, 3}

 ● Outputs: {1, 4, 9} → this is the Range.

3. 🔹 Function Notation

We usually write functions as:

f(x)=rule for output

● Example: f(x) = 2x + 1
○ f(1) = 2(1) + 1 = 3
○ f(2) = 2(2) + 1 = 5
○ f(3) = 2(3) + 1 = 7

So the relation is:

{(1, 3), (2, 5), (3, 7)}

4. 🔹 Kinds of Functions

1. One-to-One (Injective) → Each input has a unique output, and no outputs are
repeated.
○ Example: f(x) = x + 1 → {1→2, 2→3, 3→4}
2. Onto (Surjective) → Every element in the codomain is used as an output.
○ Example: f: {1,2,3} → {a,b,c}, f(1)=a, f(2)=b, f(3)=c
3. Bijective → Both one-to-one AND onto.

5. 🔹 Real-Life Examples of Functions

● A student’s ID number → corresponds to exactly one student.

● A country’s capital city → exactly one capital per country.
● Vending machine: Insert coin → get exactly one snack.

✅ Key Idea (pp. 71–77):

A function is a relation where every input has exactly one output. Functions help us
model real-life relationships (like time → distance, hours studied → grade).

Binary Operations & Logic

1. 🔹 Binary Operations
A binary operation is a rule that combines two elements of a set to produce another element
of the same set.

● Example on integers:
○ Addition (+): 2 + 3 = 5
○ Multiplication (×): 4 × 2 = 8

👉 The result is still an integer, so it’s a valid binary operation.

✅ Properties of Binary Operations

1. Closure Property

Definition:
For all a, b in a set S, a * b is also in S.

👉 Example 1: Addition of integers

● 2 + 3 = 5 → still an integer.
● (–4) + (–6) = –10 → still an integer.
✅ Addition is closed in integers.

👉 Example 2: Subtraction in natural numbers

● 3 – 5 = –2 → not in natural numbers.

❌ Subtraction is not closed in natural numbers.

2. Commutative Property

Definition:
Order does not matter:

a∗b=b∗aa∗b=b∗a

👉 Example 1: Addition in integers

● 4 + 7 = 11
● 7 + 4 = 11
✅ Equal → Commutative.

👉 Example 2: Subtraction in integers

● 5–3=2
 ● 3 – 5 = –2
❌ Not equal → Not commutative.

3. Associative Property

Definition:
Grouping does not matter:

(a∗b)∗c=a∗(b∗c)(a∗b)∗c=a∗(b∗c)

👉 Example 1: Addition in integers

● (2 + 3) + 4 = 5 + 4 = 9
● 2 + (3 + 4) = 2 + 7 = 9
✅ Equal → Associative.

👉 Example 2: Division in integers

● (8 ÷ 4) ÷ 2 = 2 ÷ 2 = 1
● 8 ÷ (4 ÷ 2) = 8 ÷ 2 = 4
❌ Not equal → Not associative.

4. Identity Property

Definition:
There exists an element e in S such that:

a∗e=e∗a=aa∗e=e∗a=a

👉 Example 1: Addition

● Identity element = 0
● 5 + 0 = 5, 0 + 5 = 5 ✅

👉 Example 2: Multiplication

● Identity element = 1
● 7 × 1 = 7, 1 × 7 = 7 ✅

5. Inverse Property

Definition:
For each a in S, there exists an element b such that:
a∗b=ea∗b=e

(where e is the identity element).

👉 Example 1: Addition (identity = 0)

● Inverse of 5 = –5
● 5 + (–5) = 0 ✅

👉 Example 2: Multiplication (identity = 1)

● Inverse of 6 = 1/6
● 6 × 1/6 = 1 ✅

🔹 Illustrative Examples

Example 1: Is multiplication closed in natural numbers?

● Test: 2 × 3 = 6 (natural number), 4 × 5 = 20 (natural number).

✅ Yes, it’s closed.

Example 2: Is subtraction commutative in integers?

● 7–2=5
● 2 – 7 = –5
❌ Not equal → Not commutative.

Example 3: Check associativity of addition in whole numbers.

● (1 + 2) + 3 = 3 + 3 = 6
● 1 + (2 + 3) = 1 + 5 = 6
✅ Equal → Associative.

Example 4: Find the identity in multiplication.

● 1 × 9 = 9, 9 × 1 = 9
● Works for any number.
✅ Identity = 1.
Example 5: Find the additive inverse of –7.

● (–7) + 7 = 0
✅ Inverse of –7 is +7.

✅ Summary of Properties with Examples:

Property Addition Multiplication Subtraction Division

(Integers) (Integers) (Natural (Integers)
Numbers)

Closure ✅ Yes ✅ Yes ❌ No ❌ No

Commutative ✅ Yes ✅ Yes ❌ No ❌ No

Associative ✅ Yes ✅ Yes ❌ No ❌ No

Identity 0 1 ❌ None ❌ None

Inverse –a 1/a (for a≠0) ❌ None ❌ None

2. 🔹 Logic and Mathematical Sentences

a) Statements

● A statement is a sentence that is either true or false.

● Examples:
○ “The sun rises in the east.” ✅ True
○ “5 + 3 = 9.” ❌ False

b) Logical Connectives

● ¬ (NOT A) → reverses truth.

● ∧ (A AND B) → true only if both are true.
● ∨ (A OR B) → true if at least one is true.
● → (IF A THEN B) → false only if A is true and B is false.
● ↔ (A IFF B) → true if A and B have the same truth value.

c) Truth Tables

Example: A and B
 A B A∧B A∨B A→B A↔B

T T T T T T

T F F T F F

F T F T T F

F F F F T T

✅ Key Idea (pp. 78–84):

● Binary operations describe how numbers combine under rules.

● Logic makes math precise using statements, connectives, and truth tables.

SUMMARY:

📘 Module 2: Mathematical Language & Symbols – Cheat Sheet

🔹 Mathematical Language

● Characteristics: Precise, Concise, Powerful

● Expression = noun (e.g., 3x, 5+2)
● Sentence = complete thought, true/false (e.g., 3+2=5)
● Symbols:
○ ∈ element of, ∪ union, ∩ intersection
○ → implies, ↔ iff, ∧ and, ∨ or, ¬ not

🔹 Sets

● Collection of objects { }
● Forms: Roster, Set-builder
● Types: Empty ∅, Finite, Infinite, Equal, Equivalent
● Operations:
○ Union (∪) → combine
○ Intersection (∩) → common
○ Difference (–) → in A not in B
○ Complement (A′) → not in A

🔹 Relations
 ● A relation = subset of Cartesian product (A×B)
● Properties:
○ Reflexive → (a,a) for all a
○ Symmetric → if (a,b) then (b,a)
○ Transitive → if (a,b) and (b,c), then (a,c)
● Equivalence Relation = reflexive + symmetric + transitive

🔹 Functions

● A special relation: each input → one output

● Terms: Domain, Codomain, Range
● Notation: f(x) = rule
● Types:
○ Injective (1–1)
○ Surjective (onto)
○ Bijective (both)

🔹 Binary Operations

● Combine 2 elements → result still in the set

● Properties:
1. Closure: stays in the set
2. Commutative: ab = ba
3. Associative: (ab)c = a(bc)
4. Identity: a*e = a
5. Inverse: a*b = e (where e = identity)

🔹 Logic

● Statements = True/False sentences

● Connectives:
○ ¬ NOT, ∧ AND, ∨ OR, → If-Then, ↔ IFF
● Truth tables show results systematically
○ Example:
■ T∧F=F
■ T∨F=T
■ T→F=F
■ F→T=T

✅ Quick Recap:

● Math = language → symbols, rules, and precision.

● Sets group objects, relations connect them, functions assign one output per input.
● Binary operations describe how elements combine (closure, commutativity, etc.).
● Logic ensures accuracy using truth tables.