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.

✓ 9 results · all verified · 8 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Sufficiency, Completeness and Exponential Families

1 · Prerequisites

2 · Summary

This page develops sufficiency through parameter-independent conditional laws and likelihood factorization, then treats minimal sufficiency, complete statistics, exponential families, and Basu’s theorem. The reference-measure criterion is stated with an in-model reference law; an arbitrary external dominator does not preserve a statistic’s conditional law. The proofs identify the exact countability, standard Borel, domination, and open natural-parameter assumptions needed in each result.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Uniqueness of a multivariate exponential transform

Statement

Assume AC and let k≥0. Let ν be a finite complex Borel measure on Rk. Suppose there is δ>0 such that ∫eδ∥x∥1 ∣ν∣(dx)<∞. If the Laplace transform L(z)=∫ez⋅x ν(dx) is zero for every real z in an open neighborhood of 0, then ν=0.

Facts & Assumptions

Given: AC and a finite complex Borel measure with the stated exponential moment and vanishing Laplace transform.

[A1]

The Axiom of Choice: the cited Fourier uniqueness theorem uses the library's stated choice assumptions; no parameter-dependent selections are made here.

[F2]

Integration against a signed or complex measure, and the class L^1(nu) = L^1(|nu|) and Integrals against signed or complex measures are bounded by total variation: complex integration is defined for L1(∣ν∣) functions and satisfies ∣∫f dν∣≤∫∣f∣ d∣ν∣.

[F3]

Dominated convergence: dominated convergence for complex-valued functions holds with respect to the positive measure ∣ν∣.

[F4]

Identity theorem for holomorphic functions: a holomorphic function on a connected open strip that vanishes on a set with an interior accumulation point vanishes throughout that strip.

[F5]

Uniqueness of finite Borel measures from their Fourier transforms: for dimension at least one, a finite complex Borel measure whose Fourier transform vanishes everywhere is zero.

Proof

1.1F1F2F3givenalgebra

If k=0, then R0 is a singleton and the open neighborhood in the hypothesis contains its only point; L(0)=ν(R0)=0, so ν=0. If k≥1, set D={z∈Ck:∣Re⁡zj∣<δ/2 for all j}. Fix z∈D and a coordinate j. Choose a neighborhood of z on which every real coordinate has absolute value at most 3δ/4. The moment assumption makes eδ∥x∥1 integrable with respect to the positive measure [F1], and all integrands below belong to L1(∣ν∣) by [F2]. On this neighborhood, ∣ez⋅x∣≤e(3δ/4)∥x∥1, while for small complex h the jth difference quotient is bounded by ∣xj∣e(3δ/4)∥x∥1≤Ceδ∥x∥1. For every sequence h→0, [F3] gives convergence of the difference quotients in L1(∣ν∣) to xjez⋅x; the bound in [F2] transfers this convergence to their integrals against ν. Thus L is complex differentiable in coordinate j at z, and, since z and j were arbitrary, L is holomorphic in each coordinate on D.

2.1F4step 1.1giveninduction

Assume k≥1. The real neighborhood contains a product of real intervals around zero. Fix real values of coordinates 2,…,k in those intervals. As a function of z1, L is holomorphic on the connected strip and vanishes on a real interval; [F4] makes it zero for every z1 in that strip. Now fix such a complex z1 and real coordinates 3,…,k in their intervals and apply [F4] to coordinate z2. Repeating this finite process for coordinates 1 through k proves L(z)=0 for every z∈D.

3.1A1F5step 2.1given∎

For k≥1 and each ξ∈Rk, the library Fourier transform is ν^(ξ)=∫e−2πiξ⋅xν(dx)=L(−2πiξ)=0, since −2πiξ∈D. The Fourier uniqueness result [F5] then gives ν=0.

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

Likelihood-ratio equivalence on common discrete support

Definition

Let X be countable with its full σ-field, so it is standard Borel under the discrete metric. Let Θ≠∅, and let (Pθ)θ∈Θ be dominated by a fixed σ-finite positive measure μ. Choose the finite-valued densities pθ=dPθ/dμ as in Likelihood densities. Let X0⊆X satisfy Pθ(X0)=1 and Pθ({x})>0 for every x∈X0 and every θ. Write mθ(x)=Pθ({x}). For each x∈X0, 0<μ({x})<∞ and pθ(x)=mθ(x)/μ({x}): positivity follows from mθ(x)>0, finiteness from sigma-finiteness, and the value is fixed by the density integral on the positive-measure singleton. Consequently

pθ(x)pθ(y)=mθ(x)mθ(y)μ({y})μ({x}).

For x,y∈X0, define x∼y if there is a constant c(x,y)>0 such that mθ(x)/mθ(y)=c(x,y) for every θ. The displayed fixed singleton factor shows this is equivalent to constancy of the common-reference density ratio. This is an equivalence relation: the constants for (x,x), (y,x) and (x,z) are respectively 1, c(x,y)−1 and c(x,y)c(y,z). Its equivalence classes form a countable quotient. Equip that quotient with its discrete σ-field; it is standard Borel because the discrete metric is complete and the countable space itself is dense. Since Θ≠∅ and Pθ(X0)=1, X0 is nonempty; define the class statistic by mapping each point of X0 to its class and every point off X0 to any fixed class. It is measurable because X has the full σ-field, and values off X0 are null under every law.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A countable mixture dominates a sigma-finite dominated family

