Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pending
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.

Autonomous Rosenbrock–Euler is one Newton correction of backward Euler

Statement

Let d≥1 and let f:U→Rd be autonomous and C1 on an open U⊆Rd, let y∈U, and let h>0. Suppose Id−hDf(y) is invertible. Then the exact-arithmetic Rosenbrock–Euler step with γ=1 is the first Newton correction of the backward-Euler residual at the initial guess y. This does not assert that the corrected point solves the full backward-Euler equation.

Facts & Assumptions

Given: The autonomous field f, state y, step h, and the invertible shifted Jacobian.

[F1]

Backward Euler step equation and algebraic residual: for an autonomous field, the backward-Euler residual at candidate z is G(z)=z−y−hf(z).

[F2]

Continuously differentiable maps, local inverses, and local diffeomorphisms: C1 means totally differentiable at every point, with continuous total derivative.

[F3]

The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: the Jacobian matrix has entries given by the state partial derivatives.

[F4]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of a composition is the composition of total derivatives.

[F5]

A total derivative computes every directional derivative, and its matrix is the Jacobian: when a total derivative exists, its matrix is the Jacobian matrix.

[F6]

Newton correction for a square vector residual: for residual vector r and invertible matrix A, the correction is the unique s satisfying As=−r.

[F7]

The Rosenbrock–Euler step map with an exact or approximate Jacobian: at γ=1, k solves (Id−hDf(y))k=f(y) and the update is y+hk.

Proof

Given: The data in the Statement.

1.1F1F2F3F4F5algebra

From [F1], G(y)=−hf(y). Since [F2] makes f totally differentiable, [F4] differentiates G at y to DG(y)=Id−hDf(y); [F3] and [F5] identify the state derivative matrix with the Jacobian.

2.1F6step 1.1F7algebra

By [F6], the Newton correction s solves (Id−hDf(y))s=−G(y)=hf(y). Since the matrix is invertible, uniqueness gives s=hk, where k is the stage slope in [F7].

3.1step 2.1F1F7algebra∎

The corrected point is therefore y+s=y+hk, exactly the update in [F7]. It is one correction from y; the calculation establishes no further Newton correction and makes no claim that this point solves the backward-Euler equation.

Depends on

Used by

Dependency tree · two levels

21 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