Eigenvalues and eigenvectors/Introduction/Section

For a reflection at an axis in the plane, certain vectors behave particularly simply. The vectors on the axis are sent to themselves, and the vectors which are orthogonal to the axis are sent to their negatives. For all these vectors, the image under this linear mapping lies on the line spanned by these vectors. In the theory of eigenvalues and eigenvectors, we want to know whether, for a given linear mapping, there exist lines (one-dimensional linear subspaces), which are mapped to themselves. The goal is to find, for the linear mapping, a basis such that the describing matrix is quite simple. Here, an important application is to find solutions for a system of linear differential equations.

A reflection at an axis has two eigenlines, the axis with eigenvalue ${}1$ and the orthogonal line with eigenvalue ${}-1$.

Definition

Let ${}K$ be a field, ${}V$ a ${}K$-vector space and

$\varphi \colon V\longrightarrow V$

a linear mapping. Then an element ${}v\in V$, ${}v\neq 0$, is called an eigenvector of ${}\varphi$ (for the eigenvalue ${}\lambda$), if

${}\varphi (v)=\lambda v\,$

for some ${}\lambda \in K$

holds.

A shear mapping has one eigenline for the eigenvalue ${}1$, and no further eigenvalues.

Definition

Let ${}K$ be a field, ${}V$ a ${}K$-vector space and

$\varphi \colon V\longrightarrow V$

a linear mapping. Then an element ${}\lambda \in K$ is called an eigenvalue for ${}\varphi$, if there exists a vector ${}v\in V$, ${}v\neq 0$ such that

${}\varphi (v)=\lambda v\,.$

Definition

Let ${}K$ be a field, ${}V$ a ${}K$-vector space and

$\varphi \colon V\longrightarrow V$

a linear mapping. For ${}\lambda \in K$, we denote by

