A1PureFoundation

The Structure of a Mathematical Proof

A proof is a chain of logic that takes you from things already known to be true to a new statement, with every link justified. Master the language of proof here and every technique that follows becomes a variation on one idea.

25 min Video by TLMaths Proof

The big picture

Mathematics is the only subject where you can be completely certain. A scientist gathers evidence and a verdict can be overturned tomorrow; a mathematician proves a statement and it is settled forever. That certainty is what proof buys you — and it is exactly why AQA puts proof first and threads it through the whole A-Level.

The catch is that certainty has a price: checking that a statement works for a few numbers is not proof, no matter how many you try. This lesson is about the difference between “it looks true” and “it is true”, and about the small, precise vocabulary you need to argue the second one.

A-Level Maths A1-01: Introduction to ProofCurated by Kepler, not produced by us. Watch it, then work through the notes below.
Open on YouTube

What you'll be able to do

  • Explain what separates a proof from a collection of examples
  • Use the algebraic vocabulary of proof — even, odd, consecutive and rational numbers
  • Read and use the logic symbols ⇒\Rightarrow, ⇐\Leftarrow and ⇔\Leftrightarrow
  • Set out a proof so that every line follows from the last and earns the marks
1

What actually counts as a proof

A conjecture\textbf{conjecture} is a statement we believe might be true. A proof\textbf{proof} turns that belief into certainty: it is a sequence of steps, starting from definitions and results already established, where each step follows logically from the one before, ending at the statement we wanted. Once proved, a conjecture becomes a theorem\textbf{theorem}.

The single most important idea in the whole strand is this: examples are not a proof\textbf{examples are not a proof}. Suppose you claim “n2−n+41n^2 - n + 41 is prime for every positive integer nn”. Test it: n=1n=1 gives 4141, n=2n=2 gives 4343, n=3n=3 gives 4747 — all prime. Test twenty more values; still prime. It looks certain. But at n=41n=41 the expression is 41241^2, which is not prime. A pattern that holds for the first forty cases can still fail.

So to prove a statement about all\textbf{all} numbers, you cannot check them one at a time — there are infinitely many. You have to argue about a general number and show the claim is forced to hold whatever that number is.

Why this works

Checking cases can only ever do two things: it can disprove\textbf{disprove} a statement (one failure is fatal), or it can suggest\textbf{suggest} one worth proving. It can never confirm a “for all” claim, because you can never finish the list.

2

The raw material: how to write numbers algebraically

Almost every proof at A-Level is about integers, so you need to translate words like “even” into algebra you can manipulate. These are the workhorses:

Crucially, when two numbers must be different, give them different letters. “Two even numbers” is 2m2m and 2n2n, not 2n2n and 2n2n — writing 2n2n twice secretly assumes they are equal and will cost you the proof.

even=2n,odd=2n+1(n∈Z)\text{even} = 2n, \qquad \text{odd} = 2n+1 \quad (n \in \mathbb{Z})
Any even number is a multiple of 2; any odd number is one more than an even number.
n,  n+1,  n+2are consecutive integersn,\; n+1,\; n+2 \quad \text{are consecutive integers}
Consecutive numbers differ by 1 — a single letter links them all.
rational=pq,p,q∈Z,  q≠0\text{rational} = \frac{p}{q}, \quad p, q \in \mathbb{Z},\; q \neq 0
A rational number is an exact ratio of two integers.
Example 1Write an expression for a multiple of 3, and for the sum of three consecutive integers.
1A multiple of 3 is 3n3n for some integer nn.
2Three consecutive integers are nn, n+1n+1 and n+2n+2.
3Their sum is n+(n+1)+(n+2)=3n+3=3(n+1)n + (n+1) + (n+2) = 3n+3 = 3(n+1).
Answer
The sum is 3(n+1)3(n+1) — automatically a multiple of 3.

Tip — The letters N,Z,Q,R\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R} name the natural numbers, integers, rationals and reals. Writing n∈Zn \in \mathbb{Z} (“nn is an integer”) tells the reader exactly what kind of number you are arguing about.

