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.
If in , then for every : the eigenvalues of are , counted with algebraic multiplicity
Statement
Let act on an -dimensional -vector space and suppose
For every ,
Consequently the eigenvalues of are the values , counted with the combined algebraic multiplicities shown by this product.
Facts & Assumptions
Given: , the displayed split factorization of , and .
Polynomial evaluation is (Polynomial evaluation at an endomorphism: ). Matrix representation sends sums and scalar multiples to matrix sums and scalar multiples ( is a vector-space isomorphism ) and composites to matrix products ().
The characteristic polynomial of an operator is computed in any basis and is in dimension zero (The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero).
Roots of are exactly eigenvalues (For every finite-dimensional space, is exactly the set of roots in of ).
An independent subset of a finite-dimensional space extends without Choice to a basis (If and is a linear subspace of , then is finite-dimensional, , and if and only if , clause 3), whose representing matrix records the coordinate columns of the images (Coordinate columns and matrices of linear maps relative to ordered bases).
A block-triangular characteristic polynomial is the product of the characteristic polynomials of its diagonal blocks (The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks).
The ring is a unique factorisation domain, hence an integral domain and admits cancellation of nonzero polynomials (For every field , is a unique factorisation domain).
Algebraic multiplicity is the exponent of a root's linear factor in the characteristic polynomial (Algebraic multiplicity as the exponent of in , and geometric multiplicity as ).
Proof
If , both sides are the empty product by [L2].
Assume and the result in dimension . The factor shows that is a root of , so [L3] supplies a nonzero eigenvector . Extend by [L4] to a basis. In that basis [L4] gives .
By [L5], . Comparing with the given factorization and cancelling in the domain [L6] gives .
Powers, linear combinations, and [L1] preserve this block upper-triangular shape, so . The induction hypothesis applied to and step 2.1 gives .
Applying [L5] to step 3.1 yields .
The base case and induction step prove the polynomial identity for every finite dimension. By [L3] and [L7], its roots are the eigenvalues of and repeated equal values acquire their combined algebraic multiplicity.
Depends on
- Polynomial evaluation at an endomorphism: $p(T)=\sum_k a_kT^k$
- The basis-independent characteristic polynomial $\chi_T$ of an endomorphism of a finite-dimensional space, including $\chi_T=1$ in dimension zero
- For every finite-dimensional space, $\sigma_F(T)$ is exactly the set of roots in $F$ of $\chi_T$
- The characteristic polynomial of a block upper- or lower-triangular matrix is the product of the characteristic polynomials of its diagonal blocks
- Algebraic multiplicity as the exponent of $x-\lambda$ in $\chi_T$, and geometric multiplicity as $\dim E_\lambda(T)$
- If $\dim_F V = n$ and $U$ is a linear subspace of $V$, then $U$ is finite-dimensional, $\dim_F U \le n$, and $\dim_F U = n$ if and only if $U = V$
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- $[S\circ T]_{\mathcal B}^{\mathcal D}=[S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C}$
- $T\mapsto[T]_{\mathcal B}^{\mathcal C}$ is a vector-space isomorphism $\mathcal L(V,W)\cong M_{m\times n}(F)$
- For every field $F$, $F[x]$ is a unique factorisation domain
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 129 results over 25 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
- H. Pinkham, Linear Algebra, §12.3.3 (standard reference, not scraped)