Linear AlgebraEigenvalues and Eigenvectors3 of 7
Eigenvalues and Eigenvectors · 3

Eigenspaces and Multiplicity

When a matrix stretches an eigenvector without knocking it off its line, it stretches every other vector on that same line, and any combination of vectors stretched by that same factor, right along with it.

1

What an Eigenspace Is

The eigenspace for an eigenvalue λ\eigval{\lambda} is the entire subspace of vectors that get stretched by λ\eigval{\lambda}, together with the zero vector at the origin. Depending on the matrix, an eigenspace can be a 1D\eigsp{1\text{D}} line, a 2D\eigsp{2\text{D}} plane, or even all of 3D\eigsp{3\text{D}} space.

What an Eigenspace Is
A=[3102]A = \begin{bmatrix} 3 & 1 \\ 0 & 2 \end{bmatrix}

Subtracting λ\eigval{\lambda} from the diagonal of AA shifts the transformation so that every vector stretched by λ\eigval{\lambda} under AA gets sent to the origin under A−λIA - \eigval{\lambda} I:

(A−λI)v\displaystyle (A - \eigval{\lambda} I)\eigsp{v} =0  ⟹  Eλ⏟eigenspace for λ\displaystyle = 0 \implies \underbrace{\eigsp{E_\lambda}}_{\eigsp{\text{eigenspace for }\lambda}} =null space of A−λI\displaystyle = \nullsp{\text{null space of }} A - \eigval{\lambda} I

To describe an eigenspace, we find a basis for the null space of A−λIA - \eigval{\lambda} I using its free variables.

Whenever a vector v\eigsp{v} lies on the eigenspace line through the origin, AvA\eigsp{v} stays on that same line stretched by λ\eigval{\lambda}, while (A−λI)v(A - \eigval{\lambda} I)\eigsp{v} lands at the origin.

When a vector sits on the eigenspace line, the matrix just stretches it along that line, and shifting the matrix squashes it to zero at the origin.
2

Algebraic and Geometric Multiplicity

An eigenvalue has two numbers attached to it: its algebraic multiplicity is the number of times λ\eigval{\lambda} repeats as a root in the factored characteristic polynomial, and its geometric multiplicity is the dimension of its eigenspace. To see why those two numbers don't always match, let's compare two 2×22 \times 2 matrices that differ only by a 11 in the top-right corner:

Matrix 1=[3003],Matrix 2=[3103]\displaystyle \text{Matrix 1} = \begin{bmatrix} 3 & 0 \\ 0 & 3 \end{bmatrix}, \qquad \text{Matrix 2} = \begin{bmatrix} 3 & 1 \\ 0 & 3 \end{bmatrix}
Matrix 1
E3\htmlClass{lc-blue}{E_3}
Matrix 2
E3\htmlClass{lc-blue}{E_3}
Algebraic and Geometric Multiplicity
Matrix 1=[3003]Matrix 2=[3103]\displaystyle \begin{aligned} \text{Matrix 1} &= \begin{bmatrix} 3 & 0 \\ 0 & 3 \end{bmatrix} \\[4pt] \text{Matrix 2} &= \begin{bmatrix} 3 & 1 \\ 0 & 3 \end{bmatrix} \end{aligned}
Algebraic Multiplicity=  ?Geometric Multiplicity=  ?\displaystyle \begin{aligned} \text{Algebraic Multiplicity} &= \;? \\ \eigsp{\text{Geometric Multiplicity}} &= \;? \end{aligned}
Text solution
Subtract λ\eigval{\lambda} from the diagonal and set the determinant to zeroThe 11 in the top-right corner of Matrix 2 gets multiplied by the 00 in the bottom-left, so both matrices give the exact same characteristic equation and the same repeated root λ=3\eigval{\lambda} = \eigval{3}:
∣3−λ003−λ∣=(3−λ)2=0,∣3−λ103−λ∣=(3−λ)2−1×0=(3−λ)2⏟Algebraic Multiplicity = 2=0\displaystyle \begin{aligned} &\begin{vmatrix} 3 - \eigval{\lambda} & 0 \\ 0 & 3 - \eigval{\lambda} \end{vmatrix} = (3 - \eigval{\lambda})^2 = 0, \\ &\begin{vmatrix} 3 - \eigval{\lambda} & 1 \\ 0 & 3 - \eigval{\lambda} \end{vmatrix} = (3 - \eigval{\lambda})^2 - 1 \times 0 \\ &= \underbrace{(3 - \eigval{\lambda})^2}_{\text{Algebraic Multiplicity} \, = \, 2} = 0 \end{aligned}
Find the free variables of Matrix 1 minus 3I\eigval{3}ISubtracting 3\eigval{3} from the diagonal makes every entry of Matrix 1 zero, which puts no restriction on x\freeA{x} or y\freeB{y} and leaves both variables free:
[0000][xy]=[00]  ⟹  0x+0y=0  ⟹  [xy]=x[10]+y[01]\displaystyle \begin{aligned} &\begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} \freeA{x} \\ \freeB{y} \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \\ &\implies 0\freeA{x} + 0\freeB{y} = 0 \\ &\implies \begin{bmatrix} \freeA{x} \\ \freeB{y} \end{bmatrix} = \freeA{x\begin{bmatrix} 1 \\ 0 \end{bmatrix}} + \freeB{y\begin{bmatrix} 0 \\ 1 \end{bmatrix}} \end{aligned}
Find the free variables of Matrix 2 minus 3I\eigval{3}IThe 11 in the top-right corner stays after subtracting 3\eigval{3} from the diagonal and forces y=0y = 0, while the all-zero first column leaves x\freeA{x} as the only free variable:
[0100][xy]=[00]  ⟹  0x+1y=0  ⟹  y=0  ⟹  [x0]=x[10]\displaystyle \begin{aligned} &\begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} \freeA{x} \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \\ &\implies 0\freeA{x} + 1y = 0 \implies y = 0 \\ &\implies \begin{bmatrix} \freeA{x} \\ 0 \end{bmatrix} = \freeA{x\begin{bmatrix} 1 \\ 0 \end{bmatrix}} \end{aligned}

