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.
Computing the minimal polynomial of an explicit idempotent from its annihilating polynomials
Example
For
one has , , and . Thus is projection onto its image along its kernel.
Facts & Assumptions
Given: The displayed matrix .
An annihilating polynomial is exactly a multiple of the minimal polynomial (The annihilator ideal is nonzero and has a unique monic generator; if and only if ).
Every idempotent endomorphism of a finite-dimensional space is diagonalisable and projects onto its image along its kernel (Every idempotent endomorphism is diagonalisable and is projection onto its image along its kernel).
The characteristic polynomial is (For , the characteristic polynomial is when , with for the unique matrix).
Verification
Direct multiplication gives , while and . Thus annihilates but neither nor does; [L1] gives .
Expanding gives by [L3]. Finally [L2] identifies the image-kernel projection.
Depends on
- The annihilator ideal is nonzero and has a unique monic generator; $p(T)=0$ if and only if $\mu_T\mid p$
- Every idempotent endomorphism is diagonalisable and is projection onto its image along its kernel
- For $A\in M_n(F)$, the characteristic polynomial is $\chi_A(x)=\det(xI_n-A)$ when $n\geq1$, with $\chi_A(x)=1$ for the unique $0\times0$ matrix
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 60 results over 16 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
- Keith Conrad, The Minimal Polynomial and Some Applications, Examples 4.6, 4.9, and 4.16 (standard reference, not scraped)