Specialist Mathematics · Unit 1 · Topic 2

Introduction to proof

The language and methods of proof. Number sets and set notation, implication, converse, contrapositive and negation, quantifiers, counterexamples, direct proofs with integers, recurring decimals and proof by contradiction.

  • 8 lessons
  • 2 h 15 min of lessons
  • 16 worked examples
  • 10 hours in the syllabus
0 of 8

Start here

Number sets and set notation

Lesson 1 of 8 · 14 min

Start the topic

Lessons

8
  1. Number sets and set notation (up next)

    Name the number systems Z+\mathbb{Z}^+, Z−\mathbb{Z}^-, Z\mathbb{Z}, Q\mathbb{Q}, Q′\mathbb{Q}' and R\mathbb{R}, decide which sets a number belongs to, and write membership with ∈\in and ∉\notin.

  2. Statements, negation and quantifiers

    Recognise statements, write their negations, and read, write and negate statements that use "for all" (∀) and "there exists" (∃).

  3. Implication, converse, contrapositive and equivalence

    Write the converse and contrapositive of an implication, decide which must be true, and use ⇒\Rightarrow, ⇔\Leftrightarrow and == correctly in mathematical working.

  4. Examples and counterexamples

    Disprove a "for all" statement with a single counterexample, prove a "there exists" statement with a single example, and see why examples alone never prove a general result.

  5. Direct proof with integers

    Prove results about odd, even and consecutive integers and divisibility by writing a general integer algebraically and reasoning step by step to the conclusion.

  6. Proof by cases and by contrapositive

    Prove results for every integer by splitting into cases such as odd and even, and prove an implication by proving its contrapositive instead.

  7. Rational numbers as decimals

    Explain why every fraction gives a terminating or recurring decimal, predict which, and convert recurring decimals back into fractions in lowest terms.

  8. Proof by contradiction and irrational numbers

    Prove a statement by assuming it is false and reaching something impossible, and use the method to prove that 2\sqrt{2}, 3\sqrt{3} and numbers built from them are irrational.

  9. Topic quiz

    Ten questions across the topic, from foundation to complex unfamiliar. Your results feed your mastery.

About this topic

Check that n2+n+41n^2 + n + 41 is prime for n=1,2,3,…,39n = 1, 2, 3, \ldots, 39 and you will find it is, every time. Is it prime for every positive integer nn? No: at n=40n = 40 it equals 41241^2. Thirty-nine examples did not prove the statement, but one counterexample was enough to disprove it.

That is what this topic is about: how mathematicians know something is true for every case, not just the cases they have checked. You will learn the precise language of proof (number sets, implication, converse, contrapositive, negation and the quantifiers ∀\forall and ∃\exists), then the methods: direct proof, proof by cases, proof using the contrapositive and proof by contradiction. You will use them to prove facts about odd and even numbers, about divisibility, about decimals, and finally that 2\sqrt{2} is irrational.

Proof runs through the rest of Specialist Mathematics, from circle and vector proofs in Unit 2 to induction in Unit 3. The habits you build here, defining every letter, justifying every step and finishing with a conclusion, are what earn the marks there too.

Before you start

  • Working with integers, fractions, decimals, primes and factors (Year 10).
  • Expanding and factorising algebraic expressions, including (a+b)2(a + b)^2 and the difference of two squares.
  • Basic set language: a set, an element, a subset, union and intersection, and Venn diagrams.
  • Square roots and surds, such as 8=22\sqrt{8} = 2\sqrt{2}.

What QCAA says you need to know10 dot points

The nature of proof

5 hours

Rational and irrational numbers

5 hours

Subject matter from the Specialist Mathematics General senior syllabus 2025 v1.4 (opens in a new tab), CC BY 4.0 © State of Queensland (QCAA).

The focus areas you can practise on their own. Each one maps to dot points above.

  • Number sets and notation

    Classify numbers as elements of ℤ⁺, ℤ⁻, ℤ, ℚ, ℚ′ and ℝ, and read and write statements with ∈ and ∉.

    Practise
  • Negation and quantifiers

    Read and write statements with ∀ and ∃, and negate statements, including quantified ones.

    Practise
  • Implication, converse and contrapositive

    Write the converse and contrapositive of P ⇒ Q, and decide which of them must be true.

    Practise
  • Equivalence and logical symbols

    Use ⇒, ⇔ and = correctly, and recognise when a statement is an "if and only if".

    Practise
  • Examples and counterexamples

    Disprove a "for all" statement with one counterexample, and prove a "there exists" statement with one example.

    Practise
  • Direct proof with integers

    Prove results about odd, even and consecutive integers and divisibility by writing them as 2k, 2k + 1 and so on.

    Practise
  • Proof by cases

    Prove a result for every integer by splitting into cases, such as n even and n odd, or remainders on division by 3.

    Practise
  • Proof using the contrapositive

    Prove P ⇒ Q by proving not Q ⇒ not P, for example "if n² is even then n is even".

    Practise
  • Rational numbers as decimals

    Decide whether a fraction terminates or recurs, convert fractions to decimals, and convert recurring decimals to fractions.

    Practise
  • Proof by contradiction

    Assume the statement is false, reason to something impossible, and conclude that the statement is true.

    Practise
  • Proving irrationality

    Prove numbers such as √2, √3 and 2 + √5 are irrational by contradiction.

    Practise

