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.
Statistical Experiments, Models and Identifiability
1 · Prerequisites
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Foundations of the Real Numbers for Analysis
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Order, Zorn's Lemma, and the Axiom of Choice
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
2 · Summary
An experiment specifies a measurable observation space and a probability law for each parameter value. The parameter labels need not carry a measurable structure, and a model need not be injective: distinct labels may produce the same sampling law. A separate kernel definition records the additional eventwise measurability required when the parameter space is measurable.
Observational equivalence groups parameter values that induce the same law. An estimand is identifiable exactly when it is constant on each such group; equivalently, it is a unique function of the sampling law. This is a set-theoretic statement and assumes no topology or parameter measurability.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Statistical experiments
Definition
An experiment is a measurable space , a set of parameter labels, and a family of probability measures on (Measurable spaces and measurable sets, Probability measures and probability spaces). The measures are the sampling laws. If data under a parameter value are realized as a random element, its law is the pushforward measure from Law or distribution of a random element; it is a probability measure by The law of a random element is a probability measure.
The definition specifies the family of laws only. It supplies no sigma-algebra on , no measurability condition on , and no common underlying probability space on which all observations must be realized.
Parametric statistical models
Definition
For an experiment on , let denote the set of all probability measures on that measurable space. Its parametric statistical model is the parameter map
regarded together with its parameter set and sample space (Statistical experiments). The map need not be injective. Unless a measurable structure on is supplied separately, no measurability of is asserted.
Parameter-measurable statistical models as kernels
Definition
Suppose an experiment on also has a measurable parameter space (Measurable spaces and measurable sets). A Markov kernel (or probability kernel) representation is a function
such that, for every , the set function is a probability measure on , and, for every and every Borel set ,
Here the Borel sigma-algebra on is generated by its relatively open subsets , where is open in . Thus the second condition says that each event-probability map is measurable. The kernel represents the given experiment exactly when for every and (Statistical experiments, Probability measures and probability spaces).
This is an optional parameter-measurable version of a model. An arbitrary experiment does not include a measurable structure on or imply this kernel condition.
Observational equivalence
Definition
In a parametric model , two parameter values are observationally equivalent, written , if and only if
that is, for every (Parametric statistical models). Equivalent parameter values therefore give exactly the same sampling law. No distinctness of and is required.
Estimands on a statistical model
Definition
For a parametric model with parameter set , an estimand or parameter target is a specified function
where is a set of target values (Parametric statistical models). This definition imposes no measurable structure on or and does not require to determine the full parameter value.
Identifiability of an estimand
Definition
An estimand is identifiable in a parametric model when
or equivalently when is constant on each set of parameter values with the same sampling law (Parametric statistical models, Observational equivalence, Estimands on a statistical model). The model is identifiable when its identity target is identifiable, equivalently when is injective.
Identifiability is constancy on observational classes
Statement
Let be a parametric model, let be an estimand, and set , the set of laws in the model. For , write
Then the following are equivalent: (i) is identifiable; (ii) is constant on every observational equivalence class ; and (iii) there is a unique function such that .
The factorization is a statement about sets and functions. It asserts no measurable structure or measurable factor map.
Facts & Assumptions
Given: A parametric model and an estimand .
Parametric statistical models: the model is the parameter map , and its set of laws is .
Observational equivalence: exactly when as measures.
Estimands on a statistical model: an estimand is a function .
Identifiability of an estimand: is identifiable exactly when implies .
Proof
Equality of measures is reflexive, symmetric and transitive; by [F2], is therefore an equivalence relation, so each class is defined.
If , then gives and hence . Thus (iii) implies identifiability.
Suppose is identifiable. Form the relation . Every has at least one such parameter by [F1]. If both and represent the same , then [F2] gives , so [F4] gives . Thus has exactly one value for each , defines a function by [F3], and satisfies . This construction defines the graph directly and uses no choice axiom.
By [F2], exactly when . If , then and , so symmetry and transitivity from step 1.1 give ; conversely, gives . Hence [F4] is exactly constancy of on every class.
If and both factor , each equals for some by [F1], and then by [F3]. The factor is unique. The implication in step 1.2 and the construction in step 1.3 give (i) iff (iii), while step 2.1 gives (i) iff (ii).
5 · Examples, counterexamples and false statements
None yet.
Sources
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §§1.3.6 and 1.4.1, PDF pp. 20–23
- Charles J. Geyer, Stat 5421 Lecture Notes: Exponential Families, §6, PDF pp. 6–7
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §§1.3.6, 1.4.1 and 5.1, PDF pp. 20–23 and 100–102
- Botond Szabó and Aad van der Vaart, Bayesian Statistics, lecture notes, §1.1, Definition 1.1 and the statistical-model kernel conditions following it
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §1.4.1, PDF pp. 22–23
- Peter Hoff, Statistical Decision Problems, pp. 1–2
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §§1.3.5–1.3.6, PDF pp. 19–21