Statement

Assume AC. Let (Pθ)θ∈Θ be a nonempty family of probability measures dominated by a σ-finite positive measure μ on (X,A). There are a finite or countable sequence (θj) from Θ and weights wj>0 summing to one such that Q=∑jwjPθj satisfies Pθ≪Q for every θ. Repetitions are permitted if Θ is finite.

Facts & Assumptions

Given: AC, a nonempty dominated family, and a sigma-finite dominating measure.

[A1]

The Axiom of Choice: AC selects RN versions for the possibly uncountable family and countably many finite-subfamily approximations to a supremum.

[F1]

Dominated statistical experiments: every Pθ is absolutely continuous with respect to the supplied sigma-finite μ.

[F2]

Finite, sigma-finite, and semifinite measures: μ has a countable cover by measurable sets of finite measure.

[F3]

Likelihood densities and A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: each Pθ≪λ has a nonnegative density pθ with Pθ(A)=∫Apθdλ.

[F4]

Monotone convergence for the integral: increasing nonnegative functions, including indicators and partial sums of densities, pass to their integrals.

Proof

1.1A1F1F2givenconstruct

Choose a countable measurable partition (En)n≥0 of X with μ(En)<∞ by disjointifying a sigma-finite cover [F2]. Put cn=2−(n+1)/(1+μ(En)) and λ(A)=∑n≥0cnμ(A∩En). For disjoint measurable Am, countable additivity of μ and interchange of nonnegative double series give λ(⋃mAm)=∑ncn∑mμ(Am∩En)=∑mλ(Am); the interchange is valid because both sides are the supremum of the same finite subsums. Thus λ is a measure. Also λ(X)≤∑n≥02−(n+1)=1. Since every cn>0, λ(A)=0 iff every μ(A∩En)=0, iff μ(A)=0. Thus λ is finite and equivalent to μ, so every Pθ≪λ.

2.1A1F3F4step 1.1givenchoose

For each θ, choose the RN density pθ=dPθ/dλ from [F3], finite outside a λ-null set, and let Aθ={pθ>0}. Fix θ∗; since ∫pθ∗ dλ=1, λ(Aθ∗)>0. Define s=sup⁡F⊆Θ, F finiteλ(⋃θ∈FAθ), so 0<s≤λ(X)<∞. By [A1], choose finite Fn for each n≥0 with union measure greater than s−1/(n+1). For all sufficiently large n, these unions have positive measure, so the selected index set ⋃nFn is nonempty. Set A=⋃n⋃θ∈FnAθ. Finite unions from the selected sets have measure at most s, so [F4] applied to their indicators gives λ(A)≤s by continuity from below; the approximations give λ(A)≥s. Hence λ(A)=s.

3.1F4step 2.1givencontradiction

Fix θ. If λ(Aθ∖A)>0, the increasing finite unions (⋃n≤N⋃ϕ∈FnAϕ)∪Aθ converge to A∪Aθ, whose measure is greater than s. [F4] applied to their indicators shows that some finite union then exceeds s, contradicting its definition. Therefore pθ=0 λ-almost everywhere on Ac.

4.1A1F3F4step 2.1step 3.1givenconstruct∎

Enumerate the nonempty countable collection of selected indices ⋃nFn as (θj), allowing repetitions if needed, and choose positive weights summing to one. The mixture Q=∑jwjPθj has density q=∑jwjpθj by [F4], so q>0 exactly on A up to a λ-null set. If Q(C)=0, then ∫Cq dλ=0. For each m≥1, λ(C∩A∩{q≥1/m})/m≤∫Cq dλ=0; these sets cover C∩A up to the null set where q is not positive on A. Hence λ(C∩A)=0. Also every pθ vanishes on Ac by step 3.1, so Pθ(C)=∫Cpθdλ=0. Since θ was arbitrary, Pθ≪Q for all θ.

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

Ancillary statistics

Definition

A statistic U:(X,A)→(Z,C) is ancillary for (Pθ) if its pushforward probability Pθ∘U−1 does not depend on θ. Equivalently, for every C∈C, Pθ(U∈C) is constant in θ.

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

Complete statistics

Definition

A statistic T:(X,A)→(Y,B) is complete for (Pθ)θ∈Θ if, for every measurable real-valued g such that Eθ∣g(T)∣<∞ for every θ, the conditions Eθ[g(T)]=0 for every θ imply Pθ(g(T)=0)=1 for every θ. Integrability is part of the premise; completeness is a property of the statistic relative to the specified family.

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

Exponential families and full rank

Definition

Let (X,A) be standard Borel, let μ be a σ-finite positive measure, let h:X→[0,∞) be measurable, and let T:X→Rk be a measurable statistic. For η∈Rk put

