| Display title | Lehmann–Scheffé theorem |
| Default sort key | Lehmann-Scheffe theorem |
| Page length (in bytes) | 6,005 |
| Namespace ID | 0 |
| Page ID | 206527 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>StanislovAI |
| Date of page creation | 00:10, 7 February 2024 |
| Latest editor | imported>StanislovAI |
| Date of latest edit | 00:10, 7 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In statistics, the Lehmann–Scheffé theorem is a prominent statement, tying together the ideas of completeness, sufficiency, uniqueness, and best unbiased estimation. The theorem states that any estimator that is unbiased for a given unknown quantity and that depends on the data only through a complete... |
