What does Premise Seeding and Zero-Reactance Persuasion conclude, in numbers, about “Stated or Unstated: the Meta-Analysis of Conclusion Explicitness and a Corrected Blueprint”?
Answer: The meta-analysis gives a clear average answer. Explicit conclusions are on average more persuasive, with a mean correlation of 0.110: a small effect, but a stable direction. Both camps can point to personal experience because the direction of a single small test flips quite often; with 100 readers the probability of a reversal is still 0.138. The advantage of leaving the conclusion unstated appears only in a region of high involvement and high ability.
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: 0.110, 0.138, 100
| n | power | P(sign reversed) |
|---|---|---|
| 40 | 0.103 | 0.251 |
| 100 | 0.193 | 0.138 |
| 250 | 0.411 | 0.041 |
| 646 | 0.800 | 0.003 |
| 1,000 | 0.937 | 0.000 |
| 2,649 | 1.000 | 0.000 |
| r = 0.100: n for 80 % power = 783 | ||
| r = 0.110: n for 80 % power = 647 | ||
| r = 0.123: n for 80 % power = 517 | ||
| P(>= 3 of 10 studies at n = 100 reversed) = 0.150 |
Show the full program
# Chapter 1. p12: why both folk rules survive: small-study sign flips
# A single test of explicit vs implicit conclusions with n readers
# estimates r with Fisher z = atanh(r), standard error 1 / sqrt(n - 3).
# For a true r = 0.110 (O'Keefe 1997 overall mean) we compute, per n:
# power at two-sided alpha 0.05, P(observed r < 0) (a "reversal"), and
# the n needed for 80 % power. Normal approximation, no simulation.
import math
from statistics import NormalDist
Z = NormalDist()
R_TRUE = 0.110
Z_A = Z.inv_cdf(0.975)
Z_B = Z.inv_cdf(0.80)
def power(r, n):
se = 1.0 / math.sqrt(n - 3)
m = math.atanh(r) / se
return (1.0 - Z.cdf(Z_A - m)) + Z.cdf(-Z_A - m)
def p_reverse(r, n):
se = 1.0 / math.sqrt(n - 3)
return Z.cdf(-math.atanh(r) / se)
print(" n power P(sign reversed)")
for n in (40, 100, 250, 646, 1000, 2649):
print("{:>5,} {:>7.3f} {:>17.3f}".format(
n, power(R_TRUE, n), p_reverse(R_TRUE, n)))
for r in (0.100, 0.110, 0.123):
need = ((Z_A + Z_B) / math.atanh(r)) ** 2 + 3
print("r = {:.3f}: n for 80 % power = {:,}".format(
r, math.ceil(need)))
# chance that at least 3 of 10 small studies (n = 100) show reversal
p = p_reverse(R_TRUE, 100)
terms = [math.comb(10, j) * p ** j * (1 - p) ** (10 - j)
for j in range(3, 11)]
print("P(>= 3 of 10 studies at n = 100 reversed) = {:.3f}".format(
math.fsum(terms)))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 1: Stated or Unstated: the Meta-Analysis of Conclusion Explicitness and a Corrected Blueprint. 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
- Chapter 2 · The Reasoning-Path Graph: Proposition Nodes, Completion Probabilities and Branch Points
- Chapter 3 · Timing: Premises Before, At and After the Branch Point
- Chapter 4 · Where the Enthymeme Wins: a Boundary on the Axes of Motivation and Ability
- Chapter 5 · The Reactance Component: Bounds on Threat to Freedom, Anger and Negative Cognitions
- Chapter 6 · The Ownership Gain: How Self-Derived Conclusions Survive Counterargument
- Chapter 7 · Classical Sources: the Analects, the Record of Learning, Aristotle and Plato
- Chapter 8 · Field Tools and Checker Specifications: the Persuasion Ledger, the Calculator and Pre-Registration