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.
Certified inverse defects and primal residuals bound linear-solve Jacobian and pullback errors
Statement
For the real mathematical solve primitive , let , , , and suppose certified exact-residual bounds satisfy Then is invertible; writing , the fixed linear derivative approximations and obey Use Euclidean vector norms and Frobenius matrix-input norm. For any stored matrix and stored cotangent , the exact adjoints are and . Let be the unit roundoff in The standard relative floating-point model and unit roundoff, and assume . For each , compute by the sequential real dot rule: for , , and for , with each product and addition rounded separately; set . Form the matrix cotangent as the componentwise rounded outer product . Assume every operation succeeds in the operationwise model Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add: each exact intermediate is zero or normal and every rounded output is finite. Put and . The resulting cotangent errors are bounded by and , respectively. These are derivative approximations to the mathematical solve map, not derivatives of the rounded program.
The fixed may be assembled from stored basis-vector solves using a triangular, Cholesky or QR backend; its defect must be certified rather than inferred from a factor residual. Replay must preserve the same and strict graph branch. Reverse accumulation additions are excluded.
Facts & Assumptions
Given: The stated exact-residual and norm certificates, with arithmetic success for any evaluated pullbacks.
Implicit differentiation and adjoint formulas under a nonsingular residual Jacobian gives , by differentiating .
Rounded matrix products give certified linear and normal-equation residual allowances supplies explicit linear residual allowances for the primal and stored basis-column solves.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition supplies finite square-matrix singular-value and invertibility criteria.
Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add: real products and additions are separately rounded operations, and the operationwise success condition excludes nonzero out-of-range exact intermediates.
The standard relative floating-point model and unit roundoff: a successful nonzero real rounded operation has relative error at most , and exact zero operations are exact.
If |delta_i| <= u and n u < 1, then prod (1+delta_i) = 1 + theta_n with |theta_n| <= gamma_n: if for factors and , then .
Cauchy–Schwarz: , with equality exactly for dependent pairs: for Euclidean vectors; applying it rowwise gives .
Composition satisfies |ST|\le|S|,|T|: induced operator norms satisfy for composable maps.
The operator norm as the least bound and as the unit-sphere or unit-ball supremum: the operator norm is the unit-ball supremum and satisfies .
Proof
For every , by [F9]. Applying [F3] to the square map , a zero singular value would give a nonzero right singular vector in its kernel, contradicting this lower bound; thus is invertible. Then is injective and is surjective. The square SVDs of and therefore also have no zero singular values, so [F3] makes both invertible. Applying the lower bound to gives . Since , [F8] gives . The identity gives , while gives . The residuals in these identities are exact; [F2] explains how to certify them from rounded evaluations.
Apply [F1] at the exact point . For the matrix edge, . Since by [F7], submultiplicativity [F8], the operator action bound [F9], and step 1.1 give ; the vector edge gives . For any linear map between Euclidean spaces, by [F7], so ; applying this to gives equality. Thus the adjoint discrepancies have the same norm bounds. This explicitly accounts for the perturbed primal evaluation point through .
Fix an output coordinate of and put . By success in [F4] and the relative bound in [F5], with ; exact-zero products have . For each addition , write with , taking when the exact sum is zero. Expanding gives , with an empty product interpreted as . Each coefficient has at most factors: for it has one product factor and addition factors, while for it has one product factor and addition factors. Thus [F6], , and monotonicity of imply that each coefficient differs from by at most . Hence . Stacking these bounds and applying [F7] to gives . By the adjoint norm equality in step 2.1 and the action bound [F9], , so . Each rounded outer-product entry has error at most , so its Frobenius error is at most . Combining these bounds with step 2.1 gives the stated vector and matrix cotangent estimates.
For each realized nonzero , any cotangent error vector is the action on of the linear map , whose induced norm is by Cauchy--Schwarz [F7] and equality on [F9]; vectorize the matrix cotangent for the matrix edge. When , successful operations return exact zero. Thus the realized rounded pullbacks admit local linear-map perturbations with the displayed bounds, without asserting global linearity of rounding. The graph perturbation theorem may propagate these realized maps with exact accumulation.
Depends on
- Implicit differentiation and adjoint formulas under a nonsingular residual Jacobian
- Rounded matrix products give certified linear and normal-equation residual allowances
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add
- The standard relative floating-point model and unit roundoff
- If |delta_i| <= u and n u < 1, then prod (1+delta_i) = 1 + theta_n with |theta_n| <= gamma_n
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- Composition satisfies \|ST\|\le\|S\|\,\|T\|
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
Used by
Dependency tree · two levels
29 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
- Stuart and Voss, Matrix Analysis and Algorithms (standard reference, not scraped)