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.
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.
Depends on
Used by
Dependency tree · two levels
19 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)