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.
Rosenbrock and linearly implicit methods — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Implicit stiff time stepping and algebraic error
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonlinear equations and Newton methods
- Normal Subgroups and Quotient Groups
- 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
- Power Series and Real-Analytic Functions
- 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
- Rosenbrock and linearly implicit methods
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Riemann Integral: Definition and Integrability
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples compute the scalar Rosenbrock–Euler factor and its backward-Euler match, show that a bounded zero Jacobian approximation can turn the selected two-stage method into an undamped explicit midpoint step on a stiff mode, and verify that omitting the second-stage correction destroys cubic local accuracy. A diagonal two-dimensional example counts one shifted QR factorization reused for two right-hand sides. The damping counterexample fixes and makes no order or uniform-convergence claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Omitting the second-stage correction destroys cubic local accuracy
Statement
On from , with , , and , consider the incorrect variant that retains and the midpoint evaluation but replaces the corrected second stage by and returns . Its one-step expansion is whereas the exact flow is . Since , the altered method has a nonzero local defect and fails the cubic local-error condition for order two. The altered formula does not satisfy the proper method's stage equations.
Facts & Assumptions
Given: , initial , , small, and .
Two-stage second-order Rosenbrock W-method with shared factorization: the correct stages use the second right-hand side and then set .
If is differentiable with integrable then ; and a bounded derivative makes Lipschitz: a differentiable vector curve with integrable derivative has endpoint difference equal to the integral of its derivative.
The exponential is the unique solution of with : any differentiable solution on of , equals .
The exponential function is smooth and : every derivative of equals .
The exponential function is strictly increasing: is increasing on .
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is integrable.
Proof
Given: The data in the Statement.
Define the altered variant as stated. Since , its first stage is . The midpoint value is , and the altered second solve gives .
Define for . By [F4], , and [F6] gives ; thus this is an exact solution of the IVP (unique on by [F3]).
Put . The exact identity shows ; for the remainder is bounded by . Squaring this finite expansion gives , with a bounded remainder on the same interval. Since , the altered second stage is . Multiplying by and adding gives the displayed one-step expansion.
By [F4], ; since , [F5] gives .
The derivatives of are continuous by [F4] and integrable on each compact subinterval by [F7]. Three applications of [F2] give , where and . Subtracting this expansion from the altered update in step 2.1 leaves , which is not bounded by for any fixed as because . Thus the altered scheme fails the cubic local-error condition for order two.
The proper method's second right-hand side and corrected output are exactly the two terms changed in this variant by [F1]. Step 3.1 proves the altered formula has no cubic local defect, and this item makes no global-rate claim for it.
Finite check
For and , the leading local-defect coefficient is ; the exact Taylor coefficient at is , while the altered coefficient is .
Two stage right-hand sides reuse one shifted-Jacobian factorization
Statement
Take , , , , and the W-method approximation , . Choose a stored finite system containing zero and the normal values , with unit roundoff . Let a terminating certificate evaluator return norm upper bounds for , for the computed-residual norm , and for each other requested vector norm, and return certified upper bounds at most for the residual-bound expressions in both solves. Take stage tolerances . Then and both stage right-hand sides use its single factor object. The exact stages are , midpoint state , , and . The prescribed QR factorization succeeds and is reused for both stage solves. No stability or rounding-cost claim is made.
Facts & Assumptions
Given: , , , , a stored finite system containing the displayed dyadic values in normal range with , the stated norm upper bounds, and residual tolerances one.
Two-stage second-order Rosenbrock W-method with shared factorization: both stages use the same and the method factors once.
Reusable Householder QR solve for a shifted matrix with residual status: the factor object stores one QR factorization and each solve uses one triangular substitution.
Scaled Householder reflector formation and application: on each nonzero stored active column, the specified finite arithmetic forms a reflector, updates the trailing block, and returns either the stored reflector data or a declared failure.
A computed shifted-system residual has a certified upper bound: the exact linear residual is bounded by the computed residual and the explicit dot-product and subtraction allowance.
Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add: a successful operation on an exact zero or normal result returns its round-to-nearest value, and exact representable results are unchanged.
Proof
Given: The data in the Statement.
Use the autonomous extension on , with in_domain returning true and exact field evaluation and storage checks. The W approximation is , so . For the first active column , [F3] has , , , , , and . Its trailing-block dot is zero, so the output block is . The second one-dimensional active column similarly has and produces . By [F5] every exact representable intermediate is unchanged; all nonzero intermediates are among the listed stored normal values, no range branch fails, and both pivots are nonzero. Thus the one factorization succeeds.
The first RHS is . In the first reflector replay the dot is and the active vector is , so the update sends to . The second replay has dot and scalar , so it sends the second coordinate to . Every replay product, accumulated sum and subtraction is zero or one of the stipulated normal values, hence is represented exactly by [F5]. Thus the transformed RHS is , and descending substitution with has zero off-diagonal products and exact divisions by , giving . The midpoint is , so ; all these exact values are stored.
The second RHS is . The first stored reflector has dot and active , so it sends the first coordinate to and leaves the second at . The second reflector has dot and scalar , so it sends the second coordinate to . All replay products, sums and subtractions are again zero or stipulated normal represented values. Descending substitution with is exact as in step 2.1 and gives . Hence .
For either solve, makes and the computed residual zero, so the evaluator returns . The other norm upper bounds and show the first certificate expression is at most , so the evaluator can soundly return and then for . Thus both solves meet tolerance one. By [F1]–[F2], this successful call uses one factorization and two triangular solves.
Finite check
The stored matrix is , the two exact RHS values are and , and both residual norms are zero. Each residual allowance is less than , below the chosen tolerance one.
Rosenbrock–Euler damps a stiff scalar decay with the backward-Euler factor
Statement
Consider with and one step . The named Rosenbrock–Euler method (, exact Jacobian) returns , exactly the backward-Euler value. Its scalar factor is ; it lies in and tends to zero as the decay parameter times the step tends to infinity. This is a scalar exact-arithmetic calculation and makes no finite-precision forward-error claim.
Facts & Assumptions
Given: , , , and exact arithmetic.
The Rosenbrock–Euler scalar stability function is A-stable exactly for gamma at least one half: and the method is L-stable.
Autonomous Rosenbrock–Euler is one Newton correction of backward Euler: for an autonomous field, the step is one Newton correction of the backward-Euler residual from the starting value.
Backward Euler step equation and algebraic residual: the scalar endpoint equation is .
Proof
Given: The data in the Statement.
Here and . By [F1], , hence .
The backward-Euler equation [F4] is , so and its unique scalar root is . This agrees with step 1.1; [F3] also identifies the Rosenbrock update as one Newton correction, which is exact here because the residual is affine.
Since , the factor in [F2] is . For general decay parameter , the factor is , which tends to zero as .
Finite check
For , the method factor and backward-Euler factor both equal ; explicit Euler would have factor , which grows in magnitude rather than damping this mode.
A bounded approximate Jacobian can destroy Rosenbrock stiff damping
Statement
For the scalar family with and , take , , and in the exact-arithmetic stage equations of the two-stage method. Then , its amplification factor is , and this approximate-J method amplifies the mode even though the exact-J method at has modulus less than one. The zero approximation is bounded. This calculation demonstrates loss of stiff damping and makes no order or uniform-convergence claim.
Facts & Assumptions
Given: The scalar equation, , , and the stated approximate derivatives.
Two-stage second-order Rosenbrock W-method with shared factorization: the stages satisfy , for this autonomous equation, , , and .
The selected exact-J two-stage Rosenbrock method is scalar L-stable: for the exact Jacobian, and it is L-stable.
Proof
Given: The data in the Statement.
Here and . Since , the midpoint state is and .
The second right-hand side is , so and . Therefore , giving amplification factor .
For the exact-J branch, [F2] gives , because . Since , we have , so ; also , so . Thus . This differs from step 2.1 and proves that boundedness of alone does not preserve stiff damping.
The approximate-J calculation in step 2.1 and the exact-J factor comparison establish the stated damping failure. No order or convergence conclusion follows from this stiff-scaled calculation.
Finite check
With and , the approximate-J output is , while the exact-J factor is .
Sources
- WIAS Berlin, Numerical Methods for Stiff Ordinary Differential Equations, §2.4 Rosenbrock Methods
- Daniel Kressner, Advanced Numerical Analysis, §3.5 Rosenbrock methods
- WIAS Berlin, Numerical Methods for Stiff Ordinary Differential Equations, §2.4
- WIAS Berlin, Numerical Methods for Stiff Ordinary Differential Equations, §2.3
- Joachim Rang and Lutz Angermann, New Rosenbrock Methods of Order 3 for PDAEs of Index 2