(Two) Proof Methods
Proof by Cases
Also called proof by exhaustion, or brute force method; it is simply the method of breaking a proof into cases, and proving each case separately.
Let's take a look at an example of how we might prove the statement, "if is an integer, is even."
We can look at three cases:
- is even
- is odd
|
The first case is when is even, we can write it as . So, . |
Plugging it in, we get , which is . |
We can factor out a , and write it as . |
Note that what we have now is also a multiple of , so we can write it as where . But, we don't even have to do that, since it is a multiple of , the whole thing is even, so our proposition is true for the first case. |
The second case is when is . We can just plug it in again, and get , which is just . |
is even, so our proposition is true for the second case as well. |
The third case is when is odd. We can write an odd number as . Again, let's plug it in to the formula: . |
We get . Putting it all together, we have . We can factor out here, which makes it . |
The fact that we are able to factor out a shows that it is a multiple of , which means that it is an even number. So, our proposition is true for the third case. |
Therefore, we have showed that is even if is an integer. |
Proof by Contradiction
If the proposition we're dealing with is false, a false fact has to be true. Read that sentence once again.
A false fact cannot be true, therefore the proposition has to be true. And, this is the way of proof by contradiction.
This is an indirect proof.
A well-known example is proving that is irrational.
In this case, if the proposition " is irrational" is false, then " is rational" has to be true. But we're going to show that it cannot be true (a false fact), therefore, our proposition must be true.
Let's take a look at it:
|
So, assume that is rational. |
By definition, in order to be rational, it has to be a ratio of integers, that is, we have to write it in the form (where ) in the lowest (simplest) terms: |
We can take the square of both sides: |
Multiplying both sides by we get: |
Since is an even number, has to be even (the square of an even number is an even number). |
That means we can write as where is an integer. |
So, now we can write the whole thing as: |
And, continue: |
Simplifying the expression, we get: |
Now, since is an even number, has to be even as well. |
We see that both and are even — which means they have a common factor, and that means cannot be the most simplified form. We have a contradiction, therefore is irrational. |
NOTE: |
You might wonder why we assumed that if " is even, then is even". Remember that with prime factorization, all integers more than can be uniquely represented as a product of prime numbers. Since is one of the divisors of , if is among the primes that divide , then one of the prime divisors of has to be as well. Therefore, if is even, is even. |