Find two bounded sequences, $\{s_n\}_{n \in \mathbb N}$ and $\{t_n\}_{n \in \mathbb N}$, such that $\limsup(s_n+t_n))<\lim(sup(s_n))+\limsup(t_n))$
So I proved earlier that the inequality holds (well, replacing < with $\leq$). The second part of the problem was just to find two sequences such that the strict inequality holds.
My first thought was to use two sequences which don't contain their supremums, and add them. But that turned out to be just equal. Any suggestions on sequences which hold strict inequality?
What do you get for these sequences? $$\begin{align*} s &= 0,1,0,1,0,1,0,1,\dots\\ t &= 1,0,1,0,1,0,1,0\dots \end{align*}$$
Some intuition which might help to find examples like this.
Of course, what I wrote is very vague, but if you look at definition of limit superior, this can be made more precise.
There are several equivalent definitions of $\limsup x_n$, but whether you take the definition as the largest cluster point or as the largest subsequential limits or $\varepsilon$-definition, all of them are very close to the intuition described above. Perhaps the only of the commonly used definitions where connection with the handwavy description I've given above is not immediately clear is the definition as $\limsup\limits_{n\to\infty} x_n = \lim\limits_{n\to\infty} (\sup\limits_{k\ge n} x_k$).
There are several posts on this site comparing various definitions of limit superior of a sequence. I have listed some of them here.