What does Shared-Input Evidence across Twelve Systems conclude, in numbers, about “The Data-Processing Inequality: No Number of Systems Can Exceed the Moment of Birth”?

Answer: Chapter 6 uses the data-processing inequality to show that in an illustrative model the twelve systems know exactly the 0.5769 millibits that the day of birth itself knows about an outcome, and not a fraction more; fitting after the fact is almost inevitable, since when each statement has only a 0.05 chance of fitting, twelve systems give a 0.9539 chance that at least one fits.

Scope of the numbers: Its parameters are illustrative, and all calculations are generated by its programs. Marked boxes separate published evidence, runnable Python calculations (18 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.05, 0.9539

statements fitting a past event after the fact
base rate FsystemsP(at least one fits)expected fits
0.0510.22620.25
0.0530.53670.75
0.05120.95393.00
0.1010.40950.50
0.1030.79411.50
0.10120.99826.00
0.3010.83191.50
0.3030.99534.50
0.30121.000018.00
familywise rate of 12 tests at 0.05, by effective count
independentM_eff 12.00familywise 0.460Sidak level 0.00427
row weights (p31) M_eff 9.23 familywise 0.377 Sidak level 0.00554
participation (p31) M_eff 7.55 familywise 0.321 Sidak level 0.00677
blocks (p52) M_eff 5.00 familywise 0.226 Sidak level 0.01021
Show the full program
# Chapter 6. p62: matching after the fact, and testing many systems at once.
# Part 1: a reading offers S statements per system; any one statement
# fits a given past event with base rate F (a general statement fits
# many lives). Chance that at least one of M * S statements fits, and the
# expected number that fit. Part 2: familywise false-positive rate of M
# tests at level 0.05 when the tests are equivalent to M_eff independent
# ones (M_eff from p31 and p52), with the Sidak threshold. F, S
# illustrative.
import math

S = 5
print("statements fitting a past event after the fact")
print(" base rate F  systems  P(at least one fits)  expected fits")
for f in (0.05, 0.1, 0.3):
    for m in (1, 3, 12):
        k = m * S
        print("%12.2f %8d %21.4f %14.2f"
              % (f, m, 1 - (1 - f) ** k, k * f))
print("familywise rate of 12 tests at 0.05, by effective count")
for name, me in (("independent", 12.0), ("row weights (p31)", 9.23),
                 ("participation (p31)", 7.55), ("blocks (p52)", 5.0)):
    fw = 1 - 0.95 ** me
    sid = 1 - 0.95 ** (1 / me)
    print("  %-20s M_eff %5.2f  familywise %.3f  Sidak level %.5f"
          % (name, me, fw, sid))

Single source and citation

Fan, Y. (2026). Down-Weighting Non-Independent Evidence across Twelve Symbolic Systems: Spurious Resonance from a Shared Birth Input and Orthogonal Latent-Variable Synthesis (Version 1.0.0), Chapter 6: The Data-Processing Inequality: No Number of Systems Can Exceed the Moment of Birth. 5D Library. DOI pending

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

BibTeX
@book{fan2026283,
  author    = {Fan, Yafu},
  title     = {Down-Weighting Non-Independent Evidence across Twelve Symbolic Systems: Spurious Resonance from a Shared Birth Input and Orthogonal Latent-Variable Synthesis},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book