1.5 Completeness
Completeness is the property that makes unbiased estimators based on a statistic unique, and it is the key to finding UMVUEs.
Definition 1.5.1. A statistic \(T\) (or its family of distributions \(\{f_T(t;\theta ) : \theta \in \Omega \}\)) is complete if, for every function \(h\), \[E_\theta \left [h(T)\right ] = 0\ \text {for all } \theta \in \Omega \qquad \text {implies}\qquad P_\theta \left (h(T) = 0\right ) = 1\ \text {for all } \theta \in \Omega .\]
In words: the only function of \(T\) that is an unbiased estimator of zero is zero itself. If some nonzero \(h(T)\) had mean zero for every \(\theta \), then \(T\) would contain a component whose distribution carries no information about \(\theta \).
Example 1.5.2. Let \(X_1, \dots , X_n\) (\(n\ge 2\)) be a random sample from \(N(\theta , 1)\), and let \(T(X) = \left (X_1, \sum _{i=1}^n X_i\right )\). Show that \(T\) is sufficient but not complete.
Solution. \[f_\theta (x) = (2\pi )^{-n/2}\exp \left (-\frac 12\sum x_i^2\right )\exp \left (\theta \sum x_i - \frac {n\theta ^2}{2}\right ),\] which depends on the data, apart from a factor free of \(\theta \), only through \(\sum x_i\). So \(\sum X_i\) is sufficient, and so is \(T\), which contains it. Now take \(h(T) = X_1 - \frac 1n\sum X_i = X_1 - \bar X\), a function of \(T\). Then \[E_\theta \left [h(T)\right ] = \theta - \theta = 0\qquad \text {for every } \theta ,\] but \(X_1 - \bar X\sim N\left (0, 1 - \frac 1n\right )\) is a continuous random variable, so \(P_\theta (h(T) = 0) = 0\ne 1\). Hence \(T\) is not complete. The first component \(X_1\) adds nothing to the sufficient statistic and spoils completeness.
Example 1.5.3. Let \(X_1, \dots , X_n\) be a random sample from the Bernoulli\((\theta )\) distribution, \(0<\theta <1\), and let \(T = \sum X_i\). Show that \(T\) is complete and sufficient.
Solution. \[f_\theta (x) = \prod ^n_{i = 1}\theta ^{x_i}(1 - \theta )^{1 - x_i} = \theta ^{\sum x_i}(1 - \theta )^{n - \sum x_i},\] a function of \(\theta \) and \(\sum x_i\) only, so \(T\) is sufficient by theorem 1.3.4, with \(h = 1\). Now \(T\sim \text {BIN}(n, \theta )\). Suppose \(E_\theta \left [h(T)\right ] = 0\) for all \(\theta \in (0, 1)\). Then \[0 = \sum ^n_{t = 0} h(t)\binom {n}{t}\theta ^t(1 - \theta )^{n - t} = (1 - \theta )^n\sum ^n_{t = 0} h(t)\binom {n}{t} r^t,\qquad r = \frac {\theta }{1 - \theta } .\] As \(\theta \) ranges over \((0, 1)\), \(r\) ranges over \((0, \infty )\). A polynomial in \(r\) that vanishes on an interval has all its coefficients zero, so \(h(t)\binom nt = 0\) and hence \(h(t) = 0\) for \(t = 0, 1, \dots , n\). So \(P_\theta (h(T) = 0) = 1\) and \(T\) is complete.
Problem 1.5.1. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the \(UNIF(0,\theta )\) distribution. Show that \(T(X) = X_{(n)}\) is a complete statistic for \(\{f_{\theta }(x);\, \theta \in \Omega \}\).
Show solution
Solution. The maximum has density \[f_T(t) = \frac {n\,t^{\,n-1}}{\theta ^{n}},\qquad 0<t<\theta .\] Suppose \(h\) is a function with \(E_{\theta }\left [h(T)\right ]=0\) for every \(\theta >0\). Then \[\frac {n}{\theta ^{n}}\int _0^{\theta } h(t)\,t^{\,n-1}\,dt = 0 \qquad \Longrightarrow \qquad \int _0^{\theta } h(t)\,t^{\,n-1}\,dt = 0 \quad \text {for every }\theta >0 ,\] since \(n/\theta ^{n}\neq 0\). The left-hand side is a function of its upper limit which vanishes identically, so differentiating with respect to \(\theta \) by the fundamental theorem of calculus gives \[h(\theta )\,\theta ^{\,n-1} = 0 \qquad \text {for almost every }\theta >0 .\] As \(\theta ^{n-1}\neq 0\) on \((0,\infty )\), this forces \(h(\theta )=0\) almost everywhere, which is exactly completeness.
Note. The whole argument is that the family of intervals \((0,\theta )\) grows to fill \((0,\infty )\) as \(\theta \) varies. Completeness here is a statement about the richness of the parameter set, not about the shape of the density — which is why restricting \(\theta \) to a finite set would destroy it.
Problem 1.5.2. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the \(N(\theta , a\theta ^2)\) distribution where \(a>0\) is a known constant and \(\theta >0\). Show that the minimal sufficient statistic is not complete.
Show solution
Solution.
The minimal sufficient statistic
Expanding the exponent, \[-\frac {1}{2a\theta ^{2}}\sum _{i=1}^{n}(x_i-\theta )^{2} = -\frac {1}{2a\theta ^{2}}\sum _{i=1}^{n}x_i^{2} + \frac {1}{a\theta }\sum _{i=1}^{n}x_i - \frac {n}{2a},\] so the density depends on the data only through \(T = \left (\sum _i X_i,\ \sum _i X_i^{2}\right )\), and the ratio criterion shows no further reduction is possible: the two coefficients \(1/(2a\theta ^{2})\) and \(1/(a\theta )\) move independently enough that matching the ratio for all \(\theta \) forces both components to agree. So \(T\) is minimal sufficient.
Why it is not complete
Both components can be scaled to estimate \(\theta ^{2}\) unbiasedly. Since \(E(X_i)=\theta \) and \(\var (X_i)=a\theta ^{2}\), \[E\left (\sum _i X_i^{2}\right ) = n\left (a\theta ^{2}+\theta ^{2}\right ) = n(1+a)\theta ^{2},\] \[E\left [\left (\sum _i X_i\right )^{2}\right ] = \var \left (\sum _i X_i\right ) + \left [E\left (\sum _i X_i\right )\right ]^{2} = na\theta ^{2} + n^{2}\theta ^{2} = n(a+n)\theta ^{2}.\] Hence the non-zero function \[h(T) = \frac {\sum _i X_i^{2}}{n(1+a)} - \frac {\left (\sum _i X_i\right )^{2}}{n(a+n)}\] satisfies \(E_{\theta }\left [h(T)\right ] = \theta ^{2}-\theta ^{2} = 0\) for every \(\theta >0\), while \(h\) is not identically zero. So \(T\) is not complete.
Remark. The model has one parameter but a two-dimensional minimal sufficient statistic, and that mismatch is the whole reason completeness fails: there are two separate routes to \(\theta ^{2}\) and their difference is a non-trivial function of \(T\) with zero mean. It also means the Lehmann–Scheffé theorem is unavailable here, so an unbiased estimator based on \(T\) carries no guarantee of being the UMVUE.
1.5.1 Completeness, Sufficiency and Minimality
Theorem 1.5.4 (Bahadur). If \(T(X)\) is a complete sufficient statistic for \(\{f_\theta (x) : \theta \in \Omega \}\) and a minimal sufficient statistic exists, then \(T(X)\) is minimal sufficient.
Proof. Assume \(E_\theta |T|<\infty \), and let \(S = S(X)\) be a minimal sufficient statistic. Since \(T\) is sufficient and \(S\) is minimal, \(S\) is a function of \(T\): \(S = r(T)\) for some \(r\).
Because \(S\) is sufficient, the conditional expectation \(h(S) = E_\theta (T\mid S)\) does not depend on \(\theta \), so \(h\) is a genuine statistic. By the law of total expectation (theorem 1.5.5), for every \(\theta \), \[E_\theta \left [T - h(r(T))\right ] = E_\theta (T) - E_\theta \left [E(T\mid S)\right ] = 0 .\] The quantity in brackets is a function of \(T\) alone with zero mean for every \(\theta \), so completeness gives \(T = h(r(T)) = h(S)\) with probability one. Thus \(T\) is a function of \(S\) and \(S\) is a function of \(T\); the two statistics are equivalent, and \(T\) is minimal sufficient because \(S\) is. □
Bahadur’s theorem is a reason to check completeness: it upgrades a sufficient statistic to a minimal one without comparing likelihood ratios. The converse is false; problem 1.5.3 below gives the standard counterexample, and problem 1.5.2 another.
Problem 1.5.3. The converse of the above theorem is not true. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the \(UNIF(\theta - 1, \theta + 1)\) distribution. Show that \(T(X) = \left (X_{(1)}, X_{(n)}\right )\) is minimal sufficient. Show also that for the nonzero function \[h(T) = \frac {X_{(n)} - X_{(1)}}{2} - \frac {n - 1}{n + 1}\] \(E_{\theta }\left [h(T)\right ] =0\) for all \(\theta \in \Omega \) and therefore \(T\) is not a complete statistic.
Show solution
Solution.
Minimal sufficiency
The joint density is one exactly when every observation lies in \((\theta -1,\theta +1)\): \[f_{\theta }(x) = \prod _{i=1}^{n} \frac {1}{2}\,I\left (\theta -1<x_i<\theta +1\right ) = 2^{-n}\,I\left (x_{(n)}-1<\theta <x_{(1)}+1\right ).\] For two samples the ratio \(f_{\theta }(x)/f_{\theta }(y)\) is a constant function of \(\theta \) precisely when the intervals \(\left (x_{(n)}-1,\ x_{(1)}+1\right )\) and \(\left (y_{(n)}-1,\ y_{(1)}+1\right )\) coincide, that is when \(x_{(1)}=y_{(1)}\) and \(x_{(n)}=y_{(n)}\). So \(T=\left (X_{(1)},X_{(n)}\right )\) is minimal sufficient.
It is not complete
Put \(R = X_{(n)}-X_{(1)}\), the sample range. The observations are uniform on an interval of length \(2\), and the range of \(n\) independent uniforms on an interval of length \(L\) has mean \(L(n-1)/(n+1)\). With \(L=2\), \[E_{\theta }(R) = \frac {2(n-1)}{n+1}\qquad \text {for every }\theta ,\] the value being free of \(\theta \) because the range is invariant under the shift \(x\mapsto x+c\) that carries one parameter value to another. Therefore \[E_{\theta }\left [h(T)\right ] = E_{\theta }\left [\frac {X_{(n)}-X_{(1)}}{2}\right ] - \frac {n-1}{n+1} = \frac {n-1}{n+1} - \frac {n-1}{n+1} = 0 \qquad \text {for all }\theta \in \Omega ,\] while \(h\) is plainly not the zero function — the range is genuinely random. So \(T\) is minimal sufficient but not complete, which is the promised counterexample to the converse.
Note. The mechanism is worth naming. The range is an ancillary statistic: its distribution does not involve \(\theta \) at all. Any non-constant ancillary function of a statistic destroys completeness immediately, by centring it. This is the same phenomenon Basu’s theorem exploits from the other direction.
Problem 1.5.4. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the \(UNIF(0,\theta )\) distribution. prove that \(T(X) = X_{(n)}\) is a minimal sufficient statistic for this model.
Show solution
Solution. For the UNIF\((0,\theta )\) model the joint density is \begin {align*} f_{\theta }(x) &= \frac {1}{\theta ^{n}}\prod _{i=1}^{n}I\left (0<x_i<\theta \right )\\ &= \frac {1}{\theta ^{n}}\,I\left (x_{(1)}>0\right )\,I\left (x_{(n)}<\theta \right ). \end {align*}
Sufficiency of \(X_{(n)}\) follows from the factorisation criterion at once, with \(g\left (x_{(n)},\theta \right )=\theta ^{-n}I\left (x_{(n)}<\theta \right )\) and \(h(x)=I\left (x_{(1)}>0\right )\).
For minimality, take two samples in the support and form \[\frac {f_{\theta }(x)}{f_{\theta }(y)} = \frac {I\left (x_{(n)}<\theta \right )}{I\left (y_{(n)}<\theta \right )} .\] Viewed as a function of \(\theta \), this is constant only if the two indicators change value at the same point, that is only if \(x_{(n)} = y_{(n)}\). Hence \(X_{(n)}\) is minimal sufficient.
Combined with the completeness shown above, \(X_{(n)}\) is complete and sufficient, so by Bahadur’s theorem its minimality also follows without this calculation — but the direct argument is shorter than the theorem it instantiates.
Problem 1.5.5. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the \(EXP(1, \theta )\) distribution. Show that \(T(X) = X_{(1)}\) is a minimal sufficient statistic for the model.
Show solution
Solution. This is the calculation already carried out in the previous section, and it is worth recording that the two are the same problem. The joint density is \[f_{\theta }(x) = e^{n\theta }\,I\left (x_{(1)}>\theta \right )\cdot e^{-\sum _i x_i},\] so \(X_{(1)}\) is sufficient by factorisation, and the ratio \[\frac {f_{\theta }(x)}{f_{\theta }(y)} = e^{\sum _i y_i-\sum _i x_i}\cdot \frac {I\left (x_{(1)}>\theta \right )}{I\left (y_{(1)}>\theta \right )}\] is free of \(\theta \) only when the two indicators switch at the same place, that is only when \(x_{(1)}=y_{(1)}\). Hence \(X_{(1)}\) is minimal sufficient.
Completeness holds as well, by the same upper-limit differentiation used for the UNIF\((0,\theta )\) maximum: \(X_{(1)}\) has density \(n\,e^{-n(t-\theta )}\) on \((\theta ,\infty )\), and \(\int _{\theta }^{\infty }h(t)e^{-nt}\,dt = 0\) for every \(\theta \) forces \(h=0\) almost everywhere. So \(X_{(1)}\) is complete and sufficient, which is what the next problem needs.
1.5.2 Conditioning: Total Expectation and Total Variance
Theorem 1.5.5. For any random variables \(X\) and \(Y\) for which the expectations exist, \[E(X) = E\left [E(X\mid Y)\right ]\qquad \text {and}\qquad \var (X) = E\left [\var (X\mid Y)\right ] + \var \left [E(X\mid Y)\right ].\]
Proof.
The first identity
Writing the inner expectation out and exchanging the order of integration, \begin {align*} E\left [E(X\mid Y)\right ] &= \int \left [\int x\, f_{X\mid Y}(x\mid y)\,dx\right ] f_Y(y)\,dy\\ &= \iint x\, f_{X\mid Y}(x\mid y)\, f_Y(y)\,dx\,dy . \end {align*}
The product \(f_{X\mid Y}(x\mid y)f_Y(y)\) is the joint density \(f(x,y)\), so the double integral is \(\iint x\,f(x,y)\,dx\,dy = E(X)\). In the discrete case replace the integrals by sums.
The second identity
Apply the first identity to \(X^2\) and use \(\var (X\mid Y) = E\left (X^2\mid Y\right ) - \left [E(X\mid Y)\right ]^2\): \[E\left (X^2\right ) = E\left [E\left (X^2\mid Y\right )\right ] = E\left [\var (X\mid Y)\right ] + E\left [\left \{E(X\mid Y)\right \}^2\right ].\] Subtract \(\left [E(X)\right ]^2 = \left \{E\left [E(X\mid Y)\right ]\right \}^2\) from both sides. The left side becomes \(\var (X)\), and on the right \(E\left [\left \{E(X\mid Y)\right \}^2\right ] - \left \{E\left [E(X\mid Y)\right ]\right \}^2 = \var \left [E(X\mid Y)\right ]\). □
The second identity says that conditioning on \(Y\) splits the variance of \(X\) into the part explained by \(Y\) and the average variance left over. Applied to an estimator and a sufficient statistic, it gives the Rao–Blackwell theorem.
Theorem 1.5.6 (Rao–Blackwell). Let \(U\) be an unbiased estimator of \(\tau (\theta )\) and let \(T\) be a sufficient statistic. Then \(\phi (T) = E(U\mid T)\) is a statistic, it is unbiased for \(\tau (\theta )\), and \[\var _\theta \left [\phi (T)\right ]\le \var _\theta (U)\qquad \text {for all } \theta ,\] with equality only if \(U = \phi (T)\) with probability one.
Proof. By sufficiency the conditional distribution of the sample given \(T\), and hence of \(U\) given \(T\), does not involve \(\theta \); so \(\phi (T)\) can be computed from the data and is a statistic. By theorem 1.5.5, \(E_\theta \left [\phi (T)\right ] = E_\theta (U) = \tau (\theta )\), and \[\var _\theta (U) = E_\theta \left [\var (U\mid T)\right ] + \var _\theta \left [\phi (T)\right ] \ge \var _\theta \left [\phi (T)\right ] .\] Equality holds only if \(E_\theta \left [\var (U\mid T)\right ] = 0\), that is, \(U\) is constant given \(T\), which means \(U = \phi (T)\). □
Sufficiency is essential in this theorem. Without it \(E(U\mid T)\) would depend on \(\theta \) and would not be an estimator.
Example 1.5.7. Let \(X_1, \dots , X_n\) be a random sample from \(\text {POI}(\theta )\). The estimator \(U = X_1\) is unbiased for \(\theta \). Improve it by conditioning on \(T = \sum X_i\).
Solution. By example 1.3.2, given \(T = t\) the sample is multinomial with \(t\) trials and equal probabilities \(\frac 1n\), so \(X_1\mid T = t\sim \text {BIN}\left (t, \frac 1n\right )\) and \(E(X_1\mid T = t) = \frac tn\). The improved estimator is \(\phi (T) = \frac Tn = \bar X\), with variance \(\frac \theta n\) in place of \(\var (X_1) = \theta \).
Theorem 1.5.8. If \(T(X)\) is a complete statistic, then there is at most one function of \(T\) that is an unbiased estimator of \(\tau (\theta )\).
Proof. Suppose \(g_1(T)\) and \(g_2(T)\) are both unbiased for \(\tau (\theta )\). Then \(h(T) = g_1(T) - g_2(T)\) has \(E_\theta \left [h(T)\right ] = 0\) for every \(\theta \), and completeness gives \(P_\theta (h(T) = 0) = 1\). So \(g_1(T) = g_2(T)\) with probability one. □
1.5.3 Minimum Variance Unbiased Estimation
Theorem 1.5.9. If \(T(X)\) is a complete sufficient statistic and \(E_\theta \left [g(T)\right ] = \tau (\theta )\) for all \(\theta \), then \(g(T)\) is the UMVUE of \(\tau (\theta )\).
Proof. Let \(U\) be any unbiased estimator of \(\tau (\theta )\). By theorem 1.5.6, \(\phi (T) = E(U\mid T)\) is an unbiased function of \(T\) with \(\var _\theta (\phi (T))\le \var _\theta (U)\). By theorem 1.5.8 there is only one unbiased function of \(T\), so \(\phi (T) = g(T)\). Hence \(\var _\theta (g(T))\le \var _\theta (U)\) for every \(\theta \) and every unbiased \(U\). □
The theorem gives two ways of finding a UMVUE once a complete sufficient statistic \(T\) is known:
- 1.
- find a function \(g(T)\) with \(E_\theta \left [g(T)\right ] = \tau (\theta )\), usually by computing moments of \(T\) and adjusting; or
- 2.
- take any simple unbiased estimator \(U\) and compute \(E(U\mid T)\).
The second method is the subject of theorem 1.5.12.
Example 1.5.10. Let \(X_1, \dots , X_n\) (\(n\ge 2\)) be a random sample from Bernoulli\((\theta )\). Find the UMVUE of \(\theta ^2\).
Solution. By example 1.5.3, \(T = \sum X_i\sim \text {BIN}(n, \theta )\) is complete and sufficient. Its first two moments are \(E(T) = n\theta \) and \(E(T^2) = \var (T) + \left [E(T)\right ]^2 = n\theta (1 - \theta ) + n^2\theta ^2\), so \[E\left [T(T - 1)\right ] = E(T^2) - E(T) = n^2\theta ^2 - n\theta ^2 = n(n - 1)\theta ^2 .\] Hence \(\frac {T(T - 1)}{n(n - 1)}\) is an unbiased function of \(T\), and by theorem 1.5.9 it is the UMVUE of \(\theta ^2\). In terms of the sample mean it is \(\frac {\bar X(n\bar X - 1)}{n - 1}\). Note that the obvious estimator \(\bar X^2\) is biased: \(E(\bar X^2) = \theta ^2 + \frac {\theta (1 - \theta )}{n}\).
Example 1.5.11. Let \(X_1, \dots , X_n\) be a random sample from \(\text {UNIF}(0, \theta )\). Find the UMVUE of \(\theta \).
Solution. \(T = X_{(n)}\) is complete (problem 1.5.1) and sufficient (example 1.3.7). By example 1.2.7, \(E(T) = \frac {n}{n + 1}\theta \), so \(E\left [\frac {n + 1}{n}T\right ] = \theta \) and \(\frac {n + 1}{n}X_{(n)}\) is the UMVUE of \(\theta \). Its variance is \(\left (\frac {n + 1}{n}\right )^2\frac {n\theta ^2}{(n + 1)^2(n + 2)} = \frac {\theta ^2}{n(n + 2)}\), smaller than the \(\frac {\theta ^2}{3n}\) of the unbiased estimator \(2\bar X\) for every \(n\ge 2\).
Problem 1.5.6. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the Bernoulli\((\theta )\) distribution. Find the \(UMVUE\) of \(\tau (\theta ) = \theta (1 -\theta )\).
Show solution
Solution. \(T=\sum _{i=1}^{n}X_i\sim \) BIN\((n,\theta )\) is complete and sufficient, so by Lehmann–Scheffé it is enough to find any function of \(T\) that is unbiased for \(\theta (1-\theta )\); it is then automatically the UMVUE.
Try \(T(n-T)\). Using \(E(T)=n\theta \) and \(E\left (T^{2}\right )=n\theta (1-\theta )+n^{2}\theta ^{2}\), \begin {align*} E\left [T(n-T)\right ] &= nE(T) - E\left (T^{2}\right )\\ &= n^{2}\theta - n\theta (1-\theta ) - n^{2}\theta ^{2}\\ &= n^{2}\theta (1-\theta ) - n\theta (1-\theta ) = n(n-1)\,\theta (1-\theta ). \end {align*}
Dividing by the constant \(n(n-1)\), \[\widehat {\tau } = \frac {T(n-T)}{n(n-1)} = \frac {n}{n-1}\,\overline {X}\left (1-\overline {X}\right )\] is unbiased, and therefore is the UMVUE of \(\theta (1-\theta )\).
Note. The naive estimator \(\overline {X}\left (1-\overline {X}\right )\) is biased downwards by exactly the factor \((n-1)/n\). The correction is the same one that turns the sample variance into its unbiased form, and for the same reason: a product of an estimator with itself underestimates the product of the parameters, because it inherits the estimator’s own variability.
Problem 1.5.7. Let \(X_1, \, X_2, \, \cdots \, , \, X_n\) be a random sample from the \(EXP(1,\theta )\) distribution. Find the \(UMVUE\) of \(\tau (\theta ) = \theta ^2\).
Show solution
Solution. \(T=X_{(1)}\) is complete and sufficient for this model, as shown above. Its density is \(n\,e^{-n(t-\theta )}\) on \((\theta ,\infty )\), so \(T-\theta \) is exponential with rate \(n\) and \[E(T) = \theta + \frac {1}{n},\qquad \var (T) = \frac {1}{n^{2}},\qquad E\left (T^{2}\right ) = \frac {1}{n^{2}} + \left (\theta +\frac 1n\right )^{2} = \theta ^{2} + \frac {2\theta }{n} + \frac {2}{n^{2}} .\] Look for an unbiased estimator of the form \(g(T)=T^{2}+\alpha T+\beta \): \[E\left [g(T)\right ] = \theta ^{2} + \left (\frac {2}{n}+\alpha \right )\theta + \left (\frac {2}{n^{2}} + \frac {\alpha }{n} + \beta \right ).\] Matching \(\theta ^{2}\) requires the coefficient of \(\theta \) and the constant to vanish, giving \(\alpha =-2/n\) and then \(\beta =0\). Hence \[\widehat {\theta ^{2}} = X_{(1)}^{2} - \frac {2X_{(1)}}{n},\] and by Lehmann–Scheffé this is the UMVUE of \(\theta ^{2}\).
Remark. Note the estimator can be negative — it is negative whenever \(0<X_{(1)}<2/n\) — even though \(\theta ^{2}\geq 0\) always. This is not an error. Unbiasedness is a statement about an average over repeated samples and carries no promise that individual values land in the parameter space, and the UMVUE can be inadmissible for exactly this reason. Truncating at zero would reduce the mean square error while destroying unbiasedness.
1.5.4 The Lehmann–Scheffé Theorem
Theorem 1.5.12 (Lehmann–Scheffé). If \(T(X)\) is a complete sufficient statistic and \(U(X)\) is any unbiased estimator of \(\tau (\theta )\), then \(E(U\mid T)\) is the UMVUE of \(\tau (\theta )\).
Proof. By theorem 1.5.6, \(E(U\mid T)\) is a statistic, a function of \(T\), and unbiased for \(\tau (\theta )\). By theorem 1.5.9 it is the UMVUE. □
The method is most useful when \(\tau (\theta )\) is a probability. If \(\tau (\theta ) = P_\theta (X_1\in A)\), then the indicator \(U = I(X_1\in A)\) is unbiased, and the UMVUE is \(E(U\mid T) = P(X_1\in A\mid T)\), a conditional probability that does not involve \(\theta \). Examples 1.6.14 and 1.6.15 use this idea.
Questions on this section
Stuck on something here? Ask below and it stays attached to this topic.