Inmathematics, more specificallymeasure theory, there are various notions of theconvergence of measures. For an intuitive general sense of what is meant byconvergence 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 takinglimits; for any error toleranceε > 0 we require there beN sufficiently large forn ≥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.
This section attempts to provide a rough intuitive description of three notions of convergence, using terminology developed incalculus 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μn is a sequence of probability measures on aPolish space.
The various notions of convergence formalize the assertion that the 'average value' of each 'sufficiently nice' function should converge:
To formalize this requires a careful specification of the set of functions under consideration and how uniform the convergence should be.
The notion ofweak convergence requires this convergence to take place for every continuous bounded functionf. This notion treats convergence for different functionsf independently of one another, i.e., different functionsf may require different values ofN ≤n to be approximated equally well (thus, convergence is non-uniform inf).
The notion ofsetwise convergence formalizes the assertion that the measure of each measurable set should converge:
Again, no uniformity over the setA 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 boundedvariation on aPolish space, setwise convergence implies the convergence for any bounded measurable functionf[citation needed].As before, this convergence is non-uniform inf.
The notion oftotal variation convergence formalizes the assertion that the measure of all measurable sets should convergeuniformly, i.e. for everyε > 0 there existsN such that for everyn >N and for every measurable setA. 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.
This is the strongest notion of convergence shown on this page and is defined as follows. Let be ameasurable space. Thetotal variation distance between two (positive) measuresμ andν is then given by
Here the supremum is taken overf ranging over the set of allmeasurable functions fromX to[−1, 1]. This is in contrast, for example, to theWasserstein metric, where the definition isof the same form, but the supremum is taken overf ranging over the set of those measurable functions fromX to[−1, 1] which haveLipschitz constant at most 1; and also in contrast to theRadon metric, where the supremum is taken overf ranging over the set of continuous functions fromX to[−1, 1]. In the case whereX is aPolish space, the total variation metric coincides with the Radon metric.
Ifμ andν are bothprobability measures, then the total variation distance is also given by
The equivalence between these two definitions can be seen as a particular case of theMonge–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 variableX. We know thatX 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 ofX. Assume now that we are givenone single sample distributed according to the law ofX 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 toconverge to a measureμ in total variation distance if for everyε > 0, there exists anN such that for alln >N, one has that[1]
For ameasurable space, a sequenceμn is said to converge setwise to a limitμ if
for every set.
Typical arrow notations are and.
For example, as a consequence of theRiemann–Lebesgue lemma, the sequenceμn of measures on the interval[−1, 1] given 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 infunctional analysis, strong convergence usually refers to convergence with respect to a norm.
Inmathematics andstatistics,weak convergence is one of many types of convergence relating to the convergence ofmeasures. It depends on a topology on the underlying space and thus is not a purely measure-theoretic notion.
There are several equivalentdefinitions 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 thePortmanteau theorem.[2]
Definition. Let be ametric space with itsBorel-algebra. A bounded sequence of positiveprobability measures on is said toconverge weakly to a probability measure (denoted) if any of the following equivalent conditions is true (here denotes expectation or the integral with respect to, while denotes expectation or the integral with respect to):
In the case and (with its usual topology) are homeomorphic , if and denote thecumulative distribution functions of the measures and, respectively, then converges weakly to if and only if for all points at which is continuous.
For example, the sequence where is theDirac measure located at converges weakly to the Dirac measure located at 0 (if we view these as measures on with the usual topology), but it does not converge setwise. This is intuitively clear: we only know that is "close" to because of the topology of.
This definition of weak convergence can be extended for anymetrizabletopological space. It also defines a weak topology on, the set of all probability measures defined on. The weak topology is generated by the following basis of open sets:
where
If is alsoseparable, then is metrizable and separable, for example by theLévy–Prokhorov metric. If is also compact orPolish, so is.
If is separable, it naturally embeds into as the (closed) set ofDirac measures, and itsconvex hull isdense.
There are many "arrow notations" for this kind of convergence: the most frequently used are,, and.
Let be aprobability space andX be a metric space. IfXn: Ω →X is a sequence ofrandom variables thenXn is said toconverge weakly (orin distribution orin law) to the random variableX: Ω →X asn → ∞ if the sequence ofpushforward measures (Xn)∗(P) converges weakly toX∗(P) in the sense of weak convergence of measures onX, as defined above.
Let be a metric space (for example or). The following spaces of test functions are commonly used in the convergence of probability measures.[3]
We have. Moreover, is the closure of with respect to uniform convergence.[3]
A sequence of measuresconvergesvaguely to a measure if for all,.
A sequence of measuresconverges weakly to a measure if for all,.
In general, these two convergence notions are not equivalent.
In a probability setting, vague convergence and weak convergence of probability measures are equivalent assumingtightness. That is, a tight sequence of probability measures convergesvaguely to a probability measure if and only if converges weakly to.
The weak limit of a sequence of probability measures, provided it exists, is a probability measure. In general, if tightness is not assumed, a sequence of probability (or sub-probability) measures may not necessarily convergevaguely to a true probability measure, but rather to a sub-probability measure (a measure such that).[3] Thus, a sequence of probability measures such that where is not specified to be a probability measure is not guaranteed to imply weak convergence.
Despite having the same name asweak convergence in the context of functional analysis, weak convergence of measures is actually an example of weak-* convergence. The definitions of weak and weak-* convergences used in functional analysis are as follows:
Let be a topological vector space or Banach space.
To illustrate how weak convergence of measures is an example of weak-* convergence, we give an example in terms of vague convergence (see above). Let be a locally compact Hausdorff space. By theRiesz-Representation theorem, the space of Radon measures is isomorphic to a subspace of the space of continuous linear functionals on. Therefore, for each Radon measure, there is a linear functional such that for all. Applying the definition of weak-* convergence in terms of linear functionals, the characterization of vague convergence of measures is obtained. For compact,, so in this case weak convergence of measures is a special case of weak-* convergence.
{{cite book}}: CS1 maint: multiple names: authors list (link)This article includes a list ofgeneral references, butit lacks sufficient correspondinginline citations. Please help toimprove this article byintroducing more precise citations.(February 2010) (Learn how and when to remove this message) |