A disability insurer needs the probability that a healthy life today is disabled three years from now. Chapman-Kolmogorov turns one-step rates into any horizon by summing over intermediate states.
Let be a discrete-time Markov chain on a finite state space . The one-step transition probability is
For a time-homogeneous chain, does not depend on . Collect entries in matrix with in row , column . Each row sums to 1.
Let . Condition on the state at intermediate time , apply the Markov property, and sum:
In matrix form, . For a time-homogeneous chain this collapses to .
KEY: CK is matrix multiplication. Row of dotted with column of yields the entry of .
Common mistakes
- Forgetting the path through Disabled. Writing only. You must add and any other reachable middle state.
- Squaring a time-inhomogeneous matrix. Using instead of gives the wrong answer whenever rates differ by age.
- Wrong product order. , left to right. Reversing flips the conditioning age.
Bottom line
- CK equation: , summing over every state the chain could occupy at the split time.
- Matrix form: time-homogeneous gives ; time-inhomogeneous gives the ordered product , read left to right.
- Markov property is the engine: conditional on the current state, the future ignores the past, which is what lets you condition on and multiply.
- Row sums equal 1 in every transition matrix; absorbing states show 1 on the diagonal and zeros elsewhere, so their column mass only accumulates.
Exam shortcut
For one entry of , write the explicit CK sum over middle state instead of forming the full product. Three multiplies beats nine when you only need one cell. DECISION: Rates depend on age, multiply distinct in order. Rates constant across ages, raise the single to the power . Check absorbing rows first.
The full lesson (about 1,544 words, 10 min read) adds 2 worked examples, all 6 common mistakes, a self-check, free in the app.
Learning objectives
- 1f
Browse all free Exam ALTAM lessons or jump into free Exam ALTAM practice questions.