What does Joining Genealogies and the Perpetual Clan Estate conclude, in numbers, about “The Perpetual Charitable Estate: Extinction Probabilities, a Ration Ledger and the Risk of Governance”?
Answer: Chapter 6 computes extinction and a ration ledger for the estate: with 1.2604 sons per man a single line still dies out with probability 0.8193, and with population growing at 0.00442 a year the headroom lasts 47.6 years; it also compares Ostrom's eight principles.
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.8193, 1.2604
| A. Lotka 1931 fit: mean sons per man 1.2604 | |
| extinct by generation 1, 2, 5, 10, 20 | 0.4825 0.6258 0.7560 0.8031 0.8177 |
| ultimate extinction q | 0.8193; survival 0.1807 |
| B. Poisson offspring, sensitivity | |
| mean q extinct by gen 10 by gen 20 | |
| 1.00 | 1.0000 0.8418 0.9124 |
| 1.05 | 0.9063 0.7977 0.8612 |
| 1.10 | 0.8239 0.7507 0.8024 |
| 1.20 | 0.6863 0.6547 0.6821 |
| 1.50 | 0.4172 0.4151 0.4172 |
| C. a clan of k founding lines (Lotka q) | |
| k | 1: all lines extinct 0.8193 |
| k | 5: all lines extinct 0.3690 |
| k | 10: all lines extinct 0.1362 |
| k | 30: all lines extinct 0.0025 |
| k | 90: all lines extinct 0.0000 |
Show the full program
# Chapter 6. p61: how often a single male line dies out.
# Model: Galton-Watson process. With offspring generating function f,
# the chance that a line is extinct by generation n is f^n(0), and the
# ultimate extinction probability q is the smallest root of f(s) = s.
# Lotka (1931) fitted sons per man in the 1920 United States census by
# p0 = 0.4825 and p_k = 0.2126 * 0.5893^(k-1) for k >= 1, so
# f(s) = 0.4825 + 0.2126 s / (1 - 0.5893 s). Poisson offspring
# f(s) = exp(mu (s - 1)) is shown for a range of means as sensitivity.
# A clan of k independent founding lines dies out with chance q^k.
import math
B, C, P0 = 0.2126, 0.5893, 0.4825
def lotka(s):
return P0 + B * s / (1.0 - C * s)
def poisson(mu):
return lambda s: math.exp(mu * (s - 1.0))
def iterate(f, n):
s = 0.0
out = []
for _ in range(n):
s = f(s)
out.append(s)
return out
def root(f):
return iterate(f, 4000)[-1]
if __name__ == "__main__":
mean = B / (1.0 - C) ** 2
print("A. Lotka 1931 fit: mean sons per man {:.4f}".format(mean))
path = iterate(lotka, 20)
print(" extinct by generation 1, 2, 5, 10, 20:",
" ".join("{:.4f}".format(path[n - 1]) for n in (1, 2, 5, 10, 20)))
q = root(lotka)
print(" ultimate extinction q = {:.4f}; survival {:.4f}".format(
q, 1.0 - q))
print("B. Poisson offspring, sensitivity")
print(" mean q extinct by gen 10 by gen 20")
for mu in (1.0, 1.05, 1.1, 1.2, 1.5):
f = poisson(mu)
p = iterate(f, 20)
print(" {:>5.2f} {:.4f} {:>17.4f} {:>9.4f}".format(
mu, root(f) if mu > 1.0 else 1.0, p[9], p[19]))
print("C. a clan of k founding lines (Lotka q)")
for k in (1, 5, 10, 30, 90):
print(" k = {:>2}: all lines extinct {:.4f}".format(k, q ** k))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 6: The Perpetual Charitable Estate: Extinction Probabilities, a Ration Ledger and the Risk of Governance. 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 7 · The Classics Examined: Fan Zhongyan's Rules for the Charitable Estate and the Extinction Problem of Galton and Watson
- Chapter 8 · The Quarterly Merge Check-up: Procedure, Distilled Tool and Pre-registered Refutation