Alphabeta Math
Pipeline-generated
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.

✓ 6 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Stability regions and stiff equations

1 · Prerequisites

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

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Matrix-step contractivity and the logarithmic norm in a specified inner product

Definition

Let d≥1 be an integer and let G∈Rd×d be symmetric positive definite. Define the inner product and its vector norm on Rd by

⟨x,y⟩G=xTGy,∥x∥G=xTGx.

For M∈Rd×d, its induced operator norm is ∥M∥G=sup⁡x≠0∥Mx∥G/∥x∥G. A matrix step M is contractive in this specified inner product when ∥M∥G≤1.

For A∈Rd×d, its logarithmic norm in the same inner product is

μG(A)=sup⁡x≠0xTGAxxTGx.

In the Euclidean inner product G=I, write ∥⋅∥2 and μ2. A real matrix is normal when AAT=ATA and nonnormal otherwise.

For a rational stability function R=P/Q, the matrix step R(hA) is defined only when Q(hA) is invertible; its contractivity is the separate condition ∥R(hA)∥G≤1.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Scalar absolute stability, A-stability, L-stability, and multistep root regions

Definition

For the scalar test equation y′=λy, a step size h>0 gives z=hλ. A one-step scalar update has stability function R when one step sends yn to yn+1=R(z)yn. If R is rational, write it in reduced form; it is defined at z exactly when its denominator is nonzero there. Its absolute-stability region is

SR={z∈C:R(z) is defined and ∣R(z)∣≤1}.

The update is A-stable when the closed left half-plane {z:Re⁡z≤0} is contained in SR. A rational one-step update is L-stable when it is A-stable and

lim⁡∣z∣→∞Re⁡z≤0R(z)=0,

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

πz(ζ)=ρ(ζ)−zσ(ζ).

The multistep absolute-stability region consists of those z for which the leading coefficient αk−zβk is nonzero and every root of πz 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.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Backward Euler is A-stable and L-stable

Statement

Backward Euler on y′=λy is the scalar update yn+1=yn+zyn+1, where z=hλ. Its stability function is

RBE(z)=11−z.

It is A-stable and L-stable.

Facts & Assumptions

Given: The backward-Euler scalar update, h>0, λ∈C, and z=hλ.

[F1]

Scalar absolute stability, A-stability, L-stability, and multistep root regions: A-stability requires R to be defined and satisfy ∣R(z)∣≤1 for every Re⁡z≤0; L-stability additionally requires the limit zero at infinity through that half-plane.

Proof

1.1givenalgebra

If Re⁡z≤0, then 1−z≠0. Solving the stated update gives yn+1=(1−z)−1yn, so RBE(z)=(1−z)−1.

2.1F1step 1.1algebra

For Re⁡z≤0, ∣1−z∣2−1=∣z∣2−2Re⁡z≥0. Therefore ∣RBE(z)∣≤1 on the closed left half-plane, proving A-stability by [F1].

3.1F1step 1.1step 2.1algebra∎

The reverse triangle inequality gives ∣1−z∣≥∣z∣−1, so ∣RBE(z)∣≤1/(∣z∣−1)→0 as ∣z∣→∞ within Re⁡z≤0. By [F1] the method is L-stable.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The trapezoidal rule is A-stable but not L-stable

Statement

The trapezoidal rule on y′=λy is

yn+1=yn+z2(yn+yn+1),z=hλ.

Its stability function is RT(z)=(1+z/2)/(1−z/2). It is A-stable but not L-stable.

Facts & Assumptions

Given: The trapezoidal scalar update, h>0, λ∈C, and z=hλ.

[F1]

Scalar absolute stability, A-stability, L-stability, and multistep root regions: A-stability requires R to be defined and ∣R(z)∣≤1 for every Re⁡z≤0; L-stability additionally requires the limit zero at infinity through that half-plane.

Proof

1.1givenalgebra

If Re⁡z≤0, then 1−z/2≠0. Solving the stated update gives RT(z)=(1+z/2)/(1−z/2).

2.1F1step 1.1algebra

For Re⁡z≤0, ∣1−z/2∣2−∣1+z/2∣2=−2Re⁡z≥0. Thus ∣RT(z)∣≤1 throughout the closed left half-plane, proving A-stability by [F1].

3.1F1step 1.1algebra∎

Along the negative real axis z=−x, x>0, the multiplier is (1−x/2)/(1+x/2) and tends to −1 as x→∞. Its modulus therefore tends to one, not zero, so the L-stability limit in [F1] fails.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passOpen item page →

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

Pz(ζ)=(3−2z)ζ2−4ζ+1,z=hλ.

If ζ is a root and ∣ζ∣≥1, then Re⁡z≥0. Equality is possible only for z=0 and ζ=1.

Facts & Assumptions

Given: A uniform step h>0, the scalar test equation y′=λy, and a root ζ of the BDF2 test polynomial.

[F1]

Variable-step BDF2 with an explicit local implicit-branch rule: when adjacent step ratios equal one, the update is (3Yn+1−4Yn+Yn−1)/(2h)=f(tn+1,Yn+1).

[F2]

Linear multistep methods, consistency, order, and the root condition: a linear multistep method has characteristic polynomials ρ and σ, and substitution of f(t,y)=λy gives the characteristic polynomial ρ(ζ)−zσ(ζ).

[F3]

Scalar absolute stability, A-stability, L-stability, and multistep root regions: the test variable is z=hλ, and the multistep test polynomial is πz(ζ)=ρ(ζ)−zσ(ζ).

[F4]

Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive: complex modulus is nonnegative and definite, ∣uv∣=∣u∣∣v, and uu‾=∣u∣2.

[F5]

