Alphabeta Math
Session-authored (Fable 5 assisted)
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.

34 results · all verified · 14 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 20 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Spectral Theorem, Positive Operators and Singular Value Decomposition

1 · Prerequisites

2 · Summary

The adjoint, orthonormal bases, orthogonal projections, Jordan form, and the fundamental theorem of algebra are already in place. This page adds the finite-dimensional spectral package that those prerequisites make cheap: Schur triangularisation, the complex spectral theorem for normal operators, the real block classification for normal operators, the real spectral theorem for self-adjoint operators, spectral projections, functional calculus, and the finite-dimensional Jordan-Chevalley decomposition over a perfect field.

From that point onward the route stays algebraic. The page develops non-negative operators and their unique non-negative square roots, singular values, the singular value decomposition, polar decomposition, the operator norm and Eckart-Young, then the Rayleigh quotient, Courant-Fischer, interlacing, Weyl inequalities, and Gershgorin's disks. The companion page works these statements on explicit matrices and records the common false field-free or over-strong variants.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passaudited 2026-08-28Open item page →

Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space

Definition

Let V be a finite-dimensional real or complex inner product space and let T:VV be an endomorphism. The endomorphism T is self-adjoint when

T=T,

and normal when

TT=TT,

where T is the adjoint from The adjoint T:WV is characterised by Tv,wW=v,TwV.

Every self-adjoint endomorphism is normal, because TT=T2=TT.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose

Statement

Let V be a finite-dimensional real or complex inner product space, let T:VV be linear, and let E be an orthonormal basis of V. Write

A=[T]EE.

Then:

  1. T is self-adjoint if and only if A=A.
  2. T is normal if and only if AA=AA.

Over R, A is just AT.

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V, a linear map T:VV, an orthonormal basis E, and the matrix A=[T]EE.

[L1]

In orthonormal bases, the matrix of the adjoint is the conjugate transpose (In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix).

[L2]

Matrix representation sends composition to matrix multiplication ([ST]BD=[S]CD[T]BC).

Proof

technique · direct
1.1

By the definition of self-adjointness in Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, T is self-adjoint exactly when T=T. By [L1], this is equivalent to A=[T]EE=[T]EE=A.

L1
2.1

By the definition of normality in Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, T is normal exactly when TT=TT; using [L2] and then [L1], this is equivalent to [TT]EE=A[T]EE=AA=[T]EEA=AA=[TT]EE, hence to AA=AA.

L1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular

Statement

Let V be a finite-dimensional real or complex inner product space over F, and let T:VV be linear. If the characteristic polynomial of T splits over F, then V has an orthonormal basis in which the matrix of T is upper triangular.

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V over F and a linear endomorphism T:VV whose characteristic polynomial splits over F.

[L1]

An endomorphism is triangularisable exactly when its characteristic polynomial splits (T is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).

[L2]

A basis gives an upper-triangular matrix exactly when its successive spans form a complete T-invariant flag (Complete invariant flags are equivalent to upper-triangular matrices).

[L3]

Gram-Schmidt turns a linearly independent list into an orthonormal list with the same successive spans (Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans).

Proof

technique · direct
1.1

By [L1], there is a basis (v1,,vn) of V in which [T] is upper triangular; equivalently, the flag 0span(v1)span(v1,v2)span(v1,,vn)=V is T-invariant by [L2].

L1L2
2.1

Apply [L3] to (v1,,vn) and obtain an orthonormal basis (e1,,en) such that span(e1,,ek)=span(v1,,vk) for every k, so the same successive spans are still T-invariant.

L3step 1.1
3.1

Because the orthonormal basis (e1,,en) is adapted to a complete T-invariant flag, [L2] shows that the matrix of T in that basis is upper triangular.

L2step 2.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

A normal upper-triangular matrix is diagonal

Statement

Let A=(aij)Mn(C). If A is upper triangular and normal, then A is diagonal.

Facts & Assumptions

Given: An upper-triangular matrix A=(aij)Mn(C) that is normal.

Proof

technique · direct
1.1

Because A is upper triangular, the n-th diagonal entry of AA is jnanj2=ann2, while the n-th diagonal entry of AA is inain2; [L1] makes these equal, so ain=0 for every i<n.

L1algebra
2.1

More generally, if every entry to the right of akk in row k is already zero, then the k-th diagonal entries of AA and AA are akk2 and ikaik2, so [L1] forces aik=0 for every i<k.

L1step 1.1algebra
3.1

Starting from k=n in step 1.1 and descending through k=n1,,1, step 2.1 shows that every entry above the diagonal is zero. Thus A is diagonal.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely

Statement

Let V be a finite-dimensional complex inner product space and let T:VV be linear. Then T is normal if and only if V has an orthonormal basis consisting of eigenvectors of T.

Facts & Assumptions

Given: A finite-dimensional complex inner product space V and a linear endomorphism T:VV.

[L1]

The field C is algebraically closed (The complex numbers are algebraically closed).

[L2]

If the characteristic polynomial splits, then some orthonormal basis makes the matrix upper triangular (If the characteristic polynomial of an endomorphism splits, some orthonormal basis makes its matrix upper triangular).

[L3]

A normal upper-triangular complex matrix is diagonal (A normal upper-triangular matrix is diagonal).

[L4]

In an orthonormal basis, a linear map is normal exactly when its matrix commutes with its conjugate transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).

