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.
PDE-constrained inversion and adjoint error control — Examples and Counterexamples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- 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
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite element pde constrained optimization
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- 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
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonlinear maps and tangential cone control
- Nonlinear Tikhonov existence and stability
- Nonsmooth contact time stepping and projections
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- PDE-constrained inversion and adjoint error control
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- 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
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Poincare and Morrey Inequalities
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
A CFL-violating finite-element iterate is rejected before inversion
Example
Let and triangulate its square by joining the center 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 at and at each corner. The one-coordinate semidiscrete heat equation is , where and . Treat the initial coefficient as the inversion parameter, take and , and let the one-step state satisfy with observation . A forward-Euler step of size sends to . Its scalar stability condition is , equivalently . Use the exact projection , exact state/adjoint and objective-interval routines, , , , , , , , , and set , , , and . The declared admissibility predicate checks this explicit-step stability condition before solving; at 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.
Example references
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 with , state residual , observation , the stated exact routines and finite algorithm inputs, and .
A matching affine simplicial mesh is a finite face-to-face cover with disjoint simplex interiors (Matching affine simplicial meshes and shape regularity).
A unisolvent finite element gives a unique shape function for each nodal degree of freedom (Reference finite elements and unisolvent degrees of freedom).
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).
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.
Each of the four triangles has area . On each triangle, is the affine barycentric coordinate of the center, so its gradient has magnitude . The row-sum lumped mass contribution at the center is on each triangle, hence . The stiffness is .
Dividing the semidiscrete equation by gives . By the specified forward-Euler update, . The scalar amplification has modulus at most one exactly when , which is equivalent to ; violates it.
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.
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.
Statement references
Facts & Assumptions
Given: Take , residual , observation , datum , reference parameter , penalty , and evaluation at . The state branch is , so is invertible and the exact state at is .
In the finite-element residual contract, solves and the exact reduced gradient is (Finite-element PDE solver admissibility and certificate contract, The finite-element discrete adjoint gives the reduced gradient).
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).
The proposition's status guarantee requires a valid bound on the approximate gradient error (Certified discrete-adjoint residuals give sound finite statuses).
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
At , the unique state is because . Its state residual is , so the state solve is exact. Also and .
Here , so and . The exact adjoint equation is . By [F1], the exact reduced gradient is . The same value follows by differentiating .
If an unchecked iterative adjoint returns , its computed reduced gradient is , the opposite sign. Its exact adjoint-equation residual is .
With declared adjoint residual tolerance , 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 as a contract-valid solver result would violate the adjoint-residual requirement. The gradient-error certificate [F3] remains valid: take , , , and , which satisfy all the proposition's bounds and give . This error bound permits the observed sign reversal.
A zero algebraic solve residual leaves a separate finite-element model error
Example
Assume Countable Choice. Let be triangulated by joining its center to the four corners, and let be the continuous piecewise-affine nodal basis function that is at and at the corners. Set and equip with the full Sobolev norm. Use the coercive bilinear form
Let and define the bounded rank-one control operator by
Take the pointwise admissible box and restrict the optimization to its finite-dimensional constant subspace . Identify this coefficient line with and in the Euclidean coefficient, so . The weak state for the control satisfies
and observe . On the same mesh use the one-dimensional continuous piecewise-affine state space , solve the Galerkin equation with the same right hand side, and write its observation as . With datum , reference coefficient , and Tikhonov penalty , the exact continuous-objective minimizer on is , whereas the finite-element-objective minimizer is . 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
To instantiate the status, initialize the algorithm at , set , , , , , , , , and . Use the exact projection onto , exact state, adjoint and objective-evaluation routines, zero error certificates and finite valid derivative bounds. Since and , 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.
Example references
Continuous piecewise-affine finite elements
Coercive elliptic weak-state setting
State well-posedness under Countable Choice
Zero-boundary conforming polynomials lie in
Exact finite-element adjoint gradient
Cauchy–Schwarz inequality in the Sobolev inner product
Finite-element inversion status
Facts & Assumptions
Given: The unit square, the four-cell mesh, the specified bilinear form and forcing functional, the scalar control coefficient space with , Countable Choice, the piecewise-affine state space, observation , the data and penalty, and the exact algorithm routines and tolerances specified in the Example.
Countable Choice means that every sequence of nonempty sets has a choice function (The Axiom of Countable Choice ()).
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).
A continuous piecewise polynomial with zero boundary facet traces on a bounded polyhedral matching mesh lies in under Countable Choice (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).
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).
For , the Tikhonov objective is one half squared data misfit plus times the squared distance from the reference parameter (The nonlinear Tikhonov functional).
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).
In any real inner-product space, (Cauchy–Schwarz: , with equality exactly for dependent pairs).
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 , , , , the state forcing, and the one-dimensional control coefficient.
The four triangles have area . On each triangle is the barycentric coordinate of . For , integration on the reference triangle gives ; this follows by integrating over , . Hence , , and . Each cell's base is a unit square edge and its altitude from is , so the affine barycentric coordinate has gradient magnitude ; therefore . By [F2], . Since , [F6] gives , and it also gives ; hence is a bounded linear map into . The same inequality gives , so the observation is bounded. The form has and continuity constant , so [F1] applies and gives a unique state.
The exact state is , since substituting it gives for every ; uniqueness from [F1] identifies this as the state map. Therefore .
Write the Galerkin state as . Testing its weak equation with gives . Here , while . Thus , and . The scalar Galerkin stiffness is positive, so this state solve is unique and its exact algebraic residual is zero.
The exact objective is . Its derivative is , so its unique minimizer is . The discrete objective is . Its derivative is . Since and , its unique zero is . Both second derivatives are positive, so these stationary points are the unique minimizers on the interval. Moreover , hence .
For every , , with equality at . Thus the forward mesh discrepancy has the explicit bound . The scalar Galerkin state matrix is , 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 is . With the algorithm inputs specified in the Example, is interior and , 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.