关于「四态激发映射、对径半波耦合与推力分解」,《离散周期网络与占位熵》给出的定量结论是什么?

结论:把作者的规则写成定义以后,总通量可以严格分解为六个对径对的贡献之和(定理 3.1)。在线性激发下,\(\Phi = N + c S\),总通量在 14 到 21 之间:零空位时恰为 14,至少 6 个空位才能达到 21;随机分配下的平均值为 16.26。作者称为「相干叠加」的 +2.0 在物理上对应非相干的强度相加;如果改用饱和或平方延拓,熵与通量相关的大小与方向都会改变。激发映射在 \(D_{12}\) 下等变,但总通量实际上在一个大得多的群下不变,完全不使用环的相邻结构。下一章离开组合数学,问一个心理学的类比问题:一个处于「零推力」状态的格子,如果它能「感觉」,会感觉到什么?

数据口径:本书是教学与研究用的数学模型,不是投资、交易、税务或法律建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(17 段程序,全部核对)、原典与作者的假说。

English version

对照数据表

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

flux = sum of six antipodal-pair terms (20,000 random states): True
V min flux max flux (formulas in the text)
014.0 14.0
114.5 16.0
214.0 17.0
314.5 18.0
414.0 19.0
614.0 21.0
1014.0 21.0
1121.0 21.0
bounds match the formula for every V: True
total probability 1.000000; E[flux]16.2586; formula N + cN(11/12)^13 = 16.2586
P(flux14) = 0.0246; P(flux >= 18) = 0.1275; P(flux = 21) = 3.04e-03
linear a(n) = n E[flux]16.27 corr(H, flux) -0.533
saturating min(n, 2) E[flux]14.34 corr(H, flux) +0.393
wave intensity n^2 E[flux]34.16 corr(H, flux) -0.896

核心公式

\[F_i = \begin{cases} a(n_i), & n_i \ge 1,\\ c \cdot a(n_{i+6}), & n_i = 0, \end{cases}\]
查看完整验算程序
# The author's excitation rules (author's model), N = 14 on Z12: an occupied cell
# gives a(n) (a(1) = 1, a(2) = 2, here a(n) = n); an EMPTY cell takes c * a(n_{i+6}) from
# its antipode, c = 0.5. Flux = sum over cells. Check decomposition, bounds and law.
import math, random
N, K, C = 14, 12, 0.5

def flux(n, a=lambda x: x, c=C):
    return sum(a(n[i]) if n[i] else c * a(n[(i + 6) % K]) for i in range(K))

def pair_term(x, y, c=C):
    if x and y: return x + y
    if x or y:  return (1 + c) * (x + y)
    return 0.0

def exact_tables():
    """DP over the six pairs: (min, max) flux for each (particles, V), and the exact
    law of the flux when the 14 particles are thrown at random."""
    best = {(0, 0): (0.0, 0.0)}; law = {(0, 0.0): 1.0}
    for _ in range(6):
        nb, nl = {}, {}
        for (s, v), (lo, hi) in best.items():
            for x in range(N - s + 1):
                for y in range(N - s - x + 1):
                    key = (s + x + y, v + (x == 0) + (y == 0)); t = pair_term(x, y)
                    old = nb.get(key, (math.inf, -math.inf))
                    nb[key] = (min(old[0], lo + t), max(old[1], hi + t))
        for (s, f), w in law.items():
            for x in range(N - s + 1):
                for y in range(N - s - x + 1):
                    k = (s + x + y, f + pair_term(x, y))
                    nl[k] = nl.get(k, 0.0) + w / (math.factorial(x) * math.factorial(y))
        best, law = nb, nl
    scale = math.factorial(N) / K ** N
    return best, {f: w * scale for (s, f), w in law.items() if s == N}

if __name__ == "__main__":
    rng = random.Random(6); ok = True
    for _ in range(20000):
        n = [0] * K
        for _ in range(N): n[rng.randrange(rng.choice((2, 6, 12)))] += 1
        ok &= abs(flux(n) - sum(pair_term(n[j], n[j + 6]) for j in range(6))) < 1e-12
    print("flux = sum of six antipodal-pair terms (20,000 random states):", ok)
    best, dist = exact_tables(); allok = True
    print(" V  min flux  max flux   (formulas in the text)")
    for v in range(0, 12):
        lo, hi = best[(N, v)]
        f_lo = N + C * (v % 2 if v <= K - 2 else N)
        f_hi = N + C * (min(N, N - K + v + min(v, K - v)) if v else 0)
        allok &= (lo, hi) == (f_lo, f_hi)
        if v in (0, 1, 2, 3, 4, 6, 10, 11): print(f"{v:2d}   {lo:5.1f}     {hi:5.1f}")
    print("bounds match the formula for every V:", allok)
    mean = sum(f * p for f, p in dist.items())
    print(f"total probability {sum(dist.values()):.6f}; E[flux] = {mean:.4f};"
          f" formula N + cN(11/12)^13 = {N + C * N * (11 / 12) ** 13:.4f}")
    print(f"P(flux = 14) = {dist.get(14.0, 0):.4f}; P(flux >= 18) ="
          f" {sum(p for f, p in dist.items() if f >= 18):.4f};"
          f" P(flux = 21) = {dist.get(21.0, 0):.2e}")
    rules = {"linear a(n) = n": lambda x: x, "saturating min(n, 2)": lambda x: min(x, 2),
             "wave intensity n^2": lambda x: x * x}      # other extensions beyond n = 2
    states = []
    for _ in range(40000):
        n = [0] * K
        for _ in range(N): n[rng.randrange(K)] += 1
        states.append(n)
    hs = [-sum(x / N * math.log2(x / N) for x in n if x) for n in states]
    mh = sum(hs) / len(hs); vh = sum((h - mh) ** 2 for h in hs)
    for name, a in rules.items():
        fs = [flux(n, a) for n in states]; mf = sum(fs) / len(fs)
        cov = sum((h - mh) * (f - mf) for h, f in zip(hs, fs))
        r = cov / math.sqrt(vh * sum((f - mf) ** 2 for f in fs))
        print(f"{name:22s} E[flux] {mf:6.2f}  corr(H, flux) {r:+.3f}")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《离散周期网络中的双尺度重整化、占位数分布熵与推力波叠加定理》第 3 章「四态激发映射、对径半波耦合与推力分解」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23796761

DOI: 10.5281/zenodo.23796761 · 阅读本章所在专著 · 5DL-B-037 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026037,
  author    = {Fan, Yafu},
  title     = {Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23796761},
  url       = {https://doi.org/10.5281/zenodo.23796761}
}

本书其他章节结论