Proof

technique · direct
1.1

Assume T is normal. By [L1], the characteristic polynomial of T splits over C, so [L2] gives an orthonormal basis in which the matrix of T is upper triangular. Because T is normal, [L4] makes that matrix normal, and then [L3] makes it diagonal. Hence the chosen orthonormal basis consists of eigenvectors of T.

L1L2L3L4
2.1

Conversely, assume (e1,,en) is an orthonormal basis of eigenvectors of T, with Tej=λjej. Then the matrix of T in that basis is the diagonal matrix diag(λ1,,λn), and every diagonal matrix commutes with its conjugate transpose. By [L4], T is normal.

L4algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks

Statement

Let V be a finite-dimensional real inner product space and let T:VV be normal. Then V has an orthonormal basis in which the matrix of T is block diagonal with blocks of the two forms

[a]and(abba) with b0,

where a,bR.

Facts & Assumptions

Given: A finite-dimensional real inner product space V and a normal endomorphism T:VV.

[L1]

In an orthonormal basis, a real operator is normal exactly when its matrix commutes with its transpose (In an orthonormal basis, self-adjoint means conjugate-transpose symmetry and normal means commuting with the conjugate transpose).

Proof

technique · direct
1.1

Choose an orthonormal basis of V and let AMn(R) be the matrix of T. By [L1], AAT=ATA. Because A has real entries, its conjugate transpose over C is still AT, so A is a normal complex matrix on Cn with the standard Hermitian inner product from [L3]. Therefore [L2] gives an orthonormal eigenbasis of Cn for A.

L1L2L3
1.2

If λR is an eigenvalue and v=u+iw is a corresponding complex eigenvector, then Au+iAw=Av=λv=λu+iλw, so Au=λu and Aw=λw; hence one of u,w is a nonzero real eigenvector, and repeating inside each real eigenspace yields orthonormal real eigenvectors for the real eigenvalues.

L4algebra
2.1

If λ=a+ib with b0 and v=u+iw is a unit eigenvector, then Av=λv because A is real; since λλ, the vectors v and v are orthogonal in the orthonormal eigenbasis from step 1.1, so writing out v,v=0 and using [L4] gives u2w2+2iu,w=0, hence u=w and u,w=0. Also A(u+iw)=(a+ib)(u+iw)=(aubw)+i(bu+aw), so Au=aubw and Aw=bu+aw; after normalising e1=u/u and e2=w/w, the matrix of A on span(e1,e2) is (abba).

L4step 1.1algebra
3.1

The orthonormal complex eigenbasis from step 1.1 splits into real eigenvectors and conjugate pairs. Step 1.2 replaces each real eigenvector by a real one, and step 2.1 replaces each conjugate pair by an orthonormal real pair spanning the same real invariant plane. Collecting these mutually orthogonal pieces yields an orthonormal real basis with the stated block-diagonal matrix.

step 1.2step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis

Statement

Let V be a finite-dimensional real inner product space and let T:VV be self-adjoint. Then V has an orthonormal basis consisting of eigenvectors of T.

Facts & Assumptions

Given: A finite-dimensional real inner product space V and a self-adjoint endomorphism T:VV.

[L2]

A real normal endomorphism admits an orthonormal block decomposition by 1×1 real blocks and 2×2 blocks (abba) (A real normal endomorphism is orthogonally block-diagonalisable with 1x1 real blocks and 2x2 rotation-scaling blocks).

Proof

technique · direct
1.1

By [L1] and [L2], there is an orthonormal basis in which the matrix of T is block diagonal with 1×1 real blocks and 2×2 blocks B=(abba).

L1L2
2.1

Because T is self-adjoint, [L3] says that the same matrix is symmetric. A block B above is symmetric exactly when b=0, so every 2×2 block collapses to the scalar block [a]. Therefore the whole matrix is diagonal.

L3step 1.1algebra
3.1

A diagonal matrix acts on each basis vector by scalar multiplication, so the orthonormal basis from step 2.1 is an orthonormal eigenbasis of T.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism

Statement

Let V be a finite-dimensional complex inner product space and let T:VV be normal. If λ1,,λr are the distinct eigenvalues of T, then there are pairwise orthogonal projections P1,,Pr such that

T=j=1rλjPj,

each Pj projects onto the eigenspace Eλj(T), and every Pj is a polynomial in T.

Facts & Assumptions

Given: A finite-dimensional complex inner product space V and a normal endomorphism T:VV with distinct eigenvalues λ1,,λr.

[L2]

Self-adjoint idempotents are exactly orthogonal projections (An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint).

[L3]

In the primary decomposition, each primary projection is a polynomial in the endomorphism (Each projection in the primary decomposition is a polynomial in the endomorphism).

Proof

technique · direct
1.1

By [L1], V has an orthonormal eigenbasis. If V=0, then there are no eigenvalues and T=0 is the empty sum. Otherwise V=Eλ1(T)Eλr(T) with the summands pairwise orthogonal; if Pj is the orthogonal projection onto Eλj(T) and v=v1++vr with vjEλj(T), then Tv=λ1v1++λrvr=j=1rλjPjv, hence T=j=1rλjPj.

L1
2.1

Because the eigenspaces are pairwise orthogonal and the Pj are the corresponding orthogonal projections, one has Pj2=Pj, Pj=Pj, and PiPj=0 for ij, so the Pj are pairwise orthogonal projections in the sense of [L2].

