For an absorbing chain, the inverse of I minus Q records expected transient-state visits. I want the notation, the mechanism, and the failure mode visible at the same time.
Definitions first
A discrete-time Markov chain has transition matrix \(P=(p_{ij})\) and forgets the past after conditioning on the present. Matrix powers \(P^n\) give multi-step transition probabilities.
The definition determines which expressions are legal; only then does the identity become meaningful. An equality in \(\mathcal A\) may change ambient meaning, so I keep \(\mathsf D\) separate from \(\mathsf C\).
A small case in full
This is the algebraic core of the note. Once this line is correct, the surrounding interpretation has something solid to refer to.
The reusable statement
The compact alignment is a local map of the argument: assumptions on the first row, consequence on the second. Any generalisation must preserve that dependency.
A nearby false statement
A stationary distribution need not be unique without irreducibility, and convergence to it can fail without aperiodicity.
I would use the boxed line as a reference later, while returning to the full display whenever a hypothesis becomes uncertain. That division keeps compression from becoming ambiguity.