The Nature of Mathematics - Comprehensive Study Notes

Language and Symbols in Mathematics

Core idea: Mathematics is a precise, concise, and powerful language for describing objects, relations, and operations. It uses its own vocabulary (expressions) and rules for forming complete thoughts (sentences).
Learning outcome orientation (from the transcript):
- Discuss language, symbols, and conventions of mathematics (K)
- Explain the nature of mathematics as a language (K)
- Perform operations on mathematical expressions correctly (S)
- Recognize mathematics as a useful language (V)

Expressions vs Sentences: the language split in mathematics

Expressions
- A mathematical analogue of a noun: a correct arrangement of symbols that denotes a mathematical object of interest.
- Does not state a complete thought; cannot be true or false by itself.
- Examples: numbers, ordered pairs, sets, matrices, functions, vectors.
- Common types discussed: numbers, sets, and functions (in this lesson).
- Notation examples: 3, 2+4, 1/3, ext{(ordered pairs)}, ext{(sets)}, ext{(functions)}
Sentences
- The mathematical analogue of an English sentence: a correct arrangement of symbols that states a complete thought.
- It can be true, false, or sometimes true/sometimes false.
- How to decide if something is a sentence:
  1) Read aloud: does it state a complete thought?
  2) Or ask: does it make sense to discuss the truth value of this object?
- Examples: 10+3=13, or a statement like "Naga City is the heart of the Bicol region" (in English) translates to a mathematical sentence in the appropriate formalism.
Quick reference: common pairings
- Noun (English) → Expression (Mathematics): a name for a mathematical object of interest (e.g., 3, \, {1,2,3}, f)
- Sentence (English) → Sentence (Mathematics): a complete mathematical statement that can be true/false (e.g., 10+3=13)

Conventions in Mathematical Language

All languages have conventions that help distinguish types of expressions.
In mathematics, conventions help learners distinguish between different expression types.
Key conventions (as described in the transcript):
- Letters denote numbers, constants, and variables; they can label objects such as lines, points, functions, sets, events, etc.
- Numbers are usually represented by lowercase letters.
- Sets are usually represented by uppercase letters.
- A set of real numbers is typically denoted using lowercase letters from the end of the alphabet (e.g.,
  a, b, c, …) or standard symbols like \mathbb{R}, and standard number sets follow their own conventions:
- Real numbers: \mathbb{R}
- Integers: \mathbb{Z}
- Natural numbers: \mathbb{N}
Practical takeaway: use a consistent convention to avoid ambiguity when naming objects, sets, and numbers.

Four Basic Concepts: Sets, Functions, Relations, and Binary Operations

1. Sets

A set is a collection of objects called elements. Cantor popularized the term in 1879.
Notation:
- If x\in S, then x is an element of S.
- Sets may be described by roster notation: list all elements between braces: S = {a, b, c}
- Ellipsis \dots is read as “and so forth” for long lists.
- Set-builder notation: S_P = {x\in S \mid P(x)} denotes the set of all elements x in S that satisfy the property P.
Examples
- The set of all colors in the rainbow: red ∈ colorSet.
- The set of odd numbers from 1 to 50: 31 ∈ {1,3,5, …, 49}.
Subsets
- If A, B are sets, A\subseteq B means every element of A is also an element of B (A is a subset of B).
- Proper subset: A\subset B means every element of A is in B, and there exists at least one element of B not in A.
Notation and examples from the transcript:
- Example sets: A = {1,2,3,4,5}\; B = {1,2,3}\; C = {1,6}\n - Subset relations illustrated in the transcript with statements like A\subseteq B and the idea of proper subsets where appropriate.

2. Functions

