What does Shared-Input Evidence across Twelve Systems conclude, in numbers, about “One Moment of Birth: the Information of Twelve Systems and Their Mutual-Information Matrix”?

Answer: Chapter 1 finds that the nominal information of the twelve systems adds to 44.676 bits while their joint entropy is only 18.005 bits, the same as the input itself; in 56 of the 66 pairs of the mutual-information matrix less than 0.05 bit is shared, redundancy gathers in a few blocks of shared cycles, and for day cycles mutual information is set by the greatest common divisor of the periods.

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, 56, 66

I(X;Y) in bits; diagonal = H(X)
TROP SIDR MONB ZODI NSTA NAYI DAYP MANS WEEK TZOL LIFE HOUR
TROP3.58 2.84 2.58 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.00
SIDR2.84 3.58 2.73 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.00
MONB2.58 2.73 3.58 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.01 0.00
ZODI0.00 0.00 0.00 3.58 1.64 0.00 0.00 0.00 0.00 0.00 0.01 0.00
NSTAR0.00 0.00 0.00 1.64 3.17 0.31 0.00 0.00 0.00 0.00 0.02 0.00
NAYIN0.00 0.00 0.00 0.00 0.31 2.32 0.00 0.00 0.00 0.00 0.00 0.00
DAYP0.00 0.00 0.00 0.00 0.00 0.00 5.91 2.00 0.00 4.32 0.07 0.00
MANS0.00 0.00 0.00 0.00 0.00 0.00 2.00 4.81 2.81 2.00 0.01 0.00
WEEK0.00 0.00 0.00 0.00 0.00 0.00 0.00 2.81 2.81 0.00 0.00 0.00
TZOL0.00 0.00 0.00 0.00 0.00 0.00 4.32 2.00 0.00 4.32 0.00 0.00
LIFE0.01 0.01 0.01 0.01 0.02 0.00 0.07 0.01 0.00 0.00 3.42 0.00
HOUR0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 3.58
day-cycle check: enumeration vs log2 gcd(a, b)
60-day vs 28-day2.000 2.000
60-day vs 20-day4.322 4.322
28-day vs7-day 2.807 2.807
60-day vs7-day 0.000 0.000
28-day vs 20-day2.000 2.000
largest pairs: DAYP-TZOL 4.32, TROP-SIDR 2.84, MANS-WEEK 2.81
pairs with I < 0.05 bit56 of 66
Show the full program
# Chapter 1. p12: the mutual-information matrix of the twelve systems.
# Same population and label maps as p11. I(X;Y) = H(X) + H(Y) - H(X,Y),
# exact by enumeration, in bits. For two day cycles of lengths a and b the
# theory gives I = log2 gcd(a, b); the program checks that against the
# enumeration. Shared input does not by itself force shared information.
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 column(j, rows):
    if NAMES[j] == "HOUR":
        return None
    return [r[j] for r in rows]


def joint_h(a, b, n):
    if a is None and b is None:
        return math.log2(12)
    if a is None or b is None:
        x = a if a is not None else b
        return entropy(Counter(x)) + math.log2(12)
    return entropy(Counter(zip(a, b)))


rows = [labels(d) for d in days()]
n = len(rows)
cols = [column(j, rows) for j in range(12)]
h = [math.log2(12) if c is None else entropy(Counter(c)) for c in cols]
mi = [[0.0] * 12 for _ in range(12)]
for i in range(12):
    for j in range(12):
        if i == j:
            mi[i][j] = h[i]
        elif cols[i] is None or cols[j] is None:
            mi[i][j] = 0.0
        else:
            mi[i][j] = max(0.0, h[i] + h[j] - joint_h(cols[i], cols[j], n))
print("I(X;Y) in bits; diagonal = H(X)")
print("      " + "".join("%5s" % s[:4] for s in NAMES))
for i in range(12):
    print("%-6s" % NAMES[i][:5] + "".join("%5.2f" % v for v in mi[i]))
print("day-cycle check: enumeration vs log2 gcd(a, b)")
for a, b, ia, ib in ((60, 28, 6, 7), (60, 20, 6, 9), (28, 7, 7, 8),
                     (60, 7, 6, 8), (28, 20, 7, 9)):
    print("  %2d-day vs %2d-day  %.3f  %.3f"
          % (a, b, mi[ia][ib], math.log2(math.gcd(a, b))))
pairs = [(mi[i][j], NAMES[i], NAMES[j])
         for i in range(12) for j in range(i + 1, 12)]
pairs.sort(key=lambda t: (-t[0], t[1], t[2]))
print("largest pairs: " + ", ".join("%s-%s %.2f" % (a, b, v)
                                     for v, a, b in pairs[:3]))
print("pairs with I < 0.05 bit: %d of 66"
      % len([p for p in pairs if p[0] < 0.05]))

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 1: One Moment of Birth: the Information of Twelve Systems and Their Mutual-Information Matrix. 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