Math 2.0

Statistics Sufficiency and information Theorem

Lehmann–Scheffé theorem

Builds on Parametric modelSufficient statisticComplete statisticBias of an estimatorVarianceMinimum-variance unbiased estimatorRao–Blackwell theorem

Statement

Let {Pθ:θ∈Θ}\set{P_\theta : \theta \in \Theta} be a parametric model for an observation XX, and let g ⁣:Θ→ℝg \colon \Theta \to \R. Let T=T(X)T = T(X) be a sufficient statistic that is complete. Let hh be a measurable function such that h(T)h(T) is unbiased for g(θ)g(\theta) and Var⁡θ(h(T))<∞\operatorname{Var}_\theta(h(T)) < \infty for every θ∈Θ\theta \in \Theta. Then h(T)h(T) is a uniformly minimum-variance unbiased estimator of g(θ)g(\theta): for every unbiased estimator δ\delta of g(θ)g(\theta) and every θ∈Θ\theta \in \Theta, Var⁡θ(h(T))≤Var⁡θ(δ).\operatorname{Var}_\theta(h(T)) \le \operatorname{Var}_\theta(\delta). Moreover, h(T)h(T) is the only such estimator, up to equality with PθP_\theta-probability 11 for every θ\theta.

Remarks

Completeness gives uniqueness: if h1(T)h_1(T) and h2(T)h_2(T) are both unbiased for g(θ)g(\theta), then Eθ[h1(T)−h2(T)]=0E_\theta[h_1(T) - h_2(T)] = 0 for all θ\theta, so h1(T)=h2(T)h_1(T) = h_2(T) almost surely. Given any unbiased δ\delta with finite variance, the Rao–Blackwell theorem gives the unbiased estimator E[δ∣T]E[\delta \mid T], a function of TT, with variance at most Var⁡θ(δ)\operatorname{Var}_\theta(\delta). By uniqueness this function is h(T)h(T), which proves the claim.

Example: let X1,…,XnX_1, \dots, X_n be independent Poisson variables with mean λ>0\lambda > 0. The sum T=X1+⋯+XnT = X_1 + \cdots + X_n is complete and sufficient, and T/nT/n is unbiased for λ\lambda. So the sample mean is the unique minimum-variance unbiased estimator of λ\lambda.

Completeness cannot be dropped from the uniqueness argument. If TT is not complete, two different functions of TT can be unbiased for the same g(θ)g(\theta). Then the Rao–Blackwell step alone does not single out a best one.

Going deeper

For a student

This is the standard route to minimum-variance unbiased estimators. First find a complete sufficient statistic, often the natural statistic of an exponential family of full rank. Then find any function of it that is unbiased, for example by solving Eθ[h(T)]=g(θ)E_\theta[h(T)] = g(\theta) or by Rao–Blackwellizing a simple unbiased estimator. The theorem then certifies optimality without comparing with other estimators one by one.

Reading path

To understand this page from the ground up, read these 11 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Bias of an estimator concept
  2. Complete statistic concept
  3. Conditional expectation concept
  4. Estimator concept
  5. Mean squared error concept
  6. Minimum-variance unbiased estimator concept
  7. Parametric model concept
  8. Sufficient statistic concept
  9. Variance concept
  10. Rao–Blackwell theorem statement
  11. Lehmann–Scheffé theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Lehmann–Scheffé_theorem
About this page
TagQQZPWDWS29
URIm2://QQZPWDWS29
Kindstatement, theorem
WritingW0 stub
MSC62F10, 62B05
StatusThis copy of the site has no build data. Run m2 status QQZPWDWS29.
AboutMinimum-variance unbiased estimator, Complete statistic
UsesParametric model, Sufficient statistic, Complete statistic, Bias of an estimator, Variance, Minimum-variance unbiased estimator, Rao–Blackwell theorem
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.