关于「认知流畅度与测试的统计边界」,《文案与结账的算术》给出的定量结论是什么?
结论:第四章度量文案流畅度,并计算 A/B 测试的样本量(3.0% 对 3.6% 每组 13,914 名访客)与中途偷看的代价(看 20 次时假阳性率 0.256)。
数据口径:书中的转化率、退款率与成本参数凡未注明出处的均为示意;全部数据由书中程序生成;本书不是法律意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.256, 13914, 20
| baseline | target | visitors per arm |
|---|---|---|
| 0.030 | 0.033 | 53,211 |
| 0.030 | 0.036 | 13,914 |
| 0.030 | 0.045 | 2,518 |
| 0.100 | 0.110 | 14,751 |
| identical pages, | 1 looks: false-positive rate 0.044 | |
| identical pages, | 5 looks: false-positive rate 0.134 | |
| identical pages, 20 looks: false-positive rate 0.256 |
查看完整验算程序
# Chapter 4. p08: How many visitors to see a lift - and the peeking trap.
# Two-proportion z test, two-sided alpha 0.05, power 0.80:
# n per arm = (z_a sqrt(2 p q) + z_b sqrt(p1 q1 + p2 q2))^2 / (p2 - p1)^2.
# Peeking: checking the p-value after every 500 visitors per arm and
# stopping at the first p < 0.05 inflates the false-positive rate even
# when the two pages are identical. Simulated with a fixed seed.
import random
from math import sqrt, ceil
from statistics import NormalDist
N = NormalDist()
def n_per_arm(p1, p2, alpha=0.05, power=0.80):
za, zb = N.inv_cdf(1 - alpha / 2), N.inv_cdf(power)
p = (p1 + p2) / 2
num = (za * sqrt(2 * p * (1 - p))
+ zb * sqrt(p1 * (1 - p1) + p2 * (1 - p2)))
return ceil(num ** 2 / (p2 - p1) ** 2)
def peeking_fpr(p, looks, step, trials, rng):
hits = 0
for _ in range(trials):
a = b = n = 0
for _ in range(looks):
a += sum(rng.random() < p for _ in range(step))
b += sum(rng.random() < p for _ in range(step))
n += step
pool = (a + b) / (2 * n)
se = sqrt(2 * pool * (1 - pool) / n) or 1
if abs(a - b) / n / se > 1.959964:
hits += 1
break
return hits / trials
if __name__ == "__main__":
print(" baseline target visitors per arm")
for p1, p2 in ((0.03, 0.033), (0.03, 0.036), (0.03, 0.045),
(0.10, 0.11)):
print(" {:8.3f} {:6.3f} {:,}".format(p1, p2, n_per_arm(p1, p2)))
rng = random.Random(77008)
for looks in (1, 5, 20):
print(" identical pages, {:2d} looks: false-positive rate {:.3f}"
.format(looks, peeking_fpr(0.05, looks, 500, 1000, rng)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《说服文案代数、损失框架不对称性与结账微界面工程》第 4 章「认知流畅度与测试的统计边界」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090205
DOI: 10.5281/zenodo.24090205 · 阅读本章所在专著 · 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}
}