What is the proof for the limit superior?

NihalRi
Messages
134
Reaction score
12

Homework Statement


ques.jpg


2. Relevant equation
Below is the definition of the limit superior
def.jpg

The Attempt at a Solution


I tried to start by considering two cases, case 1 in which the sequence does not converge and case 2 in which the sequence converges and got stuck with the second case.
try.jpg

I know intuitively that there exists a K such that Mk < a is the second case but I can not think of how to show this. I attempted to consider cases again, like monotone increasing, decreasing, or even use the definition of couchy sequence but was not getting anywhere. Is there a way to reach the same conclusion in my second case or is my approach for this proof completely off? I would gladly supply any additional information and would greatly appreciate any help.
 

Attachments

  • ques.jpg
    ques.jpg
    20.9 KB · Views: 715
  • def.jpg
    def.jpg
    23.7 KB · Views: 688
  • try.jpg
    try.jpg
    28.5 KB · Views: 614
Physics news on Phys.org
You don't need to consider cases and it doesn't matter whether the sequence converges.

Let ##u=(s+a)/2##. Can you show that for large enough ##n##, the amount ##M_n## must be less than ##u##? What does that tell us about the relationship between ##x_n## and ##a##?
 
  • Like
Likes NihalRi
andrewkirk said:
You don't need to consider cases and it doesn't matter whether the sequence converges.

Let ##u=(s+a)/2##. Can you show that for large enough ##n##, the amount ##M_n## must be less than ##u##? What does that tell us about the relationship between ##x_n## and ##a##?
for a large enough n, wouldn't ##M_n## = s?
a > s
a + s > s + s = 2s
(a+s)/2 > s
so s < u

I'm still trying to see the next part
 
NihalRi said:
for a large enough n, wouldn't ##M_n## = s?
Not necessarily. But it will be less than u. Why is that? (Consider the definition of lim sup)
 
  • Like
Likes NihalRi
It might be useful to observe that

$$\limsup a_n = \inf_{n=1}^\infty \{\sup_{k=n}^\infty a_k\}$$
 
  • Like
Likes NihalRi
I have more time now. Using my last formula, if ##a > \limsup a_n := L##, then there is ##n \geq 1## such that ##\sup_{k \geq n} a_k < a##. But then ##a_k \leq \sup_{k \geq n} a_k < a## for all ##k \geq n##, which was what we had to prove.

It remains to show that my last formula is correct. This is however easy, since ##\sup_{k\geq n} a_k## is a non-increasing sequence in ##n## and thus by the monotonuous convergence theorem, the sequence of suprema converges to its infinum.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top