What does Da Liu Ren as Group Action and Decision Tree conclude, in numbers, about “The Three Transmissions as a Digraph: Rotation Orbits and Path Shapes”?
Answer: Chapter 5 treats the three transmissions as paths on rotation orbits whose shape is fixed by the order of the step; regular paths take 0.8611 and closed trines 0.1653.
Scope of the numbers: Its parameters about users, archives and prices are illustrative; all calculations are generated by its programs; it analyses the structure and probabilities of a system, makes no personal reading, and is not legal, financial or business advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), 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: 0.1653, 0.8611
| s | ord | regular | trine | punish | repeat | shape of a regular path |
|---|---|---|---|---|---|---|
| 0 | 1 | 0 | 0 | 39 | 3 | - |
| 1 | 12 | 50 | 0 | 0 | 8 | forward chain |
| 2 | 6 | 60 | 0 | 0 | 0 | forward skip |
| 3 | 4 | 53 | 1 | 10 | 4 | three of a square |
| 4 | 3 | 59 | 59 | 0 | 0 | closed triangle |
| 5 | 12 | 60 | 0 | 0 | 0 | generator |
| 6 | 2 | 54 | 0 | 0 | 56 | x, x+6, x |
| 7 | 12 | 60 | 0 | 0 | 0 | generator |
| 8 | 3 | 59 | 59 | 0 | 0 | closed triangle |
| 9 | 4 | 53 | 0 | 10 | 5 | three of a square |
| 10 | 6 | 57 | 0 | 0 | 2 | backward skip |
| 11 | 12 | 55 | 0 | 0 | 3 | backward chain |
| all | --- | 620 | 119 | 59 | 81 | |
| share regular 0.8611, closing into a trine 0.1653 |
Show the full program
# Chapter 5. p51: The three transmissions as a path in the functional
# graph of the rotation x -> x + s. For every regular gate the middle is
# the upper of the initial and the final the upper of the middle, so the
# path is (x, x + s, x + 2s) and its shape is fixed by the order of s in
# Z12. We count, over the 720 classes, regular paths, paths closing into
# a trine group (san he), complete punishment triples and repeated nodes.
from collections import Counter
B = ("zi", "chou", "yin", "mao", "chen", "si", "wu", "wei", "shen",
"you", "xu", "hai")
G = ("jia", "yi", "bing", "ding", "wu", "ji", "geng", "xin", "ren", "gui")
BE = (4, 2, 0, 0, 2, 1, 1, 2, 3, 3, 2, 4) # 0 wood 1 fire 2 earth
GE = (0, 0, 1, 1, 2, 2, 3, 3, 4, 4) # 3 metal 4 water
GONG = (2, 4, 5, 7, 5, 7, 8, 10, 11, 1) # lodging palace of each stem
XING = (3, 10, 5, 0, 4, 8, 6, 1, 2, 9, 7, 11) # punishment map
def ke(a, b):
"""True if element a overcomes element b."""
return (b - a) % 5 == 2
def uniq(xs):
out = []
for x in xs:
if x not in out:
out.append(x)
return out
def depth(u, s, kind, cnt="A", home=True):
"""She-hai depth of upper u walking home from ground (u - s)."""
n = 0
for i in range(s + 1 if home else s):
q = (u - s + i) % 12
for e in [BE[q]] + [GE[g] for g in range(10) if GONG[g] == q]:
if cnt == "B" and kind == "ke":
n += ke(BE[u], e)
else:
n += ke(e, BE[u])
return n
def pick(pool, k, s, kind, v):
g = k % 10
if len(pool) == 1:
return pool[0], "one"
bi = [u for u in pool if u % 2 == g % 2]
if len(bi) == 1:
return bi[0], "biyong"
pool = bi or pool
tied = pool
if v.get("mode", "depth") == "depth":
ds = [depth(u, s, kind, v.get("cnt", "A"), v.get("home", True))
for u in pool]
tied = [u for u, d in zip(pool, ds) if d == max(ds)]
if len(tied) == 1:
return tied[0], "depth"
for lab, r in (("jianji", 2), ("chawei", 0)):
on = [u for u in tied if (u - s) % 12 % 3 == r]
if len(on) == 1:
return on[0], lab
if on:
break
z = GONG[g] if g % 2 == 0 else k % 12
return (z + s) % 12, "zhuixia"
def lessons(k, s):
a = (GONG[k % 10] + s) % 12
c = (k % 12 + s) % 12
return a, (a + s) % 12, c, (c + s) % 12
def sanchuan(k, s, v=None):
"""(initial, middle, final, gate, how) for day k and shift s."""
v = v or {}
g, z = k % 10, k % 12
yang = g % 2 == 0
a, b, c, d = lessons(k, s)
low = ((a, GE[g]), (b, BE[a]), (c, BE[z]), (d, BE[c]))
zei = uniq([u for u, e in low if ke(e, BE[u])])
kk = uniq([u for u, e in low if ke(BE[u], e)])
if s == 0:
gan = bool(zei or kk) or yang
x = a if gan else c
y = (c if gan else a) if XING[x] == x else XING[x]
w = (y + 6) % 12 if XING[y] == y else XING[y]
how = "withke" if zei or kk else ("yangday" if yang else "yinday")
return x, y, w, "fuyin", how
if zei or kk:
x, how = pick(zei or kk, k, s, "zei" if zei else "ke", v)
if how == "one":
how = "chongshen" if zei else "yuanshou"
gate = {"chongshen": "zeike", "yuanshou": "zeike",
"biyong": "biyong"}.get(how, "shehai")
if s == 6:
gate = "fanyin"
return x, (x + s) % 12, (x + 2 * s) % 12, gate, how
if s == 6:
sheng = [t % 12 for t in (z, z + 4, z + 8) if t % 3 == 2][0]
return (sheng + 6) % 12, c, a, "fanyin", "jinglan"
ups = uniq([b, c, d])
p1 = [u for u in ups if ke(BE[u], GE[g])]
p2 = [u for u in ups if ke(GE[g], BE[u])]
same = GONG[g] == z
if (p1 or p2) and not (same and v.get("bz_first")):
x, _ = pick(p1 or p2, k, s, "ke", v)
how = "haoshi" if p1 else "danshe"
return x, (x + s) % 12, (x + 2 * s) % 12, "yaoke", how
if same:
x = (a + 2) % 12 if yang else (d - 2) % 12
return x, a, a, "bazhuan", "bazhuan"
if len({(a, GONG[g]), (b, a), (c, z), (d, c)}) < 4:
x = (GONG[(g + 5) % 10] + s) % 12 if yang else (z + 4) % 12
return x, a, a, "bieze", "bieze"
if yang:
return (9 + s) % 12, c, a, "maoxing", "mao-yang"
return (9 - s) % 12, a, c, "maoxing", "mao-yin"
TRINE = [{0, 4, 8}, {1, 5, 9}, {2, 6, 10}, {3, 7, 11}]
PUN = [{2, 5, 8}, {1, 10, 7}] # yin-si-shen, chou-xu-wei
print(" s ord regular trine punish repeat shape of a regular path")
tot = Counter()
SHAPE = {1: "forward chain", 11: "backward chain", 2: "forward skip",
10: "backward skip", 4: "closed triangle", 8: "closed triangle",
3: "three of a square", 9: "three of a square",
5: "generator", 7: "generator", 6: "x, x+6, x", 0: "-"}
for s in range(12):
c = Counter()
for k in range(60):
x, y, w, gate, how = sanchuan(k, s)
reg = (y, w) == ((x + s) % 12, (x + 2 * s) % 12)
c["reg"] += reg
c["trine"] += {x, y, w} in TRINE
c["pun"] += {x, y, w} in PUN
c["rep"] += len({x, y, w}) < 3
tot.update(c)
order = 12 // [d for d in range(1, 13) if s * d % 12 == 0][0]
order = [d for d in range(1, 13) if s * d % 12 == 0][0]
print("{:2d} {:3d} {:7d} {:5d} {:6d} {:6d} {}".format(
s, order, c["reg"], c["trine"], c["pun"], c["rep"], SHAPE[s]))
print("all --- {:7d} {:5d} {:6d} {:6d}".format(
tot["reg"], tot["trine"], tot["pun"], tot["rep"]))
print("share regular {:.4f}, closing into a trine {:.4f}".format(
tot["reg"] / 720, tot["trine"] / 720))Single source and citation
Fan, Y. (2026). Da Liu Ren Heaven-Earth Plate Permutations, Four-Lesson Three-Transmission Digraphs and the Depth Algebra of the Nine Methods (Version 1.0.0), Chapter 5: The Three Transmissions as a Digraph: Rotation Orbits and Path Shapes. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-153 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026153,
author = {Fan, Yafu},
title = {Da Liu Ren Heaven-Earth Plate Permutations, Four-Lesson Three-Transmission Digraphs and the Depth Algebra of the Nine Methods},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Plates: a Cyclic Permutation Group on Twelve Palaces
- Chapter 2 · The Four Lessons: Lodging Palaces, the Sixty-Day Cycle and Lesson Counts
- Chapter 3 · The Nine Methods as a Decision Tree: Exact Enumeration of 8,640 Situations
- Chapter 4 · The Depth Algebra of She-hai: Arc Sums, Saturation and Disagreement Between Schools
- Chapter 6 · Branch Probabilities and Information: Calendar Sampling, Mutual Information and Uniform Weights
- Chapter 7 · The Classics Examined: the Rengui, the Case Records of Shao Yanhe and Ptolemy's Tetrabiblos
- Chapter 8 · Practice and Falsification: a Style Library, a Pre-registered Test and the Conditions for Refutation