Uniform integrability

In mathematics, uniform integrability is an important concept in real analysis, functional analysis and measure theory, and plays a vital role in the theory of martingales. The definition used in measure theory is closely related to, but not identical to, the definition typically used in probability.

Measure-theoretic definition[]

Textbooks on real analysis and measure theory often use the following definition.^[1][2]

Let ${\displaystyle (X,{\mathfrak {M}},\mu )}$ be a positive measure space. A set ${\displaystyle \Phi \subset L^{1}(\mu )}$ is called uniformly integrable if to each ${\displaystyle \varepsilon >0}$ there corresponds a ${\displaystyle \delta >0}$ such that

${\displaystyle \int _{E}|f|\,d\mu <\varepsilon }$

whenever ${\displaystyle f\in \Phi }$ and ${\displaystyle \mu (E)<\delta .}$

Probability definition[]

In the theory of probability, the following definition applies.^[3][4][5]

• A class ${\displaystyle {\mathcal {C}}}$ of random variables is called uniformly integrable (UI) if given ${\displaystyle \varepsilon >0}$, there exists ${\displaystyle K\in [0,\infty )}$ such that ${\displaystyle \operatorname {E} (|X|I_{|X|\geq K})\leq \varepsilon \ {\text{ for all X}}\in {\mathcal {C}}}$, where ${\displaystyle I_{|X|\geq K}}$ is the indicator function ${\displaystyle I_{|X|\geq K}={\begin{cases}1&{\text{if }}|X|\geq K,\\0&{\text{if }}|X|<K.\end{cases}}}$
• An alternative definition involving two clauses may be presented as follows: A class ${\displaystyle {\mathcal {C}}}$ of random variables is called uniformly integrable if:
  • There exists a finite ${\displaystyle M}$ such that, for every ${\displaystyle X}$ in ${\displaystyle {\mathcal {C}}}$, ${\displaystyle \operatorname {E} (|X|)\leq M}$ and
  • For every ${\displaystyle \varepsilon >0}$ there exists ${\displaystyle \delta >0}$ such that, for every measurable ${\displaystyle A}$ such that ${\displaystyle P(A)\leq \delta }$ and every ${\displaystyle X}$ in ${\displaystyle {\mathcal {C}}}$, ${\displaystyle \operatorname {E} (|X|I_{A})\leq \varepsilon }$.

The two probabilistic definitions are equivalent.^[6]

Relationship between definitions[]

The two definitions are closely related. A probability space is a measure space with total measure 1. A random variable is a real-valued measurable function on this space, and the expectation of a random variable is defined as the integral of this function with respect to the probability measure.^[7] Specifically,

Let ${\displaystyle (\Omega ,{\mathcal {F}},P)}$ be a probability space. Let the random variable ${\displaystyle X}$ be a real-valued ${\displaystyle {\mathcal {F}}}$-measurable function. Then the expectation of ${\displaystyle X}$ is defined by

${\displaystyle \operatorname {E} (X)=\int _{\Omega }X\,dP}$

provided that the integral exists.

Then the alternative probabilistic definition above can be rewritten in measure theoretic terms as: A set ${\displaystyle {\mathcal {C}}}$ of real-valued functions is called uniformly integrable if:

• There exists a finite ${\displaystyle M}$ such that, for every ${\displaystyle X}$ in ${\displaystyle {\mathcal {C}}}$, ${\displaystyle \int _{\Omega }|X|\,dP\leq M}$.
• For every ${\displaystyle \varepsilon >0}$ there exists ${\displaystyle \delta >0}$ such that, for every measurable ${\displaystyle A}$ such that ${\displaystyle P(A)\leq \delta }$ and for every ${\displaystyle X}$ in ${\displaystyle {\mathcal {C}}}$, ${\displaystyle \int _{A}|X|\,dP\leq \varepsilon }$.

Comparison of this definition with the measure theoretic definition given above shows that the measure theoretic definition requires only that each function be in ${\displaystyle L^{1}(\mu )}$. In other words, ${\displaystyle \int _{X}f\,d\mu }$ is finite for each ${\displaystyle f}$, but there is not necessarily an upper bound to the values of these integrals. In contrast, the probabilistic definition requires that the integrals have an upper bound.

One consequence of this is that uniformly integrable random variables (under the probabilistic definition) are tight. That is, for each ${\displaystyle \varepsilon >0}$, there exists ${\displaystyle a>0}$ such that

${\displaystyle P(|X|>a)<\varepsilon }$

for all ${\displaystyle X}$.^[8]

In contrast, uniformly integrable functions (under the measure theoretic definition) are not necessarily tight.^[9]

