Extreme Value Distribution Project

1 Cumulative distribution functions

Definition 1.1
#

A function \(F \colon \mathbb {R}\to \mathbb {R}\) is a cumulative distribution function (c.d.f.) if

  1. \(x \mapsto F(x)\) is increasing;

  2. \(x \mapsto F(x)\) is right-continuous;

  3. \(\lim _{x \to -\infty } F(x) = 0\) and \(\lim _{x \to +\infty } F(x) = 1\).

Lemma 1.2
#

If \(X\) is a real-valued random variable, then the function \(F \colon \mathbb {R}\to \mathbb {R}\) given by \(F(x) = \mathsf{P}\big[ X \le x \big]\) is a c.d.f.

Proof

Property (1.) in Definition 1.1 is obvious (by monotonicity of measures) and properties (2.) and (3.) are simple consequences of monotone convergence theorems for probability measures.

1.1 Degenerate distributions

Definition 1.3

A c.d.f. \(F\) is said to be degenerate if for every \(x \in \mathbb {R}\) we have either \(F(x) = 0\) or \(F(x) = 1\). Otherwise \(F\) is said to be nondegenerate.

Lemma 1.4

\(F\) is a degenerate c.d.f. if and only if there exists a \(x_0 \in \mathbb {R}\) such that

\begin{align*} F(x) = \begin{cases} 0 & \text{ for } x {\lt} x_0 \\ 1 & \text{ for } x \ge x_0 . \end{cases}\end{align*}
Proof

The “if” direction is clear. To prove the “only if” direction, assume that \(F\) is a degenerated c.d.f., and let \(x_0 = \inf \left\{ x \in \mathbb {R}\; \big| \; F(x) = 1 \right\} \). Then it is straightforward to show by properties of a c.d.f. that \(F\) has the asserted form.

The c.d.f. of Dirac delta mass \(\delta _{x_0}\) at \(x_0 \in \mathbb {R}\) is degenerate.

Proof

If a c.d.f. \(F\) is degenerate, then it is the c.d.f. of a Dirac delta mass \(\delta _{x_0}\) at some point \(x_0 \in \mathbb {R}\).

Proof

1.2 Distributions of maxima of independent random variables

Lemma 1.7

Let \(X\) and \(Y\) be two independent real-valued random variables with respective cumulative distribution functions \(F\) and \(G\), i.e. \(F(x) = \mathsf{P}\big[ X \le x \big]\) and \(G(x) = \mathsf{P}\big[ Y \le x \big]\). Then the c.d.f. of \(M = \max (X, Y)\) is \(x \mapsto F(x) \, G(x)\).

Proof

Fix \(x \in \mathbb {R}\). Note that \(\max (X, Y) \le x\) if and only if both \(X \le x\) and \(Y \le x\). Calculate, using independence,

\begin{align*} \mathsf{P}\big[ \max (X, Y) \le x \big] \; = \; \mathsf{P}\big[ X \le x \, \; Y \le x \big] \; = \; \mathsf{P}\big[ X \le x \big] \; \mathsf{P}\big[ Y \le x \big] \; = \; F(x) \, G(x) . \end{align*}
Lemma 1.8

Let \(X_0, X_1, \ldots , X_{n-1}\) be independent identically distributed real-valued random variables with cumulative distribution functions \(F\), i.e. \(F(x) = \mathsf{P}\big[ X_j \le x \big]\) for every \(j\). Then the c.d.f. of

\[ M_n = \max _{0 \le j {\lt} n} X_j \]

is the function \(x \mapsto \big(F(x)\big)^n\).

Proof

Induction on \(n\) using 1.7.

Lemma 1.9

Let \(X_0, X_1, \ldots , X_{n-1}\) be independent identically distributed real-valued random variables with cumulative distribution functions \(F\), i.e. \(F(x) = \mathsf{P}\big[ X_j \le x \big]\) for every \(j\), and let \(a {\gt} 0\) and \(b \in \mathbb {R}\). Then the c.d.f. of

\begin{align*} \hat{M}_n = \frac{\max _{0 \le j {\lt} n} X_j - b}{a} \end{align*}

is the function \(x \mapsto \big(F(a x + b)\big)^n\).

Proof

Use 1.8 and do a change of variables.

1.3 Distributions of minima of independent random variables

1.4 Equivalence classes modulo affine transformations

Definition 1.10
#

The collection of all transformations \(\mathbb {R}\to \mathbb {R}\) of the form \(x \mapsto a x + b\), where \(a{\gt}0\), \(b \in \mathbb {R}\), forms a group. We call this the orientation preserving affine isomorphism group and denote it by \(\mathrm{Aff}^+_{\mathbb {R}}\).

Definition 1.11

The action of an orientation preserving affine isomorphism \(A \in \mathrm{Aff}^+_{\mathbb {R}}\) on a cumulative distribution function \(F\) is defined so that \(A.F \colon \mathbb {R}\to \mathbb {R}\) is given by \((A.F)(x) = F(A^{-1}(x))\). Then \(A.F\) is also a c.d.f.

