# Characterization of probability distributions

In mathematics in general, a characterization theorem says that a particular object – a function, a space, etc. – is the only one that possesses properties specified in the theorem. A characterization of a probability distribution accordingly states that it is the only probability distribution that satisfies specified conditions. More precisely, the model of characterization of probability distribution was described by V.M. Zolotarev in such manner. On the probability space we define the space ${\mathcal {X}}=\{X\}$ of random variables with values in measurable metric space $(U,d_{u})$ and the space ${\mathcal {Y}}=\{Y\}$ of random variables with values in measurable metric space $(V,d_{v})$. By characterizations of probability distributions we understand general problems of description of some set ${\mathcal {C}}$ in the space ${\mathcal {X}}$ by extracting the sets ${\mathcal {A}}\subseteq {\mathcal {X}}$ and ${\mathcal {B}}\subseteq {\mathcal {Y}}$ which describe the properties of random variables $X\in {\mathcal {A}}$ and their images $Y=\mathbf {F} X\in {\mathcal {B}}$, obtained by means of a specially chosen mapping $\mathbf {F} :{\mathcal {X}}\to {\mathcal {Y}}$. The description of the properties of the random variables $X$ and of their images $Y=\mathbf {F} X$ is equivalent to the indication of the set ${\mathcal {A}}\subseteq {\mathcal {X}}$ from which $X$ must be taken and of the set ${\mathcal {B}}\subseteq {\mathcal {Y}}$ into which its image must fall. So, the set which interests us appears therefore in the following form:
    $X\in {\mathcal {A}},\mathbf {F} X\in {\mathcal {B}}\Leftrightarrow X\in {\mathcal {C}},i.e.{\mathcal {C}}=\mathbf {F} ^{-1}{\mathcal {B}},$
where $\mathbf {F} ^{-1}{\mathcal {B}}$ denotes the complete inverse image of ${\mathcal {B}}$ in ${\mathcal {A}}$. This is the general model of characterization of probability distribution. Some examples of characterization theorems:
       $\mathbf {F} ={\begin{bmatrix}1&0\\1/{\sqrt {2}}&1/{\sqrt {2}}\end{bmatrix}}$,
    ${\mathcal {A}}$ is a set of random two-dimensional column-vectors with independent identically distributed components, ${\mathcal {B}}$ is a set of random two-dimensional column-vectors with identically distributed components and ${\mathcal {C}}$ is a set of two-dimensional column-vectors with independent identically distributed normal components.
       $\mathbf {F} ={\begin{bmatrix}1&0&\dots &0\\a_{1}&a_{2}&\dots &a_{n}\end{bmatrix}}$,
    ${\mathcal {A}}$ is a set of random n-dimensional column-vectors with independent identically distributed components, ${\mathcal {B}}$ is a set of random two-dimensional column-vectors with identically distributed components and ${\mathcal {C}}$ is a set of n-dimensional column-vectors with independent identically distributed normal components.
       $\Pr(X>x\mid X>y)=\Pr(X>x-y)$.
Verification of conditions of characterization theorems in practice is possible only with some error $\epsilon$, i.e., only to a certain degree of accuracy. Such a situation is observed, for instance, in the cases where a sample of finite size is considered. That is why there arises the following natural question. Suppose that the conditions of the characterization theorem are fulfilled not exactly but only approximately. May we assert that the conclusion of the theorem is also fulfilled approximately? The theorems in which the problems of this kind are considered are called stability characterizations of probability distributions.