Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Lehmann–Scheffé theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Theorem in statistics}} {{Refimprove|date=April 2011}} In [[statistics]], the '''Lehmann–Scheffé theorem''' is a prominent statement, tying together the ideas of completeness, sufficiency, uniqueness, and best unbiased estimation.<ref name=Casella/> The theorem states that any [[estimator]] that is [[unbiased estimator|unbiased]] for a given unknown quantity and that depends on the data only through a [[completeness (statistics)|complete]], [[sufficiency (statistics)|sufficient statistic]] is the unique [[best unbiased estimator]] of that quantity. The Lehmann–Scheffé theorem is named after [[Erich Leo Lehmann]] and [[Henry Scheffé]], given their two early papers.<ref name=LS1/><ref name=LS2/> If <math> T </math> is a complete sufficient statistic for <math> \theta </math> and <math>\operatorname{E}[g(T)]=\tau(\theta) </math> then <math>g(T)</math> is the [[uniformly minimum-variance unbiased estimator]] (UMVUE) of <math>\tau(\theta)</math>.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)