Z(η)=∫h(x)eη⋅T(x) μ(dx),H={η:0<Z(η)<∞},A(η)=log⁡Z(η).

For a parameter set Ω⊆H, the associated exponential family has laws Pη with density

pη(x)=h(x)exp⁡{η⋅T(x)−A(η)}(η∈Ω).

The normalization A(η)=log⁡Z(η) makes each density integrate to one. In this item full-rank means that Ω contains a nonempty open subset of Rk and there do not exist b≠0 and c∈R with b⋅T=c μ-almost everywhere on {h>0}. A parameter set containing an open subset is also called regular in some sources; terminology varies, so this definition controls here. The condition is stronger than needed for the completeness theorem below but rules out redundant displayed coordinates.

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

Sufficient statistics

Definition

Let ((X,A),Θ,(Pθ)) be a statistical experiment, where (X,A) is standard Borel, and let T:(X,A)→(Y,B) be a statistic with standard Borel target. Write PθT=Pθ∘T−1. The statistic T is sufficient if there is one probability kernel K from (Y,B) to (X,A) such that, for every θ∈Θ, A∈A, and C∈B,

Pθ(A∩T−1(C))=∫CK(y,A) PθT(dy).

Thus K(T(x),A) is a common version of the conditional probability of A given T, under every parameter. The kernel is fixed independently of θ. Under AC, standard Borelness gives each law an individual conditional law through Existence of regular conditional distributions for standard borel targets and Regular conditional kernels factor through a standard borel conditioning variable; sufficiency additionally asks that one kernel works across parameters.

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

Minimal sufficient sigma-fields

Definition

For a family (Pθ)θ∈Θ on (X,A), a sub-σ-field G⊆A is sufficient if for every bounded measurable u:X→R there is one G-measurable bounded function vu such that

∫Au dPθ=∫Avu dPθ(A∈G, θ∈Θ).

For each θ, this says that vu is a version of Eθ[u∣G], with the same pointwise version used for every parameter. Define the family-null ideal N={N∈A:Pθ(N)=0 for every θ}. We say G⊆H(modN) if for every A∈G there is B∈H with A△B∈N. A sufficient σ-field G∗ is minimal sufficient if G∗⊆H(modN) for every sufficient H.

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

Basu’s independence theorem

Statement

Let (X,A) be standard Borel, and let T and U be statistics from this sample space into standard Borel spaces for a family (Pθ). If T is complete and sufficient and U is ancillary, then T and U are independent under every Pθ.

Facts & Assumptions

Given: the family on a standard Borel sample space, complete sufficient T, ancillary U, and their standard Borel target spaces.

[F1]

Sufficient statistics: one kernel K gives the conditional law of the data given T for every parameter.

[F2]

Complete statistics: an integrable function of T with zero expectation for every parameter vanishes almost surely under every law.

[F3]

Ancillary statistics: the law of U is parameter-independent.

[F4]

Measure kernel and probability kernel: y↦K(y,A) is measurable and K(y,⋅) is a probability measure.

Proof

1.1F1F4givenconstruct

Fix a Borel set C in the target of U. The function qC(y)=K(y,U−1(C)) is Borel by [F4]. For every θ, the conditional-law identity [F1] shows qC(T) is a version of Pθ(U∈C∣T).

2.1F2F3step 1.1givenalgebra

By ancillarity [F3], pC=Pθ(U∈C) is constant in θ. Hence the bounded function gC(y)=qC(y)−pC satisfies EθgC(T)=0 for every θ. Completeness [F2] implies qC(T)=pC Pθ-almost surely for each θ.

3.1F1F3step 2.1givenalgebra∎

For any Borel D in the target of T, Pθ(T∈D,U∈C)=Eθ[1{T∈D}qC(T)]=pCPθ(T∈D)=Pθ(U∈C)Pθ(T∈D). This holds for every pair of Borel sets D,C, which is the definition of independence.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Common-reference factorization criterion for sufficiency

Statement

Let (X,A) and (Y,B) be standard Borel, let Θ≠∅, and let T:X→Y be a statistic. Fix θ0∈Θ and set P0=Pθ0. Assume Pθ≪P0 for every θ. Then T is sufficient if and only if for every θ the Radon–Nikodym derivative dPθ/dP0 has a σ(T)-measurable version. Equivalently, for each θ there is a Borel gθ:Y→[0,∞) with dPθ/dP0=gθ(T) P0-almost surely. The null exceptional set may depend on θ. The requirement P0∈{Pθ} is essential; an arbitrary external dominating probability is not covered.

Facts & Assumptions

Given: the standard Borel spaces, T, the model, the in-model reference P0, and absolute continuity.

[A1]

The Axiom of Choice: the Radon–Nikodym theorem is used under AC.

[F1]

Sufficient statistics: sufficiency is the existence of one conditional distribution kernel common to all model laws.

[F8]

Statistics and estimators: T is a measurable data map, so its generated sigma-field and inverse images are measurable.

[F2]