A function from a set A to a set B assigns to each element of A exactly one element of B.
Notation:
- Domain: the set of objects that can be transformed.
- Range: the set of objects they can be transformed into.
- Function notation: f:A\to B, \quad f(x)=y, where x\in A and y\in B.
- Alternative form: f: A \to B,\; f(x)=y.
Important equivalences:
- The statement f:A\to B means f is a rule that assigns to each x\in A a corresponding y=f(x)\in B.
Examples (types of expressions often encountered as functions):
- A mapping from numbers to numbers: f: \mathbb{R}\to \mathbb{R},\; f(x)=x^2
- A mapping from a set to a set: g: A\to B,\; g(a)\in B

3. Relations

A relation from one set to another is a subset of their Cartesian product; i.e., a subset of A\times B.
Notation: x is related to y by R, written x\,R\, y if and only if (x,y)\in R.
The domain of a relation is the set of all first components; the co-domain is the set of second components.
An equivalence relation on a set is a relation that is:
- Reflexive: \forall x\in A,\; x\,R\, x.
- Symmetric: \forall x,y\in A,\; x\,R\, y \Rightarrow y\,R\, x.
- Transitive: \forall x,y,z\in A,\; x\,R\, y \land y\,R\, z \Rightarrow x\,R\, z.
Example properties from the transcript: the triad reflexive, symmetric, transitive characterizes equivalence relations (as shown on the slide with the symbol ~ or ∼ for relation).

4. Binary Operations

A binary operation on a nonempty set A is a function from A\times A to A.
It takes two elements from A and returns another element in A, i.e., a rule: (x,y)\mapsto x\ast y\in A.
Common binary operations: addition, subtraction, multiplication, division, exponentiation, etc. (notated with symbols like +, -, (\times), \div, ^{}).
Examples from the transcript (represented generically):
- On A = \mathbb{R}, define x*y = x + y.
- On B = \mathbb{Z}, define x*y = xy.
- On a subset C = \mathbb{N}^*, define x*y = xy (product on the positive naturals).
Properties of binary operations (the four basic ones):
- Closure: for all x,y\in A, x\ast y\in A.
- Associativity: \forall x,y,z\in A,\; (x\ast y)\ast z = x\ast(y\ast z).
- Example: with \ast=+ on \mathbb{R}, (2+3)+5 = 2+(3+5).
- Commutativity: \forall x,y\in A,\; x\ast y = y\ast x.
- Example: with \ast=+ on \mathbb{R}, $2+3 = 3+2$.
- Identity element: there exists an e\in A such that \forall x\in A, x\ast e = e\ast x = x.
- Example: In $(\mathbb{R},+)$, the identity is e=0 since x+0=0+x=x.
- Inverse (for a given element): if there is an e (identity) such that for each x\in A there exists y\in A with x\ast y = y\ast x = e.
- Example: In $(\mathbb{R},+)$, the inverse of x is -x since x+(-x)=0.
An example from the slides: the operation x\ast y = x+y-xy defined on a set A\subseteq \mathbb{R} (with domain restrictions as needed) is commutative and associative on its domain; its identity is 0 (since x+0- x\cdot 0 = x); the inverse of an element x\in A (when defined) is y = -\dfrac{x}{1-x} for the case where the inverse exists (note: this requires that the denominator is nonzero, i.e., x\neq 1).

Expressions, Sentences, and Formal Translation

Formal language vs ordinary language:
- Formal mathematical language reduces ambiguity and enables precise reasoning.
- When translating natural-language statements into mathematics, we introduce variables, quantify them, and use logical connectives.

Connectives, Quantifiers, Negation, Variables (overview)

Connectives (logical operators):
- And: \land
- Or: \lor
- Implies (If … then …): \to
- If and only if: \leftrightarrow
Truth-functional nature: the truth value of a compound statement is determined by its components.
Examples (from the transcript):
- (1) Alex will attend the acting workshop OR the dance workshop. → truth depends on the actual attendance.
- (2) 3 is odd AND 6 is even. → conjunction of two facts.
- (3) IF today is Monday, THEN tomorrow is Tuesday. → an implication.
- (4) Andrea can go on a vacation iff she passed the course. → biconditional.

