Version-Robust Methods for Identifying Minimal Sufficient Statistics
Abstract
Let be the joint density of a random sample . A frequently used criterion asserts that a statistic is minimal sufficient if, for any sample points and , exactly when there exists a finite constant , independent of , such that for all . We show that this criterion is false in general via a counterexample exploiting the non-uniqueness of versions of Radon--Nikodym derivatives. Although Sato (1996) established sufficient regularity conditions for the validity of this criterion, these conditions are frequently intractable to verify in practice. We resolve this limitation by introducing a version-robust method applicable whenever sufficiency is known. Moreover, our method allows us to generalize Sato's approach from Euclidean settings to arbitrary analytic Borel sample spaces and separable measurable statistic spaces. We also obtain a method for exponential-family densities under verifiable hypotheses. Taken together, these results clarify when pointwise likelihood-ratio arguments for minimal sufficiency are mathematically sound in irregular settings. Finally, we construct a counterexample demonstrating that a distinct criterion for minimal sufficiency due to Pfanzagl (1994, 2017) similarly fails in the absence of supplementary hypotheses. Identifying minimal sufficient statistics is important not only for parsimonious data reduction but also because, in models admitting complete sufficiency, such statistics provide a practical route to the complete sufficient structure underlying optimal estimation and prediction.
Keywords
Cite
@article{arxiv.2603.10288,
title = {Version-Robust Methods for Identifying Minimal Sufficient Statistics},
author = {Rafael Oliveira Cavalcante and Alexandre Galvão Patriota},
journal= {arXiv preprint arXiv:2603.10288},
year = {2026}
}
Comments
29 pages (now it provides a generalization to separable spaces)