Both matrices have λ=3\eigval{\lambda} = \eigval{3} with algebraic multiplicity 22, but Matrix 1 stretches the entire 2D\eigsp{2\text{D}} plane with basis {[10],[01]}\left\{\freeA{\begin{bmatrix} 1 \\ 0 \end{bmatrix}}, \freeB{\begin{bmatrix} 0 \\ 1 \end{bmatrix}}\right\} and geometric multiplicity 2\eigsp{2}, whereas the sideways shear in Matrix 2 tilts every non-horizontal vector off its line and shrinks the eigenspace to the xx-axis with basis {[10]}\left\{\freeA{\begin{bmatrix} 1 \\ 0 \end{bmatrix}}\right\} and geometric multiplicity 1\eigsp{1}.

Try comparing a pure stretch with a stretch plus a shear:

A pure stretch keeps every direction on its own line, while adding any sideways shear pushes every direction off its line except the horizontal axis.
3

Eigenspaces of a Triangular Matrix

Now let's move to 3×33 \times 3 matrices, starting with an upper-triangular matrix where the zeros below the main diagonal let us read the eigenvalues straight off the diagonal. We want to find every eigenvalue, its algebraic and geometric multiplicities, and a basis for each eigenspace of

A=[213020005]\displaystyle A = \begin{bmatrix} 2 & 1 & 3 \\ 0 & 2 & 0 \\ 0 & 0 & 5 \end{bmatrix}
Eigenspaces of a Triangular Matrix
A=[213020005]\displaystyle A = \begin{bmatrix} 2 & 1 & 3 \\ 0 & 2 & 0 \\ 0 & 0 & 5 \end{bmatrix}
λ\displaystyle \eigval{\lambda} =  ?Eλ\displaystyle = \;? \qquad \eigsp{E_\lambda} =  ?\displaystyle = \;?
Text solution
Multiply the diagonal entries to factor the characteristic equationBecause AA has all zeros below the main diagonal, the determinant of A−λIA - \eigval{\lambda} I is the product of its diagonal entries, which gives λ=2\eigval{\lambda} = \eigval{2} with algebraic multiplicity 22 and λ=5\eigval{\lambda} = \eigval{5} with algebraic multiplicity 11:
(2−λ)(2−λ)(5−λ)\displaystyle (2 - \eigval{\lambda})(2 - \eigval{\lambda})(5 - \eigval{\lambda}) =(2−λ)2(5−λ)1\displaystyle = (2 - \eigval{\lambda})^2(5 - \eigval{\lambda})^1 =0\displaystyle = 0
Subtract 2\eigval{2} from the diagonal and solve (A−2I)v=0(A - \eigval{2}I)\eigsp{v} = 0The bottom row forces z=0z = 0 and the top row then forces y=0y = 0, while the all-zero first column leaves x\freeA{x} as our single free variable:
[013000003][xyz]=[000]  ⟹  {3z=0  ⟹  z=00x+1y+3z=0  ⟹  y=0  ⟹  [xyz]=[x00]=x[100]\displaystyle \begin{aligned} &\begin{bmatrix} 0 & 1 & 3 \\ 0 & 0 & 0 \\ 0 & 0 & 3 \end{bmatrix}\begin{bmatrix} \freeA{x} \\ y \\ z \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix} \\ &\implies \begin{cases} \begin{aligned} 3z &= 0 \\ \implies z &= 0 \\ 0\freeA{x} + 1y + 3z &= 0 \\ \implies y &= 0 \end{aligned} \end{cases} \\ &\implies \begin{bmatrix} \freeA{x} \\ y \\ z \end{bmatrix} = \begin{bmatrix} \freeA{x} \\ 0 \\ 0 \end{bmatrix} = \freeA{x\begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix}} \end{aligned}
Subtract 5\eigval{5} from the diagonal and solve (A−5I)v=0(A - \eigval{5}I)\eigsp{v} = 0The middle row forces y=0y = 0, which simplifies the top row so that xx must equal the single free variable z\freeA{z}:
[−3130−30000][xyz]=[000]  ⟹  {−3y=0  ⟹  y=0−3x+y+3z=0  ⟹  x=z  ⟹  [xyz]=[z0z]=z[101]\displaystyle \begin{aligned} &\begin{bmatrix} -3 & 1 & 3 \\ 0 & -3 & 0 \\ 0 & 0 & 0 \end{bmatrix}\begin{bmatrix} x \\ y \\ \freeA{z} \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix} \\ &\implies \begin{cases} \begin{aligned} -3y &= 0 \\ \implies y &= 0 \\ -3x + y + 3\freeA{z} &= 0 \\ \implies x &= \freeA{z} \end{aligned} \end{cases} \\ &\implies \begin{bmatrix} x \\ y \\ \freeA{z} \end{bmatrix} = \begin{bmatrix} \freeA{z} \\ 0 \\ \freeA{z} \end{bmatrix} = \freeA{z\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}} \end{aligned}

