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:UW take values in a finite-dimensional real normed vector space (W,W). We say that F is real Fr'echet differentiable at AU if there is a real-linear map L such that

F(A+H)F(A)L[H]WHF0(H0, H0).

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(AA+B)(A)[H]=H for fixed B;
  2. D(A,BAB)(A,B)[H,K]=HB+AK;
  3. D(AA)(A)[H]=H.

Equivalently, differential notation gives d(A+B)=dA+dB, d(AB)=dAB+AdB, 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(HF) (The real Frechet derivative on real and complex matrix spaces with the Frobenius norm).

Proof

technique · direct
1.1

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].

F1algebra
2.1

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

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

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
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(A1H).

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]=A1HA1 (On the invertible locus, Dinv(A)[H]=A1HA1).

Proof

technique · direct
1.1

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).

givenalgebra
2.1

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

L1step 1.1algebra
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):=Retr(BA)

satisfies

DΦB(A)[H]=Retr(BH).

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.1

The trace is linear, so tr(A+H)tr(A)=tr(H). Likewise, ΦB(A+H)ΦB(A)=Retr(BH). Each increment is already linear in H.

F1algebra
2.1

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

F1step 1.1
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):=12Cx22=12xCCx.

Then

Dq(x)[h]=ReCCx,h,

so the gradient is CCx, and the Hessian is the constant Hermitian map hCCh.

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.1

Expanding at x+h gives q(x+h)=12Cx+Ch22=12Cx22+ReCx,Ch+12Ch22. Hence Dq(x)[h]=ReCCx,h, so the gradient is CCx.

L1L2algebra
2.1

The derivative of the gradient map xCCx is the constant linear map hCCh. Therefore the Hessian is CC.

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

The Frobenius least-squares objective has gradient A(Axb) and Hessian AA in the vector variable

Statement

For fixed A and b, let

f(x):=12Axb22.

Then

Df(x)[h]=ReA(Axb),h,

so the gradient is f(x)=A(Axb) and the Hessian is the constant map hAAh.

Facts & Assumptions

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

[L1]

The quadratic form x12Cx22 has gradient CCx and Hessian CC (Matrix quadratic forms have the expected first derivative and Hessian).

Proof

technique · direct
1.1

Write f(x)=12A(xA+b)22+constant only heuristically; directly, f(x+h)f(x)=12Axb+Ah2212Axb22. Expanding yields Df(x)[h]=ReAxb,Ah=ReA(Axb),h.

L1algebra
2.1

The gradient map from step 1.1 is xA(Axb), whose derivative is the constant linear map hAAh. Thus the Hessian is AA.

step 1.1algebra
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 ACn×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

yA=λy,

equivalently Ay=λ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 yx=1

Statement

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

yx=1.

Facts & Assumptions

Given: A simple eigenvalue λ of A and compatible nonzero vectors x,y with Ax=λx and yA=λ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.1

Assume for contradiction that yx=0. Then xkery. Also y(AλI)=0, so range(AλI)kery. Because λ is simple, rank(AλI)=n1 and dimkery=n1, hence range(AλI)=kery. Therefore x=(AλI)z for some z.

F1assume-contraalgebra
2.1

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

contradiction: simplicitydischarge-contradictionstep 1.1algebra
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):=supH2=1Dλ(A)[H],

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

Dλ(A)[H]:=yHxyx.

The denominator is nonzero by For a simple eigenvalue, left and right eigenvectors pair nontrivially and may be normalized by yx=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/(yx)

Definition

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

P:=xyyx

is well defined. It is the simple spectral projector onto the eigendirection span{x} along kery.

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/(yx) 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/(yx) and nonzero scalars α,β.

[F1]

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

Proof

technique · direct
1.1

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

F1algebra
2.1

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

step 1.1
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=IP.

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

PropositionStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-31Open 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 yx=1, and let P=xy. Then the restriction of AλI to kery is a bijection kerykery. If S is its inverse on kery and Sx=0, then

SP=PS=0,S(AλI)=(AλI)S=IP,

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 yx=1, the simple spectral projector is P=xy (The simple spectral projector P=xy/(yx)).

Proof

technique · direct
1.1

Every vector v decomposes uniquely as v=(yv)x+(v(yv)x), with the second term in kery. If zkery 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=yz=cyx=c, hence z=0. Therefore the restriction of AλI to kery is injective, and since both domain and codomain have dimension n1, it is bijective.

givenalgebra
2.1

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

