Alphabeta Math
Pipeline-generated
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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Statistical Experiments, Models and Identifiability

1 · Prerequisites

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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Statistical experiments

Definition

An experiment is a measurable space (X,A), a set Θ of parameter labels, and a family (Pθ)θ∈Θ of probability measures on (X,A) (Measurable spaces and measurable sets, Probability measures and probability spaces). The measures Pθ are the sampling laws. If data under a parameter value are realized as a random element, its law is the pushforward measure PX(B)=P(X−1(B)) 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 θ↦Pθ, and no common underlying probability space on which all observations must be realized.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Parametric statistical models

Definition

For an experiment on (X,A), let P(X,A) denote the set of all probability measures on that measurable space. Its parametric statistical model is the parameter map

P:Θ→P(X,A),P(θ)=Pθ,

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 P is asserted.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Parameter-measurable statistical models as kernels

Definition

Suppose an experiment on (X,A) also has a measurable parameter space (Θ,T) (Measurable spaces and measurable sets). A Markov kernel (or probability kernel) representation is a function

K:Θ×A→[0,1]

such that, for every θ∈Θ, the set function A↦K(θ,A) is a probability measure on (X,A), and, for every A∈A and every Borel set C⊆[0,1],

{θ∈Θ:K(θ,A)∈C}∈T.

Here the Borel sigma-algebra on [0,1] is generated by its relatively open subsets U∩[0,1], where U is open in R. Thus the second condition says that each event-probability map θ↦K(θ,A) is measurable. The kernel represents the given experiment exactly when K(θ,A)=Pθ(A) for every θ and A (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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Observational equivalence

Definition

In a parametric model P:Θ→P(X,A), two parameter values θ,η∈Θ are observationally equivalent, written θ∼η, if and only if

Pθ=Pη,

that is, Pθ(A)=Pη(A) for every A∈A (Parametric statistical models). Equivalent parameter values therefore give exactly the same sampling law. No distinctness of θ and η is required.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Estimands on a statistical model

Definition

For a parametric model with parameter set Θ, an estimand or parameter target is a specified function

ψ:Θ→T0,

where T0 is a set of target values (Parametric statistical models). This definition imposes no measurable structure on Θ or T0 and does not require ψ to determine the full parameter value.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Identifiability of an estimand

Definition

An estimand ψ:Θ→T0 is identifiable in a parametric model P when

Pθ=Pη⟹ψ(θ)=ψ(η)(θ,η∈Θ),

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 id⁡Θ:Θ→Θ is identifiable, equivalently when P is injective.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Identifiability is constancy on observational classes

Statement

Let P:Θ→P(X,A) be a parametric model, let ψ:Θ→T0 be an estimand, and set M:=P(Θ), 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 ψˉ:M→T0 such that ψ=ψˉ∘P.

The factorization is a statement about sets and functions. It asserts no measurable structure or measurable factor map.

Facts & Assumptions

Given: A parametric model P:Θ→P(X,A) and an estimand ψ:Θ→T0.

[F1]

Parametric statistical models: the model is the parameter map P:Θ→P(X,A), and its set of laws is M=P(Θ).

[F2]

Observational equivalence: θ∼η exactly when Pθ=Pη as measures.

[F3]

Estimands on a statistical model: an estimand is a function ψ:Θ→T0.

[F4]

Identifiability of an estimand: ψ is identifiable exactly when θ∼η implies ψ(θ)=ψ(η).

Proof

technique · Direct equivalence and factorization through the image of the model map
1.1givenF2algebra

Equality of measures is reflexive, symmetric and transitive; by [F2], ∼ is therefore an equivalence relation, so each class [θ]∼ is defined.

1.2givenF1F2F4algebra

If ψ=ψˉ∘P, then Pθ=Pη gives ψˉ(Pθ)=ψˉ(Pη) and hence ψ(θ)=ψ(η). Thus (iii) implies identifiability.

1.3givenF1F2F3F4construct

Suppose ψ is identifiable. Form the relation G:={(Q,a):there exists θ∈Θ with Q=Pθ and a=ψ(θ)}. Every Q∈M has at least one such parameter by [F1]. If both θ and η represent the same Q, then [F2] gives θ∼η, so [F4] gives ψ(θ)=ψ(η). Thus G has exactly one value for each Q∈M, defines a function ψˉ:M→T0 by [F3], and satisfies ψ=ψˉ∘P. This construction defines the graph directly and uses no choice axiom.

2.1F2F4step 1.1algebra

By [F2], η∈[θ]∼ exactly when η∼θ. If a,b∈[θ]∼, then a∼θ and b∼θ, so symmetry and transitivity from step 1.1 give a∼b; conversely, θ∼η gives η∈[θ]∼. Hence [F4] is exactly constancy of ψ on every class.

3.1givenF1F3step 1.2step 1.3step 2.1algebra∎

If ψˉ1 and ψˉ2 both factor ψ, each Q∈M equals Pθ for some θ by [F1], and then ψˉ1(Q)=ψ(θ)=ψˉ2(Q) 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