Measure kernel and probability kernel: kernel evaluations are measurable, and each fixed conditioning value gives a probability measure.

[F3]

Existence of regular conditional distributions for standard borel targets and Regular conditional kernels factor through a standard borel conditioning variable: under the standard Borel hypotheses, a regular conditional distribution given σ(T) factors through T to a probability kernel on the target.

[F4]

A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: an absolutely continuous probability has an RN density, unique almost everywhere, and integration against it recovers the probability.

[F5]

Likelihood-ratio change of measure: under absolute continuity, integrating against the RN derivative changes P0 to Pθ.

[F6]

Doob-Dynkin factorization through the sigma-algebra generated by a function: a real σ(T)-measurable function factors through a Borel function of a real-valued statistic.

[F7]

Standard borel spaces admit bimeasurable real codings: a standard Borel target is Borel-isomorphic to a Borel subset of R, so the Doob–Dynkin factor extends by a fixed value off that subset.

[F9]

Every nonnegative measurable function admits an explicit increasing sequence of simple approximations and Monotone convergence for the integral: identities for indicators under a regular conditional distribution extend to nonnegative measurable weights by increasing simple approximations and monotone convergence.

Proof

1.1A1F1F4F5F8F9givenconstruct

Suppose T is sufficient, and let K be its common kernel. Fix θ. Disintegrating Pθ and P0 with this same kernel gives Pθ(A)=∫K(y,A)PθT(dy) and P0(A)=∫K(y,A)P0T(dy) for every A. Since Pθ≪P0, also PθT≪P0T; let rθ=dPθT/dP0T. Change of measure [F5] gives Pθ(A)=∫K(y,A)rθ(y)P0T(dy). The disintegration identity under P0 extends to the nonnegative weight rθ by [F9], making this ∫Arθ(T) dP0. Uniqueness in [F4] gives dPθ/dP0=rθ(T) P0-almost surely.

2.1F6F7step 1.1given

This proves that the derivative has a σ(T)-measurable version. Modify that version on the σ(T)-measurable null set where it is negative or infinite to obtain a finite nonnegative version. By [F6, F7] this version has a Borel factor gθ(T) on the standard Borel target; reset target values where gθ is negative or infinite to zero, which preserves the identity P0-almost surely.

3.1F1F2F3F5F8F9givenalgebra∎

Conversely suppose dPθ/dP0=gθ(T) P0-almost surely for every θ. By [F3], a regular conditional distribution under P0 factors through T to a kernel K0 on Y. Change of measure [F5] shows PθT(C)=∫Cgθ(y)P0T(dy). For every A and Borel C, Pθ(A∩T−1C)=∫1A1C(T)gθ(T)dP0=∫Cgθ(y)K0(y,A)P0T(dy)=∫CK0(y,A)PθT(dy). The weighted conditional identity follows from [F9]. Thus the same K0 is a conditional law for every parameter, and [F1] gives sufficiency.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A full exponential family is complete

Statement

Assume AC and let (Pη)η∈Ω be a full-rank exponential family as in Exponential families and full rank, with Ω containing a nonempty open subset of Rk. Then its canonical statistic T is complete.

Facts & Assumptions

Given: the carrier, statistic, base measure, an open parameter subset, and a measurable real g such that Eη∣g(T)∣<∞ and Eηg(T)=0 for every η∈Ω.

[A1]

The Axiom of Choice: the transform-uniqueness lemma is used under its stated axiom branch.

[F1]

Exponential families and full rank: the law has density heη⋅T−A(η), with finite positive normalizer on Ω.

[F2]

Complete statistics: to prove completeness it suffices to show the stated mean-zero function vanishes almost surely for every parameter.

[F3]

Uniqueness of a multivariate exponential transform: a finite signed measure with an exponential moment and zero Laplace transform on a real neighborhood is zero.

[F4]

A real L^1 density defines a finite signed measure with its canonical Hahn and Jordan data and The total variation |nu|(E) from countable measurable partitions: an integrable real density defines a finite signed measure with variation density ∣g∣, and variation is characterized by countable partition sums.

[F5]

Every nonnegative measurable function admits an explicit increasing sequence of simple approximations and Monotone convergence for the integral: nonnegative measurable functions have increasing simple approximations whose integrals converge to their integral.

Proof

1.1F1F4givenconstruct

Choose η0 in the open subset and ϵ>0 so the closed cube η0+[−ϵ,ϵ]k lies in Ω. Define the finite signed measure ρ(A)=∫Ag(T(x)) Pη0(dx) by [F4], and set ν(B)=ρ(T−1B) for Borel B⊆Rk. Since T is measurable, preimages preserve disjoint countable unions, so ν is a finite signed Borel measure. The preimages of a countable partition form a countable partition, giving ∣ν∣≤T#∣ρ∣ by [F4]. Hence ∣ν∣(Rk)≤Eη0∣g(T)∣<∞.

2.1F1F3F4F5step 1.1givenalgebra

