关于「配对增益矩阵:交叉差分判别互补、独立与替代」,《存量资产的超模串联》给出的定量结论是什么?
结论:账本少的那一栏是交叉差分。它为正,两项资产互补,应当一起经营;它为负,两项资产替代,叠加是浪费;它接近零,各做各的即可。在本书的示意模型里,十五对中有十二对互补、三对替代,组合价值 23,104 比各自相加的 13,668 多出近一万。二阶项占了组合剩余的绝大部分,但三项缺一不可的方案仍需整体检验。
数据口径:在示意模型里,六项资产两两配对的十五对中有十二对互补、三对替代,全部打开时月度价值 23,104,各自相加只有 13,668。 书中参数为示意,不对应任何真实业务、客户、达人或成交;全部计算由书中程序生成。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 13668, 23104
| A. stand-alone monthly value f(i) (illustrative units) | |
| L content library r | 0.30 m=1.10 f= 3,960 |
| K calculators r | 0.10 m=1.35 f= 1,620 |
| A creator pool r | 0.35 m=1.00 f= 4,200 |
| F private funnel r | 0.02 m=1.60 f= 384 |
| D domain matrix r | 0.20 m=1.00 f= 2,400 |
| T checkout #01 r | 0.08 m=1.15 f= 1,104 |
| B. cross-difference D(i,j); C complement, S substitute, | |
| 0 within +-5 % of the smaller stand-alone value | |
| L K A F D T | |
| L - | 1,013 C -966 S 2,288 C -552 S 340 C |
| K | 1,013 C - 903 C 1,055 C 516 C 480 C |
| A | -966 S 903 C - 2,386 C -840 S 244 C |
| F | 2,288 C 1,055 C 2,386 C - 1,363 C 685 C |
| D | -552 S 516 C -840 S 1,363 C - 139 C |
| T | 340 C 480 C 244 C 685 C 139 C - |
| C. pairs | 12 complements, 3 substitutes, 0 near zero |
| f(all six) | 23,104; sum of stand-alone = 13,668 |
| positive pair surplus on the table | 11,411 |
查看完整验算程序
# Chapter 1. p11: pairwise cross-differences of six stock assets.
# Model (all parameters illustrative, not business data): a common pool
# of N reachable people a month; asset i reaches a share r_i of it and
# multiplies the order rate by m_i. Monthly gross value of a set S is
# f(S) = N * v * c0 * R(S) * M(S),
# R(S) = 1 - prod(1 - r_i) (overlapping reach: substitutes)
# M(S) = prod(m_i) (trust and repeat effects: complements)
# Cross-difference D(i,j) = f(ij) - f(i) - f(j) + f(empty).
import math
N, V, C0 = 40000, 30.0, 0.01
ASSETS = [ # code, role, reach r, multiplier m
("L", "content library", 0.30, 1.10),
("K", "calculators", 0.10, 1.35),
("A", "creator pool", 0.35, 1.00),
("F", "private funnel", 0.02, 1.60),
("D", "domain matrix", 0.20, 1.00),
("T", "checkout #01", 0.08, 1.15),
]
def f(idx):
if not idx:
return 0.0
miss = math.prod(1.0 - ASSETS[i][2] for i in idx)
mult = math.prod(ASSETS[i][3] for i in idx)
return N * V * C0 * (1.0 - miss) * mult
def cross(i, j):
return f((i, j)) - f((i,)) - f((j,)) + f(())
def label(i, j, band=0.05):
d = cross(i, j)
ref = min(f((i,)), f((j,)))
if d > band * ref:
return "C"
if d < -band * ref:
return "S"
return "0"
if __name__ == "__main__":
n = len(ASSETS)
print("A. stand-alone monthly value f(i) (illustrative units)")
for i, a in enumerate(ASSETS):
print(" {} {:<16} r={:.2f} m={:.2f} f={:>7,.0f}".format(
a[0], a[1], a[2], a[3], f((i,))))
print("B. cross-difference D(i,j); C complement, S substitute,")
print(" 0 within +-5 % of the smaller stand-alone value")
print(" " + "".join("{:>9}".format(a[0]) for a in ASSETS))
for i in range(n):
row = []
for j in range(n):
row.append(" -" if i == j else "{:>7,.0f} {}".format(
cross(i, j), label(i, j)))
print(" {:<5} ".format(ASSETS[i][0]) + "".join(row))
kinds = {"C": 0, "S": 0, "0": 0}
pos = []
for i in range(n):
for j in range(i + 1, n):
kinds[label(i, j)] += 1
if cross(i, j) > 0:
pos.append(cross(i, j))
print("C. pairs: {} complements, {} substitutes, {} near zero".format(
kinds["C"], kinds["S"], kinds["0"]))
tot = f(tuple(range(n)))
solo = math.fsum(f((i,)) for i in range(n))
print(" f(all six) = {:,.0f}; sum of stand-alone = {:,.0f}".format(
tot, solo))
print(" positive pair surplus on the table = {:,.0f}".format(
math.fsum(pos)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《存量武器库超模组合代数、邻近可能联想图谱与跨业务火力串联母典》第 1 章「配对增益矩阵:交叉差分判别互补、独立与替代」(版本 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}
}