Mathematics
The Art of Mathematical Proof by Contradiction
Quick fact
The proof that the square root of 2 is irrational is a celebrated proof by contradiction, first devised by the ancient Greeks, likely around 500 BCE, and it overturned the Pythagorean belief that all numbers are rational.
Why this is interesting
You're about to prove that something is true by first imagining it's false — and that leads to a contradiction, so it must be true. But how can assuming the wrong thing ever lead to the right answer?
Read the full explanation
Understanding The Art of Mathematical Proof by Contradiction
Imagine you're a detective trying to prove that the butler was not in the kitchen at the time of the crime. It's hard to check every room. Instead, you assume the opposite: the butler WAS in the kitchen. This assumption, combined with other evidence, leads to a contradiction — like finding that the butler would have to be in two places at once. Therefore, the opposite assumption must be wrong, and the butler was indeed not in the kitchen. This is exactly the logic of proof by contradiction. In mathematics, we use the same pattern. To prove a statement P, we start by assuming 'not P' is true. Then we use logical reasoning to derive something impossible — such as '1 = 2' or 'a number is both even and odd'. Since our reasoning was valid, the only flaw must be the initial assumption, so 'not P' must be false. Therefore, P must be true. This relies on the ancient logical principle that every statement is either true or false (the law of excluded middle).
A deeper explanation
The mechanism of proof by contradiction hinges on the logical principle of non-contradiction: no statement can be both true and false. By assuming the negation of a desired proposition P, and then deriving a contradiction (Q and not-Q), we demonstrate that the assumption leads to an absurdity. Hence, the negation is false, and P must be true. This technique is not just a clever trick; it is a fundamental tool in mathematics. For example, to prove √2 is irrational, assume it is rational, meaning √2 = a/b for integers a and b with no common factors. Squaring both sides gives a² = 2b², so a² is even, hence a is even. Let a = 2k. Then 4k² = 2b², so b² = 2k², meaning b is also even. This contradicts that a and b have no common factors. Thus, √2 cannot be rational. Another classic example is Euclid's proof of the infinitude of primes. Assume there are only finitely many primes, say p₁, p₂, ..., pₙ. Consider N = p₁p₂...pₙ + 1. Dividing N by any known prime leaves a remainder of 1, so N is not divisible by any of them. But N must have some prime divisor, which is a new prime not in the list — a contradiction. Therefore, there must be infinitely many primes. Proof by contradiction is a powerful tool because it allows us to establish truths without directly constructing an example or a positive argument. It is widely used in many branches of mathematics, including analysis, topology, and logic, and is a cornerstone of mathematical rigor.