What does Supermodular Chaining of Stock Assets conclude, in numbers, about “Supermodular Functions on a Lattice: Topkis's Monotone Comparative Statics and the Single-Practice Pilot Trap”?
Answer: Chapter 2 presents supermodular functions on lattices and Topkis's monotone comparative statics: three reach assets cause 239 violations of supermodularity, substitution makes the best set swap members as conditions change, and complementary connections with high integration costs form a valley in which single pilots lose money while the joint connection gains 963.
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: 239
| A. supermodularity audit (incomparable pairs only) | |
| ground set subsets pairs violations worst gap | |
| all six | 64 1,351 239 -3,251 |
| drop D | 32 285 26 -1,947 |
| drop A | 32 285 22 -1,113 |
| drop A and D | 16 55 0 0 |
| B. increasing differences in the order rate c0 | |
| smallest change in a marginal value when c0 rises | 76.8 |
| (> | 0 means every marginal value rises with c0) |
Show the full program
# Chapter 2. p21: is the asset value function supermodular on the lattice?
# Lattice: all 64 subsets of the six assets of p11, ordered by inclusion,
# join = union, meet = intersection. f is supermodular when
# f(S | T) + f(S & T) >= f(S) + f(T) for every pair S, T.
# We count violations over all unordered incomparable pairs, then repeat
# on sublattices that drop one or both of the reach substitutes A and D.
# Model and parameters are the illustrative ones of p11.
import itertools
import math
N, V, C0 = 40000, 30.0, 0.01
R = [0.30, 0.10, 0.35, 0.02, 0.20, 0.08]
M = [1.10, 1.35, 1.00, 1.60, 1.00, 1.15]
CODES = "LKAFDT"
def f(mask):
idx = [i for i in range(6) if mask >> i & 1]
if not idx:
return 0.0
miss = math.prod(1.0 - R[i] for i in idx)
return N * V * C0 * (1.0 - miss) * math.prod(M[i] for i in idx)
def audit(ground):
sets = []
for k in range(len(ground) + 1):
for c in itertools.combinations(ground, k):
m = 0
for i in c:
m |= 1 << i
sets.append(m)
pairs = bad = 0
worst = 0.0
for a, b in itertools.combinations(sets, 2):
if a & b in (a, b):
continue
pairs += 1
gap = f(a | b) + f(a & b) - f(a) - f(b)
if gap < -1e-9:
bad += 1
worst = min(worst, gap)
return len(sets), pairs, bad, worst
if __name__ == "__main__":
print("A. supermodularity audit (incomparable pairs only)")
print(" ground set subsets pairs violations worst gap")
cases = [("all six", range(6)), ("drop D", (0, 1, 2, 3, 5)),
("drop A", (0, 1, 3, 4, 5)), ("drop A and D", (0, 1, 3, 5))]
for name, g in cases:
n, p, b, w = audit(tuple(g))
print(" {:<16} {:>8} {:>6,} {:>11} {:>10,.0f}".format(
name, n, p, b, w))
print("B. increasing differences in the order rate c0")
worst = None
for lo, hi in ((0.008, 0.010), (0.010, 0.012)):
for a in range(64):
for i in range(6):
if a >> i & 1:
continue
d = (f(a | 1 << i) - f(a)) / C0
gain = d * (hi - lo)
worst = gain if worst is None else min(worst, gain)
print(" smallest change in a marginal value when c0 rises: {:,.1f}"
.format(worst))
print(" (>= 0 means every marginal value rises with c0)")Single source and citation
Fan, Y. (2026). Supermodular Weapon-Arsenals, Adjacent-Possible Recombination Graphs and Cross-Asset Cashflow Chaining (Version 1.0.0), Chapter 2: Supermodular Functions on a Lattice: Topkis's Monotone Comparative Statics and the Single-Practice Pilot Trap. 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 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
- Chapter 8 · Field Tools and Checker Specifications: the Monthly Chaining Ledger, a Pre-Registered Test and Refutation Conditions