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. It starts by assuming that the opposite proposition is true, and then shows that such an assumption leads to 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.^{[1]}^{[2]}
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."^{[1]}
Contents
Principle
Proof by contradiction is based on the law of noncontradiction as first formalized as a metaphysical principle by Aristotle. Noncontradiction is also a theorem in propositional logic. This states that an assertion or mathematical statement cannot be both true and false. That is, a proposition Q and its negation Q ("notQ") cannot both be true. In a proof by contradiction, it is shown that the denial of the statement being proved results in such a contradiction. It has the form of a reductio ad absurdum argument. If P is the proposition to be proved:
 P is assumed to be false, that is P is true.
 It is shown that P implies two mutually contradictory assertions, Q and Q.
 Since Q and Q cannot both be true, the assumption that P is false must be wrong, and P must be true.
An alternate form derives a contradiction with the statement to be proved itself:
 P is assumed to be false.
 It is shown that P implies P.
 Since P and P cannot both be true, the assumption must be wrong and P must be true.
An existence proof by contradiction 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 nonconstructive proof as universally valid.
Law of the excluded middle
Proof by contradiction also depends on the law of the excluded middle, also first formulated by Aristotle. This states that either an assertion or its negation must be true
 (For all propositions P, either P or notP is true)
That is, there is no other truth value besides "true" and "false" that a proposition can take. Combined with the principle of noncontradiction, this means that exactly one of and is true. In proof by contradiction, this permits the conclusion that since the possibility of has been excluded, must be true.
The law of the excluded middle is accepted in virtually all formal logics, however some intuitionist mathematicians do not accept it, and thus reject proof by contradiction as a proof technique.
Relationship with other proof techniques
This section does not cite any sources. (January 2017) (Learn how and when to remove this template message)

Proof by contradiction is closely related to proof by contrapositive, and the two are sometimes confused, though they are distinct methods. The main distinction is that a proof by contrapositive applies only to statements that can be written in the form (i.e., implications), whereas the technique of proof by contradiction applies to statements of any form:
 Proof by contradiction (general): assume and derive a contradiction.

 This corresponds, in the framework of propositional logic, to the equivalence , where is the logical contradiction, or false value.
In the case where the statement to be proven is an implication , let us look at the differences between direct proof, proof by contrapositive, and proof by contradiction:
 Direct proof: assume and show .
 Proof by contrapositive: assume and show .

 This corresponds to the equivalence .
 Proof by contradiction: assume and and derive a contradiction.

 This corresponds to the equivalences .
Examples
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.^{[3]} 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 a^{2} = 2b^{2}. Therefore, a^{2} 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 a^{2} is a multiple of 4. If a^{2} is a multiple of 4 and a^{2} = 2b^{2}, then 2b^{2} is a multiple of 4, and therefore b^{2} 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 nondegenerate right triangle, the length of the hypotenuse is less than the sum of the lengths of the two remaining sides.^{[4]} 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} ≤ c^{2} or, equivalently, a^{2} + 2ab + b^{2} ≤ c^{2}. A triangle is nondegenerate if each edge has positive length, so it may be assumed that a and b are greater than 0. Therefore, a^{2} + b^{2} < a^{2} + 2ab + b^{2} ≤ c^{2}. The transitive relation may be reduced to a^{2} + b^{2} < c^{2}. It is known from the Pythagorean theorem that a^{2} + b^{2} = c^{2}. 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. But that contradicts our initial assumption, ¬P, that r was the smallest rational number. (In the above symbolic argument, "r is the smallest rational number" would be Q and "r/2 is a rational number smaller than r" would be ¬Q.) So we can conclude that the original proposition, P, must be true — "there is no smallest rational number greater than 0".
Other
For other examples, see proof that the square root of 2 is not rational (where indirect proofs different from the above one can be found) and Cantor's diagonal argument.
Notation
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.^{[5]}^{[citation needed]} A graphical symbol sometimes used for contradictions is a downwards zigzag arrow "lightning" symbol (U+21AF: ↯), for example in Davey and Priestley.^{[6]} Others sometimes used include a pair of opposing arrows (as or ), struckout arrows (), a stylized form of hash (such as U+2A33: ⨳), or the "reference mark" (U+203B: ※).^{[7]}^{[8]} 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.
See also
 Proof by infinite descent, a form of proof by contradiction
References
 ^ ^{a} ^{b} G. H. Hardy, A Mathematician's Apology; Cambridge University Press, 1992. ISBN 9780521427067. PDF p.19.
 ^ S. M. Cohen, "Introduction to Logic", Chapter 5 "proof by contradiction ... Also called indirect proof or reductio ad absurdum ..."
 ^ Alfeld, 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" (PDF). Course materials. pp 14–23: Department of Computer Sciences, The University of Texas at Austin. Retrieved 6 February 2013.
 ^ "Math Forum Discussions".
 ^ 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/texarchive/info/symbols/comprehensive/symbolsa4.pdf
 ^ Gary Hardegree, Introduction to Modal Logic, Chapter 2, pg. II–2. https://web.archive.org/web/20110607061046/http://people.umass.edu/gmhwww/511/pdf/c02.pdf
Further reading and external links
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 9780646545097. Archived from the original on 20021014.
 Proof by Contradiction from Larry W. Cusick's How To Write Proofs
 Reductio ad Absurdum Internet Encyclopedia of Philosophy; ISSN 21610002