Jump to content

Khinchin's theorem on the factorization of distributions

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SuperUserCode (talk | contribs) at 02:22, 4 October 2016 (Fix). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Khinchin's theorem on the factorization of distributions: Any probability distribution admits (in the convolution semi-group of probability distributions) a factorization

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "http://localhost:6011/en.wikipedia.org/v1/":): {\displaystyle P = P_1 \otimes P_2 }

where is a distribution of class (see Infinitely-divisible distributions, factorization of) and is a distribution that is either degenerate or is representable as the convolution of a finite or countable set of indecomposable distributions (cf. Indecomposable distribution). The factorization (1) is not unique, in general.

The theorem was proved by A.Ya. Khinchin[1] for distributions on the line, and later it became clear [2] that it is valid for distributions on considerably more general groups. A broad class (see [3][5]) of topological semi-groups is known, including the convolution semi-group of distributions on the line, in which factorization theorems analogous to Khinchin's theorem are valid.

Comments

A distribution of class is a distribution without indecomposable factor.

Diophantine approximation

  1. ^ Kinchin, A. Ya. (1937). On the arithmetic of distribution laws (in Russian). pp. 6–17.