Proof by Contradiction
Proof by contradiction is a powerful technique: to prove a statement true, you assume it is false and show that this forces an impossibility. It is the method behind the classic proofs that √2 is irrational and that there are infinitely many primes.
What you'll be able to do
- Understand the logic of proof by contradiction
- Set up the negation of a statement
- Prove a statement by reaching a contradiction
- Follow the standard proofs (√2 irrational, infinite primes)
The logic
To prove a statement by contradiction, ( is false) and reason logically until you reach something impossible. Since the reasoning is valid, the only flaw must be the assumption — so must be true.
Tip — Start every proof by clearly writing the assumption: “Assume, for contradiction, that …”.
Worked idea: √2 is irrational
Assume is rational, so in lowest terms. Squaring gives , so is even, hence is even. Writing leads to , so is also even — but then and share a factor of 2, contradicting “lowest terms”.
Other classic proofs
The same structure proves there are (assume finitely many, multiply them all and add 1, get a number with no prime factor in the list) and that there is no smallest positive rational number. Recognising the “assume the negation” opening is the key skill.
Formula recap
Common mistakes to avoid
Key takeaways
- Assume the statement is false, then derive a contradiction.
- The contradiction shows the assumption was wrong, so the statement is true.
- Know the standard results: √2 irrational, infinitely many primes.
Test yourself
Ready to lock in Proof by Contradiction? Pick a mode and earn XP & Dobloons.