L2step 1.1
3.1

Since T is diagonalisable with distinct eigenvalues, its primary decomposition is exactly the direct sum of the eigenspaces Eλj(T). Therefore [L3] identifies each projection onto Eλj(T) with a polynomial in T.

L3step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The spectral functional calculus f(T) for a normal endomorphism

Definition

Let V be a finite-dimensional complex inner product space, let T:VV be normal, and write the spectral resolution from A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism as

T=j=1rλjPj,

where the λj are the distinct eigenvalues of T and Pj is the orthogonal projection onto Eλj(T). For a function f:σ(T)C on the spectrum of T, define

f(T):=j=1rf(λj)Pj.

This is the spectral functional calculus of T. For the identity function idσ(T), one has idσ(T)(T)=T.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

For normal endomorphisms, the spectral functional calculus respects sums, products, adjoints, and composition of scalar functions

Statement

Let V be a finite-dimensional complex inner product space, let T:VV be normal, and let f,g:σ(T)C.

  1. (f+g)(T)=f(T)+g(T).
  2. (fg)(T)=f(T)g(T).
  3. If f(λ)=f(λ), then f(T)=f(T).
  4. If h:f(σ(T))C, then (hf)(T)=h(f(T)).

Facts & Assumptions

Given: A finite-dimensional complex inner product space V, a normal endomorphism T:VV, its spectral resolution T=j=1rλjPj, and functions f,g:σ(T)C.

[L1]

A normal endomorphism has a spectral resolution by pairwise orthogonal projections Pj with PiPj=0 for ij and Pj2=Pj=Pj (A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism).

Proof

technique · direct
1.1

By definition f(T)=jf(λj)Pj and g(T)=jg(λj)Pj, so (f+g)(T)=j(f(λj)+g(λj))Pj=f(T)+g(T); using PiPj=0 for ij and Pj2=Pj from [L1], one also gets f(T)g(T)=jf(λj)g(λj)Pj=(fg)(T).

L1algebra
1.2

Because each Pj is self-adjoint by [L1], one has f(T)=(jf(λj)Pj)=jf(λj)Pj=f(T).

L1algebra
2.1

Put μ1,,μs for the distinct values taken by f on σ(T) and define Q:=f(λj)=μPj; then the Q are pairwise orthogonal projections, f(T)==1sμQ, and applying the same definition of functional calculus once more gives h(f(T))==1sh(μ)Q=jh(f(λj))Pj=(hf)(T).

L1step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Semisimple endomorphisms as endomorphisms diagonalisable over an algebraic closure, and nilpotent endomorphisms

Definition

Let V be a finite-dimensional vector space over a field F, and let T:VV be linear. The endomorphism T is semisimple when its minimal polynomial is separable in the sense of Repeated roots in extension fields and separable polynomials.

Equivalently, choose any basis of V, regard the matrix of T as a matrix over an algebraic closure F/F from An algebraic closure of a field, and let it act on Fn. That endomorphism is diagonalisable over F. This is basis-independent because the minimal polynomial is unchanged by field extension, and an endomorphism is diagonalisable exactly when its minimal polynomial splits with distinct roots.

The endomorphism T is nilpotent when Tm=0 for some positive integer, equivalently when it is nilpotent in the sense of Nilpotent endomorphisms and their nilpotency index.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Over a perfect field, every endomorphism has a unique commuting semisimple-plus-nilpotent decomposition, polynomial in the endomorphism

Statement

Assume the Axiom of Choice.

Let V be a finite-dimensional vector space over a perfect field F, and let T:VV be linear. Then there exist unique endomorphisms Ts,Tn:VV such that

T=Ts+Tn,TsTn=TnTs,

Ts is semisimple, Tn is nilpotent, and both Ts and Tn are polynomials in T with coefficients in F.

Facts & Assumptions

Given: Assume the Axiom of Choice. Let V be a finite-dimensional vector space over a perfect field F, and let T:VV be a linear endomorphism.

[L1]

Every algebraic extension of a perfect field is separable (Every algebraic extension of a perfect field is separable).

[L2]

If the characteristic polynomial splits, then Jordan form exists (Jordan form over the base field exists exactly when the characteristic polynomial splits).

[L3]

In a primary decomposition, each primary projection is a polynomial in the endomorphism (Each projection in the primary decomposition is a polynomial in the endomorphism).

[L4]

A finite extension is Galois exactly when it is the splitting field of a separable polynomial, and then the fixed field of its full Galois group is the base field (Equivalent characterizations of a finite Galois extension).

[L5]

An endomorphism is diagonalisable exactly when its minimal polynomial splits with distinct roots (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).

Proof

technique · direct
1.1

Choose an algebraic closure Ω/F as in An algebraic closure of a field. Let q be the product of the distinct monic irreducible factors of the characteristic polynomial of T, and let EΩ be its splitting field. By [L1], the polynomial q is separable, so [L4] makes E/F finite Galois with fixed field EGal(E/F)=F. The characteristic polynomial splits over E, and [L2] gives Jordan form for the matrix of T over E. Thus En decomposes as the direct sum of generalized eigenspaces Gλ, and (TEλI)Gλ is nilpotent.

L1L2L4
2.1

