What does Da Liu Ren as Group Action and Decision Tree conclude, in numbers, about “The Depth Algebra of She-hai: Arc Sums, Saturation and Disagreement Between Schools”?
Answer: Chapter 4 proves that she-hai depth is a count summed over an arc of the ground plate that saturates quickly, so depth decides only 0.585 of she-hai boards; four common readings together change only 0.0431 of the classes.
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.585
| classes resolved by she-hai | 82 |
| decided by depth | 48 share 0.585 |
| decided by jianji | 24 share 0.293 |
| decided by chawei | 7 share 0.085 |
| decided by zhuixia | 3 share 0.037 |
| candidates in the final pool: {2 | 78, 3: 3, 4: 1} |
| deepest depth reached: {0 | 3, 2: 5, 3: 6, 4: 58, 5: 5, 6: 5} |
| margin first minus second: {0 | 34, 1: 20, 2: 13, 3: 10, 4: 5} |
| example: day gui-wei, s | 4, candidates si/you/hai, depths [1, 4, 3] |
| three transmissions: you -> chou -> si |
Show the full program
# Chapter 4. p41: The she-hai ("wading through harm") depth in all 82
# classes where it is reached. Model: each tied candidate u sits on
# ground palace u - s and walks forward s steps home to palace u; its
# depth counts every ground branch and every lodged stem on the way
# (both ends included) whose element overcomes u. Rule: deepest wins;
# ties go to a candidate on a meng palace, then on a zhong palace, then
# to the day's own upper (yang day: stem side, yin day: branch side).
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"
HARD = ("depth", "jianji", "chawei", "zhuixia")
stage, ncand, top, margin = Counter(), Counter(), Counter(), Counter()
example = None
for k in range(60):
for s in range(12):
r = sanchuan(k, s)
if r[4] not in HARD:
continue
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)])
pool = zei or kk
bi = [u for u in pool if u % 2 == g % 2]
pool = bi or pool
raw = [depth(u, s, "zei" if zei else "ke") for u in pool]
ds = sorted(raw, reverse=True)
stage[r[4]] += 1
ncand[len(pool)] += 1
top[ds[0]] += 1
margin[ds[0] - ds[1]] += 1
if example is None and r[4] == "depth" and len(pool) == 3:
example = (k, s, pool, raw, r[:3])
total = int(math.fsum(stage.values()))
print("classes resolved by she-hai:", total)
for h in HARD:
print(" decided by {:<8} {:3d} share {:.3f}".format(
h, stage[h], stage[h] / total))
print("candidates in the final pool:", dict(sorted(ncand.items())))
print("deepest depth reached: ", dict(sorted(top.items())))
print("margin first minus second: ", dict(sorted(margin.items())))
k, s, pool, ds, tr = example
print("example: day {}-{}, s = {}, candidates {}, depths {}".format(
G[k % 10], B[k % 12], s, "/".join(B[u] for u in pool), ds))
print(" three transmissions:", " -> ".join(B[x] for x in tr))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 4: The Depth Algebra of She-hai: Arc Sums, Saturation and Disagreement Between Schools. 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 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