Proof by contradiction
In logic, proof by contradiction is a form of proof, and more specifically a form of indirect proof, that establishes the truth or validity of a proposition by showing that the proposition's being false would imply a contradiction. Proof by contradiction is also known as indirect proof, apagogical argument, proof by assuming the opposite, and reductio ad impossibilem. It is a particular kind of the more general form of argument known as reductio ad absurdum.
G. H. Hardy described proof by contradiction as "one of a mathematician's finest weapons", saying "It is a far finer gambit than any chess gambit: a chess player may offer the sacrifice of a pawn or even a piece, but a mathematician offers the game."
Irrationality of the square root of 2
A classic proof by contradiction from mathematics is the proof that the square root of 2 is irrational. If it were rational, it could be expressed as a fraction a/b in lowest terms, where a and b are integers, at least one of which is odd. But if a/b = √2, then a2 = 2b2. Therefore a2 must be even. Because the square of an odd number is odd, that in turn implies that a is even. This means that b must be odd because a/b is in lowest terms.
On the other hand, if a is even, then a2 is a multiple of 4. If a2 is a multiple of 4 and a2 = 2b2, then 2b2 is a multiple of 4, and therefore b2 is even, and so is b.
So b is odd and even, a contradiction. Therefore the initial assumption—that √2 can be expressed as a fraction—must be false.
The length of the hypotenuse
The method of proof by contradiction has also been used to show that for any non-degenerate right triangle, the length of the hypotenuse is less than the sum of the lengths of the two remaining sides. The proof relies on the Pythagorean theorem. Letting c be the length of the hypotenuse and a and b the lengths of the legs, the claim is that a + b > c.
The claim is negated to assume that a + b ≤ c. Squaring both sides results in (a + b)2 ≤ c2 or, equivalently, a2 + 2ab + b2 ≤ c2. A triangle is non-degenerate if each edge has positive length, so it may be assumed that a and b are greater than 0. Therefore, a2 + b2 < a2 + 2ab + b2 ≤ c2. The transitive relation may be reduced to a2 + b2 < c2. It is known from the Pythagorean theorem that a2 + b2 = c2. This results in a contradiction since strict inequality and equality are mutually exclusive. The latter was a result of the Pythagorean theorem and the former the assumption that a + b ≤ c. The contradiction means that it is impossible for both to be true and it is known that the Pythagorean theorem holds. It follows that the assumption that a + b ≤ c must be false and hence a + b > c, proving the claim.
No least positive rational number
Consider the proposition, P: "there is no smallest rational number greater than 0". In a proof by contradiction, we start by assuming the opposite, ¬P: that there is a smallest rational number, say, r.
Now r/2 is a rational number greater than 0 and smaller than r. (In the above symbolic argument, "r/2 is the smallest rational number" would be Q and "r (which is different from r/2) is the smallest rational number" would be ¬Q.) But that contradicts our initial assumption, ¬P, that r was the smallest rational number. So we can conclude that the original proposition, P, must be true — "there is no smallest rational number greater than 0".
Infinity of primes
Assume that the number of prime numbers is finite. There is thus an integer, p which is the largest prime.
p! (p-factorial) is divisible by every integer from 2 to p - 1, as it is the product of all of them and p. Hence, p! + 1 is not divisible by every integer from 2 to p - 1 (it gives a remainder of 1 when divided by each). p! + 1 is therefore either prime or is divisible by a prime larger than p.
This contradicts the assumption that p is the largest prime. The conclusion is that the number of primes is infinite.
In mathematical logic
In mathematical logic, the proof by contradiction is represented as:
In the above, P is the proposition we wish to prove, and S is a set of statements, which are the premises—these could be, for example, the axioms of the theory we are working in, or earlier theorems we can build upon. We consider P, or the negation of P, in addition to S; if this leads to a logical contradiction F, then we can conclude that the statements in S lead to the negation of P, or P itself, respectively.
Note that the set-theoretic union, in some contexts closely related to logical disjunction (or), is used here for sets of statements in such a way that it is more related to logical conjunction (and).
A particular kind of indirect proof assumes that some object doesn't exist, and then proves that this would lead to a contradiction; thus, such an object must exist. Although it is quite freely used in mathematical proofs, not every school of mathematical thought accepts this kind of argument as universally valid. See further Nonconstructive proof.
Proofs by contradiction sometimes end with the word "Contradiction!". Isaac Barrow and Baermann used the notation Q.E.A., for "quod est absurdum" ("which is absurd"), along the lines of Q.E.D., but this notation is rarely used today. A graphical symbol sometimes used for contradictions is a downwards zigzag arrow "lightning" symbol (U+21AF: ↯), for example in Davey and Priestley. Others sometimes used include a pair of opposing arrows (as or ), struck-out arrows (), a stylized form of hash (such as U+2A33: ⨳), or the "reference mark" (U+203B: ※). The "up tack" symbol (U+22A5: ⊥) used by philosophers and logicians (see contradiction) also appears, but is often avoided due to its usage for orthogonality.
- G. H. Hardy, A Mathematician's Apology; Cambridge University Press, 1992. ISBN 9780521427067. p. 94.
- Alfield, Peter (16 August 1996). "Why is the square root of 2 irrational?". Understanding Mathematics, a study guide. Department of Mathematics, University of Utah. Retrieved 6 February 2013.
- Stone, Peter. "Logic, Sets, and Functions: Honors". Course materials. pp 14–23: Department of Computer Sciences, The University of Texas at Austin. Retrieved 6 February 2013.
- Further Pure Mathematics, L Bostock, F S Chandler and C P Rourke
- Hartshorne on QED and related
- B. Davey and H.A. Priestley, Introduction to lattices and order, Cambridge University Press, 2002.
- The Comprehensive LaTeX Symbol List, pg. 20. http://www.ctan.org/tex-archive/info/symbols/comprehensive/symbols-a4.pdf
- Gary Hardegree, Introduction to Modal Logic, Chapter 2, pg. II–2. http://people.umass.edu/gmhwww/511/pdf/c02.pdf
|The Wikibook Mathematical Proof has a page on the topic of: Proof by Contradiction|
- Franklin, James (2011). Proof in Mathematics: An Introduction. chapter 6: Kew. ISBN 978-0-646-54509-7.[dead link]