F1constructstep 1.1algebra
3.1

If S is another linear map with the same identities, then Sx=0 because SP=0 and Px=x. On kery one has (AλI)Sz=z=(AλI)Sz, and the injectivity from step 1.1 gives Sz=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.

step 1.1step 2.1algebra
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 y0x0=1. Then, in a neighborhood of A0 inside the underlying real matrix space, there exist unique C1 maps Aλ(A) and Ax(A) such that

Ax(A)=λ(A)x(A),y0x(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 y0x0=1 (For a simple eigenvalue, left and right eigenvectors pair nontrivially and may be normalized by yx=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.1

Consider the real map F(A,λ,x)=((AλI)x,  y0x1). Its derivative in (λ,x) at (A0,λ0,x0) is (μ,h)((A0λ0I)hμx0,  y0h). If this derivative vanishes, then left-multiplying the first component by y0 gives μy0x0=0, hence μ=0 by [L1]. Then (A0λ0I)h=0 and y0h=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.

L1givenalgebra
2.1

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

L2step 1.1
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 λ=yAx under the normalization yx=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.1

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.

givenL1algebra
2.1

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).

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

The normwise condition number of a simple eigenvalue is x2y2/yx

Statement

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

κ(λ;A)=x2y2yx.

In particular, for the normalization yx=1 one has κ(λ;A)=x2y2.

Facts & Assumptions

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

[F1]

The condition number is κ(λ;A)=supH2=1Dλ(A)[H] (The normwise condition number of a simple eigenvalue).

[L1]

For any differentiable branch normalized by yx=1, Dλ(A)[H]=yHx (Along a differentiable matrix path, a simple eigenvalue satisfies λ=yAx under the normalization yx=1).

Proof

technique · direct
1.1

Normalize first so that yx=1. Then [L1] gives Dλ(A)[H]=yHxy2H2x2 by Cauchy-Schwarz. Taking the supremum over H2=1 in [F1] yields κ(λ;A)x2y2.

F1L1algebra
2.1

Let u=y/y2 and v=x/x2, and define H=uv. Then H2=1 and yHx=y2x2. Hence [F1] and [L1] give the reverse inequality, so κ(λ;A)=x2y2 under the normalization yx=1. Undoing the normalization inserts the factor yx1 and gives the general formula.

F1L1step 1.1constructalgebra
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=IP (The reduced resolvent satisfies the standard projector and inverse identities on the complementary invariant subspace).

Proof

technique · direct
1.1

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 (IP)P=SA(0)P. Differentiating P(AλI)=0 and right-multiplying by S similarly gives P(IP)=PA(0)S.

L1givenalgebra
2.1

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

L1step 1.1algebra
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 y0x(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 y0x(t)=1 and the reduced resolvent S at t=0.

[L1]

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

[L2]

Proof

technique · direct
1.1

Differentiate (AλI)x=0 at t=0: (A(0)λ(0)I)x+(AλI)x=0. Apply S and use [L1]: xPx=S(A(0)λ(0)I)x. Because the fixed gauge gives y0x(0)=0, the derivative x(0) lies in kery0, so Px(0)=x(y0x(0))=0.

L1L2givenalgebra
2.1

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).

L1step 1.1algebra
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.1

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.

givenalgebra
2.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).

L1step 1.1
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(uHv)

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 Au=σv. Then the real directional derivative of σ in the direction H is

Dσ(A)[H]=Re(uHv).

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 xBx 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.1

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,Au)T=12(σu,σv)T=σw. If B(0)(x,y)T=σ(x,y)T, then Ay=σx and Ax=σy, so AAy=σ2y. Since σ is a simple positive singular value, the eigenspace of AA for σ2 is one-dimensional, and then x=σ1Ay is determined by y. Hence σ is a simple eigenvalue of the Hermitian matrix B(0).

constructalgebra
2.1

Because tB(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)=(0HH0). Applying [L1] to this Hermitian simple eigenvalue branch gives Dσ(A)[H]=wB(0)w.

L1L2step 1.1algebra
3.1

Expanding the quadratic form from step 2.1 gives Dσ(A)[H]=12(uHv+vHu)=Re(uHv).

step 2.1algebra
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.1

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

F1algebra
2.1

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.

step 1.1algebra
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)=(t00t)

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)=(t00t).

[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.1

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.

algebra
2.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.

L1step 1.1

5 · Examples, counterexamples and false statements

None yet.

Sources