Classic Contradiction Proofs
What you'll learn: You'll see how proof by contradiction has been used to establish some of the most famous and foundational results in all of mathematics.
The Power of Classic Contradictions
Proof by contradiction isn't just a technique—it's been the key to unlocking some of mathematics' deepest truths. These landmark proofs demonstrate the method's elegance and power.
The Irrationality of √2
The setup: Assume √2 is rational, meaning √2 = p/q where p and q are integers in lowest terms (no common factors).
The contradiction unfolds:
- Square both sides: 2 = p²/q², so 2q² = p²
- This means p² is even, which forces p itself to be even
- Write p = 2k for some integer k
- Substitute: 2q² = (2k)² = 4k², so q² = 2k²
- Now q² is even, which forces q to be even too
- But if both p and q are even, they share a common factor of 2—contradicting our assumption that p/q was in lowest terms!
Therefore, √2 cannot be rational; it must be irrational.
The Infinitude of Primes
Euclid's brilliant proof: Assume there are only finitely many primes: p₁, p₂, ..., pₙ.
Consider the number N = (p₁ × p₂ × ... × pₙ) + 1. When you divide N by any of our "complete list" of primes, you get remainder 1. So either N itself is prime (not in our list), or N has a prime factor not in our list. Either way—contradiction! There must be infinitely many primes.
Why These Matter
These proofs revolutionized mathematics by proving existence (infinitely many primes exist) and impossibility (√2 cannot be written as a fraction). Contradiction excels at establishing such "negative" results that would be nearly impossible to prove directly.
Key Takeaway: Classic contradiction proofs like the irrationality of √2 and the infinitude of primes showcase the method's ability to establish fundamental truths by assuming the opposite and deriving an impossible conclusion.