Practice: Eigenvalues and Eigenvectors

Recognition · Interpretation

A learner observes that A 0 = λ 0 holds for every square matrix A and every scalar λ , and concludes that 0 is an eigenvector for every eigenvalue. What is wrong?

2 hints available, least help first.

Hint 1: Retrieval cue

For how many values of λ does A 0 = λ 0 hold?

Hint 2: Concept cue

Ask what the definition would exclude if the zero vector were allowed.

Direct application

For

A = ( 4 1 2 3 ) ,

the characteristic polynomial is λ 2 − ( tr ⁡ A ) λ + det A .

What is the larger of the two eigenvalues?

Enter the value. It is checked against the answer and the precision this task asks for.

2 hints available, least help first.

Hint 1: Retrieval cue

The trace is the sum of the diagonal entries; the determinant is a d − b c .

Hint 2: Concept cue

Factor λ 2 − 7 λ + 10 by finding two numbers with sum 7 and product 10.

Direct application

Let A = ( 4 1 2 3 ) and v = ( 1 , − 2 ) T .

Compute A v . If v is an eigenvector, A v = λ v for some scalar λ . What is that λ ?

Enter the value. It is checked against the answer and the precision this task asks for.

2 hints available, least help first.

Hint 1: Retrieval cue

The first component of A v is the first row dotted with v .

Hint 2: Concept cue

A v = ( 2 , − 4 ) . What must v be multiplied by to give that?

Classification · Interpretation

Two 2 × 2 matrices each have the single eigenvalue 3 with algebraic multiplicity 2:

Q = ( 3 1 0 3 ) , S = ( 3 0 0 3 ) .

Which is defective, and what decides it?

2 hints available, least help first.

Hint 1: Retrieval cue

Which multiplicity decides defectiveness. The root's multiplicity, or the dimension of the eigenspace?

Hint 2: Concept cue

Form A − 3 I for each matrix and find the dimension of its kernel.

Recognition · Error diagnosis

For A = ( 3 1 0 2 ) a learner writes:

"Take λ = 7 . Then A 0 = 0 = 7 ⋅ 0 , so the equation A v = λ v is satisfied by v = 0 . Hence 7 is an eigenvalue of A with eigenvector 0 ."

Which response identifies the error?

2 hints available, least help first.

Hint 1: Retrieval cue

For how many scalars λ does A 0 = λ 0 hold?

Hint 2: Concept cue

If the zero vector counted, every scalar would be an eigenvalue of every matrix. Check λ = 7 instead against det ( A − λ I ) = 0 .

Construction · Classification · Explanation

For each matrix: find the characteristic polynomial and its roots, give a basis for each eigenspace, state both multiplicities, and say whether a basis of eigenvectors exists. Check your eigenvalues against the trace and the determinant, and verify one pair directly.

(a) P = ( 1 2 2 4 )

(b) Q = ( 3 1 0 3 )

(c) R = ( 0 − 1 1 0 )

(d) Each of the three fails to be "a nice diagonalisable real matrix with no surprises" in a different way, or does not fail at all. Say which is which, and for the ones that fail, say whether the obstruction can be removed by working over a larger field.

Write your answer, then compare it with the worked solution.

3 hints available, least help first.

Hint 1: Retrieval cue

For a 2 × 2 matrix, p ( λ ) = λ 2 − ( tr ⁡ A ) λ + det A . Check your roots against both invariants before continuing.

Hint 2: Concept cue

After substituting an eigenvalue, A − λ I must be singular. If your reduction leaves no free variable, something is wrong.

Hint 3: Strategy cue

For part (d), separate two questions: does the polynomial have roots in this field, and are there enough independent eigenvectors once it does?

Compare with the worked solution

Comparing does not record a result. Judging your own written answer cannot show that you can do this without help.