For λ=2\eigval{\lambda} = \eigval{2}, the off-diagonal 11 shrinks the eigenspace from a plane to a 1D\eigsp{1\text{D}} line with basis {[100]}\left\{\freeA{\begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix}}\right\} and geometric multiplicity 1\eigsp{1}; for λ=5\eigval{\lambda} = \eigval{5}, the eigenspace is a 1D\eigsp{1\text{D}} line with basis {[101]}\left\{\freeA{\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}}\right\} and geometric multiplicity 1\eigsp{1}.

Every eigenvalue has at least one line of eigenvectors, and the dimension of its eigenspace can never be larger than the number of times that eigenvalue repeats as a root:

1\displaystyle 1 ≤Geometric Multiplicity\displaystyle \le \eigsp{\text{Geometric Multiplicity}} ≤Algebraic Multiplicity\displaystyle \le \text{Algebraic Multiplicity}
4

Row Reducing to Find Tilted Eigenspaces

When a matrix is full of nonzero entries and its eigenspaces are tilted in 3D3\text{D} space, we can't read the free variables straight off A−λIA - \eigval{\lambda} I. Instead, we row reduce A−λIA - \eigval{\lambda} I to find the pivots and free variables. Let's find the multiplicities and a basis for each eigenspace of

B=[3−12−13−21−14],with characteristic equation(2−λ)2(6−λ)=0\displaystyle \begin{gathered} B = \begin{bmatrix} 3 & -1 & 2 \\ -1 & 3 & -2 \\ 1 & -1 & 4 \end{bmatrix}, \\ \text{with characteristic equation} \\ (2 - \eigval{\lambda})^2(6 - \eigval{\lambda}) = 0 \end{gathered}
Row Reducing to Find Tilted Eigenspaces
B=[3−12−13−21−14]\displaystyle B = \begin{bmatrix} 3 & -1 & 2 \\ -1 & 3 & -2 \\ 1 & -1 & 4 \end{bmatrix}
(2−λ)2(6−λ)\displaystyle (2 - \eigval{\lambda})^2(6 - \eigval{\lambda}) =0\displaystyle = 0
E2\displaystyle \eigsp{E_2} =  ?E6\displaystyle = \;? \qquad \eigsp{E_6} =  ?\displaystyle = \;?
Text solution
Subtract 2\eigval{2} from the diagonal and row reduce B−2IB - \eigval{2}IAdding Row 1 to Row 2 and subtracting Row 1 from Row 3 makes both bottom rows all zeros in one step, leaving one pivot in the first column (xx) and two free variables (y\freeA{y} and z\freeB{z}):
B−2I=[1−12−11−21−12]→R2←R2+R1R3←R3−R1[1−12000000]  ⟹  x−y+2z=0  ⟹  x=y−2z\displaystyle \begin{aligned} B - \eigval{2}I &= \begin{bmatrix} 1 & -1 & 2 \\ -1 & 1 & -2 \\ 1 & -1 & 2 \end{bmatrix} \\ &\xrightarrow{\substack{R_2 \leftarrow R_2 + R_1 \\ R_3 \leftarrow R_3 - R_1}} \begin{bmatrix} 1 & -1 & 2 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} \\ &\implies x - \freeA{y} + 2\freeB{z} = 0 \\ &\implies x = \freeA{y} - 2\freeB{z} \end{aligned}
Substitute for the pivot variable and split by the free variablesPlugging x=y−2zx = \freeA{y} - 2\freeB{z} into the vector and separating the y\freeA{y}-part from the z\freeB{z}-part gives us one basis vector for each free variable:
[xyz]=[y−2zyz]=y[110]+z[−201]\displaystyle \begin{aligned} \begin{bmatrix} x \\ \freeA{y} \\ \freeB{z} \end{bmatrix} &= \begin{bmatrix} \freeA{y} - 2\freeB{z} \\ \freeA{y} \\ \freeB{z} \end{bmatrix} \\ &= \freeA{y\begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix}} + \freeB{z\begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix}} \end{aligned}
Subtract 6\eigval{6} from the diagonal and row reduce B−6IB - \eigval{6}ISwapping the third row to the top puts a 11 in the top-left corner to make the rest of the first column zero, and reducing the remaining rows leaves z\freeA{z} as the single free variable:
B−6I=[−3−12−1−3−21−1−2]→swap R1,R3[1−1−2−1−3−2−3−12]→R2←R2+R1R3←R3+3R1[1−1−20−4−40−4−4]→R3←R3−R2R2←R2÷(−4)R1←R1+R2[10−1011000]\displaystyle \begin{aligned} &B - \eigval{6}I = \begin{bmatrix} -3 & -1 & 2 \\ -1 & -3 & -2 \\ 1 & -1 & -2 \end{bmatrix} \\ &\xrightarrow{\text{swap } R_1, R_3} \begin{bmatrix} 1 & -1 & -2 \\ -1 & -3 & -2 \\ -3 & -1 & 2 \end{bmatrix} \\ &\xrightarrow{\substack{R_2 \leftarrow R_2 + R_1 \\ R_3 \leftarrow R_3 + 3R_1}} \begin{bmatrix} 1 & -1 & -2 \\ 0 & -4 & -4 \\ 0 & -4 & -4 \end{bmatrix} \\ &\xrightarrow{\substack{R_3 \leftarrow R_3 - R_2 \\ R_2 \leftarrow R_2 \div (-4) \\ R_1 \leftarrow R_1 + R_2}} \begin{bmatrix} 1 & 0 & -1 \\ 0 & 1 & 1 \\ 0 & 0 & 0 \end{bmatrix} \end{aligned}
Write the pivot variables in terms of the free variable z\freeA{z}The two nonzero rows of the reduced matrix give both xx and yy in terms of z\freeA{z}:
{x−z=0  ⟹  x=zy+z=0  ⟹  y=−z  ⟹  [xyz]=[z−zz]=z[1−11]\displaystyle \begin{aligned} &\begin{cases} x - \freeA{z} = 0 \implies x = \freeA{z} \\ y + \freeA{z} = 0 \implies y = -\freeA{z} \end{cases} \\ &\implies \begin{bmatrix} x \\ y \\ \freeA{z} \end{bmatrix} = \begin{bmatrix} \freeA{z} \\ -\freeA{z} \\ \freeA{z} \end{bmatrix} = \freeA{z\begin{bmatrix} 1 \\ -1 \\ 1 \end{bmatrix}} \end{aligned}

For λ=2\eigval{\lambda} = \eigval{2}, both the algebraic and geometric multiplicities are 22, and the basis {[110],[−201]}\left\{\freeA{\begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix}}, \freeB{\begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix}}\right\} spans a tilted 2D\eigsp{2\text{D}} plane through the origin where every vector stretches by 2\eigval{2}; for λ=6\eigval{\lambda} = \eigval{6}, both multiplicities are 11, and the basis {[1−11]}\left\{\freeA{\begin{bmatrix} 1 \\ -1 \\ 1 \end{bmatrix}}\right\} spans a 1D\eigsp{1\text{D}} line stretched by 6\eigval{6}.