The actions of orientation preserving affine isomorphisms on a cumulative distribution functions is a group action, i.e., \(1.F = F\) and \((AB).F = A.(B.F)\) for any c.d.f. \(F\) and any \(A,B \in \mathrm{Aff}^+_{\mathbb {R}}\).

Proof

Direct calculations.

Let \(F\) be a cumulative distribution function and \(A \in \mathrm{Aff}^+_{\mathbb {R}}\) an orientation preserving affine isomorphism. Then \(A.F\) is degenerate if and only if \(F\) is degenerate.

Proof

Straightforward from the definitions.

Let \(F\) be a cumulative distribution function, and \(A \in \mathrm{Aff}^+_{\mathbb {R}}\) an orientation preserving affine isomorphism. If a point \(x \in \mathbb {R}\) is a continuity point of \(F\), then the point \(A(x) \in \mathbb {R}\) is a continuity point of \(A.F\).

Proof

Straightforward.

1.5 Miscellaneous results on cumulative distribution functions

Lemma 1.15 Continuity points of c.d.f.s are those which carry no point mass

Let \(F\) be cumulative distribution function of a probability measure \(\mu \) on \(\mathbb {R}\). A point \(x \in \mathbb {R}\) is a continuity point of \(F\) if and only if \(\mu [\left\{ x \right\} ] = 0\).

Proof

A c.d.f. is always continuous from the right.

Continuity of \(F\) from the left at \(x\) means that for any sequence \((x_n)_{n \in \mathbb {N}}\) increasing to \(x\) (i.e., \(x_n \le x_{n+1} {\lt} x\) for all \(n \in \mathbb {N}\))

\begin{align*} F(x_n) \to F(x) , \end{align*}

or equivalently in terms of measures

\begin{align*} \mu \big[ (-\infty ,x_n] \big] \to \mu \big[ (-\infty ,x] \big] . \end{align*}

But by monotone convergence of measures, we always have

\begin{align*} \mu \big[ (-\infty ,x_n] \big] \to \; & \mu \big[ (-\infty ,x) \big] \\ = \; & \mu \big[ (-\infty ,x] \big] - \mu [\left\{ x \right\} ] . \end{align*}

A comparison of these conditions shows that \(F\) is also continuous from the left at \(x\) if and only if \(\mu [\left\{ x \right\} ] = 0\).

Lemma 1.16 A pair of nontrivial continuity points of nondegenerate c.d.f.

Let \(G\) be a nondegenerate c.d.f. Then there exists continuity points \(x_1 {\lt} x_2\) of \(G\) such that \(0 {\lt} G(x_1) \le G(x_2) {\lt} 1\).

Proof

Since \(G\) is nondegenerate, there exists some \(x_0 \in \mathbb {R}\) such that \(0 {\lt} G(x_0) {\lt} 1\). Since \(G\) is continuous from the right, for some small \(\delta {\gt} 0\) we have that \(0 {\lt} G(x) {\lt} 1\) for all \(x \in [x_0,x_0+\delta )\). Since the continuity points of \(G\) are dense, from any nonempty open interval we may pick a continuity point. First pick a continuity point \(x_1 \in (x_0,x_0+\delta )\), and then pick another continuity point \(x_2 \in (x_1,x_0+\delta )\).

Lemma 1.17 Equality of c.d.f.s on a dense set suffices

Suppose that \(F,G\) are two c.d.f.s and \(S \subseteq \mathbb {R}\) is a dense subset of the real line. If \(F(\xi ) = G(\xi )\) for all \(\xi \in S\), then we have \(F = G\).

Proof

We must prove that for any \(x \in \mathbb {R}\) we have \(F(x) = G(x)\). But by right-continuity of c.d.f.s, density of \(S\), and coincidence of \(F\) and \(G\) on \(S\), we have

\begin{align*} F(x) = \; & \lim _{\xi \to x^+ \text{ along $S$}} F(\xi ) \\ = \; & \lim _{\xi \to x^+ \text{ along $S$}} G(\xi ) = \, G(x) . \end{align*}

1.6 Topology on orientation-preserving affine isomorphisms

Definition 1.18
#

We equip the space \(\mathrm{Aff}^+_{\mathbb {R}}\) of orientation-preserving affine isomorphisms with the topology of pointwise convergence, i.e., with the coarsest topology which makes the evaluations \(A \mapsto A(x)\) continuous for all \(x \in \mathbb {R}\).

Lemma 1.19 The coefficients of affine map depend continuously on the map

The coefficients \(a\) and \(b\) of an orientation-preserving affine isomorphism \(A(x) = a x + b\) depend continuously on \(A\).

Proof

We may first write \(a = A(1) - A(0)\) and \(b = A(0)\). These depend continuously on \(A\), since the evaluations \(A(1)\) and \(A(0)\) do.

Lemma 1.20 Metrizability of the topology on oriented affine isomorphisms

