Eigenvectors and Eigenvalues Flashcards
Eigenvalue
Definition
-a scalar λ∈F is an eigenvalue for T is there exists a non-zero vector v∈V such that:
T(v) = λv
Eigenvector
Definition
-a vector v∈V is an Eigen vector for T if for some λ∈F we have:
T(v) = λv
Eigenspace
Definition
-if λ∈F the λ-eigenspace of T is; Vλ = {v | T(v) = λv} = {v∈V | T(v) = λI(v)} = {v∈V | (T-λI)v = 0 } = ker (T - λI) -hence Vλ is a subspace of V (since it is the kernel of a linear map)
Eigenvalue and Eigenspace Lemma
λ is an eigenvalue of T:V->V
<=>
Vλ ≠ {|0}
Eigenvector
Matrix Definition
-let A be an nxn matrix
-a column vector v∈F^n is called an eigenvector of A if for some λ∈F :
Av = λv , i.e. if (A-λI)v=0
Eigenvalue
Matrix Definition
λ∈F is an eigenvalue of A if a non-zero column vector v∈F^n exists with:
Av = λv
Eigenspace
Matrix Definition
-if λ∈F, the eigenspace Vλ of λ is the null space of A-λI i.e. :
Vλ = {v∈F^n | Av = λv } = {v∈F^n | (A-λI)v = 0}
Characteristic Polynomial
Definition
-the characteristic polynomial of an nxn matrix A is;
X(t) = det (A-tI)
= (-1)^n t^n + Cn-1t^(n-1) + … + C1t + Co
-X(t) is a polynomial of degree n
-an equivalent convention is X(t) = det (tI-A), they only differ by a factor of -1 so have the same roots
How to find the characteristic polynomial of a matrix?
1) recall, X(t) = det (A-tI) and sub in
2) find the determinant
3) simplify to a polynomial of degree n (where A is an nxn matrix)
Characteristic Polynomial and Eigenvalues Theorem
-let A be a square matrix with entries in F
-the eigenvalues of F are the roots of its characteristic polynomial i.e.
λ is an eigenvalue of A <=> Xa(λ)=0
Proof:
λ is an eigenvalue of A <=> Av = λv for some non-zero v
<=> (A-λI)v=0
<=> the matrix A-λI is not invertible (i.e. is singular)
<=> det(A-λI) = 0
<=> Xa(λ)=0
Geometric Multiplicity
Definition
- let λ be an Eigen value of nxn matrix A with entries in F, then there exists a column vector v∈F^n such that Av = λv , so (A-λI)v=0
- the geometric multiplicity of λ is the dimension of the λ-eigenspace of A = dim {v∈F^n | (A-λI)v=0}
Algebraic Multiplicity
Definition
- let λ be an Eigen value of nxn matrix A with entries in F, then there exists a column vector v∈F^n such that Av = λv , so (A-λI)v=0
- the algebraic multiplicity of λ is the multiplicity of λ as a root of the characteristic polynomial Xa(t), i.e. the number of times it is repeated as a root of the characteristic polynomial
How to find the eigenvalues and eigenvectors of a matrix A?
1) find the characteristic polynomial using the equation det(A-λI) = 0
2) the roots of this equation are the eigenvalues
3) one at a time substitute each eigenvalue into the equation (A-λI)v=0 to find the corresponding eigenvector for each eigenvalue
How to find algebraic and geometric multiplicity?
1) find the eigenvalues and eigenvectors
2) the number of time each eigenvalue is repeated as a root of the characteristic polynomial is its geometric multiplicity
3) write the eigenvector of each eigenvalue as a span and then find the dimension, this is the algebraic multiplicity
Diagonalisable
Definition
- a matrix A is diagonalisable if it is similar to a diagonal matrix i.e. A is diagonalisable if there exists a non-singular (invertible) matrix P such that P^(-1) A P = Λ with Λ diagonal
- where the columns of P correspond to the eigenvectors of the eigenvalues that form the diagonal of Λ, i.e. the nth column of P is the eigenvector that corresponds to the eigenvalue in the nth column of Λ