If row reducing A−λIA - \eigval{\lambda} I ever leaves a pivot in every column and no free variables at all, stop and check your arithmetic: because geometric multiplicity is at least 1\eigsp{1}, an eigenvalue must always give at least one row of zeros.

Every linear combination y[110]+z[−201]\freeA{y\begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix}} + \freeB{z\begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix}} of the two basis vectors stays on its own line inside that tilted plane and stretches by a factor of 2\eigval{2}.

Every combination of the two basis vectors in this tilted plane stays on its own line and stretches by 2.

Key concepts

To find the multiplicities and eigenspace for an eigenvalue λ\eigval{\lambda}, work from the factored characteristic equation to the null space of A−λIA - \eigval{\lambda} I:

Algebraic Multiplicity sets the maximum dimension

The power on (λ0−λ)(\eigval{\lambda_0} - \eigval{\lambda}) in the factored characteristic equation is the Algebraic Multiplicity, and the eigenspace dimension has to obey 1≤Geometric Multiplicity1 \le \eigsp{\text{Geometric Multiplicity}} ≤Algebraic Multiplicity{}\le \text{Algebraic Multiplicity}. In (2−λ)2(5−λ)1=0(2 - \eigval{\lambda})^2(5 - \eigval{\lambda})^1 = 0, the root λ=2\eigval{\lambda} = \eigval{2} can have up to a 2D\eigsp{2\text{D}} plane of eigenvectors, whereas λ=5\eigval{\lambda} = \eigval{5} has power 11 and is guaranteed to have a 1D\eigsp{1\text{D}} line.

