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.
Sufficiency, Completeness and Exponential Families
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Analyticity of Holomorphic Functions; Liouville and Morera
- Arc Length and Rectifiable Curves
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Coordinate and Path Transport
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Lp Spaces and Test-Function Conventions
- Complex Power Series and Analytic Functions
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Connectedness
- 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
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- 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
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- 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
- Sine, Cosine, and the Definition of Pi
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Uniqueness of a multivariate exponential transform
Statement
Assume AC and let . Let be a finite complex Borel measure on . Suppose there is such that . If the Laplace transform is zero for every real in an open neighborhood of , then .
Facts & Assumptions
Given: AC and a finite complex Borel measure with the stated exponential moment and vanishing Laplace transform.
The Axiom of Choice: the cited Fourier uniqueness theorem uses the library's stated choice assumptions; no parameter-dependent selections are made here.
A complex measure is a finite-valued countably additive set function, The total variation |nu|(E) from countable measurable partitions, and The total variation of a signed or complex measure is a positive measure: is a positive measure; the exponential-moment hypothesis makes it finite.
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 functions and satisfies .
Dominated convergence: dominated convergence for complex-valued functions holds with respect to the positive measure .
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.
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
If , then is a singleton and the open neighborhood in the hypothesis contains its only point; , so . If , set . Fix and a coordinate . Choose a neighborhood of on which every real coordinate has absolute value at most . The moment assumption makes integrable with respect to the positive measure [F1], and all integrands below belong to by [F2]. On this neighborhood, , while for small complex the th difference quotient is bounded by . For every sequence , [F3] gives convergence of the difference quotients in to ; the bound in [F2] transfers this convergence to their integrals against . Thus is complex differentiable in coordinate at , and, since and were arbitrary, is holomorphic in each coordinate on .
Assume . The real neighborhood contains a product of real intervals around zero. Fix real values of coordinates in those intervals. As a function of , is holomorphic on the connected strip and vanishes on a real interval; [F4] makes it zero for every in that strip. Now fix such a complex and real coordinates in their intervals and apply [F4] to coordinate . Repeating this finite process for coordinates through proves for every .
For and each , the library Fourier transform is , since . The Fourier uniqueness result [F5] then gives .
Likelihood-ratio equivalence on common discrete support
Definition
Let be countable with its full -field, so it is standard Borel under the discrete metric. Let , and let be dominated by a fixed -finite positive measure . Choose the finite-valued densities as in Likelihood densities. Let satisfy and for every and every . Write . For each , and : positivity follows from , finiteness from sigma-finiteness, and the value is fixed by the density integral on the positive-measure singleton. Consequently
For , define if there is a constant such that 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 , and are respectively , and . 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 , is nonempty; define the class statistic by mapping each point of to its class and every point off to any fixed class. It is measurable because has the full -field, and values off are null under every law.
A countable mixture dominates a sigma-finite dominated family
Statement
Assume AC. Let be a nonempty family of probability measures dominated by a -finite positive measure on . There are a finite or countable sequence from and weights summing to one such that satisfies for every . Repetitions are permitted if is finite.
Facts & Assumptions
Given: AC, a nonempty dominated family, and a sigma-finite dominating measure.
The Axiom of Choice: AC selects RN versions for the possibly uncountable family and countably many finite-subfamily approximations to a supremum.
Dominated statistical experiments: every is absolutely continuous with respect to the supplied sigma-finite .
Finite, sigma-finite, and semifinite measures: has a countable cover by measurable sets of finite measure.
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 has a nonnegative density with .
Monotone convergence for the integral: increasing nonnegative functions, including indicators and partial sums of densities, pass to their integrals.
Proof
Choose a countable measurable partition of with by disjointifying a sigma-finite cover [F2]. Put and . For disjoint measurable , countable additivity of and interchange of nonnegative double series give ; the interchange is valid because both sides are the supremum of the same finite subsums. Thus is a measure. Also . Since every , iff every , iff . Thus is finite and equivalent to , so every .
For each , choose the RN density from [F3], finite outside a -null set, and let . Fix ; since , . Define , so . By [A1], choose finite for each with union measure greater than . For all sufficiently large , these unions have positive measure, so the selected index set is nonempty. Set . Finite unions from the selected sets have measure at most , so [F4] applied to their indicators gives by continuity from below; the approximations give . Hence .
Fix . If , the increasing finite unions converge to , whose measure is greater than . [F4] applied to their indicators shows that some finite union then exceeds , contradicting its definition. Therefore -almost everywhere on .
Enumerate the nonempty countable collection of selected indices as , allowing repetitions if needed, and choose positive weights summing to one. The mixture has density by [F4], so exactly on up to a -null set. If , then . For each , ; these sets cover up to the null set where is not positive on . Hence . Also every vanishes on by step 3.1, so . Since was arbitrary, for all .
Ancillary statistics
Definition
A statistic is ancillary for if its pushforward probability does not depend on . Equivalently, for every , is constant in .
Complete statistics
Definition
A statistic is complete for if, for every measurable real-valued such that for every , the conditions for every imply for every . Integrability is part of the premise; completeness is a property of the statistic relative to the specified family.
Exponential families and full rank
Definition
Let be standard Borel, let be a -finite positive measure, let be measurable, and let be a measurable statistic. For put
For a parameter set , the associated exponential family has laws with density
The normalization makes each density integrate to one. In this item full-rank means that contains a nonempty open subset of and there do not exist and with -almost everywhere on . 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.
Sufficient statistics
Definition
Let be a statistical experiment, where is standard Borel, and let be a statistic with standard Borel target. Write . The statistic is sufficient if there is one probability kernel from to such that, for every , , and ,
Thus is a common version of the conditional probability of given , 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.
Minimal sufficient sigma-fields
Definition
For a family on , a sub--field is sufficient if for every bounded measurable there is one -measurable bounded function such that
For each , this says that is a version of , with the same pointwise version used for every parameter. Define the family-null ideal . We say if for every there is with . A sufficient -field is minimal sufficient if for every sufficient .
Basu’s independence theorem
Statement
Let be standard Borel, and let and be statistics from this sample space into standard Borel spaces for a family . If is complete and sufficient and is ancillary, then and are independent under every .
Facts & Assumptions
Given: the family on a standard Borel sample space, complete sufficient , ancillary , and their standard Borel target spaces.
Sufficient statistics: one kernel gives the conditional law of the data given for every parameter.
Complete statistics: an integrable function of with zero expectation for every parameter vanishes almost surely under every law.
Ancillary statistics: the law of is parameter-independent.
Measure kernel and probability kernel: is measurable and is a probability measure.
Proof
Fix a Borel set in the target of . The function is Borel by [F4]. For every , the conditional-law identity [F1] shows is a version of .
By ancillarity [F3], is constant in . Hence the bounded function satisfies for every . Completeness [F2] implies -almost surely for each .
For any Borel in the target of , . This holds for every pair of Borel sets , which is the definition of independence.
Common-reference factorization criterion for sufficiency
Statement
Let and be standard Borel, let , and let be a statistic. Fix and set . Assume for every . Then is sufficient if and only if for every the Radon–Nikodym derivative has a -measurable version. Equivalently, for each there is a Borel with -almost surely. The null exceptional set may depend on . The requirement is essential; an arbitrary external dominating probability is not covered.
Facts & Assumptions
Given: the standard Borel spaces, , the model, the in-model reference , and absolute continuity.
The Axiom of Choice: the Radon–Nikodym theorem is used under AC.
Sufficient statistics: sufficiency is the existence of one conditional distribution kernel common to all model laws.
Statistics and estimators: is a measurable data map, so its generated sigma-field and inverse images are measurable.
Measure kernel and probability kernel: kernel evaluations are measurable, and each fixed conditioning value gives a probability measure.
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 factors through to a probability kernel on the target.
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.
Likelihood-ratio change of measure: under absolute continuity, integrating against the RN derivative changes to .
Doob-Dynkin factorization through the sigma-algebra generated by a function: a real -measurable function factors through a Borel function of a real-valued statistic.
Standard borel spaces admit bimeasurable real codings: a standard Borel target is Borel-isomorphic to a Borel subset of , so the Doob–Dynkin factor extends by a fixed value off that subset.
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
Suppose is sufficient, and let be its common kernel. Fix . Disintegrating and with this same kernel gives and for every . Since , also ; let . Change of measure [F5] gives . The disintegration identity under extends to the nonnegative weight by [F9], making this . Uniqueness in [F4] gives -almost surely.
This proves that the derivative has a -measurable version. Modify that version on the -measurable null set where it is negative or infinite to obtain a finite nonnegative version. By [F6, F7] this version has a Borel factor on the standard Borel target; reset target values where is negative or infinite to zero, which preserves the identity -almost surely.
Conversely suppose -almost surely for every . By [F3], a regular conditional distribution under factors through to a kernel on . Change of measure [F5] shows . For every and Borel , . The weighted conditional identity follows from [F9]. Thus the same is a conditional law for every parameter, and [F1] gives sufficiency.
A full exponential family is complete
Statement
Assume AC and let be a full-rank exponential family as in Exponential families and full rank, with containing a nonempty open subset of . Then its canonical statistic is complete.
Facts & Assumptions
Given: the carrier, statistic, base measure, an open parameter subset, and a measurable real such that and for every .
The Axiom of Choice: the transform-uniqueness lemma is used under its stated axiom branch.
Exponential families and full rank: the law has density , with finite positive normalizer on .
Complete statistics: to prove completeness it suffices to show the stated mean-zero function vanishes almost surely for every parameter.
Uniqueness of a multivariate exponential transform: a finite signed measure with an exponential moment and zero Laplace transform on a real neighborhood is zero.
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 , and variation is characterized by countable partition sums.
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
Choose in the open subset and so the closed cube lies in . Define the finite signed measure by [F4], and set for Borel . Since 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 by [F4]. Hence .
Choose . Since and by step 1.1, the weighted-integral bound follows first for nonnegative simple functions from that setwise domination and then for by [F5]. For each sign vector, changing from to contributes the factor , so , the exponential moment required by [F3].
For every real with , its Laplace transform is by the mean-zero premise. The transform-uniqueness result [F3], under axiom branch [A1], gives .
For every Borel , by the definition of the pushforward measure and . Taking and shows both positive and negative parts have zero integral, so -almost surely. Every family density is strictly positive on , so all are equivalent to and the same vanishing holds for every . By [F2], is complete.
Countable factorization criterion for sufficiency
Statement
Let be a nonempty countable set with its full -field, let , let be a statistic into a standard Borel space, and write . Then is sufficient if and only if there are nonnegative functions and Borel such that
The pointwise convention is whenever , where on the countable image ; outside that image set .
Facts & Assumptions
Given: the countable experiment, the statistic , and the displayed factorization or a common kernel, according to the implication being proved.
Sufficient statistics: sufficiency means one probability kernel satisfying the conditional-law identity for every model law.
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.
Standard Borel spaces: singletons in a standard Borel space are Borel, and countable subsets are Borel.
Proof
Suppose is sufficient and fix a common kernel from [F1]. For set and . The image is countable by countability of , hence Borel by [F3]; every function on this image extended by zero is Borel. Define and define when , and zero when . Then is Borel and nonnegative.
If , choose with . The conditional identity in [F1] gives and for every ; if , both sides vanish by the same identity. Thus . If , every law gives that fiber probability zero, so . This proves the forward implication pointwise.
Conversely suppose the factorization holds. For each let and . If some , then and , since the sum of the probabilities on the fiber is at most one. In that case put on and zero off . If all , choose the first point of in a fixed enumeration and let be its point mass. For choose one fixed and set . The countable image and enumeration make every coordinate Borel. For each , is a countable sum of Borel functions, so it is Borel; the point-mass assignments are countably additive probability measures.
On an active fiber, for every , . On an inactive fiber both sides are zero. Summing over the countably many gives the conditional-law identity for every Borel . Thus [F1] holds and is sufficient.
Minimal sufficient statistics
Definition
A statistic into a standard Borel space is minimal sufficient for if 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.
The canonical statistic of an exponential family is sufficient
Statement
Assume AC. Let be the exponential family of Exponential families and full rank on a standard Borel sample space, with , and let be its canonical statistic. Then is sufficient.
Facts & Assumptions
Given: AC, the measurable carrier , sigma-finite base , nonempty natural parameter set , log normalizer , and density formula from the exponential-family definition.
The Axiom of Choice: the common-reference RN criterion is used under AC.
Sufficient statistics: a common regular conditional law of the data given is the sufficiency criterion.
Common-reference factorization criterion for sufficiency: with a reference probability that is a member of the family, is sufficient when every RN derivative relative to it is a Borel function of .
Proof
Fix any ; nonemptiness is part of the family being considered. The density in [F1] is positive exactly on for every parameter. For , dividing the densities there gives -almost surely. The right side is a Borel function of .
The reference is a member of the model and dominates every other member because the densities have the common support . Apply [F3] to the derivative in step 1.1; its criterion yields a common conditional law of given . By [F2], is sufficient.
Standard Borel dominated factorization criterion
Statement
Assume AC. Let and be standard Borel, let be a nonempty family dominated by a -finite positive measure , and let be a statistic. Then the family is dominated by a positive-weight countable mixture , and with , is sufficient if and only if for every there is a nonnegative Borel such that
The exceptional null set may depend on . Here is a member of the augmented family , 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 .
The Axiom of Choice: AC is used in the countable-mixture domination theorem and RN version selection.
Sufficient statistics: the common conditional law criterion for sufficiency.
Standard Borel spaces and Existence of regular conditional distributions for standard borel targets: every standard Borel reference law admits a regular conditional distribution given .
Likelihood densities: denotes a nonnegative RN density, with no common exceptional set asserted for uncountably many .
A countable mixture dominates a sigma-finite dominated family: a positive-weight countable mixture from the family dominates every .
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 .
Radon-Nikodym derivatives satisfy the chain rule along nu << mu << lambda: derivatives compose along absolutely continuous measures with a common finite exhaustion.
A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: the derivatives satisfy their setwise integral identities and are unique almost everywhere.
Dominated statistical experiments: every family law is absolutely continuous with respect to the stated sigma-finite dominator .
Monotone convergence for the integral: nonnegative conditional identities pass to countable weighted sums by increasing partial sums.
Proof
By [F4], choose a positive-weight countable mixture dominating the family, and let . This RN derivative exists under AC because is a probability and .
Suppose is sufficient. Let be the common conditional law from [F1]. For each , sum the conditional-law identity under with weights ; [F9] applied to increasing partial sums gives the same identity under . Thus the same is common for the augmented family .
Conversely suppose the factorization holds. By [F4], for every . The finite measures and sigma-finite have a common finite exhaustion, so the RN chain rule [F6] identifies on the -full set . There the assumed equality gives .
In this augmented family is a member and dominates all laws. Apply [F5] to obtain Borel with -almost surely. A sigma-finite cover for is a common finite-measure exhaustion for , since the first two are finite; the chain rule [F6] and density identities [F3, F7] then give -almost everywhere. The exceptional set may depend on the fixed .
Also is a function of . In the augmented family , 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 is sufficient.
A countable mixture likelihood-ratio vector is minimal sufficient
Statement
Assume AC. Let be a countable family of probability measures on a standard Borel space , let with , and put . Choose finite-valued Borel versions , changed to zero on one common -null set. Then is a Borel statistic into and is minimal sufficient. For every standard Borel sufficient statistic , there is a Borel with -almost surely.
Facts & Assumptions
Given: AC, the countable family, positive mixture weights, and the common reference mixture .
The Axiom of Choice: AC permits selection of RN representatives and the countable product construction; only countably many null exceptional sets are combined.
Sufficient statistics: sufficiency supplies one parameter-independent conditional kernel.
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.
Measure kernel and probability kernel: the common conditional kernel has probability-measure sections and measurable evaluations.
Standard Borel spaces: Borel maps and countable Borel codings define standard Borel statistics.
A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: each has an RN density, unique -almost everywhere.
Under countable choice, a countable product of completely metrizable spaces is completely metrizable and Assuming countable choice, a countable product of second countable spaces is second countable: a countable product of Polish spaces is Polish, so its Borel space is standard Borel.
Existence of regular conditional distributions for standard borel targets and Regular conditional kernels factor through a standard borel conditioning variable: the -law admits a regular conditional law given as a probability kernel on the target of .
Doob-Dynkin factorization through the sigma-algebra generated by a function and Standard borel spaces admit bimeasurable real codings: a real -measurable function factors through a standard Borel statistic by coding its target in ; coordinatewise this factors a sequence-valued map.
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
Since , [F5] gives finite-valued nonnegative Borel densities after changing each on its null set. Their exceptional sets have countable union with ; reset all to zero on . By [F6], is standard Borel. The coordinate maps are Borel, hence is Borel.
By [F7], choose a conditional-law kernel for given under . Its defining identity extends from indicator weights to nonnegative Borel weights by [F9]. By [F5], . Since , applying the weighted conditional identity with weight gives ; taking gives . Thus works under every , so [F1] gives sufficiency.
Let be any other standard Borel sufficient statistic with common kernel . The same kernel is a conditional law under : its conditional identity follows by multiplying the identity under by and summing the nonnegative integrals, with [F9] justifying passage to the countable sum. It is also the common conditional law under each . Let and be the image laws. The identity follows from ; write . Disintegrating with and extending the conditional identity to the nonnegative weight by [F9] gives, for every , . RN uniqueness yields -almost surely.
Apply [F5] to each coordinate to obtain Borel (modified on -null sets if necessary). The map is Borel because its coordinate maps are Borel; step 2.2 gives -almost surely. Since every weight is positive, iff for every . For every Borel in the target of , the sets and differ only on , which is -null by step 2.2. Therefore modulo the family-null ideal, establishing the asserted comparison with .
Let be any sufficient sub-sigma-field as in [F2]. For each , apply [F5] on to obtain a finite nonnegative -measurable density . For each , sufficiency supplies one bounded -measurable with the conditional identities for under every . Summing with weights gives those identities under . Testing on and shows -almost surely; clipping on these -measurable null sets preserves every identity because . Simple approximation and [F9] extend the conditional identity to the nonnegative -measurable weight , while the restricted RN identity extends to . Consequently . Uniqueness in [F5] gives -almost surely. Combining only these countably many null sets, -almost surely. The right side is -measurable, so every event in agrees modulo a family-null set with an event in . The kernel in step 2.1 gives sufficiency of by extending its event identities to bounded functions using simple approximation and [F9]. Thus [F2] proves minimality against every sufficient sub-sigma-field.
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 on , as a statistic into the countable quotient with its discrete standard-Borel structure, and assign one arbitrary class off . Then is minimal sufficient for , modulo .
Facts & Assumptions
Given: AC, a nonempty countable sample space with its full -field, a nonempty common positive support , and the likelihood-ratio equivalence relation.
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 .
Sufficient statistics: one conditional probability kernel must work for all parameters.
Minimal sufficient statistics and Minimal sufficient sigma-fields: minimal sufficiency requires containment modulo common null sets in every sufficient sub-sigma-field.
The Axiom of Choice: AC selects countably many separating events of an arbitrary sub-sigma-field on the countable sample space.
Measure kernel and probability kernel: each conditional kernel section is a probability measure.
Proof
Fix a class and its first point in a fixed enumeration. By [F1], for is positive and independent of . The sum is finite and positive. Define for every . 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 on every class; off-support sample points use the row of their assigned class, with no separate row assignment.
Let be any other sufficient statistic into a standard Borel space, with common kernel . If and , then is Borel and for every . The conditional identity forces and . The common kernel has no parameter index, so their ratio is constant in ; [F1] yields . Therefore is constant only within one class on .
For every , class , and , the point-mass ratio definition gives . Summing over classes proves the conditional-law identity in [F2]; thus is sufficient.
Since is countable, its image under is countable and Borel in the standard Borel target. Step 1.2 defines a function from that image to the countable quotient with on ; 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 , almost surely under every parameter. This proves the comparison with every standard Borel sufficient statistic.
Let be any sufficient sub-sigma-field of the full sigma-field on . For that some -event separates, choose one such event, using [A1] for this countable set of pairs. The atoms are measurable: each is the countable intersection of the chosen events or their complements containing . Every -measurable function is constant on each , since unequal real values would be separated by the inverse image of a rational cut. For in the same atom , let be common bounded conditional-expectation versions of supplied by sufficiency. Testing on gives and for every ; these constants are positive and independent of . Thus the point-mass ratio is constant and . Each class is therefore the intersection with of a union of -atoms. That union is countable and measurable, and differs from only off . Unions of classes give modulo the family-null ideal. The common kernel in step 2.1 supplies bounded conditional versions for 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
- Ryan Martin, Lecture Notes on Advanced Statistical Theory
- Joshua M. Tebbs, STAT 512 Mathematical Statistics Lecture Notes
- Peter Kempthorne, MIT 18.655 Lecture Note 6: Sufficiency
- Noah Fithian, Stat 210a Reader: Sufficiency
- Noah Fithian, Stat 210a Reader: Completeness, Ancillarity, and Basu’s Theorem
- Charles J. Geyer, Stat 5421 Lecture Notes: Exponential Families
- Jiahao Tian, Chapter 2: Sufficiency and Exponential Families