# Gauss–Markov theorem

Gauss–Markov theorem Not to be confused with Gauss–Markov process. "BLUE" leitet hier weiter. For queue management algorithm, see Blue (queue management algorithm). Part of a series on Regression analysis Models Linear regressionSimple regressionPolynomial regressionGeneral linear model Generalized linear modelDiscrete choiceBinomial regressionBinary regressionLogistic regressionMultinomial logistic regressionMixed logitProbitMultinomial probitOrdered logitOrdered probitPoisson Multilevel modelFixed effectsRandom effectsLinear mixed-effects modelNonlinear mixed-effects model Nonlinear regressionNonparametricSemiparametricRobustQuantileIsotonicPrincipal componentsLeast angleLocalSegmented Errors-in-variables Estimation Least squaresLinearNon-linear OrdinaryWeightedGeneralized PartialTotalNon-negativeRidge regressionRegularized Least absolute deviationsIteratively reweightedBayesianBayesian multivariateLeast-squares spectral analysis Background Regression validationMean and predicted responseErrors and residualsGoodness of fitStudentized residualGauss–Markov theorem Mathematics portal vte In statistics, the Gauss–Markov theorem (or simply Gauss theorem for some authors)[1] states that the ordinary least squares (OLS) estimator has the lowest sampling variance within the class of linear unbiased estimators, if the errors in the linear regression model are uncorrelated, have equal variances and expectation value of zero.[2] The errors do not need to be normal, nor do they need to be independent and identically distributed (only uncorrelated with mean zero and homoscedastic with finite variance). The requirement that the estimator be unbiased cannot be dropped, since biased estimators exist with lower variance. Sehen, zum Beispiel, the James–Stein estimator (which also drops linearity), ridge regression, or simply any degenerate estimator.

The theorem was named after Carl Friedrich Gauss and Andrey Markov, although Gauss' work significantly predates Markov's.[3] But while Gauss derived the result under the assumption of independence and normality, Markov reduced the assumptions to the form stated above.[4] A further generalization to non-spherical errors was given by Alexander Aitken.[5] Inhalt 1 Aussage 1.1 Anmerkung 2 Nachweisen 3 Remarks on the proof 4 Generalized least squares estimator 5 Gauss–Markov theorem as stated in econometrics 5.1 Linearity 5.2 Strict exogeneity 5.3 Full rank 5.4 Spherical errors 6 Siehe auch 6.1 Other unbiased statistics 7 Verweise 8 Weiterlesen 9 External links Statement Suppose we have in matrix notation, {Anzeigestil {unterstreichen {j}}=X{unterstreichen {Beta }}+{unterstreichen {varepsilon }},Quad ({unterstreichen {j}},{unterstreichen {varepsilon }}in mathbb {R} ^{n},{unterstreichen {Beta }}in mathbb {R} ^{K}{Text{ und }}Xin mathbb {R} ^{ntimes K})} expanding to, {Anzeigestil y_{ich}= Summe _{j=1}^{K}Beta _{j}X_{ij}+varepsilon _{ich}quad forall i=1,2,ldots ,n} wo {Anzeigestil Beta _{j}} are non-random but unobservable parameters, {Anzeigestil X_{ij}} are non-random and observable (called the "explanatory variables"), {displaystyle varepsilon _{ich}} are random, und so {Anzeigestil y_{ich}} are random. The random variables {displaystyle varepsilon _{ich}} are called the "disturbance", "Lärm" or simply "error" (will be contrasted with "residual" later in the article; see errors and residuals in statistics). Note that to include a constant in the model above, one can choose to introduce the constant as a variable {Anzeigestil Beta _{K+1}} with a newly introduced last column of X being unity i.e., {Anzeigestil X_{ich(K+1)}=1} für alle {Anzeigestil i} . Note that though {Anzeigestil y_{ich},} as sample responses, are observable, the following statements and arguments including assumptions, proofs and the others assume under the only condition of knowing {Anzeigestil X_{ij},} but not {Anzeigestil y_{ich}.} The Gauss–Markov assumptions concern the set of error random variables, {displaystyle varepsilon _{ich}} : They have mean zero: {Anzeigestil Betreibername {E} [varepsilon _{ich}]=0.} They are homoscedastic, that is all have the same finite variance: {Anzeigestil Betreibername {War} (varepsilon _{ich})=sigma ^{2}0} In terms of vector multiplication, das heisst {Anzeigestil {Start{bMatrix}k_{1}&cdots &k_{p+1}Ende{bMatrix}}{Start{bMatrix}mathbf {v_{1}} \vdots \mathbf {v} _{p+1}Ende{bMatrix}}{Start{bMatrix}mathbf {v_{1}} &cdots &mathbf {v} _{p+1}Ende{bMatrix}}{Start{bMatrix}k_{1}\vdots \k_{p+1}Ende{bMatrix}}=mathbf {k} ^{mathsf {T}}{mathematisch {H}}mathbf {k} =lambda mathbf {k} ^{mathsf {T}}mathbf {k} >0} wo {Display-Lambda } is the eigenvalue corresponding to {Anzeigestil mathbf {k} } . Darüber hinaus, {Anzeigestil mathbf {k} ^{mathsf {T}}mathbf {k} = Summe _{i=1}^{p+1}k_{ich}^{2}>0implies lambda >0} Endlich, as eigenvector {Anzeigestil mathbf {k} } was arbitrary, it means all eigenvalues of {Anzeigestil {mathematisch {H}}} are positive, deshalb {Anzeigestil {mathematisch {H}}} is positive definite. Daher, {Anzeigestil {Fettsymbol {Beta }}=links(X^{mathsf {T}}Xright)^{-1}X^{mathsf {T}}Y} is indeed a global minimum.

