Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Near-orthonormal residual data enclose all ordered Hermitian eigenvalues

Statement

Let n≥1 and let (V,Θ,δ,ρ,MA,MΘ,τ) be a residual and orthogonality certificate for a nonempty family A of Hermitian matrices in Cn×n. Sort the diagonal entries of Θ increasingly as θ(1)≤⋯≤θ(n). Then every A∈A has ordered eigenvalues λ1(A)≤⋯≤λn(A) satisfying

∣λk(A)−θ(k)∣≤ρ+(MA+MΘ)τ,1≤k≤n.

Facts & Assumptions

[F2]

A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

[F3]

Complex Hermitian eigenvalues change by at most the spectral norm of a Hermitian perturbation (Hermitian eigenvalues move by at most the spectral norm perturbation).

[F4]

Rank-nullity converts injectivity of a square endomorphism into invertibility (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[F5]

The operator norm is induced by the Euclidean norm and is unchanged by unitary factors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F6]

Cauchy–Schwarz gives ∣x∗y∣≤∥x∥2∥y∥2 in a complex inner-product space (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F7]

The induced operator norm is submultiplicative (The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2).

Proof

1.1givenF1F2F5F6algebra

Put G=V∗V. For every unit vector x, [F6] gives ∣x∗(G−I)x∣≤∥x∥2∥(G−I)x∥2≤∥G−I∥2≤δ by [F5], so all eigenvalues μ of the Hermitian G lie in [1−δ,1+δ]. Since δ<1, G is positive definite. By [F1] and [F2] it has a positive square root H; its eigenvalues are μ>0, so H is invertible.

2.1givenF1F2F4F5step 1.1algebra

Set Q=VH−1. Then Q∗Q=H−1V∗VH−1=I. Thus Q is injective and [F4] makes the square matrix Q invertible, so Q is unitary. The eigenvalues of H lie between 1−δ and 1+δ, hence ∥V−Q∥2=∥Q(H−I)∥2=∥H−I∥2≤1−1−δ≤τ. For the upper deviation, 1+δ−1≤1−1−δ because 1+δ+1−δ≤2. Unitary invariance in [F5] justifies the norm equality.

3.1givenF5F7step 2.1algebra

For each A∈A, the residual identity AQ−QΘ=A(Q−V)+(AV−VΘ)+(V−Q)Θ and certificate bounds give ∥AQ−QΘ∥2≤MAτ+ρ+τMΘ=η. By the triangle inequality and submultiplicativity [F7], each product term in the identity is bounded by its factor norms, giving the displayed estimate. Since Q is unitary, [F5] gives that Q∗AQ has the same ordered eigenvalues as A and, using [F7], ∥Q∗AQ−Θ∥2=∥Q∗(AQ−QΘ)∥2≤η.

4.1givenF3step 3.1algebra∎

Both Q∗AQ and Θ are Hermitian. Their eigenvalues are ordered increasingly in the statement of the enclosure, whereas [F3] uses decreasing order; reversing both lists sends index k to n+1−k, so the same absolute-difference bound holds at each increasing index. Applying [F3] to their difference gives ∣λk(A)−θ(k)∣≤η for every k. The family bounds are uniform, so the same intervals hold for every A∈A.

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