关于「一致性承诺阶梯:登门槛的吸收马尔可夫链与退款回吐」,《身份标签与自我说服的可证伪修辞学》给出的定量结论是什么?

结论:第二章把登门槛写成吸收马尔可夫链,最优阶梯只有两步,成交 0.2258;最大收口压力的净收入只有最优值的 0.679。

数据口径:书中参数为示意;全部计算由书中程序生成;本书不是法律意见,也不是个人化的财务或经营建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(19 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.2258

kreachq_kconvertburdenleft early
01.00000.10000.10001.0000.0000
10.90000.20800.18721.9000.1000
20.74520.30300.22582.6450.2548
30.56770.38670.21953.2130.4323
40.39780.46030.18313.6110.6022
50.25650.52500.13473.8670.7435
60.15220.58200.08864.0190.8478
70.08300.63220.05254.1020.9170
80.04170.67630.02824.1440.9583
90.01930.71520.01384.1630.9807
best k = 2, conversion 0.2258 vs 0.1000 with no ladder
k = 8 converts 0.0282: 0.1248 of the best, burden 4.144
查看完整验算程序
# Chapter 2. p21: The commitment ladder as an absorbing Markov chain.
# Model: before the large (high-ticket) request a reader is asked k
# small requests. Step i (0-based) is completed with probability
# s * (1 - f) ** i (fatigue f); a reader who declines leaves (absorbs).
# Each completed step raises acceptance of the large request through
# consistency: q_k = 1 - (1 - q0) * (1 - c) ** k. Expected number of
# requests a reader receives measures burden. Parameters illustrative.
import math

Q0, C, S, F = 0.10, 0.12, 0.90, 0.08


def chain(k):
    reach, asks, exits = 1.0, [], []
    for i in range(k):
        p = S * (1 - F) ** i
        asks.append(reach)          # reader is asked step i
        exits.append(reach * (1 - p))
        reach *= p
    q = 1 - (1 - Q0) * (1 - C) ** k
    burden = math.fsum(asks) + reach   # small asks plus the large one
    return reach, q, reach * q, burden, math.fsum(exits)


print(" k   reach    q_k     convert   burden   left early")
best = None
for k in range(0, 10):
    reach, q, conv, burden, ex = chain(k)
    print("{:2d}  {:6.4f}  {:6.4f}  {:8.4f}  {:7.3f}  {:10.4f}".format(
        k, reach, q, conv, burden, ex))
    if best is None or conv > best[1]:
        best = (k, conv)
k0 = chain(0)[2]
print("best k = {}, conversion {:.4f} vs {:.4f} with no ladder".format(
    best[0], best[1], k0))
r8 = chain(8)
print("k = 8 converts {:.4f}: {:.4f} of the best, burden {:.3f}".format(
    r8[2], r8[2] / best[1], r8[3]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《身份标签自我实现、群体归属召唤与高客单零抗拒自我说服修辞学》第 2 章「一致性承诺阶梯:登门槛的吸收马尔可夫链与退款回吐」(版本 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}
}

本书其他章节结论