A one-step method is stable at z when its amplification factor has modulus at most one. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Statement
An initial-value problem \(y'=f(t,y)\), \(y(t_0)=y_0\) generates a flow when existence and uniqueness hold. A numerical method advances discrete states \(y_n\approx y(t_n)\).
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\).
Worked algebra
The computation below is not a second theorem. It is a checksum for the definitions and a place to inspect the difficult LaTeX at full size.
Conceptual compression
The two-row display is also a debugging tool: if the conclusion changes when only notation changes, some hidden choice has entered the argument.
Caveat
Order of accuracy and stability region are separate. A high-order explicit method can fail spectacularly on a stiff equation.
The result is compact enough to reuse without pretending that the caveat has disappeared. The worked line remains the quickest consistency check.