Four carefully weighted stage evaluations yield fourth-order global accuracy. A small computation will anchor the general statement before the abstraction takes over.
The mathematical object
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)\).
I read the first line as input and the second as output. The symbols \(\forall\) and \(\exists\) are not interchangeable, and neither may be upgraded silently to \(\Longleftrightarrow\).
One explicit computation
The middle display is intentionally dense: it is where signs, bounds, multiplicities, or normalising factors are most likely to be lost.
Why the identity matters
What survives the example is not its particular numbers but the relation encoded by the two rows below. That relation is the part worth transporting to a new setting.
Where it can fail
Order of accuracy and stability region are separate. A high-order explicit method can fail spectacularly on a stiff equation.
The final box is a summary, not a new assumption; the proof still lives in the definitions and the intervening calculation. The source keeps each scope delimiter visible for later inspection.