What does Premise Seeding and Zero-Reactance Persuasion conclude, in numbers, about “The Reasoning-Path Graph: Proposition Nodes, Completion Probabilities and Branch Points”?

Answer: The reasoning-path graph breaks persuasion down into two kinds of estimable number: which route a reader takes, and whether she can complete a step unaided. In this chapter's illustrative graph, the most valuable premise sits at the branch point where incomplete information produces a misunderstanding, and its increment is 2.222 times the baseline. Premises that would lower the honest exit are never stated. Premises that help a reader leave honestly are stated even when they lower the probability of the target.

Scope of the numbers: Parameters are illustrative or synthetic, and all calculations are generated by the book's programs. The book is not psychological counselling, not a guarantee of marketing results and not individual business advice.

中文版

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: 2.222

baseline P(T) 0.0557P(C) 0.2430P(N) 0.1945
edgedP(T)dP(C)dP(N)verdict
S->A-0.0078+0.1170-0.0273allowed
S->B+0.0427-0.1215+0.1492blocked: erodes honest exit
A->B+0.0306-0.1215+0.1069blocked: erodes honest exit
B->D+0.1238+0.0000-0.0972allowed
D->E+0.0239+0.0000+0.0000allowed
E->T+0.0139+0.0000+0.0000allowed
best allowed premise: B->D adds 0.1238 to P(T)
ratio best / baseline P(T): 2.222
Show the full program
# Chapter 2. p22: premise value = gain in P(target) from one true premise
# Same graph as p21. Stating a premise on edge u -> v sets its completion
# to 1 (the reader no longer has to supply it) and, at a branch point,
# moves a share ETA of the other branches' choice weight onto u -> v.
# Ethics filter: a premise is allowed only if it is true, checkable and
# does not lower P(C), the honest "free answer is enough" exit.
import math

EDGES = [
    ("S", "A", 0.60, 0.90), ("S", "B", 0.40, 0.70),
    ("A", "C", 0.50, 0.90), ("A", "B", 0.50, 0.60),
    ("B", "D", 0.45, 0.50), ("B", "N", 0.55, 0.80),
    ("D", "E", 1.00, 0.70), ("E", "T", 1.00, 0.80),
]
ENDS = ("T", "C", "N")
ETA = 0.5
TRUE_AND_CHECKABLE = {("S", "A"), ("S", "B"), ("A", "B"), ("B", "D"),
                      ("D", "E"), ("E", "T")}


def outcome(edges, node):
    if node in ENDS:
        return {k: (1.0 if k == node else 0.0) for k in ENDS}
    out = [e for e in edges if e[0] == node]
    sub = {v: outcome(edges, v) for _, v, _, _ in out}
    return {k: math.fsum(w * c * sub[v][k] for _, v, w, c in out)
            for k in ENDS}


def seed(edges, u, v):
    out = [e for e in edges if e[0] == u]
    new = []
    for a, b, w, c in edges:
        if a != u:
            new.append((a, b, w, c))
        elif b == v:
            w2 = w + ETA * (1.0 - w) if len(out) > 1 else w
            new.append((a, b, w2, 1.0))
        else:
            new.append((a, b, w * (1.0 - ETA), c))
    return new


base = outcome(EDGES, "S")
print("baseline P(T) {:.4f}  P(C) {:.4f}  P(N) {:.4f}".format(
    base["T"], base["C"], base["N"]))
print("edge     dP(T)    dP(C)    dP(N)   verdict")
rows = []
for u, v, _, _ in EDGES:
    if v in ("C", "N"):
        continue
    r = outcome(seed(EDGES, u, v), "S")
    d = {k: r[k] - base[k] for k in ENDS}
    if (u, v) not in TRUE_AND_CHECKABLE:
        verdict = "blocked: not verifiable"
    elif d["C"] < -1e-12:
        verdict = "blocked: erodes honest exit"
    else:
        verdict = "allowed"
    rows.append((d["T"], u, v, verdict))
    print("{}->{}   {:+.4f}  {:+.4f}  {:+.4f}   {}".format(
        u, v, d["T"], d["C"], d["N"], verdict))
ok = sorted((r for r in rows if r[3] == "allowed"), reverse=True)
print("best allowed premise: {}->{} adds {:.4f} to P(T)".format(
    ok[0][1], ok[0][2], ok[0][0]))
print("ratio best / baseline P(T): {:.3f}".format(ok[0][0] / base["T"]))

Single source and citation

Fan, Y. (2026). Mid-Stream Premise Seeding, Enthymematic Self-Derivation and Zero-Reactance Persuasion Along Reasoning Paths (Version 1.0.0), Chapter 2: The Reasoning-Path Graph: Proposition Nodes, Completion Probabilities and Branch Points. 5D Library. DOI pending

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

BibTeX
@book{fan2026386,
  author    = {Fan, Yafu},
  title     = {Mid-Stream Premise Seeding, Enthymematic Self-Derivation and Zero-Reactance Persuasion Along Reasoning Paths},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book