Eigenvectors and Eigenvalues
Definition
A complex and a vector is an eigenvalue and eigenvector of a matrix if
We also say that is an eigenvector of corresponding to the eigenvalue .
Note: that cannot be the zero vector
Arising from the note above, we find that there are two cases for :
- If , then , meaning that is in the null space of .
- If , then is in the column space of .
Geometric Interpretation
As matrices are linear transformations which simply transform some vector into a new vector . We note that an eigenvector is some special vector that, when transformed by the matrix simply results in a scaled version of itself. The scaling factor is the eigenvalue.
Connection to Characteristic Equation
In general,
can be rewritten as
This equation is the precursor to the characteristic equation.
Existence
Not all matrices have eigenvalues and eigenvectors. A matrix has an eigenvalue iff the equation
has a non-trivial solution. Which also translates to, if does not have full rank. Meaning:
This is the characteristic equation.
Examples
Example 1
Let be the matrix
Is an eigenvalue of ?
Human: this also means, is there a vector such that the below equation is satisfied?
This creates the linear system
constructing an augmented matrix gives
Reassigning free variables, we let , then: and
Therefore, any scalar multiple of is an eigenvector for the eigenvalue .
Example 2
let:
This result is specific to this vector.
Contrary, let:
which is not a multiple of
Example 3
given is an eigenvalue of , find a basis for the corresponding eigenspace.
wow! All rows are the same, who could’ve predicted this !!
using this equation, we can construct the augmented matrix and row reduction.
This matrix has 2 free variables and only 1 Pivot Position. Now, we let: and,
Therefore,
form a basis for the eigenspace of for .