Linear unbiased estimator

In a linear model $Y=X\beta +\epsilon$, a linear estimator has the form $AY$. It is unbiased for $C\beta$ exactly when $AX=C$. A best linear unbiased estimator minimizes its covariance, or its variance for a scalar target, among all estimators satisfying this constraint.

A best linear unbiased estimator minimizes covariance among linear estimators unbiased for the same target. In $Y=X\beta +\epsilon$, assume $\mathbb{E}\epsilon =0$, $X$ is a full-column-rank design matrix and the known covariance matrix $\Sigma$ is a positive-definite matrix. The best linear unbiased estimator of the coefficient vector is $(X^T{\Sigma }^{-1}X{)}^{-1}{X}^T{\Sigma }^{-1}Y$. A spatial trend estimate excludes the correlated residual prediction included in universal kriging.

For $X\sim N(\mu 1,C)$ with a known positive-definite matrix $C$, the maximum-likelihood estimator of $\mu$ is $\hat{\mu }=(1^T{C}^{-1}X)/(1^T{C}^{-1}1)$. It is unbiased with variance $(1^T{C}^{-1}1{)}^{-1}$, attaining the Cramer-Rao bound. It is also the best linear unbiased estimator. Pairwise admissible correlation coefficients alone do not ensure that $C$ is a valid covariance matrix; the entire matrix must be symmetric and a positive semidefinite matrix. Inverse-based formulas require positive definiteness.

For independent unbiased estimators $X_i$ of a common mean with known positive variances $v_i$, the linear unbiased estimator with smallest variance has weights $w_i=v_i^{-1}/{\sum }_j{v}_j^{-1}$ and variance $({\sum }_j{v}_j^{-1}{)}^{-1}$. Unbiasedness requires ${\sum }_i{w}_i=1$. Minimizing ${\sum }_i{v}_i{w}_i^2$ by a Lagrange multiplier gives the weights, and the strictly positive diagonal Hessian matrix proves a unique global minimum. This conclusion requires no normality assumption.