3

The logic symbols: implies and is equivalent to

Proof is about how statements connect, and three arrows capture almost all of it. P⇒QP \Rightarrow Q means “if PP is true then QQ must be true” — PP implies QQ. P⇐QP \Leftarrow Q is the same arrow reversed: “PP is implied by QQ”. And P⇔QP \Leftrightarrow Q means both at once — PP and QQ are equivalent\textbf{equivalent}, each guaranteeing the other.

The direction matters enormously. “It is raining ⇒\Rightarrow the ground is wet” is true, but the reverse is not: the ground could be wet from a hose. So this is ⇒\Rightarrow, not ⇔\Leftrightarrow. Confusing a one-way implication with a two-way one is the most common logical error at A-Level.

P⇒Q“P implies Q”P \Rightarrow Q \quad\text{“$P$ implies $Q$”}
PP is enough (sufficient) to force QQ.
P⇔Q“P if and only if Q”P \Leftrightarrow Q \quad\text{“$P$ if and only if $Q$”}
Each implies the other — you can travel the logic both ways.
Example 1Decide whether each statement should link with ⇒\Rightarrow or ⇔\Leftrightarrow: (a) x=3  ?  x2=9x = 3 \;?\; x^2 = 9; (b) 2x=10  ?  x=52x = 10 \;?\; x = 5.
1(a) x=3⇒x2=9x=3 \Rightarrow x^2 = 9 is true. But x2=9⇒x=3x^2 = 9 \Rightarrow x = 3 is false, because xx could be −3-3. So only ⇒\Rightarrow holds.
2(b) 2x=10⇒x=52x = 10 \Rightarrow x = 5, and x=5⇒2x=10x = 5 \Rightarrow 2x = 10. Both directions work.
Answer
(a) x=3⇒x2=9x = 3 \Rightarrow x^2 = 9 (one-way). (b) 2x=10⇔x=52x = 10 \Leftrightarrow x = 5 (two-way).
Why this works

When you solve an equation by doing the same thing to both sides, you are chaining ⇔\Leftrightarrow steps — which is why solving is really a proof that your answer is the only one. Squaring is the famous exception: x=2⇒x2=2x = \sqrt{2} \Rightarrow x^2 = 2, but squaring can introduce extra solutions, so it is ⇒\Rightarrow, not ⇔\Leftrightarrow.

4

Setting out a proof that earns the marks

A full-mark proof reads like a short, self-contained argument. Three habits get you there. Start from something true\textbf{Start from something true} — a definition, a given fact, or a known result — never from the thing you are trying to prove. Justify every line\textbf{Justify every line} so a reader can see why each step follows. And finish with a clear conclusion\textbf{finish with a clear conclusion} that names what you have shown, such as “which is a multiple of 3, as required”.

Examiners award marks for the logical journey, not just the destination. A correct final line with a broken chain above it scores badly; a clearly reasoned argument with one slip usually keeps most of the marks. Communicating the logic is\textbf{is} the skill being tested.

Example 1Prove that the sum of any two odd numbers is even.
1Let the two odd numbers be 2m+12m+1 and 2n+12n+1, where m,n∈Zm, n \in \mathbb{Z}. (Different letters — they need not be equal.)
2Their sum is (2m+1)+(2n+1)=2m+2n+2(2m+1) + (2n+1) = 2m + 2n + 2.
3Factor out 2: 2m+2n+2=2(m+n+1)2m + 2n + 2 = 2(m+n+1).
4Since m+n+1m+n+1 is an integer, 2(m+n+1)2(m+n+1) is a multiple of 2, i.e. even.
Answer
The sum of two odd numbers is 2(m+n+1)2(m+n+1), which is even. ■\blacksquare

Tip — End a proof with a full concluding sentence, not just a boxed answer. The symbol ■\blacksquare (or writing “as required”) signals “this is where the argument closes”.

