关于「独立模型下的闸门激活与通道渗流」,《卓尔金、神谕与闸门的数学》给出的定量结论是什么?
结论:第五章在独立均匀模型下精确计算:单人盘平均激活 21.5033 个闸门、导通 3.9603 条通道,零导通的概率为 0.00462;两人合盘平均导通 11.1618 条。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.00462, 11.1618, 21.5033, 3.9603
| check | 64(1 - (63/64)^26) = 21.5033 |
| 26 draws: distinct gates E | 21.5033, s.d. 1.6338 |
| most likely 22 gates (P | 0.2362) |
| P(no channel conducts) | 0.00462 |
| channels conducting: E[C] | 3.9603, Var[C] = 2.5290 |
| P(a given channel conducts) | 0.11001 |
| 52 draws: distinct gates E | 35.7818, s.d. 2.3607 |
| most likely 36 gates (P | 0.1680) |
| P(no channel conducts) | 6.662 x 10^-9 |
| channels conducting: E[C] | 11.1618, Var[C] = 5.5687 |
| P(a given channel conducts) | 0.31005 |
查看完整验算程序
# Chapter 5. p08: The independence model, exactly - one chart (26 draws)
# and a two-person composite (52 draws).
# Suppose the 26 activations (13 bodies, two moments) were independent and
# uniform over the 64 gates (each gate is 5.625 degrees wide). Then:
# - the number of distinct gates hit has the occupancy law
# P(D = j) = C(64, j) j! S(26, j) / 64^26 (S = Stirling, 2nd kind);
# - a channel conducts when both its gates are hit; the gate graph is K4
# (10, 20, 34, 57) plus 30 disjoint pairs, so its independent sets are
# counted by (1 + 4x)(1 + 2x)^30, and
# P(no channel) = sum_j [x^j] * j! S(26, j) / 64^26;
# - E[C] and Var[C] follow from P(a given set of m gates all hit).
from fractions import Fraction
from math import comb, factorial
G = 64
def stirling2(n):
S = [[0] * (n + 1) for _ in range(n + 1)]
S[0][0] = 1
for i in range(1, n + 1):
for j in range(1, i + 1):
S[i][j] = j * S[i - 1][j] + S[i - 1][j - 1]
return S[n]
def all_hit(m, draws):
return sum((-1) ** j * comb(m, j) * Fraction(G - j, G) ** draws
for j in range(m + 1))
def poly_mul(a, b):
out = [0] * (len(a) + len(b) - 1)
for i, x in enumerate(a):
for j, y in enumerate(b):
out[i + j] += x * y
return out
CHANNELS = ((1, 8), (2, 14), (3, 60), (4, 63), (5, 15), (6, 59), (7, 31),
(9, 52), (10, 20), (10, 34), (10, 57), (11, 56), (12, 22),
(13, 33), (16, 48), (17, 62), (18, 58), (19, 49), (20, 34),
(20, 57), (21, 45), (23, 43), (24, 61), (25, 51), (26, 44),
(27, 50), (28, 38), (29, 46), (30, 41), (32, 54), (34, 57),
(35, 36), (37, 40), (39, 55), (42, 53), (47, 64))
def report(DRAWS):
S = stirling2(DRAWS)
total = G ** DRAWS
occ = [Fraction(comb(G, j) * factorial(j) * S[j], total)
for j in range(DRAWS + 1)]
mean_d = sum(j * p for j, p in enumerate(occ))
sd = (sum(j * j * p for j, p in enumerate(occ)) - mean_d ** 2) ** 0.5
print(" {} draws: distinct gates E = {:.4f}, s.d. {:.4f}".format(
DRAWS, float(mean_d), float(sd)))
mode = max(range(DRAWS + 1), key=lambda j: occ[j])
print(" most likely {} gates (P = {:.4f})".format(
mode, float(occ[mode])))
ind = [1]
for poly in [[1, 4]] + [[1, 2]] * 30:
ind = poly_mul(ind, poly)
p0 = sum(Fraction(ind[j] * factorial(j) * S[j], total)
for j in range(min(len(ind), DRAWS + 1)))
if p0 < Fraction(1, 10000):
man, ex = "{:.3e}".format(float(p0)).split("e")
print(" P(no channel conducts) = {} x 10^{}".format(man, int(ex)))
else:
print(" P(no channel conducts) = {:.5f}".format(float(p0)))
mean_c = len(CHANNELS) * all_hit(2, DRAWS)
second = sum(all_hit(len(set(e) | set(f)), DRAWS)
for e in CHANNELS for f in CHANNELS)
print(" channels conducting: E[C] = {:.4f}, Var[C] = {:.4f}".format(
float(mean_c), float(second - mean_c ** 2)))
print(" P(a given channel conducts) = {:.5f}".format(
float(all_hit(2, DRAWS))))
if __name__ == "__main__":
print(" check: 64(1 - (63/64)^26) = {:.4f}".format(
64 * (1 - (63 / 64) ** 26)))
report(26)
report(52)唯一数据源与引用
范雅福(Fan, Y.). (2026). 《玛雅卓尔金双模齿轮、神谕十字对合变换与六十四闸门网络渗流》第 5 章「独立模型下的闸门激活与通道渗流」(版本 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}
}