How do we show that for any $\{x_n\}$ sequence
$$\lim \sup_{n \rightarrow \infty}x_n = \inf\{ a: \text{the set} \{ n: x_n >a\}\text{ is finite} \}$$
If $\{x_n\}$ is not bounded above, then the LHS is $\infty$ and by convention $\inf\emptyset=\infty$.
Suppose $$\limsup_{n\to\infty}x_n=x$$ for some $x\in \mathbb{R}$. You want to show that $$
x=\inf A\tag{1}
$$
where $A=\{ a\in\mathbb{R}\mid \text{the set} \{ n: x_n >a\}\text{ is finite} \}$. There are two steps to show (1)
- $x$ is a lower bound of $A$;
- $x$ is the biggest lower bound of $A$.
Step 1.
Let $a\in A$. The goal in this step is $x\leq a$. Then by definition of $A$, $a
Step 2.
Let $\epsilon>0$.
To show that $x$ is the biggest lower bound of $A$, it suffices (exercise!) to show that there exists $a\in A$, $x+\epsilon>a$, i.e.,
$$
\limsup_{n\to\infty}x_n+\epsilon>a.
$$
Recall the definition
$
x=\limsup_{n\to\infty}x_n:=\lim_{n\to\infty}\sup\{k\geq n:x_k\}.
$
Hence, for large enough $n$,
$$
x-\epsilon/2\leq\sup\{k\geq n:x_k\}\leq x+\epsilon/2.
$$
In particular, for large enough $n$,
$$
x_n\leq x+\epsilon/2.
$$
Now, if we pick any $a\in (x+\epsilon/2,x+\epsilon)$, we see that $a\in A$ and $$
a