Lably
Skip to content

Lehmann–Scheffé theorem

Theorem in statistics

  • 5 min read
  • 4 chapters

Related on Lably

Through Statistics, Necessity and sufficiency and Loss function

Introduction

Given a vector X=(X1,X2,…,Xn) of random samples from a distribution Pθ for some parameter θ∈Θ, the goal is to establish sufficient conditions for the existence of an UMVU estimator T∗(X) for some quantity g(θ), that is, Eθ[T∗(X)]=g(θ) and for any unbiased estimator S(X) it holds

Varθ(T∗(X))≤Varθ(S(X)),∀θ∈Θ.

The Rao–Blackwell theorem already shows that, given a sufficient statistic T, the estimator T∗(X)=E[S(X)∣T(X)] has a uniformly smaller variance than S(X), but it does not guarantee that T∗ is already UMVU. This is where the Lehmann–Scheffé theorem comes in, if T is also complete, that is, for any real-valued measurable function φ it holds

Eθ[φ(T(X))]=0⟹φ(T(X))=0Pθ-a.s.

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Statistics