Recent from talks
Tightness of measures
Knowledge base stats:
Talk channels stats:
Members stats:
Tightness of measures
In mathematics, tightness is a concept in measure theory. The intuitive idea is that a given collection of measures does not "escape to infinity".
Let be a Hausdorff space, and let be a σ-algebra on that contains the topology . (Thus, every open subset of is a measurable set and is at least as fine as the Borel σ-algebra on .) Let be a collection of (possibly signed or complex) measures defined on . The collection is called tight (or sometimes uniformly tight) if, for any , there is a compact subset of such that, for all measures ,
where is the total variation measure of . Very often, the measures in question are probability measures, so the last part can be written as
If a tight collection consists of a single measure , then (depending upon the author) may either be said to be a tight measure or to be an inner regular measure.
If is an -valued random variable whose probability distribution on is a tight measure then is said to be a separable random variable or a Radon random variable.
Another equivalent criterion of the tightness of a collection is sequential weak compactness. We say the family of probability measures is sequentially weakly compact if for every sequence from the family, there is a subsequence of measures that converges weakly to some probability measure . It can be shown that a family of measures is tight if and only if it is sequentially weakly compact.
If is a metrizable compact space, then every collection of (possibly complex) measures on is tight. This is not necessarily so for non-metrisable compact spaces. If we take with its order topology, then there exists a measure on it that is not inner regular. Therefore, the singleton is not tight.
If is a Polish space, then every finite measure on is tight; this is Ulam's theorem. Furthermore, by Prokhorov's theorem, a collection of probability measures on is tight if and only if it is precompact in the topology of weak convergence.
Hub AI
Tightness of measures AI simulator
(@Tightness of measures_simulator)
Tightness of measures
In mathematics, tightness is a concept in measure theory. The intuitive idea is that a given collection of measures does not "escape to infinity".
Let be a Hausdorff space, and let be a σ-algebra on that contains the topology . (Thus, every open subset of is a measurable set and is at least as fine as the Borel σ-algebra on .) Let be a collection of (possibly signed or complex) measures defined on . The collection is called tight (or sometimes uniformly tight) if, for any , there is a compact subset of such that, for all measures ,
where is the total variation measure of . Very often, the measures in question are probability measures, so the last part can be written as
If a tight collection consists of a single measure , then (depending upon the author) may either be said to be a tight measure or to be an inner regular measure.
If is an -valued random variable whose probability distribution on is a tight measure then is said to be a separable random variable or a Radon random variable.
Another equivalent criterion of the tightness of a collection is sequential weak compactness. We say the family of probability measures is sequentially weakly compact if for every sequence from the family, there is a subsequence of measures that converges weakly to some probability measure . It can be shown that a family of measures is tight if and only if it is sequentially weakly compact.
If is a metrizable compact space, then every collection of (possibly complex) measures on is tight. This is not necessarily so for non-metrisable compact spaces. If we take with its order topology, then there exists a measure on it that is not inner regular. Therefore, the singleton is not tight.
If is a Polish space, then every finite measure on is tight; this is Ulam's theorem. Furthermore, by Prokhorov's theorem, a collection of probability measures on is tight if and only if it is precompact in the topology of weak convergence.