Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 ϕ(A,b)=A−1b, let A,B∈Rn×n, b,x^∈Rn, n≥1, and suppose certified exact-residual bounds satisfy ∥I−AB∥2≤d<1,∥b−Ax^∥2≤ρ,∥B∥2≤M,K=M1−d. Then A is invertible; writing x=A−1b, the fixed linear derivative approximations J~bh=Bh and J~AH=−BHx^ obey ∥J~b−Jb∥≤ηb=Kd,∥J~A−JA∥≤ηA=Kd∥x^∥2+K2ρ. Use Euclidean vector norms and Frobenius matrix-input norm. For any stored matrix B and stored cotangent c∈Rn, the exact adjoints are BTc and −(BTc)x^T. Let u be the unit roundoff in The standard relative floating-point model and unit roundoff, and assume nu<1. For each j=1,…,n, compute λ^j by the sequential real dot rule: pi=fl⁡(Bijci) for i=1,…,n, s1=p1, and si=fl⁡(si−1+pi) for i=2,…,n, with each product and addition rounded separately; set λ^j=sn. Form the matrix cotangent as the componentwise rounded outer product −fl⁡(λ^x^T). 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 γn=nu/(1−nu) and t=γn∥B∥F. The resulting cotangent errors are bounded by (ηb+t)∥c∥2 and [ηA+(t+u(M+t))∥x^∥2]∥c∥2, respectively. These are derivative approximations to the mathematical solve map, not derivatives of the rounded program.

The fixed B 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 x^,B 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.

[F1]

Implicit differentiation and adjoint formulas under a nonsingular residual Jacobian gives Jbh=A−1h, JAH=−A−1Hx by differentiating Ax−b=0.

[F2]

Rounded matrix products give certified linear and normal-equation residual allowances supplies explicit linear residual allowances for the primal and stored basis-column solves.

[F4]

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.

[F5]

The standard relative floating-point model and unit roundoff: a successful nonzero real rounded operation has relative error at most u, and exact zero operations are exact.

[F6]

If |delta_i| <= u and n u < 1, then prod (1+delta_i) = 1 + theta_n with |theta_n| <= gamma_n: if ∣δi∣≤u for k factors and ku<1, then ∣∏i=1k(1+δi)−1∣≤γk=ku/(1−ku).

[F7]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣⟨x,y⟩∣≤∥x∥2∥y∥2 for Euclidean vectors; applying it rowwise gives ∥Mz∥2≤∥M∥F∥z∥2.

[F8]

Composition satisfies |ST|\le|S|,|T|: induced operator norms satisfy ∥ST∥≤∥S∥ ∥T∥ for composable maps.

[F9]

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 ∥Tz∥2≤∥T∥ ∥z∥2.

Proof

1.1givenF2F3F8F9algebra

For every z, ∥ABz∥≥(1−d)∥z∥ by [F9]. Applying [F3] to the square map AB, a zero singular value would give a nonzero right singular vector in its kernel, contradicting this lower bound; thus AB is invertible. Then B is injective and A is surjective. The square SVDs of B and A therefore also have no zero singular values, so [F3] makes both invertible. Applying the lower bound to z=(AB)−1y gives ∥(AB)−1∥≤1/(1−d). Since A−1=B(AB)−1, [F8] gives ∥A−1∥≤K. The identity B−A−1=A−1(AB−I) gives ∥B−A−1∥≤Kd, while x^−x=A−1(Ax^−b) gives ∥x^−x∥≤Kρ. The residuals in these identities are exact; [F2] explains how to certify them from rounded evaluations.

2.1F1F7F8F9step 1.1algebra

Apply [F1] at the exact point (A,b). For the matrix edge, BHx^−A−1Hx=(B−A−1)Hx^+A−1H(x^−x). Since ∥H∥2≤∥H∥F by [F7], submultiplicativity [F8], the operator action bound [F9], and step 1.1 give ηA; the vector edge gives ηb. For any linear map J between Euclidean spaces, ∥JTy∥=sup⁡∥x∥=1∣⟨JTy,x⟩∣=sup⁡∥x∥=1∣⟨y,Jx⟩∣≤∥y∥ ∥J∥ by [F7], so ∥JT∥≤∥J∥; applying this to JT gives equality. Thus the adjoint discrepancies have the same norm bounds. This explicitly accounts for the perturbed primal evaluation point through ρ.

3.1givenF4F5F6F7F9step 2.1algebra

Fix an output coordinate j of λ^ and put qi=Bijci. By success in [F4] and the relative bound in [F5], pi=qi(1+αi) with ∣αi∣≤u; exact-zero products have αi=0. For each addition i=2,…,n, write si=(si−1+pi)(1+βi) with ∣βi∣≤u, taking βi=0 when the exact sum is zero. Expanding gives λ^j=sn=∑i=1nqi(1+αi)∏k=max⁡(2,i)n(1+βk), with an empty product interpreted as 1. Each coefficient has at most n factors: for i=1 it has one product factor and n−1 addition factors, while for i≥2 it has one product factor and n−i+1 addition factors. Thus [F6], nu<1, and monotonicity of ku/(1−ku) imply that each coefficient differs from 1 by at most γn. Hence ∣λ^j−(BTc)j∣≤γn∑i∣Bij∣∣ci∣. Stacking these bounds and applying [F7] to ∣B∣T∣c∣ gives ∥λ^−BTc∥2≤t∥c∥2. By the adjoint norm equality in step 2.1 and the action bound [F9], ∥BTc∥2≤M∥c∥2, so ∥λ^∥2≤(M+t)∥c∥2. Each rounded outer-product entry has error at most u∣λ^ix^j∣, so its Frobenius error is at most u(M+t)∥x^∥2∥c∥2. Combining these bounds with step 2.1 gives the stated vector and matrix cotangent estimates.

4.1F7F9step 3.1algebraconstruct∎

For each realized nonzero c, any cotangent error vector z is the action on c of the linear map zcT/∥c∥2, whose induced norm is ∥z∥/∥c∥ by Cauchy--Schwarz [F7] and equality on c/∥c∥ [F9]; vectorize the matrix cotangent for the matrix edge. When c=0, 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

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