What does Multi-Tier Excitation and Controllability conclude, in numbers, about “Practice and a Pre-Registered Trial”?
Answer: In this invented example L.'s weakest tier is environment (0.30), whose marginal value of 0.154 is far above the others'. The available inputs are an evening course (acting on \(C_5\)), a mentor network (\(C_4\)) and relocation support (\(C_3\)); nothing acts on \(C_1\) or \(C_2\). Step 3 shows that the evening course changes \(\ln S\) by +2.60 under UP and by −0.85 under crowding-out, so its direction can flip; the mentor network and relocation support are positive under both. In step 4, "always take the course" raises the overall outcome only 1.13-fold in 12 months (\(C_5\) from 0.80 to 0.90), while "invest in the weakest reachable tier each month" raises it 2.33-fold (\(C_3\) from 0.30 to 0.60, \(C_4\) from 0.50 to 0.58).
Scope of the numbers: The book presents mathematical models for teaching and research; it is not investment, trading, career, tax or legal advice and must not be used to rate or screen anyone. Marked boxes separate published evidence, runnable Python calculations (16 programs, all checked), 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.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.80Show the full program
# 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))Single source and citation
Fan, Y. (2026). Power-Law Weighting and Bottom-Up Controllability in Multi-Tier Conditional Excitation Systems (Version 1.0.0), Chapter 8: Practice and a Pre-Registered Trial. 5D Library. https://doi.org/10.5281/zenodo.23810093
DOI: 10.5281/zenodo.23810093 · Read the monograph · 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}
}Other chapter answers in this book
- Chapter 1 · Products and Cascades: The Conditional Excitation Equation
- Chapter 2 · Variance Shares: The Author's Weights and Three Ways to Split
- Chapter 3 · Endowment and Timing: The Published Evidence
- Chapter 4 · Environment, Reputation and Luck
- Chapter 5 · Bottom-Up Controllability
- Chapter 6 · Potential and Realization