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.
Discrete and continuous ODE gradients agree to order p under augmented error bounds
Statement
Let , let and be integers, and set and for . Let the finite graph defining have transitions with node states . Let and be the continuous and finite state-step objectives of The continuous ODE adjoint gives the parameter gradient with endpoint terms and The reverse recursion is the exact gradient of a finite state-step objective, respectively. Write for the continuous adjoint in The continuous ODE adjoint gives the parameter gradient with endpoint terms, and write and for the discrete state and adjoint. Set and for the exact state and adjoint values. Let be the continuous running-gradient vector, evaluated exactly as . Suppose the exact and numerical state/adjoint pairs lie in a common tube and For the state part of this bound, it is sufficient that the hypotheses of Global error from uniform one-step defect and stability hold with a uniform exact-start defect; the coefficient conditions of Sufficient explicit Runge–Kutta order conditions through order four supply that defect for an explicit Runge--Kutta method of order under that item's and common-tube assumptions. No cited state-error result supplies the adjoint part, which is an independent hypothesis here. Write and for the column initial/terminal contribution vectors in the continuous and discrete gradient formulas. Assume the discrete running-gradient terms admit vectors and nonnegative weights , , with The weighted discrete representation is an explicit premise; it is not implied by the generic finite state-step adjoint recursion. Suppose and that the same weights give the quadrature satisfying If is Lipschitz in on the common tube with constant in the sum norm, then The adjoint, derivative-data and quadrature hypotheses are separate from state accuracy; without them the state estimate alone gives no gradient error conclusion.
There is also the following independent method-consistency conclusion. Under the local step-and-cost consistency, derivative stability, derivative Lipschitz, initial-data, terminal-derivative and tube hypotheses of Local C1 step consistency gives tangent, adjoint and gradient order, the actual numerical graph satisfies with that lemma's explicit constants, together with its state bound. These conclusions derive the global tangent and adjoint errors from local map errors. They do not assume the preceding global state/adjoint bound or weighted representation.
In particular, Differentiated explicit RK stages give local C1 order supplies these local hypotheses for the actual explicit RK state map and the cost using the same tableau, under its common-tube, base , and local augmented-order hypotheses. For , its augmented hypothesis and the existing coefficient conditions suffice; jointly base data are an explicit sufficient smoothness condition, and its displayed classical RK4 tableau gives a concrete order-four instance. Generic is retained through its genuine local augmented-order hypothesis. This branch permits negative or zero RK weights and makes no internal-stage adjoint accuracy claim.
Facts & Assumptions
Given: , integers and , the mesh , the stated continuous and discrete objectives, exact adjoint formulas, uniform state/adjoint error bound, derivative-data perturbation bound, quadrature bound, and common compact tube. For the method-consistency conclusion, the actual step and cost maps and the separate local hypotheses of the two cited local lemmas are also given.
The continuous ODE adjoint gives the parameter gradient with endpoint terms: the continuous gradient is the initial/terminal contribution plus .
The reverse recursion is the exact gradient of a finite state-step objective: the discrete gradient is the corresponding initial/terminal contribution plus the reverse-mode sum of the discrete running derivative terms.
Global error from uniform one-step defect and stability: the common-tube, uniform local-defect, one-step stability and initial-error hypotheses imply the stated uniform state-error bound.
Sufficient explicit Runge–Kutta order conditions through order four: for an explicit tableau satisfying the stated coefficient equations through , a vector field on the common compact tube has uniform exact-start defect . It supplies a state local-defect premise only when applied just to the state field; it makes no adjoint or tangent error claim by itself.
Local C1 step consistency gives tangent, adjoint and gradient order derives global state, actual tangent, nodal-adjoint and gradient errors by comparing the exact-flow and numerical graphs under its local value/first-derivative hypotheses.
Differentiated explicit RK stages give local C1 order identifies derivatives of actual RK stages and matching cost quadrature with the same augmented method, verifies the local hypotheses of [F5], and instantiates local augmented order through four using [F4] on the augmented field.
For the weighted conclusion, the constants are independent of , and all error, quadrature and derivative-data hypotheses in that part of the Statement hold.
For the independent method-consistency conclusion, every hypothesis of [F5] holds, or is supplied by [F6] together with the initial and terminal hypotheses of [F5]. No global adjoint-error estimate is included in [A2].
Proof
If the stated explicit Runge--Kutta conditions are used for the state field, [F4] supplies the exact-start defect required by [F3]. Under the stated stability, common-tube and initial-error hypotheses, [F3] gives the state part of the asserted bound; the adjoint part in the weighted conclusion remains the separately assumed bound.
Independently assume [A2]. Apply [F5] to the actual maps defining and the exact interval flow and running-cost maps defining . Its forward recurrences give state and tangent errors, its backward recurrence gives the nodal-adjoint error, and its graph-gradient comparison gives the stated bound. This argument uses no weighted decomposition.
By [F1], [F2], and the explicit weighted representation in the Statement, the two gradients are their respective endpoint terms plus, respectively, the weighted sum of and the integral of . At each node, insert and subtract . The derivative-data assumption and Lipschitz bound give .
Since and , the node-data perturbation contributes at most . The exact-integrand quadrature error contributes at most , and the endpoint difference at most . The Euclidean triangle inequality gives the displayed weighted bound.
For the RK specialization, [F6] differentiates the actual finite stages, proves the local derivative-size and Lipschitz bounds, and obtains the needed local consistency from augmented local order. Its application of [F4] to the augmented field verifies this order for under the actual augmented smoothness and tube assumptions. Its RK4 coefficient calculation supplies the concrete fourth-order instance. Therefore step 1.2 applies.
Depends on
- The reverse recursion is the exact gradient of a finite state-step objective
- The continuous ODE adjoint gives the parameter gradient with endpoint terms
- Global error from uniform one-step defect and stability
- Sufficient explicit Runge–Kutta order conditions through order four
- Local C1 step consistency gives tangent, adjoint and gradient order
- Differentiated explicit RK stages give local C1 order
Used by
Dependency tree · two levels
30 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
- William W. Hager, Runge-Kutta methods in optimal control and the transformed adjoint system, §§3–5 (standard reference, not scraped)
- Michael B. Giles and Niles A. Pierce, An Introduction to the Adjoint Approach to Design, §§2.4 and 4 (standard reference, not scraped)