Convergence of measures

In mathematics, more specifically measure theory, there are various notions of the convergence of measures. For an intuitive general sense of what is meant by ''convergence of measures'', consider a sequence of measures μ_''n'' on a space, sharing a common collection of measurable sets. Such a sequence might represent an attempt to construct 'better and better' approximations to a desired measure μ that is difficult to obtain directly. The meaning of 'better and better' is subject to all the usual caveats for taking limits; for any error tolerance ε > 0 we require there be ''N'' sufficiently large for ''n'' ≥ ''N'' to ensure the 'difference' between μ_''n'' and μ is smaller than ε. Various notions of convergence specify precisely what the word 'difference' should mean in that description; these notions are not equivalent to one another, and vary in strength.

Three of the most common notions of convergence are described below.

Informal descriptions

This section attempts to provide a rough intuitive description of three notions of convergence, using terminology developed in calculus courses; this section is necessarily imprecise as well as inexact, and the reader should refer to the formal clarifications in subsequent sections. In particular, the descriptions here do not address the possibility that the measure of some sets could be infinite, or that the underlying space could exhibit pathological behavior, and additional technical assumptions are needed for some of the statements. The statements in this section are however all correct if $\mu_n$ is a sequence of probability measures on a Polish space.

The various notions of convergence formalize the assertion that the 'average value' of each 'sufficiently nice' function should converge:
$\int f\, d\mu_n \to \int f\, d\mu$

To formalize this requires a careful specification of the set of functions under consideration and how uniform the convergence should be.

The notion of ''weak convergence'' requires this convergence to take place for every continuous bounded function $f$.
This notion treats convergence for different functions ''f'' independently of one another, i.e., different functions ''f'' may require different values of ''N'' ≤ ''n'' to be approximated equally well (thus, convergence is non-uniform in $f$).

The notion of ''setwise convergence'' formalizes the assertion that the measure of each measurable set should converge:
$\mu_n(A) \to \mu(A)$

Again, no uniformity over the set $A$ is required.
Intuitively, considering integrals of 'nice' functions, this notion provides more uniformity than weak convergence. As a matter of fact, when considering sequences of measures with uniformly bounded
variation on a Polish space, setwise convergence implies the convergence $\int f\, d\mu_n \to \int f\, d\mu$ for any bounded measurable function $f$.
As before, this convergence is non-uniform in $f$

The notion of ''total variation convergence'' formalizes the assertion that the measure of all measurable sets should converge ''uniformly'', i.e. for every $\varepsilon > 0$ there exists ''N'' such that $, \mu_n(A) - \mu(A), < \varepsilon$ for every ''n > N'' and for every measurable set $A$. As before, this implies convergence of integrals against bounded measurable functions, but this time convergence is uniform over all functions bounded by any fixed constant.

Total variation convergence of measures

This is the strongest notion of convergence shown on this page and is defined as follows. Let $(X, \mathcal)$ be a measurable space. The total variation distance between two (positive) measures μ and ν is then given by

:$\left \, \mu- \nu \right \, _\text = \sup_f \left \.$

Here the supremum is taken over ''f'' ranging over the set of all measurable functions from ''X'' to ��1, 1 This is in contrast, for example, to the Wasserstein metric, where the definition is of the same form, but the supremum is taken over ''f'' ranging over the set of measurable functions from ''X'' to ��1, 1which have Lipschitz constant at most 1; and also in contrast to the Radon metric, where the supremum is taken over ''f'' ranging over the set of continuous functions from ''X'' to ��1, 1 In the case where ''X'' is a Polish space, the total variation metric coincides with the Radon metric.

If μ and ν are both probability measures, then the total variation distance is also given by

:$\left \, \mu- \nu \right \, _ = 2\cdot\sup_ , \mu (A) - \nu (A) , .$

The equivalence between these two definitions can be seen as a particular case of the Monge-Kantorovich duality. From the two definitions above, it is clear that the total variation distance between probability measures is always between 0 and 2.

To illustrate the meaning of the total variation distance, consider the following thought experiment. Assume that we are given two probability measures μ and ν, as well as a random variable ''X''. We know that ''X'' has law either μ or ν but we do not know which one of the two. Assume that these two measures have prior probabilities 0.5 each of being the true law of ''X''. Assume now that we are given ''one'' single sample distributed according to the law of ''X'' and that we are then asked to guess which one of the two distributions describes that law. The quantity

:$$

then provides a sharp upper bound on the prior probability that our guess will be correct.

Given the above definition of total variation distance, a sequence μ_''n'' of measures defined on the same measure space is said to converge to a measure ''μ'' in total variation distance if for every ''ε'' > 0, there exists an ''N'' such that for all ''n'' > ''N'', one has that

