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.

✓ 3 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

PDE-constrained inversion and adjoint error control — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A CFL-violating finite-element iterate is rejected before inversion

Example

Let Ω=(0,1)2 and triangulate its square by joining the center O=(1/2,1/2) to the four corners. Use continuous piecewise-affine finite elements with zero boundary values and row-sum lumped mass. The only free nodal basis function is ϕ, with value 1 at O and 0 at each corner. The one-coordinate semidiscrete heat equation is mhU˙+khU=0, where mh=1/3 and kh=4. Treat the initial coefficient q=U0 as the inversion parameter, take Θh=R and Qh={1}, and let the one-step state u=U1 satisfy Rh(q,u)=u−(1−12Δt)q=0 with observation Gh(q,u)=u. A forward-Euler step of size Δt=1/4 sends U0 to U1=(1−12Δt)U0=−2U0. Its scalar stability condition is ∣1−12Δt∣≤1, equivalently 0≤Δt≤1/6. Use the exact projection PQh(z)=1, exact state/adjoint and objective-interval routines, yδ=0, q0=1, α=1, δ=0, κ=1, τg=1, L=1, τu=τp=0, and set Niter=1, Nsolve=2, Neval=1, and Nbacktrack=1. The declared admissibility predicate checks this explicit-step stability condition before solving; at qinit=1 it rejects the time step, so the inversion algorithm returns inadmissible before a state solve.

The diagram shows the four exact triangular cells and the only interior degree of freedom. It is illustrative; the mass and stiffness calculations in the verification use the stated vertices and affine basis.

ABCDO

Facts & Assumptions

Given: The four-triangle mesh, zero boundary degrees of freedom, the center basis function ϕ, row-sum lumped mass, the scalar semidiscrete heat equation, parameter set Qh={1} with q=U0, state residual Rh(q,u)=u−(1−12Δt)q, observation Gh(q,u)=u, the stated exact routines and finite algorithm inputs, and Δt=1/4.

[F1]

A matching affine simplicial mesh is a finite face-to-face cover with disjoint simplex interiors (Matching affine simplicial meshes and shape regularity).

[F2]

A unisolvent finite element gives a unique shape function for each nodal degree of freedom (Reference finite elements and unisolvent degrees of freedom).

[F3]

The algorithm tests the declared admissibility predicate before any PDE solve and returns inadmissible when it is false (Finite-budget finite-element PDE Tikhonov inversion, Finite-element PDE solver admissibility and certificate contract).

[F4]

The theorem verifies that the algorithm's inadmissible status is returned only on a failed admissibility check (Finite-element PDE Tikhonov statuses are sound and terminate).

Verification

Given: The data in the Example.

1.1givenF1F2algebra

Each of the four triangles has area 1/4. On each triangle, ϕ is the affine barycentric coordinate of the center, so its gradient has magnitude 2. The row-sum lumped mass contribution at the center is ∣K∣/3=1/12 on each triangle, hence mh=4/12=1/3. The stiffness is kh=∑K∫K∣∇ϕ∣2=4⋅4⋅(1/4)=4.

2.1givenstep 1.1algebra

Dividing the semidiscrete equation by mh gives U˙=−(kh/mh)U=−12U. By the specified forward-Euler update, U1=U0+ΔtU˙0=(1−12Δt)U0=−2U0. The scalar amplification has modulus at most one exactly when −1≤1−12Δt≤1, which is equivalent to 0≤Δt≤1/6; Δt=1/4 violates it.

3.1givenF3step 2.1∎

The model's admissibility predicate requires this explicit-step condition. Since the given step fails it, [F3] shows that the algorithm returns inadmissible before calling either state or adjoint solver. This conclusion concerns the declared discrete stability condition, not a stability theorem for the continuous heat equation.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

An unchecked under-solved adjoint can reverse the reduced gradient

Statement refuted

False claim: In every finite-dimensional state-residual Tikhonov model, solving the state exactly guarantees that substituting any approximate adjoint vector preserves the sign of the exact reduced gradient, even when no adjoint-equation residual is checked.

Facts & Assumptions

Given: Take Θh=Vh=Yh=Oh=Qh=R, residual Rh(q,u)=u−q, observation Gh(q,u)=u, datum yδ=1, reference parameter q0=0, penalty α=1, and evaluation at q=0. The state branch is Sh(q)=q, so DuRh=1 is invertible and the exact state at q=0 is u=0.

[F1]

In the finite-element residual contract, p solves (DuR)Tp=∇uJ(q,u) and the exact reduced gradient is ∇qJ(q,u)−(DqR)Tp (Finite-element PDE solver admissibility and certificate contract, The finite-element discrete adjoint gives the reduced gradient).

[F2]

The inversion algorithm accepts a state/adjoint result only when its certified residual bounds meet their declared tolerances; otherwise it returns linear-solve-failed (Finite-budget finite-element PDE Tikhonov inversion).

[F3]

The proposition's status guarantee requires a valid bound on the approximate gradient error (Certified discrete-adjoint residuals give sound finite statuses).

[F4]

