What does Supermodular Chaining of Stock Assets conclude, in numbers, about “Field Tools and Checker Specifications: the Monthly Chaining Ledger, a Pre-Registered Test and Refutation Conditions”?
Answer: Chapter 8 delivers field tools and checker specifications, a pre-registered test and refutation conditions. Chaining never moves customer data between businesses, and the domain matrix is described only by public site names and content links. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Scope of the numbers: In the illustrative model, twelve of the fifteen pairs of six assets are complements and three are substitutes, and with all six switched on the monthly value is 23,104 against a stand-alone sum of 13,668. Parameters are illustrative and correspond to no real business, customer, creator or sale; all calculations are generated by the book's programs.
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: 20
| id pair D-hat SE class light value flags | |||||
| P1 K+F | 0.0102 0.0034 | C | GREEN | 3,067 | - |
| P2 L+A | -0.0089 0.0038 | S | YELLOW -2,667 | - | |
| P3 L+T | 0.0037 0.0040 | ? | YELLOW | 1,320 | - |
| P4 A+F | 0.0100 0.0036 | C | RED | 2,400 | consent |
| P5 D+T | 0.0070 0.0038 | ? | RED | 1,890 | hops |
| P6 F+T | 0.0106 0.0040 | C | GREEN | 2,220 | - |
| chosen: P1+P6 value 5,287 hours 20 touches 2.0 | |||||
Show the full program
# Chapter 8. p81: one month of the stock-arsenal chaining ledger.
# Six illustrative proposals, each with a 2x2 test (visitors per cell and
# orders per cell: 00, 10, 01, 11), monthly integration hours, extra
# private-channel touches per customer, and four compliance flags:
# consent - personal data crosses businesses only with consent given
# to each business separately (else RED)
# hops - commission paid to anyone but the direct referrer (RED)
# guarded - the plan edits a protected domain or server (RED)
# fake - invented sales, reviews or stock counts (RED)
# Class from the 95 % interval of the cross-difference: C if above 0,
# S if below 0, ? otherwise. GREEN needs class C and no flag; YELLOW is
# class ? (extend the test) or S (do not chain). Among GREEN rows the
# best set under hours <= 40 and touches <= 3.0 is chosen exhaustively.
# Monthly value of a row = D-hat * exposed visitors * 30 (illustrative).
import itertools
import math
PROPS = [ # id, pair, n/cell, orders 00 10 01 11, hours, touches,
# consent ok, hops, guarded, fake, exposed visitors
("P1", "K+F", 9000, (180, 236, 214, 362), 12, 1.0, True, 1, False,
False, 10000),
("P2", "L+A", 9000, (270, 300, 330, 280), 8, 0.5, True, 1, False,
False, 10000),
("P3", "L+T", 6000, (120, 150, 138, 190), 4, 0.0, True, 1, False,
False, 12000),
("P4", "A+F", 9000, (200, 230, 260, 380), 16, 1.5, False, 1, False,
False, 8000),
("P5", "D+T", 6000, (100, 130, 118, 190), 3, 0.0, True, 2, False,
False, 9000),
("P6", "F+T", 7000, (140, 170, 196, 300), 8, 1.0, True, 1, False,
False, 7000),
]
def cross(n, o):
p = [x / n for x in o]
d = p[3] - p[1] - p[2] + p[0]
se = math.sqrt(math.fsum(q * (1 - q) / n for q in p))
return d, se
def judge(row):
pid, pair, n, o, h, t, ok, hops, guard, fake, vis = row
d, se = cross(n, o)
cls = "C" if d - 1.96 * se > 0 else ("S" if d + 1.96 * se < 0 else "?")
flags = []
if not ok:
flags.append("consent")
if hops != 1:
flags.append("hops")
if guard:
flags.append("guarded")
if fake:
flags.append("fake")
light = "RED" if flags else ("GREEN" if cls == "C" else "YELLOW")
return d, se, cls, light, flags, d * vis * 30.0
if __name__ == "__main__":
print(" id pair D-hat SE class light value flags")
green = []
for row in PROPS:
d, se, cls, light, flags, val = judge(row)
print(" {} {:<5} {:>7.4f} {:>6.4f} {:>3} {:<6} {:>6,.0f} {}"
.format(row[0], row[1], d, se, cls, light, val,
",".join(flags) or "-"))
if light == "GREEN":
green.append((row, val))
best = (0.0, ())
for k in range(1, len(green) + 1):
for sel in itertools.combinations(green, k):
h = 0
for r, _ in sel:
h += r[4]
t = math.fsum(r[5] for r, _ in sel)
v = math.fsum(x for _, x in sel)
if h <= 40 and t <= 3.0 + 1e-9 and v > best[0]:
best = (v, tuple(r[0] for r, _ in sel), h, t)
print("chosen: {} value {:,.0f} hours {} touches {:.1f}".format(
"+".join(best[1]), best[0], best[2], best[3]))Single source and citation
Fan, Y. (2026). Supermodular Weapon-Arsenals, Adjacent-Possible Recombination Graphs and Cross-Asset Cashflow Chaining (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: the Monthly Chaining Ledger, a Pre-Registered Test and Refutation Conditions. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-375 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026375,
author = {Fan, Yafu},
title = {Supermodular Weapon-Arsenals, Adjacent-Possible Recombination Graphs and Cross-Asset Cashflow Chaining},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Matrix of Pairwise Gains: Cross-Differences Separate Complements, Independents and Substitutes
- Chapter 2 · Supermodular Functions on a Lattice: Topkis's Monotone Comparative Statics and the Single-Practice Pilot Trap
- Chapter 3 · A Graph of the Adjacent Possible: One-Step Combinations and the Trade-off of Unfamiliarity
- Chapter 4 · The Best Chaining Set: Choosing Under Caps on Working Hours and Contact Frequency
- Chapter 5 · Chaining Cash Flow: the Bottleneck of a Cross-Asset Funnel, Quantiles for the Doubling Slogan and Single-Level Commission
- Chapter 6 · Testing Complementarity: the 2×2 Factorial Test, Standard Errors and Sample Size
- Chapter 7 · Classical Sources: Regular and Unusual Forces in the Sunzi, Aristotle on Wholes and Adam Smith on the Extent of the Market