关于「《孙子·九地》《鬼谷子》揣摩与《墨子》量功分禄」,《弃单、续费与大单筛选》给出的定量结论是什么?

结论:第七章与《孙子·九地》、《鬼谷子》揣篇与摩篇、《墨子·尚贤上》并读,把「揣情」写成问题的信息量(「预算已批准」0.149 比特)。

数据口径:书中的回访率、退订率、续费参数、客户估值与成交率均为示意或合成模型;全部数据由书中程序生成;本书不是法律意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.149

uncertainty before any question: 0.722 bits
budget approvedinformation 0.149 bits
deadline in 90 daysinformation 0.043 bits
team over 10information 0.042 bits
decision makerinformation 0.031 bits
used a consultantinformation 0.011 bits
best three leave 0.507 bits; worst three 0.641 bits
查看完整验算程序
# Chapter 7. p13: "Weigh the power, probe the feelings" - which question
# first? Five yes/no qualification questions, each with P(yes | high
# fit) and P(yes | low fit); prior high-fit share 0.20. The value of a
# question is the mutual information between fit and the answer (bits).
# With answers independent given fit, compare the expected uncertainty
# left after the best three questions and after the worst three.
from itertools import combinations, product
from math import log2

PRIOR = 0.20
QS = {"budget approved": (0.80, 0.25), "team over 10": (0.70, 0.40),
      "deadline in 90 days": (0.60, 0.30), "decision maker": (0.75, 0.50),
      "used a consultant": (0.50, 0.35)}

def h(p):
    return 0.0 if p in (0.0, 1.0) else -p * log2(p) - (1 - p) * log2(1 - p)

def left(names):
    # expected entropy of fit after answering the questions in names
    total = 0.0
    for ans in product((0, 1), repeat=len(names)):
        ph, pl = PRIOR, 1 - PRIOR
        for q, a in zip(names, ans):
            yh, yl = QS[q]
            ph *= yh if a else 1 - yh
            pl *= yl if a else 1 - yl
        total += (ph + pl) * h(ph / (ph + pl))
    return total

if __name__ == "__main__":
    h0 = h(PRIOR)
    print("   uncertainty before any question: {:.3f} bits".format(h0))
    for q in sorted(QS, key=lambda q: left((q,))):
        print("   {:20s} information {:.3f} bits".format(q, h0 - left((q,))))
    sets = sorted(combinations(QS, 3), key=left)
    print("   best three leave {:.3f} bits; worst three {:.3f} bits".format(
        left(sets[0]), left(sets[-1])))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《弃单挽回动力学、沉没数据续费棘轮与高客单顾问筛选机制》第 7 章「《孙子·九地》《鬼谷子》揣摩与《墨子》量功分禄」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090209

DOI: 10.5281/zenodo.24090209 · 阅读本章所在专著 · 5DL-B-079 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026079,
  author    = {Fan, Yafu},
  title     = {Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090209},
  url       = {https://doi.org/10.5281/zenodo.24090209}
}

本书其他章节结论