Proof by contradictionEdexcel A-Level Maths: Revision notes
Section 1
The method
In proof by contradiction you assume the opposite of what you want to prove, and then use correct logical steps to reach something impossible: a contradiction. Since every step was valid, the only faulty item must be the assumption, so the original statement is true. The write-up has four parts:
- State the assumption clearly, for example 'Assume is rational'.
- Work logically from it.
- Reach a contradiction, such as a number that is both even and odd, or a fraction not in lowest terms.
- Conclude: 'this is a contradiction, so the assumption is false, and is irrational'.
Forgetting the concluding sentence. The contradiction must be named, and you must say it means the assumption is false.
Section 2
Rational and irrational numbers
A rational number can be written as with integers and . An irrational number cannot. Any rational number can be written in lowest terms, where and have no common factor other than 1. Contradiction proofs about irrationals rely on this. Useful facts about parity: is even is even (an odd number is and its square is odd). The same idea works for multiples of 3: if is not a multiple of 3 then and is not a multiple of 3.
Always assume the fraction is in lowest terms at the start. Without it, 'both even' is not a contradiction.
Section 3
The irrationality of root 2
Assume with integers in lowest terms. Square: , so . Hence is even, so is even. Write . Then , so , which is even, so is even. Now and are both even, so they have the common factor 2. This contradicts lowest terms. Hence is irrational. The same pattern proves irrational, using multiples of 3 in place of even numbers.
Saying ' is even so is even' without any reason. State that the square of an odd number is odd.
Section 4
The infinity of primes
Assume there are finitely many primes . Let . Dividing by any leaves remainder 1, so no divides . Either is prime, or it has a prime factor. In both cases there is a prime that is not in the list. This contradicts the assumption that the list contained all primes. Hence there are infinitely many primes.
Claiming that is always prime. For , is not prime, but its factors are new primes.
Section 5
Unfamiliar proofs
Strategy for a new statement: (1) negate it carefully, (2) translate the assumption into algebra, (3) manipulate to a contradiction.
- Negation: the opposite of 'is irrational' is 'is rational'. The opposite of 'there are no integers with ' is 'there are integers with '.
- Typical contradictions: even equals odd; a fraction not in lowest terms; an integer between 0 and 1; a number divisible by 5 that equals 1. Example: prove that is irrational. Assume with positive integers. Then , but is even and is odd. Contradiction.
If you are stuck, write down exactly what the contradiction would look like and work towards it.
That's the notes covered.
Carry on to the next subtopic.
Exam questions on Proof by contradiction
- A student begins a proof that is irrational by assuming that , where and are integers and .Given that and that is even, complete the proof that is irrational.2 marks
- Euclid's proof that there are infinitely many primes begins by assuming that there is a finite number of primes, , and then considers .Complete the proof that there are infinitely many primes.2 marks
- Assume, for a contradiction, that , where and are positive integers.Show that .3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).