Why \(L^1\) Convergence Controls Tails
Convergence in \(L^1\) says that the expected absolute error between a random variable and its limit becomes small. Uniform integrability asks for a different kind of control: the expected contribution from large values must become small uniformly across an entire family.
The connection between these ideas is useful because a sequence can have occasional large values even while approaching its limit. The key is that \(L^1\) convergence makes the errors small in expectation, while the fixed limit controls what remains.
Definition and a Small-Probability Estimate
Here \(\mathbf{1}_A\) denotes the indicator of an event \(A\). The tail expectation measures not just how often \(Y\) is large, but how much expected absolute value lies on the event where it is large.
We will use the fact that an integrable random variable has small expected contribution on events whose probabilities are small. This is stronger than merely saying that the probability of such events is small.
\(\square\)
A Preliminary Consequence of \(L^1\) Convergence
Let \(X_n\) converge to \(X\) in \(L^1\), meaning that all these random variables are integrable and $$ \mathbb{E}|X_n-X|\longrightarrow 0. $$ In particular, the sequence has bounded \(L^1\) norms, and its tail probabilities vanish uniformly.
\(\square\)
Uniformly small tail probabilities alone do not establish uniform integrability: a rare event can still carry a substantial expected absolute value. The theorem below uses \(L^1\) convergence to control the error in expectation as well.
The Main Theorem
\(\square\)
The proof separates the sequence into two parts. For large indices, \(X_n\) is close to \(X\) in expected absolute value, and the limit controls the contribution on events of small probability. The finitely many early terms are handled individually; finiteness of that set lets one choose a common threshold for them.
Worked Example: Truncating an Exponential Random Variable
Worked Example: Truncating an Exponential Random Variable
Let \(X\) have the exponential distribution with density \(e^{-x}\) on \(x\geq0\), and define \(X_n=X\wedge n\), where \(a\wedge b=\min(a,b)\). Each \(X_n\) is bounded, and $$ |X-X_n|=(X-n)_+, $$ where \(u_+=\max(u,0)\). Its expected value is $$ \begin{aligned} \mathbb{E}|X-X_n| &=\int_n^\infty (x-n)e^{-x}\,dx\\ &=e^{-n}\int_0^\infty u e^{-u}\,du\\ &=e^{-n}. \end{aligned} $$ In the second line, \(u=x-n\); integration by parts gives \(\int_0^\infty u e^{-u}\,du=1\). Thus \(X_n\to X\) in \(L^1\). The theorem implies that the family consisting of \(X\) and all its truncations \(X_n\) is uniformly integrable. This conclusion includes the limit, even though \(X\) itself is not bounded.
Worked Example: Approximating by Small Perturbations
Worked Example: Approximating by Small Perturbations
Let \(X\) again have the exponential distribution, and put $$ Y_n=X+\frac{1}{n}\sin(nX). $$ Since \(|\sin(nX)|\leq1\), $$ \mathbb{E}|Y_n-X| =\frac{1}{n}\mathbb{E}|\sin(nX)| \leq\frac{1}{n}. $$ Therefore \(Y_n\to X\) in \(L^1\). Each \(Y_n\) is integrable because \(|Y_n|\leq |X|+1\), and \(X\) is integrable. The theorem shows that \(\{X\}\cup\{Y_n:n\geq1\}\) is uniformly integrable. No independence assumption about the perturbation is needed: it is a function of \(X\), and the deterministic bound on its size already proves the required \(L^1\) convergence.
Worked Example: Rare Spikes with Vanishing \(L^1\) Error
Worked Example: Rare Spikes with Vanishing \(L^1\) Error
Take \([0,1]\) with Lebesgue probability measure, let \(A_n=[0,n^{-2}]\), and set \(Z_n=n\mathbf{1}_{A_n}\). Then $$ \mathbb{E}|Z_n|=n\mathbb{P}(A_n)=n\cdot\frac{1}{n^2}=\frac{1}{n}, $$ so \(Z_n\to0\) in \(L^1\). For a threshold \(K>0\), the variable \(Z_n\) exceeds \(K\) precisely on \(A_n\) when \(n>K\). Consequently, $$ \mathbb{E}\bigl[|Z_n|\mathbf{1}_{\{|Z_n|>K\}}\bigr] = \begin{cases} 1/n,& n>K,\\ 0,& n\leq K. \end{cases} $$ Hence the supremum over \(n\geq1\) is \(1/(\lfloor K\rfloor+1)\), which tends to zero as \(K\to\infty\). This calculates uniform integrability directly, in agreement with the theorem applied to \(Z_n\to0\). The spike height grows, but its expected contribution shrinks.
What the Result Does—and Does Not—Say
The theorem is a sufficient condition: \(L^1\) convergence guarantees uniform integrability of the sequence together with its limit. It does not say that every uniformly integrable sequence converges in \(L^1\); uniform integrability is a property of a family, while \(L^1\) convergence also specifies a particular limit and convergence of expected absolute errors.
A useful way to remember the proof is to examine the decomposition \(X_n=X+(X_n-X)\). On the event where \(X_n\) is large, the limit \(X\) contributes little in expectation once that event has small probability, and the error contributes little because its \(L^1\) norm is small for all sufficiently large \(n\). The finitely many remaining terms cannot obstruct uniformity.
Check Your Understanding
Use the definitions and proof strategy above to answer the following questions.
- What quantity must become small uniformly over a family for that family to be uniformly integrable?
- Why does \(L^1\) convergence imply that \(\sup_n\mathbb{E}|X_n|\) is finite?
- In the main proof, why is it necessary to treat the finitely many indices before \(N\) separately?
- For the exponential truncations, what is the exact value of \(\mathbb{E}|X-X_n|\)?
- For the rare-spike example, why can the spike height grow while its \(L^1\) contribution tends to zero?