关于「决定论、混沌与能动性」,《沙盘、宿命与主动推理》给出的定量结论是什么?
结论:两条轨迹的距离大约每过一个时间单位放大 \(e{0.92} \approx 2.5\) 倍。程序估计的最大李雅普诺夫指数约为 0.92,与文献中常见的约 0.906 接近。由此得到可预测期限:初始误差 \(10{-9}\) 约 23 个时间单位后长到与吸引子同一量级,误差 \(10^{-3}\) 只需约 7.5 个时间单位。初始测量每精确一千倍,可预测期限只增加约 7.5 个时间单位:精度的提升只换来线性的预测延长。
数据口径:本书不是心理治疗或诊断;关于「旧先验驱动重复挫折」的内容是假说与跨学科类比,绝不意味着受害者要为自己的遭遇负责。 书中以标注框区分已发表的证据、可运行的 Python 计算(15 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 10, 7.5
time | separation of the two runs 5 | 6.16e-09 10 | 2.70e-07 15 | 2.47e-05 20 | 1.44e-03 25 | 4.96e-02 30 | 1.02e+01 35 | 2.14e+01 40 | 8.30e+00 largest Lyapunov exponent ~ 0.917 per unit time initial error 1e-09: grows to size 1 after about 22.6 time units initial error 1e-06: grows to size 1 after about 15.1 time units initial error 1e-03: grows to size 1 after about 7.5 time units
核心公式
\[\dot{x} = \sigma(y-x),\qquad \dot{y} = x(\rho - z) - y,\qquad \dot{z} = xy - \beta z,\]
查看完整验算程序
# The Lorenz (1963) system, sigma = 10, rho = 28, beta = 8/3, integrated with fourth-order Runge-Kutta.
# Two runs start 1e-9 apart. Their separation grows roughly as exp(lambda t); lambda (the largest
# Lyapunov exponent) is estimated by repeatedly renormalising a nearby trajectory (Benettin's method).
import math
S, R, B = 10.0, 28.0, 8.0 / 3.0
def deriv(p):
x, y, z = p
return (S * (y - x), x * (R - z) - y, x * y - B * z)
def rk4(p, h):
k1 = deriv(p)
k2 = deriv([p[i] + h / 2 * k1[i] for i in range(3)])
k3 = deriv([p[i] + h / 2 * k2[i] for i in range(3)])
k4 = deriv([p[i] + h * k3[i] for i in range(3)])
return [p[i] + h / 6 * (k1[i] + 2 * k2[i] + 2 * k3[i] + k4[i]) for i in range(3)]
def dist(p, q):
return math.sqrt(sum((a - b) ** 2 for a, b in zip(p, q)))
H = 0.01
a = [1.0, 1.0, 20.0]
for _ in range(2000): # settle onto the attractor
a = rk4(a, H)
b = [a[0] + 1e-9, a[1], a[2]]
print("time | separation of the two runs")
for step in range(1, 4001):
a, b = rk4(a, H), rk4(b, H)
if step % 500 == 0:
print(f"{step * H:4.0f} | {dist(a, b):.2e}")
p = a[:]; q = [p[0] + 1e-8, p[1], p[2]]; total = 0.0; T = 0
for step in range(1, 100001):
p, q = rk4(p, H), rk4(q, H)
if step % 10 == 0:
d = dist(p, q); total += math.log(d / 1e-8); T += 10 * H
q = [p[i] + (q[i] - p[i]) * 1e-8 / d for i in range(3)]
lam = total / T
print(f"largest Lyapunov exponent ~ {lam:.3f} per unit time")
for err in (1e-9, 1e-6, 1e-3):
print(f"initial error {err:.0e}: grows to size 1 after about {math.log(1 / err) / lam:4.1f} time units")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《沙盘、宿命与主动推理》第 6 章「决定论、混沌与能动性」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23738794
DOI: 10.5281/zenodo.23738794 · 阅读本章所在专著 · 5DL-B-015 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026015,
author = {Fan, Yafu},
title = {The Sandbox, Determinism and Active Inference},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23738794},
url = {https://doi.org/10.5281/zenodo.23738794}
}