Choose 0<δ<ϵ. Since eδ∥s∥1≤∑σ∈{−1,1}keδσ⋅s and ∣ν∣≤T#∣ρ∣ by step 1.1, the weighted-integral bound follows first for nonnegative simple functions from that setwise domination and then for eδ∥s∥1 by [F5]. For each sign vector, changing from Pη0 to Pη0+δσ contributes the factor Z(η0+δσ)/Z(η0), so ∫eδ∥s∥1∣ν∣(ds)≤∑σZ(η0+δσ)Z(η0)Eη0+δσ∣g(T)∣<∞, the exponential moment required by [F3].

3.1A1F3step 2.1givenalgebra

For every real t with ∥t∥∞<δ, its Laplace transform is ∫et⋅sν(ds)=Z(η0+t)Z(η0)Eη0+tg(T)=0 by the mean-zero premise. The transform-uniqueness result [F3], under axiom branch [A1], gives ν=0.

4.1F1F2step 3.1givenalgebra∎

For every Borel B, 0=ν(B)=ρ(T−1B)=∫Bg(s)Pη0T(ds) by the definition of the pushforward measure and ρ. Taking B={g>0} and B={g<0} shows both positive and negative parts have zero integral, so g(T)=0 Pη0-almost surely. Every family density is strictly positive on {h>0}, so all Pη are equivalent to Pη0 and the same vanishing holds for every η. By [F2], T is complete.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Countable factorization criterion for sufficiency

Statement

Let X be a nonempty countable set with its full σ-field, let Θ≠∅, let T:X→Y be a statistic into a standard Borel space, and write pθ(x)=Pθ({x}). Then T is sufficient if and only if there are nonnegative functions h:X→[0,∞) and Borel gθ:Y→[0,∞) such that

pθ(x)=gθ(Tx)h(x)(θ∈Θ, x∈X).

The pointwise convention is gθ(t)=0 whenever M(t)=0, where M(t)=sup⁡θPθ(T=t) on the countable image T(X); outside that image set gθ=0.

Facts & Assumptions

Given: the countable experiment, the statistic T, and the displayed factorization or a common kernel, according to the implication being proved.

[F1]

Sufficient statistics: sufficiency means one probability kernel K satisfying the conditional-law identity for every model law.

[F2]

Measure kernel and probability kernel: for each target event, a probability kernel is measurable in its conditioning argument and is a probability measure in its event argument.

[F3]

Standard Borel spaces: singletons in a standard Borel space are Borel, and countable subsets are Borel.

Proof

1.1F1F2F3givenconstruct

Suppose T is sufficient and fix a common kernel K from [F1]. For t∈T(X) set mθ(t)=Pθ(T=t) and M(t)=sup⁡θmθ(t). The image is countable by countability of X, hence Borel by [F3]; every function on this image extended by zero is Borel. Define h(x)=M(Tx)K(Tx,{x}) and define gθ(t)=mθ(t)/M(t) when M(t)>0, and zero when M(t)=0. Then gθ is Borel and nonnegative.

2.1F1step 1.1givenalgebra

If M(Tx)>0, choose θ0 with mθ0(Tx)>0. The conditional identity in [F1] gives K(Tx,T−1{Tx})=1 and pθ(x)=mθ(Tx)K(Tx,{x}) for every θ; if mθ(Tx)=0, both sides vanish by the same identity. Thus pθ(x)=gθ(Tx)h(x). If M(Tx)=0, every law gives that fiber probability zero, so pθ(x)=h(x)=gθ(Tx)=0. This proves the forward implication pointwise.

2.2F2F3givenchooseconstructstep 1.1

Conversely suppose the factorization holds. For each t∈T(X) let Ft=T−1{t} and H(t)=∑x∈Fth(x). If some mθ(t)>0, then gθ(t)>0 and 0<H(t)=mθ(t)/gθ(t)<∞, since the sum of the probabilities on the fiber is at most one. In that case put K(t,{x})=h(x)/H(t) on Ft and zero off Ft. If all mθ(t)=0, choose the first point of Ft in a fixed enumeration and let K(t,⋅) be its point mass. For t∉T(X) choose one fixed x0∈X and set K(t,⋅)=δx0. The countable image and enumeration make every coordinate t↦K(t,{x}) Borel. For each A⊆X, K(t,A)=∑x∈AK(t,{x}) is a countable sum of Borel functions, so it is Borel; the point-mass assignments are countably additive probability measures.

3.1F1step 2.2givenalgebra∎

On an active fiber, for every A⊆X, Pθ(A∩Ft)=gθ(t)∑x∈A∩Fth(x)=mθ(t)K(t,A). On an inactive fiber both sides are zero. Summing over the countably many t∈C∩T(X) gives the conditional-law identity for every Borel C⊆Y. Thus [F1] holds and T is sufficient.

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

Minimal sufficient statistics

Definition

A statistic T into a standard Borel space is minimal sufficient for (Pθ) if σ(T) is a minimal sufficient σ-field in the preceding sense. Minimality is modulo sets null under every model law. It does not assert literal pointwise equality with any other minimal sufficient statistic.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The canonical statistic of an exponential family is sufficient

