chapter
    Eigenvalues and Eigenvectors Notes for GATE CS

    Eigenvalues and Eigenvectors notes for GATE CS: 35 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    eigenvalues and eigenvectors notes

    Linear Algebra: Eigenvalues and Eigenvectors Roadmap

    Linear Algebra: Eigenvalues and Eigenvectors Roadmap

    1. Eigenvalues, Determinants and Multiplicity
    The foundation: characteristic equations, trace, determinant, and root multiplicity. Current Topic
    2. Eigenvector Verification
    Test vectors and compute null spaces to verify eigenvectors.
    3. Spectra of Graph Adjacency Matrices
    Apply eigenvalues to graph theory and symmetric matrices.
    4. Eigenvalues of Matrix Powers
    Predict long-term behavior and compute high matrix powers efficiently.

    The Core Idea: Eigenvalues, Determinants, and Multiplicity

    The Core Idea: Eigenvalues, Determinants, and Multiplicity

    v Av = λv

    When a matrix multiplies a vector, it usually changes both the length and the direction of that vector.

    However, for any square matrix, there are special directions that only stretch or shrink, without rotating.

    • Eigenvectors are the vectors that point in these special directions.
    • Eigenvalues are the pure scaling factors (how much they stretch or shrink).

    The determinant is the overall volume scaling factor of the entire space. Multiplicity tells us how many independent directions share the exact same scaling factor.

    The Characteristic Equation

    The Characteristic Equation

    To find the eigenvalues mathematically, we look for vectors that satisfy:

    Rearranging this gives:

    For a non-zero eigenvector to exist, the matrix must be singular (non-invertible). This means its determinant must be zero:

    This is the characteristic equation. Expanding this determinant yields a polynomial in of degree (for an matrix). The roots of this polynomial are the eigenvalues.

    32 more cards in this chapter

    Try a question

    Answer it here to see how it works. Nothing is recorded until you sign in.

    Question 1
    Level 1: Warm-up

    The eigenvalues of a matrix are , , and . What is the determinant of the matrix?

    Question 2
    Level 1: Warm-up

    Let and . If , what is the value of ?

    Question 3
    Level 1: Warm-up

    For an matrix, the characteristic equation yields a polynomial in . What is the maximum possible degree of this polynomial for a matrix?

    Question 4
    Level 1: Warm-up

    The trace of a matrix is 12. If two of its eigenvalues are 4 and 5, consider the following statement: "The third eigenvalue is 3." Is this statement true or false?

    Question 5
    Level 1: Warm-up

    Let be a matrix where the third row is exactly the sum of the first two rows. Which of the following must be an eigenvalue of ?

    Question 6
    Level 1: Warm-up

    A linear transformation scales the vector by a factor of and reverses its direction. What is the eigenvalue associated with ?

    Question 7
    Level 1: Warm-up

    Consider the characteristic equation of a matrix: .

    Assertion (A): The algebraic multiplicity of is 2.

    Reason (R): The geometric multiplicity of is 4.

    Question 8
    Level 1: Warm-up

    The characteristic equation of a matrix has roots and . The algebraic multiplicity of is 3, and for it is 1. What is the sum of the maximum possible geometric multiplicities for all eigenvalues?

    Question 9
    Level 1: Warm-up

    Consider the following statements regarding eigenvector verification for a large matrix:

    Assertion (A): To verify if a given vector is an eigenvector, one should first compute the characteristic equation .

    Reason (R): Matrix-vector multiplication is computationally cheaper than expanding a determinant.

    Question 10
    Level 1: Warm-up

    By definition, an eigenvector of a square matrix must satisfy a strict non-zero condition. What is the maximum number of zero vectors that can be included in a valid set of eigenvectors for any matrix?

    Free preview ends here

    Login to view the complete notes

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    Eigenvalues and Eigenvectors Notes for GATE CS

    Eigenvalues and Eigenvectors notes for GATE CS: 35 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    Linear Algebra: Eigenvalues and Eigenvectors Roadmap

    Linear Algebra: Eigenvalues and Eigenvectors Roadmap

    1. Eigenvalues, Determinants and Multiplicity
    The foundation: characteristic equations, trace, determinant, and root multiplicity. Current Topic
    2. Eigenvector Verification
    Test vectors and compute null spaces to verify eigenvectors.
    3. Spectra of Graph Adjacency Matrices
    Apply eigenvalues to graph theory and symmetric matrices.
    4. Eigenvalues of Matrix Powers
    Predict long-term behavior and compute high matrix powers efficiently.

    The Core Idea: Eigenvalues, Determinants, and Multiplicity

    The Core Idea: Eigenvalues, Determinants, and Multiplicity

    v Av = λv

    When a matrix multiplies a vector, it usually changes both the length and the direction of that vector.

    However, for any square matrix, there are special directions that only stretch or shrink, without rotating.

    • Eigenvectors are the vectors that point in these special directions.
    • Eigenvalues are the pure scaling factors (how much they stretch or shrink).

    The determinant is the overall volume scaling factor of the entire space. Multiplicity tells us how many independent directions share the exact same scaling factor.

    The Characteristic Equation

    The Characteristic Equation

    To find the eigenvalues mathematically, we look for vectors that satisfy:

    Rearranging this gives:

    For a non-zero eigenvector to exist, the matrix must be singular (non-invertible). This means its determinant must be zero:

    This is the characteristic equation. Expanding this determinant yields a polynomial in of degree (for an matrix). The roots of this polynomial are the eigenvalues.

    What is Multiplicity?

    What is Multiplicity?

    When you solve the characteristic equation , you might get repeated roots. For example, the polynomial might be .

    Here, the eigenvalue repeats three times. This repetition is called multiplicity.

    However, in linear algebra, multiplicity is not just a single number. We must strictly distinguish between two different types:

    1. Algebraic Multiplicity (AM)
    2. Geometric Multiplicity (GM)

    Confusing these two is one of the most common traps in competitive exams.

    Eigenvalues and Eigenvectors: Solved Questions with Step-by-Step Explanations (10 Problems)

    Question 1 · Engineering Mathematics MCQ

    The eigenvalues of a matrix are , , and . What is the determinant of the matrix?

    1. A.

      -24

    2. B.

      24

    3. C.

      -1

    4. D.

      3

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: The determinant of a matrix is exactly equal to the product of all its eigenvalues.

    Step 1: Identify the eigenvalues: , , .

    Step 2: Multiply them together: .

    Step 3: Calculate the product: .

    Answer: -24

    Question 2 · Engineering Mathematics MCQ

    Let and . If , what is the value of ?

    1. A.

      4

    2. B.

      7

    3. C.

      11

    4. D.

      28

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: This is a direct substitution question for the eigenvalue equation .

    Step 1: Multiply matrix by vector .

    Step 2: Set this equal to .

    Step 3: Compare the components to find .

    Answer: 4

    Question 3 · Engineering Mathematics MCQ

    For an matrix, the characteristic equation yields a polynomial in . What is the maximum possible degree of this polynomial for a matrix?

    1. A.

      5

    2. B.

      10

    3. C.

      25

    4. D.

      125

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: The degree of the characteristic polynomial is always exactly equal to the size of the square matrix.

    Step 1: The matrix is of size , so .

    Step 2: The determinant expands to a polynomial of degree .

    Step 3: Therefore, the degree is 5.

    Answer: 5

    Question 4 · Engineering Mathematics MCQ

    The trace of a matrix is 12. If two of its eigenvalues are 4 and 5, consider the following statement: "The third eigenvalue is 3." Is this statement true or false?

    1. A.

      True, because the sum of eigenvalues equals the trace

    2. B.

      True, because the product of eigenvalues equals the trace

    3. C.

      False, because the third eigenvalue is 21

    4. D.

      False, because the third eigenvalue is 60

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: The trace of a matrix is equal to the sum of its eigenvalues.

    Step 1: Let the third eigenvalue be . The trace is the sum of eigenvalues: .

    Step 2: Solve for : .

    Step 3: The statement is true, and the reason is that the sum of eigenvalues equals the trace.

    Answer: True, because the sum of eigenvalues equals the trace.

    Question 5 · Engineering Mathematics MCQ

    Let be a matrix where the third row is exactly the sum of the first two rows. Which of the following must be an eigenvalue of ?

    1. A.

      0

    2. B.

      1

    3. C.

      3

    4. D.

      -1

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: This is a singular matrix recognition question. Linearly dependent rows imply a zero determinant, which forces at least one eigenvalue to be zero.

    Step 1: The third row is the sum of the first two rows, meaning the rows of are linearly dependent.

    Step 2: A matrix with linearly dependent rows is singular, which means its determinant is exactly zero ().

    Step 3: The product of all eigenvalues equals the determinant. Since , at least one eigenvalue must be .

    Answer: 0

    Question 6 · Engineering Mathematics MCQ

    A linear transformation scales the vector by a factor of and reverses its direction. What is the eigenvalue associated with ?

    1. A.

      5

    2. B.

      -5

    3. C.

      0.2

    4. D.

      -0.2

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: The eigenvalue represents the pure scaling factor, including any sign change for direction reversal.

    Step 1: The problem states the scaling factor is and the direction is reversed.

    Step 2: Reversing direction means the scalar is negative. The magnitude of scaling is 5.

    Step 3: Therefore, the eigenvalue is .

    Answer: -5

    Question 7 · Engineering Mathematics MCQ

    Consider the characteristic equation of a matrix: .

    Assertion (A): The algebraic multiplicity of is 2.

    Reason (R): The geometric multiplicity of is 4.

    1. A.

      Both A and R are true and R is the correct explanation of A

    2. B.

      Both A and R are true but R is NOT the correct explanation of A

    3. C.

      A is true but R is false

    4. D.

      A is false but R is true

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: Algebraic multiplicity is the power of the factor in the characteristic equation, while geometric multiplicity is the number of independent eigenvectors (bounded by algebraic multiplicity).

    Step 1: The factor is squared, so the algebraic multiplicity of is 2. Assertion (A) is true.

    Step 2: The geometric multiplicity must be between 1 and the algebraic multiplicity (2). It cannot be 4. Reason (R) is false.

    Step 3: Therefore, A is true but R is false.

    Answer: A is true but R is false.

    Question 8 · Engineering Mathematics MCQ

    The characteristic equation of a matrix has roots and . The algebraic multiplicity of is 3, and for it is 1. What is the sum of the maximum possible geometric multiplicities for all eigenvalues?

    1. A.

      3

    2. B.

      4

    3. C.

      5

    4. D.

      6

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: The geometric multiplicity (GM) of an eigenvalue is bounded by its algebraic multiplicity (AM). The maximum possible GM is exactly equal to the AM.

    Step 1: For , the algebraic multiplicity is 3. The maximum possible geometric multiplicity is therefore 3.

    Step 2: For , the algebraic multiplicity is 1. The maximum possible geometric multiplicity is 1.

    Step 3: The sum of the maximum possible geometric multiplicities is .

    Answer: 4

    Question 9 · Engineering Mathematics MCQ

    Consider the following statements regarding eigenvector verification for a large matrix:

    Assertion (A): To verify if a given vector is an eigenvector, one should first compute the characteristic equation .

    Reason (R): Matrix-vector multiplication is computationally cheaper than expanding a determinant.

    1. A.

      Both A and R are true and R is the correct explanation of A

    2. B.

      Both A and R are true but R is NOT the correct explanation of A

    3. C.

      A is false but R is true

    4. D.

      A is true but R is false

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: When candidate vectors are provided, direct verification via multiplication is vastly superior to solving the characteristic equation.

    Step 1: Evaluate Assertion (A): Computing the characteristic equation for a matrix is computationally heavy and unnecessary if you only need to verify specific candidate vectors. Thus, A is false.

    Step 2: Evaluate Reason (R): Matrix-vector multiplication requires operations, while expanding a determinant is much more complex and prone to error. Thus, R is true.

    Step 3: Since A is false and R is true, the correct option is the third one.

    Answer: A is false but R is true.

    Question 10 · Engineering Mathematics MCQ

    By definition, an eigenvector of a square matrix must satisfy a strict non-zero condition. What is the maximum number of zero vectors that can be included in a valid set of eigenvectors for any matrix?

    1. A.

      0

    2. B.

      1

    3. C.

      2

    4. D.

      Depends on the matrix size

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: The definition of an eigenvector explicitly excludes the zero vector.

    Step 1: An eigenvector of a matrix must satisfy .

    Step 2: While the zero vector trivially satisfies for any , it provides no information about directional scaling.

    Step 3: Therefore, the strict definition requires . The zero vector can never be an eigenvector.

    Answer: 0

    More notes in this unit