关于「东西方原典考辨:王充《讥日》与西塞罗《论占卜》」,《十二体系的同源证据降权》给出的定量结论是什么?

结论:王充《讥日》批评的五花八门的日书,读的都是同一张干支表。程序 p71 显示,五本日书合起来只有 2.765 比特,各自相加却是 3.141 比特,再多的日书也超不过 5.907 比特;至少被一本书标出的日子占 0.517,低于独立时的 0.583,因为它们的标记彼此重叠。西塞罗《论占卜》第二卷的孪生子、同一时刻与坎尼战役三条论证,分别对应「同输入异结果」与「同结果异输入」:每份完整的十二体系标签每年由约 29,660 人共享,100 个同一结局的人平均分属 12.00 个星座。孪生子论证的漏洞在于出生间隔,相隔 30 分钟时时辰标签不同的概率只有 0.250,需要时间双胞胎研究那样的统计检验补足。下一章把全书的结论落成一套可以照做的降权流程与预注册检验方案。

数据口径:本书只分析符号体系的结构、信息量与概率,不做任何个人占断,不宣称任何体系有预测效力;书中参数为示意,全部计算由书中程序生成。 第六章用数据处理不等式说明,示意模型中十二套体系关于结果的信息恰为出生日本身的 0.5769 毫比特,一点不多;事后对上几乎必然,每句陈述只有 0.05 的机会对上时,十二套体系至少一句对上的概率是 0.9539。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.517, 0.583, 2.765, 3.141, 5.907

book marked share (* = illustrative rule)
bathing0.167
writing0.100
tailoring*0.167
burial*0.200
sacrifice*0.167
days marked by at least one book0.517 (independent books: 0.583)
pairwise phi among the books
bathing tailoring*-0.200
bathing sacrifice* +0.400
writing tailoring* +0.149
writing burial*-0.167
writing sacrifice* +0.149
tailoring* burial* +0.224
tailoring* sacrifice*-0.200
burial* sacrifice* +0.224
joint entropy of five verdicts 2.765 bits; sum of parts 3.141
ceiling for any stack of day books: log2 605.907 bits
查看完整验算程序
# Chapter 7. p71: Wang Chong's day books all read one input, the day's
# stem-branch in the sixty-day cycle. Rules: the bathing book marks zi and
# mao days (as Wang Chong quotes it); the writing taboo marks bing days
# (as he reports it); the tailoring, burial and sacrifice rules below are
# ILLUSTRATIVE stand-ins, not reconstructions of lost texts. Exact over
# one sixty-day cycle (every day of it equally likely).
import math
from collections import Counter

STEM_BING = 2                                  # 丙
BOOKS = [("bathing", "branch", {0, 3}),        # 子、卯:据《讥日》所引沐书
         ("writing", "stem", {STEM_BING}),     # 丙日:据《讥日》所述
         ("tailoring*", "branch", {2, 8}),     # 示意
         ("burial*", "stem", {0, 6}),          # 示意
         ("sacrifice*", "branch", {0, 6})]     # 示意


def marks(i):
    stem, branch = i % 10, i % 12
    return tuple(1 if (stem if kind == "stem" else branch) in s else 0
                 for _, kind, s in BOOKS)


def h(c):
    t = math.fsum(c.values())
    return -math.fsum(v / t * math.log2(v / t) for v in c.values())


rows = [marks(i) for i in range(60)]
k = len(BOOKS)
p = [math.fsum(r[j] for r in rows) / 60 for j in range(k)]
print("book         marked share   (* = illustrative rule)")
for (name, _, _), q in zip(BOOKS, p):
    print("  %-11s %8.3f" % (name, q))
union = len([r for r in rows if any(r)]) / 60
indep = 1 - math.prod(1 - q for q in p)
print("days marked by at least one book: %.3f (independent books: %.3f)"
      % (union, indep))
print("pairwise phi among the books")
for a in range(k):
    for b in range(a + 1, k):
        pab = len([r for r in rows if r[a] and r[b]]) / 60
        ph = (pab - p[a] * p[b]) / math.sqrt(
            p[a] * (1 - p[a]) * p[b] * (1 - p[b]))
        if abs(ph) > 1e-9:
            print("  %-11s %-11s %+.3f" % (BOOKS[a][0], BOOKS[b][0], ph))
hj = h(Counter(rows))
hs = math.fsum(h(Counter(r[j] for r in rows)) for j in range(k))
print("joint entropy of five verdicts %.3f bits; sum of parts %.3f"
      % (hj, hs))
print("ceiling for any stack of day books: log2 60 = %.3f bits"
      % math.log2(60))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《十二命理体系独立证据降权、同源生辰伪共振剥离与跨东西方符号系统正交合参潜变量母典》第 7 章「东西方原典考辨:王充《讥日》与西塞罗《论占卜》」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论