Alphabeta Math
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.

✓ 18 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 13 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Matrix Differentiation and First-order Spectral Perturbation

1 · Prerequisites

2 · Summary

This page works over the underlying real vector space throughout. It first packages the differential rules that later perturbation formulas actually use: sum, product, adjoint, inverse, determinant, trace, and least-squares gradients.

The spectral half stays strictly in the simple-spectrum regime. After the left/right eigendata, projector, and reduced resolvent are in place, the page uses the real implicit-function theorem to produce local C1 branches and then derives the first-order eigenvalue, projector, eigenvector, and singular value formulas. The closing counterexamples record exactly where simplicity, gauge-fixing, and first-order differentiability fail.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The real Frechet derivative on real and complex matrix spaces with the Frobenius norm

Definition

Let U be an open subset of a real matrix space Rm×n or of a complex matrix space Cm×n viewed as a real vector space, and let F:U→W take values in a finite-dimensional real normed vector space (W,∥ ⋅ ∥W). We say that F is real Fr'echet differentiable at A∈U if there is a real-linear map L such that

∥F(A+H)−F(A)−L[H]∥W∥H∥F⟶0(H→0, H≠0).

That map L is the real Fr'echet derivative of F at A and is denoted DF(A).

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

Matrix differentials obey the sum rule, product rule, and adjoint rule

Statement

In the real Fr'echet sense on matrix spaces:

  1. D(A↦A+B)(A)[H]=H for fixed B;
  2. D(A,B↦AB)(A,B)[H,K]=HB+AK;
  3. D(A↦A∗)(A)[H]=H∗.

Equivalently, differential notation gives d(A+B)=dA+dB, d(AB)=dA B+A dB, and d(A∗)=(dA)∗.

Facts & Assumptions

Given: Compatible matrices and perturbation directions.

[F1]

Real Fr'echet differentiability means F(A+H)=F(A)+DF(A)[H]+o(∥H∥F) (The real Frechet derivative on real and complex matrix spaces with the Frobenius norm).

Proof

technique · direct
1.1F1algebra

For the sum map, (A+H)+B=(A+B)+H, so the linear term is already H. For the adjoint map, (A+H)∗=A∗+H∗, so the linear term is H∗. Both have zero remainder in the sense of [F1].

2.1F1algebra∎

For the product map, (A+H)(B+K)=AB+HB+AK+HK. The bilinear term HK satisfies ∥HK∥F≤∥H∥F∥K∥F=o(∥(H,K)∥), so [F1] identifies the derivative as (H,K)↦HB+AK. This is exactly the product rule.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

On the invertible locus, Dinv⁡(A)[H]=−A−1HA−1

Statement

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

Dinv⁡(A)[H]=−A−1HA−1.

Facts & Assumptions

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

[L1]

Matrix differentials satisfy the product rule d(AB)=dA B+A dB (Matrix differentials obey the sum rule, product rule, and adjoint rule).

Proof

technique · direct
1.1givenalgebra

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 ∥K∥F<ε. For such K, the identities (A+K)−1(A+K)=I=A−1A give (A+K)−1−A−1=−A−1K(A+K)−1, and hence ((A+K)−1−A−1)+A−1KA−1=A−1KA−1K(A+K)−1.

2.1step 1.1algebra

Shrink ε so that ∥A−1∥2∥K∥F≤12 whenever ∥K∥F<ε. From step 1.1, ∥(A+K)−1∥2≤∥A−1∥2+∥A−1∥2∥K∥F∥(A+K)−1∥2, so ∥(A+K)−1∥2≤2∥A−1∥2. Applying this bound to the second identity in step 1.1 yields ∥(A+K)−1−A−1+A−1KA−1∥F≤2∥A−1∥23∥K∥F2=o(∥K∥F). Therefore inversion is real Fr'echet differentiable at A with derivative K↦−A−1KA−1.

3.1L1step 2.1algebra∎

Differentiating the identity A A−1=I and using the product rule [L1] gives H A−1+A Dinv⁡(A)[H]=0. Left-multiplying by A−1 recovers Dinv⁡(A)[H]=−A−1HA−1, which is the formula claimed in the statement.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The determinant differential is Ddet⁡(A)[H]=tr⁡(adj⁡(A)H) at every matrix, and Jacobi's formula holds on the invertible locus

