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.

Ordered eigenvalues of Hermitian matrices are operator-norm Lipschitz

Statement

For Hermitian A,B∈Cn×n, write their eigenvalues in descending order with multiplicity as λ1(A)≥⋯≥λn(A) and λ1(B)≥⋯≥λn(B). Then, for every j, ∣λj(A)−λj(B)∣≤∥A−B∥2.

Facts & Assumptions

Given: Finite-dimensional Hermitian matrices A,B and the operator 2-norm.

[F2]

For real self-adjoint matrices, Weyl's sum inequalities bound each ordered eigenvalue of a sum (Weyl inequalities bound the eigenvalues of a sum of self-adjoint endomorphisms).

[F4]

The operator 2-norm is the supremum of ∥Ax∥2 over unit vectors and, for a real self-adjoint matrix, equals the largest absolute eigenvalue (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

Proof

1.1F3F4givenalgebra

Write A=R+iS with R,S real. Hermitian symmetry gives RT=R and ST=−S. Define R(A)=(R−SSR) and Φ(x+iy)=(x,y). Direct multiplication gives Φ(Az)=R(A)Φ(z) and ∥Φ(z)∥2=∥z∥2; the transpose identities show R(A) is real symmetric. Applying the same construction to A−B yields ∥R(A)−R(B)∥2=∥A−B∥2 by the supremum definition in [F4].

2.1F1step 1.1algebra

By [F1], A=Udiag⁡(λ1(A),…,λn(A))U∗ for a unitary U. Its realification is orthogonal, and the realification of the diagonal matrix has each λj(A) twice on its diagonal. Therefore the descending eigenvalues of R(A) are λ1(A),λ1(A),…,λn(A),λn(A); the same holds for B.

3.1F2F3F4step 1.1step 2.1algebra∎

Put M=R(B), N=R(A−B), and δ=∥A−B∥2. By [F3] and step 1.1, every eigenvalue of the real symmetric N lies in [−δ,δ] using [F4]. Applying [F2] with the perturbation's largest eigenvalue for the upper bound and smallest eigenvalue for the lower bound gives ∣λk(M+N)−λk(M)∣≤δ for every k. Taking k=2j−1 and using step 2.1 proves the claimed complex-Hermitian eigenvalue bound.

Depends on

Used by

Dependency tree · two levels

16 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