Think like an examiner

  • The command word “Prove\textbf{Prove}” or “Show that\textbf{Show that}” means a general argument is required — a couple of numerical examples will score zero even if the statement is true.
  • Marks are split between starting correctly\textbf{starting correctly} (a general expression such as 2n+12n+1) and reasoning to the conclusion\textbf{reasoning to the conclusion}. Setting up good algebra at the start earns method marks even if you stall.
  • A final “therefore” statement that refers back to the original claim (“…so the sum is always even”) is often worth a mark on its own. Never leave the proof hanging on a line of algebra.
  • Watch your quantifiers: a statement about “any” or “all” integers must be proved in general, whereas “there exists” only needs one example.

Common misconceptions

Proving a statement true by testing n=1,2,3n = 1, 2, 3 and a few more.
Use a general integer such as 2n+12n+1. Examples can disprove a claim but never prove a “for all” statement.
The one exception is proof by exhaustion, where the cases genuinely are finite — covered later in this chapter.
Using the same letter, e.g. 2n2n and 2n2n, for two numbers that should be independent.
Use different letters, 2m2m and 2n2n. Reusing a letter secretly assumes the two numbers are equal.
Writing ⇒\Rightarrow and ⇔\Leftrightarrow interchangeably.
Only use ⇔\Leftrightarrow when the implication genuinely runs both ways. If the converse can fail, it is ⇒\Rightarrow.
Starting the proof by writing down the thing you are trying to prove and rearranging it.
Begin from definitions or known facts and work towards the statement, so nothing is assumed.

The vocabulary of proof

2n2n
Even number (n∈Z)(n \in \mathbb{Z}).
2n+12n+1
Odd number.
n, n+1n,\, n+1
Consecutive integers.
pq,  q≠0\tfrac{p}{q},\; q\neq 0
Rational number.
P⇒QP \Rightarrow Q
PP implies QQ (one-way).
P⇔QP \Leftrightarrow Q
PP if and only if QQ (both ways).

Stretch yourself

A student writes: “x2>xx^2 > x, therefore x>1x > 1.” Using an implication arrow, explain precisely what is wrong, and state the correct relationship.

Hint — Try a negative value, or a value between 0 and 1, in x2>xx^2 > x.

Reveal solution
SolutionThe claim assumes x2>x⇒x>1x^2 > x \Rightarrow x > 1, but this is false: x=−2x = -2 gives x2=4>−2x^2 = 4 > -2, yet xx is not greater than 1. In fact x2>x⇔x(x−1)>0⇔x<0 or x>1x^2 > x \Leftrightarrow x(x-1) > 0 \Leftrightarrow x < 0 \text{ or } x > 1. The student used a one-way idea in the wrong direction and ignored the negative case.

Questions students ask

Why isn’t testing lots of examples enough to prove something?
Because a “for all” statement makes a claim about infinitely many numbers, and no finite list can cover them all. The expression n2−n+41n^2 - n + 41 is prime for the first 40 integers but fails at n=41n = 41 — proof that patterns can break exactly where you stop checking.
What is the difference between ⇒\Rightarrow and ⇔\Leftrightarrow?
P⇒QP \Rightarrow Q means PP forces QQ, but QQ might be true for other reasons too. P⇔QP \Leftrightarrow Q means the two statements are equivalent — each is true exactly when the other is. Only use ⇔\Leftrightarrow when both directions genuinely hold.
How much working do I need to show in a proof question?
Enough that a reader can follow every step without guessing. Marks are awarded for the reasoning, so justify each line and finish with a sentence that states what you have proved.
Do I have to write the little square ■\blacksquare at the end?
No — it is optional. What matters is a clear concluding statement such as “as required” that signals the argument is complete and refers back to the original claim.

Key takeaways

  • A proof argues from known truths to a new statement, one justified step at a time.
  • Examples can disprove a claim but never prove a statement about all numbers.
  • Translate words into algebra: even =2n= 2n, odd =2n+1= 2n+1, rational =pq= \tfrac{p}{q}; use different letters for independent numbers.
  • ⇒\Rightarrow is a one-way implication; ⇔\Leftrightarrow works both ways — never swap them.
  • Start from definitions, justify each line, and close with a clear conclusion.

