Skip to content

Tightness Condition

Helly’s selection theorem produces a subsequential limit FF that is right-continuous and non-decreasing, but the total mass of FF may be strictly less than 11 (mass can escape to ±\pm\infty). Tightness is the condition that rules this out and promotes Helly’s conclusion to weak convergence to a probability measure.

Written in terms of distribution functions, this is equivalent to

1Fn(M)+Fn(M)ϵfor all n.1 - F_n(M) + F_n(-M) \le \epsilon \quad \text{for all } n.

Some equivalent formulations of the same condition:

  1. lim infnμn((M,M])1ϵ\liminf_{n \to \infty} \mu_n((-M, M]) \ge 1 - \epsilon for some MM,
  2. lim supn(1Fn(M)+Fn(M))ϵ\limsup_{n \to \infty} \big(1 - F_n(M) + F_n(-M)\big) \le \epsilon for some MM,
  3. μn((M,M])1ϵ\mu_n((-M, M]) \ge 1 - \epsilon for all nn (after enlarging MM).

The equivalence between holding for all nn and holding eventually is immediate: any finite collection of measures can be absorbed by taking MM large enough, since each individual μn\mu_n is a probability measure and so μn((M,M])1\mu_n((-M, M]) \to 1 as MM \to \infty.

Tightness ⟺ subsequential weak convergence

Section titled “Tightness ⟺ subsequential weak convergence”

The forward direction is the workhorse: in practice, one shows a sequence of laws is tight (often via a moment bound such as supnE[Xn]<\sup_n \mathbb{E}[|X_n|] < \infty, which controls the tails through Markov’s inequality), then invokes the theorem to extract a weakly convergent subsequence. If a uniqueness argument pins down all possible subsequential limits to the same μ\mu, the full sequence converges weakly to μ\mu.

The reverse direction says tightness is not just sufficient but necessary: any sequence enjoying this subsequential compactness must control its tails uniformly.