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 by the PID-module structure theorem
Statement
For every endomorphism of a finite-dimensional vector space, its characteristic polynomial annihilates it:
Facts & Assumptions
Given: The minimal polynomial satisfies by The annihilator set ; once existence is proved, its unique monic generator is the minimal polynomial.
On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial (On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial).
The product of the invariant factors is the characteristic polynomial (The product of the invariant factors is the characteristic polynomial).
Proof
On a nonzero space, [L1] and [L2] show that , the largest factor, divides the product ; write . On the zero space, and the identity endomorphism equals the zero endomorphism because there is only one map from the zero space to itself.
Evaluating the factorization from step 1.1 gives . The zero endomorphism and one-dimensional spaces are included.
Remarks
This is the module-theoretic route to Cayley-Hamilton. The published proof Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, instead uses the adjugate identity for the polynomial matrix .
Depends on
- On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial
- The product of the invariant factors is the characteristic polynomial
- The annihilator set $\operatorname{Ann}(T)=\{p\in F[x]:p(T)=0\}$; once existence is proved, its unique monic generator $\mu_T$ is the minimal polynomial
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- A. Apisa, Wisconsin Math 542, Corollary 35 (standard reference, not scraped)