Stability postulate

In probability theory, to obtain a nondegenerate limiting distribution of the extreme value distribution, it is necessary to "reduce" the actual greatest value by applying a linear transformation with coefficients that depend on the sample size. If $X_1,X_2,\dots ,X_n$ are independent random variables with common probability density function

$p_{X_j}(x)=f(x),$

then the cumulative distribution function of $X{\text{'}}_n=\max \{X_1,\dots ,X_n\}$ is

$F_{X{\text{'}}_n}={[F(x)]}^n$

If there is a limiting distribution of interest, the stability postulate states that the limiting distribution is some sequence of transformed "reduced" values, such as $(a_{n}X{\text{'}}_n+b_n)$, where $a_n,b_n$ may depend on n but not on x. To distinguish the limiting cumulative distribution function from the "reduced" greatest value from F(x), we will denote it by G(x). It follows that G(x) must satisfy the functional equation

${[G(x)]}^n=G(a_{n}x+b_n)$

This equation was obtained by Maurice René Fréchet and also by Ronald Fisher. Boris Vladimirovich Gnedenko has shown there are no other distributions satisfying the stability postulate other than the following:

• Gumbel distribution for the minimum stability postulate
  • If $X_i=\text{<mrow data-mjx-texclass="ORD">Gumbel</mrow>}(\mu ,\beta )$ and $Y=\min \{X_1,\dots ,X_n\}$ then $Y\sim a_{n}X+b_n$ where $a_n=1$ and $b_n=\beta \log (n)$
  • In other words, $Y\sim \text{<mrow data-mjx-texclass="ORD">Gumbel</mrow>}(\mu -\beta \log (n),\beta )$
• Extreme value distribution for the maximum stability postulate
  • If $X_i=\text{<mrow data-mjx-texclass="ORD">EV</mrow>}(\mu ,\sigma )$ and $Y=\max \{X_1,\dots ,X_n\}$ then $Y\sim a_{n}X+b_n$ where $a_n=1$ and $b_n=\sigma \log (\frac{1}{n})$
  • In other words, $Y\sim \text{<mrow data-mjx-texclass="ORD">EV</mrow>}(\mu -\sigma \log (\frac{1}{n}),\sigma )$
• Fréchet distribution for the maximum stability postulate
  • If $X_i=\text{<mrow data-mjx-texclass="ORD">Frechet</mrow>}(\alpha ,s,m)$ and $Y=\max \{X_1,\dots ,X_n\}$ then $Y\sim a_{n}X+b_n$ where $a_n=n^{-\frac{1}{\alpha }}$ and $b_n=m(1-n^{-\frac{1}{\alpha }})$
  • In other words, $Y\sim \text{<mrow data-mjx-texclass="ORD">Frechet</mrow>}(\alpha ,n^{\frac{1}{\alpha }}s,m)$