Statement

Let A be an n×n matrix and let H be a direction matrix. Then

Ddet⁡(A)[H]=tr⁡(adj⁡(A)H).

If A is invertible, then

Ddet⁡(A)[H]=det⁡(A)tr⁡(A−1H).

Facts & Assumptions

Given: An n×n matrix A and a perturbation direction H.

[L1]

On the invertible locus, the derivative of inversion is Dinv⁡(A)[H]=−A−1HA−1 (On the invertible locus, Dinv⁡(A)[H]=−A−1HA−1).

Proof

technique · direct
1.1givenalgebra

The determinant is multilinear in the columns. In det⁡(A+tH), the coefficient of t comes from replacing exactly one column of A by the corresponding column of H. Those cofactors are precisely the entries of adj⁡(A), so Ddet⁡(A)[H]=tr⁡(adj⁡(A)H).

2.1L1step 1.1algebra∎

If A is invertible, then adj⁡(A)=det⁡(A)A−1. Substituting this identity into step 1.1 gives Ddet⁡(A)[H]=det⁡(A)tr⁡(A−1H), which is Jacobi's formula on the invertible locus. The domain restriction matters because A−1 appears explicitly there, unlike the adjugate formula of step 1.1.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Trace and Frobenius-linear matrix functionals differentiate by inspection

Statement

For square matrices,

D(tr⁡)(A)[H]=tr⁡(H).

For a fixed matrix B, the real-valued Frobenius-linear functional

ΦB(A):=Re⁡tr⁡(B∗A)

satisfies

DΦB(A)[H]=Re⁡tr⁡(B∗H).

Thus the Frobenius gradient of ΦB is B.

Facts & Assumptions

Given: A matrix A, a perturbation direction H, and a fixed matrix B.

[F1]

Real Fr'echet differentiability identifies the first-order linear term in F(A+H)−F(A) (The real Frechet derivative on real and complex matrix spaces with the Frobenius norm).

Proof

technique · direct
1.1F1algebra

The trace is linear, so tr⁡(A+H)−tr⁡(A)=tr⁡(H). Likewise, ΦB(A+H)−ΦB(A)=Re⁡tr⁡(B∗H). Each increment is already linear in H.

2.1F1step 1.1∎

Therefore [F1] gives the displayed derivatives. The Frobenius gradient is the unique matrix G satisfying DΦB(A)[H]=Re⁡tr⁡(G∗H) for every H, and step 1.1 shows that G=B.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Matrix quadratic forms have the expected first derivative and Hessian

Statement

Fix a matrix C and consider the real-valued quadratic form

q(x):=12∥Cx∥22=12x∗C∗Cx.

Then

Dq(x)[h]=Re⁡⟨C∗Cx,h⟩,

so the gradient is C∗Cx, and the Hessian is the constant Hermitian map h↦C∗Ch.

Facts & Assumptions

Given: A fixed matrix C, a vector x, and a perturbation direction h.

[L1]

Matrix differentials satisfy the product and adjoint rules (Matrix differentials obey the sum rule, product rule, and adjoint rule).

[L2]

Frobenius-linear functionals differentiate by inspection (Trace and Frobenius-linear matrix functionals differentiate by inspection).

Proof

technique · direct
1.1L1L2algebra

Expanding at x+h gives q(x+h)=12∥Cx+Ch∥22=12∥Cx∥22+Re⁡⟨Cx,Ch⟩+12∥Ch∥22. Hence Dq(x)[h]=Re⁡⟨C∗Cx,h⟩, so the gradient is C∗Cx.

2.1step 1.1algebra∎

The derivative of the gradient map x↦C∗Cx is the constant linear map h↦C∗Ch. Therefore the Hessian is C∗C.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The Frobenius least-squares objective has gradient A∗(Ax−b) and Hessian A∗A in the vector variable

Statement

For fixed A and b, let

f(x):=12∥Ax−b∥22.

Then

Df(x)[h]=Re⁡⟨A∗(Ax−b),h⟩,

so the gradient is ∇f(x)=A∗(Ax−b) and the Hessian is the constant map h↦A∗Ah.