Remarks on the proof As it has been stated before, the condition of {Anzeigestil Betreibername {War} links({tilde {Beta }}Rechts)-Name des Bedieners {War} links({Breithut {Beta }}Rechts)} is a positive semidefinite matrix is equivalent to the property that the best linear unbiased estimator of {displaystyle ell ^{t}Beta } ist {displaystyle ell ^{t}{Breithut {Beta }}} (best in the sense that it has minimum variance). Um das zu sehen, Lassen {displaystyle ell ^{t}{tilde {Beta }}} another linear unbiased estimator of {displaystyle ell ^{t}Beta } .

{Anzeigestil {Start{ausgerichtet}Name des Bedieners {War} links(ell ^{t}{tilde {Beta }}Rechts)&=ell ^{t}Name des Bedieners {War} links({tilde {Beta }}Rechts)ell \&=sigma ^{2}ell ^{t}(X'X)^{-1}ell +ell ^{t}DD^{t}ell \&=operatorname {War} links(ell ^{t}{Breithut {Beta }}Rechts)+(D^{t}Ell )^{t}(D^{t}Ell )&&sigma ^{2}ell ^{t}(X'X)^{-1}ell =operatorname {War} links(ell ^{t}{Breithut {Beta }}Rechts)\&=operatorname {War} links(ell ^{t}{Breithut {Beta }}Rechts)+|D^{t}Ell |\&geq operatorname {War} links(ell ^{t}{Breithut {Beta }}Rechts)Ende{ausgerichtet}}} Darüber hinaus, equality holds if and only if {Anzeigestil D^{t}ell = 0} . We calculate {Anzeigestil {Start{ausgerichtet}ell ^{t}{tilde {Beta }}&=ell ^{t}links(((X'X)^{-1}X'+D)Yright)&&{Text{ from above}}\&=ell ^{t}(X'X)^{-1}X'Y+ell ^{t}DY\&=ell ^{t}{Breithut {Beta }}+(D^{t}Ell )^{t}Y\&=ell ^{t}{Breithut {Beta }}&&D^{t}ell =0end{ausgerichtet}}} This proves that the equality holds if and only if {displaystyle ell ^{t}{tilde {Beta }}=ell ^{t}{Breithut {Beta }}} which gives the uniqueness of the OLS estimator as a BLUE.

Generalized least squares estimator The generalized least squares (GLS), developed by Aitken,[5] extends the Gauss–Markov theorem to the case where the error vector has a non-scalar covariance matrix.[6] The Aitken estimator is also a BLUE.

Gauss–Markov theorem as stated in econometrics In most treatments of OLS, the regressors (parameters of interest) in the design matrix {Anzeigestil mathbf {X} } are assumed to be fixed in repeated samples. This assumption is considered inappropriate for a predominantly nonexperimental science like econometrics.[7] Stattdessen, the assumptions of the Gauss–Markov theorem are stated conditional on {Anzeigestil mathbf {X} } .

Linearity The dependent variable is assumed to be a linear function of the variables specified in the model. The specification must be linear in its parameters. This does not mean that there must be a linear relationship between the independent and dependent variables. The independent variables can take non-linear forms as long as the parameters are linear. The equation {displaystyle y=beta _{0}+Beta _{1}x^{2},} qualifies as linear while {displaystyle y=beta _{0}+Beta _{1}^{2}x} can be transformed to be linear by replacing {Anzeigestil Beta _{1}^{2}} by another parameter, sagen {Anzeigestil Gamma } . An equation with a parameter dependent on an independent variable does not qualify as linear, zum Beispiel {displaystyle y=beta _{0}+Beta _{1}(x)cdot x} , wo {Anzeigestil Beta _{1}(x)} is a function of {Anzeigestil x} .

Data transformations are often used to convert an equation into a linear form. Zum Beispiel, the Cobb–Douglas function—often used in economics—is nonlinear: {displaystyle Y=AL^{Alpha }K^{1-Alpha }e^{varepsilon }} But it can be expressed in linear form by taking the natural logarithm of both sides:[8] {displaystyle ln Y=ln A+alpha ln L+(1-Alpha )ln K+varepsilon =beta _{0}+Beta _{1}ln L+beta _{2}ln K+varepsilon } This assumption also covers specification issues: assuming that the proper functional form has been selected and there are no omitted variables.

One should be aware, jedoch, that the parameters that minimize the residuals of the transformed equation do not necessarily minimize the residuals of the original equation.

Strict exogeneity For all {Anzeigestil n} observations, the expectation—conditional on the regressors—of the error term is zero:[9] {Anzeigestil Betreibername {E} [,varepsilon _{ich}mid mathbf {X} ]= Betreibername {E} [,varepsilon _{ich}mid mathbf {x} _{1},Punkte ,mathbf {x} _{n}]=0.} wo {Anzeigestil mathbf {x} _{ich}={Start{bMatrix}x_{i1}&x_{i2}&cdots &x_{ik}Ende{bMatrix}}^{mathsf {T}}} is the data vector of regressors for the ith observation, and consequently {Anzeigestil mathbf {X} ={Start{bMatrix}mathbf {x} _{1}^{mathsf {T}}&mathbf {x} _{2}^{mathsf {T}}&cdots &mathbf {x} _{n}^{mathsf {T}}Ende{bMatrix}}^{mathsf {T}}} is the data matrix or design matrix.

Geometrisch, this assumption implies that {Anzeigestil mathbf {x} _{ich}} und {displaystyle varepsilon _{ich}} are orthogonal to each other, so that their inner product (d.h., their cross moment) ist Null.

{Anzeigestil Betreibername {E} [,mathbf {x} _{j}cdot varepsilon _{ich},]={Start{bMatrix}Name des Bedieners {E} [,{x}_{j1}cdot varepsilon _{ich},]\Name des Bedieners {E} [,{x}_{j2}cdot varepsilon _{ich},]\vdots \operatorname {E} [,{x}_{jk}cdot varepsilon _{ich},]Ende{bMatrix}}=mathbf {0} Quad {Text{für alle }}ich,jin n} This assumption is violated if the explanatory variables are stochastic, for instance when they are measured with error, or are endogenous.[10] Endogeneity can be the result of simultaneity, where causality flows back and forth between both the dependent and independent variable. Instrumental variable techniques are commonly used to address this problem.

Full rank The sample data matrix {Anzeigestil mathbf {X} } must have full column rank.

{Anzeigestil Betreibername {Rang} (mathbf {X} )=k} Andernfalls {Anzeigestil mathbf {X} 'mathbf {X} } is not invertible and the OLS estimator cannot be computed.

A violation of this assumption is perfect multicollinearity, d.h. some explanatory variables are linearly dependent. One scenario in which this will occur is called "dummy variable trap," when a base dummy variable is not omitted resulting in perfect correlation between the dummy variables and the constant term.[11] Multicollinearity (as long as it is not "perfect") can be present resulting in a less efficient, but still unbiased estimate. The estimates will be less precise and highly sensitive to particular sets of data.[12] Multicollinearity can be detected from condition number or the variance inflation factor, among other tests.

Spherical errors The outer product of the error vector must be spherical.

{Anzeigestil Betreibername {E} [,{Fettsymbol {varepsilon }}{Fettsymbol {varepsilon ^{mathsf {T}}}}mid mathbf {X} ]= Betreibername {War} [,{Fettsymbol {varepsilon }}mid mathbf {X} ]={Start{bMatrix}Sigma ^{2}&0&cdots &0\0&sigma ^{2}&cdots &0\vdots &vdots &ddots &vdots \0&0&cdots &sigma ^{2}Ende{bMatrix}}=sigma ^{2}mathbf {ich} Quad {Text{mit }}Sigma ^{2}>0} This implies the error term has uniform variance (homoscedasticity) and no serial dependence.[13] If this assumption is violated, OLS is still unbiased, but inefficient. The term "spherical errors" will describe the multivariate normal distribution: wenn {Anzeigestil Betreibername {War} [,{Fettsymbol {varepsilon }}mid mathbf {X} ]=sigma ^{2}mathbf {ich} } in the multivariate normal density, dann die Gleichung {Anzeigestil f(varepsilon )=c} is the formula for a ball centered at μ with radius σ in n-dimensional space.[14] Heteroskedasticity occurs when the amount of error is correlated with an independent variable. Zum Beispiel, in a regression on food expenditure and income, the error is correlated with income. Low income people generally spend a similar amount on food, while high income people may spend a very large amount or as little as low income people spend. Heteroskedastic can also be caused by changes in measurement practices. Zum Beispiel, as statistical offices improve their data, measurement error decreases, so the error term declines over time.

This assumption is violated when there is autocorrelation. Autocorrelation can be visualized on a data plot when a given observation is more likely to lie above a fitted line if adjacent observations also lie above the fitted regression line. Autocorrelation is common in time series data where a data series may experience "inertia." If a dependent variable takes a while to fully absorb a shock. Spatial autocorrelation can also occur geographic areas are likely to have similar errors. Autocorrelation may be the result of misspecification such as choosing the wrong functional form. In these cases, correcting the specification is one possible way to deal with autocorrelation.

In the presence of spherical errors, the generalized least squares estimator can be shown to be BLUE.[6] See also Independent and identically distributed random variables Linear regression Measurement uncertainty Other unbiased statistics Best linear unbiased prediction (BLUP) Minimum-variance unbiased estimator (MVUE) References ^ See chapter 7 of Johnson, R.A.; Wichern, D.W. (2002). Applied multivariate statistical analysis. Vol. 5. Prentice hall. ^ Theil, Henri (1971). "Best Linear Unbiased Estimation and Prediction". Principles of Econometrics. New York: John Wiley & Sons. pp. 119–124. ISBN 0-471-85845-5. ^ Plackett, R. L. (1949). "A Historical Note on the Method of Least Squares". Biometrika. 36 (3/4): 458–460. doi:10.2307/2332682. ^ David, F. N.; Neyman, J. (1938). "Extension of the Markoff theorem on least squares". Statistical Research Memoirs. 2: 105–116. OCLC 4025782. ^ Nach oben springen: a b Aitken, EIN. C. (1935). "On Least Squares and Linear Combinations of Observations". Proceedings of the Royal Society of Edinburgh. 55: 42–48. doi:10.1017/S0370164600014346. ^ Nach oben springen: a b Huang, David S. (1970). Regression and Econometric Methods. New York: John Wiley & Sons. pp. 127–147. ISBN 0-471-41754-8. ^ Hayashi, Fumio (2000). Econometrics. Princeton University Press. p. 13. ISBN 0-691-01018-8. ^ Walters, EIN. EIN. (1970). An Introduction to Econometrics. New York: W. W. Norton. p. 275. ISBN 0-393-09931-8. ^ Hayashi, Fumio (2000). Econometrics. Princeton University Press. p. 7. ISBN 0-691-01018-8. ^ Johnston, John (1972). Econometric Methods (Zweite Aufl.). New York: McGraw-Hill. pp. 267–291. ISBN 0-07-032679-7. ^ Wooldridge, Jeffrey (2012). Introductory Econometrics (Fifth international ed.). South-Western. p. 220. ISBN 978-1-111-53439-4. ^ Johnston, John (1972). Econometric Methods (Zweite Aufl.). New York: McGraw-Hill. pp. 159–168. ISBN 0-07-032679-7. ^ Hayashi, Fumio (2000). Econometrics. Princeton University Press. p. 10. ISBN 0-691-01018-8. ^ Ramanathan, Ramu (1993). "Nonspherical Disturbances". Statistical Methods in Econometrics. Akademische Presse. pp. 330–351. ISBN 0-12-576830-3. Further reading Davidson, James (2000). "Statistical Analysis of the Regression Model". Econometric Theory. Oxford: Schwarzwell. pp. 17–36. ISBN 0-631-17837-6. Goldberger, Arthur (1991). "Classical Regression". A Course in Econometrics. Cambridge: Harvard University Press. pp. 160–169. ISBN 0-674-17544-1. Theil, Henri (1971). "Least Squares and the Standard Linear Model". Principles of Econometrics. New York: John Wiley & Sons. pp. 101–162. ISBN 0-471-85845-5. External links Earliest Known Uses of Some of the Words of Mathematics: G (brief history and explanation of the 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 hide vte Least squares and regression analysis Computational statistics Least squaresLinear least squaresNon-linear least squaresIteratively reweighted least squares Correlation and dependence Pearson product-moment correlationRank correlation (Spearman's rhoKendall's tau)Partial correlationConfounding variable Regression analysis Ordinary least squaresPartial least squaresTotal least squaresRidge regression Regression as a statistical model Linear regression Simple linear regressionOrdinary least squaresGeneralized least squaresWeighted least squaresGeneral linear model Predictor structure Polynomial regressionGrowth curve (Statistiken)Segmented regressionLocal regression Non-standard Nonlinear regressionNonparametricSemiparametricRobustQuantileIsotonic Non-normal errors Generalized linear modelBinomialPoissonLogistic Decomposition of variance Analysis of varianceAnalysis of covarianceMultivariate AOV Model exploration Stepwise regressionModel selection Mallows's CpAICBICModel specificationRegression validation Background Mean and predicted responseGauss–Markov theoremErrors and residualsGoodness of fitStudentized residualMinimum mean-square errorFrisch–Waugh–Lovell theorem Design of experiments Response surface methodologyOptimal designBayesian design Numerical approximation Numerical analysisApproximation theoryNumerical integrationGaussian quadratureOrthogonal polynomialsChebyshev polynomialsChebyshev nodes Applications Curve fittingCalibration curveNumerical smoothing and differentiationSystem identificationMoving least squares Regression analysis categoryStatistics category Mathematics portalStatistics outlineStatistics topics Categories: Theorems in statistics

Wenn Sie andere ähnliche Artikel wissen möchten Gauss–Markov theorem Sie können die Kategorie besuchen Theorems in statistics.

Geh hinauf

Wir verwenden eigene Cookies und Cookies von Drittanbietern, um die Benutzererfahrung zu verbessern Mehr Informationen