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.

✓ 1 result · all verified · 0 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.

Discrete continuous and pde adjoint sensitivities — Examples

1 · Prerequisites

2 · Summary

These calculations trace exact derivatives of finite models and selected implicit branches, compare discrete and continuous sensitivities, and verify an elliptic adjoint gradient. The counterexamples isolate the terminal adjoint seed and the distinction between uniform state accuracy and derivative accuracy. The QR and tent-map examples are finite-horizon calculations only.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

A two-observation 4DVAR objective has an exact reverse gradient

Example

Take the scalar discrete model x0(θ)=θ, x1=2x0, and x2=3x1. Instantiate the strong-constraint objective of Strong- and weak-constraint 4DVAR with a finite gradient run with T=2, d0=d1=d2=p1=p2=1, U0=U1=U2=R, model maps Ψ0(x)=2x and Ψ1(x)=3x, and observation maps G1=G2=id⁡R. Choose mb=y1=y2=0 and the scalar positive-definite covariance matrices B=Γ1=Γ2=[1]. The decision variable is the initial state x0=θ; there are no weak-constraint model-error penalties. The objective is exactly J(θ)=12x02+12x12+12x22.

Facts & Assumptions

Given: The finite scalar state-step graph, identity observation maps, unit positive-definite covariances, strong-constraint objective, and exact-real arithmetic.

[F1]

The reverse recursion for a finite C1 state-step objective is its exact gradient (The reverse recursion is the exact gradient of a finite state-step objective).

[F2]

The strong-constraint variational assimilation objective contains a background penalty and observation-misfit terms along the generated model trajectory (Strong- and weak-constraint 4DVAR with a finite gradient run). The stated linear maps are C1 on their open domains and the selected scalar covariances are positive definite, so that objective is admissible.

Verification

1.1givenF2algebra

Direct substitution gives x1=2θ and x2=6θ, so J(θ)=12(1+4+36)θ2=412θ2 and J′(θ)=41θ.

2.1F1step 1.1algebra∎

The terminal adjoint seed is p2=x2=6θ. The reverse recursion [F1] gives p1=x1+3p2=20θ and p0=x0+2p1=41θ. Since Dx0/Dθ=1, the adjoint gradient is p0=41θ, agreeing with the direct derivative.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passOpen item page →

Backward Euler differentiates a stiff scalar decay fit on its exact branch

Example

For u′=−ku with fixed u0>0 and step size h>0, take k∈(0,(2h)−1) and the one-stage backward Euler equation Y=u0−hkY. Its fixed-point map sends the invariant interval [u0/2,u0] into itself and has contraction factor hk<1/2, so the branch selected by Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error is well defined. The observation is zero and the terminal loss is J(k)=12Y(k)2.

Facts & Assumptions

Given: The scalar backward Euler stage equation, the stated parameter interval, and the terminal quadratic objective.

[F1]

The one-stage implicit Runge--Kutta residual has the selected stage root and residual bound under its invariant-ball contraction hypotheses (Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error).

[F2]

On a nonsingular selected stage branch, implicit differentiation gives DθY=−GY−1Gθ and differentiates the Runge--Kutta update (An implicit Runge-Kutta stage has the stated parameter sensitivity on its selected branch).

[F3]

Backward Euler is the one-stage implicit Runge--Kutta method with A=(1) and b=(1) (Backward Euler step equation and algebraic residual).

Verification

1.1F1F2F3givenalgebra

To apply [F1] with the prescribed center u0, use the larger closed ball B=[0,2u0] of radius R=u0. For F(Y)=−kY, take M=2ku0 and L=k; then hM=2hku0<R and q=hk<1/2. The field is C1 on R with derivative bounded by L, so the nonsingularity hypotheses inherited by [F2] hold on this ball. Solving the scalar residual gives (1+hk)Y=u0, hence Y=u0/(1+hk). Since 1+hk>0, this is the unique root in the stated interval and agrees with the branch in [F1].

2.1F2step 1.1algebra∎