Facts & Assumptions

Given: A fixed matrix A, a fixed vector b, a vector x, and a direction h.

[L1]

The quadratic form x↦12∥Cx∥22 has gradient C∗Cx and Hessian C∗C (Matrix quadratic forms have the expected first derivative and Hessian).

Proof

technique · direct
1.1L1algebra

Write f(x)=12∥A(x−A+b)∥22+constant only heuristically; directly, f(x+h)−f(x)=12∥Ax−b+Ah∥22−12∥Ax−b∥22. Expanding yields Df(x)[h]=Re⁡⟨Ax−b,Ah⟩=Re⁡⟨A∗(Ax−b),h⟩.

2.1step 1.1algebra∎

The gradient map from step 1.1 is x↦A∗(Ax−b), whose derivative is the constant linear map h↦A∗Ah. Thus the Hessian is A∗A.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Compatible left and right eigenvectors for a simple eigenvalue

Definition

Let A∈Cn×n, equipped with the standard Hermitian inner product, and let λ∈C be a simple eigenvalue of A. A nonzero vector x is a right eigenvector for λ if

Ax=λx.

A nonzero vector y is a left eigenvector for λ if

y∗A=λy∗,

equivalently A∗y=λ‾ y.

Such x and y are called compatible left and right eigenvectors for the simple eigenvalue λ.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

For a simple eigenvalue, left and right eigenvectors pair nontrivially and may be normalized by y∗x=1

Statement

Let λ be a simple eigenvalue of A, and let x,y≠0 be compatible right and left eigenvectors. Then y∗x≠0. Consequently, after rescaling either vector, one may impose the normalization

y∗x=1.

Facts & Assumptions

Given: A simple eigenvalue λ of A and compatible nonzero vectors x,y with Ax=λx and y∗A=λy∗.

[F1]

Compatible left and right eigenvectors for a simple eigenvalue satisfy the displayed equations above (Compatible left and right eigenvectors for a simple eigenvalue).

Proof

technique · direct
1.1F1assume-contraalgebra

Assume for contradiction that y∗x=0. Then x∈ker⁡y∗. Also y∗(A−λI)=0, so range⁡(A−λI)⊆ker⁡y∗. Because λ is simple, rank⁡(A−λI)=n−1 and dim⁡ker⁡y∗=n−1, hence range⁡(A−λI)=ker⁡y∗. Therefore x=(A−λI)z for some z.

2.1contradiction: simplicitydischarge-contradictionstep 1.1algebra∎

Step 1.1 gives (A−λI)2z=0 while (A−λI)z=x≠0, so z starts a Jordan chain of length 2 for λ. That contradicts the simplicity of λ. Hence y∗x≠0. Scaling x by (y∗x)−1 yields the normalization y∗x=1.

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-31Open item page →

The normwise condition number of a simple eigenvalue

Definition

Let λ be a simple eigenvalue of A. The normwise first-order condition number of λ is

κ(λ;A):=sup⁡∥H∥2=1∣Dλ(A)[H]∣,

where, for any compatible nonzero right and left eigenvectors x,y, we set

Dλ(A)[H]:=y∗Hxy∗x.

The denominator is nonzero by For a simple eigenvalue, left and right eigenvectors pair nontrivially and may be normalized by y∗x=1. Any other compatible pair differs by nonzero rescalings because the two eigenspaces are one-dimensional, and those factors cancel from the quotient, so this definition is independent of the chosen pair. The later eigenvalue-derivative theorem shows that this functional is the actual derivative of every local simple eigenvalue branch.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The simple spectral projector P=xy∗/(y∗x)

Definition

Let λ be a simple eigenvalue of A, and let x,y be compatible nonzero right and left eigenvectors. Since y∗x≠0, the rank-one map

P:=xy∗y∗x

is well defined. It is the simple spectral projector onto the eigendirection span⁡{x} along ker⁡y∗.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The simple spectral projector is unchanged by nonzero rescalings of the left and right eigenvectors

Statement

Let P=xy∗/(y∗x) be the simple spectral projector of a simple eigenvalue. If α,β≠0, then the projector formed from x~=αx and y~=βy is still P.

Facts & Assumptions

