Halmos-Savage theorem

from Wikipedia, the free encyclopedia

The set of Halmos-Savage is a tenet of mathematical statistics , which in the presence of a dominant class distribution a necessary and sufficient criterion for the sufficiency of σ-algebras (and thus also of Statistics supplies). The Halmos-Savage theorem is thus an aid to check whether certain functions enable data compression without loss of information. The Neyman criterion for sufficiency , which is easier to handle, can be derived from the Halmos-Savage theorem . Criteria for the existence of minimally sufficient σ-algebras can also be derived from the set of criteria .

The theorem was proven in 1949 by Paul Halmos and Leonard J. Savage .

Framework

A statistical model with a dominated distribution class is given .

For any distribution class, let the set of all -null sets. For a dominated distribution class there is always a dominant one , so that and is a countable convex combination with really positive coefficients of elements . So it applies

.

statement

Let be a dominated distribution class and as given above. Then a sub-σ-algebra of if and suffizient if for all a function exists so that -almost certainly the radon Nikodým derivation of respect is so

.

example

Let σ-algebras be and be sufficient. In addition, let it be a dominated distribution class. Then, according to Halmos-Savage's theorem, there exists such that and

.

But there is, applies . Since the density property is still fulfilled, repeated use of the sentence is also sufficient.

Note that this statement does not generally apply and that this is one of the shortcomings of the term sufficiency.

literature

Individual evidence

  1. Halmos, Savage: Application of the Radon-Nikodym Theorem to the Theory of Sufficient Statistics, Annals of Mathematical Statistics, Volume 20, 1949, pp. 225-241, Project Euclid