A one-step method with local error order p plus one typically has global error order p under stability. A small computation will anchor the general statement before the abstraction takes over.
Notation
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 first display fixes the mathematical data. I label it \(\mathsf{data}\) mentally, while the next is the \(\mathsf{claim}\); the bridge between them is the displayed \(\Longrightarrow\), not an automatic implication.
Stress the formula
Now evaluate one representative case. The result should agree with the structural law above, but it is obtained without assuming the conclusion.
Interpretation
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.
Limit of the argument
Order of accuracy and stability region are separate. A high-order explicit method can fail spectacularly on a stiff equation.
The important habit is to remember what was fixed before the calculation began and what was proved only afterward. The final display preserves that order.