Let be fixed and known, and let be independent and identically distributed Bernoulli random variables with common success probability . Their joint probability mass function, on the binary sample space , is
There are arrangements with successes, so has the binomial distribution. For and , its exact conditional full-data probability mass function is
This conditional distribution is uniform over arrangements, with no dependence on : the sum is a sufficient statistic. [ref]
Figure 1.
Four Bernoulli observations grouped by their sufficient sum
. All sixteen binary sequences are grouped by . Within each group the conditional distribution is uniform; changing changes the group's total probability, not the conditional weights within it. Details.
For , the group sizes are and the within-group conditional probabilities are respectively . For example, leaves exactly , each with conditional probability . At , each such sequence has unconditional probability and the group has probability . At , these values are and ; at they return to and . The conditional weights stay in all three cases.
At the boundary , only has positive probability; at , only does. Dividing by on the other groups would divide by zero. Nevertheless, the same uniform-on-arrangements Markov kernel is a valid common version for the entire family : it gives the correct point mass on the one observed group at each boundary and assigns permissible versions on its unobserved groups. Define the joint probability mass function there by the original product of the one-trial Bernoulli probability mass functions, or use the limiting convention in the compact formula.
The sample mean is an unbiased estimator of and retains the sufficient statistic because is known. By contrast, is also an unbiased estimator of but, for , is not sufficient: the conditional success probability of the independent given is still . Thus unbiasedness does not imply sufficiency.
Sufficiency also does not imply completeness of a statistic. For , the full-data sufficient statistic admits the nonzero function with expectation zero for every . Nor does minimality imply completeness of a statistic: for and the restricted statistical model , is a minimal sufficient statistic since the likelihood ratio distinguishes its three values. Yet has expectation at both parameter values and is never zero. Changing the parameter family can change completeness of a statistic even while preserving sufficiency.
Fisher-Neyman factorization theorem Created 2026-09-24 Updated 2026-10-14
Assume the full-data sample space and the range of the statistic are standard Borel spaces, is a measurable function, and the statistical model is dominated by one common sigma-finite measure . Write for its densities. Then is a sufficient statistic if and only if there exist nonnegative measurable functions and , with independent of , such that
The statistical parameter can enter only through and the observed . [ref]
For discrete data, take counting measure; for ordinary continuous data, take Lebesgue measure. Independence, identical sampling laws, smooth dependence on , and a fixed positive support of a probability distribution are not requirements of this theorem. Parameter-dependent support must nevertheless be included in , usually through an indicator function, and must fit the displayed factorization. The sufficient statistic for a symmetric uniform sample illustrates exactly this: its indicator function depends on the unknown scale through the observed absolute maximum. The null sets in the theorem concern versions of densities; the factors are not generally themselves normalized probability distributions.
For a discrete sample space, the cancellation behind the theorem is particularly transparent. On a group with positive probability, factorization gives
Conversely, multiply a common conditional probability mass function by to obtain the required factorization. For continuous data, a sum over a group is not a density integral over the original Lebesgue measure: the group may have measure zero. Use the regular conditional distribution formulation and the Fisher-Neyman factorization theorem instead of that discrete calculation.
Sufficient statistic Created 2026-09-24 Updated 2026-10-14
A statistic is sufficient for a statistical model when the conditional distribution of the full data given has a version independent of the unknown statistical parameter . Once is recorded, the remaining uncertainty about the data's arrangement can be generated without knowing . [ref]
For data and statistic taking values in standard Borel spaces, express this precisely with one Markov kernel , common to every statistical parameter value:
for each measurable event . Thus is a regular conditional distribution of given . Equality is only required outside a null set for the distribution of under each ; the choice of version matters on impossible conditioning events. For a continuous probability distribution, the event may have zero probability even at meaningful observations, so the definition uses a regular conditional distribution, rather than division by .
A sufficient statistic is a property of a specified statistical model, rather than of a formula for summarizing data in isolation. It need not be an unbiased estimator or even shorten the record: the full data is always sufficient. An estimator instead targets a quantity such as a mean. An ancillary statistic has a parameter-independent marginal probability distribution, whereas a sufficient statistic has a parameter-independent conditional full-data law. A minimal sufficient statistic permits the greatest reduction among sufficient statistics. A complete statistic satisfies a separate condition about zero expectations; a complete sufficient statistic must satisfy both conditions.