What does Anti-Collapse Engineering with Two Anchors conclude, in numbers, about “The Tails Die First: Generational Extinction in a Discrete Law and the Absorbing States of Wright–Fisher”?
Answer: Program p21 shows that a single round of finite sampling deletes a large stretch of the tail: with 1000 draws per generation, the Zipf list of 1000 categories is expected to lose 666.3 of them, the tail loses 0.8254 of its own mass, and the head is practically untouched. Program p22 uses the exact transition matrix to show that a single category is eventually lost with probability one minus its initial share, and that the end point of the feedback chain is a point mass. Program p23 shows the two-phase decline of a whole list, from the tails dying first to the head categories swallowing each other. Since collapse comes from treating the output of the previous generation as the whole training set, a natural question follows: what if old data are not thrown away, and the output of every generation is accumulated instead? The next chapter tests this contrary evidence, put forward by Gerstgrasser and colleagues.
Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs, which call no model interface and use no reader's or customer's data. Marked boxes separate published evidence, runnable Python calculations (22 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.8254, 1000, 666.3
| K | 1000, harmonic H = 7.4855, p_1 = 0.13359, p_K = 0.0001336 |
| N lost_cats lost_mass head_lost tail_lost tail_mass | |
| 1000 | 666.3 0.2091 0.000002 415.8 0.8254 |
| 3000 | 389.1 0.0937 0.000000 288.7 0.5648 |
| 10000 | 91.8 0.0171 0.000000 83.8 0.1564 |
| 100000 | 0.0 0.0000 0.000000 0.0 0.0000 |
| tail share of mass (ranks 501-1000) | 0.0925 |
| N | 1000: expected count drops below 1 at rank 134 |
| N | 3000: expected count drops below 1 at rank 401 |
Show the full program
# Chapter 2. p21: what one resampling generation deletes from a tail.
# Model: a Zipf law over K = 1000 categories, p_i proportional to 1/i
# (an illustrative stand-in for a vocabulary or a set of rare facts).
# One generation draws N items; category i is absent with probability
# (1 - p_i)^N, exactly. We report the expected number of categories
# that vanish, the probability mass they carry, and the same split
# into the head (ranks 1-10) and the tail (ranks 501-1000).
import math
K = 1000
H = math.fsum(1.0 / i for i in range(1, K + 1))
P = [1.0 / (i * H) for i in range(1, K + 1)]
def lost(n_draw, lo, hi):
ps = P[lo - 1:hi]
cats = math.fsum((1.0 - p) ** n_draw for p in ps)
mass = math.fsum(p * (1.0 - p) ** n_draw for p in ps)
return cats, mass
print("K = %d, harmonic H = %.4f, p_1 = %.5f, p_K = %.7f"
% (K, H, P[0], P[-1]))
print("N lost_cats lost_mass head_lost tail_lost tail_mass")
tail_total = math.fsum(P[500:])
for n_draw in (1000, 3000, 10000, 100000):
cats, mass = lost(n_draw, 1, K)
head, _ = lost(n_draw, 1, 10)
tail, tmass = lost(n_draw, 501, K)
print("%-8d %-10.1f %-10.4f %-10.6f %-10.1f %.4f" % (
n_draw, cats, mass, head, tail, tmass / tail_total))
print("tail share of mass (ranks 501-1000): %.4f" % tail_total)
for n_draw in (1000, 3000):
rank = min(i for i in range(1, K + 1) if n_draw * P[i - 1] < 1.0)
print("N = %d: expected count drops below 1 at rank %d"
% (n_draw, rank))Single source and citation
Fan, Y. (2026). Anti-Collapse Engineering with Two Anchors of Truth: the Variance-Collapse Rate of Self-Generated Training Data and Immunity through Standard-Library Recomputation and Textual Collation (Version 1.0.0), Chapter 2: The Tails Die First: Generational Extinction in a Discrete Law and the Absorbing States of Wright–Fisher. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-265 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026265,
author = {Fan, Yafu},
title = {Anti-Collapse Engineering with Two Anchors of Truth: the Variance-Collapse Rate of Self-Generated Training Data and Immunity through Standard-Library Recomputation and Textual Collation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Variance Collapsing Generation by Generation: the Expectation Formula of a Gaussian Feedback Chain and Almost-Sure Extinction
- Chapter 3 · Replace or Accumulate: the Counter-Evidence of Gerstgrasser and the Bound of pi^2/6
- Chapter 4 · The Threshold of Mixing in Real Sources: How Much Variance a Fixed Share Preserves, and How Much of the Tail It Misses
- Chapter 5 · Examining for Collapse: Why Inward-Looking Metrics Go Blind, and How Much Data an Outward-Looking Anchor Needs
- Chapter 6 · The First Anchor: Standard-Library Recomputation, Deterministic Fingerprints and the Correlated Failure of Two Anchors
- Chapter 7 · The Classics Examined: Duan Yucai on "the Difficulty of Settling Right and Wrong" and Erasmus's Return to the Original in 1516
- Chapter 8 · The Empirical Loop: a Two-Anchor Procedure for Every Volume, the Feedback Collapse Rate Calculator and a Pre-Registered Test