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 continuous and pde adjoint sensitivities — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Automatic differentiation and computational graphs
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Céa and Aubin–Nitsche error estimates
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Computational foundations: factorization, KL, and optimization
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connectedness
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Data assimilation: 3DVAR, 4DVAR, and ensemble filters
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete continuous and pde adjoint sensitivities
- Discrete Time Martingales
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Probability and the Probabilistic Method
- Fixed-interval Gaussian smoothing and RTS recursion
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Global ODE and Log-density Integration Error
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Implicit stiff time stepping and algebraic error
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- 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
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- One-step ODE Consistency and Local Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Runge–Kutta Methods and Order
- Schwartz Space and the Plancherel Theorem
- Scientific model contracts and applicability
- 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
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Approximation and Sobolev Extension
- Smooth Partitions of Unity and Exhaustions
- Splitting Fields
- Standard-Borel Real Codings and Determining Classes
- State-space model laws
- State-space models and exact Bayesian filtering
- Stationary means and sample autocovariance
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- 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 Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Variational crimes and Strang lemmas
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Derivatives and Sobolev Spaces
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
A two-observation 4DVAR objective has an exact reverse gradient
Example
Take the scalar discrete model , , and . Instantiate the strong-constraint objective of Strong- and weak-constraint 4DVAR with a finite gradient run with , , , model maps and , and observation maps . Choose and the scalar positive-definite covariance matrices . The decision variable is the initial state ; there are no weak-constraint model-error penalties. The objective is exactly
Facts & Assumptions
Given: The finite scalar state-step graph, identity observation maps, unit positive-definite covariances, strong-constraint objective, and exact-real arithmetic.
The reverse recursion for a finite state-step objective is its exact gradient (The reverse recursion is the exact gradient of a finite state-step objective).
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 on their open domains and the selected scalar covariances are positive definite, so that objective is admissible.
Verification
Direct substitution gives and , so and .
The terminal adjoint seed is . The reverse recursion [F1] gives and . Since , the adjoint gradient is , agreeing with the direct derivative.
Backward Euler differentiates a stiff scalar decay fit on its exact branch
Example
For with fixed and step size , take and the one-stage backward Euler equation . Its fixed-point map sends the invariant interval into itself and has contraction factor , 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 .
Facts & Assumptions
Given: The scalar backward Euler stage equation, the stated parameter interval, and the terminal quadratic objective.
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).
On a nonsingular selected stage branch, implicit differentiation gives and differentiates the Runge--Kutta update (An implicit Runge-Kutta stage has the stated parameter sensitivity on its selected branch).
Backward Euler is the one-stage implicit Runge--Kutta method with and (Backward Euler step equation and algebraic residual).
Verification
To apply [F1] with the prescribed center , use the larger closed ball of radius . For , take and ; then and . The field is on with derivative bounded by , so the nonsingularity hypotheses inherited by [F2] hold on this ball. Solving the scalar residual gives , hence . Since , this is the unique root in the stated interval and agrees with the branch in [F1].
Differentiate the residual : , so [F2] gives . Therefore .
A one-dimensional elliptic diffusion coefficient has the adjoint gradient
Example
Let with its standard norm, let , and define and . Take . On a neighborhood of each fixed , the form is uniformly coercive in the 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.
For a uniformly coercive parameterized elliptic variational state and objective, the adjoint formula gives (The elliptic adjoint gives the reduced parameter gradient).
The elliptic variational definition treats states as weak solutions of (Parameter-dependent coercive elliptic variational states and objectives).
The quadratic belongs to (The two-cell hat and quadratic functions belong to H¹₀).
is the closure of in the norm (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).
The integral of the derivative of a C1 scalar function equals its endpoint increment (The second fundamental theorem: if is differentiable on with and is integrable, then ).
Differentiable products obey the product rule (Sums, scalar multiples, products and quotients: , , , and when ).
The integral pairing is bounded by the product of L2 norms (Holder's inequality for integrals, including the endpoint cases).
with the standard inner product is a real Hilbert space (The Sobolev space is a Hilbert space).
Countable Choice is inherited from the state, adjoint, and H0 membership suppliers (The Axiom of Countable Choice ()).
Verification
Put . Direct differentiation gives , , and [F3] gives . By [F9], is a real Hilbert space. Holder's inequality [F8] gives , so ; the objective is bounded linear in and independent of , hence with and . Also for , and is operator-norm , while is constant. For each and , [F5] supplies with . By the product rule [F7], ; since vanishes at both endpoints, [F6] gives . By [F8], the difference between the two sides with in place of is at most , so the weak identity follows as . Also, [F4] gives ; on a neighborhood of each this is a uniform coercivity bound. Hence solves the state equation and is unique. Finally , so .
The adjoint equation is for all , so symmetry of and uniqueness give . The direct parameter derivatives of and vanish. For the scalar parameter direction , . Direct integration gives , hence .
Formula [F1] therefore gives , equal to the derivative of the explicit reduced objective in step 1.1.
A two-interval shooting residual has a block-bidiagonal sensitivity Jacobian
Example
For on two intervals of length , define shooting nodes and residuals , , and . 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 .
Facts & Assumptions
Given: , , the two exact-flow intervals, and the finite shooting graph.
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).
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).
The exponential is smooth with derivative equal to itself, is positive, satisfies , and is increasing (The exponential function is smooth and , The exponential is positive and satisfies , The exponential function is strictly increasing).
The chain and product rules differentiate the displayed functions; a continuous function on an interval with zero interior derivative is constant (The chain rule for total derivatives: , Sums, scalar multiples, products and quotients: , , , and when , A function continuous on an interval whose derivative vanishes at every interior point of is constant on ; consequently two such functions with the same derivative differ by a constant).
Verification
The function satisfies and . Conversely, for any solution with this initial value, the product and chain rules give . By [F4] this product is constantly on its solution interval, and positivity and the reciprocal identity in [F3] imply . Thus the displayed solution exists globally and is unique.
Verify the actual common-tube hypotheses locally at any . Fix and restrict the parameters to , . For , Treat as the flow parameter, with initial map and field on . The bounded convex open set has compact closure inside that field's domain and contains all these trajectories for and the restricted parameters. The field and initial map are . 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.
The exact interval map is therefore . Differentiate the residuals with respect to and , writing : The state Jacobian is lower bidiagonal, and the parameter column contains the two local flow sensitivities.
Solving gives , , and . Direct differentiation yields . The discrete adjoint for the two flow steps seeds , then gives and ; its parameter sum is . Thus the reverse gradient agrees with the differentiated shooting solution.
A finite QR record recovers the tangent-volume change
Example
Take , , and . Both positive-diagonal QR factorizations keep and have .
Facts & Assumptions
Given: The two invertible diagonal tangent matrices and the finite-time QR identity.
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
The product is , so . The positive-diagonal QR factors have diagonal entries and .
Their accumulated log sum is , which matches [F1]. The calculation is finite-time and asserts no limit.
A strict tent-map itinerary has exponential finite-time sensitivity growth
Example
Let for and for . Fix a finite integer , take near , and set the terminal objective to .
Facts & Assumptions
Given: The two affine branches, a finite horizon , and the finite state-step adjoint rule.
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
At , the orbit is and for every . If , then the first state remains below and each later state remains within of through time ; hence this whole open neighborhood has the same strict branch itinerary.
On that neighborhood the first derivative is , and each of the next derivatives is . The chain rule gives , whose magnitude is . By [F1], reverse accumulation returns this same finite-horizon derivative. No infinite-time exponent or orbit-shadowing claim is involved.
A mismatched terminal adjoint condition changes the discrete gradient
Example
Take , one step , and terminal objective . The correct terminal adjoint seed is .
Facts & Assumptions
Given: The one-step scalar graph, terminal loss, and exact reverse recursion.
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
Directly, , so . The correct seed is at and the transition derivative is , so the exact adjoint gradient is also zero.
If the terminal seed is incorrectly replaced by , reverse accumulation returns at , which differs from . Thus the terminal condition is load-bearing for the discrete gradient.
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 scalar maps and the uniform state norm on .
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 and , let the exact state be and the approximate state be . The exact and approximate reduced objectives are these states themselves.
For every and , . Thus the state error tends uniformly to zero as .
Differentiating gives and . At , the gradient error is , which is unbounded as . This refutes the stated implication; the example lacks a uniform derivative-data bound of the type required by [F1].
Sources
- William W. Hager, Runge-Kutta methods in optimal control and the transformed adjoint system, §3
- Michael B. Giles and Niles A. Pierce, An Introduction to the Adjoint Approach to Design, §2.4
- John C. Butcher, Implicit Runge-Kutta Methods, tutorial, §§1–2
- William W. Hager, Runge-Kutta methods in optimal control and the transformed adjoint system, §§2–3
- Hannes Meinlschmidt, Optimization with Partial Differential Equations, complete lecture notes, §§1.1–1.2 and Example 3.39
- Michael B. Giles and Niles A. Pierce, An Introduction to the Adjoint Approach to Design, §§2.4–3
- Predrag Cvitanović et al., ChaosBook, Chapter 6: Lyapunov exponents, §6.2
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §7D, result 7.58
- Michael B. Giles and Niles A. Pierce, An Introduction to the Adjoint Approach to Design, §4
- William W. Hager, Runge-Kutta methods in optimal control and the transformed adjoint system, §§3–4