What does Discrete Cyclical Networks and Occupancy Entropy conclude, in numbers, about “The Mod-12 Ring Lattice and the Five-Tigers Map: Two-to-One, the Chinese Remainder Theorem and Block Maps”?
Answer: The sixty-term cycle is the subgroup of same-parity pairs in \(\mathbb{Z}_{10} \times \mathbb{Z}_{12}\), isomorphic to \(\mathbb{Z}_{60}\), with inverse \(k \equiv 6s - 5b \pmod{60}\). The five-tigers rule gives the first-month stem \(\equiv 2a + 2 \pmod{10}\), 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 \(x \mapsto 2x\). Years and months are related by the homomorphism \(Y \mapsto 12Y\), 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.
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: 10, 12, 60
| 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-Wu |
Key formula
Show the full program
# 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]}")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 1: The Mod-12 Ring Lattice and the Five-Tigers Map: Two-to-One, the Chinese Remainder Theorem and Block Maps. 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 2 · Shannon Entropy and Peak of an Occupancy Distribution: The Entropy–Peak Bound Theorem
- 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