What does Copy and Checkout Arithmetic conclude, in numbers, about “Han Feizi, the Wenxin diaolong and the Rhetoric of Gain and Harm”?

Answer: Chapter 7 reads Han Feizi's Shuonan, the Wenxin diaolong and the Strategists, writing "knowing the listener's heart" as a value of information (+34.5%).

Scope of the numbers: Conversion rates, refund rates and costs not attributed to a source are illustrative; 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. printed values that match the answer: 34.5

one appeal for everyone, gain0.1975
one appeal for everyone, loss0.2040
one appeal for everyone, facts0.2375
best single appeal 0.2375; matched to each type 0.3195
value of knowing the listener: +34.5%
reading accuracy 1.00.3195
reading accuracy 0.80.2875
reading accuracy 0.60.2556
Show the full program
# Chapter 7. p13: "Know the heart of the one you persuade" as the value
# of information. Three listener types, each moved by a different appeal
# (gain, loss avoided, plain facts). Acceptance probability by type and
# appeal below (illustrative). A speaker who cannot tell types uses the
# single best appeal for the mix; one who can tell uses each type's best.
TYPES = (("seeks gain", 0.40), ("fears loss", 0.35), ("wants facts", 0.25))
ACCEPT = {"seeks gain": {"gain": 0.30, "loss": 0.18, "facts": 0.20},
          "fears loss": {"gain": 0.15, "loss": 0.32, "facts": 0.20},
          "wants facts": {"gain": 0.10, "loss": 0.08, "facts": 0.35}}

if __name__ == "__main__":
    appeals = ("gain", "loss", "facts")
    for a in appeals:
        tot = sum(w * ACCEPT[t][a] for t, w in TYPES)
        print("   one appeal for everyone, {:5s}: {:.4f}".format(a, tot))
    blind = max(sum(w * ACCEPT[t][a] for t, w in TYPES) for a in appeals)
    known = sum(w * max(ACCEPT[t].values()) for t, w in TYPES)
    print("   best single appeal {:.4f}; matched to each type {:.4f}".format(
        blind, known))
    print("   value of knowing the listener: {:+.1%}".format(
        known / blind - 1))
    for acc in (1.0, 0.8, 0.6):
        # the speaker reads the type correctly with probability acc,
        # otherwise uses a random wrong appeal
        val = 0.0
        for t, w in TYPES:
            best = max(ACCEPT[t], key=ACCEPT[t].get)
            wrong = [ACCEPT[t][a] for a in appeals if a != best]
            val += w * (acc * ACCEPT[t][best] + (1 - acc) * sum(wrong) / 2)
        print("   reading accuracy {:.1f}: {:.4f}".format(acc, val))

Single source and citation

Fan, Y. (2026). Persuasive Copywriting Algebra, Loss-Framing Asymmetry and Checkout Micro-Architecture (Version 1.0.0), Chapter 7: Han Feizi, the Wenxin diaolong and the Rhetoric of Gain and Harm. 5D Library. https://doi.org/10.5281/zenodo.24090205

DOI: 10.5281/zenodo.24090205 · Read the monograph · 5DL-B-077 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026077,
  author    = {Fan, Yafu},
  title     = {Persuasive Copywriting Algebra, Loss-Framing Asymmetry and Checkout Micro-Architecture},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090205},
  url       = {https://doi.org/10.5281/zenodo.24090205}
}

Other chapter answers in this book