ℹ️ Skipped - page is already crawled
| Filter | Status | Condition | Details |
|---|---|---|---|
| HTTP status | PASS | download_http_code = 200 | HTTP 200 |
| Age cutoff | PASS | download_stamp > now() - 6 MONTH | 0 months ago |
| History drop | PASS | isNull(history_drop_reason) | No drop reason |
| Spam/ban | PASS | fh_dont_index != 1 AND ml_spam_score = 0 | ml_spam_score=0 |
| Canonical | PASS | meta_canonical IS NULL OR = '' OR = src_unparsed | Not set |
| Property | Value |
|---|---|
| URL | https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/ |
| Last Crawled | 2026-04-12 03:00:35 (1 day ago) |
| First Indexed | 2021-03-15 23:43:42 (5 years ago) |
| HTTP Status Code | 200 |
| Meta Title | Real eigenvalues and eigenvectors of 3x3 matrices, example 3 | OpenCurve |
| Meta Description | null |
| Meta Canonical | null |
| Boilerpipe Text | In these examples, the eigenvalues of matrices will turn out to be real values. In other words, the eigenvalues and eigenvectors are in $\mathbb{R}^n$.
Download PDF
Suppose, we have the following matrix:
\begin{equation*}
\mathbf{A}=
\begin{pmatrix}
\phantom{-}5 & 2 & 0 \\
\phantom{-}2 & 5 & 0 \\
-3 & 4 & 6
\end{pmatrix}.
\end{equation*}
The objective is to find the eigenvalues and the corresponding eigenvectors.
1. Characteristic equation
Firstly, formulate the characteristic equation and solve it. The solutions are the eigenvalues of matrix $ \mathbf{A} $.
If $ \mathbf{I} $ is the identity matrix of $ \mathbf{A} $ and $ \lambda $ is the unknown eigenvalue (represent the unknown eigenvalues), then the characteristic equation is
\begin{equation*}
\det(\mathbf{A}-\lambda \mathbf{I})=0.
\end{equation*}
Written in matrix form, we get
\begin{equation} \label{eq:characteristic1}
\begin{vmatrix}
\phantom{-}5-\lambda & 2 & 0 \\
\phantom{-}2 & 5-\lambda & 0 \\
-3 & 4 & 6-\lambda
\end{vmatrix}
=0.
\end{equation}
Choose the row or column which are easiest to use to find the determinant of the matrix in equation \eqref{eq:characteristic1}. In other words, in this case, we will go down the last column as it contains the most zeros. This will decrease the length of the characteristic equation considerably:
\begin{align*}
&0\begin{vmatrix}\phantom{-}2 & 5-\lambda \\ -3 & 4 \end{vmatrix} \\
&\quad – 0\begin{vmatrix}5-\lambda & 2 \\ -3 & 4 \end{vmatrix} \\
&\qquad+ (6-\lambda)\begin{vmatrix}5-\lambda & 2 \\ 2 & 5-\lambda \end{vmatrix} = 0,
\end{align*}
and so
\begin{equation}
(6-\lambda)\begin{vmatrix}5-\lambda & 2 \\ 2 & 5-\lambda \end{vmatrix} = 0.
\end{equation}
Simplifying further, gives
\begin{align*}
(6-\lambda)[(5-\lambda)(5-\lambda)-2^2] &= 0, \\
(6-\lambda)[25-5\lambda-5\lambda+\lambda^2-4] &= 0, \\
(6-\lambda)[\lambda^2-10\lambda+21] &= 0,
\end{align*}
enabling us to write a manageable form of the characteristic equation:
\begin{equation}
(6-\lambda)[(\lambda-3)(\lambda-7)] = 0,
\end{equation}
of which the solutions of $ \lambda $ are now apparent immediately:
\begin{equation}
\therefore \lambda = 6 \vee \lambda = 3 \vee \lambda = 7.
\end{equation}
Lastly, there are two ways to verify if the found values are correct. For instance, the sum of these values have to be equal to the trace of $\mathbf{A}$, which is the sum of the main diagonal of $\mathbf{A}$:
\begin{equation*}
\text{tr }\mathbf{A}=5+5+6=16.
\end{equation*}
And, indeed, the sum of the values of $\lambda$ is equal to 16 as well. We can also verify whether the product of the values of $\lambda$ is equal to $\det\mathbf{A}$:
\begin{align*}
\det\mathbf{A} &= 0\begin{vmatrix}\phantom{-}2&5\\-3&4\end{vmatrix} \\
&\qquad -0\begin{vmatrix}\phantom{-}5&2\\-3&4\end{vmatrix} \\
&\qquad\quad +6\begin{vmatrix}5&2\\2&5\end{vmatrix} \\
&= 6\begin{vmatrix}5&2\\2&5\end{vmatrix} \\
&= 6(5^2-2^2) \\
&= 126.
\end{align*}
And, indeed, the product of the values of $\lambda$ is equal to $6\cdot3\cdot7=126$.
2. Specify the eigenvalues
The eigenvalues of matrix $ \mathbf{A} $ are thus $ \lambda = 6 $, $ \lambda = 3 $, and $ \lambda = 7$.
3. Eigenvector equations
We rewrite the characteristic equation in matrix form to a system of three linear equations. As it is intended to find one or more eigenvectors $ \mathbf{v} $, let
\begin{equation} \label{eq:v01}
\mathbf{v} =
\begin{pmatrix}
x_1 \\
x_2 \\
x_3
\end{pmatrix}
\end{equation}
and
\begin{equation}
(\mathbf{A}-\lambda\mathbf{I})\mathbf{v}=\mathbf{0}.
\end{equation}
In which case, we can write
\begin{equation} \label{eq:A-lambda I times v = 0}
\begin{pmatrix}
\phantom{-}5-\lambda & 2 & 0 \\
\phantom{-}2 & 5-\lambda & 0 \\
-3 & 4 & 6-\lambda
\end{pmatrix}
\begin{pmatrix}
x_1 \\
x_2 \\
x_3
\end{pmatrix}
=
\mathbf{0},
\end{equation}
which we can then write as a system of linear equations:
\begin{equation*}
\left\{
\begin{matrix}
(5-\lambda)x_1 + 2x_2 + 0x_3 &= 0, \\
2x_1 + (5-\lambda)x_2 + 0x_3 &= 0, \\
-3x_1 + 4x_2 + (6-\lambda)x_3 &= 0.
\end{matrix}
\right.
\end{equation*}
Simplifying this further, we have obtained the following
eigenvector equations
:
\begin{equation} \label{eq:eigenvectorvergelijkingen01}
\left\{
\begin{matrix}
(5-\lambda)x_1 + 2x_2 &= 0, \\
2x_1 + (5-\lambda)x_2 &= 0, \\
3x_1 – 4x_2 – (6-\lambda)x_3 &= 0.
\end{matrix}
\right.
\end{equation}
4. Substitute every obtained eigenvalue $\boldsymbol{\lambda}$ into the eigenvector equations
4.1. Eigenvalue $ \boldsymbol{\lambda = 3} $
Let’s start with eigenvalue $ \lambda = 3 $. Substituting this into the eigenvector equations \eqref{eq:eigenvectorvergelijkingen01}, we get
\begin{align*}
(5-3)x_1 + 2x_2 &= 0, \\
2x_1 + (5-3)x_2 &= 0, \\
3x_1 – 4x_2 – (6-3)x_3 &= 0.
\end{align*}
We can simplify this to
\begin{align*}
2x_1 + 2x_2 &= 0, \\
2x_1 + 2x_2 &= 0, \\
3x_1 – 4x_2 – 3x_3 &= 0.
\end{align*}
The first equation and second equation reduce to $ x_1 = -x_2 $. Let’s substitute $ x_1 $ in the third equation.
\begin{align*}
3(-x_2) – 4x_2 – 3x_3 &= 0 \\
\therefore 7x_2 &= -3x_3.
\end{align*}
In other words, if $ x_2 = -3 $, then $ x_3 = 7 $, and $ x_1 = 3 $. And so, we can now fill in the values of $ \mathbf{v} $ in \eqref{eq:v01}:
\begin{equation}
\mathbf{v} =
\begin{pmatrix}
x_1 \\
x_2 \\
x_3
\end{pmatrix}
=
\begin{pmatrix}
\phantom{-}3 \\
-3 \\
\phantom{-}7
\end{pmatrix}.
\end{equation}
In other words, an eigenvector with eigenvalue $ \lambda = 3 $ is $ \begin{pmatrix}3 & -3 & 7\end{pmatrix}^T $. (Note: we deliberately write the words ‘an eigenvector’, as, for instance, the eigenvector $ \begin{pmatrix}54 & -54 & 126\end{pmatrix}^T $ is an eigenvector with this eigenvalue too. As long as $ x_1 = -x_2 $, and $ 7x_2 = -3x_3 $, in other words, as long as the ratios between $ x_1 $, $ x_2 $, and $ x_3 $ stay constant, it is
an
eigenvector of this eigenvalue. However, by convention we write the lowest possible integer values.)
We can check the validity of the eigenvector by calculating the inner product of $\mathbf{A}$ with the eigenvector. If all went well, the outcome will be equal to the inner product of the eigenvalue with the eigenvector, in other words, $ \mathbf{Av}=\lambda \mathbf{v} $. If we write this down in matrix notation (while, for clarity, simultaneously specifying which part is which variable), indeed, we get
\begin{align*}
& \underbrace{\begin{pmatrix}
\phantom{-}5 & 2 & 0 \\
\phantom{-}2 & 5 & 0 \\
-3 & 4 & 6
\end{pmatrix}}_{\mathbf{A}}
\underbrace{\begin{pmatrix}
\phantom{-}3 \\
-3 \\
\phantom{-}7
\end{pmatrix}}_{\mathbf{v}} \\
&=
\begin{pmatrix}
5\cdot3 + 2\cdot-3 + 0\cdot7 \\
2\cdot3 + 5\cdot-3 + 0\cdot7 \\
-3\cdot3 + 4\cdot-3 + 6\cdot7 \\
\end{pmatrix} \\
&=
\begin{pmatrix}
\phantom{-}9 \\
-9 \\
\phantom{-}21
\end{pmatrix}
=
\underbrace{3}_{\lambda}
\underbrace{
\begin{pmatrix}
\phantom{-}3 \\
-3 \\
\phantom{-}7
\end{pmatrix}}_{\mathbf{v}}.
\end{align*}
4.2. Eigenvalue $ \boldsymbol{\lambda = 6} $
In the same vein, we replace $ \lambda = 6 $ in the eigenvector equations of \eqref{eq:eigenvectorvergelijkingen01}. We then write the following three linear equations:
\begin{align*}
(5-6)x_1 + 2x_2 &= 0, \\
2x_1 + (5-6)x_2 &= 0, \\
3x_1 – 4x_2 – (6-6)x_3 &= 0.
\end{align*}
We can simplify further:
\begin{align*}
x_1 &= 2x_2, \\
2x_1 &= x_2, \\
3x_1 &= 4x_2.
\end{align*}
We see that $ x_1 = x_2 = 0 $ is the only solution to this system of simultaneous equations. As $ x_3 $ always multiplies by 0 (which is why it does not appear anymore in this system), $ x_3 $ can take any value. An eigenvector to eigenvalue $ \lambda = 6 $ is therefore simply $ \begin{pmatrix}0 & 0 & 1\end{pmatrix}^T $. Checking this using the inner product of matrix $\mathbf{A}$ with $ \begin{pmatrix}0 & 0 & 1\end{pmatrix}^T $, we get, indeed, $\lambda\mathbf{v}$:
\begin{align*}
&\begin{pmatrix}
\phantom{-}5 & 2 & 0 \\
\phantom{-}2 & 5 & 0 \\
-3 & 4 & 6
\end{pmatrix}
\begin{pmatrix}
0 \\
0 \\
1
\end{pmatrix} \\
&=
\begin{pmatrix}
\phantom{-}5\cdot0 + 2\cdot0 + 0\cdot1 \\
\phantom{-}2\cdot0 + 5\cdot0 + 0\cdot1 \\
-3\cdot0 + 4\cdot0 + 6\cdot1 \\
\end{pmatrix} \\
&=
\begin{pmatrix}
0 \\
0 \\
6
\end{pmatrix}
=
6
\begin{pmatrix}
0 \\
0 \\
1
\end{pmatrix}.
\end{align*}
4.3. Eigenvalue $ \boldsymbol{\lambda = 7} $
Substituting $\lambda=7$, yields
\begin{align*}
(5-7)x_1 + 2x_2 &= 0, \\
2x_1 + (5-7)x_2 &= 0, \\
3x_1 – 4x_2 – (6-7)x_3 &= 0.
\end{align*}
Working this further:
\begin{align*}
x_1 &= x_2, \\
x_1 &= x_2, \\
3x_1 – 4x_2 + x_3 &= 0.
\end{align*}
Substituting $ x_1 = x_2 $ into the third equation, we get
\begin{align*}
3x_2 – 4x_2 &= -x_3, \\
x_2 &= x_3.
\end{align*}
And so, we conclude
\begin{equation}
x_1 = x_2 = x_3.
\end{equation}
An eigenvector to the eigenvalue $\lambda=7$ is, thus, $\begin{pmatrix}1 & 1 & 1\end{pmatrix}^T$. Obviously, we can check this too:
\begin{align*}
&\begin{pmatrix}
\phantom{-}5 & 2 & 0 \\
\phantom{-}2 & 5 & 0 \\
-3 & 4 & 6
\end{pmatrix}
\begin{pmatrix}
1 \\
1 \\
1
\end{pmatrix} \\
&=
\begin{pmatrix}
\phantom{-}5\cdot1 + 2\cdot1 + 0\cdot1 \\
\phantom{-}2\cdot1 + 5\cdot1 + 0\cdot1 \\
-3\cdot1 + 4\cdot1 + 6\cdot1 \\
\end{pmatrix} \\
&=
\begin{pmatrix}
7 \\
7 \\
7
\end{pmatrix}
=
7
\begin{pmatrix}
1 \\
1 \\
1
\end{pmatrix},
\end{align*}
so, it is correct. |
| Markdown | [Skip to content](https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/#content)
[](https://opencurve.info/)
# [OpenCurve](https://opencurve.info/)
## A bit of maths and physics. For everyone.
Primary Menu
- [Home](https://opencurve.info/)
- [Little bits](https://opencurve.info/little-bits/)
- [A bit of maths](https://opencurve.info/a-bit-of-maths/)
- [A bit of physics](https://opencurve.info/a-bit-of-physics/)
- [Search](https://opencurve.info/search/)
- [Privacy policy / About us](https://opencurve.info/privacy-policy/)
- [](https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/)
- [](https://opencurve.info/nl/reele-eigenwaarden-en-eigenvectoren-van-3x3-matrices-voorbeeld-3/)
Search
[Level 2 Undergraduate](https://opencurve.info/category/level-2-undergraduate/), [Mathematics](https://opencurve.info/category/mathematics-tutorial/), [Tutorial](https://opencurve.info/category/tutorial/)
# Real eigenvalues and eigenvectors of 3×3 matrices, example 3
**In these examples, the eigenvalues of matrices will turn out to be real values. In other words, the eigenvalues and eigenvectors are in \$\\mathbb{R}^n\$.**
[Download PDF](https://opencurve.info/wp-content/uploads/2018/12/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3-GB.pdf)
Suppose, we have the following matrix: \\begin{equation\*} \\mathbf{A}= \\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix}. \\end{equation\*} The objective is to find the eigenvalues and the corresponding eigenvectors. 1\. Characteristic equation Firstly, formulate the characteristic equation and solve it. The solutions are the eigenvalues of matrix \$ \\mathbf{A} \$. If \$ \\mathbf{I} \$ is the identity matrix of \$ \\mathbf{A} \$ and \$ \\lambda \$ is the unknown eigenvalue (represent the unknown eigenvalues), then the characteristic equation is \\begin{equation\*} \\det(\\mathbf{A}-\\lambda \\mathbf{I})=0. \\end{equation\*} Written in matrix form, we get \\begin{equation} \\label{eq:characteristic1} \\begin{vmatrix} \\phantom{-}5-\\lambda & 2 & 0 \\\\ \\phantom{-}2 & 5-\\lambda & 0 \\\\ -3 & 4 & 6-\\lambda \\end{vmatrix} =0. \\end{equation} Choose the row or column which are easiest to use to find the determinant of the matrix in equation \\eqref{eq:characteristic1}. In other words, in this case, we will go down the last column as it contains the most zeros. This will decrease the length of the characteristic equation considerably: \\begin{align\*} &0\\begin{vmatrix}\\phantom{-}2 & 5-\\lambda \\\\ -3 & 4 \\end{vmatrix} \\\\ &\\quad – 0\\begin{vmatrix}5-\\lambda & 2 \\\\ -3 & 4 \\end{vmatrix} \\\\ &\\qquad+ (6-\\lambda)\\begin{vmatrix}5-\\lambda & 2 \\\\ 2 & 5-\\lambda \\end{vmatrix} = 0, \\end{align\*} and so \\begin{equation} (6-\\lambda)\\begin{vmatrix}5-\\lambda & 2 \\\\ 2 & 5-\\lambda \\end{vmatrix} = 0. \\end{equation} Simplifying further, gives \\begin{align\*} (6-\\lambda)\[(5-\\lambda)(5-\\lambda)-2^2\] &= 0, \\\\ (6-\\lambda)\[25-5\\lambda-5\\lambda+\\lambda^2-4\] &= 0, \\\\ (6-\\lambda)\[\\lambda^2-10\\lambda+21\] &= 0, \\end{align\*} enabling us to write a manageable form of the characteristic equation: \\begin{equation} (6-\\lambda)\[(\\lambda-3)(\\lambda-7)\] = 0, \\end{equation} of which the solutions of \$ \\lambda \$ are now apparent immediately: \\begin{equation} \\therefore \\lambda = 6 \\vee \\lambda = 3 \\vee \\lambda = 7. \\end{equation} Lastly, there are two ways to verify if the found values are correct. For instance, the sum of these values have to be equal to the trace of \$\\mathbf{A}\$, which is the sum of the main diagonal of \$\\mathbf{A}\$: \\begin{equation\*} \\text{tr }\\mathbf{A}=5+5+6=16. \\end{equation\*} And, indeed, the sum of the values of \$\\lambda\$ is equal to 16 as well. We can also verify whether the product of the values of \$\\lambda\$ is equal to \$\\det\\mathbf{A}\$: \\begin{align\*} \\det\\mathbf{A} &= 0\\begin{vmatrix}\\phantom{-}2&5\\\\-3&4\\end{vmatrix} \\\\ &\\qquad -0\\begin{vmatrix}\\phantom{-}5&2\\\\-3&4\\end{vmatrix} \\\\ &\\qquad\\quad +6\\begin{vmatrix}5&2\\\\2&5\\end{vmatrix} \\\\ &= 6\\begin{vmatrix}5&2\\\\2&5\\end{vmatrix} \\\\ &= 6(5^2-2^2) \\\\ &= 126. \\end{align\*} And, indeed, the product of the values of \$\\lambda\$ is equal to \$6\\cdot3\\cdot7=126\$. 2\. Specify the eigenvalues The eigenvalues of matrix \$ \\mathbf{A} \$ are thus \$ \\lambda = 6 \$, \$ \\lambda = 3 \$, and \$ \\lambda = 7\$. 3\. Eigenvector equations We rewrite the characteristic equation in matrix form to a system of three linear equations. As it is intended to find one or more eigenvectors \$ \\mathbf{v} \$, let \\begin{equation} \\label{eq:v01} \\mathbf{v} = \\begin{pmatrix} x\_1 \\\\ x\_2 \\\\ x\_3 \\end{pmatrix} \\end{equation} and \\begin{equation} (\\mathbf{A}-\\lambda\\mathbf{I})\\mathbf{v}=\\mathbf{0}. \\end{equation} In which case, we can write \\begin{equation} \\label{eq:A-lambda I times v = 0} \\begin{pmatrix} \\phantom{-}5-\\lambda & 2 & 0 \\\\ \\phantom{-}2 & 5-\\lambda & 0 \\\\ -3 & 4 & 6-\\lambda \\end{pmatrix} \\begin{pmatrix} x\_1 \\\\ x\_2 \\\\ x\_3 \\end{pmatrix} = \\mathbf{0}, \\end{equation} which we can then write as a system of linear equations: \\begin{equation\*} \\left\\{ \\begin{matrix} (5-\\lambda)x\_1 + 2x\_2 + 0x\_3 &= 0, \\\\ 2x\_1 + (5-\\lambda)x\_2 + 0x\_3 &= 0, \\\\ -3x\_1 + 4x\_2 + (6-\\lambda)x\_3 &= 0. \\end{matrix} \\right. \\end{equation\*} Simplifying this further, we have obtained the following eigenvector equations: \\begin{equation} \\label{eq:eigenvectorvergelijkingen01} \\left\\{ \\begin{matrix} (5-\\lambda)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-\\lambda)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-\\lambda)x\_3 &= 0. \\end{matrix} \\right. \\end{equation} 4\. Substitute every obtained eigenvalue \$\\boldsymbol{\\lambda}\$ into the eigenvector equations 4\.1. Eigenvalue \$ \\boldsymbol{\\lambda = 3} \$ Let’s start with eigenvalue \$ \\lambda = 3 \$. Substituting this into the eigenvector equations \\eqref{eq:eigenvectorvergelijkingen01}, we get \\begin{align\*} (5-3)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-3)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-3)x\_3 &= 0. \\end{align\*} We can simplify this to \\begin{align\*} 2x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + 2x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – 3x\_3 &= 0. \\end{align\*} The first equation and second equation reduce to \$ x\_1 = -x\_2 \$. Let’s substitute \$ x\_1 \$ in the third equation. \\begin{align\*} 3(-x\_2) – 4x\_2 – 3x\_3 &= 0 \\\\ \\therefore 7x\_2 &= -3x\_3. \\end{align\*} In other words, if \$ x\_2 = -3 \$, then \$ x\_3 = 7 \$, and \$ x\_1 = 3 \$. And so, we can now fill in the values of \$ \\mathbf{v} \$ in \\eqref{eq:v01}: \\begin{equation} \\mathbf{v} = \\begin{pmatrix} x\_1 \\\\ x\_2 \\\\ x\_3 \\end{pmatrix} = \\begin{pmatrix} \\phantom{-}3 \\\\ -3 \\\\ \\phantom{-}7 \\end{pmatrix}. \\end{equation} In other words, an eigenvector with eigenvalue \$ \\lambda = 3 \$ is \$ \\begin{pmatrix}3 & -3 & 7\\end{pmatrix}^T \$. (Note: we deliberately write the words ‘an eigenvector’, as, for instance, the eigenvector \$ \\begin{pmatrix}54 & -54 & 126\\end{pmatrix}^T \$ is an eigenvector with this eigenvalue too. As long as \$ x\_1 = -x\_2 \$, and \$ 7x\_2 = -3x\_3 \$, in other words, as long as the ratios between \$ x\_1 \$, \$ x\_2 \$, and \$ x\_3 \$ stay constant, it is an eigenvector of this eigenvalue. However, by convention we write the lowest possible integer values.) We can check the validity of the eigenvector by calculating the inner product of \$\\mathbf{A}\$ with the eigenvector. If all went well, the outcome will be equal to the inner product of the eigenvalue with the eigenvector, in other words, \$ \\mathbf{Av}=\\lambda \\mathbf{v} \$. If we write this down in matrix notation (while, for clarity, simultaneously specifying which part is which variable), indeed, we get \\begin{align\*} & \\underbrace{\\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix}}\_{\\mathbf{A}} \\underbrace{\\begin{pmatrix} \\phantom{-}3 \\\\ -3 \\\\ \\phantom{-}7 \\end{pmatrix}}\_{\\mathbf{v}} \\\\ &= \\begin{pmatrix} 5\\cdot3 + 2\\cdot-3 + 0\\cdot7 \\\\ 2\\cdot3 + 5\\cdot-3 + 0\\cdot7 \\\\ -3\\cdot3 + 4\\cdot-3 + 6\\cdot7 \\\\ \\end{pmatrix} \\\\ &= \\begin{pmatrix} \\phantom{-}9 \\\\ -9 \\\\ \\phantom{-}21 \\end{pmatrix} = \\underbrace{3}\_{\\lambda} \\underbrace{ \\begin{pmatrix} \\phantom{-}3 \\\\ -3 \\\\ \\phantom{-}7 \\end{pmatrix}}\_{\\mathbf{v}}. \\end{align\*} 4\.2. Eigenvalue \$ \\boldsymbol{\\lambda = 6} \$ In the same vein, we replace \$ \\lambda = 6 \$ in the eigenvector equations of \\eqref{eq:eigenvectorvergelijkingen01}. We then write the following three linear equations: \\begin{align\*} (5-6)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-6)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-6)x\_3 &= 0. \\end{align\*} We can simplify further: \\begin{align\*} x\_1 &= 2x\_2, \\\\ 2x\_1 &= x\_2, \\\\ 3x\_1 &= 4x\_2. \\end{align\*} We see that \$ x\_1 = x\_2 = 0 \$ is the only solution to this system of simultaneous equations. As \$ x\_3 \$ always multiplies by 0 (which is why it does not appear anymore in this system), \$ x\_3 \$ can take any value. An eigenvector to eigenvalue \$ \\lambda = 6 \$ is therefore simply \$ \\begin{pmatrix}0 & 0 & 1\\end{pmatrix}^T \$. Checking this using the inner product of matrix \$\\mathbf{A}\$ with \$ \\begin{pmatrix}0 & 0 & 1\\end{pmatrix}^T \$, we get, indeed, \$\\lambda\\mathbf{v}\$: \\begin{align\*} &\\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix} \\begin{pmatrix} 0 \\\\ 0 \\\\ 1 \\end{pmatrix} \\\\ &= \\begin{pmatrix} \\phantom{-}5\\cdot0 + 2\\cdot0 + 0\\cdot1 \\\\ \\phantom{-}2\\cdot0 + 5\\cdot0 + 0\\cdot1 \\\\ -3\\cdot0 + 4\\cdot0 + 6\\cdot1 \\\\ \\end{pmatrix} \\\\ &= \\begin{pmatrix} 0 \\\\ 0 \\\\ 6 \\end{pmatrix} = 6 \\begin{pmatrix} 0 \\\\ 0 \\\\ 1 \\end{pmatrix}. \\end{align\*} 4\.3. Eigenvalue \$ \\boldsymbol{\\lambda = 7} \$ Substituting \$\\lambda=7\$, yields \\begin{align\*} (5-7)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-7)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-7)x\_3 &= 0. \\end{align\*} Working this further: \\begin{align\*} x\_1 &= x\_2, \\\\ x\_1 &= x\_2, \\\\ 3x\_1 – 4x\_2 + x\_3 &= 0. \\end{align\*} Substituting \$ x\_1 = x\_2 \$ into the third equation, we get \\begin{align\*} 3x\_2 – 4x\_2 &= -x\_3, \\\\ x\_2 &= x\_3. \\end{align\*} And so, we conclude \\begin{equation} x\_1 = x\_2 = x\_3. \\end{equation} An eigenvector to the eigenvalue \$\\lambda=7\$ is, thus, \$\\begin{pmatrix}1 & 1 & 1\\end{pmatrix}^T\$. Obviously, we can check this too: \\begin{align\*} &\\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix} \\begin{pmatrix} 1 \\\\ 1 \\\\ 1 \\end{pmatrix} \\\\ &= \\begin{pmatrix} \\phantom{-}5\\cdot1 + 2\\cdot1 + 0\\cdot1 \\\\ \\phantom{-}2\\cdot1 + 5\\cdot1 + 0\\cdot1 \\\\ -3\\cdot1 + 4\\cdot1 + 6\\cdot1 \\\\ \\end{pmatrix} \\\\ &= \\begin{pmatrix} 7 \\\\ 7 \\\\ 7 \\end{pmatrix} = 7 \\begin{pmatrix} 1 \\\\ 1 \\\\ 1 \\end{pmatrix}, \\end{align\*} so, it is correct.
[2018-12-142020-09-24](https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/)
[eigenvalues](https://opencurve.info/tag/eigenvalues-en/), [eigenvectors](https://opencurve.info/tag/eigenvectors-en/), [linear algebra](https://opencurve.info/tag/linear-algebra-en/), [matrix](https://opencurve.info/tag/matrix-en/)
## Post navigation
[Previous Previous post: Real eigenvalues and eigenvectors of 3×3 matrices, example 2](https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-2/)
[Next Next post: Deriving the Lorentz transformations from a rotation of frames of reference about their origin with real time Wick-rotated to imaginary time](https://opencurve.info/deriving-the-lorentz-transformations-from-a-rotation-of-frames-of-reference-in-standard-configuration-with-real-time-wick-rotated-to-imaginary-time/)
Sidebar
## Published by
### KJ Runia
Reads for a joint honours degree in mathematics and theoretical physics (final year) in England, at the School of Mathematics and Statistics and the School of Physical Sciences at The Open University, Walton Hall, Milton Keynes. [View all posts by KJ Runia](https://opencurve.info/author/kjrunia/)
## Selecteer taal
- [English](https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/)
- [Nederlands](https://opencurve.info/nl/reele-eigenwaarden-en-eigenvectoren-van-3x3-matrices-voorbeeld-3/)
## Search
## Colophon
**Twitter** [@CurveOpen](https://twitter.com/CurveOpen)
**Facebook**
[@OpenCurve](https://www.facebook.com/OpenCurve/)
**Contributing Editor**
[@kjrunia](https://twitter.com/kjrunia)
## Cite this post
Harvard
MLA
Chicago
APA
OpenCurve 2018-12-14 **Real eigenvalues and eigenvectors of 3×3 matrices, example 3.**, viewed 2026-04-12,https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/\>
"**Real eigenvalues and eigenvectors of 3×3 matrices, example 3.**" OpenCurve - 2026-04-12, <https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/>
"**Real eigenvalues and eigenvectors of 3×3 matrices, example 3.**" OpenCurve - Accessed 2026-04-12. <https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/>
OpenCurve (2026-04-12) **Real eigenvalues and eigenvectors of 3×3 matrices, example 3**. Retrieved from <https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/>.
- [English](https://opencurve.info/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/)
- [Nederlands](https://opencurve.info/nl/reele-eigenwaarden-en-eigenvectoren-van-3x3-matrices-voorbeeld-3/)
## Categories
## Archives
Archives
## Find us
- [Facebook](https://www.facebook.com/OpenCurve/)
- [Twitter](https://twitter.com/CurveOpen)
(C) 2020 - KJ Runia |
| Readable Markdown | **In these examples, the eigenvalues of matrices will turn out to be real values. In other words, the eigenvalues and eigenvectors are in \$\\mathbb{R}^n\$.**
[Download PDF](https://opencurve.info/wp-content/uploads/2018/12/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3-GB.pdf)
Suppose, we have the following matrix: \\begin{equation\*} \\mathbf{A}= \\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix}. \\end{equation\*} The objective is to find the eigenvalues and the corresponding eigenvectors. 1\. Characteristic equation Firstly, formulate the characteristic equation and solve it. The solutions are the eigenvalues of matrix \$ \\mathbf{A} \$. If \$ \\mathbf{I} \$ is the identity matrix of \$ \\mathbf{A} \$ and \$ \\lambda \$ is the unknown eigenvalue (represent the unknown eigenvalues), then the characteristic equation is \\begin{equation\*} \\det(\\mathbf{A}-\\lambda \\mathbf{I})=0. \\end{equation\*} Written in matrix form, we get \\begin{equation} \\label{eq:characteristic1} \\begin{vmatrix} \\phantom{-}5-\\lambda & 2 & 0 \\\\ \\phantom{-}2 & 5-\\lambda & 0 \\\\ -3 & 4 & 6-\\lambda \\end{vmatrix} =0. \\end{equation} Choose the row or column which are easiest to use to find the determinant of the matrix in equation \\eqref{eq:characteristic1}. In other words, in this case, we will go down the last column as it contains the most zeros. This will decrease the length of the characteristic equation considerably: \\begin{align\*} &0\\begin{vmatrix}\\phantom{-}2 & 5-\\lambda \\\\ -3 & 4 \\end{vmatrix} \\\\ &\\quad – 0\\begin{vmatrix}5-\\lambda & 2 \\\\ -3 & 4 \\end{vmatrix} \\\\ &\\qquad+ (6-\\lambda)\\begin{vmatrix}5-\\lambda & 2 \\\\ 2 & 5-\\lambda \\end{vmatrix} = 0, \\end{align\*} and so \\begin{equation} (6-\\lambda)\\begin{vmatrix}5-\\lambda & 2 \\\\ 2 & 5-\\lambda \\end{vmatrix} = 0. \\end{equation} Simplifying further, gives \\begin{align\*} (6-\\lambda)\[(5-\\lambda)(5-\\lambda)-2^2\] &= 0, \\\\ (6-\\lambda)\[25-5\\lambda-5\\lambda+\\lambda^2-4\] &= 0, \\\\ (6-\\lambda)\[\\lambda^2-10\\lambda+21\] &= 0, \\end{align\*} enabling us to write a manageable form of the characteristic equation: \\begin{equation} (6-\\lambda)\[(\\lambda-3)(\\lambda-7)\] = 0, \\end{equation} of which the solutions of \$ \\lambda \$ are now apparent immediately: \\begin{equation} \\therefore \\lambda = 6 \\vee \\lambda = 3 \\vee \\lambda = 7. \\end{equation} Lastly, there are two ways to verify if the found values are correct. For instance, the sum of these values have to be equal to the trace of \$\\mathbf{A}\$, which is the sum of the main diagonal of \$\\mathbf{A}\$: \\begin{equation\*} \\text{tr }\\mathbf{A}=5+5+6=16. \\end{equation\*} And, indeed, the sum of the values of \$\\lambda\$ is equal to 16 as well. We can also verify whether the product of the values of \$\\lambda\$ is equal to \$\\det\\mathbf{A}\$: \\begin{align\*} \\det\\mathbf{A} &= 0\\begin{vmatrix}\\phantom{-}2&5\\\\-3&4\\end{vmatrix} \\\\ &\\qquad -0\\begin{vmatrix}\\phantom{-}5&2\\\\-3&4\\end{vmatrix} \\\\ &\\qquad\\quad +6\\begin{vmatrix}5&2\\\\2&5\\end{vmatrix} \\\\ &= 6\\begin{vmatrix}5&2\\\\2&5\\end{vmatrix} \\\\ &= 6(5^2-2^2) \\\\ &= 126. \\end{align\*} And, indeed, the product of the values of \$\\lambda\$ is equal to \$6\\cdot3\\cdot7=126\$. 2\. Specify the eigenvalues The eigenvalues of matrix \$ \\mathbf{A} \$ are thus \$ \\lambda = 6 \$, \$ \\lambda = 3 \$, and \$ \\lambda = 7\$. 3\. Eigenvector equations We rewrite the characteristic equation in matrix form to a system of three linear equations. As it is intended to find one or more eigenvectors \$ \\mathbf{v} \$, let \\begin{equation} \\label{eq:v01} \\mathbf{v} = \\begin{pmatrix} x\_1 \\\\ x\_2 \\\\ x\_3 \\end{pmatrix} \\end{equation} and \\begin{equation} (\\mathbf{A}-\\lambda\\mathbf{I})\\mathbf{v}=\\mathbf{0}. \\end{equation} In which case, we can write \\begin{equation} \\label{eq:A-lambda I times v = 0} \\begin{pmatrix} \\phantom{-}5-\\lambda & 2 & 0 \\\\ \\phantom{-}2 & 5-\\lambda & 0 \\\\ -3 & 4 & 6-\\lambda \\end{pmatrix} \\begin{pmatrix} x\_1 \\\\ x\_2 \\\\ x\_3 \\end{pmatrix} = \\mathbf{0}, \\end{equation} which we can then write as a system of linear equations: \\begin{equation\*} \\left\\{ \\begin{matrix} (5-\\lambda)x\_1 + 2x\_2 + 0x\_3 &= 0, \\\\ 2x\_1 + (5-\\lambda)x\_2 + 0x\_3 &= 0, \\\\ -3x\_1 + 4x\_2 + (6-\\lambda)x\_3 &= 0. \\end{matrix} \\right. \\end{equation\*} Simplifying this further, we have obtained the following eigenvector equations: \\begin{equation} \\label{eq:eigenvectorvergelijkingen01} \\left\\{ \\begin{matrix} (5-\\lambda)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-\\lambda)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-\\lambda)x\_3 &= 0. \\end{matrix} \\right. \\end{equation} 4\. Substitute every obtained eigenvalue \$\\boldsymbol{\\lambda}\$ into the eigenvector equations 4\.1. Eigenvalue \$ \\boldsymbol{\\lambda = 3} \$ Let’s start with eigenvalue \$ \\lambda = 3 \$. Substituting this into the eigenvector equations \\eqref{eq:eigenvectorvergelijkingen01}, we get \\begin{align\*} (5-3)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-3)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-3)x\_3 &= 0. \\end{align\*} We can simplify this to \\begin{align\*} 2x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + 2x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – 3x\_3 &= 0. \\end{align\*} The first equation and second equation reduce to \$ x\_1 = -x\_2 \$. Let’s substitute \$ x\_1 \$ in the third equation. \\begin{align\*} 3(-x\_2) – 4x\_2 – 3x\_3 &= 0 \\\\ \\therefore 7x\_2 &= -3x\_3. \\end{align\*} In other words, if \$ x\_2 = -3 \$, then \$ x\_3 = 7 \$, and \$ x\_1 = 3 \$. And so, we can now fill in the values of \$ \\mathbf{v} \$ in \\eqref{eq:v01}: \\begin{equation} \\mathbf{v} = \\begin{pmatrix} x\_1 \\\\ x\_2 \\\\ x\_3 \\end{pmatrix} = \\begin{pmatrix} \\phantom{-}3 \\\\ -3 \\\\ \\phantom{-}7 \\end{pmatrix}. \\end{equation} In other words, an eigenvector with eigenvalue \$ \\lambda = 3 \$ is \$ \\begin{pmatrix}3 & -3 & 7\\end{pmatrix}^T \$. (Note: we deliberately write the words ‘an eigenvector’, as, for instance, the eigenvector \$ \\begin{pmatrix}54 & -54 & 126\\end{pmatrix}^T \$ is an eigenvector with this eigenvalue too. As long as \$ x\_1 = -x\_2 \$, and \$ 7x\_2 = -3x\_3 \$, in other words, as long as the ratios between \$ x\_1 \$, \$ x\_2 \$, and \$ x\_3 \$ stay constant, it is an eigenvector of this eigenvalue. However, by convention we write the lowest possible integer values.) We can check the validity of the eigenvector by calculating the inner product of \$\\mathbf{A}\$ with the eigenvector. If all went well, the outcome will be equal to the inner product of the eigenvalue with the eigenvector, in other words, \$ \\mathbf{Av}=\\lambda \\mathbf{v} \$. If we write this down in matrix notation (while, for clarity, simultaneously specifying which part is which variable), indeed, we get \\begin{align\*} & \\underbrace{\\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix}}\_{\\mathbf{A}} \\underbrace{\\begin{pmatrix} \\phantom{-}3 \\\\ -3 \\\\ \\phantom{-}7 \\end{pmatrix}}\_{\\mathbf{v}} \\\\ &= \\begin{pmatrix} 5\\cdot3 + 2\\cdot-3 + 0\\cdot7 \\\\ 2\\cdot3 + 5\\cdot-3 + 0\\cdot7 \\\\ -3\\cdot3 + 4\\cdot-3 + 6\\cdot7 \\\\ \\end{pmatrix} \\\\ &= \\begin{pmatrix} \\phantom{-}9 \\\\ -9 \\\\ \\phantom{-}21 \\end{pmatrix} = \\underbrace{3}\_{\\lambda} \\underbrace{ \\begin{pmatrix} \\phantom{-}3 \\\\ -3 \\\\ \\phantom{-}7 \\end{pmatrix}}\_{\\mathbf{v}}. \\end{align\*} 4\.2. Eigenvalue \$ \\boldsymbol{\\lambda = 6} \$ In the same vein, we replace \$ \\lambda = 6 \$ in the eigenvector equations of \\eqref{eq:eigenvectorvergelijkingen01}. We then write the following three linear equations: \\begin{align\*} (5-6)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-6)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-6)x\_3 &= 0. \\end{align\*} We can simplify further: \\begin{align\*} x\_1 &= 2x\_2, \\\\ 2x\_1 &= x\_2, \\\\ 3x\_1 &= 4x\_2. \\end{align\*} We see that \$ x\_1 = x\_2 = 0 \$ is the only solution to this system of simultaneous equations. As \$ x\_3 \$ always multiplies by 0 (which is why it does not appear anymore in this system), \$ x\_3 \$ can take any value. An eigenvector to eigenvalue \$ \\lambda = 6 \$ is therefore simply \$ \\begin{pmatrix}0 & 0 & 1\\end{pmatrix}^T \$. Checking this using the inner product of matrix \$\\mathbf{A}\$ with \$ \\begin{pmatrix}0 & 0 & 1\\end{pmatrix}^T \$, we get, indeed, \$\\lambda\\mathbf{v}\$: \\begin{align\*} &\\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix} \\begin{pmatrix} 0 \\\\ 0 \\\\ 1 \\end{pmatrix} \\\\ &= \\begin{pmatrix} \\phantom{-}5\\cdot0 + 2\\cdot0 + 0\\cdot1 \\\\ \\phantom{-}2\\cdot0 + 5\\cdot0 + 0\\cdot1 \\\\ -3\\cdot0 + 4\\cdot0 + 6\\cdot1 \\\\ \\end{pmatrix} \\\\ &= \\begin{pmatrix} 0 \\\\ 0 \\\\ 6 \\end{pmatrix} = 6 \\begin{pmatrix} 0 \\\\ 0 \\\\ 1 \\end{pmatrix}. \\end{align\*} 4\.3. Eigenvalue \$ \\boldsymbol{\\lambda = 7} \$ Substituting \$\\lambda=7\$, yields \\begin{align\*} (5-7)x\_1 + 2x\_2 &= 0, \\\\ 2x\_1 + (5-7)x\_2 &= 0, \\\\ 3x\_1 – 4x\_2 – (6-7)x\_3 &= 0. \\end{align\*} Working this further: \\begin{align\*} x\_1 &= x\_2, \\\\ x\_1 &= x\_2, \\\\ 3x\_1 – 4x\_2 + x\_3 &= 0. \\end{align\*} Substituting \$ x\_1 = x\_2 \$ into the third equation, we get \\begin{align\*} 3x\_2 – 4x\_2 &= -x\_3, \\\\ x\_2 &= x\_3. \\end{align\*} And so, we conclude \\begin{equation} x\_1 = x\_2 = x\_3. \\end{equation} An eigenvector to the eigenvalue \$\\lambda=7\$ is, thus, \$\\begin{pmatrix}1 & 1 & 1\\end{pmatrix}^T\$. Obviously, we can check this too: \\begin{align\*} &\\begin{pmatrix} \\phantom{-}5 & 2 & 0 \\\\ \\phantom{-}2 & 5 & 0 \\\\ -3 & 4 & 6 \\end{pmatrix} \\begin{pmatrix} 1 \\\\ 1 \\\\ 1 \\end{pmatrix} \\\\ &= \\begin{pmatrix} \\phantom{-}5\\cdot1 + 2\\cdot1 + 0\\cdot1 \\\\ \\phantom{-}2\\cdot1 + 5\\cdot1 + 0\\cdot1 \\\\ -3\\cdot1 + 4\\cdot1 + 6\\cdot1 \\\\ \\end{pmatrix} \\\\ &= \\begin{pmatrix} 7 \\\\ 7 \\\\ 7 \\end{pmatrix} = 7 \\begin{pmatrix} 1 \\\\ 1 \\\\ 1 \\end{pmatrix}, \\end{align\*} so, it is correct. |
| Shard | 65 (laksa) |
| Root Hash | 9199013673007389665 |
| Unparsed URL | info,opencurve!/real-eigenvalues-and-eigenvectors-of-3x3-matrices-example-3/ s443 |