What does Retrodiction and Upsell Automata conclude, in numbers, about “The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence”?

Answer: 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.

Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.0267, 4.35

   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.

Key formula

\[N = (I - Q)^{-1}\]
Show the full program
# 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.")

Single source and citation

Fan, Y. (2026). Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata (Version 1.0.0), Chapter 5: The Three-Stage Rocket: an Absorbing Markov Chain of Reading, Academy and Licence. 5D Library. https://doi.org/10.5281/zenodo.24090186

DOI: 10.5281/zenodo.24090186 · Read the monograph · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026069,
  author    = {Fan, Yafu},
  title     = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090186},
  url       = {https://doi.org/10.5281/zenodo.24090186}
}

Other chapter answers in this book