How this fits the course

Build on

  • Algebraic manipulation (GCSE)soon

Test yourself

Answer a few questions, then review anything you missed.

Prefer paper? Open the written self-check

Answer each question before opening its answer. This self-check does not record a quiz score.

  1. Which of these is a valid proof that “the sum of two even numbers is even”?

    • Let the numbers be 2m2m and 2n2n; their sum is 2(m+n)2(m+n), which is even.
    • Because 2+4=62 + 4 = 6, 6+8=146 + 8 = 14 and 10+12=2210 + 12 = 22 are all even.
    • Because even numbers are divisible by 2.
    • Let the numbers be 2n2n and 2n2n; their sum is 4n4n.
    Show answer and explanation

    Answer: Let the numbers be 2m2m and 2n2n; their sum is 2(m+n)2(m+n), which is even.

    A general argument with two independent letters. The examples option only checks cases; the last option reuses 2n2n and so assumes the numbers are equal.

  2. The statement x=2  ?  x2=4x = 2 \;?\; x^2 = 4 should be completed with which symbol?

    • ⇒\Rightarrow
    • ⇔\Leftrightarrow
    • ⇐\Leftarrow
    • None of these
    Show answer and explanation

    Answer: ⇒\Rightarrow

    x=2⇒x2=4x = 2 \Rightarrow x^2 = 4, but x2=4x^2 = 4 does not force x=2x = 2 (it could be −2-2), so it is not ⇔\Leftrightarrow.

  3. How should you write “two different odd numbers” algebraically?

    • 2m+12m+1 and 2n+12n+1
    • 2n+12n+1 and 2n+12n+1
    • 2n2n and 2n+12n+1
    • n+1n+1 and n+3n+3
    Show answer and explanation

    Answer: 2m+12m+1 and 2n+12n+1

    Odd numbers have the form 2k+12k+1, and different numbers need different letters, so 2m+12m+1 and 2n+12n+1.

  4. Why is checking n2−n+41n^2 - n + 41 for n=1n = 1 to 4040 not a proof that it is always prime?

    • A finite list cannot confirm a claim about all integers — and it fails at n=41n = 41.
    • The values are too small to be reliable.
    • You need to check at least 100 values.
    • It is a proof, provided the values are all prime.
    Show answer and explanation

    Answer: A finite list cannot confirm a claim about all integers — and it fails at n=41n = 41.

    At n=41n = 41 the expression equals 41241^2, which is not prime — showing why examples can never establish a universal claim.

  5. Which set does the symbol Q\mathbb{Q} represent?

    • The rational numbers
    • The integers
    • The real numbers
    • The natural numbers
    Show answer and explanation

    Answer: The rational numbers

    Q\mathbb{Q} is the set of rationals — numbers expressible as pq\tfrac{p}{q} with p,qp,q integers and q≠0q \neq 0.

  6. Three consecutive integers can be written as:

    • n, n+1, n+2n,\, n+1,\, n+2
    • n, 2n, 3nn,\, 2n,\, 3n
    • n, n+2, n+4n,\, n+2,\, n+4
    • 2n, 2n+1, 2n+22n,\, 2n+1,\, 2n+2
    Show answer and explanation

    Answer: n, n+1, n+2n,\, n+1,\, n+2

    Consecutive integers differ by exactly 1, so nn, n+1n+1, n+2n+2.

  7. A proof of a “Show that…” statement should begin by:

    • writing a general expression from the definitions
    • writing down the statement to be proved and rearranging it
    • substituting a convenient value such as n=1n = 1
    • stating the conclusion first
    Show answer and explanation

    Answer: writing a general expression from the definitions

    Start from something known to be true and work towards the claim; never assume what you are trying to prove.

Next step

Keep practising

Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.

Browse practice topics

Related lessons

All 6 lessons

Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.