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.
An endomorphism is diagonalisable exactly when for some finite list of distinct scalars
Statement
An endomorphism of a finite-dimensional -vector space is diagonalisable if and only if there are distinct scalars such that
For , take the empty list of scalars.
Facts & Assumptions
Given: A finite-dimensional endomorphism .
Diagonalisability means that has a basis of eigenvectors (A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation).
An eigenspace is (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
means together with for every (Internal direct sum : the sum is everything and each summand meets the sum of the others only in ).
Every subspace of a finite-dimensional vector space is finite-dimensional and has a basis (If and is a linear subspace of , then is finite-dimensional, , and if and only if ).
Proof
Suppose is diagonalisable and fix an eigenbasis. Only finitely many eigenvalues occur among its finitely many vectors; group the basis vectors by those distinct eigenvalues. If is expanded in the eigenbasis, comparing the coefficients in forces every coefficient at a basis vector with eigenvalue different from to vanish. Thus the group carrying is a basis of . The groups exhaust the eigenbasis, so the eigenspaces sum to ; and a nonzero lying in the sum of the other eigenspaces would have one eigenbasis expansion supported on the -group and another supported off it, contradicting uniqueness of coordinates in a basis. Both conditions of [L3] therefore hold.
Conversely, suppose the displayed direct sum holds. Choose a basis of each eigenspace using [L4] and concatenate the finite lists. The first condition of [L3] makes the concatenation spanning. It is independent: in a vanishing combination, group the terms by eigenspace, so each group sums to a vector of its and one such vector equals minus the sum of the others; the second condition of [L3] forces every group to sum to , and independence inside each chosen basis then kills every coefficient. So it is a basis of eigenvectors and [L1] makes diagonalisable.
The two constructions prove both implications. When , the empty basis and empty direct sum satisfy them.
Depends on
- A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation
- Eigenvalues, eigenvectors, eigenspaces $E_\lambda(T)=\ker(T-\lambda I)$, and the spectrum $\sigma_F(T)$ of an endomorphism
- Internal direct sum $V = \bigoplus_{i<n} U_i$: the sum is everything and each summand meets the sum of the others only in $0_V$
- 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$
Used by
- Lagrange polynomials give the three eigenspace projections of a diagonalisable endomorphism Example
- A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise Theorem
- An endomorphism is diagonalisable if and only if its characteristic polynomial splits and every eigenvalue's geometric multiplicity equals its algebraic multiplicity Theorem
- An endomorphism is diagonalisable if and only if its minimal polynomial is a product of distinct linear factors Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 71 results over 21 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
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §5D (standard reference, not scraped)