Geometric Multiplicity counts the free variables in (A−λI)v=0(A - \eigval{\lambda} I)\eigsp{v} = 0

The eigenspace Eλ\eigsp{E_\lambda} is the null space of A−λIA - \eigval{\lambda} I, and each free variable gives one basis vector.

  • When you can read the variables without row reducing: If A−λIA - \eigval{\lambda} I is already triangular or has an all-zero column, read the equations straight from the rows. In [0100][xy]=[00]\begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} \freeA{x} \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}, the top row gives y=0y = 0 and the all-zero first column leaves x\freeA{x} free right away, giving [x0]=x[10]\begin{bmatrix} \freeA{x} \\ 0 \end{bmatrix} = \freeA{x\begin{bmatrix} 1 \\ 0 \end{bmatrix}}.
  • When to row reduce: When A−λIA - \eigval{\lambda} I has nonzero entries across its rows like B−2I=[1−12−11−21−12]B - \eigval{2}I = \begin{bmatrix} 1 & -1 & 2 \\ -1 & 1 & -2 \\ 1 & -1 & 2 \end{bmatrix}, row reduce to find the pivots, write the pivot variables in terms of the free variables (x=y−2zx = \freeA{y} - 2\freeB{z}), and split the vector by the free variables so each one gives you a basis vector: [y−2zyz]=y[110]+z[−201]\begin{bmatrix} \freeA{y} - 2\freeB{z} \\ \freeA{y} \\ \freeB{z} \end{bmatrix} = \freeA{y\begin{bmatrix} 1 \\ 1 \\ 0 \end{bmatrix}} + \freeB{z\begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix}}.
5

Practice

1

A 4×44 \times 4 matrix has the factored characteristic equation (4−λ)3(1−λ)=0(4 - \eigval{\lambda})^3(1 - \eigval{\lambda}) = 0. For each eigenvalue, find its algebraic multiplicity and list all possible values for its geometric multiplicity.

The exponent on each factor gives the largest possible dimension of its eigenspace; what is the smallest dimension an eigenspace for an eigenvalue can ever have?

