Proof By Contradiction
Proof by contradiction is another logical technique we can use to prove a statement is true. The process for a proof by contradiction is to:
- Assume that the negation of the statement is true (that is, that the original statement is false)
- Use definitions, algebraic manipulations, or logical deductions to produce a statement that contradicts this assumed negation, or some other statment known to be true
- Reject the negation as false, and therefore conclude that the original statement is true
An example of a time where we can proof by contradiction is to demonstrate the following proposition
The number is irrational.
To prove this, we recall the definition a rational number
A rational number is a number that can be written as where
To prove the irrationality of , we will first assume the negation of this proposition is true. This means we will assume that is rational, and that there exist two integers and such that
If is indeed rational, then there must be some pair of and that have no common factors. Suppose these numbers did have a common factor , we could rewrite the fraction as
Since is a factor of both and , and are both integers so this is also a valid rational representation of , and these two numbers have no common factors.
From this, we could then write
Since , then and so this means that meets the definition of an even number. We earlier proved the statement
If, and only if, is odd, then is odd.
The contrapositive of this statement, which is also true, is
If, and only if, is even, then is even.
This means that is also even and so for some , and therefore . This means that we can write
By the same reasoning, we see that is even, and therefore is even and can be written as for some . We have now shown that
This means that and must have a common factor of , which means that there is no pair of integers and such that with no common factors. This is a direct contradiction of our previous reasoning that such a pair must exist.
Therefore we must reject the assumption that is rational and we have proven that this number is indeed irrational and cannot be written as a fraction of two integers. QED
To summarise our approach:
- We assumed that is rational
- By the definition of a rational number, we assume that
- We show that there must be some and such that they have no common factors
- Assume the premise is true, we show that any and must both be even
- To prove this, we use our previous result that is odd if and only if is odd.
- We conclude that this statement contradicts our previous reasoning that some and must exist with no common factors
- We reject the premise that is rational and conclude that it is irrational
We also saw something interesting in this proof, where we needed to refer back to the result of our previous proof about the squares of even and odd numbers in order to complete our proof. This is a common occurrence and highlights how we can start off from very fundamental assumptions and definitions and over time build up a more complicated, but sophisticated, understanding of the nuances that follow.
...
Log in or sign up to see more