关于「实践与预注册试验」,《多层条件激发与逆向可控性》给出的定量结论是什么?
结论:在这个虚构的例子中,L. 最弱的是环境层(0.30),其边际价值 0.154 远高于其他各层。可用的输入是夜间课程(作用于 \(C_5\))、导师网络(\(C_4\))与迁移支持(\(C_3\)),没有任何输入作用于 \(C_1\) 或 \(C_2\)。第三步显示,夜间课程在 UP 假设下对 \(\ln S\) 的作用是 +2.60,在挤出假设下是 −0.85,方向会翻转;导师网络与迁移支持在两种假设下都为正。第四步中,「一直上课」12 个月后总结果只提高到 1.13 倍(\(C_5\) 从 0.80 升到 0.90),「每月投入最弱的可及层」提高到 2.33 倍(\(C_3\) 从 0.30 升到 0.60,\(C_4\) 从 0.50 升到 0.58)。
数据口径:本书是教学与研究用的数学模型,不是投资、交易、职业、税务或法律建议,也不能用于评价或筛选任何人。 本书把作者的「成功五要素双向金字塔」(先天先验、时机与周期、环境拓扑、声誉博弈、知识投入)写成严格的系统与概率模型,并把作者的模型、已发表的证据与作者的假说分开。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.30, 0.50, 0.58, 0.60, 0.80, 0.90
Step 1 P = 0.0462; marginal gain P / p_i by layer:
C1 prior 0.70 0.0660
C2 timing 0.55 0.0840
C3 environment 0.30 0.1540
C4 reputation 0.50 0.0924
C5 knowledge 0.80 0.0577
Step 2 inputs and the layer each acts on directly:
evening course -> C5 knowledge
mentor network -> C4 reputation
relocation support -> C3 environment
nothing available acts on C1 or C2 directly
Step 3 steady-state change of ln S per unit input
input UP CROWD
evening course +2.60 -0.85 sign flips
mentor network +4.00 +1.70
relocation support +4.25 +2.81
Step 4 always the course: P after 12 months 0.0523 (x1.13)
layers 0.70 0.55 0.30 0.50 0.90
Step 4 weakest reachable: P after 12 months 0.1079 (x2.33)
layers 0.70 0.55 0.60 0.58 0.80查看完整验算程序
# The four-step check-list applied to a FICTIONAL person, "L." (Chapter 8). Layer scores
# (0 to 1, invented) are the factors of the multiplicative model of Chapter 1.
# 1 weakest layer: largest marginal gain P / p_i. 2 inputs available, and the layer
# each acts on. 3 coupling: does an input's steady-state effect on ln S keep its sign
# under the UP and CROWD couplings of p13? 4 feedback: 12 monthly reviews, one unit of
# effort a month, diminishing returns p <- p + 0.06 (1 - p); "always the course" versus
# "the weakest reachable layer each month".
import math
LAYERS = ["C1 prior", "C2 timing", "C3 environment", "C4 reputation", "C5 knowledge"]
p0 = [0.70, 0.55, 0.30, 0.50, 0.80]
INPUTS = {"evening course": 4, "mentor network": 3, "relocation support": 2}
def ln_s_change(j, crowd): # layers 2-5 only (C1 frozen); unit input on layer j
A = [[-1.0 if i == k else 0.5 if i == k + 1 else 0.4 if k == i + 1 else 0.0
for k in range(4)] for i in range(4)]
if crowd: A[1][3] = -0.9 # study time crowds out networking
X = [row[:] + [-1.0 if i == j - 1 else 0.0] for i, row in enumerate(A)]
for c in range(4):
for i in range(4):
if i != c: X[i] = [a - X[i][c] / X[c][c] * b for a, b in zip(X[i], X[c])]
return sum(X[i][4] / X[i][i] for i in range(4))
if __name__ == "__main__":
P = math.prod(p0)
print(f"Step 1 P = {P:.4f}; marginal gain P / p_i by layer:")
for name, pi in zip(LAYERS, p0): print(f" {name:15s} {pi:.2f} {P / pi:.4f}")
print("Step 2 inputs and the layer each acts on directly:")
for k, j in INPUTS.items(): print(f" {k:19s} -> {LAYERS[j]}")
print(" nothing available acts on C1 or C2 directly")
print("Step 3 steady-state change of ln S per unit input")
print(" input UP CROWD")
for k, j in INPUTS.items():
up, cr = ln_s_change(j, False), ln_s_change(j, True)
print(f" {k:19s} {up:+8.2f} {cr:+8.2f}"
+ (" sign flips" if up * cr < 0 else ""))
for policy in ("always the course", "weakest reachable"):
p = p0[:]
for month in range(12):
best = max((2, 3, 4), key=lambda i: math.prod(p) / p[i])
j = 4 if policy == "always the course" else best
p[j] += 0.06 * (1 - p[j])
print(f"Step 4 {policy}: P after 12 months {math.prod(p):.4f}"
f" (x{math.prod(p) / P:.2f})")
print(" layers " + " ".join(f"{x:.2f}" for x in p))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《多层条件激发系统中的幂律权重与逆向控制可及性》第 8 章「实践与预注册试验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23810093
DOI: 10.5281/zenodo.23810093 · 阅读本章所在专著 · 5DL-B-041 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026041,
author = {Fan, Yafu},
title = {Power-Law Weighting and Bottom-Up Controllability in Multi-Tier Conditional Excitation Systems},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23810093},
url = {https://doi.org/10.5281/zenodo.23810093}
}