Almost sure convergence and lim sup

I'm struggling to understand the beginning of the solution to the following exercise:

Let $(X_n)_{n\geq 1}$ and $X$ be random variables. Prove that $X_n \to X$ almost surely if and only if for every $\epsilon>0$ $$P(\limsup\limits_{n\to \infty}\{|X_n-X|\geq \epsilon\})=0$$

Solution:

Notice that $\omega \in\limsup\limits_{n\to \infty}\{|X_n-X|\geq \epsilon\}$ iff there exist a subsequence $(n_k)_{k\geq 1}$ such that $|X_{n_k}-X|\geq \epsilon$, so we have $$\{\limsup\limits_{n\to \infty}|X_n-X|> \epsilon\}\subset \limsup\limits_{n\to \infty}\{|X_n-X|\geq \epsilon\} \subset \{\limsup\limits_{n\to \infty}|X_n-X|\geq \epsilon\}\quad (*)$$

and so on..

I don't understand what this means.

1. First what subsequence are we referring to? A subsequence that does converge? Why do we need this exactly?
2. What's the difference between those 3 sets in line $(*)$. Why does it matter if the $\limsup$ is within the brackets and why does it matter whether $>$ or $\geq$? I really don't understand what the difference are.

I'm happy if someone could explain it to me.

• How does the proof continues? I am interested Oct 22, 2021 at 13:05

Note the definition of lim sup for a sequence $(A_n)$ of sets: $$\limsup_{n\to\infty} A_n=\bigcap_{k=1}^\infty \bigcup_{n=k}^\infty A_n.$$ This translates to: $$\omega\in\limsup_{n\to\infty} A_n \Leftrightarrow \forall k\, \exists n\ge k\colon \omega\in A_n.$$ Or, in everyday language: There are arbitrarily large $n$ for which $\omega\in A_n$. If you collect all such $n$ in a set and number them consecutively, you get an increasing sequence $(n_k)$ with $\omega\in A_{n_k}$ for all $k$.
That is the sequence mentioned in the proof, where $A_n=\{|X_n-X|\ge\epsilon\}$.
The difference between sharp and non-sharp inequalities arise for $\omega$ such that $\limsup|X_n-X|=\epsilon$ exactly. Such an $\omega$ belongs in the set on the right end of $(*)$, but not in the left set. And it may or may not be in the middle set, depending on whether $|X_n-X|\ge\epsilon$ infinitely often or not. Both are possible, under the current assumption.
• Thank you very much for the answer. Unfortunately I'm still struggling to understand the difference between $\limsup\{|X_n-X|\geq \epsilon \}$ and $\{\limsup |X_n-X|\geq \epsilon \}$. Is the difference that in the first case the $\epsilon$ has influence on the $\limsup$ but in the later it has not? Is this related to Fatou's lemma?
• The short answer is that $\omega\in\limsup\{|X_n-X|\ge\epsilon\}$ iff $|X_n-X|\ge\epsilon$ infinitely often (i.e., for infinitely many $n$), while if you untangle the other expression using the definition of the lim sup of a real sequence, you arrive at $\omega\in\{\limsup|X_n-X|\ge\epsilon\}$ iff for every $\eta<\epsilon$ it is true that $|X_n-X|\ge\eta$ infinitely often. The difference may seem subtle, but it cannot be neglected. Aug 27, 2016 at 16:01
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://math.stackexchange.com/questions/1904411/almost-sure-convergence-and-lim-sup", "fetch_time": 1656359959000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-27/segments/1656103341778.23/warc/CC-MAIN-20220627195131-20220627225131-00502.warc.gz", "warc_record_offset": 413073235, "warc_record_length": 65942, "token_count": 880, "char_count": 2913, "score": 3.921875, "int_score": 4, "crawl": "CC-MAIN-2022-27", "snapshot_type": "latest", "language": "en", "language_score": 0.7930948138237, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00001-of-00064.parquet"}