关于「五大神谕:印记与音阶上的对合与群作用」,《卓尔金、神谕与闸门的数学》给出的定量结论是什么?
结论:第三章证明支持、挑战、隐藏推动是没有不动点的对合,在日符上生成 20 阶的正则作用,在颜色上构成克莱因四元群;指引表等价于仿射映射 s + 12(t − 1);两个随机的人之间存在神谕关系的概率为 0.01455。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.01455, 12, 20
| table = s + 12(t - 1) mod 20 for all 260 kins: True | |
| kins that are their own guide | 60 (0.2308) |
| guide keeps the colour: True | |
| iterating the guide, cycle length: kins {1 | 60, 5: 200} |
| P(other is my guide ) | 0.00297 |
| P(other is my analog ) | 0.00386 |
| P(other is my antipode) | 0.00386 |
| P(other is my occult ) | 0.00386 |
| P(other is in my oracle at all) | 0.01455 |
| 12 people: expected ordered oracle ties 1.92 |
核心公式
\[G(s, t) = \bigl(s + 12\,(t - 1) \bmod 20,\ t\bigr).\]
查看完整验算程序
# Chapter 3. p05: The guide as an affine map, and oracle ties between two
# people. Published guide table: tones 1, 6, 11 -> same seal; 2, 7, 12 ->
# +12; 3, 8, 13 -> +4; 4, 9 -> -4; 5, 10 -> -12 (seals mod 20). We check
# that this is the single rule G(s, t) = (s + 12 (t - 1) mod 20, t).
# Then, for two kins drawn independently and uniformly, how often is the
# second one of the first one's four oracle kins?
from itertools import product
TABLE = {1: 0, 6: 0, 11: 0, 2: 12, 7: 12, 12: 12, 3: 4, 8: 4, 13: 4,
4: -4, 9: -4, 5: -12, 10: -12}
KINS = list(product(range(20), range(1, 14)))
def guide(k):
return ((k[0] + 12 * (k[1] - 1)) % 20, k[1])
def oracle(k):
s, t = k
return {"guide": guide(k), "analog": ((19 - s) % 20, t),
"antipode": ((s + 10) % 20, t), "occult": ((21 - s) % 20, 14 - t)}
if __name__ == "__main__":
ok = all((s + TABLE[t]) % 20 == guide((s, t))[0] for s, t in KINS)
print(" table = s + 12(t - 1) mod 20 for all 260 kins: {}".format(ok))
selfg = sum(guide(k) == k for k in KINS)
print(" kins that are their own guide: {} ({:.4f})".format(
selfg, selfg / 260))
same_colour = all(guide(k)[0] % 4 == k[0] % 4 for k in KINS)
print(" guide keeps the colour: {}".format(same_colour))
sizes = {}
for k in KINS:
n, cur = 1, guide(k)
while cur != k:
cur, n = guide(cur), n + 1
sizes[n] = sizes.get(n, 0) + 1
print(" iterating the guide, cycle length: kins {}".format(
dict(sorted(sizes.items()))))
hits = {"guide": 0, "analog": 0, "antipode": 0, "occult": 0}
any_tie = 0
for a, b in product(KINS, KINS):
if a == b:
continue
o = oracle(a)
tie = False
for key, v in o.items():
if v == b:
hits[key] += 1
tie = True
any_tie += tie
tot = 260 * 259
for key, v in hits.items():
print(" P(other is my {:8s}) = {:.5f}".format(key, v / tot))
print(" P(other is in my oracle at all) = {:.5f}".format(any_tie / tot))
print(" 12 people: expected ordered oracle ties {:.2f}".format(
12 * 11 * any_tie / tot))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《玛雅卓尔金双模齿轮、神谕十字对合变换与六十四闸门网络渗流》第 3 章「五大神谕:印记与音阶上的对合与群作用」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090193
DOI: 10.5281/zenodo.24090193 · 阅读本章所在专著 · 5DL-B-072 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026072,
author = {Fan, Yafu},
title = {Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090193},
url = {https://doi.org/10.5281/zenodo.24090193}
}