The status theorem asserts that linear-solve-failed is returned only on the corresponding failed solver or solver-certificate checks (Finite-element PDE Tikhonov statuses are sound and terminate).

Counterexample

1.1givenF1algebra

At q=0, the unique state is u=0 because R(0,u)=u=0. Its state residual is ∣R(0,0)∣=0, so the state solve is exact. Also DuR=1 and DqR=−1.

2.1F1step 1.1algebra

Here J(q,u)=12(u−1)2+12q2, so ∇uJ(0,0)=−1 and ∇qJ(0,0)=0. The exact adjoint equation is p=−1. By [F1], the exact reduced gradient is 0−(−1)(−1)=−1. The same value follows by differentiating Φ(q)=12(q−1)2+12q2.

2.2givenF1step 1.1algebra

If an unchecked iterative adjoint returns p~=1, its computed reduced gradient is g~=∇qJ(0,0)−(DqR)Tp~=0−(−1)(1)=1, the opposite sign. Its exact adjoint-equation residual is ∣(DuR)Tp~−∇uJ(0,0)∣=∣1−(−1)∣=2.

3.1F2F3step 2.2algebra∎

With declared adjoint residual tolerance τp=1, the residual in step 2.2 exceeds tolerance. By [F2], the algorithm rejects this vector as a solver result with status linear-solve-failed; it cannot receive converged. Step 2.2 nevertheless exhibits opposite gradient signs when the unchecked vector is substituted. Thus an exact state solve alone does not determine the gradient sign. Treating p~ as a contract-valid solver result would violate the adjoint-residual requirement. The gradient-error certificate [F3] remains valid: take ηu=0, ηp=2, P=Mq=LG,u=1, and LJ,u=LR,u=0, which satisfy all the proposition's bounds and give εg=2=∣g~−∇Φ(0)∣. This error bound permits the observed sign reversal.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

A zero algebraic solve residual leaves a separate finite-element model error

Example

Assume Countable Choice. Let Ω=(0,1)2 be triangulated by joining its center O=(1/2,1/2) to the four corners, and let ϕ be the continuous piecewise-affine nodal basis function that is 1 at O and 0 at the corners. Set w=ϕ2 and equip V=H01(Ω;R) with the full Sobolev norm. Use the coercive bilinear form

a(v,z)=∫Ω(vz+∇v⋅∇z) dx.

Let U=L2(Ω;R) and define the bounded rank-one control operator B:U→V∗ by

(Bq)(z):=(∫Ωq dx)a(w,z)(q∈U, z∈V).

Take the pointwise admissible box Qad={q∈U:0≤q≤1 almost everywhere} and restrict the optimization to its finite-dimensional constant subspace Qh={γ1Ω:0≤γ≤1}. Identify this coefficient line with Θh=R and Qh=[0,1] in the Euclidean coefficient, so ∥γ1Ω∥U=∣γ∣. The weak state u(γ)∈V for the control q=γ1Ω satisfies

a(u(γ),z)=(B(γ1Ω))(z)=γa(w,z)(z∈V),

and observe F(γ)=∫Ωu(γ) dx. On the same mesh use the one-dimensional continuous piecewise-affine state space Vh=span⁡{ϕ}, solve the Galerkin equation with the same right hand side, and write its observation as Fh(γ)=∫Ωuh(γ) dx. With datum y=F(1)=1/6, reference coefficient 0, and Tikhonov penalty α=1, the exact continuous-objective minimizer on [0,1] is γ∗=1/37, whereas the finite-element-objective minimizer is γh=10375/295028. They differ even when the Galerkin state and discrete adjoint equations are solved exactly and have zero algebraic residual. The forward mesh discrepancy is separately bounded on the entire admissible interval by

sup⁡0≤γ≤1∣F(γ)−Fh(γ)∣=41/750.

To instantiate the status, initialize the algorithm at qinit=γh, set τg=0, L=1, τu=τp=0, δ=0, κ=1, Niter=1, Nsolve=2, Neval=2, and Nbacktrack=1. Use the exact projection onto [0,1], exact state, adjoint and objective-evaluation routines, zero error certificates and finite valid derivative bounds. Since γh∈(0,1) and Φh′(γh)=0, the exact discrete projected-gradient residual is zero and the algorithm returns converged at step 4 before its discrepancy check. This status certifies only discrete stationarity; the explicit mesh discrepancy is a separate quantity.

The drawing shows the four cells and the interior basis node used in all integrals. The verification uses the affine barycentric coordinate on each exact triangle; it does not infer any value from the drawing.

ABCDO

Facts & Assumptions

Given: The unit square, the four-cell mesh, the specified bilinear form and forcing functional, the scalar control coefficient space Θh=R with Qh=[0,1], Countable Choice, the piecewise-affine state space, observation F(γ)=∫Ωu(γ), the data and penalty, and the exact algorithm routines and tolerances specified in the Example.

[A1]

Countable Choice means that every sequence of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]

For the bounded Lipschitz domain and bounded coercive form, the state and adjoint equations have unique solutions under Countable Choice (Linear coercive elliptic PDE control problem and reduced objective, Well-posedness of elliptic control state and adjoint equations).

