How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Stability regions and stiff equations
1 · Prerequisites
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Darboux, L'Hôpital, and Taylor's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear multistep methods and Dahlquist equivalence
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- One-step ODE Consistency and Local Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Runge–Kutta Methods and Order
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page defines scalar absolute-stability regions for one-step and constant-step multistep methods. It proves the forward-Euler disk, backward-Euler A/L-stability, trapezoidal A-stability without stiff decay, and BDF2 A-stability and fast-mode damping from its two characteristic roots.
Scalar test stability does not imply a matrix contraction or an accuracy guarantee. Fast/slow examples make the step restriction and stiff damping behavior explicit. Positivity preservation is a separate property; see positive-conservative-production-destruction-integrators.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Matrix-step contractivity and the logarithmic norm in a specified inner product
Definition
Let be an integer and let be symmetric positive definite. Define the inner product and its vector norm on by
For , its induced operator norm is . A matrix step is contractive in this specified inner product when .
For , its logarithmic norm in the same inner product is
In the Euclidean inner product , write and . A real matrix is normal when and nonnormal otherwise.
For a rational stability function , the matrix step is defined only when is invertible; its contractivity is the separate condition .
Scalar absolute stability, A-stability, L-stability, and multistep root regions
Definition
For the scalar test equation , a step size gives . A one-step scalar update has stability function when one step sends to . If is rational, write it in reduced form; it is defined at exactly when its denominator is nonzero there. Its absolute-stability region is
The update is A-stable when the closed left half-plane is contained in . A rational one-step update is L-stable when it is A-stable and
where the limit means that the values tend to zero along every sequence in the closed left half-plane whose modulus tends to infinity.
For a linear multistep method with the coefficient and polynomial convention of Linear multistep methods, consistency, order, and the root condition, substitution of the scalar test equation gives the characteristic polynomial
The multistep absolute-stability region consists of those for which the leading coefficient is nonzero and every root of satisfies the root condition: all roots have modulus at most one, and every root of modulus one is simple. This criterion concerns constant-step scalar test recurrences.
Remarks
Absolute stability is a scalar test-equation property. It does not itself assert an accuracy bound for an ODE solution, contractivity of a matrix step, positivity preservation, or conservation.
Backward Euler is A-stable and L-stable
Statement
Backward Euler on is the scalar update , where . Its stability function is
It is A-stable and L-stable.
Facts & Assumptions
Given: The backward-Euler scalar update, , , and .
Scalar absolute stability, A-stability, L-stability, and multistep root regions: A-stability requires to be defined and satisfy for every ; L-stability additionally requires the limit zero at infinity through that half-plane.
Proof
If , then . Solving the stated update gives , so .
For , . Therefore on the closed left half-plane, proving A-stability by [F1].
The reverse triangle inequality gives , so as within . By [F1] the method is L-stable.
The trapezoidal rule is A-stable but not L-stable
Statement
The trapezoidal rule on is
Its stability function is . It is A-stable but not L-stable.
Facts & Assumptions
Given: The trapezoidal scalar update, , , and .
Scalar absolute stability, A-stability, L-stability, and multistep root regions: A-stability requires to be defined and for every ; L-stability additionally requires the limit zero at infinity through that half-plane.
Proof
If , then . Solving the stated update gives .
For , . Thus throughout the closed left half-plane, proving A-stability by [F1].
Along the negative real axis , , the multiplier is and tends to as . Its modulus therefore tends to one, not zero, so the L-stability limit in [F1] fails.
BDF2 roots on or outside the unit disk map to the closed right half-plane
Statement
On a uniform grid, the variable-step BDF2 algorithm of Variable-step BDF2 with an explicit local implicit-branch rule has the scalar test-equation polynomial
If is a root and , then . Equality is possible only for and .
Facts & Assumptions
Given: A uniform step , the scalar test equation , and a root of the BDF2 test polynomial.
Variable-step BDF2 with an explicit local implicit-branch rule: when adjacent step ratios equal one, the update is .
Linear multistep methods, consistency, order, and the root condition: a linear multistep method has characteristic polynomials and , and substitution of gives the characteristic polynomial .
Scalar absolute stability, A-stability, L-stability, and multistep root regions: the test variable is , and the multistep test polynomial is .
Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive: complex modulus is nonnegative and definite, , and .
Complex modulus restricts to real absolute value: the complex modulus of the embedded real number is .
Proof
Setting in [F1] gives . Substituting and a trial mode , the polynomial convention in [F2] gives .
The constant term is one, so . Put , , and . By [F4] and [F5], , so . Solving the equation in step 1.1 for gives . Writing , [F4] gives and hence ; therefore .
If , then step 2.1 gives , hence . If , then , so ; equality forces . Writing , [F4] gives , so and , hence and . This proves both assertions.
Forward Euler has the closed unit disk centered at −1 as its absolute-stability region
Statement
For forward Euler applied to , let . Its stability function is , and its absolute-stability region is exactly the closed disk
On the negative real axis, for with , the method is absolutely stable exactly when .
Facts & Assumptions
Given: Forward Euler's scalar test equation, a step size , and .
Scalar absolute stability, A-stability, L-stability, and multistep root regions: the one-step region is the set of defined for which .
Orders and scalar stability functions of Euler, midpoint, and classical RK4: the forward-Euler stability function is .
Proof
By [F2], the forward-Euler multiplier is defined for every and equals . Thus [F1] makes its absolute-stability condition , which is the closed disk centered at with radius one.
For with , is real and the disk condition is . This is equivalent to , hence ; since , it is exactly .
Constant-step BDF2 is A-stable under the multistep root condition
Statement
For each with , the constant-step BDF2 test polynomial has degree two, all its roots have modulus at most one, and every root of modulus one is simple. Thus its multistep absolute-stability region contains the closed left half-plane, so BDF2 is A-stable.
Facts & Assumptions
Given: Constant-step BDF2 on with and .
Scalar absolute stability, A-stability, L-stability, and multistep root regions: a multistep test polynomial gives absolute stability when its degree is unchanged, every root has modulus at most one, and any unit-modulus root is simple; A-stability means the closed left half-plane lies in this region.
BDF2 roots on or outside the unit disk map to the closed right half-plane: any root of with modulus at least one forces , with equality only at .
Proof
The leading coefficient of is . If it vanished, then , contradicting . Thus has degree two.
By [F2], a root with modulus greater than one would force , which is impossible. A root with modulus one can occur only when and . At , , so the unit root is simple and the other root is .
The degree and root properties in steps 1.1–1.2 satisfy the multistep criterion in [F1] for every . Hence the closed left half-plane lies in the absolute-stability region, proving A-stability.
Both constant-step BDF2 test roots vanish in the stiff limit
Statement
For , let be any root of the constant-step BDF2 test polynomial . As within the closed left half-plane, every such root satisfies .
This is a multistep damping statement. It does not extend the one-step definition of L-stability to multistep methods.
Facts & Assumptions
Given: A complex number with and a root of the stated BDF2 test polynomial.
BDF2 roots on or outside the unit disk map to the closed right half-plane: the BDF2 test polynomial on a uniform grid is .
Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive: complex modulus is multiplicative and satisfies the triangle inequality.
Complex modulus restricts to real absolute value: the complex modulus of an embedded real number equals its real absolute value.
The reverse triangle inequality follows from [F2] and [F3]: and , with .
Proof
Let and . By [F1], the root equation implies , hence [F2] gives . The reverse triangle inequality gives , using multiplicativity and [F3] for the real factors and . Thus as .
If and , step 1.1 gives , hence , a contradiction. Thus for , and then . Given , choose large enough that ; step 1.1 ensures this is possible. Then , so . This estimate holds for every root, proving the claim.
5 · Examples, counterexamples and false statements
None yet.
Sources
- MIT OpenCourseWare, 18.330 Introduction to Numerical Analysis, Chapter 5, §5.2.2: Stability
- Ernst Hairer and Gerhard Wanner, Introduction à l’Analyse Numérique, Chapter III, §III.9
- Masayuki Yano, James Douglass Penn, George Konidaris, and Anthony T. Patera, Math, Numerics, and Programming (for Mechanical Engineers), Unit IV, Chapter 21