Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31
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.

On the invertible locus, Dinv(A)[H]=A1HA1

Statement

Let A be invertible. Then the inversion map is real Fr'echet differentiable at A, and for every direction H,

Dinv(A)[H]=A1HA1.

Facts & Assumptions

Given: An invertible matrix A and a perturbation direction H.

[L1]

Matrix differentials satisfy the product rule d(AB)=dAB+AdB (Matrix differentials obey the sum rule, product rule, and adjoint rule).

Proof

technique · direct
1.1

Because A is invertible, det(A)0. Since det(A+K) is a polynomial in the real coordinates of K with value det(A) at K=0, there is ε>0 such that A+K is invertible whenever KF<ε. For such K, the identities (A+K)1(A+K)=I=A1A give (A+K)1A1=A1K(A+K)1, and hence ((A+K)1A1)+A1KA1=A1KA1K(A+K)1.

givenalgebra
2.1

Shrink ε so that A12KF12 whenever KF<ε. From step 1.1, (A+K)12A12+A12KF(A+K)12, so (A+K)122A12. Applying this bound to the second identity in step 1.1 yields (A+K)1A1+A1KA1F2A123KF2=o(KF). Therefore inversion is real Fr'echet differentiable at A with derivative KA1KA1.

step 1.1algebra
3.1

Differentiating the identity AA1=I and using the product rule [L1] gives HA1+ADinv(A)[H]=0. Left-multiplying by A1 recovers Dinv(A)[H]=A1HA1, which is the formula claimed in the statement.

L1step 2.1algebra

Depends on

Used by

Dependency tree · two levels

6 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