Proof by contradiction
A proof by contradiction is won or lost on four sentences, and only one of them is algebra. Assume the opposite of what you want to show. Derive, correctly, from that assumption. State — in words, with a reason — exactly why what you've reached is impossible. Conclude that the assumption must have been false. Three separate examiner-report series (Jan 2021, Oct 2021, Jan 2024) converge on the same finding: candidates who can do the algebra in the middle routinely lose the marks either side of it, not because the mathematics is wrong, but because the sentences that hold it together were never written down.
The card
Structure: assume the OPPOSITE. Derive correctly. State WHY what you reached is impossible. Conclude the assumption is false, so the original is true. M1 (real Jun 2022 MS): the opening mark is generous on wording — a correct equation earns it, no fixed phrase required. The closing mark needs a REASON the contradiction is impossible (even ≠ odd; a square can't be negative) — not just 'no solutions.' Spec-named examples: √2 is irrational; there are infinitely many primes. Also applies to statements you've never seen before. Contradiction proves a TRUE, unbounded 'for all' claim. Exhaustion needs a finite domain; counter-example needs a FALSE claim. A case split inside a proof (e.g. n even / n odd) is itself a for-all claim — both branches must reach their own contradiction. A target number's OWN divisors can turn an infinite search into a short, finite list to exhaust (e.g. 4p² − q² = 46 → (2p+q)(2p−q) = 46 has exactly 2 valid factor pairs) — exhaustion nested inside a contradiction. Every pair on the list must be checked, not just one. A real Jan 2026 mark scheme credits three separate routes on equal footing for one question — divisor-pair testing, odd/even parity, and a q = 2m substitution: proof by contradiction often has more than one legitimate path to the same contradiction.
Why it works — Why one impossibility proves an infinite claim — and why a case split inside it still has to be exhaustive
This paper's WMA12 unit — read as this lesson's own prerequisite — derives a fact worth carrying over directly: a claim of the form "true for every n" is really an infinite AND, one statement per value of n, joined together. Proving that AND directly, case by case, is , and it only works when the list of cases is finite and short enough to write out. Contradiction sidesteps the infinite list a different way: instead of checking every case, it works with a single, general, unspecified case — an arbitrary integer n, or an arbitrary fraction p/q — that stands for every possible instance of the claim at once. If assuming that this one general case fails to satisfy P leads to something impossible, the argument never depended on which particular n, p or q was chosen — so no case, out of infinitely many, can be the exception. That is the entire reason contradiction can establish a TRUE claim over an infinite domain, which is precisely the one thing exhaustion (bounded to a finite list) and (which only ever disproves a FALSE claim) cannot do. There is one place this logic bites back inside a contradiction proof itself, and it is worth stating precisely because it is where marks are actually lost: if the derivation genuinely splits into more than one case — as it does below, where an assumed integer n is either even or odd — then "every integer is even or odd" is itself a two-case for-all claim, and by the exact same AND logic, BOTH branches have to be followed to their own impossibility before the proof is finished. Reaching a contradiction down one branch and treating the whole argument as settled is not a smaller version of a correct proof; it is an incomplete one, in exactly the way a real examiner report records candidates losing marks for reaching "the equation formed had no solutions" and stopping — the same incompleteness, whether it is a missing reason on one branch or a missing branch altogether.
Traps — 7
- assumption-and-conclusion-omitted
- The paper's own general commentary states this plainly: candidates "often omit questions on this topic or struggle to adopt a suitable strategy to complete the proof" (Jan 2021, general report), and a specific question the same series records the shape of that struggle directly: "The majority obtained the method mark for suggesting two appropriate odd numbers but full proofs with assumption, reason and conclusion were less common" (Jan 2021, Q3). On this evidence, the algebra in the middle is not where most marks are actually lost — the sentence before it and the sentence after it are.
- plausible-but-false-assertion-in-place-of-derivation
- Confirmed directly, and worth reading twice: "False reasoning was sometimes seen, for example: 'n is an integer so n² + 1 is odd'" (Jan 2021, Q3). Read as a claim about every integer n, this sentence is not merely unjustified — it is false: n² + 1 is odd exactly when n is even (n = 2 gives 5) and even when n is odd (n = 3 gives 10). A sentence that reads like a derivation but states something untrue is a worse failure than a visible gap in the working, precisely because it looks finished.
- logical-step-skipped-before-the-conclusion-that-needs-it
- On a two-part proof building toward the irrationality of √2: "A great many responses to part (a) did correctly factorise the expression, but few made a comment to state that it was odd. Both of these aspects were required to show the contradiction" (Oct 2021, Q10). The pattern here is an ordering failure, not an arithmetic one — reaching a correct intermediate expression and moving straight to what follows from it, without writing the sentence that actually licenses the move. This is exactly the gap the worked chain above forces open at stage 3 and stage 5, where "p is even" and "q is even" are each derived with their own stated reason, not asserted by analogy with each other.
- lowest-terms-condition-not-stated
- Confirmed on the same question, and specific to any proof built on a fraction assumed to be in simplest form: "Most of these forgot, however, to add a statement that a/b was fully simplified, which would mean that the last mark in the question could not be awarded. It is really important in a proof to include all necessary steps" (Oct 2021, Q10). This is the exact reason the √2 chain above states the lowest-terms condition in its first line rather than its last — it is needed again at the end, to say precisely what the final contradiction (both p and q even) actually contradicts.
- impossible-claim-asserted-without-a-reason
- On a proof by contradiction that a cubic has no stationary points: "The majority successfully set up their initial assumption... However, many then simply commented that the equation formed had no solutions, giving no explanation as to why, or they gave an inadequate justification, and so gained no further credit" (Jan 2024, Q8). Reaching the right equation is not the same as explaining why it cannot hold — "this has no solutions" is an assertion; "the left side is even and the right side is odd" is the reason that assertion actually needs.
- non-algebraic-check-substituted-for-a-required-contradiction
- On the same question, naming the specific wrong tools candidates reached for instead of the required derivation: "attempting the 'discriminant', using a graph only, testing values of x or attempting to use small angle approximations" (Jan 2024, Q8) — none of which scored, because a proof by contradiction on this paper is assessed on an algebraic derivation of an impossibility, not on evidence that a check was carried out. A graph or a handful of tested values can make a statement look true; only a derived contradiction proves it.
- not-all-valid-factor-pairs-checked
- A real WMA14 mark scheme names this exact gap directly, for the one mark that checks it: the dependent mark on the divisor-pair route to Q8 requires "States and attempts to solve both valid pairs of equations" (Jan 2026, Q8) — not one of the two pairs 46×1 and 23×2, however correctly solved, but both. This is a different shape of incompleteness from the n-even/n-odd split earlier in this lesson: there, the two branches come from every integer's own parity; here, they come from every way one specific target number (46) actually factors. The underlying reason both fail is identical, and it is this lesson's own mechanism block that derives it: a proof that rules out only some of the possibilities the assumption allows for has not yet ruled out the assumption itself.
Say it out loud
Out loud, from memory, no notes: explain why one impossibility proves an infinite claim — and why a case split inside it still has to be exhaustive to someone who has never seen this topic — where does your explanation get vague or hand-wavy? That's the exact spot to re-study, and it only works if you check it: read back over the mechanism above the moment you finish talking and mark precisely where you drifted from it.