Differentiate the residual (1+hk)Y−u0=0: (1+hk)Yk+hY=0, so [F2] gives Yk=−hu0/(1+hk)2. Therefore Jk=YYk=−hu02/(1+hk)3.

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

A one-dimensional elliptic diffusion coefficient has the adjoint gradient

Example

Let V=H01(0,1) with its standard H1 norm, let Θ=(−1,∞), and define aθ(u,v)=(1+θ)∫01u′v′ dx and ℓ(v)=∫01v dx. Take J(u)=∫01u dx. On a neighborhood of each fixed θ>−1, the form is uniformly coercive in the H1 norm, so this is a parameterized coercive elliptic problem in the sense of Parameter-dependent coercive elliptic variational states and objectives.

Facts & Assumptions

Given: The one-dimensional Sobolev space, the displayed bilinear form/load, and the reduced-gradient formula.

[F1]

For a uniformly coercive parameterized elliptic variational state and C1 objective, the adjoint formula gives Dθj=DθJ+Dθℓ(p)−Dθa(u,p) (The elliptic adjoint gives the reduced parameter gradient).

[F2]

The elliptic variational definition treats states as weak solutions of aθ(u,v)=ℓθ(v) (Parameter-dependent coercive elliptic variational states and objectives).

[F3]

The quadratic w(x)=x(1−x)/2 belongs to H01(0,1) (The two-cell hat and quadratic functions belong to H¹₀).

[F4]

For v∈H01(0,1), ∥v∥H1≤2∥v′∥L2 (Zero-boundary Poincaré inequality on the unit interval).

[F5]

H01(0,1) is the closure of Cc∞(0,1) in the H1 norm (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).

[F8]

