You can check by hand that and are the only possible 's that work.
We will prove the statement
Base case: ()
, so the base case holds.
Inductive step:
Assume that . We need to show that . We start on the left-hand side:
by the inductive hypothesis. To complete the proof, we need to show that . Since , we have
Thus, we have shown .
Some of the proofs of the inductive step looked like this:
which is true. Thus, is true.
This issue with this is that the proof is structured like this:
but a correct proof must be structured like this:
In general, these are two completely different statements (they are converses of each other). For instance,
but clearly . In particular, we can't reverse the "" arrows.
Show is not a rational number.
I will present two solutions. Either one is perfectly valid, though it'd be good for you to learn both techniques.
Set . Then
Thus, , which is not possible, so it must be the case that .
If we continue the above calculation, then
This polynomial has all integer coefficients, so we may apply the rational roots theorem, which tells us that the only possible rational roots are . It's easy to check that none of these are roots, so the polynomial has no rational roots, which means must be irrational.
Show is not a rational number.
Show the following irrational-looking expressions are actually rational numbers:
The key is that for some . This isn't too surprising--we saw in Exercise 2.5 that is also in the form . The only problem is figuring out what should be, which we do by working backwards and then checking that our choices of work. This would be considered scratchwork:
So we need and . This system has two solutions: and . What this calculation tells us is that if , then the only possible way this could happen is if or . It doesn't guarantee that this actually does happen; just that this is the only possibility. To show that this is possible, we just have to check manually that one of them works. We check :
so it thankfully does work. This is where the scratchwork ends, i.e., this is roughly what you should have done to figure out how to write down the proof. Now you can write down the proof:
Notice that . Then
This is exactly the same as in (1), except instead.
The most common mistake I saw was trying to apply the rational roots theorem. The argument boils down to this:
Let . Then
Notice that is a rational root of this polynomial. Therefore, must be rational.
The issue with this argument is that the polynomial has three roots other than , so knowing that only tells us that it's possible that , but makes no guarantees. In other words, the rational roots theorem only helps us figure out the rational roots of , but tells us nothing about .
In Exercise 2.7, I showed that . Show that also works. (Hint: and is not .)