Ultimate Guide to The Nature of Proof in HSC Mathematics Extension 2

Introduction

At the highest level of high school mathematics, computation takes a back seat to rigorous logic and deductive reasoning. The Nature of Proof topic in HSC Mathematics Extension 2 equips you with the formal language and advanced techniques necessary to construct, deconstruct, and verify mathematical truths. From manipulating inequalities to performing advanced proofs by induction, this topic requires a shift in how you think about and communicate mathematics.

Executive Summary

This comprehensive guide covers the essential components of the Nature of Proof syllabus:

Language and Notation of Proof: Mastering the logic of implications, converses, contrapositives, negations, and quantifiers ( $\forall$ and $\exists$ ).
Methods of Proof: Using proof by contradiction and evaluating statements with counterexamples.
Proof of Inequalities: Building inequalities from $x^2 \ge 0$ , applying the AM-GM inequality, the triangle inequality, and using calculus and the squeeze theorem.
Further Mathematical Induction: Proving results in trigonometry, calculus, inequalities, and recursive formulas using mathematical induction.

What is this about?

In earlier years, you were often asked to "solve" or "evaluate". In Extension 2, you are frequently asked to "show that" or "prove". This topic teaches you the underlying architecture of mathematical arguments. You'll learn the difference between a statement and its converse (just because "if it is raining, the ground is wet" is true, doesn't mean "if the ground is wet, it is raining" is true). You will also learn how to logically tear down false statements and build undeniable proofs using inequalities and advanced induction.

Main Content

1. The Language and Notation of Proof

A proposition or statement is a sentence that is strictly true or false (but not both). We use specific notation to connect these statements:

Implication: $P \implies Q$ ("If $P$ , then $Q$ ")
Negation: $\sim P$ or $\neg P$ ("Not $P$ ")
Converse: $Q \implies P$ (May not share the truth value of the original implication)
Contrapositive: $\sim Q \implies \sim P$ (Logically equivalent to the original implication, $P \implies Q \equiv \sim Q \implies \sim P$ )
Equivalence: $P \iff Q$ (" $P$ if and only if $Q$ ")

Quantifiers:

$\forall$ means "for all" or "for every".
$\exists$ means "there exists" or "for some". When negating a statement, "for all" becomes "there exists", and vice-versa. For example, the negation of "All swans are white" ( $\forall x, P(x)$ ) is "There exists at least one swan that is not white" ( $\exists x, \sim P(x)$ ).

2. Proof by Contradiction

To prove a statement $P$ is true by contradiction, you assume that $\sim P$ (the opposite) is true. Through valid logical steps, you arrive at a mathematical absurdity (a contradiction, like $1 = 0$ ). Since the logic was sound, the initial assumption ( $\sim P$ ) must be false, meaning $P$ is true. This is commonly used to prove that $\sqrt{2}$ is irrational or that there are infinitely many prime numbers.

3. Proof of Inequalities

Inequality proofs are often built from one foundational truth: the square of any real number is non-negative ( $x^2 \ge 0$ ). By manipulating $(x - y)^2 \ge 0$ , you can derive the famous Arithmetic Mean - Geometric Mean (AM-GM) Inequality: $\frac{x + y}{2} \ge \sqrt{xy}$ for $x, y \ge 0$ .

Other crucial inequality tools include:

The Triangle Inequality: $|x + y| \le |x| + |y|$
Calculus: Using derivatives to show a function is strictly increasing or decreasing to establish bounds.
The Squeeze Theorem: If $f(x) \le g(x) \le h(x)$ and $\lim_{x \to a} f(x) = \lim_{x \to a} h(x) = L$ , then $\lim_{x \to a} g(x) = L$ .

4. Further Mathematical Induction

While you learned the basics of mathematical induction (Base Case, Inductive Assumption, Inductive Step) in Extension 1, Extension 2 pushes this further:

Inequalities: Proving that $2^n > n^2$ for certain values of $n$ .
Calculus & Trigonometry: Proving general rules for the $n$ th derivative of a function or trigonometric sums like de Moivre's theorem.
Recursive Formulas: Sequences where each term relies on the previous term (e.g., $a_n = 2a_{n-1} + 3$ ) can be explicitly solved and proven using induction.

mini-FAQ page

Q: If I want to disprove a statement, how much work do I need to do? A: To disprove a universal statement (a "for all" statement), you only need to provide one counterexample. You do not need to write a long algebraic proof.

Q: Is proving the contrapositive actually acceptable in an exam? A: Absolutely! Because a statement and its contrapositive are logically equivalent, proving the contrapositive is considered a perfectly valid (and sometimes much easier) way to prove the original statement.

Common mistakes to avoid

Assuming the Converse is True: "If a polygon is a square, it has four sides" is true. The converse, "If a polygon has four sides, it is a square", is false (it could be a rectangle). Never assume $Q \implies P$ just because $P \implies Q$ .
Working Backwards with Inequalities: In inequality proofs, you should start from a known fact (like $(a-b)^2 \ge 0$ ) and work towards the required result. Do not start with what you are trying to prove and work backwards unless you carefully ensure every step is reversible (using $\iff$ ).
Forgetting the Domain in AM-GM: The Arithmetic Mean - Geometric Mean inequality $\frac{x + y}{2} \ge \sqrt{xy}$ only applies when $x$ and $y$ are non-negative.

Practice on Vu's Maths Hub

Logic and proof require practice and exposure to many different problem types. Develop your mathematical rigour with our resources:

Learn the foundations of logical structure and induction in our HSC Proofs Booklet.
Master advanced inequalities and the AM-GM theorem using the HSC Inequalities Booklet.
Challenge yourself with the toughest proof questions in the HSC Last Resorts Booklet.

Connect with me

Want to write flawless mathematical proofs and maximize your marks in HSC Extension 2? Visit Vu's Maths Hub for in-depth booklets, rigorous worked solutions, and expert advice to help you master the art of proof!