What does The Explanatory-Depth Razor conclude, in numbers, about “Turning "Fatal" and "Stripping" into Intervals: a Band of Decision Loss, a Small Effect and the Conditions for Refutation”?
Answer: Chapter 6 samples wide illustrative parameters: routing between razor and retrieval cuts net loss by a median of 22.7 %, with 8.2 % at the fifth percentile and 41.2 % at the ninety-fifth, against a median of 5.1 % when the razor is applied to everything.
Scope of the numbers: Parameters are illustrative, all data are synthetic, and every calculation is generated by the book's programs. Chapter 1 measures, in synthetic data, a drop of 1.283 points in self-rated understanding of devices against an interval for facts from -0.263 to 0.063 that includes zero.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only
| net loss reduction as share of baseline, 4,000 draws | |
| policy p05 p50 p95 | |
| razor + lookup | 0.082 0.227 0.412 |
| razor on all | -0.097 0.051 0.234 |
| share of draws where routing loses money | 0.0020 |
| share of draws where routing beats razor-on-all | 1.0000 |
Show the full program
# Chapter 6. p61: "fatal" and "stripping" as a band of loss reduction.
# Per assumption on a decision list: share m is mechanism-type, the rest
# fact-type. False-knowledge rates f_m, f_f. The razor exposes a false
# mechanism claim with d_m; a lookup exposes a false fact with d_f; an
# exposed error is fixed in time with probability a. Loss per decision
# built on a false claim L = 100; razor costs 4, lookup 1.5 per claim.
# We draw every unknown from a wide illustrative range 4,000 times and
# report the 5th, 50th and 95th percentiles of the net loss reduction as
# a share of the baseline loss. No parameter here is an estimate.
import math
import random
rng = random.Random(39661)
DRAWS = 4000
L, C_RAZOR, C_LOOK = 100.0, 4.0, 1.5
def pct(xs, q):
s = sorted(xs)
return s[min(len(s) - 1, int(q * len(s)))]
routed, razor_all, nothing_left = [], [], []
for _ in range(DRAWS):
m = rng.uniform(0.4, 0.7)
f_m, f_f = rng.uniform(0.15, 0.35), rng.uniform(0.05, 0.15)
d_m, d_f = rng.uniform(0.3, 0.7), rng.uniform(0.6, 0.95)
d_rf = rng.uniform(0.05, 0.25) # razor used on a fact claim
a = rng.uniform(0.5, 0.9)
base = math.fsum([m * f_m * L, (1.0 - m) * f_f * L])
save_r = math.fsum([m * f_m * L * d_m * a,
(1.0 - m) * f_f * L * d_f * a,
-m * C_RAZOR, -(1.0 - m) * C_LOOK])
save_a = math.fsum([m * f_m * L * d_m * a,
(1.0 - m) * f_f * L * d_rf * a, -C_RAZOR])
routed.append(save_r / base)
razor_all.append(save_a / base)
nothing_left.append(1.0 if save_r <= 0.0 else 0.0)
print("net loss reduction as share of baseline, {:,} draws".format(DRAWS))
print("policy p05 p50 p95")
for name, xs in (("razor + lookup", routed), ("razor on all", razor_all)):
print("{:<20} {:6.3f} {:6.3f} {:6.3f}".format(
name, pct(xs, 0.05), pct(xs, 0.50), pct(xs, 0.95)))
print("share of draws where routing loses money: {:.4f}".format(
math.fsum(nothing_left) / DRAWS))
better = len([1 for r, z in zip(routed, razor_all) if r > z]) / DRAWS
print("share of draws where routing beats razor-on-all: {:.4f}".format(
better))Single source and citation
Fan, Y. (2026). Shattering the Illusion of Explanatory Depth, Epistemic Calibration and the Razor Separating True Knowledge from Assumed Familiarity (Version 1.0.0), Chapter 6: Turning "Fatal" and "Stripping" into Intervals: a Band of Decision Loss, a Small Effect and the Conditions for Refutation. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-396 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026396,
author = {Fan, Yafu},
title = {Shattering the Illusion of Explanatory Depth, Epistemic Calibration and the Razor Separating True Knowledge from Assumed Familiarity},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Boundary of the Illusion of Explanatory Depth: Strongest for Mechanisms, Weakest for Facts
- Chapter 2 · Calibration, Not Confidence: the Brier Score, Murphy's Decomposition and the Statistical Artefact in the Dunning-Kruger Chart
- Chapter 3 · The Four-Step Razor: Causal Chain, Order of Magnitude, Failure Boundary and Counterexample
- Chapter 4 · Scoring the Assumption List and the Value of Information: Which Assumption to Test First
- Chapter 5 · Reasons Against, the Premortem and Sealing the Ledger against Hindsight
- Chapter 7 · Reading the Classics: the Xunzi on Dispelling Obsession, Chapter Seventy-One of the Laozi and Descartes's Four Rules
- Chapter 8 · Field Tools and Checker Specifications: the False-Knowledge Register, the Four-Step Razor Scorer and a Pre-Registered Test