:$\, \mu_n - \mu\, _\text < \varepsilon.$

Setwise convergence of measures

For $(X, \mathcal)$ a measurable space, a sequence μ_''n'' is said to converge setwise to a limit ''μ'' if

:$\lim_ \mu_n(A) = \mu(A)$

for every set $A\in\mathcal$.

Typical arrow notations are $\mu_n \xrightarrow \mu$ and $\mu_n \xrightarrow \mu$.

For example, as a consequence of the Riemann–Lebesgue lemma, the sequence μ_''n'' of measures on the interval ��1, 1given by μ_''n''(''dx'') = (1+ sin(''nx''))''dx'' converges setwise to Lebesgue measure, but it does not converge in total variation.

In a measure theoretical or probabilistic context setwise convergence is often referred to as strong convergence (as opposed to weak convergence). This can lead to some ambiguity because in functional analysis, strong convergence usually refers to convergence with respect to a norm.

Weak convergence of measures

In mathematics and statistics, weak convergence is one of many types of convergence relating to the convergence of measures. It depends on a topology on the underlying space and thus is not a purely measure theoretic notion.

There are several equivalent definitions of weak convergence of a sequence of measures, some of which are (apparently) more general than others. The equivalence of these conditions is sometimes known as the Portmanteau theorem.

Definition. Let $S$ be a metric space with its Borel $\sigma$-algebra $\Sigma$. A bounded sequence of positive probability measures $P_n\, (n = 1, 2, \dots)$ on $(S, \Sigma)$ is said to converge weakly to a probability measure $P$ (denoted $P_n\Rightarrow P$) if any of the following equivalent conditions is true (here $\operatorname_n$ denotes expectation or the $L^1$ norm with respect to $P_n$, while $\operatorname$ denotes expectation or the $L^1$ norm with respect to $P$):

* \operatorname_n \to \operatorname /math> for all bounded, continuous functions $f$;
* \operatorname_n \to \operatorname /math> for all bounded and Lipschitz functions $f$;
* \limsup \operatorname_n \le \operatorname /math> for every upper semi-continuous function $f$ bounded from above;
* \liminf \operatorname_n \ge \operatorname /math> for every lower semi-continuous function $f$ bounded from below;
* $\limsup P_n(C) \le P(C)$ for all closed sets $C$ of space $S$;
* $\liminf P_n(U) \ge P(U)$ for all open sets $U$ of space $S$;
* $\lim P_n(A) = P(A)$ for all continuity sets $A$ of measure $P$.

In the case $S \equiv \mathbf$ with its usual topology, if $F_n$ and $F$ denote the cumulative distribution functions of the measures $P_n$ and $P$, respectively, then $P_n$ converges weakly to $P$ if and only if $\lim_ F_n(x) = F(x)$ for all points $x \in \mathbf$ at which $F$ is continuous.

For example, the sequence where $P_n$ is the Dirac measure located at $1/n$ converges weakly to the Dirac measure located at 0 (if we view these as measures on $\mathbf$ with the usual topology), but it does not converge setwise. This is intuitively clear: we only know that $1/n$ is "close" to $0$ because of the topology of $\mathbf$.

This definition of weak convergence can be extended for $S$ any metrizable topological space. It also defines a weak topology on $\mathcal(S)$, the set of all probability measures defined on $(S,\Sigma)$. The weak topology is generated by the following basis of open sets:

:$\left\,$

where

:$U_ := \left\.$

If $S$ is also separable, then $\mathcal(S)$ is metrizable and separable, for example by the Lévy–Prokhorov metric. If $S$ is also compact or Polish, so is $\mathcal(S)$.

If $S$ is separable, it naturally embeds into $\mathcal(S)$ as the (closed) set of Dirac measures, and its convex hull is dense.

There are many "arrow notations" for this kind of convergence: the most frequently used are $P_ \Rightarrow P$, $P_ \rightharpoonup P$, $P_ \xrightarrow P$ and $P_ \xrightarrow P$.

Weak convergence of random variables

Let $(\Omega, \mathcal, \mathbb)$ be a probability space and X be a metric space. If is a sequence of random variables then ''X_n'' is said to converge weakly (or in distribution or in law) to ''X'' as if the sequence of pushforward measures (''X_n'')_∗(P) converges weakly to ''X''_∗(P) in the sense of weak convergence of measures on X, as defined above.

See also

* Convergence of random variables
* Prokhorov's theorem
* Lévy–Prokhorov metric
* Tightness of measures

References

*
*
*

{{More footnotes, date=February 2010
Measure theory
Measure, Convergence of