Given: A simple spectral projector P=xy∗/(y∗x) and nonzero scalars α,β.

[F1]

The projector attached to compatible eigenvectors is xy∗/(y∗x) (The simple spectral projector P=xy∗/(y∗x)).

Proof

technique · direct
1.1F1algebra

By [F1], one has y∗x≠0. Since also α,β≠0, the rescaled denominator satisfies y~∗x~=β‾α y∗x≠0. Therefore the rescaled projector is well defined, and using [F1] again gives x~y~∗y~∗x~=(αx)(β‾y∗)β‾α y∗x=xy∗y∗x=P.

2.1step 1.1∎

Thus nonzero rescaling changes numerator and denominator by the same nonzero factor and leaves the spectral projector unchanged.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The reduced resolvent, or group inverse, on the complementary invariant subspace of a simple eigenvalue

Definition

Let λ be a simple eigenvalue of A, and let P be its simple spectral projector. The reduced resolvent, also called the group inverse at λ, is the unique linear map S satisfying

SP=PS=0,S(A−λI)=(A−λI)S=I−P.

It acts as the inverse of A−λI on the complementary invariant subspace and vanishes on the eigendirection.

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

The reduced resolvent satisfies the standard projector and inverse identities on the complementary invariant subspace

Statement

Let λ be a simple eigenvalue of A, let x,y be compatible eigenvectors normalized by y∗x=1, and let P=xy∗. Then the restriction of A−λI to ker⁡y∗ is a bijection ker⁡y∗→ker⁡y∗. If S is its inverse on ker⁡y∗ and Sx=0, then

SP=PS=0,S(A−λI)=(A−λI)S=I−P,

and this S is unique.

Facts & Assumptions

Given: A simple eigenvalue λ, normalized compatible eigenvectors x,y, and the projector P=xy∗.

[F1]

Under the normalization y∗x=1, the simple spectral projector is P=xy∗ (The simple spectral projector P=xy∗/(y∗x)).

Proof

technique · direct
1.1givenalgebra

Every vector v decomposes uniquely as v=(y∗v)x+(v−(y∗v)x), with the second term in ker⁡y∗. Because y∗A=λy∗, the operator A−λI maps ker⁡y∗ into itself. If z∈ker⁡y∗ and (A−λI)z=0, then z is a right eigenvector for the simple eigenvalue λ, so z=cx for some scalar c. Applying y∗ gives 0=y∗z=c y∗x=c, hence z=0. Therefore the restriction of A−λI to ker⁡y∗ is injective, and since both domain and codomain have dimension n−1, it is bijective.

2.1F1constructstep 1.1algebra

Define S to be the inverse of that restriction on ker⁡y∗ and to vanish on span⁡{x}. Then SP=PS=0 by construction. For v=αx+z with z∈ker⁡y∗, [F1] gives Pv=(y∗v)x=(α+y∗z)x=αx, so (I−P)v=z. Therefore S(A−λI)v=S(A−λI)z=z=(I−P)v, and similarly (A−λI)Sv=(A−λI)Sz=z=(I−P)v. Thus all displayed identities hold.

3.1step 1.1step 2.1algebra∎

If S′ is another linear map with the same identities, then S′x=0 because S′P=0 and Px=x. On ker⁡y∗ one has (A−λI)S′z=z=(A−λI)Sz, and the injectivity from step 1.1 gives S′z=Sz. Hence S′=S, so the reduced resolvent of The reduced resolvent, or group inverse, on the complementary invariant subspace of a simple eigenvalue is well defined and unique.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

A simple eigenvalue and a gauge-fixed right eigenvector admit local C1 branches in the underlying real matrix space

Statement

Let A0 be a square matrix with simple eigenvalue λ0, and choose compatible eigenvectors x0,y0 normalized by y0∗x0=1. Then, in a neighborhood of A0 inside the underlying real matrix space, there exist unique C1 maps A↦λ(A) and A↦x(A) such that

A x(A)=λ(A)x(A),y0∗x(A)=1,

with λ(A0)=λ0 and x(A0)=x0.

Facts & Assumptions

Given: A base matrix A0, a simple eigenvalue λ0, and normalized compatible eigenvectors x0,y0.

[L1]

