Free study notes · Maths AA HL · SL 1.6, AHL 1.15
Proof: direct, by contradiction, by counterexample and by induction: study notes
Proof is the part of the course where you must show, with a complete chain of reasoning, that a statement is true for every case it claims to cover, or show with a single counterexample that it is not. SL 1.6 covers direct deductive proof (a left-hand side to right-hand side argument, numerical or algebraic) together with the symbols and notation for equality and identity ( and ). The AHL content (1.15) adds proof by mathematical induction (a long-answer staple that usually appears on Paper 1, can appear on Paper 2 and sometimes closes a Paper 3 investigation), proof by contradiction, and disproof by counterexample. Nothing for this topic is in the formula booklet; marks are earned by layout, precise language and a full closing statement.
1. Direct deductive proof, numerical and algebraic
A direct proof starts from definitions and known results and moves by valid steps to the statement required. The essential skill is to represent a general object with algebra rather than a number: an even integer is , an odd integer is , consecutive integers are and , a multiple of 3 is , with . Checking a few numerical cases is never a proof of a general statement and earns nothing. For a 'show that' with a printed target, lay out the argument from one side only: write LHS , manipulate line by line, and finish with the exact printed expression followed by RHS. Do not treat the identity as an equation and perform operations on both sides at once, because that assumes what is to be proved. Choose the more complicated side to start from, since simplifying is easier to justify than expanding.
2. The symbols and the language of proof
Every line must follow from the previous one, and the words make that link visible. Use 'since', 'because' and 'as' to give reasons; 'hence', 'therefore', 'so' and the symbol to draw conclusions; for 'implies' and only when the reverse direction is genuinely valid. Define every letter you introduce ('let ') and state the domain the statement covers. Close with a sentence: 'as required', 'which is the result', QED, or the filled square . Examiners typically reserve an R mark for this reasoning and for the correct statement of what has been proved, so a proof that stops at the last line of algebra is not finished.
3. Proof of identities
Identities (often trigonometric or algebraic) are proved LHS to RHS using the identity sign or a chain of equals signs. Standard tools are a common denominator, factorising (especially difference of two squares), and its rearrangements, and expanding brackets. For example: LHS RHS. Each step is a recognised manipulation, no steps are skipped, and the final form matches the target exactly. If the result is printed (an 'AG' line) marks are typically awarded only for the working, so every manipulation must be visible.
4. Proof by mathematical induction: the five-part template (AHL)
Induction proves that a statement holds for all integers from a starting value onwards. Learn the layout by heart, because markschemes typically follow it closely.
(i) Base case (A1 or R1): evaluate both sides separately at the first value (usually , sometimes or ) and state they are equal, so is true.
(ii) Assumption (M1): 'Assume is true for some positive integer , that is ...' and write the full statement with replaced by . Writing 'let ' or 'if ' without the assumed statement usually scores zero here.
(iii) Inductive step set-up (M1): write what requires, then write the expression and show explicitly where the assumption is substituted.
(iv) Algebra (A marks): manipulate until the expression is exactly the target with replaced by . Write the final line in terms of so the match is visible, for example .
(v) Conclusion (R1): ' is true, and true implies true; therefore is true for all positive integers by mathematical induction.' The sentence 'true by induction' alone does not earn this mark, and the mark is usually conditional on having scored the assumption and step marks.
5. The main induction families
Sums: is the sum to (replace it by the assumed closed form) plus the th term; then factorise towards the target. Divisibility: write the assumption as for some integer , express in terms of by splitting a coefficient, for example , which is a multiple of 4. Inequalities: start from the side, apply the assumption to obtain an inequality, then use an extra true fact (such as or ) to reach the target; keep strict and weak inequalities exactly as stated. Derivatives: assume the formula for , differentiate once with the product or chain rule, and simplify to the formula with . Recursively defined sequences: substitute the assumed closed form for into the recurrence and simplify. In every family the base case must use the correct starting index, which is declared in the question. Beyond these five, De Moivre's theorem (AHL 1.14) for positive integer is also proved by induction, using the compound angle identities in the inductive step.
6. Proof by contradiction (AHL)
Assume the statement is false, deduce something impossible, and conclude the original statement must be true. The first line, the negation, carries a mark and must be exactly right: the negation of ' is irrational' is ' is rational', that is ' with and ' (you may then add, as a separate permitted step, 'and we may take with no common factor'); the negation of is (not ); the negation of 'there are infinitely many' is 'there are finitely many'. Irrationality of : assume with , , and take the fraction in lowest terms; then so is even, so is even (if were odd, , then would be odd), ; then , , so by the same reasoning is even; and share the factor 2, contradicting lowest terms. Infinitely many primes: suppose the complete list is and let ; dividing by any leaves remainder 1, so no listed prime divides , yet has a prime factor, which is not in the list, a contradiction. Parity arguments are also common: if are integers then is even, so it cannot equal 1. Always end by naming the contradiction and restating the result.
7. Disproof by counterexample (AHL)
To show that a statement with 'for all' is not always true, exhibit one specific case for which it fails and show the calculation. For instance, the claim ' is prime for every positive integer ' is false because gives , which is composite. The claim 'if then has a maximum or minimum at ' is false for at . One counterexample settles the matter completely; several examples agreeing with a statement prove nothing, and a counterexample can never establish that a statement is true.
Formulas
| (often the statement to be proved by induction) | in the booklet |
| (often the statement to be proved by induction) | in the booklet |
| Divisibility split: | learn it |
| Even , odd , | learn it |
| Negation of is ; negation of 'irrational' is 'rational': with , (lowest terms is a further step) | learn it |
| Closing statement: true and , so true for all by induction | learn it |
Worked examples
Example 1
Prove that the sum of the squares of any two consecutive odd integers is 2 more than a multiple of 8.
Solution
- Represent the integers generally: let the two consecutive odd integers be and , where .
- Form the sum of squares: .
- Simplify: .
- Give the reason: since is an integer, is an integer and so is a multiple of 8.
- Close: therefore the sum of the squares of two consecutive odd integers is , which is 2 more than a multiple of 8, as required.
Answer: , which is 2 more than the multiple of 8 given by . QED.
Example 2
Prove by mathematical induction that for all positive integers .
Solution
- Let be the statement .
- Base case : LHS ; RHS . LHS RHS, so is true.
- Assume is true for some positive integer , that is .
- Consider : .
- Use the assumption: .
- Factorise: .
- Write in the target form: , which is .
- Conclusion: is true, and true implies true; therefore is true for all positive integers by mathematical induction.
Answer: The identity holds for all .
Example 3
Prove by contradiction that for all with .
Solution
- State the negation: assume there exists with such that .
- Key deduction about signs: for both and , so . Both sides of the assumed inequality are positive, so squaring preserves it.
- Square: , so .
- Use : , hence .
- Identify the contradiction: but and on this interval, so . This contradicts .
- Conclude: the assumption is false, therefore for all , as required.
Answer: Assuming leads to , impossible on ; hence . QED.
Can you...
- Lay out a direct LHS to RHS proof of an algebraic or trigonometric identity without operating on both sides, ending with a closing statement?
- Write the five induction components (base case, assumption, step, algebra, conclusion) in wording that typically earns A1, M1, M1, A1, R1?
- Handle each induction family: add the next term in a sum, split a coefficient for divisibility, chain inequalities, differentiate an assumed th derivative, substitute into a recurrence?
- Write the correct negation for 'irrational', 'infinitely many' and strict or weak inequalities, and reproduce the and infinitely-many-primes proofs?
- Choose and verify a specific counterexample, showing the calculation that makes the statement fail?
Common errors
- Base case shown as a single number or at the wrong index. Evaluate LHS and RHS separately at the starting value given in the question and state that they are equal.
- Writing 'let ' or 'if is true' instead of assuming. Write 'Assume is true for some positive integer ' followed by the full statement with in place of ; the M1 is usually lost otherwise.
- Proving the case from scratch or never showing where the assumption is used. Write the expression, then substitute the assumed result on its own clearly labelled line.
- Finishing with 'true by induction'. The R1 needs the complete sentence: true for , true for implies true for , so true for all positive integers .
- Negating an inequality wrongly in a contradiction proof, for example writing as the opposite of . The negation of is ; write it down as the first line.
- Offering numerical checks as a proof of a general statement. Examples can suggest or disprove a claim but can never prove it; use algebra with general integers such as .
Original questions and notes written by Pietro Meloni, PhD, from the IB syllabus. Not endorsed by or affiliated with the International Baccalaureate Organization. Found a mistake? Please tell me privately at pietro@pietromeloni.com. More questions on this topic:
First session
Find out what is costing the marks.
One to one, online, on Google Meet.