Failed to parse (syntax error): {\displaystyle {{}} \operatorname{Eig}_{ \lambda } { \left( \varphi \right) } := { \left\{ v \in V \mid \varphi(v) <table class="metadata plainlinks ambox ambox-notice" style=""> <tr> <td class="mbox-image"><div style="width: 52px;"> [[File:Wikiversity logo 2017.svg|50px|link=]]</div></td> <td class="mbox-text" style=""> '''[[m:Soft redirect|Soft redirect]]'''<br />This page can be found at <span id="SoftRedirect">[[mw:Help:Magic words#Other]]</span>. </td> </tr> </table>[[Category:Wikiversity soft redirects|Eigenvalues and eigenvectors/Introduction/Section]] __NOINDEX__ \lambda v \right\} } \, }

the eigenspace of ${}\varphi$ for the value ${}\lambda$.

Thus we allow arbitrary values (not only eigenvalues) in the definition of an eigenspace. The ${}0$ belongs to every eigenspace, though it is never an eigenvector. The linear subspace generated by an eigenvector is called an eigenline. We consider some easy examples over ${}\mathbb {R}$.

Example

A linear mapping from ${}\mathbb {R}$ to ${}\mathbb {R}$ is the multiplication with a fixed number ${}a\in \mathbb {R}$ (the proportionality factor). Therefore, every number ${}v\neq 0$ is an eigenvector for the eigenvalue ${}a$, and the eigenspace for this eigenvalue is the whole ${}\mathbb {R}$. Beside ${}a$, there are no other eigenvalues, and all eigenspaces for ${}\lambda \neq a$ are ${}0$.

Example

A linear mapping from ${}\mathbb {R} ^{2}$ to ${}\mathbb {R} ^{2}$ is described by a ${}2\times 2$-matrix with respect to the standard basis. We consider the eigenvalues for some elementary examples. A homothety is given as ${}v\mapsto av$, with a scaling factor ${}a\in \mathbb {R}$. Every vector ${}v\neq 0$ is an eigenvector for the eigenvalue ${}a$, and the eigenspace for this eigenvalue is the whole ${}\mathbb {R} ^{2}$. Beside ${}a$, there are no other eigenvalues, and all eigenspaces for ${}\lambda \neq a$ are ${}0$. The identity only has the eigenvalue ${}1$.

The reflection at the ${}x$-axis is described by the matrix ${}{\begin{pmatrix}1&0\\0&-1\end{pmatrix}}$. The eigenspace for the eigenvalue ${}1$ is the ${}x$-axis, the eigenspace for the eigenvalue ${}-1$ is the ${}y$-axis. A vector ${}(s,t)$ with ${}s,t\neq 0$ is not an eigenvector, since the equation

${}(s,-t)=\lambda (s,t)\,$

does not have a solution.

A plane rotation is described by a rotation matrix ${}{\begin{pmatrix}\operatorname {cos} \,\alpha &-\operatorname {sin} \,\alpha \\\operatorname {sin} \,\alpha &\operatorname {cos} \,\alpha \end{pmatrix}}$ for the rotation angle ${}\alpha$, ${}0\leq \alpha <2\pi$ For ${}\alpha =0$, this is the identity, for ${}\alpha =\pi$, this is a half rotation, which is the reflection at the origin or the homothety with factor ${}-1$. For all other rotation angles, there is no line sent to itself, so that these rotations have no eigenvalue and no eigenvector (and all eigenspaces are ${}0$).

Lemma

Let ${}K$ be a field, ${}V$ a ${}K$-vector space and

$\varphi \colon V\longrightarrow V$

a

linear mapping. Then the following statements hold.

1. Every eigenspace

   $\operatorname {Eig} _{\lambda }{\left(\varphi \right)}$

   is a linear subspace of ${}V$.

2. ${}\lambda$ is an eigenvalue for ${}\varphi$, if and only if the eigenspace ${}\operatorname {Eig} _{\lambda }{\left(\varphi \right)}$ is not the nullspace.
3. A vector ${}v\in V,\,v\neq 0$, is an eigenvector for ${}\lambda$, if and only if ${}v\in \operatorname {Eig} _{\lambda }{\left(\varphi \right)}$.

Proof

See exercise.

$\Box$

For matrices, we use the same concepts. If ${}\varphi \colon V\rightarrow V$ is a linear mapping, and ${}M$ is a describing matrix with respect to a basis, then for an eigenvalue ${}\lambda$ and an eigenvector ${}v\in V$ with corresponding coordinate tuple ${}{\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}$ with respect to the basis, we have the relation

${}M{\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}=\lambda {\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}\,.$

The describing matrix ${}N$ with respect to another basis satisfies, due to

the relation ${}N=BMB^{-1}$, where ${}B$ is an invertible matrix. Let

${}{\begin{pmatrix}x'_{1}\\\vdots \\x'_{n}\end{pmatrix}}=B{\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}\,$

denote the coordinate tuple with respect to the second basis. Then

${}{\begin{aligned}N{\begin{pmatrix}x'_{1}\\\vdots \\x'_{n}\end{pmatrix}}&=(BMB^{-1}){\begin{pmatrix}x'_{1}\\\vdots \\x'_{n}\end{pmatrix}}\\&=(BMB^{-1})B{\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}\\&=BM{\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}\\&=B\lambda {\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}\\&=\lambda B{\begin{pmatrix}x_{1}\\\vdots \\x_{n}\end{pmatrix}}\\&=\lambda {\begin{pmatrix}x'_{1}\\\vdots \\x'_{n}\end{pmatrix}},\end{aligned}}$

i.e., the describing matrices have the same eigenvalues, but the coordinate tuples for the eigenvectors are different.

Example

We consider the linear mapping

$\varphi \colon K^{n}\longrightarrow K^{n},e_{i}\longmapsto d_{i}e_{i},$

given by the diagonal matrix

${\begin{pmatrix}d_{1}&0&\cdots &\cdots &0\\0&d_{2}&0&\cdots &0\\\vdots &\ddots &\ddots &\ddots &\vdots \\0&\cdots &0&d_{n-1}&0\\0&\cdots &\cdots &0&d_{n}\end{pmatrix}}.$

The diagonal entries ${}d_{i}$ are the eigenvalues of ${}\varphi$, and the ${}i$-th standard vector ${}e_{i}$ is a corresponding eigenvector. The eigenspaces are

Failed to parse (unknown function "\begin{align}"): {\displaystyle {{}} \begin{align} \operatorname{Eig}_{ d } { \left( \varphi \right) } & = { \left\{ v \in K^n \mid v \text{ is a linear combination of those } e_i, \text{ for which } d <table class="metadata plainlinks ambox ambox-notice" style=""> <tr> <td class="mbox-image"><div style="width: 52px;"> [[File:Wikiversity logo 2017.svg|50px|link=]]</div></td> <td class="mbox-text" style=""> '''[[m:Soft redirect|Soft redirect]]'''<br />This page can be found at <span id="SoftRedirect">[[mw:Help:Magic words#Other]]</span>. </td> </tr> </table>[[Category:Wikiversity soft redirects|Eigenvalues and eigenvectors/Introduction/Section]] __NOINDEX__ d_i \text{ holds} \right\} } \\ \end{align} }

These spaces are not ${}0$ if and only if ${}d$ equals one of the diagonal entries. The dimension of the eigenspace ${}\operatorname {Eig} _{d}{\left(\varphi \right)}$ is given by the number how often the value ${}d$ occurs in the diagonal. The sum of all these dimension gives ${}n$.

Example

For an orthogonal reflection of ${}\mathbb {R} ^{n}$, there exists an ${}(n-1)$-dimensional linear subspace ${}U\subseteq \mathbb {R} ^{n}$, which is fixed by the mapping and every vector orthogonal to ${}U$ is sent to its negative. If ${}v_{1},\ldots ,v_{n-1}$ is a basis of ${}U$ and ${}v_{n}$ is a vector orthogonal to ${}U$, then the reflection is described by the matrix

${\begin{pmatrix}1&0&\cdots &\cdots &0\\0&1&0&\cdots &0\\\vdots &\ddots &\ddots &\ddots &\vdots \\0&\cdots &0&1&0\\0&\cdots &\cdots &0&-1\end{pmatrix}}$

with respect to this basis.

Example

We consider the linear mapping

$\varphi \colon \mathbb {Q} ^{2}\longrightarrow \mathbb {Q} ^{2},{\begin{pmatrix}x\\y\end{pmatrix}}\longmapsto {\begin{pmatrix}0&5\\1&0\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}={\begin{pmatrix}5y\\x\end{pmatrix}},$

given by the matrix

${}M={\begin{pmatrix}0&5\\1&0\end{pmatrix}}\,.$

The question whether this mapping has eigenvalues, leads to the question whether there exists some ${}\lambda \in \mathbb {Q}$, such that the equation

${}{\begin{pmatrix}0&5\\1&0\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}=\lambda {\begin{pmatrix}x\\y\end{pmatrix}}\,$

has a nontrivial solution ${}(x,y)\neq (0,0)$. For a given ${}\lambda$, this is a linear problem and can be solved with the elimination algorithm. However, the question whether there exist eigenvalues at all, leads, due to the variable "eigenvalue parameter“ ${}\lambda$, to a nonlinear problem. The system of equations above is

$5y=\lambda x{\text{ and }}x=\lambda y.$

For ${}y=0$, we get ${}x=0$, but the nullvector is not an eigenvector. Hence, suppose that ${}y\neq 0$. Both equations combined yield the condition

${}5y=\lambda x=\lambda ^{2}y\,,$

hence ${}5=\lambda ^{2}$. But in ${}\mathbb {Q}$, the number ${}5$ does not have a square root, therefore there is no solution, and that means that ${}\varphi$ has no eigenvalues and no eigenvectors.

Now we consider the matrix ${}M$ as a real matrix, and look at the corresponding mapping

$\psi \colon \mathbb {R} ^{2}\longrightarrow \mathbb {R} ^{2},{\begin{pmatrix}x\\y\end{pmatrix}}\longmapsto {\begin{pmatrix}0&5\\1&0\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}={\begin{pmatrix}5y\\x\end{pmatrix}}.$

The same computations as above lead to the condition ${}5=\lambda ^{2}$, and within the real numbers, we have the two solutions

$\lambda _{1}={\sqrt {5}}\,\,{\text{ and }}\,\,\lambda _{2}=-{\sqrt {5}}.$

For both values, we have now to find the eigenvectors. First, we consider the case ${}\lambda ={\sqrt {5}}$, which yields the linear system

${}{\begin{pmatrix}0&5\\1&0\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}={\sqrt {5}}{\begin{pmatrix}x\\y\end{pmatrix}}\,.$

We write this as

${}{\begin{pmatrix}0&5\\1&0\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}={\begin{pmatrix}{\sqrt {5}}&0\\0&{\sqrt {5}}\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}\,$

and as

${}{\begin{pmatrix}{\sqrt {5}}&-5\\-1&{\sqrt {5}}\end{pmatrix}}{\begin{pmatrix}x\\y\end{pmatrix}}={\begin{pmatrix}0\\0\end{pmatrix}}\,.$

This system can be solved easily, the solution space has dimension one, and

${}v={\begin{pmatrix}{\sqrt {5}}\\1\end{pmatrix}}\,$

is a basic solution.

For ${}\lambda =-{\sqrt {5}}$, we do the same steps, and the vector

${}w={\begin{pmatrix}-{\sqrt {5}}\\1\end{pmatrix}}\,$

is a basic solution. Thus over ${}\mathbb {R}$, the numbers ${}{\sqrt {5}}$ and ${}-{\sqrt {5}}$ are eigenvalues, and the corresponding eigenspaces are

$\operatorname {Eig} _{\sqrt {5}}{\left(\psi \right)}={\left\{s{\begin{pmatrix}{\sqrt {5}}\\1\end{pmatrix}}\mid s\in \mathbb {R} \right\}}\,\,{\text{ and }}\,\,\operatorname {Eig} _{-{\sqrt {5}}}{\left(\psi \right)}={\left\{s{\begin{pmatrix}-{\sqrt {5}}\\1\end{pmatrix}}\mid s\in \mathbb {R} \right\}}.$