Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The inequalities are:

$$\liminf(a_n + b_n) \leq \liminf(a_n) + \limsup(b_n) \leq \limsup(a_n + b_n)$$

share|cite|improve this question

marked as duplicate by Martin Sleziak, amWhy, ᴡᴏʀᴅs, voldemort, drhab Aug 29 '14 at 17:42

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

What did you try? – Did Oct 1 '12 at 9:44
Proofs like this are usually easiest done indirectly: Assume "$>$" holds instead of "$\le$". Then the difference is some $\epsilon>0$, ... – Hagen von Eitzen Oct 1 '12 at 9:47
See Properties of liminf and lmisup of sequences (and the linked questions and links given there. – Martin Sleziak Oct 1 '12 at 9:53
up vote 5 down vote accepted

Hint: First show that $\limsup$ is subadditive, that is, \[ \limsup(a_n + b_n) \le \limsup a_n + \limsup b_n \] for real sequences $(a_n)$, $(b_n)$. From this conclude using $-\limsup(-a_n) = \liminf a_n$ that $\liminf$ is superadditive (inequality $\ge$ in the above). Then you can use all this to prove \[ \liminf (a_n + b_n) - \limsup b_n = \liminf (a_n + b_n) + \liminf(-b_n) \le \liminf a_n \] and the other inequality you need.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.