There are two apparently different definitions of a logarithm that appear in the secondary mathematics curriculum:
- From Algebra II and Precalculus: If and , then is the inverse function of .
- From Calculus: for , we define .
The connection between these two apparently different ideas begins with the following theorem.
Theorem. Let . Suppose that has the following four properties:
- for all
- is continuous
Then for all .
Note. To prove this theorem, I will show that , thus proving that is the inverse of .
The proof of these theorem divides into four cases:
- Positive integers:
- Positive rational numbers: , where
- Negative rational numbers:
- Real (possibly irrational) numbers:
In today’s post, I’ll complete the proof by handling Case 4.
Before starting Case 4, I like to take inventory of where we stand in the proof at this point. We have now proven the theorem for all positive rational numbers and for all negative rational numbers. There’s only one rational number left: . And this single case is simply handled through Property 1:
I also like to keep track of which hypotheses have been used so far in the proof. A quick review of Cases 1-3 will reveal that Properties 1-3 have all been used at least once, but Property 4 (the assumption that is continuous) has not be used so far. Therefore, we had better expect to use it before completing the proof.
I won’t tell the class this (for fear of discouraging them), but the proof of Case 4 is a bit more abstract than Cases 1-3. I can give a numerical example that (hopefully) will shed some insight into the actual proof. However, for Case 4, the actual proof will not be a perfect parallel of the numerical example (as in Cases 1-3).
Idea behind Case 4. Let’s pick a familiar irrational number like . There is a natural way to approximate by a sequence of rational numbers… namely, the sequence of numbers obtained by taking one extra digit in the decimal expansion of . In other words,
and so on.
In this way, .
We would hope that the sequence
converges to the obvious limit of
However, this sequence is also equal to
since each exponent is rational. Since a sequence has only one limit, we conclude that these two limits should be equal:
So that’s the idea of the formal proof, which we now tackle. In the proof below, I’ve marked with quotations some of the more parenthetical steps so that the main argument of the proof stands out a little bit better. You’ll notice that, unlike Cases 1-3, I don’t use as much directed questioning to get students to volunteer the next step of the proof with minimal assistance from me. That’s because I haven’t figured out a good way to use inquiry to quickly get through Case 4.
Proof of Case 4. Let be a sequence of rational numbers that converges to . (Parenthetically, I’ll mention that the sequence of decimal approximations would be one such sequence, just to make this mysterious thing that just appeared out of the blue a little less daunting. Of course, any sequence of rational numbers that converges to will do. Therefore,
The function is continuous. From the ordinary definition of continuous used in calculus, this means that
In other words, the function and the limit can be interchanged. (I’ll usually throw in my standard joke about functions commuting at this point in the lecture.) Stated in terms of a sequence , this means that
Stated another way,
In light of the above work, we conclude that
Stated simply, the function and the limit interchange.
We now perform a similar step for the function . Because is assumed to be continuous, we know that
if is a sequence that converges to . So, if we replace by and by , we conclude that
From the above insight, we see that we have the next step of the proof:
From now on, the concluding steps are pretty straightforward. The exponent on the last line is a rational number. Therefore, by Cases 2 and 3, we have produce the next step:
Finally, by definition from the top of the proof, we can evaluate this limit:
This concludes the proof that , even if is an arbitrary (possibly irrational) real number.