To write a proof by contradiction, assume that the statement you want to prove is false. Then use valid logical steps until this assumption produces a contradiction, so the original statement must be true.
This method is part of IB Mathematics: Analysis and Approaches HL, sub-topic AHL 1.15: Proof by induction, contradiction and counterexample, and is particularly suitable for Paper 1 reasoning questions.
The Method
| Stage | What to write |
|---|---|
| 1. State the goal | Identify the proposition that must be proved. |
| 2. Negate it | Begin: “Suppose, for contradiction, that...” followed by the logical negation of the proposition. |
| 3. Deduce consequences | Apply definitions, algebra and previously established results logically. |
| 4. Reach a contradiction | Obtain a result that conflicts with the assumption, a given fact or a known theorem. |
| 5. Conclude | Reject the assumption and state that the original proposition is true. |
This approach is especially effective when the negation gives a concrete algebraic condition, as in irrationality, divisibility or statements about infinitely many objects. Keep each implication one-way and justified; do not assume the result you are trying to prove.
Worked Example: Prove That Is Irrational
Suppose, for contradiction, that is rational. Then
where , , and and have no common factor.
Squaring gives
Therefore, is even, so is even. This uses the fact that an odd integer has an odd square. Let . Substitution gives
so is also even. Thus, and share a factor of , contradicting the assumption that (p/q) is in lowest terms. Therefore, is irrational.
A common misconception is that finding an unexpected result is enough. The result must contradict a clearly stated assumption or established fact.
Exam Technique
For a prove command term, present a complete logical sequence. Examiners expect the contradictory assumption, justified deductions, an explicit contradiction and a final conclusion rejecting the assumption.