Statement

Assume AC. Let (Pη)η∈Ω be the exponential family of Exponential families and full rank on a standard Borel sample space, with Ω≠∅, and let T be its canonical statistic. Then T is sufficient.

Facts & Assumptions

Given: AC, the measurable carrier h, sigma-finite base μ, nonempty natural parameter set Ω, log normalizer A, and density formula from the exponential-family definition.

[A1]

The Axiom of Choice: the common-reference RN criterion is used under AC.

[F1]

Exponential families and full rank: pη=hexp⁡(η⋅T−A(η)) and A=log⁡∫heη⋅Tdμ.

[F2]

Sufficient statistics: a common regular conditional law of the data given T is the sufficiency criterion.

[F3]

Common-reference factorization criterion for sufficiency: with a reference probability that is a member of the family, T is sufficient when every RN derivative relative to it is a Borel function of T.

Proof

1.1F1givenalgebra

Fix any η0∈Ω; nonemptiness is part of the family being considered. The density in [F1] is positive exactly on {h>0} for every parameter. For η∈Ω, dividing the densities there gives dPη/dPη0=exp⁡{(η−η0)⋅T−(A(η)−A(η0))} Pη0-almost surely. The right side is a Borel function of T.

2.1A1F2F3step 1.1given∎

The reference Pη0 is a member of the model and dominates every other member because the densities have the common support {h>0}. Apply [F3] to the derivative in step 1.1; its criterion yields a common conditional law of X given T. By [F2], T is sufficient.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Standard Borel dominated factorization criterion

Statement

Assume AC. Let (X,A) and (Y,B) be standard Borel, let (Pθ)θ∈Θ be a nonempty family dominated by a σ-finite positive measure μ, and let T:X→Y be a statistic. Then the family is dominated by a positive-weight countable mixture Q=∑jwjPθj, and with h=dQ/dμ, T is sufficient if and only if for every θ there is a nonnegative Borel gθ such that

pθ(x)=h(x)gθ(Tx)μ-almost everywhere.

The exceptional null set may depend on θ. Here Q is a member of the augmented family {Q}∪{Pθ}, which is why the common-reference criterion applies. No product-density formula for a singular joint law is used.

Facts & Assumptions

Given: AC; standard Borel data/statistic spaces; and a nonempty family dominated by μ.

[A1]

The Axiom of Choice: AC is used in the countable-mixture domination theorem and RN version selection.

[F1]

Sufficient statistics: the common conditional law criterion for sufficiency.

[F2]

Standard Borel spaces and Existence of regular conditional distributions for standard borel targets: every standard Borel reference law admits a regular conditional distribution given T.

[F3]

Likelihood densities: pθ=dPθ/dμ denotes a nonnegative RN density, with no common exceptional set asserted for uncountably many θ.

[F4]

A countable mixture dominates a sigma-finite dominated family: a positive-weight countable mixture Q from the family dominates every Pθ.

[F5]

Common-reference factorization criterion for sufficiency: when a reference probability is a member of the family, sufficiency is equivalent to its likelihood ratios being measurable functions of T.

[F6]

Radon-Nikodym derivatives satisfy the chain rule along nu << mu << lambda: derivatives compose along absolutely continuous measures with a common finite exhaustion.

[F8]

Dominated statistical experiments: every family law is absolutely continuous with respect to the stated sigma-finite dominator μ.

[F9]

Monotone convergence for the integral: nonnegative conditional identities pass to countable weighted sums by increasing partial sums.

Proof

1.1A1F4F7F8givenconstruct

By [F4], choose a positive-weight countable mixture Q=∑jwjPθj dominating the family, and let h=dQ/dμ. This RN derivative exists under AC because Q is a probability and Q≪μ.

2.1F1F2F9step 1.1givenalgebra

Suppose T is sufficient. Let K be the common conditional law from [F1]. For each A,C, sum the conditional-law identity under Pθj with weights wj; [F9] applied to increasing partial sums gives the same identity under Q. Thus the same K is common for the augmented family {Q}∪{Pθ}.

2.2F3F4F6F7givenstep 1.1

Conversely suppose the factorization holds. By [F4], Pθ≪Q for every θ. The finite measures Pθ,Q and sigma-finite μ have a common finite exhaustion, so the RN chain rule [F6] identifies dPθ/dQ=pθ/h on the Q-full set {h>0}. There the assumed equality gives dPθ/dQ=gθ(T).

3.1F3F5F6F7step 2.1givenalgebra

In this augmented family Q is a member and dominates all laws. Apply [F5] to obtain Borel gθ with dPθ/dQ=gθ(T) Q-almost surely. A sigma-finite cover for μ is a common finite-measure exhaustion for Pθ,Q,μ, since the first two are finite; the chain rule [F6] and density identities [F3, F7] then give pθ=hgθ(T) μ-almost everywhere. The exceptional set may depend on the fixed θ.

4.1F5step 2.2givenalgebra∎