The integral pairing is bounded by the product of L2 norms (Holder's inequality for integrals, including the endpoint cases).

[F9]

H01(0,1) with the standard H1 inner product is a real Hilbert space (The Sobolev space H1 is a Hilbert space).

[A1]

Countable Choice is inherited from the state, adjoint, and H0 membership suppliers (The Axiom of Countable Choice (ACω)).

Verification

1.1A1F2F3F4F5F6F7F8F9givenalgebra

Put w(x)=x(1−x)/2. Direct differentiation gives w′′=−1, w(0)=w(1)=0, and [F3] gives w∈V. By [F9], V is a real Hilbert space. Holder's inequality [F8] gives ∣ℓ(v)∣=∣∫01v∣≤∥1∥L2∥v∥L2≤∥v∥H1, so ℓ∈V∗; the objective J(u,θ)=ℓ(u) is bounded linear in u and independent of θ, hence C1 with DuJ[v]=ℓ(v) and DθJ=0. Also ∣aθ(u,v)∣≤(1+θ)∥u∥H1∥v∥H1 for θ>−1, and Aθ=(1+θ)A0 is operator-norm C1, while ℓθ=ℓ is constant. For each v∈V and ε>0, [F5] supplies vε∈Cc∞(0,1) with ∥v−vε∥H1<ε. By the product rule [F7], (w′vε)′=w′′vε+w′vε′; since vε vanishes at both endpoints, [F6] gives ∫01w′vε′=∫01vε. By [F8], the difference between the two sides with v in place of vε is at most (∥w′∥L2+1)ε, so the weak identity ∫01w′v′=∫01v follows as ε↓0. Also, [F4] gives aθ(v,v)≥(1+θ)∥v∥H12/2; on a neighborhood of each θ>−1 this is a uniform coercivity bound. Hence uθ=w/(1+θ) solves the state equation and is unique. Finally ∫01w=1/12, so j(θ)=1/(12(1+θ)).

2.1A1F1F2F3step 1.1algebra

The adjoint equation is aθ(v,p)=DuJ[v]=∫01v for all v∈V, so symmetry of aθ and uniqueness give p=uθ. The direct parameter derivatives of J and ℓ vanish. For the scalar parameter direction 1, Dθa[1](u,p)=∫01u′p′ dx=(1+θ)−2∫01(w′)2dx. Direct integration gives ∫01(w′)2dx=14∫01(1−2x)2dx=1/12, hence Dθa[1](u,p)=1/(12(1+θ)2).

3.1F1step 1.1step 2.1algebra∎

Formula [F1] therefore gives j′(θ)=−1/(12(1+θ)2), equal to the derivative of the explicit reduced objective in step 1.1.

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

A two-interval shooting residual has a block-bidiagonal sensitivity Jacobian

Example

For u′=θu on two intervals of length τ>0, define shooting nodes z0,z1,z2 and residuals R0=z0−a, R1=z1−eτθz0, and R2=z2−eτθz1. This uses the exact parameterized ODE flow covered locally by Parameter-dependent ODE flows have the variational tangent on a common tube. On the shooting solution set, take terminal objective J=z2.

Facts & Assumptions

Given: a∈R, τ>0, the two exact-flow intervals, and the finite shooting graph.

[F1]

The parameterized ODE flow has its variational tangent when its uniqueness and common-tube hypotheses hold (Parameter-dependent ODE flows have the variational tangent on a common tube).

[F2]

The reverse recursion computes the exact gradient of a finite state-step objective (The reverse recursion is the exact gradient of a finite state-step objective).

Verification

1.1F3F4

The function u(t)=eθts satisfies u′=θu and u(0)=s. Conversely, for any solution v with this initial value, the product and chain rules give (e−θtv(t))′=0. By [F4] this product is constantly s on its solution interval, and positivity and the reciprocal identity in [F3] imply v(t)=eθts. Thus the displayed solution exists globally and is unique.

2.1F1F3step 1.1

Verify the actual common-tube hypotheses locally at any (s∗,θ∗). Fix ε,δ,η>0 and restrict the parameters to ∣s−s∗∣<ε, ∣θ−θ∗∣<δ. For −η≤t≤τ+η, ∣eθts∣≤B:=(∣s∗∣+ε)exp⁡((∣θ∗∣+δ)(τ+η)). Treat (s,θ) as the flow parameter, with initial map (s,θ)↦s and field (t,u,s,θ)↦θu on R4. The bounded convex open set (−η,τ+η)×(−B−1,B+1)×(s∗−2ε,s∗+2ε)×(θ∗−2δ,θ∗+2δ) has compact closure inside that field's domain and contains all these trajectories for 0≤t≤τ and the restricted parameters. The field and initial map are C1. Step 1.1 supplies existence and uniqueness, so [F1] applies. Each shooting interval uses this same argument with its own initial node; since there are two intervals, a common finite bound may also be taken.

3.1F3F4step 1.1step 2.1algebra

The exact interval map is therefore Φτ(s,θ)=eτθs. Differentiate the residuals with respect to (z0,z1,z2) and θ, writing E=eτθ: DzR=(100−E100−E1),DθR=(0−τEz0−τEz1). The state Jacobian is lower bidiagonal, and the parameter column contains the two local flow sensitivities.

4.1F2F3F4step 3.1algebra∎

Solving R=0 gives z0=a, z1=Ea, and z2=E2a. Direct differentiation yields Dθz2=2τE2a. The discrete adjoint for the two flow steps seeds p2=1, then gives p1=E and p0=E2; its parameter sum is τEz0p1+τEz1p2=2τE2a. Thus the reverse gradient agrees with the differentiated shooting solution.

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

A finite QR record recovers the tangent-volume change

Example

Take Q0=I2, A1=diag⁡(2,1), and A2=diag⁡(1/3,4). Both positive-diagonal QR factorizations keep Qk=I2 and have Rk=Ak.

Facts & Assumptions

Given: The two invertible diagonal tangent matrices and the finite-time QR identity.

[F1]

The positive-diagonal QR factors give the exact finite-time log-volume change as the sum of their log diagonals (Positive-diagonal QR factors give the exact finite-time tangent-volume change).

Verification

1.1givenalgebra

The product is P2=A2A1=diag⁡(2/3,4), so log⁡∣det⁡P2∣=log⁡(8/3). The positive-diagonal QR factors have diagonal entries (2,1) and (1/3,4).

2.1F1step 1.1algebra∎

Their accumulated log sum is log⁡2+log⁡1+log⁡(1/3)+log⁡4=log⁡(8/3), which matches [F1]. The calculation is finite-time and asserts no limit.

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

A strict tent-map itinerary has exponential finite-time sensitivity growth

Example

Let T(x)=2x for x<1/2 and T(x)=2−2x for x>1/2. Fix a finite integer N≥1, take x0(θ)=θ near θ∗=1/3, and set the terminal objective to J(θ)=xN(θ).

Facts & Assumptions

Given: The two affine branches, a finite horizon N, and the finite state-step adjoint rule.

[F1]

On a neighborhood with a fixed smooth branch at every step, the reverse recursion gives the exact derivative of the finite graph (The reverse recursion is the exact gradient of a finite state-step objective).

Verification

1.1givenconstructalgebra

At θ∗=1/3, the orbit is x0=1/3 and xn=2/3 for every n≥1. If ∣θ−1/3∣<1/(6⋅2N), then the first state remains below 1/2 and each later state remains within 1/6 of 2/3 through time N; hence this whole open neighborhood has the same strict branch itinerary.

2.1F1step 1.1algebra∎

On that neighborhood the first derivative is T′(x0)=2, and each of the next N−1 derivatives is −2. The chain rule gives J′(1/3)=2(−2)N−1, whose magnitude is 2N. By [F1], reverse accumulation returns this same finite-horizon derivative. No infinite-time exponent or orbit-shadowing claim is involved.

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

A mismatched terminal adjoint condition changes the discrete gradient

Example

Take x0(θ)=0, one step x1(θ)=θ, and terminal objective J(θ)=12x1(θ)2. The correct terminal adjoint seed is p1=Dϕ(x1)=x1.

Facts & Assumptions

Given: The one-step scalar graph, terminal loss, and exact reverse recursion.

[F1]

The terminal seed and reverse recursion are the exact derivative rule for a finite state-step objective (The reverse recursion is the exact gradient of a finite state-step objective).

Verification

1.1F1givenalgebra

Directly, J(θ)=12θ2, so J′(0)=0. The correct seed is p1=x1=0 at θ=0 and the transition derivative is Dθx1=1, so the exact adjoint gradient is also zero.

2.1F1step 1.1algebra∎

If the terminal seed is incorrectly replaced by p1=1, reverse accumulation returns p1Dθx1=1 at θ=0, which differs from J′(0). Thus the terminal condition is load-bearing for the discrete gradient.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

Uniform state accuracy alone does not bound parameter-gradient error

Statement refuted

Uniform convergence of approximate states to an exact state, by itself, implies convergence or a uniform bound for their parameter derivatives.

Facts & Assumptions

Given: The displayed C1 scalar maps and the uniform state norm on (−1,1).

[F1]

The discrete-continuous gradient estimate requires independent state, adjoint, derivative-data, endpoint, and quadrature bounds (Discrete and continuous ODE gradients agree to order p under augmented error bounds).

Counterexample

For 0<h≤1 and θ∈(−1,1), let the exact state be u(θ)=0 and the approximate state be uh(θ)=h2sin⁡(θ/h3). The exact and approximate reduced objectives are these states themselves.

1.1givenalgebra

For every θ and h, ∣uh(θ)−u(θ)∣=h2∣sin⁡(θ/h3)∣≤h2. Thus the state error tends uniformly to zero as h↓0.

2.1F1step 1.1algebra∎

Differentiating gives uh′(θ)=h−1cos⁡(θ/h3) and u′(θ)=0. At θ=0, the gradient error is ∣uh′(0)−u′(0)∣=h−1, which is unbounded as h↓0. This refutes the stated implication; the example lacks a uniform derivative-data bound of the type required by [F1].

Sources