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.

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

Diagonalisation and the Minimal Polynomial

1 · Prerequisites

2 · Summary

An endomorphism of a finite-dimensional vector space has eigenvalues, eigenspaces and a characteristic polynomial whose root set is its spectrum, together with algebraic and geometric multiplicities, the geometric one never the larger; eigenvectors for distinct eigenvalues are linearly independent, polynomials may be evaluated at an endomorphism, and the published Cayley–Hamilton theorem shows the characteristic polynomial annihilates it. Over a field, F[x] is a principal ideal domain and a unique factorisation domain carrying Bézout's identity and monic greatest common divisors. A polynomial splits when it is a product of linear factors, the quotient by an irreducible adjoins a root, and the evaluation kernel of an algebraic element is generated by its minimal polynomial.

The page defines diagonalisability and the annihilator ideal of an endomorphism, proves that ideal is nonzero and principal, and normalises its generator to the minimal polynomial; representation and similarity invariance, invariance under field extension, μTχT, the description of the roots of μT over an extension field as eigenvalues, and equality of the irreducible factor sets of μT and χT follow. Invariance of polynomial kernels and images supports the coprime-kernel lemma, primary decomposition, primary projections as polynomials in the endomorphism, and the generalised-eigenspace decomposition when μT splits. From these come the eigenspace direct-sum criterion, the split-characteristic-polynomial and squarefree-minimal-polynomial criteria for diagonalisability, the consequences for idempotents and invariant restrictions, and the simultaneous diagonalisation of a pairwise commuting family of diagonalisable endomorphisms.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation

Definition