Also dQ/dQ=1 is a function of T. In the augmented family {Q}∪{Pθ}, Q is a member reference and all laws are dominated by it; apply [F5] to these T-measurable derivatives. The criterion gives a common conditional law, so T is sufficient.

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

A countable mixture likelihood-ratio vector is minimal sufficient

Statement

Assume AC. Let (Pk)k≥1 be a countable family of probability measures on a standard Borel space (X,A), let wk>0 with ∑kwk=1, and put Q=∑kwkPk. Choose finite-valued Borel versions fk=dPk/dQ, changed to zero on one common Q-null set. Then T(x)=(fk(x))k≥1 is a Borel statistic into [0,∞)N and is minimal sufficient. For every standard Borel sufficient statistic S, there is a Borel φ with T=φ(S) Q-almost surely.

Facts & Assumptions

Given: AC, the countable family, positive mixture weights, and the common reference mixture Q.

[A1]

The Axiom of Choice: AC permits selection of RN representatives and the countable product construction; only countably many null exceptional sets are combined.

[F1]

Sufficient statistics: sufficiency supplies one parameter-independent conditional kernel.

[F2]

Minimal sufficient statistics and Minimal sufficient sigma-fields: minimality requires inclusion modulo common model-null sets in every sufficient sub-sigma-field; a common conditional kernel supplies the common bounded conditional expectations for its generated sigma-field.

[F3]

Measure kernel and probability kernel: the common conditional kernel has probability-measure sections and measurable evaluations.

[F4]

Standard Borel spaces: Borel maps and countable Borel codings define standard Borel statistics.

[F7]

Existence of regular conditional distributions for standard borel targets and Regular conditional kernels factor through a standard borel conditioning variable: the Q-law admits a regular conditional law given T as a probability kernel on the target of T.

[F8]

Doob-Dynkin factorization through the sigma-algebra generated by a function and Standard borel spaces admit bimeasurable real codings: a real σ(S)-measurable function factors through a standard Borel statistic by coding its target in R; coordinatewise this factors a sequence-valued map.

[F9]

Every nonnegative measurable function admits an explicit increasing sequence of simple approximations and Monotone convergence for the integral: conditional identities and weighted mixture identities extend from indicators to nonnegative measurable functions by increasing simple approximations and monotone convergence.

Proof

1.1A1F4F5F6givenconstruct

Since Pk≪Q, [F5] gives finite-valued nonnegative Borel densities fk after changing each on its null set. Their exceptional sets have countable union N with Q(N)=0; reset all fk to zero on N. By [F6], [0,∞)N is standard Borel. The coordinate maps are Borel, hence T is Borel.

2.1F1F3F5F7F9step 1.1givenalgebra

By [F7], choose a conditional-law kernel K for X given T under Q. Its defining identity extends from indicator weights to nonnegative Borel weights by [F9]. By [F5], Pk(A∩T−1C)=∫1A1C(T)fk dQ. Since Tk=fk, applying the weighted conditional identity with weight 1C(t)tk gives Pk(A∩T−1C)=∫CK(t,A)tkQT(dt); taking A=X gives PkT(C)=∫CtkQT(dt). Thus K works under every Pk, so [F1] gives sufficiency.

2.2A1F1F3F5F9givenconstructstep 1.1

Let S be any other standard Borel sufficient statistic with common kernel L. The same kernel is a conditional law under Q: its conditional identity follows by multiplying the identity under Pk by wk and summing the nonnegative integrals, with [F9] justifying passage to the countable sum. It is also the common conditional law under each Pk. Let QS and PkS be the image laws. The identity PkS≪QS follows from Pk≪Q; write rk=dPkS/dQS. Disintegrating with L and extending the conditional identity to the nonnegative weight rk by [F9] gives, for every A, Pk(A)=∫L(s,A)rk(s)QS(ds)=∫Ark(S(x))Q(dx). RN uniqueness yields fk=rk(S) Q-almost surely.

3.1F2F5F6F8step 2.2givenconstruct

Apply [F5] to each coordinate to obtain Borel rk (modified on QS-null sets if necessary). The map φ(s)=(rk(s))k≥1 is Borel because its coordinate maps are Borel; step 2.2 gives T=φ(S) Q-almost surely. Since every weight is positive, Q(C)=0 iff Pk(C)=0 for every k. For every Borel D in the target of T, the sets T−1(D) and S−1(φ−1(D)) differ only on {T≠φ(S)}, which is Q-null by step 2.2. Therefore σ(T)⊆σ(S) modulo the family-null ideal, establishing the asserted comparison with S.

4.1A1F2F5F9step 1.1step 2.1givenconstruct∎