[F2]

A continuous piecewise polynomial with zero boundary facet traces on a bounded polyhedral matching mesh lies in W01,2 under Countable Choice (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).

[F3]

On each cell the mesh is affine and the local nodal degree-of-freedom map is unisolvent (Matching affine simplicial meshes and shape regularity, Reference finite elements and unisolvent degrees of freedom).

[F4]

For α>0, the Tikhonov objective is one half squared data misfit plus α/2 times the squared distance from the reference parameter (The nonlinear Tikhonov functional).

[F5]

The algorithm's converged status tests the exact discrete projected-gradient residual, not the continuous-to-discrete mesh error (Finite-budget finite-element PDE Tikhonov inversion, Finite-element PDE solver admissibility and certificate contract).

[F6]

In any real inner-product space, ∣⟨v,z⟩∣≤∥v∥∥z∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F7]

The algorithm's converged status is sound for the exact discrete projected-gradient residual but asserts no mesh convergence or continuous-model accuracy (Finite-element PDE Tikhonov statuses are sound and terminate).

Verification

Given: The assumptions above and the exact definitions of Ω, ϕ, w, a, the state forcing, and the one-dimensional control coefficient.

1.1A1F1F2F3F6algebra

The four triangles have area 1/4. On each triangle ϕ is the barycentric coordinate of O. For k=1,2,3, integration on the reference triangle gives ∫Kϕk=∣K∣ 2/((k+1)(k+2)); this follows by integrating (1−x−y)k over 0≤x≤1, 0≤y≤1−x. Hence ∫Ωϕ=1/3, ∫Ωϕ2=1/6, and ∫Ωϕ3=1/10. Each cell's base is a unit square edge and its altitude from O is 1/2, so the affine barycentric coordinate has gradient magnitude 2; therefore ∫Ω∣∇ϕ∣2=4. By [F2], w=ϕ2∈H01(Ω). Since ∣Ω∣=1, [F6] gives ∣∫Ωq∣≤∥q∥L2, and it also gives ∣a(w,z)∣≤∥w∥V∥z∥V; hence B is a bounded linear map into V∗. The same inequality gives ∣∫Ωv∣≤∥v∥L2≤∥v∥V, so the observation is bounded. The form has a(v,v)=∥v∥V2 and continuity constant 1, so [F1] applies and gives a unique state.

2.1F1step 1.1givenalgebra

The exact state is u(γ)=γw, since substituting it gives a(u(γ),z)=γa(w,z) for every z∈V; uniqueness from [F1] identifies this as the state map. Therefore F(γ)=γ∫Ωϕ2=γ/6.

2.2givenstep 1.1F3algebra

Write the Galerkin state as uh(γ)=cγϕ. Testing its weak equation with ϕ gives c a(ϕ,ϕ)=a(ϕ2,ϕ). Here a(ϕ,ϕ)=∫(ϕ2+∣∇ϕ∣2)=1/6+4=25/6, while a(ϕ2,ϕ)=∫(ϕ3+2ϕ∣∇ϕ∣2)=1/10+2⋅4⋅(1/3)=83/30. Thus c=(83/30)/(25/6)=83/125, and Fh(γ)=cγ∫Ωϕ=83γ/375. The scalar Galerkin stiffness 25/6 is positive, so this state solve is unique and its exact algebraic residual is zero.

3.1F4step 2.1step 2.2algebra

The exact objective is Φ(γ)=12(γ/6−1/6)2+12γ2. Its derivative is (1/36+1)γ−1/36, so its unique minimizer is γ∗=1/37∈[0,1]. The discrete objective is Φh(γ)=12(83γ/375−1/6)2+12γ2. Its derivative is ((83/375)2+1)γ−(83/375)(1/6). Since (83/375)(1/6)=83/2250 and (83/375)2+1=147514/140625, its unique zero is γh=(83/2250)(140625/147514)=10375/295028∈[0,1]. Both second derivatives are positive, so these stationary points are the unique minimizers on the interval. Moreover 10375⋅37=383875>295028, hence γh>1/37=γ∗.

4.1F4F5F7step 2.2step 3.1algebra∎

For every γ∈[0,1], ∣F(γ)−Fh(γ)∣=∣γ∣ ∣1/6−83/375∣≤41/750, with equality at γ=1. Thus the forward mesh discrepancy has the explicit bound 41/750. The scalar Galerkin state matrix is 25/6>0, and the scalar adjoint matrix is its transpose, so both equations can be solved exactly with zero algebraic residuals. By [F4], [F5] and [F7], the exact discrete reduced gradient at γh is Φh′(γh)=0. With the algorithm inputs specified in the Example, γh is interior and P[0,1](γh−Φh′(γh))=γh, so the projected-gradient residual is zero. The state and adjoint solves use the two solve calls, while the projection uses one of the two evaluation calls, leaving the evaluation budget unexhausted at step 4; hence the algorithm returns converged before its discrepancy check. This status certifies only discrete stationarity while the continuous model has the different minimizer proved in step 3.1; the mesh bound remains separate.

Sources