Worked examples16

All 16

Common mistakes

Proving a "for all" statement with examples

Checking n=1,2,3n = 1, 2, 3 (or a thousand values) proves nothing about every nn. Use a general element, such as n=2k+1n = 2k + 1 with k∈Zk \in \mathbb{Z}, so the argument covers every case at once.

Using the same letter for two different numbers

For "the sum of two odd numbers is even", write m=2a+1m = 2a + 1 and n=2b+1n = 2b + 1. Writing both as 2k+12k + 1 only proves it when the two numbers are equal.

Confusing the converse with the contrapositive

For P⇒QP \Rightarrow Q, the converse swaps the parts (Q⇒PQ \Rightarrow P); the contrapositive swaps and negates them (¬Q⇒¬P\neg Q \Rightarrow \neg P). Only the contrapositive is guaranteed to have the same truth value.

Negating "all" as "none"

The negation of "all swans are white" is "there exists a swan that is not white", not "no swans are white".

Writing ⇒ between expressions

⇒\Rightarrow joins statements, never expressions. Write (x+1)2=x2+2x+1(x + 1)^2 = x^2 + 2x + 1, not (x+1)2⇒x2+2x+1(x + 1)^2 \Rightarrow x^2 + 2x + 1.

Claiming ⇔ when only ⇒ holds

x=3⇒x2=9x = 3 \Rightarrow x^2 = 9, but x2=9⇏x=3x^2 = 9 \not\Rightarrow x = 3, because xx could be −3-3. Check both directions before writing ⇔\Leftrightarrow.

A rational form with an irrational top or bottom

21\frac{\sqrt{2}}{1} is a fraction, but it does not show 2\sqrt{2} is rational: the definition needs integers pp and qq.

Not stating the assumption or the contradiction

A proof by contradiction must say what is being assumed ("Suppose 2\sqrt{2} is rational"), point to the contradiction exactly, and finish with a conclusion. Markers look for all three.

Forgetting lowest terms in the 2\sqrt{2} proof

The contradiction in the 2\sqrt{2} proof is that pp and qq are both even. That only contradicts something if you assumed pq\frac{p}{q} was in lowest terms.

Thinking 0.999… is less than 1

If x=0.9‾x = 0.\overline{9} then 10x−x=910x - x = 9, so x=1x = 1. A recurring decimal is an exact number, not an approximation.

Exam tips

  1. "Prove" and "show that" questions are marked on the reasoning. State what each letter represents (for example "let n=2k+1n = 2k + 1, where k∈Zk \in \mathbb{Z}"), justify each step and end with a sentence that answers the question.

  2. Finish an integer proof by writing the result in the required form and saying why: "2(2k2+2k)+12(2k^2 + 2k) + 1 is odd, since 2k2+2k∈Z2k^2 + 2k \in \mathbb{Z}."

  3. To disprove a statement, one specific counterexample with the calculation shown is a complete answer. Say clearly that it satisfies the hypothesis and fails the conclusion.

  4. In a proof by contradiction, label the parts: "Assume, for contradiction, …", then "This contradicts …", then "Hence …".

  5. When asked for a converse or contrapositive, write the full statement in words or symbols, then answer any "is it true?" part separately with a proof or a counterexample.

  6. For recurring decimals, show the subtraction: multiply by the right power of 10 so the repeating parts line up, subtract, solve and simplify the fraction.

  7. Use ⇒\Rightarrow between lines of working only when each line really follows from the one before, and == only between equal quantities.

Where this shows up

  • Computer science: proofs that an algorithm always terminates or always gives the right answer, and the logic of if–then statements in code.

  • Cryptography: the security of online banking rests on proven facts about primes and divisibility.

  • Law and argument: the difference between a statement and its converse ("all thieves were at the scene" does not mean "everyone at the scene is a thief").

  • Engineering and safety: a single counterexample, one failed test, is enough to show a design does not always work.

  • Measurement: the diagonal of a 1 m square tile is 2\sqrt{2} m, a length that can never be written exactly as a fraction of a metre.

Save your progress with a free account