Quantifiers

Quantifiers in English (all, some, every, nothing) can be ambiguous; math uses two clear quantifiers:
- For all / Every: \forall
- There exists / For some: \exists
Reading principle: statements such as "For every x there exists a y such that …" can be rearranged only under certain independence conditions. If the inner variable is independent of the outer variable, you can swap the order; otherwise, you cannot.
Examples (from the transcript):
- For every person, there exists a fruit that they like: \forall x\in \text{People}, \exists y\in \text{Fruits}, P(x,y).
- There exists a fruit such that for every person, they like that fruit: \exists y\in \text{Fruits}, \forall x\in \text{People}, P(x,y).
Reading these two forms highlights the uniformity vs dependence of choices on outer quantifiers.

Negation

Negation is the logical opposite of a statement. The negation operator is often written as a tilde ¬ or ~.
Key rule: The negation of a statement swaps truth value: if a statement is true, its negation is false, and vice versa.
Negation of a quantified statement is not simply reversing the quantifier; you negate the predicate inside and switch the quantifier, where appropriate.
Examples (from the transcript):
- Negation of the statement "Some dogs are friendly" is "No dogs are friendly" or equivalently "All dogs are not friendly" (careful with formulation).
- Negation of "All grass are green" is "Some grass are not green".
- Negation of "No even numbers are odd numbers" is "Some even numbers are odd numbers".

Negation of Quantifiers (summary)

Quantifier and its negation pairs:
- None / No: negation corresponds to the opposite of the existential claim (Some becomes None):
- None A are B ⇄ Some A are not B
- Some A are B ⇄ No A are B (or None of A are B)
- All A are B ⇄ Some A are not B
Examples from the transcript:
- No dogs are blue ⇄ Some dogs are blue (the negation of the universal statement).
- Some buildings aren’t made of concrete ⇄ All buildings are made of concrete (negation of the existential statement).

Variables

A variable is any letter used to denote a mathematical object; it can denote a member of a specified set.
A variable takes on values from a given domain and is used when quantities take different values.
Common uses for variables:
- To state a general principle: \forall x \in \mathbb{R}, \; P(x)
- To represent a sequence of operations: the expression describes the sequence (e.g., multiply by 5, then subtract 2).
- To represent an unknown: solve for x in an equation, e.g., x^2 + y^2 = y + x.
Algebraic expressions: types include
- Monomials: one nonzero term, e.g., x, 10x^2, xy^2
- Binomials: two nonzero terms, e.g., x+z, 10xy^2-5x^2
- Polynomials: two or more nonzero terms (a binomial is also a polynomial).
Examples from the transcript:
- Monomial: x, 10x^2
- Binomial: x+z, 10xy^2-5x^2
- Polynomial: 10xy^2-5x^2+3
Translating English statements using variables:
- Does there exist a real number such that its square is negative? \exists x\in \mathbb{R}, x^2 = -1.
- Given any two real numbers a and b, there exists a real number x between them: \forall a,b\in \mathbb{R}, a<b \Rightarrow \exists x\in \mathbb{R}, a<x<b.

Formality

A compact set of logical terms provides a precise language to express mathematical statements.
However, much mathematical writing in papers remains in English; formal notation is used when needed to remove ambiguity.
Example translation: "Every non-empty set of positive integers has a least element."
- Formal form (one possible standard translation):
  \forall A\;\bigl(A\subseteq \mathbb{N} \land A\neq \emptyset \Rightarrow \exists m\in A\; \forall n\in A\; m\le n\bigr).
- Explanation: there exists a least element m in A such that for all n in A, m ≤ n.
How to interpret least element: there exists an element m in A that is less than or equal to every element of A.

Examples and Practice (symbolic translations)