Let Pλ be the projection onto Gλ along the sum of the other generalized eigenspaces. By [L3], each Pλ is a polynomial in TE. Define SE:=λλPλ and NE:=TESE=λ(TEλI)Pλ. Then TE=SE+NE, the operators commute because they are polynomials in TE, the minimal polynomial of SE divides λ(xλ) and therefore has distinct roots, so [L5] makes SE semisimple, and NE is nilpotent because its restriction to each Gλ is (TEλI)Gλ.

L3L5step 1.1
3.1

Suppose also that TE=SE+NE with SE semisimple, NE nilpotent, and SENE=NESE. Because NE commutes with TE, every generalized eigenspace Gλ from step 1.1 is invariant under both SE and NE. On Gλ, the operator TE has only the eigenvalue λ, while NE has only the eigenvalue 0; hence the semisimple operator SEGλ has only the eigenvalue λ, so SE=λI on Gλ and therefore NE=TEλI there. Thus SE=SE and NE=NE.

step 1.1step 2.1algebra
4.1

Let σGal(E/F). Acting entrywise, σ fixes the matrix of TE and permutes the roots of its characteristic polynomial. Applying σ to the construction in step 2.1 therefore produces another commuting semisimple-plus-nilpotent decomposition of TE. Uniqueness in step 3.1 forces σ(SE)=SE and σ(NE)=NE.

step 2.1step 3.1L4
5.1

Choose an F-basis B1,,Bd of the finite-dimensional algebra F[T]. The same matrices form an E-basis of E[TE]. Write SE=iciBi with ciE. Step 4.1 and uniqueness of coordinates give σ(ci)=ci for every σGal(E/F), so [L4] gives ciF. Hence SE is the scalar extension of a polynomial Ts=p(T) with pF[x]. The same argument applies to NE, giving Tn=q(T) with qF[x]. Extending the identities of step 2.1 back down to F gives T=Ts+Tn and TsTn=TnTs; semisimplicity and nilpotence descend because their minimal-polynomial identities have coefficients in F. Uniqueness follows after extension to E from step 3.1.

step 2.1step 3.1step 4.1L4
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

Non-negative and positive operators

Definition

Let V be a finite-dimensional real or complex inner product space and let T:VV be linear. The operator T is non-negative when T is self-adjoint in the sense of Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space and

Tv,v0

for every vV.

The operator T is positive when T is self-adjoint and

Tv,v>0

for every nonzero vV.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Over the reals, non-negative and positive operators correspond exactly to positive semidefinite and positive definite symmetric forms

Statement

Let V be a finite-dimensional real inner product space. The assignment

TBT,BT(u,v):=Tu,v,

restricts to a bijection between self-adjoint endomorphisms of V and symmetric bilinear forms on V. Under this bijection, non-negative operators correspond exactly to positive semidefinite forms, and positive operators correspond exactly to positive definite forms.

Facts & Assumptions

Given: A finite-dimensional real inner product space V, a linear map T:VV, and the bilinear form BT(u,v):=Tu,v.

[L1]

Bilinear forms on V correspond bijectively to linear maps VV (Bilinear forms on V correspond linearly and bijectively to linear maps VV).

[L2]

On a finite-dimensional real inner product space, every linear functional is uniquely of the form vv,w for some w (Finite-dimensional Riesz representation: every functional is uniquely vv,w).

[L3]

A symmetric bilinear form is positive semidefinite or positive definite exactly when its quadratic values satisfy the corresponding weak or strict inequalities (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature pq of a real symmetric bilinear or quadratic form).

Proof

technique · direct
1.1

For a linear map T, the form BT(u,v)=Tu,v is bilinear. Conversely, let B be a bilinear form on V. By [L1], the assignment uB(u,) is a linear map VV. For each uV, [L2] gives a unique vector TuV such that B(u,v)=Tu,v for every vV. If a,bR and u,uV, then for every v one has T(au+bu),v=B(au+bu,v)=aB(u,v)+bB(u,v)=aTu+bTu,v, so uniqueness in [L2] gives T(au+bu)=aTu+bTu. Thus T is linear, and the correspondence TBT is bijective on all linear maps and bilinear forms. In the real case, T is self-adjoint exactly when Tu,v=u,Tv for all u,v, and symmetry of the inner product makes this exactly the condition BT(u,v)=BT(v,u). Thus self-adjoint endomorphisms correspond exactly to symmetric bilinear forms.

L1L2algebra
2.1

For every vV, one has BT(v,v)=Tv,v. Therefore the weak inequality in Non-negative and positive operators is exactly the positive-semidefinite condition in [L3], and the strict inequality on nonzero vectors is exactly the positive-definite condition in [L3].

L3algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S

Statement

Let V be a finite-dimensional real or complex inner product space and let T:VV be linear. The following are equivalent:

  1. T is non-negative.
  2. T is self-adjoint and every eigenvalue of T is a nonnegative real number.
  3. Some orthonormal basis makes the matrix of T diagonal with nonnegative real diagonal entries.
  4. There exists a linear map S:VV such that T=SS.

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V and a linear endomorphism T:VV.

[L1]

A self-adjoint operator on a finite-dimensional real inner product space has an orthonormal eigenbasis (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis).

[L2]

A normal operator on a finite-dimensional complex inner product space has an orthonormal eigenbasis (Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).

[L3]

