What does Shared-Input Evidence across Twelve Systems conclude, in numbers, about “The Effective Number of Independent Pieces of Evidence: Design Effect, Eigenvalues and Participation Ratio”?
Answer: Chapter 3 estimates the effective number of independent pieces of evidence, from 7.55 by participation ratio to 11.41 by Nyholt's formula.
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: 11.41, 7.55
largest |r|: MANS-TZOL +1.000, DAYP-TZOL -1.000, DAYP-MANS -1.000
solar block: TROP-SIDR -0.577, TROP-MONB -0.014, SIDR-MONB +0.437
eigenvalues: 3.000 1.731 1.075 1.015 1.000 1.000
0.986 0.986 0.925 0.283 -0.000 -0.000
Nyholt M_eff 11.41
Li-Ji M_eff 10.00
participation ratio 7.55
row-sum weights, total 9.23
joint entropy of the bits 9.29 of 11.81 bits
row-sum weight by system:
TROP 0.75 SIDR 0.66 MONB 0.84 ZODI 1.00 NSTA 0.99 NAYI 1.00
DAYP 0.33 MANS 0.33 WEEK 1.00 TZOL 0.33 LIFE 1.00 HOUR 1.00Show the full program
# Chapter 3. p31: effective number of independent verdicts, five ways.
# The twelve parity verdicts of p21 over the p11 population. Exact phi
# correlation matrix; eigenvalues by the cyclic Jacobi method. Estimators:
# Nyholt (2004), Li and Ji (2005), the participation ratio, this book's
# row-sum weights (each system weighted 1 / sum_j r_ij^2), and the joint
# entropy of the twelve verdict bits.
import datetime
import math
from collections import Counter
D0, D1 = datetime.date(1950, 1, 1), datetime.date(2009, 12, 31)
JIAZI = datetime.date(1949, 10, 1).toordinal() # 甲子日(据通行历表)
GMT, JD = 584283, 1721425 # 卓尔金历 GMT 对应常数;序数日转儒略日
CUM = [0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334]
# 回归黄道太阳星座起始日(白羊为 0,固定日期近似)
TROP = [(3, 21), (4, 20), (5, 21), (6, 21), (7, 23), (8, 23),
(9, 23), (10, 23), (11, 22), (12, 22), (1, 20), (2, 19)]
# 十二节近似日期,寅月(支序 2)起,子为 0
JIE = [(2, 4), (3, 6), (4, 5), (5, 6), (6, 6), (7, 7), (8, 8), (9, 8),
(10, 8), (11, 7), (12, 7), (1, 6)]
# 六十甲子纳音五行,按每两年一组:M 金 F 火 W 木 E 土 A 水
NAYIN = "MFWEMFAEMWAEFWAMFWEMFAEMWAEFWA"
NAMES = ["TROP", "SIDR", "MONB", "ZODI", "NSTAR", "NAYIN",
"DAYP", "MANS", "WEEK", "TZOL", "LIFE", "HOUR"]
def doy(m, d):
return CUM[m - 1] + min(d, 28 if m == 2 else 31) - 1
def cyc(x, table, first):
best, lab = -1, None
for k, (m, d) in enumerate(table):
s = doy(m, d)
if best < s <= x:
best, lab = s, (first + k) % 12
if lab is None:
s = max(doy(m, d) for m, d in table)
lab = (first + [doy(m, d) for m, d in table].index(s)) % 12
return lab
def digits(n):
return [int(c) for c in str(n)]
def life(d):
s = int(math.fsum(digits(d.year) + digits(d.month) + digits(d.day)))
while s > 9 and s not in (11, 22, 33):
s = int(math.fsum(digits(s)))
return s
def labels(d):
x = doy(d.month, d.day)
n = d.toordinal()
sid = d - datetime.timedelta(days=24) # 恒星黄道:岁差约 24 天
y = d.year if x >= doy(2, 4) else d.year - 1 # 以 2 月 4 日近似立春
return (cyc(x, TROP, 0), cyc(doy(sid.month, sid.day), TROP, 0),
cyc(x, JIE, 2), (y - 4) % 12, (10 - y % 9) % 9 + 1,
NAYIN[((y - 4) % 60) // 2], (n - JIAZI) % 60, (n + 3) % 28,
d.weekday(), (n + JD - GMT + 19) % 20, life(d))
def days():
d = D0
while d <= D1:
yield d
d += datetime.timedelta(days=1) # step
def entropy(counter):
tot = math.fsum(counter.values())
return -math.fsum(c / tot * math.log2(c / tot)
for c in counter.values())
def verdicts(r, hour):
v = [r[0], r[1], r[2], r[3], r[4] - 1,
"MFWEMFAEMWAEFWAMFWEMFAEMWAEFWA".index(r[5]) // 2,
r[6], r[7], r[8], r[9], r[10] - 1, hour]
return [1 - x % 2 for x in v]
def jacobi(a, sweeps=60):
a = [row[:] for row in a]
m = len(a)
for _ in range(sweeps):
off = math.fsum(a[i][j] ** 2 for i in range(m) for j in range(m)
if i != j)
if off < 1e-22:
break
for p in range(m - 1):
for q in range(p + 1, m):
if abs(a[p][q]) < 1e-15:
continue
th = 0.5 * math.atan2(2 * a[p][q], a[q][q] - a[p][p])
c, s = math.cos(th), math.sin(th)
for k in range(m):
akp, akq = a[k][p], a[k][q]
a[k][p], a[k][q] = c * akp - s * akq, s * akp + c * akq
for k in range(m):
apk, aqk = a[p][k], a[q][k]
a[p][k], a[q][k] = c * apk - s * aqk, s * apk + c * aqk
return sorted((a[i][i] for i in range(m)), reverse=True)
day_rows = [labels(d) for d in days()]
cnt, joint = Counter(), Counter()
tot = 0
for r in day_rows:
for hr in range(12):
v = verdicts(r, hr)
joint[tuple(v)] += 1
tot += 1
on = [j for j in range(12) if v[j]]
for i in on:
for j in on:
cnt[(i, j)] += 1
p = [cnt[(j, j)] / tot for j in range(12)]
R = [[(cnt[(i, j)] / tot - p[i] * p[j]) /
math.sqrt(p[i] * (1 - p[i]) * p[j] * (1 - p[j]))
for j in range(12)] for i in range(12)]
big = sorted(((abs(R[i][j]), NAMES[i], NAMES[j], R[i][j])
for i in range(12) for j in range(i + 1, 12)), reverse=True)
print("largest |r|: " + ", ".join(
"%s-%s %+.3f" % (a, b, r) for _, a, b, r in big[:3]))
print("solar block: TROP-SIDR %+.3f, TROP-MONB %+.3f, SIDR-MONB %+.3f"
% (R[0][1], R[0][2], R[1][2]))
lam = jacobi(R)
M = 12
print("eigenvalues: " + " ".join("%.3f" % x for x in lam[:6]))
print(" " + " ".join("%.3f" % x for x in lam[6:]))
mean = math.fsum(lam) / M
var = math.fsum((x - mean) ** 2 for x in lam) / (M - 1)
nyholt = 1 + (M - 1) * (1 - var / M)
liji = math.fsum((1 if x >= 1 else 0) + (x - math.floor(x))
for x in [max(0.0, y) for y in lam])
pr = math.fsum(lam) ** 2 / math.fsum(x * x for x in lam)
rows_w = [1 / math.fsum(R[i][j] ** 2 for j in range(M)) for i in range(M)]
hj = entropy(joint)
hs = math.fsum(-q * math.log2(q) - (1 - q) * math.log2(1 - q) for q in p)
print("Nyholt M_eff %.2f" % nyholt)
print("Li-Ji M_eff %.2f" % liji)
print("participation ratio %.2f" % pr)
print("row-sum weights, total %.2f" % math.fsum(rows_w))
print("joint entropy of the bits %.2f of %.2f bits" % (hj, hs))
print("row-sum weight by system:")
print(" " + " ".join("%s %.2f" % (NAMES[j][:4], rows_w[j])
for j in range(6)))
print(" " + " ".join("%s %.2f" % (NAMES[j][:4], rows_w[j])
for j in range(6, 12)))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 3: The Effective Number of Independent Pieces of Evidence: Design Effect, Eigenvalues and Participation Ratio. 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
- Chapter 1 · One Moment of Birth: the Information of Twelve Systems and Their Mutual-Information Matrix
- Chapter 2 · The Illusion of "Pointing the Same Way": Spurious Resonance and the Double-Blind Test
- Chapter 4 · Bayesian Combination of Correlated Evidence: Down-Weighting the Log-Odds
- Chapter 5 · One Latent Factor, and Orthogonal Synthesis
- Chapter 6 · The Data-Processing Inequality: No Number of Systems Can Exceed the Moment of Birth
- Chapter 7 · Classical Sources East and West: Wang Chong on Day Selection and Cicero On Divination
- Chapter 8 · Closing the Loop: a Down-Weighting Proposal for Synthesis, and Pre-Registered Tests