Lax Equivalence Theorem

A result in numerical analysis for linear initial-value problems asserting that for a consistent linear discretization of a well-posed linear PDE initial-value problem, stability of the discrete scheme is equivalent to convergence: consistency plus stability implies convergence, and for linear schemes convergence implies stability in the appropriate normed setting.