Gauss–Markov theorem

From Wikipedia, the free encyclopedia

This article is not about Gauss–Markov processes.

In statistics, the Gauss–Markov theorem, named after Carl Friedrich Gauss and Andrey Markov, states that in a linear model in which the errors have expectation zero and are uncorrelated and have equal variances, a best linear unbiased estimator (BLUE) of the coefficients is given by the least-squares estimator. The errors are not assumed to be normally distributed, nor are they assumed to be independent (but only uncorrelated — a weaker condition), nor are they assumed to be identically distributed (but only having zero mean and equal variances).

Contents 1 Statement 2 Generalized least squares estimator 3 See also 4 External links 5 References

[edit] Statement

Suppose we have

for i = 1, . . ., n, where β_j are non-random but unobservable parameters, X_ij are non-random and observable (called the "explanatory variables"), ε_i are random , and so Y_i are random. The random variables ε_i are called the "errors" (not to be confused with "residuals"; see errors and residuals in statistics). Note that to include a constant in the model above, one can choose to include the X_iK = 1.

The Gauss–Markov assumptions state that

• 
• 

(i.e., all errors have the same variance; that is "homoscedasticity"), and

• 

for ; that is "uncorrelatedness." A linear estimator of β_j is a linear combination

in which the coefficients c_ij are not allowed to depend on the earlier coefficients β, since those are not observable, but are allowed to depend on X, since this data is observable, and whose expected value remains β_j even if the values of X change. (The dependence of the coefficients on X is typically nonlinear; the estimator is linear in Y and hence in ε which is random; that is why this is "linear" regression.) The estimator is unbiased iff

Now, let be some linear combination of the coefficients. Then the mean squared error of the corresponding estimation is defined as

i.e., it is the expectation of the square of the difference between the estimator and the parameter to be estimated. (The mean squared error of an estimator coincides with the estimator's variance if the estimator is unbiased; for biased estimators the mean squared error is the sum of the variance and the square of the bias.) A best linear unbiased estimator of β is the one with the smallest mean squared error for every linear combination λ. This is equivalent to the condition that

is a positive semi-definite matrix for every other linear unbiased estimator .

The ordinary least squares estimator (OLS) is the function

of Y and X that minimizes the sum of squares of residuals

(It is easy to confuse the concept of error introduced early in this article, with this concept of residual. For an account of the differences and the relationship between them, see errors and residuals in statistics).

The theorem now states that the OLS estimator is a BLUE. The main idea of the proof is that the least-squares estimator isuncorrelated with every linear unbiased estimator of zero, i.e., with every linear combination whose coefficients do not depend upon the unobservable β but whose expected value is always zero.

[edit] Generalized least squares estimator

The GLS or Aitken estimator extends the Gauss-Markov Theorem to the case where the error vector has a non-scalar covariance matrix - the Aitken estimator is also a BLUE. ^[1]

[edit] See also

• Independent and identically-distributed random variables
• Linear regression
• Measurement uncertainty
• Best linear unbiased prediction

[edit] External links

• Earliest Known Uses of Some of the Words of Mathematics: G (brief history and explanation of its name)
• Proof of the Gauss Markov theorem for multiple linear regression (makes use of matrix algebra)
• A Proof of the Gauss Markov theorem using geometry

[edit] References

1. ^ A.C. Aitken,"On Least Squares and Linear Combinations of Observations", Proceedings of the Royal Society of Edinburgh, 1935, vol. 55, pp. 42-48