Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 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.

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