Next: Corollary 13 Up: The Asymptotic Frequency Distribution Previous: Theorem 12

Theorem 13 (Gnedenko (1943), pp. 439-442)

A frequency distribution Fn(x) converges to a limiting frequency distribution of the type $\phi_a (x)$, and n [ 1 - F (x)] converges to a W-function of the type W1 (a,x) if and only if, for all values of k > 0,

 
 \begin{displaymath}
\lim_{x\to\infty} \frac{1-F(x)}{1 - F (kx)} = k^a, \qquad a \gt 0.\end{displaymath} (46)

Proof: Suppose first that Eq. (46) is true. It will be demonstrated that $\lim_{n\to\infty} n [1-F
(x)]$ is of the type W1 (a,x). By Eq. (46), F(x) < 1 for all finite x. Assume the contrary. Then, F(x0) = 1 for some finite x = x0. But then,

\begin{displaymath}
\lim_{x\to\infty} \frac{1-F(x)}{1 - F (kx)} = \begin{cases}
...
 ...\text{if } k = 1, \\  \infty, & \text{if } k
\gt 1, \end{cases}\end{displaymath}

which contradicts Eq. (46). It follows that for n sufficiently large, the value of x satisfying

\begin{displaymath}
1 - F (x) \leq \frac1n\end{displaymath}

will be positive. Let an be the smallest value of x (see Theorem 12) satisfying the inequalities

 
 \begin{displaymath}
1 - F (x+0) \leq \frac1n \leq 1 - F (x-0).\end{displaymath} (47)

In Eq. (46), let x be replaced by an x and $k =
(1+\epsilon)/x$. Then,

 
 \begin{displaymath}
