What does Objection Judo and Deposit Locks conclude, in numbers, about “The Objection Tree: Six Hidden Causes behind Three Sentences”?

Answer: Chapter 1's objection tree shows that, under illustrative priors, 0.734 of those who say "too expensive" are not short of money.

Scope of the numbers: Its customer populations, probabilities and amounts are illustrative; all calculations are generated by its programs; it is not individual legal, financial or investment advice, and it discusses only persuasion that keeps the rules. Chapter 1's objection tree shows that, under illustrative priors, 0.734 of those who say "too expensive" are not short of money.

中文版

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.734

prior entropy H(C)2.528 bits
objection P(O) budget value compare timing partner decline H
too expensive0.395 0.266 0.285 0.209 0.038 0.025 0.177 2.25
most probable cause: value (0.285); not budget0.734
let me think0.320 0.070 0.234 0.117 0.281 0.078 0.219 2.40
most probable cause: timing (0.281); not budget0.930
ask my partner0.143 0.053 0.088 0.053 0.105 0.421 0.281 2.14
most probable cause: partner (0.421); not budget0.947
Show the full program
# Chapter 1. p11: Posterior over six hidden causes behind three surface
# objections: "too expensive", "let me think" and "ask my partner".
# Model: a discrete Bayes net, cause C -> objection O. Priors P(C) and
# likelihoods P(O | C) are illustrative, set by the author for a
# mid-priced consultative sale (a course, a renovation, a service plan).
# Output: P(O), P(C | O) for each objection, the most probable cause
# and the uncertainty left, H(C | O), in bits.
import math

CAUSES = ["budget", "value", "compare", "timing", "partner", "decline"]
PRIOR = [0.15, 0.25, 0.15, 0.15, 0.10, 0.20]
# P(objection | cause). Columns: too expensive, let me think,
# ask my partner, any other remark (so that every row adds to one).
LIK = [
    [0.70, 0.15, 0.05, 0.10],
    [0.45, 0.30, 0.05, 0.20],
    [0.55, 0.25, 0.05, 0.15],
    [0.10, 0.60, 0.10, 0.20],
    [0.10, 0.25, 0.60, 0.05],
    [0.35, 0.35, 0.20, 0.10],
]
OBJ = ["too expensive", "let me think", "ask my partner"]

assert abs(math.fsum(PRIOR) - 1.0) < 1e-12
for row in LIK:
    assert abs(math.fsum(row) - 1.0) < 1e-12


def entropy(p):
    return -math.fsum(x * math.log2(x) for x in p if x > 0)


print("prior entropy H(C) = {:.3f} bits".format(entropy(PRIOR)))
print("{:<15}{:>6}".format("objection", "P(O)")
      + "".join("{:>8}".format(c) for c in CAUSES) + "{:>6}".format("H"))
for j, name in enumerate(OBJ):
    joint = [PRIOR[i] * LIK[i][j] for i in range(len(CAUSES))]
    po = math.fsum(joint)
    post = [x / po for x in joint]
    print("{:<15}{:>6.3f}".format(name, po)
          + "".join("{:>8.3f}".format(x) for x in post)
          + "{:>6.2f}".format(entropy(post)))
    top = max(range(len(CAUSES)), key=lambda i: post[i])
    print("   most probable cause: {} ({:.3f}); not budget: {:.3f}".format(
        CAUSES[top], post[top], 1.0 - post[0]))

Single source and citation

Fan, Y. (2026). Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols (Version 1.0.0), Chapter 1: The Objection Tree: Six Hidden Causes behind Three Sentences. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-146 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026146,
  author    = {Fan, Yafu},
  title     = {Consultative Objection Judo, a Bayesian Decomposition of "Too Expensive" and Deposit-Lock Stopping-Time Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book