Read the powers off (4−λ)3(1−λ)1=0(4 - \eigval{\lambda})^3(1 - \eigval{\lambda})^1 = 0 and use 1≤Geometric Multiplicity1 \le \eigsp{\text{Geometric Multiplicity}} ≤Algebraic Multiplicity{}\le \text{Algebraic Multiplicity}. Be careful not to include 00 in the list (which would give 0,1,2,30, 1, 2, 3 for λ=4\eigval{\lambda} = \eigval{4}) or assume the geometric multiplicity must equal 33. Every eigenvalue has at least one line of eigenvectors, so the possible values always run from 11 up to the algebraic multiplicity.
For λ=4\lambda = 4, the algebraic multiplicity is 33 and the geometric multiplicity can be 11, 22, or 33. For λ=1\lambda = 1, the algebraic multiplicity is 11 and the geometric multiplicity must be 11.
2

For the matrix A=[40−24]A = \begin{bmatrix} 4 & 0 \\ -2 & 4 \end{bmatrix}, find its eigenvalue, the algebraic multiplicity, a basis for the eigenspace, and the geometric multiplicity.

Subtract λ\eigval{\lambda} from the diagonal to find the repeated root, then look at which variable is forced to 00 by the bottom row of A−λIA - \eigval{\lambda} I and which column is all zeros.

Because AA is triangular with zeros above the diagonal, its characteristic equation is (4−λ)2=0(4 - \eigval{\lambda})^2 = 0, giving λ=4\eigval{\lambda} = \eigval{4} with algebraic multiplicity 22. Subtract 4\eigval{4} from the diagonal:
A−4I=[00−20],[00−20][xy]=[00]  ⟹  −2x=0  ⟹  x=0\displaystyle \begin{aligned} & A - \eigval{4}I = \begin{bmatrix} 0 & 0 \\ -2 & 0 \end{bmatrix}, \\ & \begin{bmatrix} 0 & 0 \\ -2 & 0 \end{bmatrix}\begin{bmatrix} x \\ \freeB{y} \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix} \\ &\quad \implies -2x = 0\implies x = 0 \end{aligned}
Be careful not to write [10]\begin{bmatrix} 1 \\ 0 \end{bmatrix} by treating xx as free the way it was for Matrix 2: here the −2-2 is in the first column and forces x=0x = 0, while the all-zero second column leaves y\freeB{y} free, giving [0y]=y[01]\begin{bmatrix} 0 \\ \freeB{y} \end{bmatrix} = \freeB{y\begin{bmatrix} 0 \\ 1 \end{bmatrix}}.
λ=4\lambda = 4 has algebraic multiplicity 22, eigenspace basis {[01]}\left\{\begin{bmatrix} 0 \\ 1 \end{bmatrix}\right\}, and geometric multiplicity 11.
3

Find every eigenvalue, its algebraic and geometric multiplicities, and a basis for each eigenspace of the upper-triangular matrix A=[302030001]A = \begin{bmatrix} 3 & 0 & 2 \\ 0 & 3 & 0 \\ 0 & 0 & 1 \end{bmatrix}.

After subtracting each eigenvalue from the diagonal, check how many columns of A−λIA - \eigval{\lambda} I are all zeros before writing the row equations.

