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.
Finite-Sample Point Estimation
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Sufficiency, Completeness and Exponential Families
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page defines bias, mean squared error and uniformly minimum-variance unbiased estimation, proves the bias–variance identity, and establishes the Rao–Blackwell and Lehmann–Scheffé theorems with finite-moment hypotheses. It keeps squared-error risk distinct from unbiasedness and states the common conditional-law, completeness and choice assumptions needed by the optimality results.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Integration against a Dirac measure evaluates at its point
Statement
Let be a sigma-algebra on a set , let , and let be the Dirac probability measure on . For every nonnegative -measurable ,
Facts & Assumptions
Given: A measurable space, a point in it, its Dirac measure, and a nonnegative measurable function .
if and otherwise, and this set function is a probability measure on . (The Dirac set function at a point, A Dirac set function is a probability measure)
A nonnegative simple function has a finite representation by disjoint measurable sets, and its simple integral is the sum of its values times the set measures. (Nonnegative simple measurable functions, The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions)
Every nonnegative measurable function is the pointwise increasing limit of nonnegative simple functions. (Every nonnegative measurable function is the increasing limit of simple measurable functions)
Increasing limits pass through the nonnegative Lebesgue integral. (Monotone convergence for the integral)
Proof
If is a nonnegative simple function with pairwise disjoint , then [F1] and [F2] give .
Choose the increasing simple approximation from [F3]. By [F4] and step 1.1, , including when the value is .
A statistic induces a deterministic probability kernel
Statement
Let be a measurable statistic, where is a sigma-algebra on the action set (Statistics and estimators). Then is a probability kernel and therefore a deterministic randomized procedure.
Facts & Assumptions
Given: A measurable statistic from the data measurable space to the action measurable space.
A statistic is a measurable map; hence for every . (Statistics and estimators)
For each point , the Dirac set function is a probability measure on . (The Dirac set function at a point, A Dirac set function is a probability measure)
A probability kernel has probability-measure sections and measurable event evaluations. (Measure kernel and probability kernel)
Proof
For each , the section is the probability measure by [F2].
For each , is -measurable by [F1]. Thus both clauses of the kernel definition [F3] hold, so is a probability kernel, hence a deterministic randomized procedure.
Bias and mean squared error
Definition
Let be a statistical experiment: a measurable data space, a parameter-label set, and a family of probability measures on the data space. Let be its real-valued target function (estimand). An estimator is a measurable statistic with the real Borel target (Statistics and estimators). At a parameter for which is integrable under , its bias is
Its mean squared error (MSE) is the extended nonnegative number This is the risk of the deterministic rule induced by under squared-error loss : its Dirac kernel is constructed in A statistic induces a deterministic probability kernel, and the risk supplier's integral formula reduces to the displayed expectation when the action is by Integration against a Dirac measure evaluates at its point (Loss functions and risk). For each fixed , this loss is Borel in the real action ; no measurable structure on or measurability of is required. The expectation convention is Expectation of a nonnegative or integrable random variable. If is square-integrable under , then its variance is defined by Moments, variance, and covariance on a probability space and this MSE is finite. Bias is not defined at parameters where is not integrable.
Bias–variance decomposition
Statement
In a statistical experiment, let and let be a real estimator with . For every ,
Facts & Assumptions
Given: A statistical experiment, a real estimand , and an estimator that is square-integrable under each parameter law considered.
Bias is and MSE is . (Bias and mean squared error)
For square-integrable real , . (Moments, variance, and covariance on a probability space)
The Lebesgue integral is linear on finite linear combinations of integrable functions. (The Lebesgue integral is linear on )
Cauchy–Schwarz gives for square-integrable . (Cauchy-Schwarz inequality for )
Proof
Fix . Since is a probability measure, the constant has norm . Applying [F4] to and gives . Put and . Then [F1] gives and .
Since by step 1.1 and , [F3] gives . For every finite , , so the centered square and squared error are integrable. Expanding now gives by [F1] and [F2].
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.
Rao–Blackwell theorem for scalar finite-variance estimators
Statement
Assume the Axiom of Choice as in the library conditional-expectation convention. Let have standard-Borel data space, let be standard Borel, and let be a sufficient statistic. Here sufficiency uses a supplied common kernel that is a regular conditional law of the data given under every and does not depend on (Sufficient statistics). For Borel , write for the pushforward law of . Let and let be a measurable real estimator with and for every .
There is a single Borel function , independent of , such that is a version of for every . It is unbiased, finite-variance, and For each , equality holds exactly when is -measurable -almost surely.
Facts & Assumptions
Given: A standard-Borel experiment and statistic space, a sufficient statistic with the supplied common regular conditional kernel described in the Statement, AC, and an unbiased estimator with finite second moment under every .
A finite-variance unbiased estimator is integrable, has expectation at every parameter, and has the variance convention stated in the UMVU definition. (Unbiased estimators and UMVU estimators)
Sufficiency supplies one probability kernel from the standard-Borel statistic space to the standard-Borel data space such that, for every parameter , data event , and statistic event , . The same kernel is fixed independently of . (Sufficient statistics)
For a probability kernel, integrating a nonnegative measurable function gives a measurable function of the input, with the corresponding iterated-integral identity. (A randomized procedure has a measurable action law)
Positive/negative parts, absolute values, and the finite piecewise combinations used to define preserve measurability. (Closure properties of measurable functions used by the integral)
Nonnegative measurable functions admit increasing simple approximations. (Every nonnegative measurable function is the increasing limit of simple measurable functions)
The RCD identity for indicators extends to nonnegative increasing limits by monotone convergence and finite linearity on . (Monotone convergence for the integral, The Lebesgue integral is linear on )
The nonnegative integral is monotone, so . (Monotonicity and nonnegative homogeneity of the nonnegative integral)
Every event in is for a Borel statistic-space event . (The sigma-algebra generated by a function)
A conditional-expectation version is measurable, integrable, and has the same event integrals on the conditioning sigma-algebra. (Conditional expectation given a sigma algebra)
Under AC, versions with the same event integrals determine one almost-sure class. (Conditional expectation as an ae class)
Conditional expectation maps into . (Conditional lp contraction)
Conditional expectation preserves ordinary expectation. (Basic algebra and order properties of conditional expectation)
Under AC, the conditional-expectation class of an input is its orthogonal projection onto the conditioning subspace. (Conditional expectation is the l2 orthogonal projection)
The Axiom of Choice is required by the cited conditional-expectation and projection interfaces. (The Axiom of Choice)
A nonnegative integrable function with zero integral is zero almost everywhere. (A nonnegative measurable function has integral exactly when it vanishes almost everywhere)
A randomized procedure is a parameter-independent probability kernel from an experiment's data space to its measurable action space. (Randomized procedures as probability kernels)
Proof
Write for the measurable function defining . For each , is a probability measure: preimages under the measurable map preserve the empty set, disjoint countable unions, and the whole space. By [L1], is a parameter-independent probability kernel from the statistic space to the data space, so it is a randomized procedure for the pushforward experiment by [F15]. Thus [F2] and [F3] show that , , and are Borel. Let where and elsewhere; [F6] makes both terms finite on this Borel set, and [F3] makes Borel.
Fix and a Borel statistic event . For nonnegative simple functions of the data, [L1] and finite linearity give . Approximate and increasingly by simple functions using [F4]; [F5] passes each equality to the limit. Applying the same identity to with gives . If had positive probability, then for every positive integer , so [F6] would give for all , a contradiction; thus almost surely. By [F6], , so and is integrable. The two finite event-integral identities may therefore be subtracted, giving . By [F7], [F8], and [F9], is a version of as an almost-sure class for every .
By [F10], is square-integrable under each . By [F11], ; hence it is an unbiased finite-variance estimator.
Fix . The residual is orthogonal in to every square-integrable -measurable function by [F12]. By step 3.1 and , is such a function. Expanding the centered square gives . The first term is nonnegative, proving the variance inequality.
By [F14], equality in step 4.1 holds exactly when -almost surely. Since is -measurable, this is precisely almost-sure -measurability: if has such a representative, its class lies in the projection subspace and [F12] fixes it.
Lehmann–Scheffé theorem
Statement
Assume AC as in the library conditional-expectation convention. Let be a statistical experiment with standard-Borel data space. Let be a statistic with standard-Borel target, sufficient under the common conditional-law interface of Sufficient statistics and complete under Complete statistics. Let be a real-valued estimand and let be Borel, with unbiased for and of finite variance under every . Then is the unique UMVU estimator of : for every finite-variance unbiased estimator , and any other UMVU estimator equals -almost surely for each .
Facts & Assumptions
Given: AC, a standard-Borel experiment, a complete sufficient statistic , and a finite-variance unbiased estimator of a real estimand .
UMVU compares the variances of unbiased finite-variance estimators at every parameter. (Unbiased estimators and UMVU estimators)
For any unbiased finite-variance estimator , Rao–Blackwellization by is an unbiased finite-variance function of , has no larger variance, and equality at holds exactly when is -measurable -almost surely. (Rao–Blackwell theorem for scalar finite-variance estimators)
Sufficiency supplies one probability kernel from the standard-Borel statistic space to the standard-Borel data space such that, for every parameter , data event , and statistic event , . The same kernel is fixed independently of . (Sufficient statistics)
Completeness says that for every measurable real-valued integrable under every , if for every , then -almost surely for every . (Complete statistics)
The conditional-expectation results used by Rao–Blackwell assume AC, which is stated in that theorem and carried here. (The Axiom of Choice)
An integrable -measurable function is its own conditional-expectation version given . An integrable function equal to it almost surely has the same conditional-expectation class, and versions determine one almost-sure class. (Conditional expectation given a sigma algebra, Conditional expectation as an ae class)
Proof
Let be any finite-variance unbiased estimator of . The sufficient-statistic hypothesis [L1] permits applying [F2]. Under the stated AC branch [F3], there is one Borel function , independent of , such that is a version of for every . Rao–Blackwell [F2] makes it unbiased and finite-variance and gives for every .
The difference is integrable, is a function of , and has expectation zero for every . Completeness [L2] therefore gives -almost surely for every . Substitution into step 1.1 proves for every , so is UMVU.
If is another UMVU estimator, applying steps 1.1 and 2.1 to gives its Rao–Blackwellized function almost surely for each . Since both and are UMVU, their variances agree at each . The equality condition in [F2] makes -measurable -almost surely; by [F4], such a representative is its own conditional expectation, so uniqueness gives almost surely.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Sheldon Axler, Measure, Integration & Real Analysis, Example 2.55
- Terence Tao, An Introduction to Measure Theory, Example 1.4.29
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §5.1, PDF pp. 100–102
- Peter Hoff, Statistical Decision Problems, §§2–4.2, PDF pp. 2–8
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, Chapter 5, PDF pp. 29–31
- Karl B. Gregory, STAT 713 Lecture 6: Best Unbiased Estimators, Rao-Blackwell Theorem, PDF pp. 2–8
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, Definition 5.2, PDF pp. 29–30
- Jun Shao, STAT 709 Lecture 15: UMVUE, PDF pp. 1–3
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, Theorem 6.1 and proof, PDF pp. 33–35
- Karl B. Gregory, STAT 713 Lecture 6: Best Unbiased Estimators, Rao-Blackwell Theorem, PDF pp. 9–11
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, Theorem 5.1 and proof, PDF pp. 102–103
- George Deligiannidis, SB2.1 Foundations of Statistical Inference, Theorem 6.5 and proof, PDF pp. 37–38
- Karl B. Gregory, STAT 713 Lecture 6: Best Unbiased Estimators, Rao-Blackwell Theorem, PDF pp. 15–16
- Jun Shao, STAT 709 Lecture 15: UMVUE, PDF pp. 1–4