What does Joining Genealogies and the Perpetual Clan Estate conclude, in numbers, about “The Classics Examined: Fan Zhongyan's Rules for the Charitable Estate and the Extinction Problem of Galton and Watson”?
Answer: Panel C: with a mean of exactly one son, extinction is certain but slow. At the tenth generation a line still has a chance of 0.1582 of surviving, against 0.2000 from the asymptotic formula; at the fiftieth, 0.0376 against 0.0400; at the hundredth, 0.0194 against 0.0200; at the two hundredth, 0.0098 against 0.0100. In the critical case extinction is certain but takes very many generations.
Scope of the numbers: All data are synthetic or illustrative, all calculations come from its programs, and it is general analysis, not legal, financial or business advice; it compares no lineages or ethnic groups. Marked boxes separate published evidence, runnable Python calculations (20 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.0098, 0.0100, 0.0194, 0.0200, 0.0376, 0.0400
| A. Lotka fit: masses sum to 1.00015 | |
| roots of f(s) = s | 0.8193 and 0.9994 |
| iterating from 0 after 5, 20, 60 steps | 0.7560 0.8177 0.8193 |
| B. of 100 surnames, expected number still borne | |
| generation | 1 3 5 10 20 60 |
| surnames | 51.8 30.7 24.4 19.7 18.2 18.1 |
| limit | 18.1 by the smallest root, 0 by Watson's reading |
| C. critical Poisson line (mean 1): survive to generation n | |
| n | 10: 0.1582 2 / n = 0.2000 |
| n | 50: 0.0376 2 / n = 0.0400 |
| n | 100: 0.0194 2 / n = 0.0200 |
| n | 200: 0.0098 2 / n = 0.0100 |
Show the full program
# Chapter 7. p72: the root Watson chose, and the root that is right.
# Model: Watson (1875) noted that s = 1 always solves f(s) = s and
# concluded that every surname dies out. The extinction probability is
# the smallest root in [0, 1], reached by iterating s <- f(s) from 0
# (Bienayme 1845 had the correct statement; see Heyde and Seneta 1972).
# Lotka's (1931) fit f(s) = 0.4825 + 0.2126 s / (1 - 0.5893 s) turns
# f(s) = s into C s^2 - (1 + P0 C - B) s + P0 = 0. The fit's masses sum
# to slightly more than 1, so its upper root sits just below 1. For a
# critical Poisson law (mean 1) extinction is certain but slow; the
# survival chance to generation n is compared with Kolmogorov's 2 / n.
import math
B, C, P0 = 0.2126, 0.5893, 0.4825
def f(s):
return P0 + B * s / (1.0 - C * s)
if __name__ == "__main__":
a, b, c = C, -(1.0 + P0 * C - B), P0
disc = math.sqrt(b * b - 4.0 * a * c)
roots = sorted(((-b - disc) / (2 * a), (-b + disc) / (2 * a)))
print("A. Lotka fit: masses sum to {:.5f}".format(P0 + B / (1 - C)))
print(" roots of f(s) = s: {:.4f} and {:.4f}".format(*roots))
s, path = 0.0, []
for _ in range(60):
s = f(s)
path.append(s)
print(" iterating from 0 after 5, 20, 60 steps: {:.4f} {:.4f} {:.4f}"
.format(path[4], path[19], path[59]))
print("B. of 100 surnames, expected number still borne")
print(" generation:", " ".join("{:>5}".format(n)
for n in (1, 3, 5, 10, 20, 60)))
print(" surnames: ", " ".join("{:>5.1f}".format(
100 * (1.0 - path[n - 1])) for n in (1, 3, 5, 10, 20, 60)))
print(" limit: {:.1f} by the smallest root, 0 by Watson's reading"
.format(100 * (1.0 - roots[0])))
print("C. critical Poisson line (mean 1): survive to generation n")
s = 0.0
surv = {}
for n in range(1, 201):
s = math.exp(s - 1.0)
surv[n] = 1.0 - s
for n in (10, 50, 100, 200):
print(" n = {:>3}: {:.4f} 2 / n = {:.4f}".format(
n, surv[n], 2.0 / n))Single source and citation
Fan, Y. (2026). Genealogical DAG Merge Algorithms, Generation-Poem Congruence Coding and the Institutional Economics of the Fan Clan Charitable Estate (Version 1.0.0), Chapter 7: The Classics Examined: Fan Zhongyan's Rules for the Charitable Estate and the Extinction Problem of Galton and Watson. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-334 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026334,
author = {Fan, Yafu},
title = {Genealogical DAG Merge Algorithms, Generation-Poem Congruence Coding and the Institutional Economics of the Fan Clan Charitable Estate},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Same Name, Same Generation: Collisions Are Far Commoner Than They Look
- Chapter 2 · Keeping a Ledger of Likelihood Ratios: Two Thresholds and a Review Zone
- Chapter 3 · A Lineage Is a Directed Acyclic Graph: Topological Sorting and Cycle Detection
- Chapter 4 · The Generation Poem Is a Congruence Code: Dropped Generations, Extra Generations and Collisions Across Cycles
- Chapter 5 · Going to the Southern Seas Was Chain Migration: Branching Processes and the Crowding of Ports
- Chapter 6 · The Perpetual Charitable Estate: Extinction Probabilities, a Ration Ledger and the Risk of Governance
- Chapter 8 · The Quarterly Merge Check-up: Procedure, Distilled Tool and Pre-registered Refutation