From the diagonal entries, the characteristic equation is (3−λ)2(1−λ)=0(3 - \eigval{\lambda})^2(1 - \eigval{\lambda}) = 0.
For λ=3\eigval{\lambda} = \eigval{3} (algebraic multiplicity 22), subtract 3\eigval{3} from the diagonal:
A−3I=[00200000−2]  ⟹  2z=0  ⟹  z=0\displaystyle A - \eigval{3}I = \begin{bmatrix} 0 & 0 & 2 \\ 0 & 0 & 0 \\ 0 & 0 & -2 \end{bmatrix} \implies 2z = 0 \implies z = 0
The first and second columns are both all zeros, leaving x\freeA{x} and y\freeB{y} free:
[xyz]=[xy0]=x[100]+y[010]\displaystyle \begin{aligned} \begin{bmatrix} \freeA{x} \\ \freeB{y} \\ z \end{bmatrix} &= \begin{bmatrix} \freeA{x} \\ \freeB{y} \\ 0 \end{bmatrix} \\ &= \freeA{x\begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix}} + \freeB{y\begin{bmatrix} 0 \\ 1 \\ 0 \end{bmatrix}} \end{aligned}
For λ=1\eigval{\lambda} = \eigval{1} (algebraic multiplicity 11), subtract 1\eigval{1} from the diagonal:
A−1I=[202020000]  ⟹  {2y=0  ⟹  y=02x+2z=0  ⟹  x=−z\displaystyle A - \eigval{1}I = \begin{bmatrix} 2 & 0 & 2 \\ 0 & 2 & 0 \\ 0 & 0 & 0 \end{bmatrix} \implies \begin{cases} 2y = 0 \implies y = 0 \\ 2x + 2\freeA{z} = 0 \implies x = -\freeA{z} \end{cases}
When solving 2x+2z=02x + 2\freeA{z} = 0, remember to flip the sign when subtracting 2z2\freeA{z} from both sides (dropping the minus sign gives [101]\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix} instead of [−101]\freeA{\begin{bmatrix} -1 \\ 0 \\ 1 \end{bmatrix}}). With z\freeA{z} free, [xyz]=[−z0z]=z[−101]\begin{bmatrix} x \\ y \\ \freeA{z} \end{bmatrix} = \begin{bmatrix} -\freeA{z} \\ 0 \\ \freeA{z} \end{bmatrix} = \freeA{z\begin{bmatrix} -1 \\ 0 \\ 1 \end{bmatrix}}.
For λ=3\lambda = 3, algebraic multiplicity =2= 2, geometric multiplicity =2= 2, and basis ={[100],[010]}= \left\{\begin{bmatrix} 1 \\ 0 \\ 0 \end{bmatrix}, \begin{bmatrix} 0 \\ 1 \\ 0 \end{bmatrix}\right\}. For λ=1\lambda = 1, algebraic multiplicity =1= 1, geometric multiplicity =1= 1, and basis ={[−101]}= \left\{\begin{bmatrix} -1 \\ 0 \\ 1 \end{bmatrix}\right\}.
4

The matrix B=[22−125−2−1−22]B = \begin{bmatrix} 2 & 2 & -1 \\ 2 & 5 & -2 \\ -1 & -2 & 2 \end{bmatrix} has characteristic equation (1−λ)2(7−λ)=0(1 - \eigval{\lambda})^2(7 - \eigval{\lambda}) = 0. Find the algebraic multiplicity, geometric multiplicity, and a basis for the eigenspace for each eigenvalue.

For λ=1\eigval{\lambda} = \eigval{1}, compare the three rows of B−IB - I to see how many rows are multiples of Row 1; for λ=7\eigval{\lambda} = \eigval{7}, row reduce B−7IB - \eigval{7}I until only the free variable z\freeA{z} has no pivot.

For λ=1\eigval{\lambda} = \eigval{1} (algebraic multiplicity 22), subtract 1\eigval{1} from the diagonal and make the bottom two rows zero:
B−I=[12−124−2−1−21]→R2←R2−2R1R3←R3+R1[12−1000000]  ⟹  x+2y−z=0  ⟹  x=−2y+z\displaystyle \begin{aligned} B - I &= \begin{bmatrix} 1 & 2 & -1 \\ 2 & 4 & -2 \\ -1 & -2 & 1 \end{bmatrix} \\ &\xrightarrow{\substack{R_2 \leftarrow R_2 - 2R_1 \\ R_3 \leftarrow R_3 + R_1}} \begin{bmatrix} 1 & 2 & -1 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} \\ &\implies x + 2\freeA{y} - \freeB{z} = 0 \\ &\implies x = -2\freeA{y} + \freeB{z} \end{aligned}
Don't plug in y=1\freeA{y} = 1 and z=1\freeB{z} = 1 together to get a single vector [−111]\begin{bmatrix} -1 \\ 1 \\ 1 \end{bmatrix} (which loses a basis vector and gives a geometric multiplicity of 11 instead of 22); split the vector into its y\freeA{y}-part and z\freeB{z}-part:
[xyz]=[−2y+zyz]=y[−210]+z[101]\displaystyle \begin{aligned} \begin{bmatrix} x \\ \freeA{y} \\ \freeB{z} \end{bmatrix} &= \begin{bmatrix} -2\freeA{y} + \freeB{z} \\ \freeA{y} \\ \freeB{z} \end{bmatrix} \\ &= \freeA{y\begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}} + \freeB{z\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}} \end{aligned}
For λ=7\eigval{\lambda} = \eigval{7} (algebraic multiplicity 11), subtract 7\eigval{7} from the diagonal and row reduce:
B−7I=[−52−12−2−2−1−2−5]→row reduce[101012000]  ⟹  {x+z=0  ⟹  x=−zy+2z=0  ⟹  y=−2z  ⟹  [xyz]=z[−1−21]\displaystyle \begin{aligned} & B - \eigval{7}I = \begin{bmatrix} -5 & 2 & -1 \\ 2 & -2 & -2 \\ -1 & -2 & -5 \end{bmatrix} \\ & \xrightarrow{\text{row reduce}} \begin{bmatrix} 1 & 0 & 1 \\ 0 & 1 & 2 \\ 0 & 0 & 0 \end{bmatrix} \\ & \implies \begin{cases} x + \freeA{z} = 0 \implies x = -\freeA{z} \\ y + 2\freeA{z} = 0 \implies y = -2\freeA{z} \end{cases} \\ & \implies \begin{bmatrix} x \\ y \\ \freeA{z} \end{bmatrix} = \freeA{z\begin{bmatrix} -1 \\ -2 \\ 1 \end{bmatrix}} \end{aligned}
For λ=1\lambda = 1, algebraic multiplicity =2= 2, geometric multiplicity =2= 2, and basis ={[−210],[101]}= \left\{\begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix}, \begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix}\right\}. For λ=7\lambda = 7, algebraic multiplicity =1= 1, geometric multiplicity =1= 1, and basis ={[−1−21]}= \left\{\begin{bmatrix} -1 \\ -2 \\ 1 \end{bmatrix}\right\}.
5