For a simple eigenvalue, one may normalize compatible left and right eigenvectors by y0∗x0=1 (For a simple eigenvalue, left and right eigenvectors pair nontrivially and may be normalized by y∗x=1).

[L2]

The parametrized implicit-function theorem gives a unique local C1 solution once the derivative in the solved-for variables is invertible (The parametrized implicit function theorem with Ck regularity).

Proof

technique · direct
1.1L1givenalgebra

Consider the real map F(A,λ,x)=((A−λI)x,  y0∗x−1). Its derivative in (λ,x) at (A0,λ0,x0) is (μ,h)↦((A0−λ0I)h−μx0,  y0∗h). If this derivative vanishes, then left-multiplying the first component by y0∗ gives −μy0∗x0=0, hence μ=0 by [L1]. Then (A0−λ0I)h=0 and y0∗h=0, so h is a multiple of x0 whose pairing with y0 is zero; therefore h=0. Thus the derivative is injective. Because domain and codomain have the same real dimension, it is invertible.

2.1L2step 1.1∎

The hypotheses of [L2] now apply to F at (A0,λ0,x0). Therefore there are neighborhoods and unique C1 maps A↦λ(A) and A↦x(A) solving F(A,λ(A),x(A))=0. Those equations are exactly A x(A)=λ(A)x(A) and y0∗x(A)=1, with the required base values.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Along a differentiable matrix path, a simple eigenvalue satisfies λ′=y∗A′x under the normalization y∗x=1

Statement

Let A(t) be differentiable, and let λ(t) be a simple eigenvalue with differentiable compatible eigenvectors x(t),y(t) normalized by y(t)∗x(t)=1. Then

λ′(t)=y(t)∗A′(t)x(t).

Facts & Assumptions

Given: A differentiable matrix path A(t), a differentiable simple eigenpair branch λ(t),x(t),y(t), and the normalization y(t)∗x(t)=1.

[L1]

Proof

technique · direct
1.1givenL1algebra

Differentiate the eigenvalue equation A(t)x(t)=λ(t)x(t): A′(t)x(t)+A(t)x′(t)=λ′(t)x(t)+λ(t)x′(t). Left-multiply by y(t)∗. Since y(t)∗A(t)=λ(t)y(t)∗, the terms with x′(t) cancel.

2.1step 1.1algebra∎

Step 1.1 leaves y(t)∗A′(t)x(t)=λ′(t) y(t)∗x(t). The normalization y(t)∗x(t)=1 therefore gives λ′(t)=y(t)∗A′(t)x(t).

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

The normwise condition number of a simple eigenvalue is ∥x∥2∥y∥2/∣y∗x∣

Statement

Let λ be a simple eigenvalue of A, and let x,y be compatible nonzero right and left eigenvectors. Then

κ(λ;A)=∥x∥2∥y∥2∣y∗x∣.

In particular, for the normalization y∗x=1 one has κ(λ;A)=∥x∥2∥y∥2.

Facts & Assumptions

Given: A simple eigenvalue λ of A and compatible nonzero vectors x,y.

[F1]

The condition number is κ(λ;A)=sup⁡∥H∥2=1∣Dλ(A)[H]∣ (The normwise condition number of a simple eigenvalue).

[L1]

For any differentiable branch normalized by y∗x=1, Dλ(A)[H]=y∗Hx (Along a differentiable matrix path, a simple eigenvalue satisfies λ′=y∗A′x under the normalization y∗x=1).

Proof

technique · direct
1.1F1L1algebra

Normalize first so that y∗x=1. Then [L1] gives ∣Dλ(A)[H]∣=∣y∗Hx∣≤∥y∥2∥H∥2∥x∥2 by Cauchy-Schwarz. Taking the supremum over ∥H∥2=1 in [F1] yields κ(λ;A)≤∥x∥2∥y∥2.

2.1F1L1step 1.1constructalgebra∎

Let u=y/∥y∥2 and v=x/∥x∥2, and define H=uv∗. Then ∥H∥2=1 and y∗Hx=∥y∥2∥x∥2. Hence [F1] and [L1] give the reverse inequality, so κ(λ;A)=∥x∥2∥y∥2 under the normalization y∗x=1. Undoing the normalization inserts the factor ∣y∗x∣−1 and gives the general formula.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