Let H be any sufficient sub-sigma-field as in [F2]. For each k, apply [F5] on (X,H) to obtain a finite nonnegative H-measurable density rk=d(Pk∣H)/d(Q∣H). For each A∈A, sufficiency supplies one bounded H-measurable vA with the conditional identities for 1A under every Pk. Summing with weights gives those identities under Q. Testing on {vA<0} and {vA>1} shows 0≤vA≤1 Q-almost surely; clipping on these H-measurable null sets preserves every identity because Pk≪Q. Simple approximation and [F9] extend the Q conditional identity to the nonnegative H-measurable weight rk, while the restricted RN identity extends to vA. Consequently ∫Ark dQ=∫vArk dQ=∫vA dPk=Pk(A). Uniqueness in [F5] gives fk=rk Q-almost surely. Combining only these countably many null sets, T=(rk)k Q-almost surely. The right side is H-measurable, so every event in σ(T) agrees modulo a family-null set with an event in H. The kernel in step 2.1 gives sufficiency of σ(T) by extending its event identities to bounded functions using simple approximation and [F9]. Thus [F2] proves minimality against every sufficient sub-sigma-field.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Likelihood-ratio classes are minimal sufficient on a common discrete support

Statement

Assume AC. Under the hypotheses of Likelihood-ratio equivalence on common discrete support, let T(x)=[x]∼ on X0, as a statistic into the countable quotient with its discrete standard-Borel structure, and assign one arbitrary class off X0. Then T is minimal sufficient for (Pθ), modulo X∖X0.

Facts & Assumptions

Given: AC, a nonempty countable sample space with its full σ-field, a nonempty common positive support X0, and the likelihood-ratio equivalence relation.

[F1]

Likelihood-ratio equivalence on common discrete support: the quotient is countable discrete standard Borel and, within a class, the ratio of any two point probabilities is independent of θ.

[F2]

Sufficient statistics: one conditional probability kernel must work for all parameters.

[F3]

Minimal sufficient statistics and Minimal sufficient sigma-fields: minimal sufficiency requires containment modulo common null sets in every sufficient sub-sigma-field.

[A1]

The Axiom of Choice: AC selects countably many separating events of an arbitrary sub-sigma-field on the countable sample space.

[F4]

Measure kernel and probability kernel: each conditional kernel section is a probability measure.

Proof

1.1F1F4givenchooseconstruct

Fix a class D⊆X0 and its first point rD in a fixed enumeration. By [F1], wD(x)=Pθ({x})/Pθ({rD}) for x∈D is positive and independent of θ. The sum WD=∑x∈DwD(x)=Pθ(D)/Pθ({rD}) is finite and positive. Define K(D,A)=∑x∈A∩DwD(x)/WD for every A⊆X. Each row is a probability measure: its total mass is one and countable additivity follows by regrouping nonnegative sums over disjoint events. Every row is independent of θ, and the countable discrete quotient makes all evaluations measurable [F4]. This defines K on every class; off-support sample points use the row of their assigned class, with no separate row assignment.

1.2F1F2F4givenalgebra

Let S be any other sufficient statistic into a standard Borel space, with common kernel L. If x,y∈X0 and S(x)=S(y)=s, then {s} is Borel and Pθ(S=s)>0 for every θ. The conditional identity forces L(s,{x})=Pθ({x})/Pθ(S=s) and L(s,{y})=Pθ({y})/Pθ(S=s). The common kernel has no parameter index, so their ratio is constant in θ; [F1] yields x∼y. Therefore S is constant only within one class on X0.

2.1F1F2step 1.1givenalgebra

For every θ, class D, and A⊆X, the point-mass ratio definition gives Pθ(A∩D)=Pθ(D)K(D,A). Summing over classes proves the conditional-law identity in [F2]; thus T is sufficient.

2.2F3step 1.2givenconstruct

Since X0 is countable, its image under S is countable and Borel in the standard Borel target. Step 1.2 defines a function from that image to the countable quotient with T=φ∘S on X0; extend φ by one fixed class off the image. This extension is Borel because its nonconstant domain is countable. Since every model law is concentrated on X0, T=φ(S) almost surely under every parameter. This proves the comparison with every standard Borel sufficient statistic.

3.1A1F1F3step 2.1givenconstruct∎

Let H be any sufficient sub-sigma-field of the full sigma-field on X. For x,y∈X that some H-event separates, choose one such event, using [A1] for this countable set of pairs. The atoms Hx={y:no H-event separates x,y} are measurable: each is the countable intersection of the chosen events or their complements containing x. Every H-measurable function is constant on each Hx, since unequal real values would be separated by the inverse image of a rational cut. For x,y∈X0 in the same atom H, let vx,vy be common bounded conditional-expectation versions of 1{x},1{y} supplied by sufficiency. Testing on H gives vx∣H=Pθ({x})/Pθ(H) and vy∣H=Pθ({y})/Pθ(H) for every θ; these constants are positive and independent of θ. Thus the point-mass ratio is constant and x∼y. Each class D is therefore the intersection with X0 of a union of H-atoms. That union is countable and measurable, and differs from T−1({D}) only off X0. Unions of classes give σ(T)⊆H modulo the family-null ideal. The common kernel in step 2.1 supplies bounded conditional versions for σ(T) by summing bounded functions on the countable sample space. Hence [F3] proves minimal sufficiency in its full sigma-field sense.

5 · Examples, counterexamples and false statements

None yet.

Sources