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.
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.
Depends on
- Sufficient statistics
- Minimal sufficient statistics
- Minimal sufficient sigma-fields
- Measure kernel and probability kernel
- Standard Borel spaces
- Doob-Dynkin factorization through the sigma-algebra generated by a function
- Standard borel spaces admit bimeasurable real codings
- Existence of regular conditional distributions for standard borel targets
- Regular conditional kernels factor through a standard borel conditioning variable
- Under countable choice, a countable product of completely metrizable spaces is completely metrizable
- Assuming countable choice, a countable product of second countable spaces is second countable
- A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density
- The Axiom of Choice
- Every nonnegative measurable function admits an explicit increasing sequence of simple approximations
- Monotone convergence for the integral
Used by
Dependency tree · two levels
64 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ryan Martin, Lecture Notes on Advanced Statistical Theory (standard reference, not scraped)
- Joshua M. Tebbs, STAT 512 Mathematical Statistics Lecture Notes (standard reference, not scraped)
- Peter Kempthorne, MIT 18.655 Lecture Note 6: Sufficiency (standard reference, not scraped)
- Noah Fithian, Stat 210a Reader: Sufficiency (standard reference, not scraped)
- Noah Fithian, Stat 210a Reader: Completeness, Ancillarity, and Basu’s Theorem (standard reference, not scraped)
- Charles J. Geyer, Stat 5421 Lecture Notes: Exponential Families (standard reference, not scraped)
- Jiahao Tian, Chapter 2: Sufficiency and Exponential Families (standard reference, not scraped)