The derivative of the simple spectral projector is expressed by the reduced resolvent and the perturbation

Statement

Let A(t) be differentiable, let λ(t) be a simple eigenvalue branch, let P(t) be the corresponding simple spectral projector, and let S be the reduced resolvent at t=0. Then

P′(0)=−SA′(0)P(0)−P(0)A′(0)S.

Facts & Assumptions

Given: A differentiable simple spectral projector branch P(t) for a simple eigenvalue branch of A(t), and the reduced resolvent S at t=0.

[L1]

The reduced resolvent satisfies SP=PS=0 and S(A−λI)=(A−λI)S=I−P (The reduced resolvent satisfies the standard projector and inverse identities on the complementary invariant subspace).

Proof

technique · direct
1.1L1givenalgebra

Differentiate (A−λI)P=0 at t=0: (A′(0)−λ′(0)I)P+(A−λI)P′=0. Left-multiplying by S and using [L1] together with SP=0 gives (I−P)P′=−SA′(0)P. Differentiating P(A−λI)=0 and right-multiplying by S similarly gives P′(I−P)=−PA′(0)S.

2.1L1step 1.1algebra∎

Differentiating P2=P gives P′=P′P+PP′. Because PP′P=0, this decomposes as P′=(I−P)P′P+PP′(I−P). Substituting the two identities from step 1.1 yields P′=−SA′(0)P−PA′(0)S, which is the claimed formula.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

In a fixed gauge, the derivative of a simple right eigenvector is obtained by applying the reduced resolvent to the perturbation

Statement

Let A(t) be differentiable, let λ(t) be a simple eigenvalue branch, and let x(t) be the right eigenvector branch chosen in the fixed gauge y0∗x(t)=1, where y0 is the left eigenvector at t=0. If S is the reduced resolvent at t=0, then

x′(0)=−SA′(0)x(0).

Facts & Assumptions

Given: A differentiable simple eigenpair branch in the fixed gauge y0∗x(t)=1 and the reduced resolvent S at t=0.

[L1]

The reduced resolvent satisfies S(A−λI)=I−P and Sx=0 (The reduced resolvent satisfies the standard projector and inverse identities on the complementary invariant subspace).

[L2]

Proof

technique · direct
1.1L1L2givenalgebra

Differentiate (A−λI)x=0 at t=0: (A′(0)−λ′(0)I)x+(A−λI)x′=0. Apply S and use [L1]: x′−Px′=−S(A′(0)−λ′(0)I)x. Because the fixed gauge gives y0∗x′(0)=0, the derivative x′(0) lies in ker⁡y0∗, so Px′(0)=x(y0∗x′(0))=0.

2.1L1step 1.1algebra∎

Step 1.1 therefore gives x′(0)=−S(A′(0)−λ′(0)I)x(0). Since Sx(0)=0 by [L1], the λ′(0) term disappears and x′(0)=−SA′(0)x(0).

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

For a Hermitian simple eigenvalue, one may take y=x and the first-order formulas simplify accordingly

Statement

If A(t) is a differentiable Hermitian matrix path, and λ(t),x(t) is a differentiable simple eigenpair branch with ∥x(t)∥2=1, then one may choose the phase locally so that x(t)∗x′(t)=0. With that choice,

λ′(t)=x(t)∗A′(t)x(t),x′(0)=−SA′(0)x(0).

Facts & Assumptions

Given: A differentiable Hermitian matrix path A(t) and a differentiable simple unit eigenvector branch x(t).

Proof

technique · direct
1.1givenalgebra

If A(t)=A(t)∗ and A(t)x(t)=λ(t)x(t), then taking adjoints shows x(t)∗A(t)=λ(t)x(t)∗. Thus the same unit eigenvector can serve as both left and right eigenvector. Multiplying x(t) by a unit complex phase if necessary imposes the gauge x(t)∗x′(t)=0.

2.1L1step 1.1∎

Substitute y=x into the formulas summarized in [L1]. This gives λ′(t)=x(t)∗A′(t)x(t) and, in the chosen gauge, x′(0)=−SA′(0)x(0).

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open item page →