Consider C=[53602k002]C = \begin{bmatrix} 5 & 3 & 6 \\ 0 & 2 & k \\ 0 & 0 & 2 \end{bmatrix}. For the eigenvalue λ=2\eigval{\lambda} = \eigval{2}, find the value of kk for which the geometric multiplicity is 2\eigsp{2}, and find a basis for the eigenspace both for that value of kk and when k=1k = 1.

Subtract 2\eigval{2} from the diagonal to form C−2IC - \eigval{2}I, and look at the second row to see how kk determines whether zz is free or forced to 00.

Subtract 2\eigval{2} from the diagonal of CC:
C−2I=[33600k000]\displaystyle C - \eigval{2}I = \begin{bmatrix} 3 & 3 & 6 \\ 0 & 0 & k \\ 0 & 0 & 0 \end{bmatrix}
The middle row says kz=0kz = 0. For the geometric multiplicity to be 2\eigsp{2}, we need two free variables, which happens only when k=0k = 0 so that the middle row becomes all zeros.
When k=0k = 0, don't jump straight to [010]\begin{bmatrix} 0 \\ 1 \\ 0 \end{bmatrix} and [001]\begin{bmatrix} 0 \\ 0 \\ 1 \end{bmatrix} by ignoring the top row. Even with two zero rows at the bottom, the top row 3x+3y+6z=03x + 3\freeA{y} + 6\freeB{z} = 0 still relates xx to the free variables y\freeA{y} and z\freeB{z}:
x=−y−2z  ⟹  [xyz]=[−y−2zyz]=y[−110]+z[−201]\displaystyle \begin{aligned} x &= -\freeA{y} - 2\freeB{z} \\ \implies \begin{bmatrix} x \\ \freeA{y} \\ \freeB{z} \end{bmatrix} &= \begin{bmatrix} -\freeA{y} - 2\freeB{z} \\ \freeA{y} \\ \freeB{z} \end{bmatrix} \\ &= \freeA{y\begin{bmatrix} -1 \\ 1 \\ 0 \end{bmatrix}} + \freeB{z\begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix}} \end{aligned}
When k=1k = 1, the middle row 1z=01z = 0 forces z=0z = 0, which simplifies the top row to x=−yx = -\freeA{y} with only y\freeA{y} free:
[xyz]=[−yy0]=y[−110]\displaystyle \begin{bmatrix} x \\ \freeA{y} \\ z \end{bmatrix} = \begin{bmatrix} -\freeA{y} \\ \freeA{y} \\ 0 \end{bmatrix} = \freeA{y\begin{bmatrix} -1 \\ 1 \\ 0 \end{bmatrix}}
The geometric multiplicity is 22 when k=0k = 0, which leaves both yy and zz free and gives the basis {[−110],[−201]}\left\{\begin{bmatrix} -1 \\ 1 \\ 0 \end{bmatrix}, \begin{bmatrix} -2 \\ 0 \\ 1 \end{bmatrix}\right\}. When k=1k = 1, z=0z = 0 leaves only yy free, so the geometric multiplicity is 11 and a basis is {[−110]}\left\{\begin{bmatrix} -1 \\ 1 \\ 0 \end{bmatrix}\right\}.