(a) P : singular, diagonalisable. tr ⁡ P = 1 + 4 = 5 , det P = 4 − 4 = 0 , so p ( λ ) = λ 2 − 5 λ = λ ( λ − 5 ) . Eigenvalues 0 and 5 , each of algebraic multiplicity 1. Invariant check. 0 + 5 = 5 = tr ⁡ P ✓, 0 × 5 = 0 = det P ✓. E 0 = ker ⁡ P . P − 0 I = P , and row reducing ( 1 2 2 4 ) leaves v 1 + 2 v 2 = 0 , so v 1 = − 2 v 2 and E 0 = span ⁡ { ( 2 , − 1 ) } (taking v 2 = − 1 ). Geometric multiplicity 1. E 5 . P − 5 I = ( − 4 2 2 − 1 ) , determinant 4 − 4 = 0 ✓. Reducing gives 2 v 1 − v 2 = 0 , so v 2 = 2 v 1 and E 5 = span ⁡ { ( 1 , 2 ) } . Geometric multiplicity 1. Verification. P ( 1 , 2 ) T = ( 1 + 4 , 2 + 8 ) T = ( 5 , 10 ) T = 5 ( 1 , 2 ) T ✓. And P ( 2 , − 1 ) T = ( 2 − 2 , 4 − 4 ) T = ( 0 , 0 ) T = 0 ⋅ ( 2 , − 1 ) T ✓. Verdict. Geometric equals algebraic for both, and { ( 2 , − 1 ) , ( 1 , 2 ) } is a basis of R 2 of eigenvectors. P is diagonalisable. That 0 is an eigenvalue simply records that P is singular. It is not an obstruction. (b) Q : defective. Triangular, so the eigenvalues are the diagonal entries: λ = 3 twice, algebraic multiplicity 2. Equivalently tr ⁡ Q = 6 , det Q = 9 , p ( λ ) = λ 2 − 6 λ + 9 = ( λ − 3 ) 2 . Invariant check. 3 + 3 = 6 ✓, 3 × 3 = 9 ✓. E 3 . Q − 3 I = ( 0 1 0 0 ) , which has rank 1, so its kernel has dimension 2 − 1 = 1 . The condition is v 2 = 0 , giving E 3 = span ⁡ { ( 1 , 0 ) } . Geometric multiplicity 1. Verification. Q ( 1 , 0 ) T = ( 3 , 0 ) T = 3 ( 1 , 0 ) T ✓. Verdict. Geometric 1 < algebraic 2 , so Q is defective. There are not two independent eigenvectors, so no basis of eigenvectors exists and Q is not diagonalisable over any field. (c) R : no real eigenvalues, diagonalisable over C . tr ⁡ R = 0 , det R = 0 − ( − 1 ) = 1 , so p ( λ ) = λ 2 + 1 . Over R this has no roots, so R has no real eigenvalues, which the geometry predicts, since R is a quarter-turn rotation and no real direction survives it. Over C the roots are λ = i and λ = − i , a conjugate pair, each of algebraic multiplicity 1. Invariant check. i + ( − i ) = 0 = tr ⁡ R ✓, i ( − i ) = − i 2 = 1 = det R ✓. E i . R − i I = ( − i − 1 1 − i ) . The first row gives − i v 1 − v 2 = 0 , so v 2 = − i v 1 and E i = span ⁡ { ( 1 , − i ) } . Verification. R ( 1 , − i ) T = ( 0 ( 1 ) + ( − 1 ) ( − i ) , 1 ( 1 ) + 0 ( − i ) ) T = ( i , 1 ) T , and i ( 1 , − i ) T = ( i , − i 2 ) T = ( i , 1 ) T ✓. E − i . By conjugation, span ⁡ { ( 1 , i ) } . Verdict. Over R : not diagonalisable, indeed no eigenvalues at all. Over C : two distinct eigenvalues, geometric equals algebraic for both, so diagonalisable. (d) Three different situations. P does not fail. It is diagonalisable over R with two distinct real eigenvalues. Its only peculiarity is that one eigenvalue is zero, which reports singularity rather than any obstruction to diagonalisation. R fails over R , and the obstruction is removable. Its characteristic polynomial has no real roots, but every polynomial splits over C , and there it has two distinct eigenvalues and a basis of eigenvectors. Enlarging the field fixes it completely. Q fails, and the obstruction cannot be removed. Its characteristic polynomial already splits over R , the root is 3, twice, so there is no larger field to move to. The shortfall is in the geometric multiplicity, which is a statement about the rank of Q − 3 I and is unchanged by enlarging the field. A defective matrix is defective over every field containing its eigenvalues. That is the distinction worth carrying: missing roots are a property of the field; missing eigenvectors are a property of the matrix.

A complete answer does each of these:

  • forms characteristic polynomial
  • solves for eigenspaces
  • verifies the pair
  • compares multiplicities
  • checks against invariants
Practice data

Your practice record is stored in this browser only. Clearing it removes every answer and every scheduled review, and cannot be undone.

Results update as you type. Use the up and down arrow keys to move between results, Enter to open one, and Escape to close.

Type to search.

Settings

Appearance

Interface density

Your record

Your progress is stored in this browser and nowhere else: an identifier, the answers you have given, the mastery states and review schedule derived from them, and the lesson you last opened. Clearing it makes you a new learner on this device. It cannot be undone, and it will not affect your appearance or density settings.

Focus timer

Focus--minutes remaining

Phase

Kept in this browser only, and used to label the session in your own history.

Today

Nothing recorded yet. Finish a focus session and it will appear here.

Settings

Focus sessions between long breaks.

Sessions you are aiming for in a day.

Notifications

Your history

Sessions are stored in this browser and nowhere else. They are not evidence and never reach your mastery record.