5D Library › Books › 5DL-B-069
回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机
贝叶斯信任雪崩、沉没成本承诺棘轮与跨板块转化矩阵
Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata: Bayesian Trust Avalanches, Sunk-Cost Commitment Ratchets and Cross-Domain Transition Matrices
DOI10.5281/zenodo.24090186摘要
本书研究测算服务中三个常被当作「转化技巧」的机制:以说中过去的回溯断言赢得信任,以价格台阶与沉没成本推动升单,以及从单次测算到命理学堂课程、再到商业牌照的转化链。全部参数都是模型参数,不是任何企业的数据;本书不主张、也不检验任何占断是否应验,并把每一种机制的代价与收益一起计算。
第一章证明「信任雪崩」是感受上的相变而不是证据上的:泛泛的回溯断言真实似然比只有 1.19,怀疑者需要 27 次命中才半信,但若把基率 0.80 误判为 0.20,3 次就够;在 20,000 位模拟用户中,一位没有任何洞察力的测算师在 6 条泛泛断言之内使 0.5263 的用户确信,而按真实似然比更新的用户几乎无人确信。「波谷年份」若是四分之一人群的共同低谷,似然比只有 3.60 而非 13.50。第二章给出三选一的序贯检验,并显示选择性回忆把对错各半的断言记成 0.7493 的准确率,事先记录则为 0.4995。第三章求含抗拒阈值与沉没成本的最优升单跳升比(首单 1.99,计入退款 1.86)与时机(第 7 天的报价收入是次日的数倍)。第四章计算痛点唤醒:计入退款与流失后最优强度仍为 0.63,买家中急性困境者的比例随强度从 0.100 升到 0.206;冷静期与困境筛查两道护栏使这一比例降到 0.056。
第五章把「测算、学堂、牌照」写成吸收马尔可夫链:测算用户成为牌照持有者的概率为 0.0267,LTV 为首单的 4.35 倍,约四分之三来自牌照之路。第六章显示稀有的跨板块转移在 1,000 位用户时区间宽度仍为真值的 0.74 倍;「自己学会算」蚕食的测算收入小于学费;两类用户合成一条链会严重低估长尾留存。第七章与《鬼谷子》的摩篇、飞箝及《韩非子·说难》并读。第八章给出一个用户核算器与一项预注册的盲法检验(152 位参与者)。书中以标注框区分证据、16 段可运行的 Python 程序、原典与假说。
关键词:回溯断言;贝叶斯更新;似然比;巴纳姆效应;基率;选择性回忆;序贯概率比检验;盲法配对检验;升单;价格跳升比;沉没成本;登门槛效应;承诺升级;痛点唤醒;冷静期;弱势消费者;黑暗模式;吸收马尔可夫链;基本矩阵;生命周期价值;转移矩阵;自助法;移动者停留者模型;蚕食;鬼谷子;韩非子;说服;预注册
Abstract
This book studies three mechanisms of reading services that are often treated as "conversion techniques": winning trust with retrodictive statements about the client's past, pushing upsells with price steps and sunk cost, and the conversion chain from a single reading to an academy course to a business licence. All parameters are model parameters, not data from any business; the book neither claims nor tests that any reading comes true, and it computes the costs of each mechanism together with its gains.
Chapter 1 shows that the "trust avalanche" is a transition in feeling, not in evidence: a generic retrodictive statement has a true likelihood ratio of only 1.19, and a sceptic needs 27 hits to be half convinced, but if its base rate of 0.80 is taken for 0.20, 3 suffice; among 20,000 simulated users a reader with no insight at all convinces 0.5263 within 6 generic statements, while users who update with the true ratios are almost never convinced. A "trough year" that is a shared low for a quarter of the population has a likelihood ratio of 3.60, not 13.50. Chapter 2 gives a three-way sequential test and shows that selective recall turns statements right half the time into a remembered accuracy of 0.7493, against 0.4995 when recorded beforehand. Chapter 3 finds the best upsell price ratio under a resistance threshold and sunk cost (1.99 at a first purchase, 1.86 with refunds) and the best timing (an offer on day 7 earns several times one made the next day). Chapter 4 computes pain-point agitation: with refunds and churn counted the best intensity is still 0.63, and the share of buyers in acute distress rises with intensity from 0.100 to 0.206; a cooling-off period and a distress screen together bring it down to 0.056.
Chapter 5 writes "reading, academy, licence" as an absorbing Markov chain: a reader becomes a licensee with probability 0.0267, and her LTV is 4.35 times her first purchase, about three quarters of it from the licence path. Chapter 6 shows that a rare cross-module transition estimated from 1,000 users still has an interval 0.74 times as wide as the true value, that the reading income cannibalized by "learning to read it yourself" is smaller than the course fee, and that pooling two kinds of user into one chain badly underestimates long-tail retention. Chapter 7 reads the "Mo" and "Fei qian" chapters of the Guiguzi and "Shuo nan" of the Han Feizi. Chapter 8 gives a calculator for users and a pre-registered blinded test (152 participants). Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.
Keywords: retrodiction; Bayesian updating; likelihood ratio; Barnum effect; Forer effect; base rates; selective recall; sequential probability ratio test; blinded matching test; upsell; price ratio; sunk cost; foot in the door; escalation of commitment; pain-point agitation; cooling-off period; vulnerable consumers; dark patterns; absorbing Markov chain; fundamental matrix; lifetime value; transition matrix; bootstrap; mover-stayer model; cannibalization; Guiguzi; Han Feizi; persuasion; pre-registration
目录 · Contents
- 序:信任从哪里来,升单往哪里去English 中文Preface: Where Trust Comes From, and Where Upsells Lead
- 第一章 回溯断言与「信任雪崩」English 中文Chapter 1. Retrodictive Statements and the "Trust Avalanche"
- 第二章 公平地检验回溯:序贯检验与选择性回忆English 中文Chapter 2. Testing Retrodiction Fairly: Sequential Tests and Selective Recall
- 第三章 承诺棘轮:价格跳升比与升单时机English 中文Chapter 3. The Commitment Ratchet: Price Ratios and Upsell Timing
- 第四章 痛点唤醒的收益与代价,以及两道护栏English 中文Chapter 4. What Pain-Point Agitation Buys and Costs, and Two Guardrails
- 第五章 三级火箭:测算、学堂与牌照的吸收马尔可夫链English 中文Chapter 5. The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence
- 第六章 跨板块转移矩阵:估计、蚕食与异质性English 中文Chapter 6. Cross-Module Transition Matrices: Estimation, Cannibalization and Heterogeneity
- 第七章 《鬼谷子》的摩与飞箝,《韩非子》的说难English 中文Chapter 7. "Probing" and "Flying and Clamping" in the *Guiguzi*, "The Difficulties of Persuasion" in the *Han Feizi*
- 第八章 一个用户自己的核算器与一项预注册的盲法检验English 中文Chapter 8. A Calculator for the User and a Pre-Registered Blinded Test
How to cite · 引用
Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata: Bayesian Trust Avalanches, Sunk-Cost Commitment Ratchets and Cross-Domain Transition Matrices [回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090186
BibTeX
@book{fan2026retrodictive,
title = {{Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata}: Bayesian Trust Avalanches, Sunk-Cost Commitment Ratchets and Cross-Domain Transition Matrices},
author = {Fan, Yafu},
year = {2026},
publisher = {5D Library},
edition = {Version 1.0.0},
doi = {10.5281/zenodo.24090186},
url = {https://doi.org/10.5281/zenodo.24090186},
note = {Chinese title: 回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机}
}
| DOI | https://doi.org/10.5281/zenodo.24090186 |
|---|---|
| DOI(全部版本 all versions) | https://doi.org/10.5281/zenodo.24090185 |
| ORCID | https://orcid.org/0009-0004-3519-1203 |
| 5D Library ID | 5DL-B-069 |
| 版本 Version | 1.0.0 · 中英双语版 Bilingual edition |
| 出版日期 Date | 2026-11-08 |
| 网址 Online | https://5dlibrary.com/books/retrodictive-belief-locking-sequential-upsell-conversion-automata/ |
| SHA-256 · retrodictive-belief-locking-sequential-upsell-conversion-automata_bilingual_v1.0.0.pdf | 053233da23ec13113ebff605179c491953d129c4e8b55e828185251749b4b331 |
| SHA-256 · retrodictive-belief-locking-sequential-upsell-conversion-automata_en_v1.0.0.pdf | 6b69b099ffa4af5c75de55533da1fc5f62c1a54ccb8de75a515bc61c4424cb6f |
| SHA-256 · retrodictive-belief-locking-sequential-upsell-conversion-automata_zh_v1.0.0.pdf | 88fff1adf833a93801b186c0ea29b90f0a2b77b50ee0e5d3f8746544b4859dd4 |
| Licence · 许可 | Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0). https://creativecommons.org/licenses/by-nc-nd/4.0/ |
Disclosure. The author uses the works of 5D Library, including this book, as the methodological basis of his community courses, the 5D Ascension Cards (Dimensional Shift Card Decks) and the Yafu AI knowledge base, and develops and runs paid online reading software and services on traditional divinatory themes, an academy of chart-reading courses and business-practitioner licences; the conversion models of this book apply directly to those products, so he has a direct commercial interest in its subject. The book promotes no software, course, card deck or service, uses no user or sales data from the author's businesses, and accepts no sponsorship. All its models are offered for mathematical study and teaching only and constitute no promise that any reading comes true and no marketing, pricing or other business advice; the guardrails for users in distress are the author's commitment for his own business, not an option. The test in Chapter 8 must be carried out with pre-registered code by an independent analyst who has no financial relationship with the author and does not know where the statements came from, and its results will be published whether positive or negative.