Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-13
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.

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

Statement

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

χT(T)=0.

Facts & Assumptions

Given: A finite-dimensional F-vector space V and TL(V).

[L1]

The operator characteristic polynomial is computed from any representing matrix and equals 1 in dimension zero (The basis-independent characteristic polynomial χT of an endomorphism of a finite-dimensional space, including χT=1 in dimension zero); polynomial evaluation is p(T)=kakTk (Polynomial evaluation at an endomorphism: p(T)=kakTk).

[L2]

The adjugate consists of signed (n1)×(n1) minors (Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring), and over a commutative ring (xIA)adj(xIA)=det(xIA)I (For every positive-sized square matrix over a commutative ring, Aadj(A)=adj(A)A=det(A)I).

[L4]

Matrix representation is injective and sends sums and scalar multiples to matrix operations (T[T]BC is a vector-space isomorphism L(V,W)Mm×n(F)) and composition to matrix multiplication ([ST]BD=[S]CD[T]BC).

Proof

technique · direct coefficient comparison
1.1

If dimV=0, [L1] gives χT=1, while IV=0V is the unique endomorphism of the zero space; hence χT(T)=IV=0V.

L1algebra
1.2

Suppose n=dimV1, choose a basis, and put A=[T]. Each entry of adj(xIA) has degree at most n1 by [L2], so write adj(xIA)=j=0n1Bjxj; also write χA(x)=k=0nckxk, where cn=1.

L1L2choosealgebra
2.1

Expanding the adjugate identity [L2] and comparing coefficients using [L3] gives AB0=c0I, Bk1ABk=ckI for 1k<n, and Bn1=I.

step 1.2L2L3algebra
3.1

Multiply the equation indexed by k on the left by Ak, include the first equation at k=0 and the last identity at k=n, and add. The AkBk1 terms telescope against the AkBk1 terms of the preceding recurrence, leaving k=0nckAk=0.

step 2.1algebra
4.1

By [L1] and [L4], the left side of step 3.1 is the representing matrix of χT(T); injectivity of matrix representation therefore gives χT(T)=0.

step 3.1L1L4
5.1

Steps 1.1 and 4.1 prove Cayley-Hamilton in every finite dimension without treating substitution into a matrix-coefficient polynomial as a ring homomorphism.

step 1.1step 4.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 66 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources