Alphabeta Math
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.

✓ 29 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 15 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Triangularisation, Generalised Eigenspaces and Jordan Canonical Form

1 · Prerequisites

2 · Summary

This page first builds the quotient-vector-space machinery missing from the published linear-map page: well-defined operations and projection, lifted bases, the universal property, the first isomorphism theorem, and restriction and quotient operators on invariant subspaces. It then characterises upper triangular form by complete invariant flags, proves that an operator is triangularisable exactly when its minimal or characteristic polynomial splits, and treats simultaneous triangularisation, nilpotent operators, stabilised kernels and images, and Jordan-string bases.

The second half constructs Jordan canonical form from the generalised eigenspace decomposition and proves its uniqueness rather than merely asserting it. For each eigenvalue, the ranks of the powers of T-lambda I recover the number of blocks of every size, which yields the similarity classification. The page closes with cyclic subspaces and vector annihilators, a primary- component proof that some vector realises the minimal polynomial, the criterion that a cyclic vector exists exactly when the minimal and characteristic polynomials agree, and the polynomial description of the commutant of a cyclic operator.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

The quotient vector space V/W and its canonical projection

Definition

Let V be a vector space over a field F and let W be a linear subspace of V (Vector space over a field, Linear subspace of a vector space). For v∈V, the coset of W represented by v is v+W:={v+w:w∈W}. The quotient set is V/W:={v+W:v∈V}. Its addition and scalar multiplication are (v+W)+(u+W):=(v+u)+W,a(v+W):=(av)+W. The resulting vector space is the quotient vector space of V by W. The canonical projection is π:V⟶V/W,π(v):=v+W. The independence of the displayed operations from their representatives, the vector-space axioms, and the linearity and kernel of π are established in Coset equality, well-defined quotient operations, and the canonical projection with kernel W ↗.

Remarks

Quotient spaces enter this development because the reverse triangularisation argument descends an operator from V to the quotient by an invariant eigenline ⟨v⟩. The quotient removes that line while retaining the induced linear action needed for induction.

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

Coset equality, well-defined quotient operations, and the canonical projection with kernel W

Statement

Let V be a vector space over F and let W≤V. For v,v′∈V the cosets of The quotient vector space V/W and its canonical projection satisfy v+W=v′+Wexactly whenv−v′∈W. The operations on V/W in The quotient vector space V/W and its canonical projection are independent of the chosen representatives and make V/W a vector space over F. The canonical projection π:V→V/W is a surjective linear map and ker⁡π=W.

Facts & Assumptions

Given: A vector space V over F, a linear subspace W≤V, and the cosets and operations displayed in The quotient vector space V/W and its canonical projection.

[L1]

For v∈V the coset of W represented by v is v+W:={v+w:w∈W}, and the proposed operations are (v+W)+(u+W):=(v+u)+W and a(v+W):=(av)+W (The quotient vector space V/W and its canonical projection).

[L2]

A linear subspace W of V satisfies (W1) 0V∈W, (W2) u,v∈W implies u+v∈W, and (W3) λ∈F and v∈W imply λv∈W (Linear subspace of a vector space).

[L3]

A map is linear when it preserves all linear combinations: T(au+bv)=aT(u)+bT(v) (Linear map between vector spaces over the same field).

Proof

technique · direct
1.1L1L2

Suppose v+W=v′+W. By (W1) of [L2] we have v=v+0V∈v+W, so v∈v′+W, giving w∈W with v=v′+w and hence v−v′=w∈W. Conversely suppose v−v′∈W. For w∈W, v+w=v′+((v−v′)+w) and (v−v′)+w∈W by (W2), so v+W⊆v′+W; since v′−v=(−1)(v−v′)∈W by (W3), the same argument gives v′+W⊆v+W. Hence v+W=v′+W exactly when v−v′∈W.

2.1step 1.1L1L2

Let v+W=v′+W and u+W=u′+W. By step 1.1, v−v′∈W and u−u′∈W, so (v+u)−(v′+u′)=(v−v′)+(u−u′)∈W by (W2) and av−av′=a(v−v′)∈W by (W3). Applying step 1.1 in the converse direction gives (v+u)+W=(v′+u′)+W and (av)+W=(av′)+W, so both quotient operations are independent of representatives.

3.1step 1.1step 2.1L1L3∎

The vector-space identities in V/W follow by applying the corresponding identities in V to representatives, with zero coset W=0V+W and inverse −(v+W)=(−v)+W; moreover π(av+bu)=(av+bu)+W=aπ(v)+bπ(u) by [L1] and [L3], every coset is π(v) by definition, and by step 1.1 π(v)=0V+W exactly when v−0V=v∈W, so π is linear and surjective with ker⁡π=W.

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

A quotient basis lifts to a basis adapted to W

Statement

Let V be finite-dimensional, let W≤V, let (w1,…,wr) be an ordered basis of W, and let (v1+W,…,vs+W) be an ordered basis of V/W. Then (w1,…,wr,v1,…,vs) is an ordered basis of V. Consequently, dim⁡(V/W)=dim⁡V−dim⁡W.

Facts & Assumptions

Given: The spaces, bases, and representatives in the Statement.

[L1]

The canonical projection π:V→V/W is linear and surjective with kernel W (Coset equality, well-defined quotient operations, and the canonical projection with kernel W).

[L2]

A basis is a linearly independent spanning family, with the empty family a basis exactly for the zero space (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[L3]

The dimension of a finite-dimensional vector space is the size of any finite basis, and the zero space has dimension 0 (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis).

Proof

technique · direct
1.1L1L2

If ∑iaiwi+∑jbjvj=0, applying π gives ∑jbj(vj+W)=0; independence of the quotient basis forces every bj=0, and independence of the basis of W then forces every ai=0.

2.1step 1.1L1L2L3∎

For v∈V, expand π(v)=∑jbj(vj+W); then v−∑jbjvj∈ker⁡π=W and is a combination of the wi, so the displayed independent family spans V and is a basis; counting its r+s members gives dim⁡V=dim⁡W+dim⁡(V/W), including W=0, W=V, and V=0.

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

Universal property of the quotient vector space

Statement

Let f:V→U be linear and let W≤V satisfy W⊆ker⁡f. There is a unique linear map fˉ:V/W→U such that fˉ∘π=f. It is given by fˉ(v+W)=f(v).

Facts & Assumptions

Given: A linear map f:V→U and a subspace W⊆ker⁡f.

[L1]

v+W=v′+W exactly when v−v′∈W, the operations on V/W make it a vector space over F, and the canonical projection π:V→V/W is a surjective linear map with ker⁡π=W (Coset equality, well-defined quotient operations, and the canonical projection with kernel W).

[L2]

For a linear map f, its kernel is ker⁡f={v:f(v)=0} (Kernel and image of a linear map).

[L3]

The quotient operations are (v+W)+(u+W):=(v+u)+W and a(v+W):=(av)+W, and the canonical projection is π(v):=v+W (The quotient vector space V/W and its canonical projection).

Proof

technique · direct
1.1L1L2L3

Define fˉ(v+W):=f(v); if v+W=v′+W, then v−v′∈W⊆ker⁡f by [L1], so f(v)−f(v′)=f(v−v′)=0 by [L2] and the linearity of f, giving f(v)=f(v′), and fˉ is well defined; the operation formulas of [L3] then give fˉ(a(v+W)+b(u+W))=fˉ((av+bu)+W)=f(av+bu)=af(v)+bf(u), so fˉ is linear.

2.1step 1.1L1∎

The definition gives fˉ(π(v))=f(v), hence fˉπ=f; if g:V/W→U also satisfies gπ=f, then every coset is π(v) and g(v+W)=f(v)=fˉ(v+W), so g=fˉ, including the cases W=V and V=0.

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

First isomorphism theorem for vector spaces: V/ker⁡T is isomorphic to im⁡T

Statement

For every linear map T:V→U, the formula T~(v+ker⁡T):=T(v) defines a linear isomorphism T~:V/ker⁡T→im⁡T.

Facts & Assumptions

Given: A linear map T:V→U.

[L1]

A linear map whose kernel contains a subspace W factors uniquely through V/W by v+W↦T(v) (Universal property of the quotient vector space).

[L2]

The image of a linear map is a linear subspace, and a linear map is injective exactly when its kernel is the zero subspace (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial).

Proof

technique · direct
1.1L1L2

Apply [L1] with W=ker⁡T and codomain restricted to im⁡T to obtain the linear map T~(v+ker⁡T)=T(v); it is surjective by the definition of im⁡T.

2.1step 1.1L2∎

Its kernel consists of cosets v+ker⁡T with T(v)=0, hence only the zero coset ker⁡T; [L2] makes T~ injective, so it is an isomorphism, including the zero map and the zero-space case.

Remarks

For finite-dimensional V, taking dimensions in this isomorphism gives dim⁡V=dim⁡ker⁡T+dim⁡im⁡T, the equality recorded independently as Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T. This is an agreement record, not a premise in the proof above.

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

Invariant subspaces, restrictions, and induced quotient operators

Definition

Let T:V→V be an endomorphism. A linear subspace W≤V is T-invariant when T(W)⊆W. For such a W, the restriction of T to W is T∣W:W⟶W,w⟼T(w). The operator induced by T on the quotient is the map Tˉ:V/W⟶V/W,Tˉ(v+W):=T(v)+W, where V/W is the quotient of The quotient vector space V/W and its canonical projection. Its well-definedness, linearity, and relation to the canonical projection are proved in Invariance makes the induced quotient operator well defined and linear, with πT=Tˉπ ↗.

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

Invariance makes the induced quotient operator well defined and linear, with πT=Tˉπ

Statement

Let T:V→V be linear and let W≤V be T-invariant. Then Tˉ(v+W):=T(v)+W is a well-defined linear endomorphism of V/W, and the canonical projection satisfies π∘T=Tˉ∘π.

Facts & Assumptions

Given: An endomorphism T:V→V and a T-invariant subspace W≤V.

[L1]

T-invariance means T(W)⊆W, and the proposed induced map is Tˉ(v+W)=T(v)+W (Invariant subspaces, restrictions, and induced quotient operators).

[L2]

v+W=v′+W exactly when v−v′∈W; the operations on V/W are independent of the chosen representatives and make V/W a vector space over F; and π:V→V/W is a surjective linear map with ker⁡π=W (Coset equality, well-defined quotient operations, and the canonical projection with kernel W).

[L3]

The quotient operations are (v+W)+(u+W):=(v+u)+W and a(v+W):=(av)+W, and the canonical projection is π(v):=v+W (The quotient vector space V/W and its canonical projection).

Proof

technique · direct
1.1L1L2

If v+W=v′+W, then v−v′∈W, so T(v)−T(v′)=T(v−v′)∈T(W)⊆W and therefore T(v)+W=T(v′)+W; thus Tˉ is well defined.

2.1step 1.1L1L2L3∎

For scalars a,b, the operations of [L3] give a(v+W)+b(u+W)=(av+bu)+W, so by [L1] and the linearity of T, Tˉ(a(v+W)+b(u+W))=T(av+bu)+W=(aT(v)+bT(u))+W=a(T(v)+W)+b(T(u)+W), and Tˉ is linear; also Tˉ(π(v))=Tˉ(v+W)=T(v)+W=π(T(v)) proves Tˉπ=πT; the same calculation covers W=0, W=V, and V=0.

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

Polynomial evaluation commutes with restriction and invariant quotients

Statement

Let T:V→V be an endomorphism of a finite-dimensional vector space and let W≤V be T-invariant. For every p∈F[x], p(T∣W)=p(T)∣W,p(Tˉ)(v+W)=p(T)v+W. Consequently, the minimal polynomials of T∣W and Tˉ both divide μT.

Facts & Assumptions

Given: A finite-dimensional F-vector space V, an endomorphism T, a T-invariant subspace W, and p∈F[x].

[L1]

The induced quotient endomorphism is linear and satisfies Tˉπ=πT (Invariance makes the induced quotient operator well defined and linear, with πT=Tˉπ).

[L2]

Polynomial evaluation is p(T)=∑kakTk, with T0=I and only finitely many nonzero coefficients (Polynomial evaluation at an endomorphism: p(T)=∑kakTk).

[L3]

For a finite-dimensional endomorphism S, q(S)=0 exactly when μS divides q, and on the zero space μS=1 (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μT∣p).

[L4]

For an invariant W, T∣W maps W to itself and Tˉ(v+W)=T(v)+W (Invariant subspaces, restrictions, and induced quotient operators).

Proof

technique · direct
1.1L1L2L4

Induction on k gives (T∣W)k=Tk∣W and Tˉk(v+W)=Tkv+W, beginning with the identity at k=0 and using [L1] at the successor step; summing with the coefficients of p yields both displayed identities.

2.1step 1.1L2L3L4∎

Taking p=μT makes p(T)=0, so step 1.1 gives p(T∣W)=0 and p(Tˉ)=0; [L3] then gives μT∣W∣μT and μTˉ∣μT, including W=0, W=V, and V=0.

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

For invariant W, χT=χT∣WχTˉ

Statement

Let T:V→V be an endomorphism of a finite-dimensional vector space, and let W≤V be T-invariant. Then χT(x)=χT∣W(x) χTˉ(x), where Tˉ is the endomorphism induced on V/W.

Facts & Assumptions

Given: A finite-dimensional F-vector space V, an endomorphism T, and a T-invariant subspace W.

[L1]

Invariance defines the restriction T∣W and the quotient formula Tˉ(v+W)=T(v)+W (Invariant subspaces, restrictions, and induced quotient operators).

[L2]

A basis of W followed by representatives of a basis of V/W is a basis of V (A quotient basis lifts to a basis adapted to W).

[L3]

A block upper-triangular matrix with diagonal blocks A,D has characteristic polynomial χAχD, including zero-sized blocks (The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks).

[L4]

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

[L5]

The formula Tˉ(v+W)=T(v)+W is well defined and linear (Invariance makes the induced quotient operator well defined and linear, with πT=Tˉπ).

Proof

technique · direct
1.1L1L2L5

Choose an ordered basis of W, a basis of V/W, and representatives of the latter; [L2] gives an adapted basis of V, in which invariance makes the matrix of T block upper triangular, with upper-left block representing T∣W and lower-right block representing the well-defined operator Tˉ.

2.1step 1.1L3L4∎

Applying [L3] to that matrix and then [L4] to identify its diagonal-block polynomials gives χT=χT∣WχTˉ; if W=0, W=V, or V=0, the missing block has characteristic polynomial 1, so the same identity remains valid.

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

Triangularisable endomorphisms and simultaneous triangularisability

Definition

Let V be a finite-dimensional vector space over F. An endomorphism T:V→V is triangularisable over F when some ordered basis B makes [T]BB upper triangular (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

A family A of endomorphisms of V is simultaneously triangularisable over F when one ordered basis B makes [S]BB upper triangular for every S∈A. The empty family is simultaneously triangularisable in every ordered basis, including the empty basis of the zero space.

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

Complete invariant flags are equivalent to upper-triangular matrices

Statement

Let B=(v1,…,vn) be an ordered basis of V, and put Vj=span⁡(v1,…,vj), with V0=0. Then [T]BB is upper triangular if and only if every Vj is T-invariant. Equivalently, upper-triangular bases are exactly the bases adapted to complete invariant flags 0=V0⊂V1⊂⋯⊂Vn=V,dim⁡Vj=j.

Facts & Assumptions

Given: An endomorphism T:V→V and an ordered basis B=(v1,…,vn).

[L1]

Triangularisability means that the matrix of T in some ordered basis is upper triangular (Triangularisable endomorphisms and simultaneous triangularisability).

[L2]

A subspace W is T-invariant when T(W)⊆W (Invariant subspaces, restrictions, and induced quotient operators).

[L3]

The j-th matrix column is the coordinate column of T(vj) in the ordered basis (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

Proof

technique · direct
1.1L1L2L3

If the matrix is upper triangular, its j-th column has no nonzero entry below row j, so T(vj)∈Vj; linearity then gives T(Vj)⊆Vj for every j.

2.1step 1.1L1L2L3∎

Conversely, if every Vj is invariant, then T(vj)∈Vj, so the j-th matrix column has zero entries below row j and the matrix is upper triangular; the statements include the empty flag for V=0 and the flag 0⊂V in dimension one.

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

T is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits

Statement

Let T be an endomorphism of a finite-dimensional vector space V over F. The following are equivalent:

  1. T is triangularisable over F;
  2. the minimal polynomial μT is a product of linear factors in F[x];
  3. the characteristic polynomial χT is a product of linear factors in F[x].

For V=0, both polynomials are 1, the empty product, and the empty basis triangularises T.

Facts & Assumptions

Given: A finite-dimensional F-vector space V and an endomorphism T:V→V.

[L1]

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

[L2]

For a T-invariant subspace W, χT=χT∣WχTˉ (For invariant W, χT=χT∣WχTˉ).

[L3]

A monic irreducible polynomial divides μT if and only if it divides χT (The minimal and characteristic polynomials have exactly the same monic irreducible factors).

[L4]

The eigenvalues of T over F are exactly the roots in F of χT (For every finite-dimensional space, σF(T) is exactly the set of roots in F of χT).

[L5]

A basis of a subspace followed by representatives of a quotient basis is a basis of the whole space (A quotient basis lifts to a basis adapted to W).

Proof

technique · induction
1.1L1L3

If T is triangularisable, then xI−[T] is upper triangular and its determinant is the product of its diagonal entries x−ajj, so χT splits; by [L3], χT splits exactly when μT splits.

1.2base

If dim⁡V=0, the empty basis and the polynomial 1 give all three conditions.

1.3L4chooseih

Assume dim⁡V>0, that χT splits, and that the reverse implication holds in smaller dimensions; choose a root λ∈F of χT, then [L4] supplies a nonzero eigenvector v, and W=Fv is a one-dimensional invariant subspace.

2.1step 1.3L1L2L5ih

By [L2], χT=(x−λ)χTˉ, so χTˉ splits; the induction hypothesis triangularises Tˉ on V/W, and [L5] lifts its triangular basis after v to a basis whose initial spans are T-invariant, so [L1] triangularises T.

3.1step 1.1step 1.2step 2.1discharge-induction∎

Step 1.1 gives 1⇒3⇔2, while steps 1.2-2.1 give 3⇒1 in every finite dimension, completing all three equivalences.

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

Every finite-dimensional endomorphism over an algebraically closed field is triangularisable

Statement

Let F be algebraically closed. Every endomorphism of a finite-dimensional F-vector space is triangularisable over F.

Facts & Assumptions

Given: An algebraically closed field F, a finite-dimensional F-vector space V, and an endomorphism T:V→V.

[L1]

An endomorphism is triangularisable exactly when its characteristic polynomial splits into linear factors over its base field (T is triangularisable iff its minimal polynomial splits iff its characteristic polynomial splits).

[L2]

In an algebraically closed field, every nonconstant polynomial has a root in the field (An algebraically closed field: every nonconstant polynomial has a root in the field).

[L3]

If f(a)=0 over a commutative ring, then x−a divides f (Factor theorem over a commutative ring).

Proof

technique · induction
1.1base

A monic polynomial of degree 0 is 1, hence is the empty product of linear factors.

1.2L2L3ih

Let f∈F[x] be monic of positive degree and assume every monic polynomial of smaller degree splits; [L2] gives a root a, and [L3] writes f=(x−a)q with q monic of degree one less, so the induction hypothesis makes q, and therefore f, split.

2.1step 1.1step 1.2L1discharge-induction∎

Apply steps 1.1-1.2 to the monic polynomial χT; it splits over F, so [L1] triangularises T, with V=0 covered by the degree-zero base case.

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

A commuting split family is simultaneously triangularisable

Statement

Let A be a family of pairwise commuting endomorphisms of a finite-dimensional F-vector space V. If χS splits over F for every S∈A, then A is simultaneously triangularisable. The family may be empty.

Facts & Assumptions

Given: A finite-dimensional F-vector space V and a pairwise commuting family A⊆End⁡F(V) such that every χS splits over F.

[L1]

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

[L2]

If W is invariant under S, then χS=χS∣WχSˉ (For invariant W, χT=χT∣WχTˉ).

[L3]

A basis is upper triangular for an operator exactly when its initial spans form an invariant flag (Complete invariant flags are equivalent to upper-triangular matrices).

[L4]

Invariance makes every quotient operator well defined and linear (Invariance makes the induced quotient operator well defined and linear, with πT=Tˉπ).

[L5]

A quotient basis lifts after a basis of the subspace to an adapted basis of the whole space (A quotient basis lifts to a basis adapted to W).

Proof

technique · induction
1.1base

If dim⁡V=0, the empty basis simultaneously triangularises every family.

1.2L1L2chooseih

Assume dim⁡V>0 and the theorem in smaller dimensions; if A is empty or all its members are scalar, any basis works, while otherwise choose a nonscalar A∈A, use [L1] to obtain a nonzero proper eigenspace E, observe that every S∈A preserves E because SA=AS, and use [L2] plus induction on E to obtain a common eigenvector v∈E.

2.1step 1.2L2L4ih

Put W=Fv; it is invariant under every S∈A, the induced quotient operators commute by direct evaluation on cosets, and [L2] shows each quotient characteristic polynomial splits, so induction gives a common triangular basis of V/W.

3.1step 1.2step 2.1L3L5discharge-induction∎

Lift that quotient basis after v by [L5]; its initial spans are invariant for every S by the quotient construction, so [L3] makes every representing matrix upper triangular in the same basis, and this also covers the empty and all-scalar branches.

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

Nilpotent endomorphisms and their nilpotency index

Definition

An endomorphism N:V→V is nilpotent if Nk=0 for some positive integer k. Its nilpotency index is the least positive integer r such that Nr=0; this least exponent exists by the well-ordering principle (The well-ordering principle).

The unique endomorphism of the zero space is nilpotent. With the same least-positive-exponent convention, its nilpotency index is 1 because its identity and zero endomorphisms coincide.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Characterisations of a nilpotent endomorphism

Statement

Let N be an endomorphism of a nonzero n-dimensional vector space over F. The following are equivalent:

  1. N is nilpotent;
  2. μN=xr for some 1≤r≤n;
  3. χN=xn;
  4. some ordered basis gives N a strictly upper-triangular matrix.

In that case r is the nilpotency index.

The nonzero hypothesis is needed for condition 2. On the zero space the unique endomorphism N=0 is nilpotent with nilpotency index 1, and μN=χN=1=x0 while the empty matrix is strictly upper triangular; so conditions 1, 3 and 4 hold there, but condition 2 fails, since no integer r satisfies 1≤r≤0. The exponent 0 of μN is then not the nilpotency index 1.

Facts & Assumptions

Given: An endomorphism N of a finite-dimensional F-vector space V, with n=dim⁡V.

[L1]

A polynomial p annihilates an endomorphism exactly when its minimal polynomial divides p; on the zero space the minimal polynomial is 1 (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μT∣p).

[L2]

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

[L3]

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

Proof

technique · direct
1.1L1L5

Suppose n>0. By [L1], Nk=0 for some positive k exactly when μN∣xk, which is exactly when μN=xr for some positive r; [L5] then bounds the least such r by n once χN=xn.

1.2L2L4L5

If μN=xr, [L2] says that x is the only irreducible factor of χN, and [L4] forces χN=xn; conversely χN=xn and [L5] give Nn=0.

2.1step 1.2L3algebra

If N is nilpotent, step 1.2 makes χN split, so [L3] gives an upper-triangular matrix; its diagonal entries are roots of χN=xn, hence are all zero, making it strictly upper triangular. Conversely, the nth power of a strictly upper-triangular n×n matrix is zero.

3.1step 1.1step 1.2step 2.1L1L4∎

For V=0, [L1] and [L4] give μN=χN=1=x0, the unique empty matrix is strictly upper triangular, and the convention in Nilpotent endomorphisms and their nilpotency index gives index 1, so conditions 1, 3 and 4 hold; condition 2 asks for r with 1≤r≤0 and no such integer exists, and the exponent 0 of μN differs from the index 1, which is why the equivalence is stated for n>0. Together with steps 1.1-2.1 this proves every asserted case.

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

Kernel and rank sequences of powers stabilise once equality occurs

Statement

Let T be an endomorphism of a finite-dimensional vector space V. For every k≥0, ker⁡Tk⊆ker⁡Tk+1,im⁡Tk+1⊆im⁡Tk, so the nullities weakly increase and the ranks weakly decrease. If ker⁡Tm=ker⁡Tm+1 for some m≥0—equivalently, if rank⁡Tm=rank⁡Tm+1—then for every r≥0, ker⁡Tm+r=ker⁡Tm,im⁡Tm+r=im⁡Tm.

Facts & Assumptions

Given: An endomorphism T of a finite-dimensional vector space V.

[L1]

The kernel and image of a linear map are ker⁡S={v:S(v)=0} and im⁡S={S(v):v∈V} (Kernel and image of a linear map).

[L2]

Rank and nullity are the dimensions of the image and kernel (Rank and nullity of a linear map with finite-dimensional domain).

[L3]

For an endomorphism S of V, dim⁡V=nullity⁡S+rank⁡S (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

Proof

technique · induction
1.1L1L2algebra

If Tkv=0, then Tk+1v=0, and every Tk+1v equals Tk(Tv); hence the displayed kernel and image inclusions hold, and [L2] turns them into the asserted dimension inequalities.

1.2base

Assume ker⁡Tm=ker⁡Tm+1. The equality ker⁡Tm+0=ker⁡Tm is the base case.

2.1step 1.1L2L3

By [L3], equality of the two consecutive kernel dimensions is equivalent to equality of the two consecutive ranks; together with the inclusions in step 1.1, either dimension equality is equivalent to equality of the corresponding subspaces.

2.2step 1.1ih

If ker⁡Tm+r=ker⁡Tm and v∈ker⁡Tm+r+1, then Trv∈ker⁡Tm+1=ker⁡Tm, so v∈ker⁡Tm+r; the reverse inclusion is in step 1.1, completing the induction on r.

3.1step 1.1step 1.2step 2.2L3discharge-induction∎

Applying [L3] to every Tm+r shows that the later images all have the same dimension as im⁡Tm; the nested image inclusions from step 1.1 therefore make them equal, completing the claim.

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

A stabilised power splits the space into its kernel and image

Statement

Let T be an endomorphism of a finite-dimensional vector space V. If m≥0 and ker⁡Tm=ker⁡Tm+1, then V=ker⁡Tm⊕im⁡Tm.

Facts & Assumptions

Given: An endomorphism T of a finite-dimensional vector space V and m≥0 with ker⁡Tm=ker⁡Tm+1.

[L1]

Once consecutive kernels agree at m, every later kernel equals ker⁡Tm (Kernel and rank sequences of powers stabilise once equality occurs).

[L2]

Rank-nullity gives dim⁡V=dim⁡ker⁡S+dim⁡im⁡S for an endomorphism S (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[L3]

Proof

technique · direct
1.1L1algebra

If x∈ker⁡Tm∩im⁡Tm, write x=Tmy; then T2my=0, so [L1] gives y∈ker⁡Tm and hence x=0.

2.1step 1.1L2algebra

By [L2] applied to Tm, the dimensions of ker⁡Tm and im⁡Tm sum to dim⁡V; with the zero intersection from step 1.1, their sum is therefore all of V.

3.1step 1.1step 2.1L3∎

Fact [L3] now gives the asserted internal direct sum, including m=0 and V=0.

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

Jordan blocks, Jordan strings, and their endpoints

Definition

For m≥1 and λ∈F, the Jordan block Jm(λ) is the m×m matrix with λ on the diagonal, 1 on the superdiagonal, and 0 elsewhere.

Let T:V→V be an endomorphism. A Jordan string of length m for T at λ is an ordered list (v1,…,vm) satisfying (T−λI)v1=0,(T−λI)vj=vj−1(2≤j≤m). Its initial vector is v1 and its terminal vector is vm. The initial vector is required to be nonzero; consequently every vector in the string is nonzero. In the ordered basis (v1,…,vm), the restriction of T to the string's span has matrix Jm(λ) under the coordinate-column convention (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

A Jordan string for a nilpotent endomorphism means a string at λ=0.

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

Independent initial vectors make a family of nilpotent Jordan strings independent

Statement

Let N:V→V be an endomorphism and let (vi,1,…,vi,mi) be finitely many Jordan strings for N at 0. If their initial vectors vi,1 are linearly independent, then the union of all vectors in the strings is linearly independent. The empty family is allowed.

Facts & Assumptions

Given: A finite family of nilpotent Jordan strings whose initial vectors are linearly independent.

[L1]

In each string, Nvi,1=0 and Nvi,j=vi,j−1 for j≥2 (Jordan blocks, Jordan strings, and their endpoints).

Proof

technique · induction
1.1baseL2

Induct on a natural number r bounding all the string lengths, taking r=0 for the empty family, which has no strings and no maximum length. At r=0 the family is empty and the assertion is immediate, the empty union being independent by [L2].

1.2L1ihalgebra

Assume the result for families whose lengths are bounded by r−1, and let the present family have lengths bounded by r≥1 with some string of length exactly r. In a relation ∑i,jai,jvi,j=0, applying Nr−1 and using [L1] gives ∑i:mi=rai,rvi,1=0.

2.1step 1.2ihL2discharge-induction∎

Independence of the initial vectors forces every coefficient ai,r to vanish. Removing the terminal vectors at position r leaves a relation among truncated strings of maximum length at most r−1, so the induction hypothesis makes all remaining coefficients zero; [L2] gives independence of the whole union.

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

Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings

Statement

Every nilpotent endomorphism N of a finite-dimensional vector space V has an ordered basis that is the concatenation of Jordan strings for N at 0. For V=0, this is the empty basis and the empty family of strings.

Facts & Assumptions

Given: A nilpotent endomorphism N of a finite-dimensional vector space V.

[L1]

Jordan strings with linearly independent initial vectors have linearly independent union (Independent initial vectors make a family of nilpotent Jordan strings independent).

[L2]

Rank-nullity gives dim⁡V=dim⁡ker⁡N+dim⁡im⁡N (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

[L3]

In a finite-dimensional vector space, every linearly independent subset extends to a basis without a choice principle; a subspace of the same dimension as the whole space equals it (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

Proof

technique · induction on $\dim\operatorname{im}N$
1.1baseL3

If im⁡N=0, extend the empty independent set to a basis of V by [L3]; every basis vector is then a length-one Jordan string. This includes V=0.

1.2ihalgebra

Put W=im⁡N. If W≠0, its restriction N∣W is nilpotent and dim⁡im⁡(N∣W)<dim⁡W: equality would make the restriction surjective, hence all its powers surjective, contradicting nilpotence on nonzero W. The induction hypothesis therefore gives a Jordan-string basis (wi,1,…,wi,mi) of W.

2.1step 1.2choosealgebra

For every i, choose vi,mi+1∈V with Nvi,mi+1=wi,mi; adjoining it extends the ith string by one. The vectors wi,1 form a basis of ker⁡N∩W, because in the Jordan-string basis of W the kernel of N∣W consists exactly of the initial-vector combinations.

3.1step 2.1L1L3

Use the finite-dimensional extension clause [L3] to extend the independent family (wi,1) to a basis of ker⁡N; regard each added vector as a length-one string. The initial vectors of all resulting strings are independent, so [L1] makes their union independent.

4.1step 3.1L2L3

The union has dim⁡W vectors inherited from the strings in W, one lift for each old string, and dim⁡ker⁡N minus that same number of added kernel vectors; hence it has dim⁡W+dim⁡ker⁡N=dim⁡V vectors by [L2]. Its span therefore has dimension dim⁡V, so [L3] makes it all of V.

5.1step 1.1step 1.2step 4.1discharge-induction∎

Thus the union is a basis of Jordan strings, completing the induction.

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

Power ranks determine every nilpotent Jordan-block multiplicity

Statement

Let N be nilpotent on a finite-dimensional vector space. Put dk=dim⁡ker⁡Nk and ρk=rank⁡Nk for k≥0, so d0=0 and ρ0=dim⁡V. For every k≥1, #{blocks of size at least k}=dk−dk−1=ρk−1−ρk, and #{blocks of size exactly k}=2dk−dk−1−dk+1=ρk−1−2ρk+ρk+1. Thus either the nullities or the ranks of all powers determine the multiset of nilpotent Jordan blocks. On the zero space all sequences are zero and the block multiset is empty.

Facts & Assumptions

Given: A nilpotent endomorphism N of a finite-dimensional vector space.

[L1]

There is a basis in which N is a direct sum of nilpotent Jordan blocks (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).

[L2]

For every k≥0, ker⁡Tk⊆ker⁡Tk+1 and im⁡Tk+1⊆im⁡Tk; and if ker⁡Tm=ker⁡Tm+1 for some m≥0 — equivalently rank⁡Tm=rank⁡Tm+1 — then ker⁡Tm+r=ker⁡Tm and im⁡Tm+r=im⁡Tm for every r≥0 (Kernel and rank sequences of powers stabilise once equality occurs).

[L3]

Nullity and rank are the dimensions of the kernel and image (Rank and nullity of a linear map with finite-dimensional domain).

[L4]

Rank-nullity gives dim⁡V=dim⁡ker⁡S+dim⁡im⁡S for every endomorphism S of V (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

Proof

technique · direct
1.1L1L3algebra

On a block Jm(0), dim⁡ker⁡Jm(0)k=min⁡(k,m); its contribution to dk−dk−1 is therefore 1 exactly when m≥k, and 0 otherwise. Summing across the block basis from [L1] gives the first nullity formula.

2.1step 1.1algebra

Subtracting the number of blocks of size at least k+1 from the number of blocks of size at least k gives 2dk−dk−1−dk+1 blocks of exact size k.

3.1step 1.1step 2.1L1L2L3L4algebra

Fact [L4] gives dk+ρk=dim⁡V for every k, so replacing each dk in steps 1.1-2.1 gives the two rank formulas. For the tail, first dispose of V=0: there the block multiset is empty, every dk and ρk is zero, and both formulas read 0=0. So assume V≠0, in which case the basis of [L1] has at least one block and a largest block size m∗ exists; step 1.1 gives dim⁡ker⁡Jm(0)k=min⁡(k,m)=m for every block and every k≥m∗, so dk=dim⁡V and ρk=0 for all k≥m∗. In particular ker⁡Nm∗=ker⁡Nm∗+1, which is the hypothesis of [L2], and [L2] then gives the stabilised tail beyond the largest block.

4.1step 1.1step 2.1step 3.1∎

These formulas recover every block multiplicity, including size one and the endpoint after the largest block; when V=0 each quantity and each recovered multiplicity is zero.

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

Nilpotent similarity is classified by the ranks of all powers

Statement

Let N and M be nilpotent endomorphisms of finite-dimensional vector spaces V and W over the same field F, where similar means that some F-linear isomorphism φ:V→W satisfies M=φNφ−1. Then N and M are similar if and only if rank⁡Nk=rank⁡Mkfor every k≥0. The k=0 equality includes equality of the dimensions.

The common field is a hypothesis, not a convenience: rank sequences are integers and can agree across different fields, while similarity cannot. The zero endomorphisms of the one-dimensional spaces over F2 and over F3 have rank 1 at k=0 and rank 0 for every k≥1, and there is no linear isomorphism between them at all.

Facts & Assumptions

Given: Finite-dimensional nilpotent endomorphisms N and M over the same field.

[L1]

The ranks of all powers determine every nilpotent Jordan-block multiplicity (Power ranks determine every nilpotent Jordan-block multiplicity).

[L2]

Proof

technique · direct
1.1L2algebra

If N and M are similar, conjugating Nk gives Mk; an invertible change of coordinates preserves image dimension, so their ranks agree for every k≥0.

1.2L1L2givenchoose

Conversely, equality of all power ranks makes the two Jordan-block multisets equal by [L1]. Choose Jordan-string bases B of V and C of W realising those multisets; since the multisets agree, both bases have the same length and N and M have the same block diagonal matrix in them. Because V and W are spaces over the same field F, sending the ith vector of B to the ith vector of C defines an F-linear isomorphism φ:V→W, and matching the block matrices entry by entry gives φN=Mφ, hence M=φNφ−1; [L2] identifies this with similarity.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 establish both directions, with the empty block multiset covering zero-dimensional spaces.

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

Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities

Statement

Let T be an endomorphism of a finite-dimensional F-vector space whose characteristic polynomial splits over F. If eλ is the exponent of x−λ in μT, then V=⨁λGλ,Gλ:=ker⁡(T−λI)eλ, where λ ranges over the eigenvalues. Each Gλ is T-invariant, Nλ:=(T−λI)∣Gλ is nilpotent of index eλ, and χT∣Gλ=(x−λ)dim⁡Gλ. Consequently dim⁡Gλ is the algebraic multiplicity of λ in χT. For V=0, the sum and eigenvalue set are empty.

Facts & Assumptions

Given: A finite-dimensional endomorphism T whose characteristic polynomial splits over F.

[L1]

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

[L2]

If μT=∏i<r(x−λi)ei splits with distinct λi and ei≥1, then V=⨁i<rGλi(ei)(T), and for every k≥ei, ker⁡(T−λiI)k=Gλi(ei)(T) (If the minimal polynomial splits, V is the direct sum of the stabilised generalised eigenspaces).

[L3]

Writing μT=∏i<rqiei with the qi distinct monic irreducibles, the subspaces Vi:=ker⁡qi(T)ei are T-invariant, V=⨁i<rVi, and the minimal polynomial of T∣Vi is exactly qiei (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

[L4]

Characteristic polynomials multiply across an invariant subspace and its quotient (For invariant W, χT=χT∣WχTˉ).

[L5]

For an endomorphism of a nonzero m-dimensional space, nilpotency is equivalent to μN=xs for some 1≤s≤m and to χN=xm, and in that case s is the nilpotency index (Characterisations of a nilpotent endomorphism).

Proof

technique · direct
1.1L1L2L3

Fact [L1] makes μT split over F, so its distinct monic irreducible factors are the x−λ with λ an eigenvalue and Gλ=ker⁡(T−λI)eλ. Fact [L2] gives the displayed invariant direct sum, and [L3] applied to the same factorisation gives that each T∣Gλ has minimal polynomial exactly (x−λ)eλ.

2.1step 1.1L5algebra

Fix an eigenvalue λ. Since λ is an eigenvalue, ker⁡(T−λI)≠0, and ker⁡(T−λI)⊆Gλ because eλ≥1; hence Gλ is nonzero and [L5] applies to it. On Gλ, Nλ=T∣Gλ−λI has minimal polynomial xeλ by step 1.1, so [L5] makes Nλ nilpotent of index eλ and gives χNλ=xdim⁡Gλ. Translating the scalar variable yields χT∣Gλ=(x−λ)dim⁡Gλ.

3.1step 1.1step 2.1L4∎

Repeated use of [L4] on the invariant direct sum multiplies these restricted characteristic polynomials to obtain χT=∏λ(x−λ)dim⁡Gλ, so the exponent is exactly the algebraic multiplicity. The empty product gives the zero-space case.

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

Jordan bases and Jordan canonical forms over the base field

Definition

A Jordan basis over F for an endomorphism T:V→V is an ordered basis obtained by concatenating Jordan strings for T, all with eigenvalues in F (Jordan blocks, Jordan strings, and their endpoints). The matrix of T in such a basis is block diagonal with blocks Jm(λ) and is called a Jordan canonical form of T over F.

The adjective “canonical” records the block multiset, not a prescribed order of blocks: permuting the strings usually changes the literal block diagonal matrix. On the zero space the empty basis and empty block matrix form the Jordan basis and Jordan form.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Jordan form over the base field exists exactly when the characteristic polynomial splits

Statement

An endomorphism of a finite-dimensional F-vector space has a Jordan canonical form over F if and only if its characteristic polynomial splits into linear factors over F. This includes the zero space, where the characteristic polynomial is 1 and the Jordan form is empty.

Facts & Assumptions

Given: An endomorphism T of a finite-dimensional F-vector space V.

[L1]

If χT splits, V is the direct sum of invariant generalised eigenspaces Gλ, and (T−λI)∣Gλ is nilpotent (Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities).

[L2]

Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).

[L3]

The characteristic polynomial of a block triangular matrix is the product of the characteristic polynomials of its diagonal blocks, including empty blocks (The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks).

Proof

technique · direct
1.1L1L2construct

Suppose χT splits. For every Gλ from [L1], apply [L2] to Nλ=(T−λI)∣Gλ; its nilpotent strings are Jordan strings for T at λ, and concatenating their bases across the direct sum gives a Jordan basis of V.

1.2L3algebra

Conversely, if T has a Jordan basis, its matrix is block diagonal with blocks Jm(λ) for λ∈F; [L3] gives χT=∏(x−λ)m, which splits over F.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove both directions; the empty direct sum and empty product prove the zero-space case.

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

Every finite-dimensional endomorphism over an algebraically closed field has Jordan form

Statement

Every endomorphism of a finite-dimensional vector space over an algebraically closed field has a Jordan canonical form over that field, including the endomorphism of the zero space.

Facts & Assumptions

Given: A finite-dimensional vector space over an algebraically closed field F and an endomorphism T.

[L1]

Every nonconstant polynomial over an algebraically closed field has a root in that field (An algebraically closed field: every nonconstant polynomial has a root in the field).

[L2]

If a is a root of p∈F[x], then p=(x−a)q for some q∈F[x] (Factor theorem over a commutative ring).

[L3]

An endomorphism has Jordan form over F exactly when its characteristic polynomial splits over F (Jordan form over the base field exists exactly when the characteristic polynomial splits).

Proof

technique · induction on $\deg\chi_T$
1.1baseL3

If deg⁡χT=0, then χT=1 and [L3] gives the empty Jordan form.

1.2L1L2ih

The induction is on the degree of an arbitrary nonzero polynomial over F, not only of a characteristic polynomial, since the factor produced below need not itself be one. If the degree is positive, [L1] supplies a root a∈F and [L2] writes χT=(x−a)q with deg⁡q smaller; the induction hypothesis applies to q in that strengthened form and factors it into linear factors, so χT splits.

2.1step 1.1step 1.2L3discharge-induction∎

Fact [L3] now gives a Jordan canonical form for T, completing the induction.

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

Ranks of shifted powers determine Jordan form up to block order

Statement

Let T have split characteristic polynomial. For each eigenvalue λ, put ρk(λ)=rank⁡(T−λI)k(k≥0). Then for every k≥1, the number of Jordan blocks for λ of size exactly k is ρk−1(λ)−2ρk(λ)+ρk+1(λ). Consequently the ranks of all shifted powers determine the Jordan form uniquely up to permutation of its blocks. On the zero space the rank data and block multiset are empty.

Facts & Assumptions

Given: A finite-dimensional endomorphism T whose characteristic polynomial splits.

[L1]

The space is the direct sum of generalised eigenspaces Gμ, and Nμ=(T−μI)∣Gμ is nilpotent (Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities).

[L2]

For a nilpotent operator, rank⁡Nk−1−2rank⁡Nk+rank⁡Nk+1 is the number of blocks of size exactly k (Power ranks determine every nilpotent Jordan-block multiplicity).

[L3]

Proof

technique · direct
1.1L1algebra

Fix an eigenvalue λ. On Gλ, T−λI=Nλ. On Gμ with μ≠λ, it is (μ−λ)I+Nμ, which is invertible because the finite geometric series in −Nμ/(μ−λ) is an inverse up to the nonzero scalar μ−λ.

2.1step 1.1L1L3L4

By the direct sum in [L1] and uniqueness in [L4], for every k≥0 the rank on the non-λ summands is their constant total dimension cλ, while the rank on Gλ is rank⁡Nλk; hence ρk(λ)=cλ+rank⁡Nλk.

3.1step 2.1L2algebra

The constant cλ cancels from the second difference, and [L2] then gives the displayed exact-size block count. Varying k and λ recovers the entire block multiset.

4.1step 3.1L1∎

By the definition of Jordan form, a block multiset determines the block diagonal matrix up to block order; for V=0 there are no eigenvalues or blocks.

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

For split operators, Jordan blocks read off eigenspace multiplicities and both canonical polynomials

Statement

Let T be an endomorphism whose characteristic polynomial splits. For each eigenvalue λ, its algebraic multiplicity is the sum of the sizes of the λ-Jordan blocks, its geometric multiplicity dim⁡ker⁡(T−λI) is the number of those blocks, and the exponent of x−λ in μT is the size of the largest such block. Thus χT=∏λ(x−λ)∑jmλ,j,μT=∏λ(x−λ)max⁡jmλ,j. For V=0, both products are empty and equal 1.

Facts & Assumptions

Given: A finite-dimensional endomorphism T with split characteristic polynomial and Jordan block sizes mλ,j.

[L1]

The Jordan block multiset is determined up to order (Ranks of shifted powers determine Jordan form up to block order).

[L2]

A scalar λ is an eigenvalue when ker⁡(T−λI) contains a nonzero vector, and that kernel is its eigenspace (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism).

[L3]

A polynomial annihilates T exactly when it is divisible by μT, with μT=1 on the zero space (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μT∣p).

Proof

technique · direct
1.1L1L2algebra

A block Jm(λ) contributes m copies of x−λ to the characteristic polynomial and one independent initial vector to ker⁡(T−λI); blocks at other eigenvalues contribute no kernel because their shifted blocks are invertible. This proves the algebraic- and geometric-multiplicity claims.

1.2L3algebra

On Jm(λ), (T−λI)a vanishes exactly when a≥m. If p=(x−λ)aq with q(λ)≠0, then q(Jm(λ)) is invertible by a finite geometric-series inverse for its nonzero scalar part; hence p annihilates that block exactly when a≥m. Applying this to every block and using [L3] gives the displayed minimal polynomial.

2.1step 1.1step 1.2L3∎

Multiplying the block contributions gives the characteristic-polynomial formula, and the empty block list gives χT=μT=1 on the zero space.

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

Split matrices are similar exactly when their Jordan block multisets agree

Statement

Let A,B∈Mn(F) have characteristic polynomials that split over F. Then A and B are similar if and only if their Jordan canonical forms have the same multiset of Jordan blocks. The blocks may occur in different orders.

Facts & Assumptions

Given: Matrices A,B∈Mn(F) with split characteristic polynomials.

[L1]

A split characteristic polynomial is equivalent to existence of Jordan form over the base field (Jordan form over the base field exists exactly when the characteristic polynomial splits).

[L2]

The ranks of shifted powers determine Jordan form uniquely up to block order (Ranks of shifted powers determine Jordan form up to block order).

[L3]

Similarity models two ordered-basis matrices of one endomorphism and is an equivalence relation (Similarity is an equivalence relation, and two matrices represent the same endomorphism in two bases exactly when they are similar).

Proof

technique · direct
1.1L1L2L3

If A and B are similar, [L3] realises them as matrices of one endomorphism in two bases; [L1] supplies Jordan forms and [L2] makes their block multisets equal.

1.2L1L3construct

Conversely, enumerate the common block multiset once; after permuting blocks, both block diagonal matrices equal the matrix from that enumeration, and each block permutation is conjugation by a permutation matrix. Each of A and B is therefore similar to that common matrix, so the equivalence-relation clause in [L3] makes A similar to B.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove both directions, including n=0.

DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-16Open item page →

Cyclic subspaces, cyclic vectors, and vector annihilators

Definition

Let T:V→V be an endomorphism and v∈V. The T-cyclic subspace generated by v is Z(v;T):={p(T)v:p∈F[x]}=span⁡{v,Tv,T2v,…}. It is the smallest T-invariant subspace containing v. The vector v is a cyclic vector for T when Z(v;T)=V, and T is cyclic when it has a cyclic vector.

The annihilator ideal of v is Ann⁡T(v):={p∈F[x]:p(T)v=0}. When V is finite-dimensional this ideal is nonzero and has a unique monic generator, whose existence is proved in The vector annihilator is the unique monic generator of Ann⁡T(v) and divides the minimal polynomial ↗; that generator is the vector annihilator mT,v. For v=0, the ideal is all of F[x] and mT,0=1.

Finite dimensionality is not a convenience: it is what forces the ideal to be nonzero, and without it the ideal can vanish. On V=⨁n≥0Fen with T(en)=en+1 and v=e0, every nonzero p=∑k≤makxk gives p(T)v=∑k≤makek≠0, so Ann⁡T(v)=(0) and there is no monic generator. It is not necessary, however: for T=0 on any V and any v≠0, p(T)v=p(0)v, so Ann⁡T(v)=(x) and mT,v=x.

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

The vector annihilator is the unique monic generator of Ann⁡T(v) and divides the minimal polynomial

Statement

For an endomorphism T of a finite-dimensional vector space and v∈V, Ann⁡T(v) is a nonzero ideal of F[x]. It has a unique monic generator mT,v, and p(T)v=0⟺mT,v∣p. Moreover mT,v∣μT. In particular mT,0=1.

Facts & Assumptions

Given: A finite-dimensional endomorphism T and a vector v.

[L1]

The annihilator ideal is Ann⁡T(v)={p:p(T)v=0} (Cyclic subspaces, cyclic vectors, and vector annihilators).

[L3]

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

Proof

technique · direct
1.1L1L2algebra

Linearity of polynomial evaluation shows that [L1] is closed under addition and under multiplication by arbitrary polynomials, so it is an ideal; it is nonzero because [L2] puts μT in it.

2.1step 1.1L3algebra

By [L3] the ideal is (a) for a nonzero polynomial a; scaling by the inverse of its leading coefficient gives a monic generator mT,v, and two monic generators of one ideal are associates and hence equal.

3.1step 1.1step 2.1L1L2∎

Membership in (mT,v) is exactly divisibility by mT,v, proving the displayed equivalence. Since μT belongs to the ideal, mT,v∣μT; if v=0, the ideal contains 1 and its monic generator is 1.

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

A vector annihilator gives a power basis and its companion matrix

Statement

Let mT,v=xd+ad−1xd−1+⋯+a0. Then (v,Tv,…,Td−1v) is an ordered basis of Z(v;T). In this basis the restriction T∣Z(v;T) has the companion matrix with ones on the subdiagonal and last column (−a0,−a1,…,−ad−1)T. If d=0, then v=0, Z(v;T)=0, and both the basis and matrix are empty.

Facts & Assumptions

Given: An endomorphism T, a vector v, and its monic vector annihilator m=mT,v of degree d.

[L1]

For an endomorphism of a finite-dimensional vector space, Ann⁡T(v) has a unique monic generator mT,v and p(T)v=0 exactly when mT,v∣p (The vector annihilator is the unique monic generator of Ann⁡T(v) and divides the minimal polynomial).

[L2]

Division by monic m writes each p∈F[x] uniquely as p=qm+r with deg⁡r<d or r=0 (Division algorithm for polynomials over a field).

[L3]

The cyclic subspace is Z(v;T)={p(T)v:p∈F[x]} (Cyclic subspaces, cyclic vectors, and vector annihilators).

[L4]

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

Proof

technique · direct
1.1L1L2L3

By [L2], p(T)v=r(T)v because m(T)v=0; [L3] therefore shows that v,Tv,…,Td−1v span Z(v;T).

1.2L1algebra

A linear relation among those powers gives a polynomial r of degree below d with r(T)v=0; [L1] says m∣r, so r=0. Thus the list is independent and hence a basis.

1.3L1L4algebra

The first d−1 basis vectors shift to the next ones, while m(T)v=0 gives Tdv=−a0v−⋯−ad−1Td−1v; [L4] yields the stated companion matrix.

2.1L1L3∎

If d=0, monicity makes m=1, so [L1] gives v=0 and [L3] gives the zero cyclic subspace; the empty basis and matrix then establish the endpoint case.

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

Some vector has vector annihilator equal to the minimal polynomial

Statement

For every endomorphism T of a finite-dimensional vector space V, there is v∈V such that mT,v=μT. If V=0, take v=0 and both polynomials are 1.

Facts & Assumptions

Given: A finite-dimensional endomorphism T.

[L1]

If μT=∏i<rqiei is its factorisation into distinct monic irreducible powers, then V=⨁i<rVi with Vi=ker⁡qi(T)ei, and T∣Vi has minimal polynomial exactly qiei (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

[L2]

The vector annihilator is a monic divisor of the operator's minimal polynomial and detects exactly the polynomials that annihilate the vector (The vector annihilator is the unique monic generator of Ann⁡T(v) and divides the minimal polynomial).

[L3]

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

Proof

technique · direct
1.1L1choose

For each nonempty primary summand Vi in [L1], choose vi∈Vi with qi(T)ei−1vi≠0; such a vector exists because otherwise qiei−1 would annihilate T∣Vi, contrary to its exact minimal polynomial.

2.1step 1.1L2L3

By [L2], mT,vi divides qiei; [L3] makes it a power of qi, and step 1.1 rules out every exponent below ei. Hence mT,vi=qiei.

3.1step 2.1L1L2L3construct

Put v=∑i<rvi. Directness in [L1] gives p(T)v=0 exactly when p(T)vi=0 for every i, which by step 2.1 is exactly when every qiei divides p; pairwise coprimality and [L3] make this equivalent to μT∣p. Thus [L2] gives mT,v=μT.

4.1L1L2∎

If V=0, [L1] is the empty direct sum and the published minimal-polynomial convention gives μT=1; taking v=0 gives mT,0=1 by [L2].

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

A cyclic vector exists exactly when the minimal and characteristic polynomials agree

Statement

An endomorphism T of a finite-dimensional vector space has a cyclic vector if and only if μT=χT. On the zero space, v=0 is cyclic and μT=χT=1.

Facts & Assumptions

Given: An endomorphism T of an n-dimensional vector space V.

[L1]

If mT,v has degree d, then v,Tv,…,Td−1v is a basis of Z(v;T) (A vector annihilator gives a power basis and its companion matrix).

[L2]

Some vector v satisfies mT,v=μT (Some vector has vector annihilator equal to the minimal polynomial).

Proof

technique · direct
1.1L1L4algebra

Suppose v is cyclic. A polynomial annihilates v exactly when it annihilates every q(T)v, because polynomial evaluations commute and these vectors span V; hence mT,v=μT. By [L1], deg⁡μT=dim⁡Z(v;T)=n.

1.2L1L2L3L5choose

Conversely, suppose μT=χT and choose v as in [L2]. Then [L1] gives dim⁡Z(v;T)=deg⁡mT,v=deg⁡χT=n; since Z(v;T) is a subspace of V, [L5] gives Z(v;T)=V, so v is cyclic.

2.1step 1.1L3L4

Fact [L4] gives μT∣χT, while [L3] makes both monic and step 1.1 gives equal degree; therefore μT=χT.

3.1step 1.1step 2.1step 1.2L2L3L4∎

When V=0, [L2] chooses v=0, [L3] and [L4] give both polynomials as 1, and its cyclic subspace is V; thus steps 1.1-2.1 cover every case and both directions.

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

The commutant of a cyclic endomorphism consists of its polynomials

Statement

Let T be a cyclic endomorphism of a finite-dimensional vector space. An endomorphism S commutes with T if and only if S=p(T) for some p∈F[x]. Thus the commutant of T is F[T].

Facts & Assumptions

Given: A cyclic endomorphism T with cyclic vector v and an endomorphism S.

[L1]
[L2]

The powers v,Tv,…,Td−1v form a basis of Z(v;T), where d=deg⁡mT,v (A vector annihilator gives a power basis and its companion matrix).

[L3]

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

Proof

technique · direct
1.1L1L2choose

Suppose ST=TS. By [L1], Sv∈V=Z(v;T), so [L2] supplies p∈F[x] with Sv=p(T)v.

2.1step 1.1L2L3algebra

For every k≥0, commutation gives S(Tkv)=TkSv=Tkp(T)v=p(T)Tkv; the power basis in [L2] therefore makes S=p(T) on all of V.

3.1step 2.1L3∎

Conversely every p(T) commutes with T term by term in [L3]. This proves both directions, including the zero space where the only endomorphism is the zero map.

5 · Examples, counterexamples and false statements

None yet.

Sources