6

$\lim\inf a_n+\lim\sup b_n\le\lim\sup(a_n+b_n)\le\lim\sup a_n+\lim\sup b_n$

For the right inequality, I assume $A=\lim\sup a_n, B = \lim\sup B_n$. Hence for any $\varepsilon$, there exists $n_0$ such that $a_{n}<A+\varepsilon$ for all $n\ge n_0$. Similarly for $b_n$. Hence for any $\varepsilon$, there exists $n_0$ such that $a_n+b_n<A+B+\varepsilon$ for all $n\ge n_0$. Therefore $\lim\sup(a_n+b_n)\leq A+B$.

Now for the left inequality, assume $A=\lim\inf a_n, B = \lim\sup B_n$. How can this be compared to $\lim\sup(a_n+b_n)$?

PJ Miller
  • 8,193
  • possible duplicate of How to prove these inequalities in real analysis? – Evan Aug 25 '13 at 03:01
  • Just realized possibly something to address. The right inequality is good. A lower bound on limsup, $\limsup a_n \geq c$ means that $a_n \geq c+\epsilon$ infinitely often for some $\epsilon$. So I suppose you need to show that for some $\epsilon$, $a_n + b_n > A + B + \epsilon$ infinitely often (or if you like, for every $N$ there is some $n > N$ for which this occurs). – Evan Aug 25 '13 at 03:15

1 Answers1

1

If you chase two links down you have a possible solution, though perhaps you won't want to look at that. Also I thought of a different approach along the lines of my comment that I want to share, but just with hints:

Goal: For some $\epsilon$, $a_n + b_n > A+B+\epsilon$ infinitely often.

  1. Definition of $B$: There is some $\epsilon$ with $b_n > B+\epsilon$ for infinitely many $n$.
  2. Use definition of $A$ to get that for any $\delta$, $a_n > A - \delta$ for sufficiently large $n$. Choose $\delta$ appropriately.
Evan
  • 3,861