In statistics, a consistent sequence of estimators is one which converges in probability to the true value of the parameter. Often, the sequence of estimators is indexed by sample size, and so the consistency is as sample size (n) tends to infinity. Often, the term consistent estimator is used, which refers to the whole sequence of estimators, resp. to a formula that is used to obtain a term of the sequence.
Consistency with convergence in probability can be referred to as weak consistency. The notion of consistency can be extended to other modes of Convergence of random variables; for example, a sequence is said to be strongly consistent if it converges almost surely to the true parameter.
Let Θ be a class of a parameters, and let be a sequence of estimates that can be used to estimate any parmeter Usually, Tn is based on the first n observations of a sample , from a given probability distribution Then the sequence Tn is (weakly) consistent on Θ (1, p332) if and only if for all and for all we have
Example: Sample Mean for Normal Random Variables
Suppose one has a sequence of observations from a distribution. To estimate μ based on the first n observations, one usually uses the sample mean, . Note that this defines a sequence of estimates, indexed by the sample size n.
Now, from the properties of the normal distribution, it is known that Tn is itself normally distributed, with mean μ and variance . Equivalently, has a standard normal distribution. Then
as n tends to infinity, for any fixed . Similarly, . Therefore, the sequence Tn of sample means is consistent for the population mean μ.
Establishing Consistency
For general problems, finding the exact distribution of Tn, and hence establishing consistency directly, can be intractable. However, the closely related Markov and Chebychev inequalities are powerful tools in proving consistency. In context, these inequalities can be expressed as
As a consequence, it suffices that the Mean Squared Error (equivalently, both the bias and variance) of Tn converges to 0. See Lehman, Page 332, Lemma 1.1 and Theorem 1.1.
Another useful result is the continuous mapping theorem: If Tn is consistent for θ, and g is a continuous real-valued function, then g(Tn) is consistent for g(θ).
Properties
Suppose U is an estimator of θ such that the sequence {Un} is consistent. If and are two convergent sequences of constants with and , then the sequence {Vn}, defined by is a consistent estimate of αθ + β.
Proof
First, observe that
This implies
As , we have , , and . So the last expression goes to 0 as . Therefore,
and thus {Vn} is a consistent sequence of estimators of αθ + β. Q.E.D.
If an estimator converges to a multiple of a parameter, such as how various unscaled measures of statistical dispersion converge to a multiple of a scale parameter, one can make it into a consistent estimator by multiplying the estimator by a scale factor, namely the true value divided by the asymptotic value of the estimator.