What does Supermodular Chaining of Stock Assets conclude, in numbers, about “Classical Sources: Regular and Unusual Forces in the Sunzi, Aristotle on Wholes and Adam Smith on the Extent of the Market”?

Answer: With 5,000 visitors a month the best number of modules is zero: no specialisation can support itself. With 10,000 visitors the best is 1 module, gaining 220 a month; with 20,000, 3 modules gaining 2,151; with 40,000, 5 modules gaining 7,680; with 80,000, 7 modules; with 160,000, 10; and with 320,000, 12 modules gaining 103,490. The break-even audience for the first module is 7,839 visitors.

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: 10, 10000, 103490, 12, 160000, 20000

visitorsbest kgain at best kgain per visitor
5,000000.0000
10,00012200.0220
20,00032,1510.1076
40,00057,6800.1920
80,000720,4070.2551
160,0001047,5450.2972
320,00012103,4900.3234
rule: add module k while N v c0 S e^(-k/3) (1 - e^(-1/3)) > F
break-even visitors for a first module: 7,839
Show the full program
# Chapter 7. p72: the length of a chain is limited by the extent of the
# market (after Smith, Wealth of Nations, Book I, chapter 3).
# A chain of k specialised modules lifts the order rate from c0 to
#   c(k) = c0 * (1 + S * (1 - exp(-k / 3)))
# (diminishing returns to specialisation), and every module costs F a
# month to keep. With N visitors a month and value v per order:
#   profit(k) = N v c(k) - N v c0 - F k   (gain over no chain).
# All parameters illustrative. The best k grows with N; a small market
# cannot carry a long chain.
import math

V, C0, S, F = 30.0, 0.01, 1.2, 800.0


def gain(n, k):
    return n * V * C0 * S * (1.0 - math.exp(-k / 3.0)) - F * k


def best_k(n, kmax=40):
    return max(range(kmax + 1), key=lambda k: (gain(n, k), -k))


if __name__ == "__main__":
    print("  visitors   best k   gain at best k   gain per visitor")
    for n in (5000, 10000, 20000, 40000, 80000, 160000, 320000):
        k = best_k(n)
        g = gain(n, k)
        print("  {:>8,} {:>8} {:>16,.0f} {:>18.4f}".format(
            n, k, g, g / n))
    print("rule: add module k while N v c0 S e^(-k/3) (1 - e^(-1/3)) > F")
    print("break-even visitors for a first module: {:,.0f}".format(
        F / (V * C0 * S * (1.0 - math.exp(-1.0 / 3.0)))))

Single source and citation

Fan, Y. (2026). Supermodular Weapon-Arsenals, Adjacent-Possible Recombination Graphs and Cross-Asset Cashflow Chaining (Version 1.0.0), Chapter 7: Classical Sources: Regular and Unusual Forces in the Sunzi, Aristotle on Wholes and Adam Smith on the Extent of the Market. 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