Proof by Contradiction (AQA A-Level Mathematics): Revision Notes
📚 Revision Notes
1.2.1 Proof by Contradiction
Overview:
This is a style of proof where the following process is carried out:
infoNote
- Assume the opposite of what we want to prove is true.
- Do some math until a nonsensical statement arises, which disproves what we assumed to be true.
- Conclude that the original thing we were asked to prove must be true.
Negation of Mathematical Statements:
-
Example: Negate "all numbers are even".
- Incorrect negation: "All numbers are odd".
- Correct negation: "Not all numbers are even" or equivalently, "There exists at least one number that is odd".
- This form is most helpful for proofs by contradiction.
-
Example: Negate "all multiples of are also multiples of ".
- Correct negation: "There exists at least one multiple of that is not a multiple of ".
infoNote
Example: Prove by contradiction that there is no greatest integer
- Assume the opposite/negation:
- Assume there exists a greatest integer .
- Do some maths and find a contradiction:
- Consider the integer . By definition, .
- This contradicts the assumption that is the greatest integer.
- Therefore, there is no greatest integer.
- Must state: "a contradiction".
- Conclude:
- There is no greatest integer.
infoNote
Example: Prove by contradiction that if is odd, then is odd
- Assume there exists an odd integer such that is even.
- Let .
- which is a multiple of (even).
- This is a contradiction.
- Therefore, if is odd, then is odd.
infoNote
Example: Prove by contradiction that if is even, then is even
- Assume there exists an odd such that is even.
- Let .
- , which is of the form (odd).
- This is a contradiction.
- Therefore, if is even, then is even.
infoNote
Example: Proof by Contradiction that is Irrational
Reminder:
- A number is rational if it can be written in the form , where a and b are integers with no common factors.
Part 1: Prove by contradiction that if is even, then is even.
- Assume there exists an odd such that is even.
- Let . Then .
- This expression is of the form (odd), which is a contradiction.
- Therefore, if is even, then is even.
Part 2: Prove by contradiction that is irrational.
- Assume that can be written as , where a and b are integers with no common factors.
- Aiming to contradict this.
- From :
- Squaring both sides:
- Therefore, must be even (since it is ).
- By the previous proof, if is even, then must be even.
- So, can be written in the form .
- Substituting into :
- Dividing both sides by :
- By the previous proof, since is even, must also be even.
- If and are both even, they share a common factor of , which contradicts the assumption that is in simplest form (no common factors). Therefore, is irrational.