[guided]We now pass from bounded upcrossings to convergence. As $n \to -\infty$ (i.e., as the backwards time index goes further into the past), the upcrossing count $N_{-n}([a,b], X)$ — which counts upcrossings of $[a,b]$ by $X_n, X_{n+1}, \ldots, X_0$ — increases monotonically, since a longer sequence can only have more upcrossings. The limit $N([a,b], X) = \lim_{n \to -\infty} N_{-n}([a,b], X)$ is the total number of upcrossings over the entire backwards trajectory.
Since $N_{-n}([a,b], X) \geq 0$ and $N_{-n} \uparrow N$, the [Monotone Convergence Theorem](/theorems/509) (applied to the non-negative, increasing sequence of random variables $N_{-n}([a,b], X)$) gives
\begin{align*}
(b - a)\, \mathbb{E}[N([a,b], X)] &= \lim_{n \to -\infty} (b - a)\, \mathbb{E}[N_{-n}([a,b], X)] \\
&\leq \mathbb{E}[(X_0 - a)^-] < \infty.
\end{align*}
Since $\mathbb{E}[N([a,b], X)] < \infty$, we conclude $N([a,b], X) < \infty$ a.s. for each fixed rational pair $a < b$.
There are countably many rational pairs $(a,b)$ with $a < b$. For each such pair, let $\Omega_{a,b} = \{N([a,b], X) < \infty\}$, which satisfies $\mathbb{P}(\Omega_{a,b}) = 1$ by the preceding argument. By [countable subadditivity](/theorems/1108) of probability (taking the countable intersection):
\begin{align*}
\mathbb{P}\Bigl(\bigcap_{a < b \in \mathbb{Q}} \Omega_{a,b}\Bigr) = 1.
\end{align*}
On this full-measure event, the sequence $(X_n(\omega))_{n \leq 0}$ has finitely many upcrossings of every rational interval $[a,b]$. By the [Convergence Criterion via Upcrossings](/theorems/1155), this is equivalent to the convergence of $X_n(\omega)$ in $\overline{\mathbb{R}} = \mathbb{R} \cup \{\pm\infty\}$. Denote the a.s. limit by $X_{-\infty}$.
It remains to show that this limit is finite a.s. and belongs to $L^p$. The backwards martingale property, applied repeatedly via the [Tower Property](/theorems/1150), gives $X_n = \mathbb{E}[X_0 \mid \mathcal{G}_n]$ for all $n \leq 0$. (To see this: for $n = -1$, the definition gives $X_{-1} = \mathbb{E}[X_0 \mid \mathcal{G}_{-1}]$. For $n = -2$, $X_{-2} = \mathbb{E}[X_{-1} \mid \mathcal{G}_{-2}] = \mathbb{E}[\mathbb{E}[X_0 \mid \mathcal{G}_{-1}] \mid \mathcal{G}_{-2}] = \mathbb{E}[X_0 \mid \mathcal{G}_{-2}]$ by the Tower Property, since $\mathcal{G}_{-2} \subset \mathcal{G}_{-1}$. Induction extends this to all $n \leq 0$.)
[Conditional Jensen (part (iv) of theorem 1149)](/theorems/1149) states that for a convex function $\varphi$ with $\varphi(X) \in L^1$ or $\varphi \geq 0$, we have $\varphi(\mathbb{E}[X \mid \mathcal{G}]) \leq \mathbb{E}[\varphi(X) \mid \mathcal{G}]$ a.s. Applying this with $\varphi(t) = |t|^p$ (which is convex for $p \geq 1$ and satisfies $\varphi \geq 0$), $X = X_0$, and $\mathcal{G} = \mathcal{G}_n$:
\begin{align*}
|X_n|^p = |\mathbb{E}[X_0 \mid \mathcal{G}_n]|^p \leq \mathbb{E}[|X_0|^p \mid \mathcal{G}_n] \quad \text{a.s.}
\end{align*}
Taking expectations and using the [averaging property](/theorems/1148) ($\mathbb{E}[\mathbb{E}[Y \mid \mathcal{G}]] = \mathbb{E}[Y]$):
\begin{align*}
\mathbb{E}[|X_n|^p] \leq \mathbb{E}[|X_0|^p] < \infty \quad \text{for all } n \leq 0.
\end{align*}
This is the uniform $L^p$ bound. [Fatou's Lemma](/theorems/510), applied to the non-negative [measurable functions](/page/Measurable%20Functions) $|X_n|^p$ on the probability space $(\Omega, \mathcal{F}, \mathbb{P})$, gives
\begin{align*}
\mathbb{E}[|X_{-\infty}|^p] = \mathbb{E}\Bigl[\liminf_{n \to -\infty} |X_n|^p\Bigr] \leq \liminf_{n \to -\infty} \mathbb{E}[|X_n|^p] \leq \mathbb{E}[|X_0|^p] < \infty.
\end{align*}
Since $\mathbb{E}[|X_{-\infty}|^p] < \infty$, we have $|X_{-\infty}| < \infty$ a.s. and $X_{-\infty} \in L^p(\Omega, \mathcal{F}, \mathbb{P})$.[/guided]