The topology of pointwise convergence makes \(\mathrm{Aff}^+_{\mathbb {R}}\) homeomorphic to \(\mathbb {R}^2\), and in particular metrizable.

Proof

The essential claim is that the function

\begin{align*} \mathrm{cfs} \colon \mathrm{Aff}^+_{\mathbb {R}}\to (0,+\infty ) \times \mathbb {R}\end{align*}

obtained by mapping \(A(x) = a x + b\) to its coefficients \((a,b)\) is a homeomorphism. (The homeomorphism to \(\mathbb {R}^2 = \mathbb {R}\times \mathbb {R}\) follows by combining with the homeomorphism \((a,b) \mapsto (\log a, b)\).)

The continuity of \(\mathrm{cfs}\) follows from Lemma 1.19. For the continuity of the inverse, we must only check that for any \(x \in \mathbb {R}\), its composition with the point evaluation at \(x\) is continuous. But the composition is \((a,b) \mapsto a x + b\), and the continuity is clear.

Lemma 1.21 Inversion of orientation preserving affine isomorphisms is continuous

The map \(A \mapsto A^{-1}\) is continuous on \(\mathrm{Aff}^+_{\mathbb {R}}\). In particular, inversion defines a homeomorphism of \(\mathrm{Aff}^+_{\mathbb {R}}\) to itself.

Proof

Calculate and use Lemma 1.19.

Lemma 1.22 The action of oriented affine transforms on c.d.f.s is continuous

The action \(A . F\) of \(A \in \mathrm{Aff}^+_{\mathbb {R}}\) on a c.d.f \(F\) depends jointly continuously on \(A\) and \(F\).

(The topology on c.d.f.s is the topology of convergence in distribution, i.e., convergence at all continuity points of the limit cdf.)

Proof

The spaces are metrizable, so it suffices to check sequential continuity.

Suppose that \(A_n \to B\) (oriented affine isomophisms) and \(F_n \overset {\mathrm{d}}{\longrightarrow }G\) (c.d.f.s) as \(n \to \infty \). Let \(x \in \mathbb {R}\) be a continuity point of \(B.G\). Let \(\varepsilon {\gt} 0\). Note that \(B^{-1}(x)\) is a continuity point of \(G\). Then there exists a \(\delta {\gt} 0\) such that \(|G(y) - G\big(B^{-1}(x)\big)| {\lt} \frac{\varepsilon }{2}\) when \(|y-B^{-1}(x)|{\lt}\delta \).

By density of continuity points of \(G\), pick continuity points \(y_-,y_+\) such that

\begin{align*} B^{-1}(x)-\delta \; {\lt} \; y_- \; {\lt} \; B^{-1}(x) \; {\lt} \; y_+ \; {\lt} \; B^{-1}(x)+\delta . \end{align*}

Since \(F_n \overset {\mathrm{d}}{\longrightarrow }G\), we have that \(F_n(y_\pm ) \to G(y_\pm )\) as \(n \to \infty \), and in particular there exists some \(N\) such that for \(n \ge N\) we have \(\big| F_n(y_\pm ) - G(y_\pm ) \big| {\lt} \frac{\varepsilon }{4}\) for both \(y_\pm \).

By Lemma 1.21 and \(A_n \to B\), we get that \(A_n^{-1} \to B^{-1}\), and in particular there exists some \(N'\) such that for \(n \ge N'\) we have

\begin{align*} y_- {\lt} A_n^{-1}(x) {\lt} y_+ . \end{align*}

For \(n \ge \max \left\{ N,N' \right\} \), we then have

\begin{align*} (A_n.F_n)(x) \; = \; & F_n \big( A_n^{-1}(x) \big) \\ \le \; & F_n (y_+) \\ {\lt} \; & G(y_+) + \frac{\varepsilon }{4} \\ \le \; & G \big( B^{-1}(x) \big) + \frac{\varepsilon }{2} + \frac{\varepsilon }{4} \\ = \; & (B.G) (x) + \frac{3\varepsilon }{4} \\ {\lt} \; & (B.G) (x) + \varepsilon \end{align*}

and similarly

\begin{align*} (A_n.F_n)(x) \; = \; & F_n \big( A_n^{-1}(x) \big) \\ \ge \; & F_n (y_-) \\ {\gt} \; & G(y_-) - \frac{\varepsilon }{4} \\ \ge \; & G \big( B^{-1}(x) \big) - \frac{\varepsilon }{2} - \frac{\varepsilon }{4} \\ = \; & (B.G) (x) - \frac{3\varepsilon }{4} \\ {\gt} \; & (B.G) (x) + \varepsilon , \end{align*}

which together yield \(\big| (A_n.F_n)(x) - (B.G)(x) \big| {\lt} \varepsilon \).

Since \(x\) was an arbitrary continuity point of \(B.G\) and \(\varepsilon {\gt} 0\) was arbitrary, this proves that \(A_n.F \overset {\mathrm{d}}{\longrightarrow }B.G\).