关于「原典考辨:《礼记·学记》的善喻之道与亚里士多德《修辞学》的省略推理」,《身份标签与自我说服的可证伪修辞学》给出的定量结论是什么?
结论:第 3 天就提出邀约,首次成交只有 0.0128,却有 0.3343 的读者因此关上了门。随着首次邀约推迟,到第 14 天,已经准备好的读者占 0.632;两次邀约合计的成交在第 21 天首邀时达到最大值 0.2461。只能邀约一次时,最优是第 20 天,成交 0.1683。若拖到第 42 天才首邀,两次合计只剩 0.1052,这就是「时过然后学,则勤苦而难成」。
数据口径:书中参数为示意;全部计算由书中程序生成;本书不是法律意见,也不是个人化的财务或经营建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(19 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.0128, 0.1052, 0.1683, 0.2461, 0.3343, 0.632
| first offer day | ready by then | accept first | closed | both offers |
|---|---|---|---|---|
| 3 | 0.045 | 0.0128 | 0.3343 | 0.1196 |
| 7 | 0.221 | 0.0589 | 0.2726 | 0.1700 |
| 10 | 0.400 | 0.1005 | 0.2101 | 0.2082 |
| 14 | 0.632 | 0.1453 | 0.1288 | 0.2439 |
| 21 | 0.895 | 0.1673 | 0.0369 | 0.2461 |
| 28 | 0.982 | 0.1390 | 0.0064 | 0.1994 |
| 42 | 1.000 | 0.0722 | 0.0000 | 0.1052 |
| best first-offer day 21 with a follow-up (0.2461) | ||||
| single offer only: best day 20 (0.1683) |
查看完整验算程序
# Chapter 7. p72: "Forbid before it arises; act when it is possible."
# Model: a prospect becomes ready at day T, Weibull with shape 2 and
# scale 14 days. An offer on day t made after readiness is accepted
# with probability 0.30 * exp(-0.05 * (t - T)) (interest decays: the
# time has passed). An offer made before readiness is refused, and
# with probability 0.35 the prospect then stays closed for good. One
# follow-up offer comes 14 days later to those not closed and not
# yet bought. Integrals by the midpoint rule on 0.05-day steps;
# values illustrative.
import math
K, SCALE, P0, DECAY, CLOSE, GAP = 2.0, 14.0, 0.30, 0.05, 0.35, 14
STEP = 0.05
def dens(x):
return (K / SCALE) * (x / SCALE) ** (K - 1) * math.exp(
-(x / SCALE) ** K)
def ready_by(t):
return 1 - math.exp(-(t / SCALE) ** K)
def acc(t, ready):
return P0 * math.exp(-DECAY * (t - ready)) if ready <= t else 0.0
def outcome(t):
"""(accept at first offer, accept over both offers)."""
first, both = [], []
for i in range(int(round((t + GAP) / STEP))):
r = (i + 0.5) * STEP
w = dens(r) * STEP
a1, a2 = acc(t, r), acc(t + GAP, r)
if r <= t:
first.append(w * a1)
both.append(w * (a1 + (1 - a1) * a2))
else:
both.append(w * (1 - CLOSE) * a2)
return math.fsum(first), math.fsum(both)
print("first offer day ready by then accept first closed both offers")
rows = []
for t in (3, 7, 10, 14, 21, 28, 42):
a, b = outcome(t)
closed = (1 - ready_by(t)) * CLOSE
rows.append((b, t))
print("{:15d} {:13.3f} {:12.4f} {:6.4f} {:11.4f}".format(
t, ready_by(t), a, closed, b))
best = max(rows)
print("best first-offer day {} with a follow-up ({:.4f})".format(
best[1], best[0]))
single = max((outcome(t)[0], t) for t in range(1, 43))
print("single offer only: best day {} ({:.4f})".format(single[1],
single[0]))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《身份标签自我实现、群体归属召唤与高客单零抗拒自我说服修辞学》第 7 章「原典考辨:《礼记·学记》的善喻之道与亚里士多德《修辞学》的省略推理」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-142 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026142,
author = {Fan, Yafu},
title = {Self-Fulfilling Identity Labels, In-Group Belonging Calls and the Rhetoric of Resistance-Free High-Ticket Self-Persuasion},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}