Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

The Rosenbrock–Euler scalar stability function is A-stable exactly for gamma at least one half

Statement

For scalar stability, consider the exact-arithmetic complexification of the exact-Jacobian one-stage equation. For λ,y,k∈C, h>0, γ>0, and z=hλ, use (1−γz)k=λy and y+=y+hk. Equivalently, identify C with R2 and multiplication by λ with the real matrix Cλ=(Re⁡λ−Im⁡λIm⁡λRe⁡λ); the corresponding real exact Jacobian is Cλ, and the equations become (I2−γhCλ)k=Cλy and y+=y+hk. This is a scalar stability analysis of exact stage equations; it is not an execution of the finite-precision real algorithm Finite-precision one-stage Rosenbrock step with residual status. Use the scalar rational-function criteria in Scalar stability function, A-stability, and L-stability for Runge–Kutta methods for its amplification function. Its scalar stability function is Rγ(z)=1+z1−γz=1+(1−γ)z1−γz. It has no pole in Re⁡z≤0 and satisfies ∣Rγ(z)∣≤1 throughout that half-plane if and only if γ≥12. Among these parameters, it is L-stable if and only if γ=1. In particular, the named Rosenbrock–Euler case γ=1 has the backward-Euler factor R(z)=(1−z)−1.

Facts & Assumptions

Given: γ>0, the scalar test equation, and z=hλ.

[F1]

The Rosenbrock–Euler step map with an exact or approximate Jacobian: the real exact-Jacobian stage equation is Ak=f and the update is y+hk; the complex extension analyzed here is specified explicitly in the Statement.

[F3]

Scalar stability function, A-stability, and L-stability for Runge–Kutta methods: A-stability means no pole and modulus at most one on the closed left half-plane; L-stability additionally requires the limit to vanish at infinity there.

[F4]

Real and imaginary parts, complex conjugation, and modulus: each complex z has coordinates x+iy with ∣z∣2=x2+y2.

[F5]

Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive: the complex modulus is nonnegative and multiplicative and satisfies the triangle inequality.

Proof

Given: The data in the Statement.

1.1givenF1algebra

For z≠1/γ, the exact complexified equation in the Statement gives hk=zy/(1−γz), so the amplification factor is the stated Rγ(z).

2.1givenF4F5step 1.1algebra

Write z=x+iy with x≤0. The denominator 1−γz has real part 1−γx≥1, so it has no zero there. Using [F4] and [F5], direct expansion gives ∣1−γz∣2−∣1+(1−γ)z∣2=−2x+(2γ−1)∣z∣2.

3.1step 2.1F3algebra

If γ≥1/2, both terms on the right of step 2.1 are nonnegative; hence ∣Rγ(z)∣≤1 for all x≤0, and [F3] gives A-stability. If 0<γ<1/2, choose real z=−r with r>2/(1−2γ). Then the right side is 2r−(1−2γ)r2<0, so ∣Rγ(−r)∣>1 and A-stability fails.

4.1step 3.1F3F5algebra∎

Along z=−r as r→∞, ∣Rγ(−r)∣→∣1−γ∣/γ. This is zero exactly when γ=1. For γ=1, R1(z)=1/(1−z) and ∣R1(z)∣≤1 on the closed left half-plane by step 3.1. Also ∣z∣=∣1−(1−z)∣≤1+∣1−z∣ by [F5], so for ∣z∣>1 we have ∣R1(z)∣≤1/(∣z∣−1)→0 as ∣z∣→∞ there. Thus [F3] gives the claimed L-stability characterization and the backward-Euler equality.

Remarks

[F2] Finite-precision one-stage Rosenbrock step with residual status: this is a finite-precision real-space implementation with the real exact stage equation of [F1]; no execution or numerical status of that algorithm is used here.

Depends on

Used by

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources