Contradiction
Another important proof strategy is called proof by contradiction. In particular, we assume that the statement we want to prove is false, and use logical deductions to derive something which is trivially false (e.g., ). This would then imply that the original statement must be true. Let’s again look at a concrete and classical example. We say that a positive integer is a prime if and are the only positive integers that divide . We will use the following lemma (whose proof is deferred to the subsequent lectures).
Every integer greater than has a prime divisor.
We want to prove that there are infinitely many primes. Let us start by assuming that this statement is false, so we can list the primes as . Now we can define . This number is greater than every (assumed) prime, so this is not a prime. By Lemma 1, there is a prime that divides . Since divides and also divides , we have that , so , a contradiction.
is irrational. To prove this assume that is rational ( for integers and that have no common factor). By squaring both sides, we have that , and thus is even. Applying Exercise 1, we know that must be even, so for some integer . Plugging this in, we have or , and thus is even. Again, from Exercise 1, we have that is even, so is a common factor of and , a contradiction.
Again, in this proof strategy, it would seem like we have no way to know in advance which contradiction we are looking for. In general, what people do is to keep deriving more facts/information about the problem, and hopefully the contradiction would reveal itself at some point. Of course, once you gain more experience, this thing becomes more systematic and gets easier.