Complex modulus restricts to real absolute value: the complex modulus of the embedded real number 1 is 1.

Proof

1.1F1F2F3algebra

Setting rn=1 in [F1] gives 3Yn+1−4Yn+Yn−1=2hf(tn+1,Yn+1). Substituting f(t,y)=λy and a trial mode Yn=ζn, the polynomial convention in [F2] gives (3−2z)ζ2−4ζ+1=0.

2.1F4F5step 1.1algebra

The constant term is one, so ζ≠0. Put w=1/ζ, a=Re⁡w, and r=∣w∣. By [F4] and [F5], 1=∣1∣=∣ζw∣=∣ζ∣∣w∣, so r=1/∣ζ∣. Solving the equation in step 1.1 for z gives z=3/2−2w+w2/2. Writing w=a+bi, [F4] gives r2=a2+b2 and hence Re⁡(w2)=a2−b2=2a2−r2; therefore Re⁡z=(1−a)2+(1−r2)/2.

3.1F4step 2.1algebra∎

If ∣ζ∣>1, then step 2.1 gives r<1, hence Re⁡z>0. If ∣ζ∣=1, then r=1, so Re⁡z=(1−a)2≥0; equality forces a=1. Writing w=1+bi, [F4] gives 1=r2=1+b2, so b=0 and w=1, hence ζ=1 and z=0. This proves both assertions.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Forward Euler has the closed unit disk centered at −1 as its absolute-stability region

Statement

For forward Euler applied to y′=λy, let z=hλ. Its stability function is RE(z)=1+z, and its absolute-stability region is exactly the closed disk

{z∈C:∣z+1∣≤1}.

On the negative real axis, for y′=−ρy with ρ>0, the method is absolutely stable exactly when 0<hρ≤2.

Facts & Assumptions

Given: Forward Euler's scalar test equation, a step size h>0, and λ∈C.

[F1]

Scalar absolute stability, A-stability, L-stability, and multistep root regions: the one-step region is the set of defined z for which ∣R(z)∣≤1.

[F2]

Orders and scalar stability functions of Euler, midpoint, and classical RK4: the forward-Euler stability function is RE(z)=1+z.

Proof

1.1givenF1F2

By [F2], the forward-Euler multiplier is defined for every z∈C and equals 1+z. Thus [F1] makes its absolute-stability condition ∣1+z∣≤1, which is the closed disk centered at −1 with radius one.

2.1givenstep 1.1algebra∎

For λ=−ρ with ρ>0, z=−hρ is real and the disk condition is ∣1−hρ∣≤1. This is equivalent to −1≤1−hρ≤1, hence 0≤hρ≤2; since hρ>0, it is exactly 0<hρ≤2.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Constant-step BDF2 is A-stable under the multistep root condition

Statement

For each z=hλ with Re⁡z≤0, the constant-step BDF2 test polynomial Pz(ζ)=(3−2z)ζ2−4ζ+1 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 y′=λy with h>0 and Re⁡(hλ)≤0.

[F1]

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.

[F2]

BDF2 roots on or outside the unit disk map to the closed right half-plane: any root of Pz with modulus at least one forces Re⁡z≥0, with equality only at z=0,ζ=1.

Proof

1.1givenF1algebra

The leading coefficient of Pz is 3−2z. If it vanished, then z=3/2, contradicting Re⁡z≤0. Thus Pz has degree two.

1.2givenF2algebra

By [F2], a root with modulus greater than one would force Re⁡z>0, which is impossible. A root with modulus one can occur only when z=0 and ζ=1. At z=0, P0(ζ)=3ζ2−4ζ+1=(3ζ−1)(ζ−1), so the unit root is simple and the other root is 1/3.

2.1F1step 1.1step 1.2∎

The degree and root properties in steps 1.1–1.2 satisfy the multistep criterion in [F1] for every Re⁡z≤0. Hence the closed left half-plane lies in the absolute-stability region, proving A-stability.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Both constant-step BDF2 test roots vanish in the stiff limit

Statement

For Re⁡z≤0, let ζ be any root of the constant-step BDF2 test polynomial Pz(ζ)=(3−2z)ζ2−4ζ+1. As ∣z∣→∞ within the closed left half-plane, every such root satisfies ζ→0.

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 z with Re⁡z≤0 and a root ζ of the stated BDF2 test polynomial.

[F1]

BDF2 roots on or outside the unit disk map to the closed right half-plane: the BDF2 test polynomial on a uniform grid is (3−2z)ζ2−4ζ+1.

[F3]

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]: ∣u∣≤∣u−v∣+∣v∣ and ∣v∣≤∣v−u∣+∣u∣, with ∣v−u∣=∣−1∣∣u−v∣=∣u−v∣.

Proof

1.1givenF1F2F3algebra

Let C=∣3−2z∣ and r=∣ζ∣. By [F1], the root equation implies (3−2z)ζ2=4ζ−1, hence [F2] gives Cr2=∣4ζ−1∣≤4r+1. The reverse triangle inequality gives C≥∣∣3∣−∣2z∣∣=∣3−2∣z∣∣≥2∣z∣−3, using multiplicativity and [F3] for the real factors 2 and 3. Thus C→∞ as ∣z∣→∞.

2.1step 1.1choosealgebra∎

If C>5 and r≥1, step 1.1 gives Cr2≤4r+1≤5r, hence C≤5/r≤5, a contradiction. Thus r<1 for C>5, and then Cr2≤4r+1<5. Given ε>0, choose ∣z∣ large enough that C>max⁡{5,5/ε2}; step 1.1 ensures this is possible. Then r2<5/C<ε2, so r<ε. This estimate holds for every root, proving the claim.

5 · Examples, counterexamples and false statements

None yet.

Sources