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.
For a finite-dimensional space, is an eigenvalue of if and only if is not invertible
Statement
Let be an endomorphism of a finite-dimensional vector space over , and let . Then is an eigenvalue of if and only if is not invertible.
Facts & Assumptions
Given: A finite-dimensional -vector space , an endomorphism of , and .
The scalar is an eigenvalue of exactly when (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
A linear map is injective if and only if its kernel is (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial).
For a linear map with finite-dimensional, (Rank-nullity: ). A subspace of has dimension if and only if it is all of (If and is a linear subspace of , then is finite-dimensional, , and if and only if , clause 2).
An invertible linear map has a two-sided linear inverse, and hence is bijective (Invertible linear maps, linear isomorphisms, and inverse linear maps).
Proof
If is an eigenvalue, [L1] and [L2] show that is not injective; it therefore cannot be invertible by [L4].
Conversely, suppose is not an eigenvalue. Then [L1] and [L2] make injective, so . By [L3], , hence and is bijective. Its inverse function is linear: applying to and to gives in both cases, and injectivity makes the two inputs equal. Thus is invertible; contraposition gives that noninvertibility forces to be an eigenvalue.
The two implications establish the equivalence. If , [L1] makes the left side false and the unique endomorphism is the identity, so the same argument includes that case.
Depends on
- Eigenvalues, eigenvectors, eigenspaces $E_\lambda(T)=\ker(T-\lambda I)$, and the spectrum $\sigma_F(T)$ of an endomorphism
- The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}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$
- Invertible linear maps, linear isomorphisms, and inverse linear maps
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 80 results over 24 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.1 (standard reference, not scraped)
- M. Khovanov, Linear Algebra II notes, §6 (standard reference, not scraped)