What does Abandonment, Renewal and Screening conclude, in numbers, about “The Sunzi on the Nine Grounds, the Guiguzi on Probing, and the Mozi on Paying by Merit”?

Answer: Chapter 7 reads the Sunzi's "Nine Grounds", the Guiguzi's "Chuai" and "Mo" chapters and the Mozi's "Exalting the Worthy I", writing "gauging the dispositions" as the information in a question ("budget approved", 0.149 bits).

Scope of the numbers: Return rates, unsubscribe rates, renewal parameters, client valuations and close rates are illustrative or synthetic; all data are generated by its programs; the book is not legal advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.

中文版

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: 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
Show the full program
# 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])))

Single source and citation

Fan, Y. (2026). Cart-Abandonment Recovery Kinetics, Sunk-Data Retention Ratchets and High-Ticket B2B Qualification Mechanisms (Version 1.0.0), Chapter 7: The Sunzi on the Nine Grounds, the Guiguzi on Probing, and the Mozi on Paying by Merit. 5D Library. https://doi.org/10.5281/zenodo.24090209

DOI: 10.5281/zenodo.24090209 · Read the monograph · 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}
}

Other chapter answers in this book