Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

An endomorphism is diagonalisable if and only if its characteristic polynomial splits and every eigenvalue's geometric multiplicity equals its algebraic multiplicity

Statement

Let T:V→V be an endomorphism of a finite-dimensional vector space over F. Then T is diagonalisable if and only if χT splits over F and, for every eigenvalue λ,

dim⁡Eλ(T)=mult⁡χT(λ).

The assertion includes the zero-dimensional case, where χT=1 and the multiplicity condition is vacuous.

Facts & Assumptions

Given: A finite-dimensional endomorphism T:V→V.

[L1]

The algebraic multiplicity is the exponent of x−λ in χT, and the geometric multiplicity is dim⁡Eλ(T) (Algebraic multiplicity as the exponent of x−λ in χT, and geometric multiplicity as dim⁡Eλ(T)).

[L2]

An endomorphism is diagonalisable exactly when its distinct eigenspaces have direct sum V (An endomorphism is diagonalisable exactly when V=⨁i<rEλi(T) for some finite list of distinct scalars λi).

[L3]

Eigenvectors belonging to distinct eigenvalues are linearly independent (Eigenvectors belonging to pairwise distinct eigenvalues are linearly independent).

[L4]

A split polynomial is a product of linear factors, with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L5]

In any ordered basis, χT is the characteristic polynomial of the representing matrix, independently of the chosen basis (The basis-independent characteristic polynomial χT of an endomorphism of a finite-dimensional space, including χT=1 in dimension zero).

[L6]
[L7]

For n≥1, the determinant of a triangular matrix in Mn(R) over a commutative ring is the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).

[L8]

For an endomorphism of a finite-dimensional space, σF(T)={λ∈F:χT(λ)=0} (For every finite-dimensional space, σF(T) is exactly the set of roots in F of χT).

Proof

technique · direct
1.1L1L2L4L5L7choose

Suppose T is diagonalisable and dim⁡V≥1, and choose an eigenbasis. Its matrix is diagonal, so xI−[T] is triangular of positive size and [L5] and [L7] show that χT is the product of x−λ over the diagonal entries. For each λ, the basis vectors carrying that diagonal entry form a basis of Eλ(T); hence their number is both multiplicities in [L1].

1.2L1L4L6L8algebra

Conversely, suppose χT splits and the multiplicities agree. By [L8] the roots of χT in F are exactly the eigenvalues of T, so by [L4] the sum of the algebraic multiplicities of the eigenvalues is the degree of χT, and [L6] identifies that degree with dim⁡V. Hence the sum of the dimensions of the distinct eigenspaces is dim⁡V.

2.1step 1.2L2L3choose

Choose a basis of each eigenspace. By [L3] their concatenation is independent, and step 1.2 says it has dim⁡V vectors, so it is a basis. Therefore [L2] makes T diagonalisable.

3.1step 1.1step 2.1L2L4L6∎

Steps 1.1 and 2.1 prove the equivalence when dim⁡V≥1. If dim⁡V=0, the empty basis is an eigenbasis, so T is diagonalisable by [L2]; [L6] gives χT=1, which splits as an empty product by [L4]; and T has no eigenvalue, so the multiplicity condition holds vacuously. Both sides therefore hold, which proves the equivalence in every finite dimension.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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