Analysis - a liminf inequality

Click For Summary
SUMMARY

The discussion centers on proving the inequality \liminf |a_{n+1}/a_n|\leq\liminf (|a_n|)^{1/n}. The user attempted a proof by contradiction, exploring both directions of the inequality but encountered challenges. They referenced problem 51 from a textbook and noted that the generalized ratio and root tests can be applied, specifically stating that if \limsup|a_{n+1}/a_n|<1, the series converges, and if \liminf|a_{n+1}/a_n|>1, the series diverges. A professor provided a solution involving logarithmic transformations, leading to the conclusion that M\geq L.

PREREQUISITES
  • Understanding of limits and inequalities in calculus
  • Familiarity with sequences and series convergence tests
  • Knowledge of logarithmic functions and their properties
  • Experience with mathematical proofs, particularly proof by contradiction
NEXT STEPS
  • Study the generalized ratio test and its implications for series convergence
  • Explore the generalized root test and its applications in analysis
  • Learn about the properties of liminf and limsup in sequence analysis
  • Review advanced proof techniques in real analysis, focusing on contradiction methods
USEFUL FOR

Mathematics students, particularly those studying real analysis, educators preparing for advanced calculus topics, and anyone interested in series convergence and inequalities in mathematical sequences.

quasar987
Science Advisor
Homework Helper
Gold Member
Messages
4,796
Reaction score
32

Homework Statement


I'm asked to show that

[tex]\liminf |a_{n+1}/a_n|\leq\liminf (|a_n|)^{1/n}[/tex]

The Attempt at a Solution



I tried a proof by contradiction in both "directions", but it did not work. For instance, one "direction" would be to let [itex]M=\liminf |a_{n+1}/a_n|[/itex] and [itex]L=\liminf (|a_n|)^{1/n}[/tex] and suppose M>L. Then for all e'>0, there is an N' such that n>N' ==>[itex]|a_{n+1}/a_n|>M-\epsilon'[/itex]. Also, let [itex]\{a_{n_k}\}[/itex] be the subsequence such that [itex](a_{n_k})^{1/n_k}\rightarrow L[/itex]. Then, given e>0, there is an N such that k>N ==> [itex]L-\epsilon<(a_{n_k+1})^{1/n_k+1}<L+\epsilon[/itex] <u>and</u> [itex]|a_{n_k+1}/a_{n_k}|>M-\epsilon'[/itex]. But <br /> <br /> [tex]L-\epsilon<(a_{n_k+1})^{1/n_k+1}<L+\epsilon \Leftrightarrow[/tex] <br /> <br /> [tex](L-\epsilon)^{1/n_k+1}<a_{n_k+1}<(L+\epsilon)^{1/n_k+1}\Leftrightarrow[/tex] <br /> <br /> [tex]\frac{(L-\epsilon)^{1/n_k+1}}{a_{n_k}}<\frac{a_{n_k+1}}{a_{n_k}}<\frac{(L+\epsilon)^{1/n_k+1}}{a_{n_k}}\Leftrightarrow[/tex] <br /> [tex]\frac{(L-\epsilon)^{1/n_k+1}}{(L+\epsilon)^{1/n_k}}<\frac{a_{n_k+1}}{a_{n_k}}<\frac{(L+\epsilon)^{1/n_k+1}}{(L-\epsilon)^{1/n_k}}[/tex] <br /> <br /> [tex]\Rightarrow \frac{a_{n_k+1}}{a_{n_k}}<\left(\frac{L+\epsilon}{L-\epsilon}\right)^{1/n_k}}(L+\epsilon)}[/tex] <br /> <br /> And then I aked wheter we could find an e such that this inequality would contradict [itex]|a_{n_k+1}/a_{n_k}|>M-\epsilon'[/itex], but obviously not, since as n_k gets bigger and bigger, the inequality becomes less restrictive rather than the opposite...I also tried the same thing with starting with the fact that [itex]\{a_{n_k}\}[/itex] was the subsequence that converged to M. I arrived at the same kind of uninteresting inequality.<br /> <br /> Using the same ideas, I also tried to contradict the fact that if L is the liminf, then for all N, there is an n>N with (a_n)^(1/n)>L+e (and analogously for M).[/itex]
 
Last edited:
Physics news on Phys.org
bump!

This should not be so difficult; it is problem 51 in the book (odd numbered) and there isn't even a hint at the back of the book.

Also, it may be helpful to know (problem 47) that the ratio and root tests can be generalized as follow: "If limsup|a_{n+1}/a_n|<1, the series converges, and if liminf|a_{n+1}/a_n|>1, the series diverges." (and analogously for (a_n)^1/n).
 
I emailed a professor and he emailed me back a nice pdf with the solution. It involves letting b_n=ln|a_n|, so that the inequality to show is equivalent to showing that liminf(b_n - b_{n-1}) < liminf(b_n/n) and then letting c_n = b_n - b_{n-1}, so it's equivalent to showing liminf(c_n)<liminf((c_1+...+c_n)/n). then let L=liminf(c_n), M=liminf((c_1+...+c_n)/n) and plug the fact that for any e>0, there's N s.t. n>N ==> c_n > L - e into (c_1+...+c_n)/n. It will result by taking the limits that [itex]M\geq L - \epsilon[/itex]. Since this is true for any e, we get the desired [itex]M\geq L[/itex].

There is a similar inequality for limsup: [tex]\limsup |a_{n+1}/a_n| \geq \limsup (|a_n|)^{1/n}[/tex].

This is nice because it implies that if the generalized root test is inconclusive, then so will the generalized ratio test so no need to waste time trying it! :smile:
 
Last edited:

Similar threads

  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K