What does Extreme Tails and Chargeback Reserves conclude, in numbers, about “Classical Sources East and West: "Treading on Frost, Hard Ice Comes" and the Extreme-Value Laws of Fisher and Tippett”?

Answer: Chapter 7 examines "treading on frost, hard ice comes" from Kun in the Book of Changes (on a heavy tail the chance of doubling once past a threshold is about one in five) and the extreme-value laws of Fisher and Tippett of 1928 (the normal maximum is still 0.0109 from its limit with a hundred thousand draws).

Scope of the numbers: Chapter 5 chooses the threshold with the mean excess plot and 150 simulated shops; the log error of the ten-year level is smallest at the ninetieth percentile, at 0.194. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.0109

Kolmogorov gap between max-of-n and its limit
parent -> limit10100100010000100000
exponential -> Gumbel0.02800.00270.00030.00000.0000
Burr XII -> Frechet 2.50.03640.00500.00090.00010.0000
uniform -> Weibull0.02800.00270.00030.00000.0000
normal -> Gumbel0.05220.02720.01820.01370.0109
Show the full program
# Chapter 7. p72: Fisher and Tippett's three limits, and how slowly the
# normal gets there.
# Model: exact law of the largest of n draws, F(a_n x + b_n) ** n, set
# against its limit (Fisher and Tippett 1928): exponential parent ->
# Gumbel exp(-exp(-x)); the illustrative Burr XII order law (b = 200,
# c = 2, k = 1.25) -> Frechet exp(-x ** -2.5); uniform -> reversed
# Weibull exp(x) for x < 0; standard normal -> Gumbel, with b_n the
# 1 - 1/n quantile and a_n = 1 / (n phi(b_n)). We print the largest
# gap (Kolmogorov distance) on a fine grid for n = 10 to 100,000.

import math
from statistics import NormalDist

ND = NormalDist()
B, C, K = 200.0, 2.0, 1.25


def burr_q(p):
    return B * ((1.0 - p) ** (-1.0 / K) - 1.0) ** (1.0 / C)


def burr_logcdf(x):
    return math.log1p(-(1.0 + (x / B) ** C) ** (-K))


def norm_logcdf(x):
    return math.log1p(-0.5 * math.erfc(x / math.sqrt(2.0)))


def gap(n, logcdf, limit, grid):
    d = 0.0
    for x in grid:
        lc = logcdf(n, x)
        exact = math.exp(n * lc) if lc > -1e300 else 0.0
        d = max(d, abs(exact - limit(x)))
    return d


g_gum = [-3.0 + 0.0065 * i for i in range(2001)]
g_fre = [0.05 * math.exp(0.0035 * i) for i in range(2001)]
g_wei = [-8.0 + 0.004 * i for i in range(2000)]


def exp_lc(n, x):
    y = x + math.log(n)
    return math.log1p(-math.exp(-y)) if y > 0 else -1e301


def burr_lc(n, x):
    return burr_logcdf(burr_q(1.0 - 1.0 / n) * x)


def unif_lc(n, x):
    y = 1.0 + x / n
    return math.log(y) if y > 0 else -1e301


def norm_lc(n, x):
    bn = ND.inv_cdf(1.0 - 1.0 / n)
    an = 1.0 / (n * ND.pdf(bn))
    return norm_logcdf(an * x + bn)


cases = (("exponential -> Gumbel", exp_lc,
          lambda x: math.exp(-math.exp(-x)), g_gum),
         ("Burr XII -> Frechet 2.5", burr_lc,
          lambda x: math.exp(-x ** -2.5), g_fre),
         ("uniform -> Weibull", unif_lc, math.exp, g_wei),
         ("normal -> Gumbel", norm_lc,
          lambda x: math.exp(-math.exp(-x)), g_gum))
NS = (10, 100, 1000, 10000, 100000)
print("Kolmogorov gap between max-of-n and its limit")
print("  parent -> limit         " + "".join("%9d" % n for n in NS))
for name, lc, lim, grid in cases:
    print("  %-24s" % name + "".join("%9.4f" % gap(n, lc, lim, grid)
                                     for n in NS))

Single source and citation

Fan, Y. (2026). Extreme-Value Theory and Generalised Pareto Tails: Whale-Order Ceilings and Reserves for Extreme Chargebacks (Version 1.0.0), Chapter 7: Classical Sources East and West: "Treading on Frost, Hard Ice Comes" and the Extreme-Value Laws of Fisher and Tippett. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-244 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026244,
  author    = {Fan, Yafu},
  title     = {Extreme-Value Theory and Generalised Pareto Tails: Whale-Order Ceilings and Reserves for Extreme Chargebacks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book