5D Library › Hundred-Volume Knowledge Hypergraphs, Multimodal Personal Prior Compilation and Autonomous Empire Scaling · 中文
Chapter 1. One Equation, Many Worlds: What a Cross-Disciplinary Isomorphism Is and Is Not
Same operator, different phenomena
A hundred volumes on cycles, brains, markets, attention and organizations keep meeting the same few pieces of mathematics. Wigner called the reach of mathematics into the natural sciences “unreasonable” (Wigner 1960); inside one library the reach is less mysterious, because the same modelling choices are made again and again. The first is the Markov chain: a system with a few states and fixed chances of moving between them. p01 runs one function on three illustrative chains: phases of a cycle, a customer’s state and a server’s queue.
Calculation
# Chapter 1. p01: One operator, three domains. The same code computes
# the long-run distribution of a three-state Markov chain and its mixing
# time (steps until every starting state is within 0.01 of the long run
# in total variation). Illustrative matrices: (i) phases of a cycle
# (expansion, peak, contraction), one step = a month; (ii) a customer
# (active, lapsing, lost), one step = a week; (iii) a server queue
# (idle, busy, overloaded), one step = a second.
DOMAINS = (
("cycle phases", "month",
((0.95, 0.05, 0.00), (0.00, 0.80, 0.20), (0.10, 0.00, 0.90))),
("customer state", "week",
((0.90, 0.10, 0.00), (0.30, 0.50, 0.20), (0.02, 0.00, 0.98))),
("server queue", "second",
((0.60, 0.40, 0.00), (0.30, 0.50, 0.20), (0.00, 0.50, 0.50))),
)
def step(dist, p):
return [sum(dist[i] * p[i][j] for i in range(3)) for j in range(3)]
def long_run(p):
d = [1 / 3] * 3
for _ in range(20000):
d = step(d, p)
return d
def mixing(p, eps=0.01):
pi = long_run(p)
rows = [[1.0 if j == i else 0.0 for j in range(3)] for i in range(3)]
for t in range(1, 100000):
rows = [step(r, p) for r in rows]
if max(0.5 * sum(abs(a - b) for a, b in zip(r, pi))
for r in rows) < eps:
return t
if __name__ == "__main__":
print(" domain unit long-run shares mixing")
for name, unit, p in DOMAINS:
pi = long_run(p)
print(" {:<14} {:<7} {:.3f} {:.3f} {:.3f} {:4d} {}s".format(
name, unit, *pi, mixing(p), unit))
# domain unit long-run shares mixing
# cycle phases month 0.571 0.143 0.286 28 months
# customer state week 0.313 0.063 0.625 73 weeks
# server queue second 0.349 0.465 0.186 7 secondsThe code is identical; the answers are not. The cycle spends 0.571 of its months in expansion and mixes in 28 months; the customer is lost in 0.625 of weeks in the long run and needs 73 weeks to forget where it started; the queue mixes in 7 seconds. An isomorphism shares a form of calculation, not a mechanism and not a time scale. What transfers between domains is the method (how to compute a long-run share and a mixing time); what does not transfer is any number.
Phase locking at two scales
The second recurring piece is Adler’s equation for an oscillator driven by a periodic signal (Adler 1946), which is also the two-oscillator case of Kuramoto’s model (Kuramoto 1984). p02 applies it to a 38 Hz neural rhythm driven at 40 Hz and to a circadian clock of 24.2 hours driven by the day.
Calculation
# Chapter 1. p02: Phase locking (Adler's equation) at two scales. The
# phase difference phi between an oscillator and a periodic drive obeys
# d(phi)/dt = dw - K sin(phi): it locks at sin(phi) = dw / K if |dw| <=
# K, and otherwise slips with beat frequency sqrt(dw^2 - K^2). (i) A
# 38 Hz neural rhythm driven at 40 Hz (time in seconds); (ii) a
# circadian clock of 24.2 hours driven by a 24-hour light-dark cycle
# (time in hours). Coupling strengths K are illustrative. The same
# Euler integration checks each case: the drift of phi per unit time
# over the second half of the run.
from math import asin, pi, sin, sqrt
CASES = (
("40 Hz drive, K 15", 2 * pi * (40 - 38), 15.0, 1e-4),
("40 Hz drive, K 8", 2 * pi * (40 - 38), 8.0, 1e-4),
("24 h light, K 0.01", 2 * pi * (1 / 24 - 1 / 24.2), 0.01, 0.05),
("24 h light, K 0.001", 2 * pi * (1 / 24 - 1 / 24.2), 0.001, 0.05),
)
def simulate(dw, k, dt, cycles=200):
phi, t = 0.0, 0.0
t_end = cycles * 2 * pi / dw
mid = None
while t < t_end:
phi += (dw - k * sin(phi)) * dt
t += dt
if mid is None and t >= t_end / 2:
mid = (phi, t)
return (phi - mid[0]) / (t - mid[1])
if __name__ == "__main__":
print(" case dw/K locks lag deg beat "
"simulated")
for name, dw, k, dt in CASES:
r = dw / k
lag = "{:6.1f}".format(asin(r) * 180 / pi) if r <= 1 else " --"
beat = 0.0 if r <= 1 else sqrt(dw * dw - k * k)
print(" {:<20} {:5.2f} {:<5} {} {:8.4f} {:9.4f}".format(
name, r, "yes" if r <= 1 else "no", lag, beat,
simulate(dw, k, dt)))
print(" ratio of the two drive frequencies: {:,.0f}".format(
40 * 3600 * 24))
# case dw/K locks lag deg beat simulated
# 40 Hz drive, K 15 0.84 yes 56.9 0.0000 0.0000
# 40 Hz drive, K 8 1.57 no -- 9.6909 9.6853
# 24 h light, K 0.01 0.22 yes 12.5 0.0000 0.0000
# 24 h light, K 0.001 2.16 no -- 0.0019 0.0019
# ratio of the two drive frequencies: 3,456,000With coupling strong enough (ratio of detuning to coupling 0.84 and 0.22), both lock, with phase lags of 56.9 and 12.5 degrees; with weaker coupling (1.57 and 2.16), both slip at the beat frequency the formula predicts, and the simulation agrees (9.6853 against 9.6909 per second in the first case). The two drives differ in frequency by a factor of 3,456,000. The isomorphism is exact at the level of the equation; it says nothing about whether a particular brain or body is in the locked or the slipping regime, which must be measured in each.
Hypothesis · not established
The author’s interpretation (not yet tested): for at least two thirds of the volumes in this library, the main calculation of the volume can be written with one or more of the fifteen core primitives of Chapter 3 plus at most one domain-specific operator. What would show it wrong: an independent reader, given the list of primitives and the volumes’ programs, assigns more than one domain-specific operator to more than a third of the volumes.
Summary
A cross-disciplinary isomorphism is a shared form of calculation. The same Markov and phase-locking code runs unchanged across domains whose time scales differ by more than a million; what each domain must supply is its own parameters, and those never transfer.
References
Fan, Y. (2026). Hundred-Volume Knowledge Hypergraphs, Multimodal Personal Prior Compilation and Autonomous Empire Scaling: Cross-Disciplinary Isomorphisms, Zero-Marginal-Cost Replication and Century-Scale Knowledge Preservation [百卷知识超图拓扑、多模态个人先验编译与自主知识帝国标度律] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090260 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).