Mathematical Argument Structure

In VCE Specialist Mathematics, a mathematical proof is a rigorous argument that demonstrates the truth of a statement beyond any doubt. It relies on a logical progression from established facts and assumptions to a necessary conclusion.

1. Foundational Elements of Logic

Mathematical arguments are built using specific building blocks:

• Axioms: Statements that are accepted as true without proof. They serve as the starting point for all mathematical reasoning (e.g., the commutative property $a + b = b + a$).
• Definitions: Precise descriptions of the meaning of terms.
  • Example: An integer $n$ is even if there exists an integer $k$ such that $n = 2k$.
  • Example: An integer $n$ is odd if there exists an integer $k$ such that $n = 2k + 1$.
• Theorems: Statements that have been proven true using axioms, definitions, and previously established theorems.
• Conjectures: Statements that are suspected to be true but have not yet been proven. Once proven, they become theorems.

KEY TAKEAWAY: Every proof must begin with clear definitions. If you are proving a property of odd numbers, your first step is almost always to define the number algebraically as $2k+1$.

2. Conditional Statements and Equivalence

Most mathematical theorems are written as conditional statements.

• Implication ($P \Rightarrow Q$): “If $P$, then $Q$.” $P$ is the hypothesis (assumption) and $Q$ is the conclusion.
• Converse ($Q \Rightarrow P$): The reverse of the implication. Note that if an implication is true, its converse is not necessarily true.
• Equivalence ($P \Leftrightarrow Q$): “P if and only if Q” (iff). This means both $P \Rightarrow Q$ and $Q \Rightarrow P$ are true.
• Contrapositive ($\neg Q \Rightarrow \neg P$): “If not $Q$, then not $P$.” A statement and its contrapositive are logically equivalent (if one is true, the other must be true).

STUDY HINT: When asked to find the contrapositive in a multiple-choice question, negate both the hypothesis and the conclusion, and then swap their positions.

3. Methods of Proof

Direct Proof

This involves a chain of logical deductions leading directly from the hypothesis to the conclusion.
* Method: Assume $P$ is true $\rightarrow$ apply definitions/axioms $\rightarrow$ show $Q$ is true.

Proof by Contrapositive

Used when proving $P \Rightarrow Q$ directly is difficult, but proving $\neg Q \Rightarrow \neg P$ is simpler.
* Method: Assume the negation of the conclusion ($\neg Q$) $\rightarrow$ use logical steps $\rightarrow$ arrive at the negation of the hypothesis ($\neg P$).

Proof by Contradiction

A powerful method where you assume the statement you are trying to prove is false and show that this leads to a logical impossibility (a contradiction).
* Method:
1. Assume the negation of the statement is true.
2. Use logical reasoning to reach a contradiction (e.g., $0=1$, or a number being both rational and irrational).
3. Conclude that the original statement must therefore be true.
* Classic Example: Proving $\sqrt{2}$ is irrational.

Disproof by Counterexample

To prove a universal statement (e.g., “For all $n \in \mathbb{N} \dots$”) is false, you only need to provide one specific case where the statement does not hold.
* Example: To disprove “All prime numbers are odd,” simply point to the number $2$.

EXAM TIP: If a question asks you to “Show that the statement is false,” do not try to provide a general algebraic proof. Simply find one value for $n$ that fails and show the calculation.

4. Proof by Mathematical Induction

Mathematical Induction is used to prove that a proposition $P(n)$ is true for all natural numbers $n \in {1, 2, 3, \dots}$ (or for $n \ge n_0$).

The Four-Step Process:

1. Step 1: Proposition: State the proposition $P(n)$ clearly.
2. Step 2: Base Case: Show that $P(1)$ is true (or the smallest applicable value for $n$).
3. Step 3: Inductive Hypothesis: Assume $P(k)$ is true for some $k \in \mathbb{N}$.
   • Write out the expression for $P(k)$.
4. Step 4: Inductive Step: Show that if $P(k)$ is true, then $P(k+1)$ must be true.
   • This is the core of the proof. You must use the assumption from Step 3.
5. Conclusion: State that since $P(1)$ is true and $P(k) \Rightarrow P(k+1)$, then by the principle of mathematical induction, $P(n)$ is true for all $n \in \mathbb{N}$.

Common Applications in VCE:

• Summation series: $\sum_{i=1}^{n} f(i) = S_n$
• Divisibility: Prove $f(n)$ is divisible by $d$.
  • Hint: In the inductive step, express $f(k+1)$ in terms of $f(k)$.
• Inequalities: Prove $f(n) > g(n)$ for $n \ge a$.
• Matrix Algebra: Prove $A^n$ follows a specific pattern.

VCAA FOCUS: In the Inductive Step ($k+1$), examiners look for a clear substitution of the “Assumption” (Step 3). If you do not explicitly use the $P(k)$ assumption, you will lose marks for the structure of the proof.

5. Summary Table of Argument Types

REMEMBER: A mathematical proof is like a ladder. Induction is the perfect analogy: the Base Case is getting onto the first rung, and the Inductive Step proves that if you are on any rung ($k$), you can always reach the next one ($k+1$). Therefore, you can climb the whole ladder.