What does Narrative Transportation and Scroll Rhythms conclude, in numbers, about “Falsify First: Two-Sided Messages, the Size of a Concession and the Persuasion-Knowledge Backfire”?

Answer: Chapter 3 gives the Bayesian account of admitting a flaw: an admission carries a likelihood ratio of 6.0, yet admitting without answering is worse than silence, and pressure wording backfires beyond 4.58 markers per 1000 characters.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not individual legal, advertising-compliance or financial advice, and it teaches no deception. Marked boxes separate published evidence, runnable Python calculations (20 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: 1000, 4.58

markers/1000detectedpersuasion
00.0180.297
10.0470.347
20.1190.365
30.2690.356
40.5000.322
50.7310.281
60.8810.255
70.9530.244
80.9820.242
90.9930.244
100.9980.247
best density 2.17 per 1000 chars, persuasion 0.365
below the no-pressure level (0.297) from 4.58
Show the full program
# Chapter 3. p33: Pressure words and the persuasion-knowledge backfire.
# d = pressure markers per 1000 characters ("act now", "last chance").
# Each marker adds a little direct push, U * ln(1 + d); the chance that
# the reader recognises a tactic is logistic, 1/(1 + exp(-(d - D50)/S));
# recognition cuts the whole effect by PHI (Friestad and Wright 1994
# describe the coping; the numbers here are illustrative):
#   P(d) = (BASE + U * ln(1 + d)) * (1 - PHI * detect(d)).
import math

BASE, U = 0.30, 0.08
D50, S = 4.0, 1.0
PHI = 0.50


def detect(d):
    return 1 / (1 + math.exp(-(d - D50) / S))


def persuade(d):
    return (BASE + U * math.log(1 + d)) * (1 - PHI * detect(d))


print("markers/1000  detected  persuasion")
for d in range(0, 11):
    print("{:12d}  {:8.3f}  {:10.3f}".format(d, detect(d), persuade(d)))
grid = [i / 100 for i in range(1001)]
best = max(grid, key=persuade)
p0 = persuade(0)
back = min(x for x in grid if x > best and persuade(x) < p0)
print("best density {:.2f} per 1000 chars, persuasion {:.3f}".format(
    best, persuade(best)))
print("below the no-pressure level ({:.3f}) from {:.2f}".format(p0, back))

Single source and citation

Fan, Y. (2026). Narrative Transportation, Cognitive-Dissonance Disarming and Dopaminergic Scroll Rhythms in High-Conversion Long-Form Copy (Version 1.0.0), Chapter 3: Falsify First: Two-Sided Messages, the Size of a Concession and the Persuasion-Knowledge Backfire. 5D Library. DOI pending

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

BibTeX
@book{fan2026141,
  author    = {Fan, Yafu},
  title     = {Narrative Transportation, Cognitive-Dissonance Disarming and Dopaminergic Scroll Rhythms in High-Conversion Long-Form Copy},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book