\lim_{a_n x \to \infty} \frac{1-F (a_n x)}{1-F (a_n (1 + \ep...
 ...-F (a_n (a+\epsilon))} = \left(
\frac{1 + \epsilon}x \right)^a.\end{displaymath} (48)

Similarly, replace x by an x and let $k = (1-\epsilon)/x$. Then,

 
 \begin{displaymath}
\lim_{a_n x \to \infty} \frac{1-F(a_nx)}{1-F (a_n (1-\epsilo...
 ...{1-F (a_n (1-\epsilon))} = \left(
\frac{1-\epsilon}x \right)^a.\end{displaymath} (49)

The left-hand members of Eq. (48) and (49) are monotonic functions of $\epsilon$, and the right-hand terms are continuous functions of $\epsilon$. Then, by Theorem 10, the convergence in both Eqs. (48) and (49) is uniform. Hence [Rudin (1953), pp. 119-120],

 
 \begin{displaymath}
\begin{array}
{r@{~}c@{~}l}
\displaystyle \lim_{n\to\infty} ...
 ...0} \left( \frac{1 + \epsilon}2
 \right)^2 = x^{-a}, \end{array}\end{displaymath} (50)

 
 \begin{displaymath}
\begin{array}
{r@{~}c@{~}l}
\displaystyle \lim_{n\to\infty} ...
 ... 0} \left( \frac{1 - \epsilon}2
 \right)^2 = x^{-a}.\end{array}\end{displaymath} (51)

Now, by definition of an (see Eq. (47)),

\begin{displaymath}
1 - F (a_n (1+0)) \leq \frac1n \leq 1 - F (a_n (1-0)).\end{displaymath}

and so

 
 \begin{displaymath}
\frac{1-F (a_nx)}{1 - F (a_n (1-0))} \leq n [ 1 - F (a_n x)] \leq
\frac{1 - F (a_n x)}{1 - F (a_n (1+0))}.\end{displaymath} (52)

In the limit as $n \to
\infty$, because of Eqs. (50) and (51), it follows that (52) becomes

\begin{displaymath}
x^{-a} \leq n [ 1 - F (a_n x) ] \leq x^{-a} \quad \text{or} \quad
\lim_{n\to\infty} n [ 1-F (a_nx)] = x^{-a}.\end{displaymath}

Then, by Theorem 7,

\begin{displaymath}
F^n (a_n x) \Rightarrow e^{-x^{-a}}.\end{displaymath}

The above development was based on the supposition that x > 0, and hence is true for all x > 0. But then,

\begin{displaymath}
\begin{array}
{r@{~}c@{~}l@{\quad}l}
\displaystyle \lim_{n\t...
 ...\to\infty} F^n (a_n x) & = & 0, & \text{for } x < 0,\end{array}\end{displaymath}

since

\begin{displaymath}
\begin{array}
{r@{~}c@{~}l@{\quad}l}
x^{-a} & \to & \infty, ...
 ...0, \\ e^{-x^{-a}} & \to & 0, & \text{as } x \to + 0.\end{array}\end{displaymath}

This proves the sufficiency of Eq. (46).

Now, suppose that Fn(x) converges to a limiting frequency distribution of the type $\phi_a (x)$. By Theorem 7, this is the same as supposing that n [1-F(x)] converges to a W-function of the type W1 (a,x). Hence, there exists a sequence of constants an > 0, bn, $n = 1,2,3,\ldots$, such that

 
 \begin{displaymath}
\lim_{n\to\infty} n [ 1 - F (a_n x + b_n)] = \begin{cases}
x...
 ...gt 0, \ a \gt 0, \\  \infty, & \text{for } x \leq 0.\end{cases}\end{displaymath} (53)

For all constants $\beta \gt 1$ and x > 0,

 
 \begin{displaymath}
\lim_{n\to\infty} \beta [ 1 - F (a_n x + b_n)] = \beta x^{a}.\end{displaymath} (54)

In the subsequent proof, the following convention will be used. Let B be any positive real number. [B] will be taken to represent the largest integer which is less than or equal to B. Furthermore, (B) will be defined as (B) = B-[B]. Using this notation, we can express Eq. (54) as

 
 \begin{displaymath}
\lim_{n\to\infty} \{ [n\beta] + ( n\beta)\} \{ 1 - F (a_n x + b_n ) \}
= \beta x^{-a}.\end{displaymath} (55)

Now, since $n \{ 1 - F (a_n x + b_n)\} \to x^{-a}$ for x > 0, it follows that $\lim_{n\to\infty} \{ 1 - F (a_n x + b_n)\} =0$. Hence, since $(n\beta) < 1$,

\begin{displaymath}
\lim_{n\to\infty} (n\beta) \{ 1 - F (a_n x + b_n)\} = 0.\end{displaymath}

Eq. (55) becomes

 
 \begin{displaymath}
\lim_{n\to\infty} [n\beta] \{ 1 - F (a_n x + b_n)\} = \beta x^{-a}.\end{displaymath} (56)

Set $x = z \beta^{1/1}$ in Eq. (56). This yields

 
 \begin{displaymath}
\lim_{n\to \infty} [n\beta] \left\{ 1 - F \left( a_n \beta^{1/1} z +
b_n \right) \right\} = z^{-a}.\end{displaymath} (57)

Since z is a positive real number, the relationship expressed in Eq. (57) is still true if z is replaced with x to give

 
 \begin{displaymath}
\lim_{n\to\infty} [n\beta] \left\{ 1 - F \left( a_n \beta^{1/a} x +
b_n \right) \right\} = x^{-a}.\end{displaymath} (58)

The sequence $\{ [ n\beta]\}$, $n = 1,2,3,\ldots,$ is a subsequence of the positive integers. Hence, by Eq. (53),

 
 \begin{displaymath}
\lim_{n\to\infty} [n\beta] \left\{ 1 - F \left( a_{[n\beta]} x +
b_{[n\beta]} \right) \right\} = x^{-a}.\end{displaymath} (59)

If Eqs. (58) and 59) are simultaneously true, which they are, Theorem 2 requires that as $n \to
\infty$,

\begin{displaymath}
\frac{a_n \beta^{1/a}}{a_{[n\beta]}} \to 1 \quad \text{and} \quad
\frac{b_n - b_{[n\beta]}}{a_{[n\beta]}} \to 0. \end{displaymath}

Hence, as $n \to
\infty$,

 
 \begin{displaymath}
\frac{a_{[n\beta]}}{a_n} \to \beta^{1/a} \quad \text{and} \quad
\frac{b_n-b_{[n\beta]}}{a_{[n\beta]}} \to 0.\end{displaymath} (60)

A subsequence of $\{ [ n\beta]\}$ will be chosen in the following way. Let n be any fixed integer and define the sequence $\{ n_s\}$ by the relationships

\begin{displaymath}
\begin{array}
{r@{~}c@{~}l}
n_1 & = & [n\beta], \\ n_2 & = &...
 ...\beta], \\  & \cdots & \\ n_s & = & [n_{s-1} \beta].\end{array}\end{displaymath}

Now, by Theorem 2, $a_{[n\beta]}$ and $b_{[n\beta]}$can be defined as

\begin{displaymath}
a_{[n\beta]} = a_n \beta^{1/a} \quad \text{and} \quad b_{[n\beta]} =
b_n\end{displaymath}

without affecting the validity of Eq. (59). Suppose that this change of definition is made. Then,

 
 \begin{displaymath}
\begin{array}
{r@{~}c@{~}l@{\quad}l}
a_{n_1} & = & a_{[n\bet...
 ...{1/a} = a_n
\beta^{s/a} & \text{and } b_{n_s} = b_n.\end{array}\end{displaymath} (61)

It follows that

\begin{displaymath}
\lim_{s\to\infty} \frac{b_{n_s} - 0}{s_{n_s}} = \lim_{s\to\infty}
\frac{b_n}{a_n \beta^{s/a}} = 0.\end{displaymath}

Then, by Theorem 2, the constants a'ns = ans and b'ns = 0 still give the convergence in Eq. (59). This relationship becomes (deleting the primes)

 
 \begin{displaymath}
\lim_{s\to\infty} n_s \{ 1 - F (a_{n_s} x ) \} = x^{-a}.\end{displaymath} (62)

By Eq. (61), $a_{n_s} \to \infty$ as $s \to \infty$.Hence, for any value of y sufficiently large, there exists an s value such that for any positive x,

\begin{displaymath}
a_{n_s} x \leq y \leq a_{n_{s+1}} x.\end{displaymath}

Then, by the monotonic properties of F(x),

\begin{displaymath}
1 - F (a_{n_{s+1}} x ) \leq 1 - F (y) \leq 1 - F (a_{n_s} x),\end{displaymath}

and for k > 0,

\begin{displaymath}
1 - F (a_{n_{s+1}} kx) \leq 1-F (ky) \leq 1 - F (a_{n_s} kx).\end{displaymath}

From these two inequalities, it results that

 
 \begin{displaymath}
\frac{1-F (a_{n_{s+1}}x)}{1-F (a_{n_s} kx)} \leq \frac{1 - F...
 ...
F (ky)} \leq \frac{1 - F (a_{n_s} x)}{1 - F (a_{n_{s+1}} kx)}.\end{displaymath} (63)

By definition of ns,

\begin{displaymath}
n_{s+1} = [n_s \beta] = n_s \beta - (n_s \beta),\end{displaymath}

where $0 \leq (n_s \beta) \leq 1$. As a consequence,

 
 \begin{displaymath}
\lim_{s\to\infty} \frac{n_{s+1}}{n_s} = \lim_{s\to\infty}
\frac{n_s\beta - (n_s \beta)}{n_s} = \beta.\end{displaymath} (64)

From (62), (63), and (64),

\begin{displaymath}
\frac{n_{s+1} \{ 1 - F (a_{n_{s+1}} x ) \}}{n_s \{ 1 - F (a_...
 ...}}{n_{s+1} \{ 1 - F ( a_{n_{s+1}} kx)\}} \
\frac{n_{s+1}}{n_s} \end{displaymath}

or in the limit as $s \to \infty$,

\begin{displaymath}
\frac{k^a}\beta = \frac{x^{-a}}{(kx)^{-a}} \ \frac1\beta \le...
 ...)}{1 - F (ky)} \leq \frac{x^{-a}}{(kx)^{-a}} \beta = k^a \beta.\end{displaymath}

But, since $\beta$ was arbitrary, $\beta \gt 1$, it follows that $\beta$can be chosen as close to 1.0 as is wished. Hence,

\begin{displaymath}
\lim_{y\to\infty} \frac{1-F(y)}{1-F(ky)} = k^a.\end{displaymath}

The change from $s \to \infty$ to $y \to \infty$ is permissible since

\begin{displaymath}
a_{n_s} x \leq y \leq a_{n_{s+1}} x,\end{displaymath}

and for any fixed x, $y \to \infty$ as $a_{n_s} \to \infty$ with $s \to \infty$.



 
Next: Corollary 13 Up: The Asymptotic Frequency Distribution Previous: Theorem 12

Leon Borgman
3/10/1998