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.
Estimators and Randomized Procedures
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
Statistics and estimators are measurable maps from observed data to named target spaces. A randomized procedure assigns a probability distribution on actions to each data value, with measurability required for every action event. A binary action space gives a randomized test, whose test function is the conditional rejection probability. The action-law lemma proves that integrating a procedure against each sampling law yields a probability distribution on actions and that nonnegative action functionals are measurable before that integration.
The definitions impose no measurable structure on the parameter set. A kernel itself specifies a randomized procedure; no representation by an auxiliary random seed is assumed for arbitrary measurable action spaces. Deterministic procedures arise when each action distribution is concentrated at one value.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Randomized procedures as probability kernels
Definition
Let be a statistical experiment (Statistical experiments) and let be a measurable action space: a set of available actions equipped with a sigma-algebra of action events, hence a measurable space (Measurable spaces and measurable sets). A randomized procedure (or randomized decision rule) is a probability kernel from to , in the pointwise sense of Measure kernel and probability kernel. Thus is a probability measure on for every , and is -measurable for every . After observing , the procedure assigns probability to taking an action in . The kernel is specified without reference to the unknown parameter. This definition imposes no measurable structure on . The kernel is the specification of the procedure; no representation by a separate random seed is asserted for arbitrary measurable action spaces.
A randomized procedure has a measurable action law
Statement
Let be a randomized procedure for the experiment with action space . Give its Borel sigma-algebra. For every nonnegative - measurable function , the function is -measurable. In particular, is measurable for every action event . For each , the set function is a probability measure on , and for every such , with nonnegative extended values allowed.
Facts & Assumptions
Given: The experiment and randomized procedure in the statement, and a nonnegative measurable function on the action space.
For each , is a probability measure on (Statistical experiments).
For every , is a probability measure, and for every , is measurable (Measure kernel and probability kernel).
The expectation of a nonnegative measurable function under is its extended nonnegative integral (Expectation of a nonnegative or integrable random variable).
A nonnegative simple measurable function has finite range and a finite sum representation using disjoint measurable sets (Nonnegative simple measurable functions).
The simple integral of is (The integral of a nonnegative simple function).
The nonnegative integral agrees with the simple integral on nonnegative simple functions (The nonnegative integral agrees with the simple integral on simple functions).
The nonnegative integral is additive on finite sums of nonnegative measurable functions (Additivity of the nonnegative Lebesgue integral).
The nonnegative integral is monotone and homogeneous under positive scalar multiplication; the zero function has integral zero. No product is formed (Monotonicity and nonnegative homogeneity of the nonnegative integral).
Nonnegative measurable functions admit increasing simple approximations (Every nonnegative measurable function is the increasing limit of simple measurable functions).
Increasing pointwise limits pass through nonnegative integrals (Monotone convergence for the integral).
The nonnegative extended sum is the supremum of its finite partial sums (Series in the nonnegative extended real line).
A measure is countably additive and assigns zero to the empty set; a probability measure also assigns mass one to the whole space (Measures on sigma-algebras, Probability measures and probability spaces).
Finite sums of nonnegative measurable functions are measurable. Nonnegative scalar multiples of real-valued measurable functions are measurable, and increasing pointwise limits of nonnegative measurable functions are measurable, including extended-valued limits (Closure properties of measurable functions used by the integral).
Proof
Fix . For each , the function is measurable and lies in by [F2]. Thus its integral is finite and at most by [F1], [F3], [F8], and [F12]. Since and , the simple-integral formula and agreement [F5, F6] give and .
By [F9], choose nonnegative simple functions . Fix and write with finite , , and pairwise disjoint , as in [F4]. The simple-integral formula and agreement [F5, F6] give . Each summand is measurable by [F2], and finite sums and nonnegative scalar multiples are measurable by [F13]. For every , monotone convergence under the probability measure gives . Thus is measurable by the increasing-limit clause of [F13].
If are pairwise disjoint members of , then for every , , where , by countable additivity of . Each is measurable by [F2] and finite-sum closure [F13], and increases. Monotone convergence [F10] and finite additivity of the nonnegative integral [F7] give , where the last expression is the nonnegative extended sum [F11]. Together with step 1.1 and [F12], this proves that is a probability measure.
For an indicator , [F5] and [F6] give and , so the defining equation for proves the iterated-integral identity. Finite addition [F7] and nonnegative homogeneity [F8] extend this equality from indicators to every nonnegative simple .
The increasing simple sequence from step 1.2 satisfies and . By step 1.2 all and are measurable; by step 2.1, is a probability measure. Applying monotone convergence [F10] under and under to the simple identities of step 3.1 proves the asserted equality, including when its value is .
Statistics and estimators
Definition
Let be an experiment (Statistical experiments). A statistic with target measurable space is a measurable map , where measurability means that for every (A measurable function between measurable spaces). If is an estimand (Estimands on a statistical model) and its target set is equipped with , a statistic with this same target space is an estimator of . The value is the estimate at observed data . Giving a measurable structure is an additional choice; this definition does not assert that is measurable as a function of the parameter.
Randomized tests
Definition
A randomized test is a randomized procedure with binary action space whose action set is , equipped with its full sigma-algebra (the power set, which is a sigma-algebra by Sigma-algebras), where means reject and means do not reject (Randomized procedures as probability kernels). Its test function is Since is a probability measure and partition the action set, . Thus and is the probability of not rejecting. Give the trace of the Borel sigma-algebra on , namely . By A randomized procedure has a measurable action law, is measurable; since it has range in , its preimage of equals its preimage of and is measurable for every such . Hence is a measurable map in the preimage sense of A measurable function between measurable spaces. Its value is the rejection probability after observing . The convention is fixed here. No null or alternative hypothesis is part of this definition.
5 · Examples, counterexamples and false statements
None yet.
Sources
- 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
- Peter Kempthorne, MIT 18.655 Lecture Note 6: Sufficiency, PDF pp. 14–15
- Peter Hoff, Statistical Decision Problems, §2, PDF pp. 2–3
- Peter Hoff, Statistical Decision Problems, §3, PDF pp. 4–5