Every nonnegative real number has a unique nonnegative square root (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

Proof

technique · direct
1.1

Assume T is non-negative. Then T is self-adjoint by Non-negative and positive operators. If V is real, [L1] gives an orthonormal eigenbasis; if V is complex, the identity T=T yields TT=TT, so [L2] gives an orthonormal eigenbasis. For any eigenvector v0 with Tv=λv, the equality Tv,v=λv2 and non-negativity give λ0, and self-adjointness makes λ real. Thus claim 1 implies claim 2.

L1L2algebra
1.2

Assume claim 3. If the diagonal entries are λ1,,λn0, then [L3] gives square roots λj0; the diagonal operator S with diagonal entries λj satisfies SS=T. Thus claim 3 implies claim 4.

L3algebra
2.1

In the orthonormal eigenbasis from step 1.1, the matrix of T is diagonal with those nonnegative real eigenvalues on the diagonal. Thus claim 2 implies claim 3.

step 1.1
3.1

Assume claim 4, so T=SS. Then for every vV one has Tv,v=SSv,v=Sv,Sv0, and for all u,v one has Tu,v=Su,Sv=u,Tv. Hence T is self-adjoint and non-negative. Thus claim 4 implies claim 1.

algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

A non-negative operator has a unique non-negative square root

Statement

Let V be a finite-dimensional real or complex inner product space and let T:VV be non-negative. Then there exists a unique non-negative operator R:VV such that

R2=T.

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V and a non-negative endomorphism T:VV.

[L2]

Every nonnegative real number has a unique nonnegative square root (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

Proof

technique · direct
1.1

By [L1], there is an orthonormal basis (e1,,en) of V and numbers λ1,,λn0 such that Tej=λjej. By [L2], each λj has a nonnegative square root. Define R by Rej=λjej. Then R2ej=λjej=Tej for every j, so R2=T; the same basis shows that R is self-adjoint with nonnegative eigenvalues, hence non-negative by [L1].

L1L2algebra
2.1

Let Q be another non-negative square root of T. Because Q2=T, each eigenspace Eλ(T) is Q-invariant. On Eλ(T) one has Q2=λI, and [L1] applied to the non-negative operator QEλ(T) shows that all its eigenvalues are nonnegative; by [L2], the only nonnegative number whose square is λ is λ, so Q=λI on Eλ(T). Thus Q acts on every basis vector ej exactly as R does, and therefore Q=R.

L1L2step 1.1
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The non-negative square root of a non-negative operator is a polynomial in the operator

Statement

Let T be a non-negative operator on a finite-dimensional real or complex inner product space. Then its unique non-negative square root is p(T) for some polynomial pR[x]C[x].

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V, a non-negative endomorphism T:VV, and the distinct eigenvalues λ1,,λr of T.

[L2]

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

Proof

technique · direct
1.1

By [L1], V has an orthonormal eigenbasis consisting of eigenvectors of T, and every eigenvalue λj is a nonnegative real number. Interpolation on the finite set {λ1,,λr} gives a polynomial pR[x] with p(λj)=λj for every j.

L1algebra
2.1

On each eigenspace Eλj(T), the operator p(T) acts as multiplication by p(λj)=λj. Therefore p(T)2 acts as multiplication by λj, so p(T)2=T; the same eigenbasis shows that p(T) is non-negative. By [L2], p(T) is the unique non-negative square root of T.

L1L2step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passaudited 2026-08-28Open item page →

The singular values of a linear map as the eigenvalues of the positive square root of T^*T

Definition

Let T:VW be a linear map between finite-dimensional real or complex inner product spaces. Because

TTv,v=Tv,Tv0

for every vV, and because (TT)=TT by Adjoints satisfy (S+T)=S+T, (λT)=λT, (ST)=TS, and T=T, the operator TT is non-negative. Let

T:=TT,

the unique non-negative square root from A non-negative operator has a unique non-negative square root. The singular values of T are the eigenvalues of T, listed with multiplicity in weakly decreasing order.

In particular, this definition applies to endomorphisms by taking W=V.

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

Singular values are well defined because the positive square root of T^*T is unique

Statement

For a linear map T:VW between finite-dimensional real or complex inner product spaces, the multiset of singular values depends only on T.

Facts & Assumptions

Given: A linear map T:VW between finite-dimensional real or complex inner product spaces.

[L1]

The singular values of T are defined as the eigenvalues of the unique non-negative square root T=TT (The singular values of a linear map as the eigenvalues of the positive square root of T^*T).

[L2]

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

Proof

technique · direct
1.1

The operator TT is determined by T, and [L2] gives it a unique non-negative square root. Therefore the operator T=TT in [L1] is determined uniquely by T.

L1L2
2.1

The singular values are the eigenvalues of that uniquely determined operator T, counted with multiplicity. Hence they depend only on T.

L1step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition

Statement

Let T:VW be a linear map between finite-dimensional real or complex inner product spaces, and let r be the number of positive singular values of T. Then there exist orthonormal bases (e1,,en) of V and (f1,,fm) of W, together with singular values

s1sr>0,

such that

Tv=j=1rsjv,ejfj

for every vV.

Facts & Assumptions

Given: A linear map T:VW between finite-dimensional real or complex inner product spaces.

[L3]

Every finite-dimensional real or complex inner product space has an orthonormal basis (Every finite-dimensional real or complex inner product space has an orthonormal basis).

Proof

technique · direct
1.1

By [L1] and [L2], the non-negative operator T on V has an orthonormal eigenbasis (e1,,en) with Tej=sjej and s1sr>0=sr+1==sn. Because T2=TT, one has TTej,ej=sj2 and therefore Tej=sj.

L1L2algebra
2.1

For each jr, define fj:=sj1Tej. Then fj=1, and for ij one has fi,fj=(sisj)1TTei,ej=(sisj)1si2ei,ej=0. For j>r, step 1.1 gives Tej=sj=0, so Tej=0.

step 1.1algebra
3.1

The orthonormal set (f1,,fr), which may be empty when r=0, extends to an orthonormal basis (f1,,fm) of W by [L3]. If v=j=1nv,ejej, then step 2.1 gives Tv=j=1nv,ejTej=j=1rsjv,ejfj, and when r=0 this is the empty sum 0.

L3step 2.1algebra
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The rank of a linear map is the number of its nonzero singular values

Statement

Let T:VW be a linear map between finite-dimensional real or complex inner product spaces. Then rankT equals the number of positive singular values of T.

Facts & Assumptions

Given: A linear map T:VW between finite-dimensional real or complex inner product spaces, and an SVD Tv=j=1rsjv,ejfj with s1sr>0=sr+1=.

[L2]

Rank-nullity holds for linear maps with finite-dimensional domain (Rank-nullity: dimFV=nullityT+rankT).

Proof

technique · direct
1.1

By [L1], one has Tv=0 exactly when v,ej=0 for 1jr, so kerT=span(er+1,,en) and therefore nullityT=nr.

L1algebra
2.1

By [L2], rankT+nullityT=n. Combining this with step 1.1 gives rankT=r, the number of positive singular values.

L2step 1.1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

An endomorphism and its adjoint have the same singular values

Statement

Let T:VV be an endomorphism of a finite-dimensional real or complex inner product space. Then T and T have the same singular values.

Facts & Assumptions

Given: An endomorphism T:VV of a finite-dimensional real or complex inner product space.

[L1]

The singular value decomposition of T has the form Tv=j=1nsjv,ejfj for orthonormal bases (ej) and (fj) and singular values sj0 (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

Proof

technique · direct
1.1

By [L1], define S:VV by Sw=j=1nsjw,fjej. For all v,wV, orthonormality gives Tv,w=jsjv,ejfj,w=v,Sw, so S=T.

L1algebra
2.1

The formula in step 1.1 is itself a singular value decomposition of T, with the same diagonal coefficients sj. Therefore T has the same singular values as T.

L1step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible

Statement

Let T:VV be an endomorphism of a finite-dimensional real or complex inner product space. Then there exist a non-negative endomorphism U and a linear isometry S:VV such that

T=SUandU=TT.

Equivalently, S is an isometry on (kerT)=imU. The factor S is unique if and only if T is invertible.

Facts & Assumptions

Given: An endomorphism T:VV of a finite-dimensional real or complex inner product space.

[L1]

There are orthonormal bases (ej) and (fj) and singular values s1sr>0=sr+1==sn such that Tej=sjfj for all j (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[L2]

A linear map that sends an orthonormal basis to an orthonormal basis is a linear isometry (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

[L3]

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

Proof

technique · direct
1.1

By [L1], define Uej:=sjej and Sej:=fj for every j. Then S is a linear isometry by [L2], SUej=sjfj=Tej for every basis vector, hence T=SU, and U2ej=sj2ej=TTej. Thus U2=TT, and because U is self-adjoint with nonnegative eigenvalues in the basis (ej), [L3] identifies U with the unique non-negative square root TT.

L1L2L3algebra
2.1

If T is invertible, then all singular values are positive, so U is invertible. Any other factorisation T=SU with the same non-negative factor U=TT satisfies S=TU1=S, so S is unique.

step 1.1algebra
3.1

If T is not invertible, then r<n. Define another isometry S by Sej=fj for jr+1 and Ser+1=fr+1. Then SS, but SUej=SUej=Tej for jr and SUej=0=Tej for j>r because sj=0. Hence SU=T, so uniqueness fails.

step 1.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||

Definition

Let T:VW be a linear map between finite-dimensional real or complex inner product spaces. If V=0, define T:=0. If V0, define the operator norm of T by

T:=max{Tv:v=1}.

The next theorem proves that this maximum exists and equals the largest singular value.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector

Statement

Let T:VW be a linear map between finite-dimensional real or complex inner product spaces.

If V=0, then

T=0.

If V0 and s1 is the largest singular value of T, then

T=s1.

In the nonzero case, the maximum in The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| is attained at a right-singular vector for s1.

Facts & Assumptions

Given: A linear map T:VW between finite-dimensional real or complex inner product spaces.

[L1]

There is a singular value decomposition Tv=j=1rsjv,ejfj with s1sr>0 (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

Proof

technique · direct
1.1

If V=0, then The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| gives T=0. Assume now that V0, and choose an SVD from [L1]: Tv=j=1rσjv,ejfj,σ1σr>0. Extend this list by zeros, setting σr+1==σn=0; then the displayed formula gives Tej=σjfj for every j, so σ1 is the largest singular value of T. Writing a unit vector as v=jcjej, one gets Tv2=j=1nσj2cj2σ12jcj2=σ12, so every unit vector satisfies Tvσ1.

L1algebra
2.1

For the right-singular vector e1, step 1.1 gives Te1=σ1f1=σ1. Therefore the maximum defining T equals the largest singular value σ1, and it is attained at e1 when V0.

L1step 1.1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2

Statement

For compatible linear maps between finite-dimensional real or complex inner product spaces,

STST.

For every such linear map T,

TT=T2.

Facts & Assumptions

Given: Compatible finite-dimensional linear maps T and S between real or complex inner product spaces.

[L1]

The operator norm is defined by the maximum over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[L3]

If Tej=sjej is a singular value decomposition, then TTej=sj2ej (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

Proof

technique · direct
1.1

For every unit vector v in the domain of T, [L1] gives STvSTvST. Taking the maximum over all unit v yields STST.

L1algebra
2.1

If s1s2 are the singular values of T, then [L3] shows that TT has eigenvalues s12,s22, and is already non-negative. Hence its singular values are s12,s22,, so [L2] gives TT=s12=T2.

L2L3algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

The best rank-at-most-k approximation in operator norm is the rank-k truncation of a singular value decomposition

Statement

Let T:VW be a linear map between finite-dimensional real or complex inner product spaces, let

Tv=j=1rsjv,ejfj

be a singular value decomposition with s1sr>0, and fix an integer k with 0k<dimV. Define

Tkv:=j=1min(k,r)sjv,ejfj.

Then rankTkk, one has

TTk=sk+1

with the convention sk+1=0 when kr, and every linear map A:VW with rankAk satisfies

TAsk+1.

Facts & Assumptions

Given: A linear map T:VW between finite-dimensional real or complex inner product spaces and the rank-k truncation Tk above.

[L3]

Rank-nullity holds for linear maps with finite-dimensional domain (Rank-nullity: dimFV=nullityT+rankT).

[L4]

A linear subspace of a finite-dimensional vector space cannot have larger dimension than the ambient space (If dimFV=n and U is a linear subspace of V, then U is finite-dimensional, dimFUn, and dimFU=n if and only if U=V).

Proof

technique · direct
1.1

The image of Tk is contained in span(f1,,fk), so rankTkk. When k=0, the defining sum for Tk is empty and Tk=0; in general (TTk)v=j>ksjv,ejfj, which is again an SVD, so [L2] gives TTk=sk+1, with value 0 when kr.

L1L2algebra
1.2

Let A:VW have rank at most k, and put E:=span(e1,,ek+1). If AE were injective, then [L3] applied to AE:EW would force dimim(AE)=k+1, but im(AE)imA and [L4] gives dimimAk, contradiction. Hence some unit vector vE satisfies Av=0.

L3L4algebra
2.1

Write that unit vector as v=j=1k+1cjej. Then Tv2=j=1k+1sj2cj2sk+12j=1k+1cj2=sk+12. Because Av=0, one has TA(TA)v=Tvsk+1. Combined with step 1.1, this proves that Tk is a best rank-at-most-k approximation in operator norm.

step 1.2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The Rayleigh quotient of a nonzero vector for a self-adjoint endomorphism

Definition

Let V be a finite-dimensional real inner product space, let T:VV be self-adjoint, and let vV be nonzero. The Rayleigh quotient of v for T is

RT(v):=Tv,vv,v.

Because v,v>0 for nonzero v in an inner product space, this quotient is a well-defined real number.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces

Statement

Let T:VV be self-adjoint on an n-dimensional real inner product space, and list its eigenvalues in weakly decreasing order:

λ1λ2λn.

Then for every 1kn,

λk=mindimW=nk+1 max0vWRT(v)=maxdimU=k min0vURT(v).

Facts & Assumptions

Given: A self-adjoint endomorphism T:VV of an n-dimensional real inner product space.

Proof

technique · direct
1.1

By [L1], choose an orthonormal eigenbasis (e1,,en) with Tej=λjej. For every nonzero v=jcjej, one has RT(v)=jλjcj2jcj2, so on Uk:=span(e1,,ek) every Rayleigh quotient is at least λk and on Wk:=span(ek,,en) every Rayleigh quotient is at most λk; equality holds at ek in both cases.

L1algebra
2.1

Let WV have dimension nk+1. If WUk={0}, then WUk=span(ek+1,,en), whose dimension is nk, contradicting [L2]. Thus some nonzero vWUk satisfies RT(v)λk by step 1.1, so max0vWRT(v)λk. Since step 1.1 also gives max0vWkRT(v)=λk, the first Courant-Fischer equality follows.

L2step 1.1
3.1

Let UV have dimension k. If UWk={0}, then UWk=span(e1,,ek1), whose dimension is k1, contradicting [L2]. Thus some nonzero vUWk satisfies RT(v)λk by step 1.1, so min0vURT(v)λk. Since step 1.1 also gives min0vUkRT(v)=λk, the second Courant-Fischer equality follows.

L2step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The smallest and largest eigenvalues of a self-adjoint endomorphism are the minimum and maximum Rayleigh quotients

Statement

If T is self-adjoint on a nonzero finite-dimensional real inner product space and its eigenvalues are ordered as

λ1λn,

then

λ1=maxv0RT(v)andλn=minv0RT(v).

Facts & Assumptions

Given: A self-adjoint endomorphism T on a nonzero finite-dimensional real inner product space.

[L1]

Courant-Fischer gives λk=mindimW=nk+1max0vWRT(v)=maxdimU=kmin0vURT(v) (Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces).

Proof

technique · direct
1.1

Taking k=1 in [L1] gives λ1=maxdimU=1min0vURT(v)=maxv0RT(v), because every one-dimensional subspace consists of the nonzero scalar multiples of any one of its nonzero vectors.

L1
2.1

Taking k=n in [L1] gives λn=mindimW=1max0vWRT(v)=minv0RT(v) for the same reason.

L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The eigenvalues of the orthogonal compression of a self-adjoint endomorphism to a hyperplane interlace those of the original endomorphism

Statement

Let T:VV be self-adjoint on an n-dimensional real inner product space, let WV be a hyperplane, and let

C:=PWTW:WW

be the orthogonal compression, where PW is the orthogonal projection onto W. If the eigenvalues of T and C are ordered by

λ1λn,μ1μn1,

then

λiμiλi+1(1in1).

Facts & Assumptions

Given: A self-adjoint endomorphism T:VV on an n-dimensional real inner product space, a hyperplane WV, and its orthogonal projection PW.

[L2]

Courant-Fischer characterises the ordered eigenvalues of a self-adjoint operator by min-max formulas (Courant-Fischer min-max principle for self-adjoint endomorphisms on finite-dimensional real inner product spaces).

Proof

technique · direct
1.1

For u,vW, the decomposition in [L1] gives PWTu,v=Tu,v=u,Tv=u,PWTv, so C is self-adjoint on W. Also RC(u)=Cu,uu,u=Tu,uu,u=RT(u) for every nonzero uW.

L1algebra
2.1

For any 1in1, Courant-Fischer in W and step 1.1 give μi=maxdimU=i, UWmin0uURC(u)=maxdimU=i, UWmin0uURT(u)λi, because the maximisation is over fewer i-dimensional subspaces than in [L2]. Likewise μi=mindimL=ni, LWmax0uLRC(u)=mindimL=ni, LWmax0uLRT(u)λi+1, because ni=(n1)i+1 is the subspace dimension appearing in Courant-Fischer for the (i+1)-st eigenvalue of T. Hence λiμiλi+1.

L2step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Weyl inequalities bound the eigenvalues of a sum of self-adjoint endomorphisms

Statement

Let A,B be self-adjoint endomorphisms of an n-dimensional real inner product space. Order the eigenvalues of A, B, and A+B by

α1αn,β1βn,γ1γn.

Then, for integers 1i,jn:

  1. If i+j1n, then γi+j1αi+βj.
  2. If i+jn1, then γi+jnαi+βj.

Facts & Assumptions

Given: Self-adjoint endomorphisms A and B of an n-dimensional real inner product space.

[L1]

Proof

technique · direct
1.1

Apply [L1] separately to A and B. There are subspaces Ui,Vj of dimensions ni+1,nj+1 such that every nonzero vector in Ui has Rayleigh quotient for A at most αi and every nonzero vector in Vj has Rayleigh quotient for B at most βj; likewise there are subspaces Ui+,Vj+ of dimensions i,j such that every nonzero vector in them has Rayleigh quotient at least αi,βj respectively.

L1
1.2

If i+j1n, then [L2] gives dim(UiVj)(ni+1)+(nj+1)n=nij+2=n(i+j1)+1. Every nonzero x in that intersection satisfies RA(x)αi and RB(x)βj, hence RA+B(x)=RA(x)+RB(x)αi+βj. Therefore γi+j1αi+βj by the min-over-subspaces form of [L1] for A+B.

L1L2algebra
2.1

If i+jn1, then [L2] gives dim(Ui+Vj+)i+jn. Every nonzero x in that intersection satisfies RA(x)αi and RB(x)βj, hence RA+B(x)=RA(x)+RB(x)αi+βj. Therefore γi+jnαi+βj by the max-over-subspaces form of [L1] for A+B.

L1L2algebra
DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-28Open item page →

The Gershgorin disks of an endomorphism with respect to an ordered basis

Definition

Let V be a finite-dimensional complex vector space, let T:VV be linear, and let B=(b1,,bn) be an ordered basis. Write

[T]BB=(aij).

For each 1in, the i-th Gershgorin disk of T with respect to B is

Di(T,B):={zC: zaiijiaij}.

The union i=1nDi(T,B) is the Gershgorin region of T in the basis B.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-28Open item page →

Every eigenvalue lies in some Gershgorin disk

Statement

Let T:VV be a linear endomorphism of a finite-dimensional complex vector space, and let B be an ordered basis of V. Every eigenvalue of T lies in at least one Gershgorin disk Di(T,B).

Facts & Assumptions

Given: A finite-dimensional complex vector space V, a linear endomorphism T:VV, an ordered basis B=(b1,,bn), and the matrix [T]BB=(aij).

[L2]

The columns of [v]B are the coordinates of v in the basis B (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

Proof

technique · direct
1.1

Let λ be an eigenvalue. By [L1], choose a nonzero eigenvector v, and write its coordinate column as [v]B=(x1,,xn)T. Choose k with xk=maxjxj>0.

L1L2choose
2.1

The k-th row of the equation [T]BB[v]B=λ[v]B is jakjxj=λxk, so (λakk)xk=jkakjxj. Taking absolute values and using the maximality of xk yields λakkxkjkakjxj(jkakj)xk. Because xk0, dividing by xk gives λakkjkakj, so λDk(T,B).

step 1.1algebra

5 · Examples, counterexamples and false statements

None yet.

Sources