Ultimate Guide to Considerations for Proof in HSC Mathematics

Introduction

A well-written mathematical proof uses formal mathematical notation, definitions, and terminologies to demonstrate concise and logical reasoning. In the NSW HSC Mathematics Extension 1 and Extension 2 syllabuses, the nuances between statements used in proofs and sentences used in everyday contexts require significant attention. This guide explores the foundational considerations when approaching mathematical proof, helping students avoid common pitfalls and structure their arguments effectively. For further resources, be sure to visit Vu's Maths Hub.

Executive Summary

Mathematical proof is the bedrock of rigorous mathematics. It involves transitioning from intuitive understanding to formal, unassailable logical arguments. This guide covers:

The importance of precise language and quantifiers.
The structure and interpretation of logical implications.
The role of counterexamples and proof by exhaustion.
Best practices for structuring proofs, particularly proof by induction.

By mastering these elements, students can present their mathematical reasoning clearly and accurately, a critical skill for success in their HSC exams.

What is this about?

When students first encounter formal proof, they often struggle with the rigid requirements of mathematical language. Everyday language is full of ambiguities that mathematical logic cannot tolerate. This post breaks down the specific considerations outlined in the syllabus regarding proof, translating these requirements into actionable advice for students. We will examine how to read and write logical statements, how to tackle different methods of proof, and how to format these proofs for maximum clarity.

Main Content

The Language of Logic and Quantifiers

The nuances between statements used in proofs and sentences used in everyday contexts require careful attention. For example, consider the sentence "cats are fluffy". In everyday conversation, this is understood generally. However, as a logical statement, it is ambiguous. Is it claiming "all cats are fluffy" or "there exist some cats that are fluffy"?

The use of explicit quantifiers (all, some, there exists) is essential for correct negation. The correct negation of "all cats are fluffy" is "not all cats are fluffy" (meaning there is the existence of some cats that are not fluffy). A common mistake is to incorrectly negate it as "all cats are not fluffy" (meaning no cats are fluffy).

Understanding Implications

The implication "If $P$ then $Q$ " is a statement that may be true or false. When read as an everyday sentence, it might appear to link unrelated concepts (e.g., "If a rectangle is a square, then today is Sunday"), or imply an incorrect fact. The truthfulness of the implication relies solely on what is known about $P$ and $Q$ .

The negation of the implication "If $P$ then $Q$ " is " $P$ and not $Q$ ". This can be understood by recognising that "If $P$ then $Q$ " fails only when you have $P$ , but do not have $Q$ . Consequently, the statement "If $P$ then $Q$ " is logically equivalent to "not $P$ or $Q$ ". While not strictly essential, analyzing these statements with truth tables can deepen a student's understanding.

Furthermore, students might explore the concept of "vacuous truths"—the idea that the implication "If $P$ then $Q$ " is always considered true when $P$ is false.

Disproof and Proof by Exhaustion

A single counterexample is sufficient to disprove a universal statement. However, proving a statement cannot generally be done using just a few examples. Students must recognize "proof by exhaustion"—checking every single possible case—as a valid method of proof, provided they understand its limitations (it only works for a finite number of cases).

For instance, the intuitive understanding of number properties, such as why $n^2 + n$ is always even, or why $n^3 - n$ is always divisible by 6 for $n \in \mathbb{Z}$ , can be proven by exhaustion of cases: considering when $n$ is odd (letting $n = 2k + 1$ ) and when $n$ is even (letting $n = 2k$ ).

Structuring Proof by Induction

To improve the clarity of a proof by induction, it is highly recommended to include 'signpost' statements. Phrases like "show result is true for $n=1$ " or "assume result is true for $n=k$ " help outline the structure and remind the writer of the current step before diving into algebraic manipulations. While not strictly necessary for the mathematics, they establish the structure of the proof. Remember, a proof is written for other readers (like HSC markers!); practices that improve readability and logical flow are strongly encouraged.

A convenient notation for the result to be proven is $P(n)$ ( $P$ for 'proposition'). The structure is then:

Prove $P(1)$ is true.
Assume $P(k)$ is true.
Prove $P(k+1)$ is true using the assumption.
Conclude.

Caution: Be careful not to confuse the $P(n)$ notation with polynomial notation $P(x)$ . Some resources use $S(n)$ ( $S$ for 'statement') to avoid this ambiguity.

Key Inequalities

Students should be familiar with fundamental properties of real numbers. To prove that $a^2 + b^2 \ge 2ab$ for real numbers $a$ and $b$ is equivalent to proving $(a-b)^2 \ge 0$ . This fundamental idea can be used to prove that $\frac{a}{b} + \frac{b}{a} \ge 2$ for $a,b > 0$ .

This naturally leads to the Arithmetic Mean–Geometric Mean (AM-GM) inequality. The relationship between the arithmetic mean and geometric mean can be extended to $n$ non-negative terms. Proofs for simpler cases (like $n=2$ and $n=3$ ) should be modeled and understood.

mini-FAQ page

Q: Do I always have to write "Assume true for $n=k$ "? A: Yes, clearly stating your inductive assumption is a critical part of communicating your logic in a proof by induction.

Q: Is proof by exhaustion always acceptable? A: It is acceptable if you can prove you have covered every possible case. For infinite sets, it is impossible.

Q: Why is the negation of "All A are B" not "No A are B"? A: To prove "All A are B" is false, you only need to find one A that is not B. You do not need to prove that every A is not B.

Common mistakes to avoid

Incorrect Negation: Forgetting that the negation of "For all $x$ , $P(x)$ " is "There exists an $x$ such that not $P(x)$ ".
Assuming the Converse: Assuming that if "If $P$ then $Q$ " is true, then "If $Q$ then $P$ " must also be true.
Missing the Base Case: Forgetting to explicitly prove the base case in induction.
Poor Signposting: Presenting a wall of algebra in an induction proof without explaining the logical steps being taken.

Practice on Vu's Maths Hub

To master these proof techniques, extensive practice is required. I highly recommend working through the comprehensive resources available on Vu's Maths Hub.

Specifically, check out the booklets tailored for HSC Extension 1 and 2 that cover proof:

These booklets provide the structured practice needed to refine your formal reasoning skills.

Connect with me

Need more help with mathematical proofs or any other HSC Mathematics topics? Head over to vumaths.com to access our full library of resources, past papers, and worked solutions. Let's conquer the HSC together!