# GetWiki

### proof by contradiction

ARTICLE SUBJECTS
news  →
unix  →
wiki  →
ARTICLE TYPES
feed  →
help  →
wiki  →
ARTICLE ORIGINS [ temporary import ]
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
In logic, proof by contradiction is a form of proof that establishes the truth or validity of a proposition by first 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, 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, 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 ..."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."

## 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 lnotQ ("not-Q") 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:
1. P is assumed to be false, that is lnotP is true.
2. It is shown that lnotP implies two mutually contradictory assertions, Q and lnotQ.
3. Since Q and lnotQ 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:
1. P is assumed to be false.
2. It is shown that lnotP implies P.
3. Since P and lnotP 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
forall P vdash (P lor lnot P) (For all propositions P, either P or not-P 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 P and lnot P is true. In proof by contradiction, this permits the conclusion that since the possibility of lnot P has been excluded, P 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.{{anchor|rel}}

## Relationship with other proof techniques

{{unreferenced section|date=January 2017}}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 P that can be written in the form A rightarrow B (i.e., implications), whereas the technique of proof by contradiction applies to statements P of any form:
• Proof by contradiction (general): assume lnot P and derive a contradiction.

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

This corresponds to the equivalence Arightarrow B equiv lnot Brightarrow lnot A.
• Proof by contradiction: assume A and lnot B and derive a contradiction.

This corresponds to the equivalences Arightarrow B equiv lnot lnot (Arightarrow B) equiv lnot (Arightarrow B) rightarrow bot equiv (Aland lnot B) rightarrow bot.

## 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.WEB,weblink Why is the square root of 2 irrational?, Alfeld, Peter, 16 August 1996, Understanding Mathematics, a study guide, Department of Mathematics, University of Utah, 6 February 2013, 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 = {{radic|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 {{radic|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.WEB,weblink Logic, Sets, and Functions: Honors, Stone, Peter, Course materials, Department of Computer Sciences, The University of Texas at Austin, 6 February 2013, pp 14â€“23, 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 + b

### 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.WEB,weblink Math Forum Discussions, {{citation needed|reason=1. A board is no reliable source. 2. It's more likely that it was "Q. E. D." and "Q. E. A." (with spaces) in those older times, not "Q.E.D." (without spaces). Also: It should be the case, that also other people (like Leibniz) used "Q. E. A." or at least "quod est absurdum".|date=December 2015}} A graphical symbol sometimes used for contradictions is a downwards zigzag arrow "lightning" symbol (U+21AF: â†¯), for example in Davey and Priestley.B. Davey and H.A. Priestley, Introduction to lattices and order, Cambridge University Press, 2002. Others sometimes used include a pair of opposing arrows (as rightarrow!leftarrow or Rightarrow!Leftarrow), struck-out arrows (nleftrightarrow), a stylized form of hash (such as U+2A33: â¨³), or the "reference mark" (U+203B: â€»).The Comprehensive LaTeX Symbol List, pg. 20. weblink Hardegree, Introduction to Modal Logic, Chapter 2, pg. IIâ€“2. weblink" title="web.archive.org/web/20110607061046weblink">weblink 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.

## Principle of explosion

A curious logical consequence of the principle of non-contradiction is that a contradiction implies any statement; if a contradiction is accepted as true, any proposition (or its negation) can be proved from it.BOOK
, Ferguson
, Thomas Macaulay
, Priest
, Graham
, A Dictionary of Logic
, Oxford University Press
, 2016
,
, 146
,
,
,
, 0192511556
, This is known as the principle of explosion (, "from a falsehood, anything [follows]", or , "from a contradiction, anything follows"), or the principle of pseudo-scotus.

forall Q: (P land lnot P) rightarrow Q (for all Q, P and not-P implies Q)
Thus a contradiction in a formal axiomatic system is disastrous; since any theorem can be proven true it destroys the conventional meaning of truth and falsity.The discovery of contradictions at the foundations of mathematics at the beginning of the 20th century, such as Russell's paradox, threatened the entire structure of mathematics due to the principle of explosion. This motivated a great deal of work during the 20th century to create consistent axiomatic systems to provide a logical underpinning for mathematics. This has also led a few philosophers such as Newton da Costa, Walter Carnielli and Graham Priest to reject the principle of non-contradiction, giving rise to theories such as paraconsistent logic and dialethism, which accepts that there exist statements that are both true and false.

## References

{{Reflist}}

- content above as imported from Wikipedia
- "proof by contradiction" does not exist on GetWiki (yet)
- time: 1:04am EDT - Tue, Mar 26 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014
GETWIKI 18 AUG 2014
Wikinfo
Culture