Examples (translated into logic form):
- For every natural number n, n ≤ n+1. \forall n\in \mathbb{N},\; n \le n+1.
- There exists a real number x such that x^2 = 9. \exists x\in \mathbb{R},\; x^2 = 9.
- A number is the least element of the set S = {1,2,3}. \exists m\in S\; (\forall n\in S,\; m\le n).
- There is a student in the class taller than 180 cm. \exists s\in \text{Class},\; height(s) > 180.
- For every two real numbers a,b, a+b = b+a. \forall a,b\in \mathbb{R},\; a+b = b+a.
Practice 1 (negations): write the negation of each quantified statement
1) There is no largest natural number. → \neg\exists n\in \mathbb{N}\; \forall m\in \mathbb{N},\; m\le n
2) Every nonzero real number has a multiplicative inverse. → \exists x\in \mathbb{R}, x\neq 0,\; (x\times y = 1 \text{ has no solution } y) (equivalently: \exists x\in \mathbb{R}, x\neq 0, \forall y\in \mathbb{R}, xy \neq 1)
3) Every prime number is greater than 1. → \exists p \text{ prime with } p \le 1 (the negation would be: \exists p\in \mathbb{P}, p\le 1\;\text{(false for primes so this is the intended negation form)}
4) For all real numbers, the square is greater than or equal to zero. → \neg \forall x\in \mathbb{R},\; x^2 \ge 0
Activity (symbol compilation):
- Suggested entries to fill in a table:
- Symbols/Notation: Infinity, Equal sign, Set notation, etc.
- How to read: e.g., \in reads as "is an element of"; \subseteq reads as "is a subset of"; \mathbb{N} denotes natural numbers; \mathbb{R} denotes real numbers.
- Meaning: provide concise explanations in your own words for how each symbol is used in mathematics.

Notation Recap (quick reference)

Sets: A,B,C,\dots denote sets; elements are written as x\in A.
Subset: A\subseteq B; Proper subset: A\subset B and sometimes A\neq B.
Functions: f:A\to B,\; f(x)=y.
Relations: subset of A\times B; relation symbol often written as R\subseteq A\times B with x\,R\, y meaning (x,y)\in R.
Binary operations: function \ast: A\times A\to A; closure means x,y\in A\Rightarrow x\ast y\in A.
Logic: connectives \land, \lor, \to, \leftrightarrow; quantifiers \forall, \exists; negation \neg or \sim.
Real numbers, integers, and natural numbers: \mathbb{R}, \; \mathbb{Z}, \; \mathbb{N}.

Summary of Significance and Real-World Relevance

Mathematical language provides a universal framework to express precise statements, reason rigorously, and communicate complex ideas unambiguously across disciplines.
The separation between expressions (objects) and sentences (truth-bearing statements) mirrors the distinction between nouns and full declarative statements in natural language, enabling systematic building of arguments.
Conventions and formalism support learning, cross-domain application, and automated reasoning in computer science, logic, and beyond.

Key Formulas to Remember (LaTeX)

Subset notation: A\subseteq B
Proper subset: A\subset B (with A\neq B)
Element of: x\in S
Set-builder notation: S_P = {x\in S\mid P(x)}
Function notation: f:A\to B,\; f(x)=y
Equivalence relation properties:
- Reflexive: \forall x\in A,\; x\,R\, x
- Symmetric: \forall x,y\in A,\; x\,R\, y \Rightarrow y\,R\, x
- Transitive: \forall x,y,z\in A,\; x\,R\, y \land y\,R\, z \Rightarrow x\,R\, z
Binary operation properties:
- Associativity: \forall x,y,z\in A,\; (x\ast y)\ast z = x\ast(y\ast z)
- Commutativity: \forall x,y\in A,\; x\ast y = y\ast x
- Identity: \exists e\in A\;\forall x\in A,\; x\ast e = e\ast x = x
- Inverse: \forall x\in A, \exists y\in A\; x\ast y = y\ast x = e
Least element formalization:\forall A\subseteq \mathbb{N},\; A\neq \emptyset \Rightarrow \exists m\in A\; \forall n\in A,\; m\le n.$$