In his book, Bass uses the term uniformly absolutely continuous to refer to sets of random variables (or functions) which satisfy the second clause of the alternative definition. However, this definition does not require each of the functions to have a finite integral.^[10] The term "uniform absolute continuity" is not standard, but is used by some other authors.^[11][12]

Related corollaries[]

The following results apply to the probabilistic definition.^[13]

• Definition 1 could be rewritten by taking the limits as

${\displaystyle \lim _{K\to \infty }\sup _{X\in {\mathcal {C}}}\operatorname {E} (|X|\,I_{|X|\geq K})=0.}$

• A non-UI sequence. Let ${\displaystyle \Omega =[0,1]\subset \mathbb {R} }$, and define

${\displaystyle X_{n}(\omega )={\begin{cases}n,&\omega \in (0,1/n),\\0,&{\text{otherwise.}}\end{cases}}}$

Clearly ${\displaystyle X_{n}\in L^{1}}$, and indeed ${\displaystyle \operatorname {E} (|X_{n}|)=1\ ,}$ for all n. However,

${\displaystyle \operatorname {E} (|X_{n}|,|X_{n}|\geq K)=1\ {\text{ for all }}n\geq K,}$

and comparing with definition 1, it is seen that the sequence is not uniformly integrable.

Non-UI sequence of RVs. The area under the strip is always equal to 1, but ${\displaystyle X_{n}\to 0}$ pointwise.

• By using Definition 2 in the above example, it can be seen that the first clause is satisfied as ${\displaystyle L^{1}}$ norm of all ${\displaystyle X_{n}}$s are 1 i.e., bounded. But the second clause does not hold as given any ${\displaystyle \delta }$ positive, there is an interval ${\displaystyle (0,1/n)}$ with measure less than ${\displaystyle \delta }$ and ${\displaystyle E[|X_{m}|:(0,1/n)]=1}$ for all ${\displaystyle m\geq n}$.
• If ${\displaystyle X}$ is a UI random variable, by splitting

${\displaystyle \operatorname {E} (|X|)=\operatorname {E} (|X|,|X|>K)+\operatorname {E} (|X|,|X|<K)}$

and bounding each of the two, it can be seen that a uniformly integrable random variable is always bounded in ${\displaystyle L^{1}}$.

• If any sequence of random variables ${\displaystyle X_{n}}$ is dominated by an integrable, non-negative ${\displaystyle Y}$: that is, for all ω and n,

${\displaystyle \ |X_{n}(\omega )|\leq Y(\omega ),\ Y(\omega )\geq 0,\ \operatorname {E} (Y)<\infty ,}$

then the class ${\displaystyle {\mathcal {C}}}$ of random variables ${\displaystyle \{X_{n}\}}$ is uniformly integrable.

• A class of random variables bounded in ${\displaystyle L^{p}}$ (${\displaystyle p>1}$) is uniformly integrable.

Relevant theorems[]

In the following we use the probabilistic framework, but regardless of the finiteness of the measure, by adding the boundedness condition on the chosen subset of ${\displaystyle L^{1}(\mu )}$.

• Dunford–Pettis theorem^[14][15]

A class of random variables ${\displaystyle X_{n}\subset L^{1}(\mu )}$ is uniformly integrable if and only if it is relatively compact for the weak topology ${\displaystyle \sigma (L^{1},L^{\infty })}$.

• de la Vallée-Poussin theorem^[16][17]

The family ${\displaystyle \{X_{\alpha }\}_{\alpha \in \mathrm {A} }\subset L^{1}(\mu )}$ is uniformly integrable if and only if there exists a non-negative increasing convex function ${\displaystyle G(t)}$ such that

${\displaystyle \lim _{t\to \infty }{\frac {G(t)}{t}}=\infty {\text{ and }}\sup _{\alpha }\operatorname {E} (G(|X_{\alpha }|))<\infty .}$

Relation to convergence of random variables[]

• A sequence ${\displaystyle \{X_{n}\}}$ converges to ${\displaystyle X}$ in the ${\displaystyle L_{1}}$ norm if and only if it converges in measure to ${\displaystyle X}$ and it is uniformly integrable. In probability terms, a sequence of random variables converging in probability also converge in the mean if and only if they are uniformly integrable.^[18] This is a generalization of Lebesgue's dominated convergence theorem, see Vitali convergence theorem.

Citations[]

References[]

• Shiryaev, A.N. (1995). Probability (2 ed.). New York: Springer-Verlag. pp. 187–188. ISBN 978-0-387-94549-1.
• Diestel, J. and Uhl, J. (1977). Vector measures, Mathematical Surveys 15, American Mathematical Society, Providence, RI ISBN 978-0-8218-1515-1