关于「占位分布的香农熵与峰值:熵—峰值界定理」,《离散周期网络与占位熵》给出的定量结论是什么?

结论:能严格证明的是界:\(H \le \log_2(K - V)\);给定峰值时 \(H \le h(m/N)\),且 \(h\) 在 \(m \ge N/K\) 时递减;\(m \ge N \cdot 2^{-H}\);方差与碰撞熵之间有恒等式。在 14 个粒子、12 个格子中,熵最大的整数形态唯一,是「十个 1、两个 2」(3.5216 比特)。「熵越低、峰值越高」只在优超可比的形态之间是定理;8,778 对形态中有 1,405 对不可比,其中 65.9% 方向相反。在随机分配下,平均空位 3.55 个,零空位的概率只有 0.0013,熵与峰值的相关系数为 −0.708,这是统计倾向,不是守恒律。下一章在占位之上加入作者规定的激发规则,看「空位从对面借一半」会带来什么。

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

English version

对照数据表

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

partitions of 14 into at most 12 parts: 133
(a) H <= log2(K - V)            True
(b) H <= fano(m / N)            True
(c) H >= H2 >= Hmin             True
(d) m >= N * 2^(-H)             True
(e) Var = (N^2/K)(2^-H2 - 1/K)  True
(f) Var >= (N^2/K)(2^-H - 1/K)  True
highest-entropy configurations (H in bits; log2 12 = 3.5850):
   (2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1)     H 3.5216  V 0  m 2  Var 0.139
   (3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1)     H 3.4677  V 0  m 3  Var 0.306
   (2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1)        H 3.3788  V 1  m 2  Var 0.306
max H for each peak m, against the bound fano(m / N):
   m = 2: max H 3.5216  bound 3.5569
   m = 3: max H 3.4677  bound 3.4677
   m = 4: max H 3.2359  bound 3.3341
   m = 5: max H 2.9781  bound 3.1642
   m = 6: max H 2.6995  bound 2.9620
   m = 7: max H 2.4037  bound 2.7297
fano(m / N) for m = 2 ... 14 is decreasing: True

核心公式

\[H \le h(q) := -q \log_2 q - (1-q) \log_2 \frac{1-q}{K-1},\]
查看完整验算程序
# N = 14 particles in K = 12 cells. Entropy, vacancies, peak and variance depend only on
# the multiset of occupations, so the integer partitions of 14 into at most 12 parts
# cover every case. Check the entropy-peak bounds on all of them.
import math
N, K = 14, 12

def partitions(n, k, top=None):
    if n == 0:
        yield (); return
    for f in range(min(n, n if top is None else top), 0, -1):
        if k: yield from ((f,) + r for r in partitions(n - f, k - 1, f))

def stats(part):
    p = [x / N for x in part]
    h = -sum(q * math.log2(q) for q in p)                 # Shannon entropy, bits
    h2 = -math.log2(sum(q * q for q in p))                # Renyi-2 (collision) entropy
    var = sum(x * x for x in part) / K - (N / K) ** 2     # variance over all 12 cells
    return h, h2, -math.log2(max(p)), K - len(part), max(part), var

def fano(q):
    """Largest entropy when the biggest share is q >= 1/K (rest spread evenly)."""
    r = (1 - q) / (K - 1)
    return -q * math.log2(q) - (0 if r == 0 else (1 - q) * math.log2(r))

if __name__ == "__main__":
    rows = [(stats(p), p) for p in partitions(N, K)]; e = 1e-12
    print("partitions of 14 into at most 12 parts:", len(rows))
    checks = {"(a) H <= log2(K - V)": lambda s: s[0] <= math.log2(K - s[3]) + e,
              "(b) H <= fano(m / N)": lambda s: s[0] <= fano(s[4] / N) + e,
              "(c) H >= H2 >= Hmin": lambda s: s[0] >= s[1] - e and s[1] >= s[2] - e,
              "(d) m >= N * 2^(-H)": lambda s: s[4] >= N * 2 ** -s[0] - e,
              "(e) Var = (N^2/K)(2^-H2 - 1/K)":
                  lambda s: abs(s[5] - N * N / K * (2 ** -s[1] - 1 / K)) < 1e-9,
              "(f) Var >= (N^2/K)(2^-H - 1/K)":
                  lambda s: s[5] >= N * N / K * (2 ** -s[0] - 1 / K) - e}
    for name, ok in checks.items():
        print(f"{name:31s}", all(ok(s) for s, _ in rows))
    rows.sort(key=lambda r: -r[0][0])
    print("highest-entropy configurations (H in bits; log2 12 = %.4f):" % math.log2(K))
    for s, p in rows[:3]:
        print(f"   {str(p):40s} H {s[0]:.4f}  V {s[3]}  m {s[4]}  Var {s[5]:.3f}")
    print("max H for each peak m, against the bound fano(m / N):")
    for m in range(2, 8):
        best = max(s[0] for s, p in rows if s[4] == m)
        print(f"   m = {m}: max H {best:.4f}  bound {fano(m / N):.4f}")
    print("fano(m / N) for m = 2 ... 14 is decreasing:",
          all(fano(m / N) > fano((m + 1) / N) for m in range(2, 14)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《离散周期网络中的双尺度重整化、占位数分布熵与推力波叠加定理》第 2 章「占位分布的香农熵与峰值:熵—峰值界定理」(版本 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}
}

本书其他章节结论