Math 2.0

Probability theory and stochastic processes Limit theorems Theorem

Fisher–Tippett–Gnedenko theorem

Builds on Independent and identically distributed random variablesCumulative distribution functionConvergence in distributionExponential distribution

Statement

Let X1,X2,…X_1, X_2, \dots be i.i.d. real random variables, and let Mn=max⁡(X1,…,Xn)M_n = \max(X_1, \dots, X_n). Assume that there are constants an>0a_n > 0 and bn∈ℝb_n \in \R such that (Mn−bn)/an(M_n - b_n) / a_n converges in distribution to a random variable YY. Assume that the law of YY is not concentrated at one point. Let GG be the cumulative distribution function of YY. Then there are a>0a > 0 and b∈ℝb \in \R such that x↦G(ax+b)x \mapsto G(ax + b) is one of the following three functions:

  1. the Gumbel distribution function Λ(x)=exp⁡(−e−x)\Lambda(x) = \exp(-e^{-x}) for x∈ℝx \in \R;
  2. a Fréchet distribution function Φα(x)=exp⁡(−x−α)\Phi_\alpha(x) = \exp(-x^{-\alpha}) for x>0x > 0 and Φα(x)=0\Phi_\alpha(x) = 0 for x≤0x \le 0, for some α>0\alpha > 0;
  3. a reversed Weibull distribution function Ψα(x)=exp⁡(−(−x)α)\Psi_\alpha(x) = \exp(-(-x)^{\alpha}) for x≤0x \le 0 and Ψα(x)=1\Psi_\alpha(x) = 1 for x>0x > 0, for some α>0\alpha > 0.

Remarks

The three families combine into the generalised extreme value distributions Gξ(x)=exp⁡(−(1+ξx)−1/ξ)G_\xi(x) = \exp\left(-(1 + \xi x)^{-1/\xi}\right) for 1+ξx>01 + \xi x > 0, with G0=ΛG_0 = \Lambda as the limit case ξ→0\xi \to 0. The sign of ξ\xi gives the type: ξ>0\xi > 0 is Fréchet, ξ=0\xi = 0 is Gumbel, and ξ<0\xi < 0 is reversed Weibull.

Idea of the proof. If FF is the distribution function of X1X_1, then P(Mn≤anx+bn)=F(anx+bn)nP(M_n \le a_n x + b_n) = F(a_n x + b_n)^n. Comparing the limits along nn and nknk shows that GG is max-stable: for each k≥1k \ge 1 there are αk>0\alpha_k > 0 and βk\beta_k with G(x)k=G(αkx+βk)G(x)^k = G(\alpha_k x + \beta_k). Solving this functional equation gives the three families.

Example: let the XkX_k be exponential with rate 11, so F(x)=1−e−xF(x) = 1 - e^{-x} for x≥0x \ge 0. Then P(Mn−log⁡n≤x)=(1−e−x/n)n→exp⁡(−e−x)P(M_n - \log n \le x) = (1 - e^{-x}/n)^n \to \exp(-e^{-x}) for every xx, so the Gumbel law appears with an=1a_n = 1 and bn=log⁡nb_n = \log n.

The hypothesis that a non-degenerate limit exists is needed. For some laws, such as the geometric and the Poisson distributions, no choice of ana_n and bnb_n gives a non-degenerate limit.

Going deeper

For a student

The theorem plays for maxima the role that the central limit theorem plays for sums. The set of laws whose maxima converge to a given type is its domain of attraction, and Gnedenko characterised these domains through conditions on the tail 1−F1 - F. In statistics one fits the generalised extreme value family to block maxima of data.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convergence in distribution concept
  2. Cumulative distribution function concept
  3. Exponential distribution concept
  4. Independent and identically distributed random variables concept
  5. Fisher–Tippett–Gnedenko theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Fisher%E2%80%93Tippett%E2%80%93Gnedenko_theorem
About this page
TagY3Z99461HJ
URIm2://Y3Z99461HJ
Kindstatement, theorem
WritingW0 stub
MSC60G70, 60F05
StatusThis copy of the site has no build data. Run m2 status Y3Z99461HJ.
AboutCumulative distribution function, Convergence in distribution
UsesIndependent and identically distributed random variables, Cumulative distribution function, Convergence in distribution, Exponential distribution
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.