Let T:VV be an endomorphism of a finite-dimensional vector space over a field F. The endomorphism T is diagonalisable over F if V has a basis consisting of eigenvectors of T (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker(TλI), and the spectrum σF(T) of an endomorphism, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

Equivalently, T is diagonalisable if some ordered basis B makes its matrix [T]BB diagonal (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases). The unique endomorphism of the zero space is diagonalisable: its empty ordered basis is a basis of eigenvectors and its 0×0 matrix is diagonal.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The annihilator set Ann(T)={pF[x]:p(T)=0}; once existence is proved, its unique monic generator μT is the minimal polynomial

Definition

Let T:VV be an endomorphism of a finite-dimensional vector space over F. Its annihilator set is

Ann(T):={pF[x]:p(T)=0},

where polynomial evaluation at T is that of Polynomial evaluation at an endomorphism: p(T)=kakTk.

Once The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp proves that this set is a nonzero principal ideal, the minimal polynomial of T, denoted μT, is its unique monic generator (The ideal generated by a subset and principal ideals, Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree). Thus existence is not built into the definition. On the zero space, IV=0, so 1Ann(T) and μT=1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp

Statement

For every endomorphism T of a finite-dimensional F-vector space, Ann(T) is a nonzero ideal of F[x] and has a unique monic generator μT. For every pF[x],

p(T)=0μTp.

For the zero space, μT=1.

Facts & Assumptions

Given: An endomorphism T:VV of a finite-dimensional vector space over a field F, and the annihilator set of The annihilator set Ann(T)={pF[x]:p(T)=0}; once existence is proved, its unique monic generator μT is the minimal polynomial.

[L1]

For every field F, every ideal of F[x] is principal (For every field F, F[x] is a principal ideal domain).

[L2]

Cayley–Hamilton states χT(T)=0 for every finite-dimensional endomorphism T (Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, χT(T)=0).

[L4]

Every nonzero polynomial has a leading coefficient and is monic exactly when that coefficient is 1 (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).

Proof

technique · direct
1.1

The zero polynomial lies in Ann(T). If p(T)=q(T)=0, then (pq)(T)=0; and if hF[x] and p(T)=0, distributivity of the finite polynomial sums and associativity of composition give (hp)(T)=h(T)p(T)=0. Hence Ann(T) is an ideal.

givenalgebra
1.2

By [L2], χTAnn(T). Fix an ordered basis B of the n-dimensional V; by [L3], χT=χ[T]BB with [T]BBMn(F), so χT is monic of degree n and in particular nonzero. Thus the ideal is nonzero, including when V=0, where χT=1.

L2L3
1.3

If u and v are monic generators of this nonzero ideal, then u=av and v=bu for some polynomials a,b. Degrees force a,b to be nonzero constants, and monicity forces both constants to be 1; hence u=v.

L4algebra
2.1

By [L1], write Ann(T)=(g) with g0. Multiplying g by the inverse of its leading coefficient gives a monic generator μT by [L4], and step 1.3 shows that this monic generator is unique.

step 1.2step 1.3L1L4choose
3.1

Finally, p(T)=0 means pAnn(T)=(μT), which is equivalent to p=μTq for some qF[x], that is, μTp. When V=0, step 1.2 gives (1)=F[x], so its monic generator is 1.

step 1.2step 2.1given
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The minimal polynomial is unchanged by choosing a matrix representation or replacing a matrix by a similar one

Statement

Let T:VV be an endomorphism of a finite-dimensional vector space and let A=[T]BB in an ordered basis B. Then T and A have the same minimal polynomial. More generally, similar square matrices have the same minimal polynomial.

Facts & Assumptions

Given: An endomorphism T, an ordered basis B, its matrix A=[T]BB, and square matrices A,B with B=P1AP.

[L1]

The matrix of a composite is the product of the matrices in compatible ordered bases ([ST]BD=[S]CD[T]BC).

[L2]

Similar matrices are exactly matrix representations of one endomorphism in different ordered bases (Similarity is an equivalence relation, and two matrices represent the same endomorphism in two bases exactly when they are similar).

[L3]

The minimal polynomial is the unique monic generator of the annihilator ideal (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp).

[L4]

The matrix of a linear map has as its columns the coordinate columns of the images of the domain basis vectors (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

Proof

technique · direct
1.1

By induction on k, [L1] gives [Tk]BB=Ak for every k0; taking the same finite linear combination on both sides yields [p(T)]BB=p(A) for every pF[x].

L1L4algebra
2.1

A linear map is zero exactly when its matrix in a basis is zero, so step 1.1 and [L4] give p(T)=0 if and only if p(A)=0. The annihilator ideals coincide, hence their unique monic generators coincide by [L3].

step 1.1L3L4
3.1

If B=P1AP, induction gives Bk=P1AkP, and therefore p(B)=P1p(A)P. Thus p(B)=0 exactly when p(A)=0, so [L3] again gives μB=μA. This also follows from [L2].

L2L3algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

For a matrix over a field, extending the scalar field does not change its minimal polynomial

Statement

Let K/F be a field extension and let AMn(F). Whether A is viewed over F or over K, its minimal polynomial is the same element of F[x]K[x]. This includes n=0, when both minimal polynomials are 1.

Facts & Assumptions

Given: A field extension K/F and a matrix AMn(F).

[L3]

The minimal polynomial is the least-degree monic annihilator, equivalently the unique monic generator of all annihilating polynomials (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp).

Proof

technique · direct
1.1

Every polynomial over F that annihilates A still annihilates it over K. Hence the K-minimal polynomial divides the F-minimal polynomial and has no larger degree.

L1L3
1.2

Conversely, let q=i=0rcixiK[x] be a nonzero annihilator of A. Choose a maximal F-linearly independent sublist d1,,ds from the finite list of nonzero coefficients ci; maximality makes it span all the ci. Write ci=jaijdj with aijF.

L1L2choose
2.1

The equality 0=q(A)=jdj(iaijAi) holds entrywise. Since every entry of each inner matrix lies in F and the dj are F-independent, every matrix iaijAi is zero. At least one corresponding polynomial qj=iaijxi is nonzero and has degree at most r.

step 1.2L2algebra
3.1

Applying step 2.1 to the K-minimal polynomial gives a nonzero F-annihilator of no larger degree. Thus the two minimal polynomials have equal degree; step 1.1 and monicity then force equality. For n=0, [L3] gives 1 over either field.

step 1.1step 2.1L3
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The minimal polynomial divides the characteristic polynomial, μTχT

Statement

For every endomorphism T of a finite-dimensional vector space,

μTχT.

Facts & Assumptions

Given: A finite-dimensional endomorphism T with minimal polynomial μT and characteristic polynomial χT (The basis-independent characteristic polynomial χT of an endomorphism of a finite-dimensional space, including χT=1 in dimension zero).

[L2]

A polynomial annihilates T if and only if it is divisible by μT (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp).

Proof

technique · direct
1.1

By [L1], χT annihilates T.

L1
2.1

Therefore [L2] gives μTχT. In dimension zero both polynomials are 1, and the same argument applies.

step 1.1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Over every extension field, a scalar is an eigenvalue of the extended matrix exactly when it is a root of the minimal polynomial

Statement

Let AMn(F), let K/F be a field extension, and let λK. Then λ is an eigenvalue of the matrix A acting on Kn if and only if

μA(λ)=0,

where μAF[x] is the minimal polynomial over F. For n=0, both sets are empty.

Facts & Assumptions

Given: A field extension K/F, a matrix AMn(F), and λK.

[L1]

Extending the scalar field does not change the minimal polynomial of A (For a matrix over a field, extending the scalar field does not change its minimal polynomial).

[L2]

The minimal polynomial divides the characteristic polynomial (The minimal polynomial divides the characteristic polynomial, μTχT).

[L3]

Over any field, a scalar is an eigenvalue exactly when it is a root of the characteristic polynomial (For every finite-dimensional space, σF(T) is exactly the set of roots in F of χT).

[L4]

Polynomial evaluation is p(A)=akAk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

Proof

technique · direct
1.1

Suppose Av=λv for some nonzero vKn. Induction gives Akv=λkv, so [L4] gives p(A)v=p(λ)v for every pK[x]. Taking p=μA and using [L1] yields 0=μA(A)v=μA(λ)v, hence μA(λ)=0.

L1L4algebra
1.2

Conversely, if μA(λ)=0, then [L2] gives χA(λ)=0. The determinant formula for xIA is unchanged after embedding F in K, so [L3] applied over K says λ is an eigenvalue of A on Kn.

L2L3
2.1

When n=0, μA=1 by [L1], so it has no roots, while the zero space has no nonzero eigenvector.

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

The minimal and characteristic polynomials have exactly the same monic irreducible factors

Statement

Let T be an endomorphism of a finite-dimensional vector space over F. A monic irreducible polynomial in F[x] divides μT if and only if it divides χT. Thus μT and χT have exactly the same monic irreducible factors, though generally with different exponents.

Facts & Assumptions

Given: A finite-dimensional endomorphism T and a monic irreducible polynomial qF[x].

[L1]

The minimal polynomial divides the characteristic polynomial (The minimal polynomial divides the characteristic polynomial, μTχT).

[L2]

For monic irreducible q, the quotient K=F[x]/(q) is a field extension containing a=x+(q) with q(a)=0 (F[x]/(p) for monic irreducible p is a field extension containing the root x+(p) with unique reduced representatives).

[L3]

Extending scalars from F to K leaves the minimal polynomial unchanged (For a matrix over a field, extending the scalar field does not change its minimal polynomial).

[L4]

A scalar is an eigenvalue exactly when it is a root of the characteristic polynomial (For every finite-dimensional space, σF(T) is exactly the set of roots in F of χT).

[L5]

If a is algebraic over F, the kernel of evaluation at a is generated by its unique monic irreducible minimal polynomial, and f(a)=0 exactly when that polynomial divides f (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[L6]

Polynomial evaluation at an endomorphism is p(T)=k0akTk for p(x)=k0akxk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

[L7]

An endomorphism and its matrix in any ordered basis have the same minimal polynomial; in particular, this polynomial is invariant under changing the basis (The minimal polynomial is unchanged by choosing a matrix representation or replacing a matrix by a similar one).

[L8]

In any ordered basis, the characteristic polynomial of an endomorphism is the characteristic polynomial of its 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).

Proof

technique · direct
1.1

If qμT, then [L1] immediately gives qχT.

L1
1.2

Conversely suppose qχT. Choose an ordered basis of V, let A be the matrix of T, and form K and a as in [L2]. Since q(a)=0, also χT(a)=0; by [L8] this is the characteristic polynomial of A, whose determinant formula is unchanged after scalar extension. Thus [L4] applied to the resulting endomorphism of Kn gives a nonzero K-eigenvector with eigenvalue a.

L2L4L8choose
2.1

By [L7], A has minimal polynomial μT, and [L3] says its scalar extension has the same minimal polynomial. Applying [L6] to the eigenvector from step 1.2 gives μT(a)=0.

step 1.2L3L6L7
3.1

The monic irreducible minimal polynomial of a divides q because q(a)=0, and it is nonconstant; irreducibility of q makes it equal to q. Now [L5] and step 2.1 give qμT.

step 2.1L2L5
4.1

Steps 1.1 and 3.1 prove both directions. In the zero-dimensional case μT=χT=1, so neither has an irreducible factor.

step 1.1step 3.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

For every polynomial p, both kerp(T) and imp(T) are T-invariant

Statement

Let T:VV be an endomorphism and pF[x]. Both kerp(T) and imp(T) are invariant under T.

Facts & Assumptions

Given: An endomorphism T and a polynomial pF[x].

[L1]

Polynomial evaluation is p(T)=akTk, with T0=I and Tk+1=TTk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

Proof

technique · direct
1.1

By [L1] and associativity of composition, Tp(T)=p(T)T.

L1algebra
2.1

If vkerp(T), then p(T)(Tv)=T(p(T)v)=0, so Tvkerp(T).

step 1.1
3.1

If vimp(T), write v=p(T)u; then Tv=p(T)(Tu) by step 1.1, so Tvimp(T).

step 1.1
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

The minimal polynomial of a restriction to an invariant subspace divides the original minimal polynomial

Statement

Let W be a T-invariant subspace of a finite-dimensional vector space. Then the restriction TW:WW satisfies

μTWμT.

Facts & Assumptions

Given: A finite-dimensional endomorphism T:VV and a T-invariant subspace WV.

[L1]

A polynomial annihilates an endomorphism exactly when it is divisible by that endomorphism's minimal polynomial (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp).

Proof

technique · direct
1.1

Invariance makes TW an endomorphism of W, and for every polynomial p one has p(TW)=p(T)W by induction on powers.

givenalgebra
2.1

Since μT(T)=0, step 1.1 gives μT(TW)=0. Applying [L1] to TW yields μTWμT. This includes W=0, where μTW=1.

step 1.1L1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

If gcd(f,g)=1 and (fg)(T)=0, then V=kerf(T)kerg(T)

Statement

Let T:VV be an endomorphism and let f,gF[x] satisfy gcd(f,g)=1 and (fg)(T)=0. Then

V=kerf(T)kerg(T).

Facts & Assumptions

Given: An endomorphism T and coprime polynomials f,g with (fg)(T)=0.

[L1]

If gcd(f,g)=1, Bézout's identity supplies a,bF[x] with af+bg=1 (Bézout identity and the Euclidean algorithm for polynomials over a field, The monic greatest common divisor of two polynomials over a field).

[L3]

Polynomial evaluation sends p(x)=akxk to p(T)=akTk, with T0=I (Polynomial evaluation at an endomorphism: p(T)=kakTk).

Proof

technique · direct
1.1

Choose a,b as in [L1]. Evaluating the identity gives a(T)f(T)+b(T)g(T)=I.

L1L3choose
2.1

For vV, write v=a(T)f(T)v+b(T)g(T)v. The first summand lies in kerg(T) and the second in kerf(T) because polynomial evaluations commute and (fg)(T)=0. Thus the two kernels span V.

step 1.1L3givenalgebra
3.1

If v lies in both kernels, step 1.1 gives v=a(T)f(T)v+b(T)g(T)v=0. Hence their intersection is zero, and [L2] proves the direct sum. Unit factors and the zero space satisfy the same calculation.

step 1.1L2
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-16Open item page →

Primary components kerq(T)e and generalised eigenspaces Gλ(e)(T)=ker(TλI)e

Definition

Let T:VV be an endomorphism. For an irreducible polynomial qF[x] and an integer e1, the subspace

Vq,e(T):=ker(q(T)e)=ker((qe)(T))

is the qe-primary component of T when qe is the corresponding factor of μT.

Here q(T) uses polynomial evaluation at an endomorphism (Polynomial evaluation at an endomorphism: p(T)=kakTk).

For λF, the generalised eigenspace of exponent e is

Gλ(e)(T):=ker(TλI)e.

Its first term is the ordinary eigenspace Gλ(1)(T)=Eλ(T) (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker(TλI), and the spectrum σF(T) of an endomorphism). These kernels are T-invariant by For every polynomial p, both kerp(T) and imp(T) are T-invariant.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels

Statement

Let T:VV be an endomorphism of a finite-dimensional vector space over F, and factor its minimal polynomial in the UFD F[x] as

μT=i<rqiei,

where the qi are distinct monic irreducibles and ei1. Then the subspaces Vi:=kerqi(T)ei are T-invariant and

V=i<rVi.

Moreover, the minimal polynomial of TVi is exactly qiei. If V=0, then r=0 and this is the empty direct sum.

Facts & Assumptions

Given: A finite-dimensional endomorphism T and the displayed irreducible factorisation of μT.

[L1]

Every polynomial ring over a field is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

[L2]

If coprime f,g satisfy (fg)(T)=0, then V=kerf(T)kerg(T) (If gcd(f,g)=1 and (fg)(T)=0, then V=kerf(T)kerg(T)).

[L3]

A polynomial annihilates an endomorphism exactly when it is divisible by its minimal polynomial (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp).

Proof

technique · direct
1.1

By [L1], the distinct powers fi=qiei are pairwise coprime. Since (ifi)(T)=μT(T)=0, repeated application of [L2] gives V=i<rkerfi(T).

L1L2L3
2.1

Each summand is T-invariant because T commutes with fi(T). The restriction Ti=TVi is annihilated by fi, so [L3] gives μTifi.

step 1.1L3algebra
3.1

Suppose for some i that μTi is a proper divisor of fi. Put h=μTijifj. On Vi, the first factor annihilates; on Vj with ji, the factor fj annihilates. Step 1.1 therefore gives h(T)=0.

step 1.1step 2.1algebra
4.1

The polynomial h has smaller degree than μT and so cannot be divisible by μT, contradicting [L3]. Hence μTi=fi by monicity. If r=0, then μT=1, [L3] gives IV=0, and V=0, which is precisely the empty direct sum.

step 3.1L3
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Each projection in the primary decomposition is a polynomial in the endomorphism

Statement

In the primary decomposition V=i<rVi associated with μT=i<rfi, the projection Ei:VVi along the other primary components is a polynomial in T. More precisely, if gi=μT/fi and aifi+bigi=1, then

Ei=bi(T)gi(T).

Facts & Assumptions

Given: The primary decomposition and the polynomials fi,gi in the Statement.

[L1]

The irreducible-power factors of μT give the direct sum V=ikerfi(T) (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

[L2]

Coprime polynomials satisfy a Bézout identity (Bézout identity and the Euclidean algorithm for polynomials over a field).

[L3]

Polynomial evaluation sends p(x)=akxk to the endomorphism p(T)=akTk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

Proof

technique · direct
1.1

The polynomials fi and gi are coprime, so choose ai,bi with aifi+bigi=1 by [L2], and set Ei=bi(T)gi(T) using [L3].

L2L3chooseconstruct
2.1

On Vi=kerfi(T) the evaluated Bézout identity gives Ei=I. On Vj for ji, the polynomial gi is divisible by fj, so Ei=0.

step 1.1L1algebra
3.1

By the unique decomposition in [L1], the operator described in step 2.1 is exactly projection onto Vi along the sum of the other components.

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

If the minimal polynomial splits, V is the direct sum of the stabilised generalised eigenspaces

Statement

Let T:VV be an endomorphism of a finite-dimensional vector space over an arbitrary field F; finite-dimensionality is what makes μT available at all, the minimal polynomial being defined only in that case. Suppose its minimal polynomial splits over F as

μT=i<r(xλi)ei,

with distinct λiF and ei1. Then

V=i<rGλi(ei)(T).

For every kei, ker(TλiI)k=Gλi(ei)(T), so these are the stabilised generalised eigenspaces. The zero space corresponds to the empty product and empty direct sum.

Facts & Assumptions

Given: The displayed split factorisation of μT over F.

[L1]

A nonzero polynomial splits over F when it is a product of linear factors in F[x], with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L2]

For an endomorphism of a finite-dimensional space, the irreducible-power factors of its minimal polynomial give a direct sum of their invariant kernels, and each restriction has exactly the corresponding factor as minimal polynomial (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

[L3]

Coprime polynomials satisfy a Bézout identity (Bézout identity and the Euclidean algorithm for polynomials over a field).

[L4]

The generalised eigenspace of exponent e is Gλ(e)(T)=ker(TλI)e (Primary components kerq(T)e and generalised eigenspaces Gλ(e)(T)=ker(TλI)e).

Proof

technique · direct
1.1

By [L1], the irreducible factors are the distinct linear polynomials xλi. Applying [L2] gives the displayed direct sum, and [L4] identifies its i-th summand with Gλi(ei)(T).

L1L2L4
2.1

Fix i and kei. The kernel of (TλiI)k contains the i-th summand. On every other primary summand, (xλi)k is coprime to (xλj)ej; evaluating a Bézout identity from [L3] shows (TλiI)k is invertible there. Hence its kernel contains no vector from the other summands.

step 1.1L2L3
3.1

Thus the kernel at every kei is exactly Gλi(ei)(T). If the factorisation is empty, [L2] gives V=0.

step 2.1L2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

An endomorphism is diagonalisable exactly when V=i<rEλi(T) for some finite list of distinct scalars λi

Statement

An endomorphism T:VV of a finite-dimensional F-vector space is diagonalisable if and only if there are distinct scalars λ0,,λr1F such that

V=i<rEλi(T).

For V=0, take the empty list of scalars.

Facts & Assumptions

Given: A finite-dimensional endomorphism T:VV.

[L3]

V=i<nUi means i<nUi=V together with UjijUi={0V} for every j<n (Internal direct sum V=i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

Proof

technique · direct
1.1

Suppose T is diagonalisable and fix an eigenbasis. Only finitely many eigenvalues occur among its finitely many vectors; group the basis vectors by those distinct eigenvalues. If vEλ(T) is expanded in the eigenbasis, comparing the coefficients in Tv=λv forces every coefficient at a basis vector with eigenvalue different from λ to vanish. Thus the group carrying λ is a basis of Eλ(T). The groups exhaust the eigenbasis, so the eigenspaces sum to V; and a nonzero vEλ(T) lying in the sum of the other eigenspaces would have one eigenbasis expansion supported on the λ-group and another supported off it, contradicting uniqueness of coordinates in a basis. Both conditions of [L3] therefore hold.

L1L2L3algebra
1.2

Conversely, suppose the displayed direct sum holds. Choose a basis of each eigenspace using [L4] and concatenate the finite lists. The first condition of [L3] makes the concatenation spanning. It is independent: in a vanishing combination, group the terms by eigenspace, so each group sums to a vector of its Eλ(T) and one such vector equals minus the sum of the others; the second condition of [L3] forces every group to sum to 0V, and independence inside each chosen basis then kills every coefficient. So it is a basis of eigenvectors and [L1] makes T diagonalisable.

L1L2L3L4choose
2.1

The two constructions prove both implications. When V=0, the empty basis and empty direct sum satisfy them.

step 1.1step 1.2
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

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:VV 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 λ,

dimEλ(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:VV.

[L1]

The algebraic multiplicity is the exponent of xλ in χT, and the geometric multiplicity is dimEλ(T) (Algebraic multiplicity as the exponent of xλ in χT, and geometric multiplicity as dimEλ(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 n1, 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.1

Suppose T is diagonalisable and dimV1, 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].

L1L2L4L5L7choose
1.2

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 dimV. Hence the sum of the dimensions of the distinct eigenspaces is dimV.

L1L4L6L8algebra
2.1

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

step 1.2L2L3choose
3.1

Steps 1.1 and 2.1 prove the equivalence when dimV1. If dimV=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.

step 1.1step 2.1L2L4L6
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors

Statement

An endomorphism T of a finite-dimensional vector space over F is diagonalisable if and only if

μT=i<r(xλi)

for a finite list of distinct scalars λiF. For the zero space this is the empty product μT=1.

Facts & Assumptions

Given: A finite-dimensional endomorphism T:VV.

[L1]
[L2]

If p(x)=k0akxk, then p(T)=k0akTk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

[L3]

For a polynomial over a field, p(λ)=0 exactly when xλ divides p (Factor theorem over a commutative ring).

[L4]

Irreducible-power factors of μT give the primary direct-sum decomposition (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

Proof

technique · direct
1.1

Suppose T is diagonalisable, and let λ0,,λr1 be its distinct eigenvalues. On an eigenbasis the polynomial p=i(xλi) vanishes entrywise, so p(T)=0 and [L1] gives μTp.

L5L1algebra
1.2

Conversely, suppose μT is the displayed product of distinct linear factors. In [L4] every exponent is one, so its primary summands are ker(TλiI)=Eλi(T). Thus V is their direct sum, and [L5] makes T diagonalisable.

L4L5
2.1

For each i, choose a nonzero eigenvector vi for λi. Formula [L2] and induction give μT(T)vi=μT(λi)vi; the left side is zero by [L1], so μT(λi)=0. By [L3], every distinct factor xλi of p divides μT. Together with step 1.1 and monicity, this gives μT=p.

step 1.1L1L2L3choosealgebra
3.1

Steps 2.1 and 1.2 prove both directions. When V=0, the empty basis gives μT=1 by [L1].

step 2.1step 1.2L1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A characteristic polynomial that splits into distinct linear factors forces diagonalisability

Statement

If the characteristic polynomial of a finite-dimensional endomorphism splits over F into distinct linear factors, then the endomorphism is diagonalisable over F.

Facts & Assumptions

Given: An endomorphism T whose characteristic polynomial is a product of distinct linear factors over F.

[L1]

The minimal polynomial divides the characteristic polynomial (The minimal polynomial divides the characteristic polynomial, μTχT).

[L2]

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

[L3]

Splitting means factorisation into linear factors over the stated field, with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L4]

The polynomial ring over a field is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

Proof

technique · direct
1.1

By [L1], μT is a monic divisor of the split squarefree polynomial χT. Unique factorisation from [L4] and the meaning of splitting in [L3] therefore make μT a product of a subset of the same distinct linear factors.

L1L3L4algebra
2.1

Apply [L2] to step 1.1. The zero-dimensional case has χT=μT=1 and is included.

step 1.1L2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Every idempotent endomorphism is diagonalisable and is projection onto its image along its kernel

Statement

If an endomorphism T:VV of a finite-dimensional vector space satisfies T2=T, then it is diagonalisable and

V=imTkerT.

Under this decomposition, T is projection onto imT along kerT.

Facts & Assumptions

Given: An idempotent endomorphism T, so T2=T.

[L1]

For an endomorphism of a finite-dimensional space, a polynomial annihilates T exactly when it is divisible by μT (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μTp).

[L2]

For an endomorphism of a finite-dimensional space, having a product of distinct linear factors as minimal polynomial is equivalent to diagonalisability (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).

[L4]

The polynomial ring over a field is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

Proof

technique · direct
1.1

The identity T2T=0 says x(x1) annihilates T, so [L1] gives μTx(x1). By unique factorisation [L4], this monic divisor is a product of a subset of the two distinct irreducibles x and x1; [L2] therefore makes T diagonalisable.

L1L2L4algebra
1.2

Every vV has v=Tv+(vTv), where TvimT and T(vTv)=TvT2v=0. Hence the image and kernel span V.

givenalgebra
2.1

If wimTkerT, write w=Tu and compute w=Tu=T2u=Tw=0. Thus [L3] and step 1.2 give the direct sum, and T is identity on its image and zero on its kernel. The cases T=0 and T=I are included.

step 1.2L3algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable

Statement

If T:VV is diagonalisable and WV is T-invariant, then the restriction TW is diagonalisable.

Facts & Assumptions

Given: A diagonalisable endomorphism T and a T-invariant subspace W.

[L2]

Diagonalisability is equivalent to the minimal polynomial being a product of distinct linear factors (An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors).

[L3]

A polynomial splits over F when it factors into linear factors over F (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L4]

The polynomial ring over a field is a unique factorisation domain (For every field F, F[x] is a unique factorisation domain).

Proof

technique · direct
1.1

By [L2], μT is split and squarefree. By [L1], μTW is a monic divisor of it, so unique factorisation [L4] and the meaning of splitting in [L3] make the restriction polynomial split and squarefree as well.

L1L2L3L4algebra
2.1

Apply the reverse implication of [L2] to TW. This includes W=0, whose minimal polynomial is 1.

step 1.1L2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Simultaneous diagonalisability: one basis that diagonalises every endomorphism in a family

Definition

A family T of endomorphisms of a finite-dimensional vector space V is simultaneously diagonalisable if there is one ordered basis of V in which the matrix of every TT is diagonal. Equivalently, V has a basis consisting of vectors that are eigenvectors for every member of T, matching the one-operator definition in A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation.

The empty family is simultaneously diagonalisable in every finite-dimensional space: any ordered basis works. On the zero space the empty ordered basis works for every family.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

Commuting endomorphisms preserve each other's eigenspaces

Statement

If endomorphisms S,T:VV commute, then S(Eλ(T))Eλ(T) for every scalar λ.

Facts & Assumptions

Given: Endomorphisms S,T with ST=TS, a scalar λ, and vEλ(T).

[L1]

Proof

technique · direct
1.1

Since Tv=λv, commutation gives T(Sv)=S(Tv)=S(λv)=λSv.

givenalgebra
2.1

Therefore SvEλ(T) by [L1], whether or not Sv is zero.

step 1.1L1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise

Statement

Let T be a family of diagonalisable endomorphisms of a finite-dimensional vector space. Then T is simultaneously diagonalisable if and only if its members commute pairwise.

Facts & Assumptions

Given: A family T of diagonalisable endomorphisms of a finite-dimensional space V.

[L1]

Commuting endomorphisms preserve each other's eigenspaces (Commuting endomorphisms preserve each other's eigenspaces).

[L2]

The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable (The restriction of a diagonalisable endomorphism to an invariant subspace is diagonalisable).

[L4]

span(S) is the intersection of all subspaces containing S, hence the smallest such subspace (Linear combination of a finite list, and the span span(S) as the smallest linear subspace containing S); and span(S)=L(S), the set of finite linear combinations of elements of S (span(S) is exactly the set of linear combinations of finite lists of elements of S, and span()={0V}).

[L5]

A diagonalisable endomorphism's distinct eigenspaces have direct sum equal to the whole space (An endomorphism is diagonalisable exactly when V=i<rEλi(T) for some finite list of distinct scalars λi).

[L6]

Simultaneous diagonalisability means that one basis diagonalises every member of the family (Simultaneous diagonalisability: one basis that diagonalises every endomorphism in a family).

Proof

technique · direct
1.1

First suppose T is finite and pairwise commuting. Induct on its size. For the empty family any basis works. For a nonempty family, choose one member T. Its eigenspaces have direct sum V by [L5]; by [L1] every remaining member preserves each eigenspace, and by [L2] every restriction is diagonalisable. Applying the induction hypothesis within each eigenspace and concatenating the resulting bases gives one common eigenbasis.

L1L2L5choose
1.2

For an arbitrary pairwise commuting family, [L3] makes U=span(T) finite-dimensional. Choose a finite basis of U; by [L4], each basis vector is a finite linear combination of members of T. The union of the finitely many supports is a finite subfamily T0 spanning U.

L3L4choose
1.3

Conversely, if one basis diagonalises every member of T as in [L6], then every pair is represented by diagonal matrices, which commute. The represented endomorphisms therefore commute.

L6givenalgebra
2.1

Step 1.1 gives a common eigenbasis for T0. Every member of T lies in its span, so it is represented by a linear combination of diagonal matrices in that basis and is diagonal too. Hence [L6] makes T simultaneously diagonalisable.

step 1.1step 1.2L6
3.1

Steps 2.1 and 1.3 prove both directions, including empty families and the zero space.

step 2.1step 1.3
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

If two commuting endomorphisms are diagonalisable, then every finite linear combination of products of their powers is diagonalisable; in particular, their sum and product are diagonalisable

Statement

Let S,T be commuting diagonalisable endomorphisms. Every endomorphism of the form

j<mcjSajTbj

with m,aj,bjN and cjF is diagonalisable. In particular, S+T and ST are diagonalisable.

Facts & Assumptions

Given: Commuting diagonalisable endomorphisms S,T and the displayed finite polynomial expression.

Proof

technique · direct
1.1

By [L1], choose a basis in which both S and T are diagonal. Every power, product of powers, and finite linear combination in the Statement remains diagonal in that same basis.

L1algebra
2.1

Thus every displayed expression is diagonalisable. Taking the expressions S+T and ST gives the stated special cases; the empty sum and zero space cause no exception.

step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16Open item page →

The algebra F[T] generated by an endomorphism is isomorphic to F[x]/(μT)

Statement

For an endomorphism T of a finite-dimensional F-vector space, the evaluation map induces an F-algebra isomorphism

F[x]/(μT)F[T]:={p(T):pF[x]}.

Facts & Assumptions

Given: An endomorphism T and polynomial evaluation evT:F[x]L(V,V).

[L1]

Polynomial evaluation sends p to p(T)=akTk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

[L3]

The first isomorphism theorem for rings gives R/kerfimf (First isomorphism theorem for rings: R/kerfimf).

Proof

technique · direct
1.1

The finite-sum definition in [L1] gives (p+q)(T)=p(T)+q(T), (pq)(T)=p(T)q(T), and 1(T)=I, so evaluation is an F-algebra homomorphism. Its image is F[T] by definition, and [L2] identifies its kernel with (μT).

L1L2algebra
2.1

Apply [L3] to step 1.1. On the zero space μT=1, and both F[x]/(1) and the zero endomorphism algebra are the one-element ring.

step 1.1L3

5 · Examples, counterexamples and false statements

None yet.

Sources

Standard references

Recommended treatments; not extraction sources.