This is the second in a series of posts that started here. In the first post I explained what I’m up to. Now let me just continue with some more questions. I’m now on to the harder Section II questions. Here’s the first one I want to look at. Even though it makes the posts shortish, I think I’m going to stick to one long question per post.
9F. Prove the Axiom of Archimedes.
Let be a real number in and let be positive integers. Show that the limit
exists, and that its value depends on whether is rational or irrational.
[You may assume standard properties of the cosine function provided they are clearly stated.]
In an exam you have a choice of questions, so with a question like this I’d recommend beginning by spending a minute or two trying to guess whether you’ll be able to do it (and do it reasonably quickly). The first part is bookwork (the Cambridge term for reproducing things that are in your notes), so either you know it or you don’t. What’s less obvious is how you’re going to get on with the second part.
It’s fairly clear, however, that a good way to proceed is to understand the inner limit first and only then worry about what happens with the outer limit. So what can we say about ? Well, the sequence consists of bigger and bigger powers of some number — the number , to be precise. That number lies between 0 and 1, so its successive powers will tend to 0 unless it is 1. How can it be 1? Only if is a multiple of , which means that must be a multiple of 2.
Aha, now we see where rationality and irrationality come in: if is irrational, then can’t be a multiple of 2, so the limit is 0. OK, we’re almost certainly going to be able to finish this off, so let’s get started.
Prove the Axiom of Archimedes.
There are various versions of this — I’m not sure which was given in the course. However, from the thoughts we’ve just had it seems very likely that the intended version is the one that says that as .
A general point here is that there is almost always a connection between the early theoretical part of a question like this and the more specific what-happens-in-this-example part. So if you can’t relate the axiom of Archimedes to the double limit, you should be worried. In general, this convention of Tripos questions is your friend — it’s another thing that makes it easier to look for what the examiner wants you to do.
The thing to remember about the statement that is that it is not trivial. It is trivial if you think of the reals as infinite decimals, but to prove that every real number has a decimal expansion you need … the axiom of Archimedes. We’re thinking of real numbers as elements of complete ordered fields, so we want to prove that using the axioms for a complete ordered field.
The obvious axiom to use here is the monotone sequences axiom, since we have a monotone sequence to look at. So here goes.
Since is decreasing and bounded below, it converges to a limit. Since all the terms of the sequence are positive, the limit cannot be negative. Suppose it is a positive number . Then we can find such that (by the definition of convergence). But then for every , which contradicts the fact that is the limit of the sequence. Therefore, .
Rest of question.
We’ve done in our heads part of the rest of the question, so let’s write that down.
If is irrational, then for every the number is positive and less than 1.
Now there’s a slight dilemma. It feels obvious that the powers of this number tend to 0, but are we allowed to assume that? Ordinarily I would say yes, but since the first part of the question asks us to prove the axiom of Archimedes and the rest of the question is (it turns out) very easy, it is almost certainly the examiner’s intention that we include a proof, using the axiom of Archimedes, that whenever .
Here’s how I’d prove that. I find it more convenient to prove the equivalent result that whenever . And here’s what I write for that.
Let . By the binomial theorem, . But by the Archimedean axiom (unfortunately, it seems that I made the wrong guess about which version to use — it would have been more convenient to prove that ), so as required.
How do we prove that ? By saying that whenever and appealing to the axiom of Archimedes for the statement that there actually exists an integer that is at least .
While we’re at it, let me remind you how that version of the Archimedean axiom is proved. The statement to be proved is that for every real number there is an integer that is greater than .
We start with the “let” trick: that is, we write, “Let be a real number.”
We’ve got nothing to go on, so in an effort to generate some information, we assume that the result is false. So we write, “Let be a real number and suppose that for every integer .”
This can be rephrased as “ is an upper bound for the set of all integers.” OK, the integers are a non-empty set and they are bounded above. What does that trigger in our minds? If we’re reasonably up on the course, it should trigger the least upper bound axiom. So we add, “Therefore, there must be a least upper bound for the set of all integers.”
It’s obvious that such a bound can’t exist: you just pick an integer close to it (which you must be able to do or it wouldn’t be the least upper bound) and add 1. Here’s what I’d write. “Since is the least upper bound, there must be an integer such that . But then , which is a contradiction.”
OK, we’ve dealt pretty comprehensively with the case where is irrational. What about when is rational? A quick look to see what happens, and we see that what we care about is whether is a multiple of 2. To make things easier to think about, let’s write as . Then when we find that is an integer.
What’s the neatest way of getting it to be an even integer? Actually, I see that I don’t need this after all: I was being slightly stupid, since for to equal 1, all I need is for to be an integer (by the deep result that ). So here’s what I’d write.
If is rational, then it is equal to for some integers and , with . If , then is an integer, so for every . Therefore,
whenever is rational.
Even with all the complications I tried to shoehorn in, I’d say that was a pretty easy question. But you have to be a bit careful with easy questions: they make the examiners fussier about your answers. In particular, if you’re in doubt about whether you’re allowed to assume something (a good example in this case being the fact that when ) you should be a little more careful.
Let me list the general principles we’ve had so far for making this judgment. They are not infallible, but they are a good guide.
1. You can assume something as long as it belongs to an earlier part of the course. (Example: it’s OK to assume general facts about limits when proving something about differentiability.)
2. If the question is about one thing, then it’s OK to use knowledge about other topics when analysing a concrete example. (Example: if the question is about differentiability in general and then asks you about an example that involves trigonometric functions, then it’s OK to assume facts like that the derivative of is . On the other hand, if the question is about formally deriving the properties of trigonometric functions, then it is definitely not OK to assume those facts.)
3. If the question starts with a bit of theory and then asks you to look at a concrete example, then you should not assume facts that can be proved with the help of the theory: the examiner is asking you to relate the theory to the example, and you must demonstrate that you see the connection. (Example: if you’ve been asked to prove the axiom of Archimedes and then find yourself needing the fact that when , then you are almost certainly expected to give a proof, since the proof uses the axiom of Archimedes.)