chapter
    Singular Values and Gram Matrices Short Notes for GATE DA

    Singular Values and Gram Matrices short notes for GATE DA: 2 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions

    singular values and gram matrices short notes

    Gram Matrices and Positive Definiteness Cheat Sheet

    Cheat Sheet

    Gram Matrices

    • Definition: . Matrix form: .
    • Core Properties: Always symmetric, always Positive Semi-Definite.
    • Linear Independence: is strictly Positive Definite iff vectors are independent.
    • Gram Determinant: equals the volume of the spanned parallelepiped.

    Positive Definiteness (Symmetric )

    • Definition: for all .
    • Eigenvalues: All .
    • Sylvester's: All leading principal minors .
    • Cholesky: exists.
    • Gram Form: for a full-rank matrix .

    SVD and Spectral Properties Cheat Sheet

    SVD and Spectral Properties Cheat Sheet

    Singular Value Decomposition (SVD)

    • Formula: (exists for all matrices).
    • Singular Values: .
    • Rank Connection: .
    • Geometry: rotates, stretches, rotates.

    Spectral Properties of Special Matrices

    • Symmetric (): Real eigenvalues, orthogonal eigenvectors (Spectral Theorem).
    • Skew-Symmetric (): Purely imaginary or zero eigenvalues, zero diagonal.
    • Orthogonal (): Eigenvalues have magnitude ().
    • Normal (): Unitarily/orthogonally diagonalizable (includes symmetric, skew-symmetric, orthogonal).

    Try a question

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

    Question 1
    Level 1: Warm-up

    Which of the following properties is a necessary condition for any matrix to be a valid Gram matrix of a set of real vectors?

    Question 2
    Level 1: Warm-up

    Three linearly independent vectors in are used to form a Gram matrix . What is the sign of ?

    Question 3
    Level 1: Warm-up

    The singular values of a real matrix are defined as the square roots of the eigenvalues of which of the following matrices?

    Question 4
    Level 1: Warm-up

    If the eigenvalues of the matrix are and , what are the singular values of ?

    Question 5
    Level 1: Warm-up

    If is a real symmetric matrix, what is the geometric relationship between any two eigenvectors of that correspond to distinct eigenvalues?

    Question 6
    Level 1: Warm-up

    For a general real matrix that is NOT symmetric, which of the following relationships between its singular values and its eigenvalues is always true?

    Question 7
    Level 1: Warm-up

    For a real symmetric matrix , which of the following conditions is equivalent to being positive definite?

    Question 8
    Level 1: Warm-up

    A real symmetric matrix satisfies for every non-zero vector . By definition, what is such a matrix called?

    Question 9
    Level 1: Warm-up

    If a real symmetric matrix has eigenvalues , then is:

    Question 10
    Level 1: Warm-up

    A matrix has exactly two non-zero singular values. What is the rank of ?

    Free preview ends here

    Login to view the complete short 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.

    Singular Values and Gram Matrices Short Notes for GATE DA

    Singular Values and Gram Matrices short notes for GATE DA: 2 study cards covering concepts, formulas, shortcuts and exam traps, plus solved practice questions.

    Gram Matrices and Positive Definiteness Cheat Sheet

    Cheat Sheet

    Gram Matrices

    • Definition: . Matrix form: .
    • Core Properties: Always symmetric, always Positive Semi-Definite.
    • Linear Independence: is strictly Positive Definite iff vectors are independent.
    • Gram Determinant: equals the volume of the spanned parallelepiped.

    Positive Definiteness (Symmetric )

    • Definition: for all .
    • Eigenvalues: All .
    • Sylvester's: All leading principal minors .
    • Cholesky: exists.
    • Gram Form: for a full-rank matrix .

    SVD and Spectral Properties Cheat Sheet

    SVD and Spectral Properties Cheat Sheet

    Singular Value Decomposition (SVD)

    • Formula: (exists for all matrices).
    • Singular Values: .
    • Rank Connection: .
    • Geometry: rotates, stretches, rotates.

    Spectral Properties of Special Matrices

    • Symmetric (): Real eigenvalues, orthogonal eigenvectors (Spectral Theorem).
    • Skew-Symmetric (): Purely imaginary or zero eigenvalues, zero diagonal.
    • Orthogonal (): Eigenvalues have magnitude ().
    • Normal (): Unitarily/orthogonally diagonalizable (includes symmetric, skew-symmetric, orthogonal).

    Singular Values and Gram Matrices: Solved Questions with Step-by-Step Explanations (10 Problems)

    Question 1 · Linear Algebra MCQ

    Which of the following properties is a necessary condition for any matrix to be a valid Gram matrix of a set of real vectors?

    1. A.

      It must be skew-symmetric

    2. B.

      It must have all negative eigenvalues

    3. C.

      It must be an orthogonal matrix

    4. D.

      It must be positive semi-definite

    Correct Answer:

    D

    Step-by-Step Solution

    Key idea: This tests the fundamental properties of Gram matrices.

    Step 1: Let be the matrix whose columns are the given real vectors. The Gram matrix is .

    Step 2: For any real vector , the quadratic form is .

    Step 3: Since the squared norm is always greater than or equal to zero, for all .

    Step 4: This is the exact definition of a positive semi-definite matrix.

    Answer: Option D is correct.

    Question 2 · Linear Algebra MCQ

    Three linearly independent vectors in are used to form a Gram matrix . What is the sign of ?

    1. A.

      Strictly negative

    2. B.

      Zero

    3. C.

      Strictly positive

    4. D.

      Cannot be determined

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: This is a direct-application question linking linear independence to the Gram determinant.

    Step 1: Let the three linearly independent vectors be columns of a matrix .

    Step 2: Since the vectors are independent, is full rank, so .

    Step 3: The Gram matrix is .

    Step 4: Using the multiplicative property of determinants: .

    Step 5: Since , we have .

    Step 6: Therefore, is strictly positive.

    Answer: Option C is correct.

    Question 3 · Linear Algebra MCQ

    The singular values of a real matrix are defined as the square roots of the eigenvalues of which of the following matrices?

    1. A.

    2. B.

    3. C.

    4. D.

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: This is a definition-recall question on the relationship between singular values and eigenvalues.

    Step 1: Recall the definition. The singular values of a real matrix are defined as , where are the eigenvalues of .

    Step 2: Note that is always symmetric and positive semi-definite, so its eigenvalues are always real and non-negative. This guarantees that the square roots are well-defined real numbers.

    Step 3: Check the other options. is symmetric but its eigenvalues can be negative. is skew-symmetric with purely imaginary eigenvalues. may not even be defined for non-square matrices.

    Answer: Option A is correct.

    Question 4 · Linear Algebra MCQ

    If the eigenvalues of the matrix are and , what are the singular values of ?

    1. A.

      and

    2. B.

      and

    3. C.

      and

    4. D.

      and

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: This is a direct-formula question connecting the singular values of to the eigenvalues of .

    Step 1: Recall the fundamental relationship: the singular values of a matrix are the square roots of the eigenvalues of .

    Step 2: The formula is .

    Step 3: The given eigenvalues of are and .

    Step 4: Calculate the singular values: and .

    Step 5: The singular values are and .

    Answer: Option B is correct.

    Question 5 · Linear Algebra MCQ

    If is a real symmetric matrix, what is the geometric relationship between any two eigenvectors of that correspond to distinct eigenvalues?

    1. A.

      They are parallel

    2. B.

      They are orthogonal

    3. C.

      They are linearly dependent

    4. D.

      They have the same magnitude

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: This is a direct-recall question on the spectral properties of real symmetric matrices.

    Step 1: Recall the Spectral Theorem for real symmetric matrices. It states that a real symmetric matrix has real eigenvalues and its eigenvectors corresponding to distinct eigenvalues are orthogonal.

    Step 2: Let be distinct eigenvalues with eigenvectors .

    Step 3: The property .

    Step 4: Since , we must have .

    Step 5: Therefore, the eigenvectors are orthogonal.

    Answer: Option B is correct.

    Question 6 · Linear Algebra MCQ

    For a general real matrix that is NOT symmetric, which of the following relationships between its singular values and its eigenvalues is always true?

    1. A.

      for all

    2. B.

      for all

    3. C.

      for all

    4. D.

      for all

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: This is a comparison question testing the definitional link between singular values and eigenvalues, and whether the student knows which formula holds universally versus only for special matrices.

    Step 1: Recall the definition of singular values. By definition, the singular values of any matrix are , where are the eigenvalues of the symmetric positive semi-definite matrix . This holds for every matrix, symmetric or not.

    Step 2: Check Option A. The relation holds only for normal matrices (symmetric, orthogonal, skew-symmetric). For a general non-symmetric matrix, this is false.

    Step 3: Check Option C. Singular values are always non-negative, while eigenvalues of a general matrix can be negative or complex. So is false in general.

    Step 4: Check Option D. This omits the square root. The eigenvalues of are the squares of the singular values, not the singular values themselves.

    Answer: Option B is correct.

    Question 7 · Linear Algebra MCQ

    For a real symmetric matrix , which of the following conditions is equivalent to being positive definite?

    1. A.

      All eigenvalues of are strictly positive

    2. B.

      All eigenvalues of are non-negative

    3. C.

      The determinant of is zero

    4. D.

      The trace of is negative

    Correct Answer:

    A

    Step-by-Step Solution

    Key idea: This is a core property question linking positive definiteness to eigenvalues.

    Step 1: By definition, a symmetric matrix is positive definite if for all non-zero vectors .

    Step 2: For an eigenvector with eigenvalue , we have .

    Step 3: Since , . For to hold, we must have .

    Step 4: This must be true for all eigenvectors, so all eigenvalues must be strictly positive.

    Answer: Option A is correct.

    Question 8 · Linear Algebra MCQ

    A real symmetric matrix satisfies for every non-zero vector . By definition, what is such a matrix called?

    1. A.

      Positive semi-definite

    2. B.

      Positive definite

    3. C.

      Orthogonal

    4. D.

      Skew-symmetric

    Correct Answer:

    B

    Step-by-Step Solution

    Key idea: This is a definition-recall question on positive definiteness.

    Step 1: The condition for all is the definition of a positive definite matrix.

    Step 2: Positive semi-definite would require (allowing equality for some non-zero ).

    Step 3: Orthogonal matrices satisfy , which is unrelated to the sign of .

    Step 4: Skew-symmetric matrices satisfy , and for these for all .

    Answer: Option B is correct.

    Question 9 · Linear Algebra MCQ

    If a real symmetric matrix has eigenvalues , then is:

    1. A.

      Positive Definite

    2. B.

      Negative Definite

    3. C.

      Indefinite

    4. D.

      Positive Semi-Definite

    Correct Answer:

    C

    Step-by-Step Solution

    Key idea: Classifying a matrix based on the signs of its eigenvalues.

    Step 1: Recall the classification rules for symmetric matrices using eigenvalues.

    Step 2: Positive Definite: All .

    Step 3: Negative Definite: All .

    Step 4: Positive Semi-Definite: All (at least one 0).

    Step 5: Indefinite: Some and some .

    Step 6: Here, we have and .

    Step 7: Since there are both positive and negative eigenvalues, is Indefinite.

    Question 10 · Linear Algebra NAT

    A matrix has exactly two non-zero singular values. What is the rank of ?

    Correct Answer:

    2

    Step-by-Step Solution

    Key idea: This is a direct-recall question linking the rank of a matrix to its singular values.

    Step 1: Recall the fundamental relationship between rank and singular values. The rank of a matrix is exactly equal to the number of its non-zero singular values.

    Step 2: The problem states that the matrix has exactly two non-zero singular values.

    Step 3: Therefore, the rank of is exactly .

    Step 4: The dimensions of the matrix () are extra information and do not change this fundamental property.

    Answer: 2

    More short notes in this unit