What does Da Liu Ren as Group Action and Decision Tree conclude, in numbers, about “The Four Lessons: Lodging Palaces, the Sixty-Day Cycle and Lesson Counts”?
Answer: The sixty-day cycle is the cyclic subgroup of order 60 in the direct product, and stem and branch always share parity. The lodging table maps ten stems onto eight palaces and avoids the zhong palaces entirely. The four lessons are fixed by palace, branch and step; the distance from palace to branch is uniform on 0 to 11, five days each. Of the 720 classes, 500 have complete lessons, 100 have three, 115 have two and 5 have one. The share of zei and ke runs from 0.025 to 0.392 across the steps, and that swing shapes the distribution of methods in the next chapter.
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.025, 0.392, 100, 11, 115, 500
| s | slots zei | slots ke | days any | days 2+ cand | distinct lessons |
| 0 | 0.025 | 0.025 | 12 | 0 | 2:55 1:5 |
| 1 | 0.133 | 0.108 | 43 | 7 | 4:45 3:10 2:5 |
| 2 | 0.225 | 0.133 | 51 | 11 | 4:45 3:10 2:5 |
| 3 | 0.158 | 0.025 | 36 | 4 | 4:45 3:10 2:5 |
| 4 | 0.275 | 0.158 | 56 | 19 | 4:45 3:10 2:5 |
| 5 | 0.367 | 0.342 | 59 | 32 | 4:45 3:10 2:5 |
| 6 | 0.342 | 0.292 | 54 | 22 | 4:50 2:10 |
| 7 | 0.317 | 0.392 | 60 | 32 | 4:45 3:10 2:5 |
| 8 | 0.133 | 0.250 | 54 | 20 | 4:45 3:10 2:5 |
| 9 | 0.025 | 0.183 | 40 | 6 | 4:45 3:10 2:5 |
| 10 | 0.133 | 0.225 | 48 | 13 | 4:45 3:10 2:5 |
| 11 | 0.133 | 0.158 | 47 | 13 | 4:45 3:10 2:5 |
| all 720: four distinct 500 | three 100 | two 115 | one 5 | |||||
| a random ordered element pair is zei with prob 0.2 |
Show the full program
# Chapter 2. p22: The four lessons over all 60 days x 12 shifts.
# Model: lesson 1 = (palace + s over the day stem), lesson 2 = (its upper
# + s over it), lesson 3 = (branch + s over the day branch), lesson 4 =
# (its upper + s over it). "zei" = lower overcomes upper, "ke" = upper
# overcomes lower. Exact enumeration of the 720 classes; each class
# stands for 12 (general, hour) pairs. Rules: standard Liu Ren.
import math
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"
def relations(k, s):
g, z = k % 10, k % 12
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)])
n = len({(a, GONG[g]), (b, a), (c, z), (d, c)})
return zei, kk, n
print(" s slots zei slots ke days any days 2+ cand distinct lessons")
tot = Counter()
for s in range(12):
nz = nk = anyk = multi = 0
dist = Counter()
for k in range(60):
g, z = k % 10, k % 12
a, b, c, d = lessons(k, s)
low = ((a, GE[g]), (b, BE[a]), (c, BE[z]), (d, BE[c]))
nz += len([1 for u, e in low if ke(e, BE[u])])
nk += len([1 for u, e in low if ke(BE[u], e)])
zei, kk, n = relations(k, s)
anyk += bool(zei or kk)
multi += len(zei or kk) > 1
dist[n] += 1
tot[n] += 1
print("{:2d} {:9.3f} {:8.3f} {:8d} {:12d} {}".format(
s, nz / 240, nk / 240, anyk, multi,
" ".join("{}:{}".format(m, dist[m]) for m in (4, 3, 2, 1)
if dist[m])))
print("all 720: four distinct", tot[4], "| three", tot[3], "| two",
tot[2], "| one", tot[1])
print("a random ordered element pair is zei with prob", 5 / 25)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 2: The Four Lessons: Lodging Palaces, the Sixty-Day Cycle and Lesson Counts. 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 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 5 · The Three Transmissions as a Digraph: Rotation Orbits and Path Shapes
- 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