关于「东西方原典考辨:《孙子·九地》的常山之蛇,基尔霍夫 1847 年的电路方程」,《谱间隙与瓶颈割集》给出的定量结论是什么?

结论:第七章考辨《孙子·九地》的常山之蛇与基尔霍夫 1847 年的电路方程。

数据口径:书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,任何生产系统或真实供应链的改动须由主事者人工复核放行。 第八章给出画图、体检、补边、复查的季度闭环,示意工作流三轮补边后代数连通度从 0.1824 升到 1.0000;蒸馏小工具「瓶颈割集体检器」;以及每组 74 个团队季度的预注册检验方案与推翻条件。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

shape lambda2 head->tail tail->head mid->both
plain snake (path)0.1206 33 33 8
tail bitten (cycle)0.4679 1 1 8
two inner sinews0.3820 3 3 1
(rounds until the watched end holds half of its final share)
Wu and Yue in one boat ties lambda2
no tie0 0.0000
one storm tie1 0.3542
left and right hands4 2.0000
查看完整验算程序
# Chapter 7. p71: the Changshan snake of Sunzi's "Nine Grounds" written as
# a graph. A strike at one node is a unit signal that spreads by
# x <- x - eps L x (eps = 1 / (dmax + 1)); "the tail arrives" when the
# tail holds half of its final share 1/n. Shapes: a plain snake (path of
# 9), the snake biting its tail (cycle of 9), and the snake with two
# inner sinews (path plus links 0-4 and 4-8). Then the Wu and Yue men in
# one boat: two groups of four with no tie, then storm ties added.
# All shapes are illustrative readings of the text, not the text itself.
import math


def laplacian(n, edges):
    lap = [[0.0] * n for _ in range(n)]
    for i, j in edges:
        lap[i][j] -= 1.0
        lap[j][i] -= 1.0
        lap[i][i] += 1.0
        lap[j][j] += 1.0
    return lap


def jacobi(mat, tol=1e-22):
    n = len(mat)
    a = [row[:] for row in mat]
    v = [[1.0 if i == j else 0.0 for j in range(n)] for i in range(n)]
    sweeps = 0
    while True:
        off = math.fsum(a[i][j] ** 2 for i in range(n)
                        for j in range(i + 1, n))
        if off < tol or sweeps > 60:
            break
        sweeps += 1
        for p in range(n - 1):
            for q in range(p + 1, n):
                if abs(a[p][q]) < 1e-300:
                    continue
                th = (a[q][q] - a[p][p]) / (2.0 * a[p][q])
                t = math.copysign(1.0, th) / (abs(th) + math.hypot(th, 1.0))
                c = 1.0 / math.sqrt(t * t + 1.0)
                s = t * c
                for k in range(n):
                    akp, akq = a[k][p], a[k][q]
                    a[k][p] = c * akp - s * akq
                    a[k][q] = s * akp + c * akq
                for k in range(n):
                    apk, aqk = a[p][k], a[q][k]
                    a[p][k] = c * apk - s * aqk
                    a[q][k] = s * apk + c * aqk
                for k in range(n):
                    vkp, vkq = v[k][p], v[k][q]
                    v[k][p] = c * vkp - s * vkq
                    v[k][q] = s * vkp + c * vkq
    order = sorted(range(n), key=lambda i: a[i][i])
    vals = [a[i][i] for i in order]
    vecs = [[v[k][i] for k in range(n)] for i in order]
    return vals, vecs, sweeps


def arrive(n, edges, start, watch):
    lap = laplacian(n, edges)
    deg = [lap[i][i] for i in range(n)]
    eps = 1.0 / (max(deg) + 1)
    x = [0.0] * n
    x[start] = 1.0
    goal = 0.5 / n
    for k in range(1, 5000):
        lx = [math.fsum(lap[i][j] * x[j] for j in range(n))
              for i in range(n)]
        x = [x[i] - eps * lx[i] for i in range(n)]
        if all(x[w] >= goal for w in watch):
            return k
    return -1


n = 9
shapes = [("plain snake (path)", [(i, i + 1) for i in range(8)]),
          ("tail bitten (cycle)", [(i, (i + 1) % 9) for i in range(9)]),
          ("two inner sinews", [(i, i + 1) for i in range(8)]
           + [(0, 4), (4, 8)])]
print("shape                lambda2  head->tail  tail->head  mid->both")
for name, es in shapes:
    lam = jacobi(laplacian(n, es))[0][1]
    print("%-20s %7.4f  %10d  %10d  %9d"
          % (name, lam, arrive(n, es, 0, [8]), arrive(n, es, 8, [0]),
             arrive(n, es, 4, [0, 8])))
print("(rounds until the watched end holds half of its final share)")
print()
wu = [(a, b) for a in range(4) for b in range(a + 1, 4)]
yue = [(a + 4, b + 4) for a, b in wu]
print("Wu and Yue in one boat     ties  lambda2")
for label, ties in (("no tie", []), ("one storm tie", [(3, 4)]),
                    ("left and right hands", [(0, 4), (1, 5), (2, 6),
                                              (3, 7)])):
    lam = jacobi(laplacian(8, wu + yue + ties))[0][1]
    lam = 0.0 if lam < 1e-9 else lam
    print("%-25s %5d  %7.4f" % (label, len(ties), lam))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《图拉普拉斯谱间隙、奇格常数与多智能体工作流及跨国供应链单点瓶颈割集母典》第 7 章「东西方原典考辨:《孙子·九地》的常山之蛇,基尔霍夫 1847 年的电路方程」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-243 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026243,
  author    = {Fan, Yafu},
  title     = {Graph-Laplacian Spectral Gaps and Cheeger Constants: Single-Point Bottleneck Cuts in Multi-Agent Workflows and Cross-Border Supply Chains},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论