关于「原典考辨:《孙子·兵势》正奇之分、亚里士多德论整体与亚当·斯密论市场范围」,《存量资产的超模串联》给出的定量结论是什么?

结论:每月访客 5,000 时,最优模块数是零:任何专门化都养不活。访客 10,000 时最优是 1 个,月增益 220;20,000 时 3 个,增益 2,151;40,000 时 5 个,增益 7,680;80,000 时 7 个;160,000 时 10 个;320,000 时 12 个,增益 103,490。第一个模块的盈亏平衡访客数是 7,839。

数据口径:在示意模型里,六项资产两两配对的十五对中有十二对互补、三对替代,全部打开时月度价值 23,104,各自相加只有 13,668。 书中参数为示意,不对应任何真实业务、客户、达人或成交;全部计算由书中程序生成。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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
查看完整验算程序
# 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)))))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《存量武器库超模组合代数、邻近可能联想图谱与跨业务火力串联母典》第 7 章「原典考辨:《孙子·兵势》正奇之分、亚里士多德论整体与亚当·斯密论市场范围」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论