What does Discrete Cyclical Networks and Occupancy Entropy conclude, in numbers, about “Shannon Entropy and Peak of an Occupancy Distribution: The Entropy–Peak Bound Theorem”?
Answer: What can be proved are bounds: \(H \le \log_2(K - V)\); for a given peak \(H \le h(m/N)\), with \(h\) decreasing for \(m \ge N/K\); \(m \ge N \cdot 2^{-H}\); and an identity linking variance and collision entropy. With 14 particles in 12 cells, the integer pattern of largest entropy is unique, "ten 1s and two 2s" (3.5216 bits). "The lower the entropy, the higher the peak" is a theorem only between patterns comparable by majorisation; of 8,778 pairs, 1,405 are not comparable, and in 65.9 % of those the direction is reversed. Under random allocation the mean number of vacancies is 3.55, no vacancy occurs with probability only 0.0013, and the correlation between entropy and peak is −0.708: a statistical tendency, not a conservation law. The next chapter adds the author's excitation rules on top of occupation and asks what "an empty cell borrows half from the one opposite" brings.
Scope of the numbers: The book presents mathematical models for teaching and research; it is not investment, trading, tax or legal advice. Marked boxes separate published evidence, runnable Python calculations (17 programs, all checked), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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
Key formula
Show the full program
# 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)))Single source and citation
Fan, Y. (2026). Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks (Version 1.0.0), Chapter 2: Shannon Entropy and Peak of an Occupancy Distribution: The Entropy–Peak Bound Theorem. 5D Library. https://doi.org/10.5281/zenodo.23796761
DOI: 10.5281/zenodo.23796761 · Read the monograph · 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}
}Other chapter answers in this book
- Chapter 1 · The Mod-12 Ring Lattice and the Five-Tigers Map: Two-to-One, the Chinese Remainder Theorem and Block Maps
- Chapter 3 · The Four-State Excitation Map, Antipodal Half-Wave Coupling and the Decomposition of Thrust
- Chapter 4 · The Zero-Thrust State and Felt Resistance: The Weber–Fechner Law, Adaptation Level and Habituation (Analogy and Hypothesis)
- Chapter 5 · Cross-Domain "Structural Isomorphism" Hypotheses: Sector Rotation, Flexible Vacancies, Twelve-Tone Equal Temperament and Periodic Staking
- Chapter 6 · Cleaning Out Counterexamples and Spurious Correlations: The Barnum Effect, Multiple Testing and Data Snooping
- Chapter 8 · Practice and a Pre-Registered Test: A Four-Step Checklist and a Blind Permutation Backtest