chapter
    Rank, Invertibility and Linear Systems Notes for GATE DA

    Rank, Invertibility and Linear Systems notes for GATE DA: 13 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions

    rank invertibility and linear systems notes

    Chapter Roadmap: Rank, Invertibility and Linear Systems

    Chapter Roadmap

    Rank, Invertibility and Linear Systems

    1
    Rank, Nullity and Matrix Polynomials
    Solution spaces, Rank-Nullity Theorem, and matrix powers.
    2
    Invertibility and Rank-One Updates
    Outer products , invertibility shifts, and quick eigenvalue tricks.
    Goal: Move from calculating determinants to understanding the structure of linear transformations.

    Rank, Nullity and the Solution Space

    Rank, Nullity and the Solution Space

    For any matrix , the fundamental accounting rule of linear algebra is:

    Rank: Dimension of the column space (independent columns).
    Nullity: Dimension of the null space (free variables in ).
    : Total number of columns (variables).
    Exam Insight: If , the system has non-trivial (infinite) solutions.

    Matrix Polynomials: When $p(A) = 0$

    Matrix Polynomials: When

    A matrix satisfies a polynomial equation if:

    Key Consequence for Eigenvalues

    If is an eigenvalue of , then must be a root of the scalar polynomial:

    Example: If , then .
    Roots: .
    The matrix may not have all these eigenvalues, but it cannot have any other eigenvalues.

    10 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

    For an matrix , if the rank of is strictly less than , then the homogeneous system of linear equations has:

    Question 2
    Level 1: Warm-up

    Let be a square matrix satisfying . Which of the following CANNOT be an eigenvalue of ?

    Question 3
    Level 1: Warm-up

    If a square matrix satisfies the equation , which of the following is a possible eigenvalue of ?

    Question 4
    Level 1: Warm-up

    Let be a square matrix satisfying . If is an eigenvalue of , which of the following could be a value of ?

    Question 5
    Level 1: Warm-up

    Let be a square matrix satisfying the equation . If is an eigenvalue of , which of the following scalar equations must satisfy?

    Question 6
    Level 1: Warm-up

    Let be a matrix. If the null space of has dimension 3, what is the rank of ?

    Question 7
    Level 1: Warm-up

    Let be a idempotent matrix (i.e., ). If the trace of is 3, what is the rank of ?

    Question 8
    Level 1: Warm-up

    Let be a matrix. If the rank of is , how many free variables are there in the general solution to the homogeneous system ?

    Question 9
    Level 1: Warm-up

    If a square matrix satisfies the equation , then is guaranteed to be:

    Question 10
    Level 1: Warm-up

    If a matrix satisfies the equation , it is guaranteed to be diagonalizable. This is because the roots of the corresponding polynomial equation are:

    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.

    Rank, Invertibility and Linear Systems Notes for GATE DA

    Rank, Invertibility and Linear Systems notes for GATE DA: 13 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    Chapter Roadmap: Rank, Invertibility and Linear Systems

    Chapter Roadmap

    Rank, Invertibility and Linear Systems

    1
    Rank, Nullity and Matrix Polynomials
    Solution spaces, Rank-Nullity Theorem, and matrix powers.
    2
    Invertibility and Rank-One Updates
    Outer products , invertibility shifts, and quick eigenvalue tricks.
    Goal: Move from calculating determinants to understanding the structure of linear transformations.

    Rank, Nullity and the Solution Space

    Rank, Nullity and the Solution Space

    For any matrix , the fundamental accounting rule of linear algebra is:

    Rank: Dimension of the column space (independent columns).
    Nullity: Dimension of the null space (free variables in ).
    : Total number of columns (variables).
    Exam Insight: If , the system has non-trivial (infinite) solutions.

    Matrix Polynomials: When $p(A) = 0$

    Matrix Polynomials: When

    A matrix satisfies a polynomial equation if:

    Key Consequence for Eigenvalues

    If is an eigenvalue of , then must be a root of the scalar polynomial:

    Example: If , then .
    Roots: .
    The matrix may not have all these eigenvalues, but it cannot have any other eigenvalues.

    Solving $A^3 = A$: Step-by-Step

    Solving : Step-by-Step

    Given: for .

    Step 1: Form the polynomial
    Step 2: Identify Possible Eigenvalues
    Roots of are .
    Step 3: Check Diagonalizability
    Since has distinct roots, the minimal polynomial has no repeated factors. Thus, is diagonalizable.
    Step 4: Analyze Trace and Determinant
    and .
    Conclusion: is diagonalizable, but not necessarily invertible (0 is a possible eigenvalue).

    Rank, Invertibility and Linear Systems: Solved Questions with Step-by-Step Explanations (10 Problems)

    Question 1 · Linear Algebra MCQ

    For an matrix , if the rank of is strictly less than , then the homogeneous system of linear equations has:

    1. A.

      No solution

    2. B.

      Exactly one solution

    3. C.

      Exactly solutions

    4. D.

      Infinitely many solutions

    Correct Answer:

    D

    Step-by-Step Solution

    Key idea: This question tests the fundamental implication of the Rank-Nullity Theorem on linear systems.

    Step 1: For an matrix , the Rank-Nullity Theorem states that .

    Step 2: We are given that .

    Step 3: This implies that .

    Step 4: A positive nullity means the null space contains non-zero vectors, so the homogeneous system has non-trivial (infinitely many) solutions.

    Answer: Infinitely many solutions

    Question 2 · Linear Algebra MCQ

    Let be a square matrix satisfying . Which of the following CANNOT be an eigenvalue of ?

    1. A.

      2

    2. B.

      -2

    3. C.

      0

    4. D.

      Both 2 and -2

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This is a matrix polynomial question. Recognisable because it gives a polynomial equation that satisfies and asks about the possible eigenvalues.

    Step 1: Recall the property of matrix polynomials. If a matrix satisfies , then every eigenvalue of must be a root of the scalar polynomial .

    Step 2: Identify the polynomial from the given equation.

    The equation is . The corresponding scalar polynomial is:

    Step 3: Find the roots of the polynomial.

    Set , which gives .

    The roots are and .

    Step 4: Determine the possible eigenvalues.

    The only possible eigenvalues for are 2 and -2. Any other number cannot be an eigenvalue.

    Step 5: Evaluate the options.

    • 2 is a possible eigenvalue.
    • -2 is a possible eigenvalue.
    • 0 is NOT a root of , so it CANNOT be an eigenvalue.

    Answer: Option C is correct.

    Question 3 · Linear Algebra MCQ

    If a square matrix satisfies the equation , which of the following is a possible eigenvalue of ?

    1. A.

    2. B.

    3. C.

    4. D.

    Correct Answer:

    D

    Step-by-Step Solution

    Key idea: This is a direct application of the matrix polynomial eigenvalue property. Recognisable because it gives a polynomial equation that satisfies and asks for a possible eigenvalue.

    Step 1: Recall the property that if a matrix satisfies , then every eigenvalue of must be a root of the scalar polynomial .

    Step 2: Identify the polynomial from the given equation.

    The equation is . The corresponding scalar polynomial is:

    Step 3: Find the roots of the polynomial by setting it to zero.

    Factor the quadratic:

    The roots are and .

    Step 4: Determine the possible eigenvalues.

    The only possible eigenvalues for are 2 and 3.

    Step 5: Evaluate the options.

    • 0 is not a root.
    • 5 is not a root.
    • 6 is not a root.
    • 2 is a root, so it is a possible eigenvalue.

    Answer: Option D is correct.

    Question 4 · Linear Algebra MCQ

    Let be a square matrix satisfying . If is an eigenvalue of , which of the following could be a value of ?

    1. A.

      1

    2. B.

      2

    3. C.

      -2

    4. D.

      3

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This is a matrix polynomial question. When a matrix satisfies a polynomial equation , its eigenvalues must satisfy the same scalar polynomial equation .

    Step 1: The given matrix equation is .

    Step 2: Replace with the scalar eigenvalue to form the characteristic scalar equation: .

    Step 3: Factor the equation: .

    Step 4: Solve for : the possible eigenvalues are and .

    Step 5: Compare with the given options. The value is among the possible eigenvalues.

    Answer: -2

    Question 5 · Linear Algebra MCQ

    Let be a square matrix satisfying the equation . If is an eigenvalue of , which of the following scalar equations must satisfy?

    1. A.

    2. B.

    3. C.

    4. D.

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This is a direct pattern recognition question for matrix polynomials. Recognisable because it gives a simple polynomial equation and asks for the corresponding scalar equation for the eigenvalues.

    Step 1: Recall the fundamental property of matrix polynomials. If a matrix satisfies a polynomial equation , then every eigenvalue of must satisfy the exact same scalar polynomial equation .

    Step 2: Identify the polynomial equation from the given matrix equation. The equation is , which can be rewritten as .

    Step 3: Apply the property to the eigenvalues. Replace the matrix with the scalar eigenvalue . The equation becomes , or simply .

    Step 4: Check the options. The equation matches Option C.

    Answer: Option C is correct.

    Question 6 · Linear Algebra NAT

    Let be a matrix. If the null space of has dimension 3, what is the rank of ?

    Correct Answer:

    4

    Step-by-Step Solution

    Key idea: This is a direct application of the Rank-Nullity Theorem. Recognisable because it gives the matrix dimensions and the nullity, and asks for the rank.

    Step 1: Recall the Rank-Nullity Theorem for an matrix:

    where is the number of columns.

    Step 2: Identify the given values. The matrix is , so the number of columns is . The nullity (dimension of the null space) is given as 3.

    Step 3: Substitute the values into the theorem:

    Step 4: Solve for the rank:

    Answer: The rank of is 4.

    Question 7 · Linear Algebra NAT

    Let be a idempotent matrix (i.e., ). If the trace of is 3, what is the rank of ?

    Correct Answer:

    3

    Step-by-Step Solution

    Key idea: This is a property question about idempotent matrices. Recognisable because it gives the condition and relates the trace to the rank.

    Step 1: Recall the eigenvalue property of idempotent matrices. If , then for any eigenvalue , we have .

    Step 2: Solve the scalar equation , which factors to . The only possible eigenvalues for an idempotent matrix are 0 and 1.

    Step 3: Recall the relationship between trace, rank, and eigenvalues for idempotent matrices.

    • The trace of a matrix is the sum of its eigenvalues.
    • Since the eigenvalues are only 0s and 1s, the sum of the eigenvalues is exactly equal to the number of 1s.
    • For an idempotent matrix, it is diagonalizable, and its rank is exactly equal to the number of non-zero eigenvalues (the number of 1s).

    Step 4: Conclude the fundamental property: For any idempotent matrix, .

    Step 5: Apply the given value. We are given . Therefore, .

    Answer: The rank of is 3.

    Question 8 · Linear Algebra MCQ

    Let be a matrix. If the rank of is , how many free variables are there in the general solution to the homogeneous system ?

    1. A.

    2. B.

    3. C.

    4. D.

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: This is a direct application of the Rank-Nullity Theorem. Recognisable because it gives the matrix dimensions and the rank, and asks for the number of free variables (which is the nullity).

    Step 1: Recall that the number of free variables in the solution to is exactly the nullity of .

    Step 2: Recall the Rank-Nullity Theorem for an matrix:

    where is the number of columns.

    Step 3: Identify the values from the question. The matrix is , so . The rank is given as .

    Step 4: Substitute the values into the theorem:

    Step 5: Solve for the nullity:

    Answer: There are 2 free variables.

    Question 9 · Linear Algebra MCQ

    If a square matrix satisfies the equation , then is guaranteed to be:

    1. A.

      Nilpotent

    2. B.

      Orthogonal

    3. C.

      Diagonalizable

    4. D.

      Skew-symmetric

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This is a direct recall question testing the diagonalizability condition for matrix polynomials.

    Step 1: The matrix satisfies .

    Step 2: The corresponding scalar polynomial is .

    Step 3: Find the roots of : .

    Step 4: Since the roots are distinct, the matrix is guaranteed to be diagonalizable.

    Answer: Diagonalizable

    Question 10 · Linear Algebra MCQ

    If a matrix satisfies the equation , it is guaranteed to be diagonalizable. This is because the roots of the corresponding polynomial equation are:

    1. A.

      All zero

    2. B.

      Repeated

    3. C.

      Distinct

    4. D.

      Complex

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This question tests the structural consequence of the minimal polynomial having distinct roots.

    Step 1: The matrix satisfies , which can be rewritten as .

    Step 2: The corresponding scalar polynomial is .

    Step 3: Factor the polynomial: .

    Step 4: The roots are . Since these roots are all distinct, the matrix is guaranteed to be diagonalizable.

    Answer: Distinct

    More notes in this unit