If σ>0 is a simple singular value with left and right singular vectors u,v, then its real directional derivative is Re⁡(u∗Hv)

Statement

Let A be a matrix, let σ>0 be a simple singular value of A, and let u,v be corresponding unit left and right singular vectors, so Av=σu and A∗u=σv. Then the real directional derivative of σ in the direction H is

Dσ(A)[H]=Re⁡(u∗Hv).

Facts & Assumptions

Given: A matrix A, a simple positive singular value σ, unit singular vectors u,v, and a perturbation direction H.

[L1]

For a Hermitian simple eigenvalue, the directional derivative is x∗B′x for the corresponding unit eigenvector (For a Hermitian simple eigenvalue, one may take y=x and the first-order formulas simplify accordingly).

[L2]

A simple eigenvalue of a differentiable matrix path admits a local C1 eigenvalue branch after gauge fixing (A simple eigenvalue and a gauge-fixed right eigenvector admit local C1 branches in the underlying real matrix space).

Proof

technique · direct
1.1constructalgebra

Form the Hermitian block path B(t):=(0A+tH(A+tH)∗0). Then w=12(u,v)T is a unit eigenvector of B(0) with eigenvalue σ, because B(0)w=12(Av,A∗u)T=12(σu,σv)T=σw. If B(0)(x,y)T=σ(x,y)T, then Ay=σx and A∗x=σy, so A∗Ay=σ2y. Since σ is a simple positive singular value, the eigenspace of A∗A for σ2 is one-dimensional, and then x=σ−1Ay is determined by y. Hence σ is a simple eigenvalue of the Hermitian matrix B(0).

2.1L1L2step 1.1algebra

Because t↦B(t) is differentiable and step 1.1 shows that σ is a simple eigenvalue of B(0), [L2] gives a local C1 eigenvalue branch through σ. The derivative of the block path is B′(0)=(0HH∗0). Applying [L1] to this Hermitian simple eigenvalue branch gives Dσ(A)[H]=w∗B′(0)w.

3.1step 2.1algebra∎

Expanding the quadratic form from step 2.1 gives Dσ(A)[H]=12(u∗Hv+v∗H∗u)=Re⁡(u∗Hv).

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

A defective Jordan block can split under perturbation at square-root scale

Statement refuted

Every eigenvalue varies differentiably to first order through a defective point.

Consider

Aε=(λ1ελ).

Its eigenvalues are λ±ε, so the splitting occurs at square-root scale rather than linearly.

Facts & Assumptions

Given: The perturbed Jordan block Aε=(λ1ελ).

Counterexample

technique · direct
1.1F1algebra

By [F1], det⁡(zI−Aε)=(z−λ)2−ε. Therefore the eigenvalues are exactly z±(ε)=λ±ε.

2.1step 1.1algebra∎

The functions λ±ε do not admit ordinary linear first-order expansions at ε=0. Hence a defective eigenvalue need not possess differentiable ordered branches through the perturbation, refuting the claim.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

An ordered eigenvector branch need not extend differentiably through an eigenvalue crossing

Statement refuted

An eigenvector branch chosen by ordering eigenvalues can always be continued differentiably through a crossing.

The family

A(t)=(t00−t)

shows otherwise: the eigendirection belonging to the larger eigenvalue is span⁡{e1} for t>0 and span⁡{e2} for t<0.

Facts & Assumptions

Given: The symmetric family A(t)=(t00−t).

[L1]

Simple eigenpair branches exist locally only while the eigenvalue stays simple (A simple eigenvalue and a gauge-fixed right eigenvector admit local C1 branches in the underlying real matrix space).

Counterexample

technique · direct
1.1algebra

For t>0, the larger eigenvalue is t with eigendirection span⁡{e1}. For t<0, the larger eigenvalue is −t with eigendirection span⁡{e2}. At t=0, the eigenvalue 0 has multiplicity 2.

2.1L1step 1.1∎

Any branch chosen by ordering the eigenvalues by size must jump from span⁡{e2} on the left to span⁡{e1} on the right, so it is not even continuous, let alone differentiable, through the crossing. This agrees with [L1], which applies only on the simple-spectrum locus.

5 · Examples, counterexamples and false statements

None yet.

Sources