5D Library › Two-Scale Renormalization, Occupancy Entropy and Thrust-Wave Superposition in Discrete Cyclical Networks · 中文
Chapter 1 The Mod-12 Ring Lattice and the Five-Tigers Map: Two-to-One, the Chinese Remainder Theorem and Block Maps
Ten, twelve and sixty
Number the ten Heavenly Stems (jia = 0, yi = 1, …, gui = 9) and the twelve Earthly Branches (zi = 0, chou = 1, …, hai = 11). Each runs in its own cycle: the stems count modulo 10 and the branches modulo 12. Stem-and-branch counting of days or years advances both by one step at a time: the -th day (or year) is labelled with stem and branch . Starting from jia-zi () one passes yi-chou, bing-yin and so on to gui-hai (), and the next term is jia-zi again.
This is the book’s first mathematical object. The branches stand in a ring; neighbouring branches are neighbours on the ring, and each branch has an “antipode” six places away: and . The book calls this ring the “mod-12 ring lattice” and writes it ; “lattice” means only a discrete set of sites with a neighbour relation, not any physical crystal.
Calculation
Definition and proposition (the group structure of the sixty-term cycle). The map , , is a group homomorphism (adding indices adds stems and branches separately). Since and , the homomorphism is injective, and its image consists of exactly the 60 pairs in which stem and branch have the same parity: half of all 120 pairs. The inverse has a compact formula. If stem and branch have the same parity, then Check: because is even, and likewise . This is the Chinese remainder theorem for moduli that are not coprime: the system , has a solution if and only if , and the solution is unique modulo 60 (Hardy and Wright 2008). In prime-power form, , whereas ; the extra is the half excluded by the parity condition.
Calculation
# The sixty-term cycle as a group. k in Z60 is sent to (k mod 10, k mod 12) in
# Z10 x Z12 (order 120). Questions: is the map an injective homomorphism, what is its
# image, and how do we invert it? Also: "days have six Jia, branches have five Zi".
from math import gcd
STEMS = "Jia Yi Bing Ding Wu Ji Geng Xin Ren Gui".split()
BRANCHES = "Zi Chou Yin Mao Chen Si Wu Wei Shen You Xu Hai".split()
def to_pair(k):
return k % 10, k % 12
def from_pair(s, b):
"""Inverse on the image (requires s = b mod 2): k = 6s - 5b (mod 60)."""
assert (s - b) % 2 == 0, "stem and branch must have the same parity"
return (6 * s - 5 * b) % 60
if __name__ == "__main__":
pairs = [to_pair(k) for k in range(60)]
print("lcm(10, 12) =", 10 * 12 // gcd(10, 12), "| gcd =", gcd(10, 12))
print("injective:", len(set(pairs)) == 60)
hom = all(to_pair((x + y) % 60) == ((x + y) % 10, (x + y) % 12)
for x in range(60) for y in range(60))
print("homomorphism (labels add when indices add):", hom)
same_parity = {(s, b) for s in range(10) for b in range(12) if (s - b) % 2 == 0}
print("image = all 60 same-parity pairs out of 120:", set(pairs) == same_parity)
print("inverse k = 6s - 5b (mod 60) correct on the image:",
all(from_pair(*to_pair(k)) == k for k in range(60)))
print("no k gives an odd-even pair such as (Jia, Chou) = (0, 1):",
(0, 1) not in set(pairs))
jia = sum(1 for s, _ in pairs if s == 0); zi = sum(1 for _, b in pairs if b == 0)
print(f"Jia stems in one cycle: {jia}; Zi branches: {zi}; {jia} + {zi} = {jia + zi}")
# Prime-power pieces: Z60 = Z4 x Z3 x Z5, Z10 x Z12 = Z2 x Z5 x Z4 x Z3.
print("elements that generate Z60 (Euler phi(60)):",
sum(1 for k in range(60) if gcd(k, 60) == 1))
# Gregorian year Y (counted from Li Chun, start of spring) -> index (Y - 4) mod 60.
for y in (1984, 2024, 2026):
k = (y - 4) % 60
s, b = to_pair(k)
print(f"year {y}: index {k:2d}, pair ({s}, {b:2d}) = {STEMS[s]}-{BRANCHES[b]}")
# lcm(10, 12) = 60 | gcd = 2
# injective: True
# homomorphism (labels add when indices add): True
# image = all 60 same-parity pairs out of 120: True
# inverse k = 6s - 5b (mod 60) correct on the image: True
# no k gives an odd-even pair such as (Jia, Chou) = (0, 1): True
# Jia stems in one cycle: 6; Zi branches: 5; 6 + 5 = 11
# elements that generate Z60 (Euler phi(60)): 16
# year 1984: index 0, pair (0, 0) = Jia-Zi
# year 2024: index 40, pair (0, 4) = Jia-Chen
# year 2026: index 42, pair (2, 6) = Bing-WuThe program checks each part of the proposition: the map is injective and a homomorphism, and its image is the set of all 60 same-parity pairs; an odd–even pair such as “jia-chou” never occurs. In one cycle the stem jia occurs 6 times and the branch zi 5 times, and . Chapter 7 will show that the line “days have six jia, branches have five zi; eleven, and the way of Heaven and Earth is complete” in the Book of Han “Treatise on Pitch-pipes and the Calendar” refers to exactly these two numbers. The last three lines convert Gregorian years: year (with the year boundary at the start of spring, lichun) has index , so 1984 is jia-zi, 2024 jia-chen and 2026 bing-wu.
The five tigers: a two-to-one affine map
Months can also be counted continuously with stems and branches. By the convention of the stem-and-branch calendar, the year begins with the yin month (yin = 2), which is the first month, followed by the mao month, the chen month and so on to the chou month. A month’s branch is fixed: the first month is always yin, the second always mao. Its stem, however, keeps counting on without a break, across the turn of the year. The “two-scale five-tigers renormalisation map” of the author’s framework is the rule that gives the stem of the first month from the stem of the year; the first line of the rhyme is “in jia and ji years, bing leads”: the first month of a jia year or a ji year is bing-yin.
Calculation
Derivation. Let the year have index (year stem ), and let month of that year ( for the yin month) have the running index . If months are counted continuously in the sixty-term cycle and the yin month of a jia year is bing-yin (index 2), then month has label index . The stem of the first month is therefore where is the year stem. This is the “mod-10 affine map” of the framework.
Proposition. is not a permutation of . Proof: , so and always have the same image; is two-to-one, with image , the five yang stems jia, bing, wu, geng and ren. In general an affine map is a permutation if and only if , that is, ; there are such permutations. is not among them.
Calculation
# The five-tigers rule as arithmetic. Stems 0-9 (Jia = 0), branches 0-11 (Zi = 0); months
# counted continuously, month T = 12Y + m (m = 0: Yin month) has label (T + 2) mod 60.
# Is the year-stem -> first-month-stem map f(a) = 2a + 2 (mod 10) a permutation?
STEMS = "Jia Yi Bing Ding Wu Ji Geng Xin Ren Gui".split()
BRANCHES = "Zi Chou Yin Mao Chen Si Wu Wei Shen You Xu Hai".split()
label = lambda k: STEMS[k % 10] + "-" + BRANCHES[k % 12] # label of index k
first_month = lambda y: (12 * y + 2) % 60 # index of the Yin month
if __name__ == "__main__":
# 1. Continuous month count over 60 years: the first-month stem always equals 2a + 2.
ok = all(first_month(y) % 10 == (2 * (y % 10) + 2) % 10 for y in range(60))
print("first-month stem = 2a + 2 (mod 10) in all 60 years:", ok)
print("year stem -> first month (pairs with the same first month)")
for a in range(5):
print(f" {STEMS[a]:4s} or {STEMS[a + 5]:4s} -> {label(first_month(a))}")
image = sorted({(2 * a + 2) % 10 for a in range(10)})
fibres = [[STEMS[a] for a in range(10) if (2 * a + 2) % 10 == s] for s in image]
print("image of f:", [STEMS[s] for s in image], "size", len(image))
print("every image point has", {len(f) for f in fibres}, "pre-images -> f is 2-to-1")
# 2. Kernel of x -> 2x in Z10: the pairs above are its cosets.
kernel = [x for x in range(10) if 2 * x % 10 == 0]
print("kernel of x -> 2x (mod 10):", [STEMS[x] for x in kernel])
# 3. Which affine maps x -> a*x + b (mod 10) ARE permutations? Only gcd(a, 10) = 1.
perm = sorted({a for a in range(10) for b in range(10)
if len({(a * x + b) % 10 for x in range(10)}) == 10})
print("multipliers a giving a permutation of Z10:", perm, "->", 10 * len(perm),
"affine permutations")
# 4. The same arithmetic one scale down: 12 double-hours per day give the hour rule.
ok_h = all((12 * d) % 10 == (2 * d) % 10 for d in range(60))
print("Zi-hour stem = 2d (mod 10) for day stem d:", ok_h,
"| e.g. Yi day ->", label(12 * 1))
# first-month stem = 2a + 2 (mod 10) in all 60 years: True
# year stem -> first month (pairs with the same first month)
# Jia or Ji -> Bing-Yin
# Yi or Geng -> Wu-Yin
# Bing or Xin -> Geng-Yin
# Ding or Ren -> Ren-Yin
# Wu or Gui -> Jia-Yin
# image of f: ['Jia', 'Bing', 'Wu', 'Geng', 'Ren'] size 5
# every image point has {2} pre-images -> f is 2-to-1
# kernel of x -> 2x (mod 10): ['Jia', 'Ji']
# multipliers a giving a permutation of Z10: [1, 3, 7, 9] -> 40 affine permutations
# Zi-hour stem = 2d (mod 10) for day stem d: True | e.g. Yi day -> Bing-ZiThe result is a small table: jia and ji years begin with bing-yin, yi and geng with wu-yin, bing and xin with geng-yin, ding and ren with ren-yin, wu and gui with jia-yin. Ten year stems give only five different first months, the five yin months; yin is the tiger among the twelve animals, and this is where “five tigers” comes from. The framework’s “permutation operator” therefore needs correcting: the map is two-to-one.
The map also has a neat algebraic structure. Multiplication by 2, , is a group homomorphism of into itself with kernel , that is jia, ji. The two year stems that share a first month (jia–ji, yi–geng, bing–xin, ding–ren, wu–gui) are exactly the five cosets of this kernel. In the divinatory tradition these five pairs are called the “five combinations of the stems”; this book treats them only as cosets. The quotient group is isomorphic to the image , one of the simplest examples of the fundamental homomorphism theorem (Dummit and Foote 2004).
The last line of the program shows the same arithmetic one scale down. A day is divided into twelve double-hours. If the double-hours are also counted continuously in the sixty-term cycle, with the zi hour of a jia day being jia-zi, then on a day with stem the zi hour has stem : on a yi day it is bing-zi. The divinatory tradition has a matching “five rats” rhyme; its rule has the same structure as the five-tigers rule, with a different constant term.
Note
Calendrical details and the scope of this book. The derivation assumes that months are counted continuously in the sixty-term cycle with exactly twelve months a year. The stem-and-branch calendar divides months by the solar terms (the yin month begins at the start of spring, the mao month at the “waking of insects”, and so on), and intercalary months take no stem-and-branch label of their own, so the assumption agrees with the calendar’s practice. On the other hand, the current Chinese lunisolar calendar begins its year on the first day of the first lunar month, as the national standard Calculation and Promulgation of the Chinese Calendar (GB/T 33661—2017) states (国家质量监督检验检疫总局、国家标准化管理委员会 2017), while the year (year branch) of the stem-and-branch calendar begins at the moment of the start of spring (apparent solar longitude 315°) and its months (month branches) at the moments of the twelve jie terms (computed by a program in Chapter 8), so the two year boundaries disagree for the days that lie between them (the first day of the first lunar month falls between 21 January and 20 February, the start of spring around 4 February). These are calendrical rules; the book discusses only their arithmetic structure (Reingold and Dershowitz 2018).
Between two scales: homomorphism, block decimation and “renormalisation”
The author’s framework calls the relation between years and months a “self-similar fractal isomorphism between a macroscopic ten-year scale and a microscopic twelve-month scale”, and calls it “renormalisation”. These words have strict meanings in mathematics and physics, and this section checks them one by one.
Calculation
Proposition (the year–month homomorphism). Sending the year index to the offset of its first month gives the homomorphism , . Its image is and its kernel is . Corollaries: (1) every 5 years the labels of all months repeat exactly; (2) conversely, the label of a month tells us which month of the year it is and the year index modulo 5, but pins the year stem down only to one of two (for example jia or ji).
Block decimation. Keeping every twelfth term of the label sequence gives , with step 12 and period 5; keeping every twelfth term again gives step , still period 5; and so on, the steps running 12, 24, 48, 36, 12, … in a cycle of four. The reason: on the image , multiplying by 12 is multiplying by 2, and 2 has order 4 modulo 5.
Calculation
# Two scales, one cycle: month T = 12Y + m has label L(T) = (T + 2) mod 60. What does a
# label say about the year? Image and kernel of Y -> 12Y? Self-similar under decimation?
from math import gcd
L = lambda t: (t + 2) % 60
def period(seq):
for p in range(1, len(seq) + 1):
if all(seq[i] == seq[i % p] for i in range(len(seq))):
return p
if __name__ == "__main__":
# (1) The label determines the month-in-year m and the year only modulo 5.
seen = {}
for y in range(60):
for m in range(12):
seen.setdefault(L(12 * y + m), set()).add((y % 10, m))
years = {len({ys for ys, _ in v}) for v in seen.values()}
months = {len({mm for _, mm in v}) for v in seen.values()}
print("year stems compatible with one month label:", years,
"| months compatible:", months)
same = all(L(12 * y + m) == L(12 * (y + 5) + m) for y in range(60) for m in range(12))
print("month labels repeat every 5 years:", same)
# (2) phi(Y) = 12 Y on Z60: image and kernel.
image = sorted({12 * y % 60 for y in range(60)})
kernel = [y for y in range(60) if 12 * y % 60 == 0]
print("image of Y -> 12Y (mod 60):", image, "| kernel:", kernel[:4], "...",
len(kernel), "elements")
# (3) Decimation: keep every 12th label, repeatedly.
seq = [L(t) for t in range(60 * 12 ** 4)]
print("level keep every step mod 60 period of labels")
for level in range(5):
sub = seq[:: 12 ** level][:60]
step = (sub[1] - sub[0]) % 60
print(f" {level} {12 ** level:6d} {step:2d} {period(sub)}")
print("order of x -> 12x on the image {0,12,24,36,48}:",
next(r for r in range(1, 9) if pow(12, r + 1, 60) == 12))
print("a decimated sequence never has the original period 60 again; gcd(12, 60) =",
gcd(12, 60))
# year stems compatible with one month label: {2} | months compatible: {1}
# month labels repeat every 5 years: True
# image of Y -> 12Y (mod 60): [0, 12, 24, 36, 48] | kernel: [0, 5, 10, 15] ... 12 elements
# level keep every step mod 60 period of labels
# 0 1 1 60
# 1 12 12 5
# 2 144 24 5
# 3 1728 48 5
# 4 20736 36 5
# order of x -> 12x on the image {0,12,24,36,48}: 4
# a decimated sequence never has the original period 60 again; gcd(12, 60) = 12The first line of output shows that a month label is compatible with two year stems and a single month of the year; the second that month labels repeat every 5 years. The decimation table shows why “self-similarity” fails. The original sequence has period 60; after one decimation the period is 5, and however many times one decimates again it stays 5, the step cycling through 12, 24, 48 and 36 without ever returning to the original step of 1. Self-similarity in the strict sense requires the coarse-grained structure to be the same as the original (up to a rescaling); here coarse-graining yields a smaller group, and the structure has changed.
Evidence
What “renormalisation” and “fractal” mean. In statistical physics, Kadanoff’s 1966 “block spin” construction merges neighbouring lattice sites into blocks, replaces the sites by the average state of each block, and asks how the effective parameters of the system change under the merger (Kadanoff 1966). The renormalisation group studies the flow of such parameter transformations and its fixed points; scaling laws appear near a critical point because there the system is unchanged by coarse-graining. The word fractal was introduced by Mandelbrot for geometric objects that show similar structure over a range of scales (at least a wide one), often with a non-integer dimension (Mandelbrot 1982). A finite cyclic group has neither a continuum of scales nor a non-integer dimension.
The book’s conclusion for this part is therefore as follows. The year–month and day–hour scale pairs do share exactly the same algebraic structure (both are the homomorphism ), and that is a strict proposition; but it comes from the common design “one unit divided into 12 sub-units”, not from scale invariance. “Renormalisation” and “fractal” can serve here only as analogies: keeping every twelfth term is a block map, a coarse-graining, which throws information away (the year stem is pinned down only to one of two) and has no scale invariance in the sense of a fixed point.
Chapter summary
The sixty-term cycle is the subgroup of same-parity pairs in , isomorphic to , with inverse . The five-tigers rule gives the first-month stem , a two-to-one affine map rather than a permutation: its image contains only the five yang stems, matching the five yin months, and the pairs of year stems sharing a first month are exactly the cosets of the kernel of . Years and months are related by the homomorphism , so month labels repeat every 5 years; days and double-hours have exactly the same structure. Block decimation changes the period from 60 to 5 and then cycles among four step sizes, so “self-similar fractal” does not hold and “renormalisation” can only be an analogy. The next chapter treats the twelve cells as containers and asks which relations between entropy and peak can be proved once particles are put in.
References
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).