5D Library › Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks · 中文

Chapter 3 The Four-State Excitation Map, Antipodal Half-Wave Coupling and the Decomposition of Thrust

The author’s rules, written as definitions

Chapter 2 looked only at occupation numbers. On top of occupation, the author’s framework stipulates a set of “excitation” rules: a cell with one particle scores +1.0 (a “home hit”); a cell with two particles scores +2.0 (the author’s “coherent superposition of two particles in one cell”); and an empty cell “absorbs” 0.5 times the excitation of the cell opposite it (i+6i+6), but only if that cell holds particles (the “antipodal mirror half-wave coupling”). These are model rules defined by the author and are in themselves neither right nor wrong. This chapter writes them as axiomatic definitions and derives their properties.

Calculation

Definition 3.1 (the author’s model: the four-state excitation map). Take an excitation function a(n)a(n) with a(0)=0a(0) = 0, a(1)=1a(1) = 1 and a(2)=2a(2) = 2. The author’s framework does not specify n≥3n \ge 3; the book uses the linear extension a(n)=na(n) = n by default and compares other extensions below. The coupling coefficient is c=0.5c = 0.5. The excitation of cell ii is Fi={a(ni),ni≥1,c⋅a(ni+6),ni=0,F_i = \begin{cases} a(n_i), & n_i \ge 1,\\ c \cdot a(n_{i+6}), & n_i = 0, \end{cases} with indices taken modulo 12. Each cell is therefore in one of four states: vacuum (the cell and its antipode both empty, Fi=0F_i = 0), coupled (the cell empty, its antipode occupied, Fi=c⋅a(ni+6)F_i = c \cdot a(n_{i+6})), home hit (ni=1n_i = 1, Fi=1F_i = 1) and superposed (ni≥2n_i \ge 2, Fi=a(ni)F_i = a(n_i)). The total flux (the author’s “thrust”) is Φ=∑iFi\Phi = \sum_i F_i, and the peak thrust is max⁡iFi\max_i F_i.

Remark. “Absorbing” here does not use up the excitation opposite: Fi+6F_{i+6} is not reduced. This is one reading of the author’s rule. If absorption had to be subtracted from the cell opposite, the total flux would always equal ∑ia(ni)\sum_i a(n_i), and coupling would change only the distribution of the flux, not its total.

The thrust decomposition theorem

The author calls the property of the total under these rules the “thrust-wave superposition theorem”. The following theorems state what holds strictly.

Calculation

Theorem 3.1 (antipodal-pair decomposition; the “thrust-wave superposition theorem” of the author’s framework). The total flux is the sum of the contributions of the six antipodal pairs (j,j+6)(j, j+6), j=0,…,5j = 0, \dots, 5: Φ=∑j=05ψ(nj,nj+6),ψ(x,y)={a(x)+a(y),x,y≥1,(1+c)[a(x)+a(y)],exactly one of them 0,0,x=y=0.\Phi = \sum_{j=0}^{5} \psi(n_j, n_{j+6}),\qquad \psi(x, y) = \begin{cases} a(x) + a(y), & x, y \ge 1,\\ (1+c)\,[a(x) + a(y)], & \text{exactly one of them } 0,\\ 0, & x = y = 0. \end{cases} Proof: FjF_j and Fj+6F_{j+6} depend only on (nj,nj+6)(n_j, n_{j+6}); check the three cases one by one.

Theorem 3.2 (bounds on the flux). Take linear excitation a(n)=na(n) = n. Call an antipodal pair with exactly one empty cell “half-empty”, let hh be the number of such pairs and SS the number of particles they hold. Then Φ=N+cS\Phi = N + cS. With VV vacancies:

  1. if V=0V = 0 then Φ=N\Phi = N; if V=K−1V = K – 1 (all particles in one cell) then Φ=(1+c)N\Phi = (1+c)N;

  2. if 1≤V≤K−21 \le V \le K – 2, N+c(Vmod⁡2)≤Φ≤N+c⋅min⁡{N,N−K+V+min⁡(V,K−V)};N + c\,(V \bmod 2) \;\le\; \Phi \;\le\; N + c\cdot\min\{N,\; N – K + V + \min(V, K – V)\};

  3. always N≤Φ≤(1+c)NN \le \Phi \le (1+c)N, that is, between 14 and 21; and the peak thrust equals the largest occupation mm, since a coupled cell has excitation at most cm<mc\,m < m.

Sketch of proof: the number of vacancies is V=h+2eV = h + 2e, where ee is the number of fully empty pairs, so hh has the parity of VV. The smallest possible hh is Vmod⁡2V \bmod 2 (provided at least one pair with both cells occupied remains; otherwise the half-empty pairs hold all the particles). The largest possible hh is min⁡(V,K−V)\min(V, K – V). Apart from the occupied cells of the half-empty pairs, the other K−V−hK – V – h occupied cells hold at least 1 particle each, so S≤N−(K−V−h)S \le N – (K – V – h).

Calculation

The program first checks the decomposition theorem on twenty thousand random states, then uses dynamic programming over the six antipodal pairs to find the exact minimum and maximum flux for each number of vacancies and compares them with the formulas of Theorem 3.2; it also finds the exact distribution of the flux under random allocation. Finally it compares three different extensions of a(n)a(n).

Calculation

# 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}")
# flux = sum of six antipodal-pair terms (20,000 random states): True
#  V  min flux  max flux   (formulas in the text)
#  0    14.0      14.0
#  1    14.5      16.0
#  2    14.0      17.0
#  3    14.5      18.0
#  4    14.0      19.0
#  6    14.0      21.0
# 10    14.0      21.0
# 11    21.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(flux = 14) = 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

The decomposition holds on every random state, and the bound formulas agree with the dynamic programming for every number of vacancies. With no vacancy the flux is exactly 14: the author’s “Fixed-Mode” has no coupling gain at all. The upper bound rises with the number of vacancies: at most 16 with one vacancy, 17 with two, 18 with three, 19 with four, and 21 only from six vacancies on. To collect the full 50 % coupling gain, then, at least half the cells must be empty. The lower bound alternates between 14 and 14.5 with the parity of the number of vacancies, and is forced up to 21 only when all the particles are crowded into one cell (11 vacancies).

Under random allocation the mean flux is 16.2586, matching the formula N+cN(1−1/K)N−1N + cN(1 – 1/K)^{N-1}: the cell holding any given particle has an empty antipode with probability (11/12)13=0.322(11/12)^{13} = 0.322, and the particle then contributes an extra 0.5. The flux equals 14 with probability 0.0246, is at least 18 with probability 0.1275 and reaches the maximum of 21 with probability 0.00304.

Left: exact distribution of the total flux when 14 particles are thrown at random; the dashed line is the mean, 16.26. Right: maximum and minimum total flux for each number of vacancies (exact results from dynamic programming); the horizontal lines mark 14 and 21.

“Coherent superposition” and the choice of extension

The author scores two particles in one cell as +2.0 and calls this “coherent superposition”. The name needs correcting. In wave physics, when two waves of equal amplitude and phase superpose coherently, the amplitudes add, and the intensity (proportional to the square of the amplitude) becomes 4 times that of one wave; only when two mutually incoherent waves superpose do the intensities add, giving 2 times. A score of +2.0 therefore corresponds to incoherent superposition in terms of intensity, or to superposition in terms of amplitude, not to coherent superposition in terms of intensity. The book keeps the author’s +2.0 as a definition of the model and calls the state “superposed”.

The choice of extension is no small matter. The last three lines of the program compare three versions of a(n)a(n) on the same 40,000 random states. Under the linear extension a(n)=na(n) = n, the correlation between entropy and total flux is −0.533: the lower the entropy, the higher the flux, in line with the author’s intuition. Under the saturating extension a(n)=min⁡(n,2)a(n) = \min(n, 2) (a third particle and beyond adds no excitation), the correlation becomes +0.393 and the direction reverses, because concentrated particles are wasted. Under the squared extension a(n)=n2a(n) = n^2 (coherent intensity), the correlation is −0.896 and the mean flux rises to 34.16, almost entirely set by the peak. The model’s qualitative conclusion depends on a choice the author’s framework does not make, and this must be stated before any application.

Symmetry: what does the ring do here?

Calculation

Proposition 3.3 (symmetry). Let the dihedral group D12D_{12} (12 rotations i↦i+ri \mapsto i + r and 12 reflections i↦r−ii \mapsto r – i, 24 elements in all; this is the geometric notation named after the number of sides, which Dummit and Foote write D24D_{24}) act on occupation vectors. (a) The excitation map is D12D_{12}-equivariant: acting and then exciting is the same as exciting and then acting; hence total flux, entropy, vacancies and peak are all invariant under D12D_{12}. The reason is that the antipodal map i↦i+6i \mapsto i + 6 is a central element of D12D_{12}, commuting with every rotation and reflection (Dummit and Foote 2004). (b) By Burnside’s lemma, the (2511)=4,457,400\binom{25}{11} = 4{,}457{,}400 occupation vectors with total 14 fall into 371,516 orbits under rotation and 186,616 orbits under D12D_{12}. (c) By Theorem 3.1, the total flux depends only on the contents of each of the six antipodal pairs: permuting the six pairs in any way, or swapping the two ends of any pair, leaves it unchanged. These transformations form a group of 26⋅6!=46,0802^6 \cdot 6! = 46{,}080 elements, of which D12D_{12} is only a small subgroup.

Calculation

# Symmetry. D12 (12 rotations, 12 reflections) acts on occupation vectors. Is the
# excitation map equivariant? How many orbits (Burnside)? Does the flux use the ring at
# all, or only the six antipodal pairs?
import random
from math import comb, gcd
N, K, C = 14, 12, 0.5

def excite(n):
    return [n[i] if n[i] else C * n[(i + 6) % K] for i in range(K)]

def act(g, n):
    """g = (r, s): i -> s*i + r (mod 12); s = +1 rotation, s = -1 reflection."""
    out = [0] * K
    for i in range(K): out[(g[1] * i + g[0]) % K] = n[i]
    return out

def comp(total, parts):                        # compositions of total into parts
    return comb(total + parts - 1, parts - 1) if total >= 0 else 0

if __name__ == "__main__":
    rng = random.Random(12); G = [(r, s) for r in range(K) for s in (1, -1)]; states = []
    for _ in range(2000):
        n = [0] * K
        for _ in range(N): n[rng.randrange(K)] += 1
        states.append(n)
    eq = all(excite(act(g, n)) == act(g, excite(n)) for g in G for n in states)
    print("D12 has", len(G), "elements; excitation map equivariant on 2,000 states:", eq)
    print("antipodal map commutes with every element of D12:", all(
        act(g, act((6, 1), n)) == act((6, 1), act(g, n)) for g in G for n in states[:50]))
    rot = sum(comp(N // (K // gcd(r, K)), gcd(r, K)) if N % (K // gcd(r, K)) == 0 else 0
              for r in range(K))               # Burnside: vectors fixed by rotations
    ref = 0                                    # ... and by reflections i -> r - i
    for r in range(K):
        fp = sum(1 for i in range(K) if (r - i) % K == i); pr = (K - fp) // 2
        ref += (sum(comp(N - 2 * t, fp) * comp(t, pr) for t in range(N // 2 + 1))
                if fp else comp(N // 2, pr))
    print(f"occupation vectors: {comp(N, K):,}; orbits under rotations C12:"
          f" {rot // K:,}; under D12: {(rot + ref) // (2 * K):,}")
    # Permute the six pairs and swap ends at random (a group of 2^6 * 6! = 46,080).
    adj = lambda n: sum(n[i] * n[(i + 1) % K] for i in range(K))
    same_f = same_adj = 0
    for n in states[:500]:
        perm = list(range(6)); rng.shuffle(perm); m = [0] * K
        for j in range(6):
            a, b = (n[j], n[j + 6]) if rng.random() < 0.5 else (n[j + 6], n[j])
            m[perm[j]], m[perm[j] + 6] = a, b
        same_f += sum(excite(m)) == sum(excite(n)); same_adj += adj(m) == adj(n)
    print(f"random pair permutations, 500 states: flux unchanged {same_f}/500,")
    print(f"   sum of neighbour products unchanged {same_adj}/500")
# D12 has 24 elements; excitation map equivariant on 2,000 states: True
# antipodal map commutes with every element of D12: True
# occupation vectors: 4,457,400; orbits under rotations C12: 371,516; under D12: 186,616
# random pair permutations, 500 states: flux unchanged 500/500,
#    sum of neighbour products unchanged 55/500

The first three lines confirm the equivariance and the orbit counts. The last two lines establish an important fact: after a random permutation of the six antipodal pairs the total flux of all 500 states is unchanged, whereas the sum of neighbour products, which measures whether neighbouring cells are both occupied, is unchanged in only 55. In other words, the total flux makes no use of the neighbour structure of the ring, only of the antipodal pairing; arranging the twelve cells in a ring is redundant for this model, and arranging them as six pairs would do. If the author wants the ring’s neighbour relations to matter in the model (for example, whether a cluster of particles is contiguous), rules that depend on neighbouring cells must be added.

Note

A strict reading of “half-wave”. On ℤ12\mathbb{Z}_{12} the lowest non-zero Fourier mode is e2πij/12e^{2\pi i j / 12}; going halfway round the ring (j→j+6j \to j + 6) it changes sign exactly, which is half a wavelength. In this sense the antipode is the “half-wave” position: every odd Fourier mode changes sign under the antipodal map and every even mode is unchanged. This is a mathematical fact and does not mean that any physical wave travels between the cells.

Hypothesis · not established

Author’s hypothesis: antipodal coupling can be estimated (not yet established). The author conjectures that in some real systems that can be divided into twelve parts with fixed pairings between them (Chapter 5 discusses some candidates), when one part is “vacant” its paired part makes up for its function at about half strength. A testable prediction: with pre-registered data and model, the estimated coupling coefficient cc has a 95 % confidence interval that contains 0.5, and the antipodal-pair model predicts better out of sample than a neighbour-coupling model with the same number of parameters. If the interval for cc excludes 0.5, or the neighbour-coupling model predicts better out of sample, the hypothesis is refuted.

Chapter summary

Once the author’s rules are written as definitions, the total flux decomposes strictly into the contributions of six antipodal pairs (Theorem 3.1). Under linear excitation Φ=N+cS\Phi = N + c S, and the total flux lies between 14 and 21: exactly 14 with no vacancy, and 21 only with at least 6 vacancies; its mean under random allocation is 16.26. The +2.0 the author calls “coherent superposition” corresponds physically to incoherent addition of intensities; with a saturating or squared extension, the size and direction of the correlation between entropy and flux change. The excitation map is equivariant under D12D_{12}, but the total flux is in fact invariant under a much larger group and makes no use of the ring’s neighbour structure. The next chapter leaves combinatorics for a psychological analogy: if a cell in the “zero-thrust” state could feel, what would it feel?

References

Dummit, David S., and Richard M. Foote. 2004. Abstract Algebra. 3rd ed. Wiley.

Fan, Y. (2026). Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks: Algebraic Topology and Monte Carlo Verification on a Twelve-Node Ring Lattice [离散周期网络中的双尺度重整化、占位数分布熵与推力波叠加定理] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23796761 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).