5D Library › Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata · 中文
Chapter 5. The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence
States and transitions
The “three-stage rocket” in the author’s outline runs: a user pays for a reading, then enrols in the academy to learn to compute charts herself, and finally buys a SaaS licence to run a reading studio. With one month as a step, this path is an absorbing Markov chain (Kemeny and Snell 1960). The transient states are V (visitor), T (paying reader) and C (academy student); the absorbing states are L (licensee) and X (lapsed).
Write for the transitions among transient states and for those from transient to absorbing states. The entry of the fundamental matrix is the expected number of months spent in before absorption, starting from ; gives the probabilities of absorption in each absorbing state. Discounting monthly income (25 of repeat readings in T, 60 of course instalments in C) and the licence price on entering L (12,537, from Volume 68) at 0.99 a month gives the lifetime value (LTV).
The computation
Calculation
# Chapter 5. [p09] Reading -> academy course -> licence as an absorbing
# Markov chain (one step = one month). Transient states: V visitor,
# T reader (has paid for a reading), C student (in the academy course).
# Absorbing states: L licensee, X lapsed. Rewards: 25 a month in T
# (repeat readings), 60 a month in C (course instalments), 12,537 on
# entering L (the licence price of Vol. 68). Monthly discount 0.99.
# Fundamental matrix N = (I - 0.99 Q)^-1 for discounted values and
# (I - Q)^-1 for counts.
STATES = ("V", "T", "C")
Q = ((0.55, 0.05, 0.00),
(0.00, 0.70, 0.04),
(0.00, 0.00, 0.80))
R = ((0.000, 0.40), # to L, to X
(0.002, 0.258),
(0.030, 0.17))
STAY = (0.0, 25.0, 60.0)
ENTRY_L = 12537.0
def inverse(m):
n = len(m)
a = [list(row) + [1.0 if i == j else 0.0 for j in range(n)]
for i, row in enumerate(m)]
for c in range(n):
piv = max(range(c, n), key=lambda r: abs(a[r][c]))
a[c], a[piv] = a[piv], a[c]
f = a[c][c]
a[c] = [x / f for x in a[c]]
for r in range(n):
if r != c:
g = a[r][c]
a[r] = [x - g * y for x, y in zip(a[r], a[c])]
return [row[n:] for row in a]
def fundamental(delta):
return inverse([[(1.0 if i == j else 0.0) - delta * Q[i][j]
for j in range(3)] for i in range(3)])
def mul(a, b):
return [[sum(a[i][k] * b[k][j] for k in range(len(b)))
for j in range(len(b[0]))] for i in range(len(a))]
if __name__ == "__main__":
n = fundamental(1.0)
b = mul(n, R)
nd = fundamental(0.99)
bd = mul(nd, [[0.99 * r[0]] for r in R])
print(" from P(licence) P(lapse) months to absorption LTV")
for i, s in enumerate(STATES):
months = sum(n[i])
ltv = sum(nd[i][j] * STAY[j] for j in range(3)) + \
bd[i][0] * ENTRY_L
print(" {:4s} {:11.4f} {:9.4f} {:21.2f} {:9.2f}".format(
s, b[i][0], b[i][1], months, ltv))
print(" expected months as reader / student, from T: {:.2f} / {:.2f}"
.format(n[1][1], n[1][2]))
parts = (nd[1][1] * STAY[1], nd[1][2] * STAY[2], bd[1][0] * ENTRY_L)
print(" LTV from T = readings {:.2f} + course {:.2f} + licence {:.2f}"
.format(*parts))
print(" LTV multiplier on a first reading of 99: {:.2f}".format(
sum(parts) / 99))
print("\nReading: a reader becomes a licensee with probability of")
print("under three in a hundred here, yet that path carries most of")
print("her lifetime value; the repeat readings carry the rest.")
# from P(licence) P(lapse) months to absorption LTV
# V 0.0030 0.9970 2.67 46.77
# T 0.0267 0.9733 4.00 430.41
# C 0.1500 0.8500 5.00 2078.60
# expected months as reader / student, from T: 3.33 / 0.67
# LTV from T = readings 81.43 + course 37.21 + licence 311.77
# LTV multiplier on a first reading of 99: 4.35
#
# Reading: a reader becomes a licensee with probability of
# under three in a hundred here, yet that path carries most of
# her lifetime value; the repeat readings carry the rest.From a visitor, the probability of ending as a licensee is 0.0030, absorption takes 2.67 months on average, and the LTV is 46.77. From a reader, the probability of the licence is 0.0267 and the LTV 430.41, 4.35 times a first reading of 99. Of the 430.41, repeat readings contribute 81.43, course fees 37.21 and the licence 311.77: the path taken with a probability under three in a hundred brings about three quarters of the value.
Which link is most worth improving
The program raises each transition probability by 0.005 (taken from lapsing in the same row) and reports how much the LTV of a visitor and of a reader rises.
Calculation
# Chapter 5. [p10] Which link of the funnel is worth improving?
# The chain of p09. Each transition is raised by 0.005 (absolute), the
# probability taken from lapsing in the same row; reported is the
# change in the discounted LTV of a visitor (state V) and of a reader
# (state T).
Q0 = ((0.55, 0.05, 0.00),
(0.00, 0.70, 0.04),
(0.00, 0.00, 0.80))
R0 = ((0.000, 0.40),
(0.002, 0.258),
(0.030, 0.17))
STAY = (0.0, 25.0, 60.0)
ENTRY_L = 12537.0
def solve(q, r, delta=0.99):
# discounted values by iteration (the chain is short-lived)
v = [0.0, 0.0, 0.0]
for _ in range(2000):
v = [STAY[i] + delta * (sum(q[i][j] * v[j] for j in range(3))
+ r[i][0] * ENTRY_L) for i in range(3)]
return v
def bump(link):
q = [list(x) for x in Q0]
r = [list(x) for x in R0]
i, j = link
d = 0.005
if j == "L":
r[i][0] += d
else:
q[i][j] += d
r[i][1] -= d
return q, r
if __name__ == "__main__":
base = solve(Q0, R0)
print(" LTV of a visitor {:.2f}, of a reader {:.2f}".format(
base[0], base[1]))
print(" link +0.005 visitor LTV change reader LTV change")
links = ((("V -> T"), (0, 1)), (("T -> C"), (1, 2)),
(("T -> L"), (1, "L")), (("C -> L"), (2, "L")),
(("T stays"), (1, 1)), (("C stays"), (2, 2)))
for name, link in links:
v = solve(*bump(link))
print(" {:15s} {:12.2f} {:19.2f}".format(
name, v[0] - base[0], v[1] - base[1]))
print("\nReading: per unit of probability, the direct links into the")
print("licence are worth by far the most; of the softer links, the")
print("step from reader to student beats keeping readers longer.")
# LTV of a visitor 46.77, of a reader 430.41
# link +0.005 visitor LTV change reader LTV change
# V -> T 4.68 0.00
# T -> C 3.64 33.51
# T -> L 21.97 202.14
# C -> L 4.18 38.49
# T stays 0.77 7.05
# C stays 0.71 6.54
#
# Reading: per unit of probability, the direct links into the
# licence are worth by far the most; of the softer links, the
# step from reader to student beats keeping readers longer.Per unit of probability, the two links straight into the licence are worth most: raising a reader’s direct move to the licence by 0.005 adds 202.14 to her LTV; the student’s move by the same amount adds 38.49. Among the “softer” links, the move from reader to student (33.51) is worth far more than keeping readers a little longer (7.05). For a visitor, the first purchase (4.68) and the student’s step to the licence (4.18) matter about equally.
Hypothesis · not established
The author’s interpretation (not yet tested): in the author’s business the academy’s main role is not course revenue but turning a small share of readers into practitioners and, in the end, into licensees. What would show this wrong: if the real monthly rate from student to licence is far below this chapter’s 0.030 (for example below 0.005), the academy’s contribution to LTV comes mainly from fees and this chapter’s valuation of the “three-stage rocket” must be cut sharply.
Summary
Written as an absorbing Markov chain, “reading, academy, licence” has closed-form conversion probabilities, times in state and LTV. With this chapter’s parameters a reader’s LTV is 4.35 times her first purchase, about three quarters of it from the licence path taken with a probability under three in a hundred; the links most worth improving are the two into the licence, followed by the step from reader to student.
References
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 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).