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.
is monic of degree ; for its coefficient is and its constant coefficient is , while
Statement
For , the polynomial is monic of degree . If , the coefficient of is and the constant coefficient is . For , .
Facts & Assumptions
Given: A matrix .
For , ; for , it is (For , the characteristic polynomial is when , with for the unique matrix).
The trace of is (The trace as the sum of the diagonal entries).
The degree of a nonzero polynomial is the largest index of a nonzero coefficient, its leading coefficient is the coefficient at that index, and it is monic when that leading coefficient is (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
Proof
If , [L1] gives , which is monic of degree ; the additional coefficient assertions are restricted to .
Assume . In [L2] for , the identity permutation contributes . Every nonidentity permutation moves at least two indices, so its term contains at most diagonal factors and has degree at most .
Evaluating at gives the constant coefficient directly from [L2].
Hence the coefficient of is , the coefficient of comes only from the identity term and is , and there are no terms of degree above . Thus is monic of degree .
Steps 1.1–2.1 establish every asserted dimension and coefficient case.
Depends on
- 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
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- The trace $\operatorname{tr}(A)$ as the sum of the diagonal entries
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
Used by
- Every endomorphism of a nonzero finite-dimensional vector space over an algebraically closed field has an eigenvalue Corollary
- The inverse of an invertible finite-dimensional endomorphism is a polynomial in that endomorphism Corollary
- A companion operator with a visible cyclic vector and equal canonical polynomials Example
- A cyclic vector exists exactly when the minimal and characteristic polynomials agree Theorem
- An endomorphism is diagonalisable if and only if its characteristic polynomial splits and every eigenvalue's geometric multiplicity equals its algebraic multiplicity Theorem
- Characterisations of a nilpotent endomorphism Theorem
- Every finite cyclic extension has a normal basis Theorem
- If χ_T(x)=∏_i<n(x-λᵢ) in F[x], then det(T)=∏_i<nλᵢ: determinant is the product of the eigenvalues counted with algebraic multiplicity Theorem
- If χ_T(x)=∏_i<n(x-λᵢ) in F[x], then tr(T)=∑_i<nλᵢ: trace is the sum of the eigenvalues counted with algebraic multiplicity Theorem
- The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μ_T∣ p Theorem
Dependency tree · two levels
17 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
- H. Pinkham, Linear Algebra, §12.1 (standard reference, not scraped)
- M. Khovanov, Linear Algebra II notes, §6 (standard reference, not scraped)