How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Unbiased estimators and UMVU estimators
Definition
Let be an estimator of a real estimand in a statistical experiment. It is unbiased if it is integrable under every and Equivalently, its bias from Bias and mean squared error is zero at every parameter. It is a finite-variance unbiased estimator if it is unbiased and square-integrable under every .
A finite-variance unbiased estimator is uniformly minimum-variance unbiased (UMVU) for if, for every and every other finite-variance unbiased estimator of the same estimand, The same estimator must satisfy these inequalities throughout the parameter space; the definition asserts no existence of a UMVU estimator. Variance has the meaning in Moments, variance, and covariance on a probability space.
Depends on
Used by
- A biased estimator can have lower MSE Example
- A certainty unit and a census under Horvitz–Thompson estimation Example
- An unobserved unit prevents universal unbiased estimation Example
- Rao–Blackwellizing one Bernoulli observation by the sample sum Example
- The binomial sample proportion Example
- A zero inclusion probability prevents total identification and universal unbiased estimation Theorem
- Lehmann–Scheffé theorem Theorem
- Multivariate Cramér–Rao bound Theorem
- Rao–Blackwell theorem for scalar finite-variance estimators Theorem
- Scalar Cramér–Rao lower bound Theorem
- The Horvitz–Thompson total and mean are design-unbiased under positive inclusion probabilities Theorem
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, Definition 5.2, PDF pp. 29–30 (standard reference, not scraped)
- Jun Shao, STAT 709 Lecture 15: UMVUE, PDF pp. 1–3 (standard reference, not scraped)
- Karl B. Gregory, STAT 713 Lecture 6: Best Unbiased Estimators, Rao-Blackwell Theorem, PDF pp. 2–8 (standard reference, not scraped)