Hermitian and unitary matrices, diagonalisation
Mathematical methods · 78 questions and templates for GATE Physics, in order from warm-up to top rank. Check each answer, then read the full solution.
New to this topic? Read the lesson first: Hermitian and unitary matrices, diagonalisation.
Loading questions… (they need JavaScript; nothing you type is sent anywhere)
Written questions with solutions
The same questions as a list, so you can print them or read without the practice box. Templates (fresh numbers) appear only in the practice box above.
-
MCQWarm-up
Which of these numbers can be an eigenvalue of a unitary matrix?Answer and solution
Answer: B
If then , and a unitary matrix preserves lengths, so . Only has modulus 1; .Why people get this wrong: has the right angle but the wrong length.
-
NATWarm-up
A Hermitian matrix has eigenvalues and . The value of is ______.Answer and solution
Answer: 14
has eigenvalues : . The trace is their sum, .Why people get this wrong: Squaring the trace, , is not the trace of the square.
-
MCQWarm-up
For , which statement is true?- is Hermitian
- is anti-Hermitian
- is unitary
- is nilpotent
Answer and solution
Answer: C
, which is neither nor . But , so : unitary. is symmetric, not Hermitian; for complex matrices the two are different.Why people get this wrong: Symmetric () is not Hermitian () once entries are complex.
-
MCQWarm-up
If is unitary and is Hermitian, the matrix is- unitary
- Hermitian with eigenvalues the complex conjugates of those of
- always diagonal
- Hermitian with the same eigenvalues as
Answer and solution
Answer: D
: Hermitian. Since it is similar to , so it has the same eigenvalues (real, so conjugating changes nothing). It is diagonal only for the right choice of .Why people get this wrong: A unitary change of basis keeps the spectrum; only one special makes the matrix diagonal.
-
MCQWarm-up
Two Hermitian matrices can be diagonalised by the same unitary matrix if and only if they- commute
- have the same trace
- are multiples of each other
- are both invertible
Answer and solution
Answer: A
If and , then because diagonal matrices commute. Conversely, commuting Hermitian matrices share a complete orthonormal set of eigenvectors. In quantum mechanics: commuting observables have a common eigenbasis.Why people get this wrong: Being multiples of each other is enough but far from necessary.
-
NATWarm-up
A anti-Hermitian matrix () has trace and one eigenvalue . The imaginary part of its other eigenvalue is ______.Answer and solution
Answer: -2
The eigenvalues add to the trace: , so , imaginary part . (Anti-Hermitian eigenvalues are purely imaginary, since is Hermitian.)Why people get this wrong: Answering by dropping the sign.
-
MCQWarm-up
The eigenvalues of are- and
- and
- and
- and
Answer and solution
Answer: B
For a triangular matrix, , so the eigenvalues are the diagonal entries, 2 and . Check: their sum is the trace and their product is the determinant.Why people get this wrong: The off-diagonal 5 does not appear among the eigenvalues of a triangular matrix.
-
MCQStandard
The eigenvalues of the permutation matrix are ()Answer and solution
Answer: B
Moving each entry one place round three times brings it back, so and every eigenvalue obeys . is unitary with trace 0 and determinant 1; the cube roots of unity add to 0 and multiply to 1, as needed. (Directly: .)Why people get this wrong: would need (a unitary matrix with only eigenvalue 1 is the identity).
-
NATStandard
With and the Pauli matrices, the value of is ______.Answer and solution
Answer: 3
and the trace is 0, so its eigenvalues are and . Then has eigenvalues 3 and 1, and determinant 3.Why people get this wrong: Writing out the matrix works too, but the eigenvalue route takes ten seconds.
-
MSQStandard
A matrix is normal if . Which statements are true?- Every normal matrix can be diagonalised by a unitary matrix
- Eigenvectors of a normal matrix belonging to different eigenvalues are orthogonal
- Every normal matrix has real eigenvalues
- Hermitian, anti-Hermitian and unitary matrices are all normal
Answer and solution
Answer: A, B, D
The spectral theorem holds exactly for normal matrices: , so the eigenvectors (columns of ) are orthonormal. Each of , , makes commute with . Eigenvalues are real only for the Hermitian ones; a unitary matrix like is normal with eigenvalue .Why people get this wrong: Normality gives orthogonal eigenvectors, not real eigenvalues.
-
NATStandard
The difference between the two eigenvalues of the Hermitian matrix is ______.Answer and solution
Answer: 5
Trace , determinant . So , or , difference 5. Quick formula: the difference is .Why people get this wrong: , so the determinant is , not .
-
MCQStandard
Which unitary matrix makes diagonal?Answer and solution
Answer: C
The columns of must be the normalised eigenvectors of : for and for . That is the Hadamard matrix, and . The first two options commute with nothing useful: and , still off-diagonal.Why people get this wrong: The last option is unitary, but its columns and are not eigenvectors of .
-
MCQStandard
The matrix equalsAnswer and solution
Answer: B
Because , the series splits into even and odd parts: . At : .Why people get this wrong: Forgetting the factor from the odd terms gives .
-
NATStandard
For , the value of is ______ (to two decimal places).Answer and solution
Answer: 2.5 (±0.01)
has eigenvalues , so has eigenvalues and . Trace .Why people get this wrong: Exponentiating entry by entry gives (), which is wrong.
-
MSQStandard
Which of these matrices can be diagonalised (over the complex numbers)?Answer and solution
Answer: A, C
Distinct eigenvalues always give a full set of eigenvectors: the first has 1 and 2, the third has . The second has eigenvalue 2 twice but has rank 1, so only one eigenvector. The fourth is nilpotent and non-zero: eigenvalue 0 twice with one eigenvector, so it is not diagonalisable.Why people get this wrong: Complex eigenvalues are no obstacle over ; repeated eigenvalues with too few eigenvectors are.
-
MCQStandard
A real orthogonal matrix has determinant . Its eigenvalues are- for some
- and
- and
- and
Answer and solution
Answer: D
Eigenvalues have modulus 1 and multiply to . A complex pair multiplies to , so both must be real: and . Geometrically it is a reflection: the mirror line is kept (), the perpendicular direction is flipped ().Why people get this wrong: belongs to rotations, which have determinant .
-
NATStandard
with projectors and . The top-right entry of the positive square root is ______ (to three decimal places).Answer and solution
Answer: -0.411 (±0.003)
This is a spectral decomposition (, ), so . Then and its top-right entry is .Why people get this wrong: Taking square roots of the entries of is not .
-
NATStandard
A matrix has eigenvalues , and . The value of is ______.Answer and solution
Answer: 20
If then , so has eigenvalues . The determinant is their product, .Why people get this wrong: : the determinant is not additive.
-
MCQStandard
For , the Cayley-Hamilton theorem givesAnswer and solution
Answer: D
A matrix satisfies . Here and , so , i.e. . Check: .Why people get this wrong: Sign slip with the negative determinant gives .
-
MSQStandard
for an invertible . Which properties must and share?- The same eigenvalues
- The same eigenvectors
- The same rank
- If is symmetric, so is
Answer and solution
Answer: A, C
: same characteristic polynomial, so same eigenvalues (and trace and determinant). Multiplying by invertible matrices does not change rank. But if then : the eigenvectors are transformed by , not shared. Symmetry survives only for orthogonal (): for example and the shear give , which is not symmetric.Why people get this wrong: Similar matrices describe the same map in different bases: basis-free things (eigenvalues, rank) agree; components (eigenvector entries, symmetry) need not.
-
NATExam level
The circulant matrix has one real eigenvalue and two complex ones. The product of the two complex eigenvalues is ______.Answer and solution
Answer: 3
Each row sums to 6, so is an eigenvector with eigenvalue 6. The determinant is , the product of all three, so the complex pair multiplies to . (Directly: and its conjugate, with .)Why people get this wrong: Missing the row-sum eigenvector makes this a long cubic.
-
MCQExam level
A matrix has characteristic polynomial . By the Cayley-Hamilton theorem, equalsAnswer and solution
Answer: A
, so and . Check with the eigenvalues 1, 2, 3: for , ✓.Why people get this wrong: Moving across the equals sign flips its sign; slipping here gives the second option.
-
NATExam level
For , the top-left entry of is ______ (to two decimal places).Answer and solution
Answer: 4.19 (±0.01)
, so for . Then . Top-left: . (Or: eigenvalues 2 and 0 with projectors and .)Why people get this wrong: Entry-wise exponentiation gives .
-
MSQExam level
Let be Hermitian and . Which statements are true?- is unitary
- The eigenvalues of are , with the eigenvalues of
- is Hermitian
Answer and solution
Answer: A, B, C
, and since commutes with itself: unitary. In the eigenbasis of , is diagonal with entries . . is Hermitian only if every is real ( a multiple of ).Why people get this wrong: This is why time evolution is unitary: the Hamiltonian is Hermitian.
-
MCQExam level
Which matrix commutes with ?Answer and solution
Answer: C
has distinct eigenvalues (3 and 1), so a matrix commutes with it exactly when it shares the eigenvectors and , that is when it has the form . Only the third option does (). For example but .Why people get this wrong: Multiplying out is safe but slow; check whether the candidate shares the eigenvectors.
-
NATExam level
Let . The value of is ______.Answer and solution
Answer: 7
with and : rank 1. Its eigenvalues are (eigenvector ) and . So has eigenvalues and determinant 7. This is the matrix determinant lemma .Why people get this wrong: ; here would give 1.
-
MCQExam level
A non-zero matrix satisfies . The largest possible rank of isAnswer and solution
Answer: B
means everything in the image of is sent to zero, so and . Hence rank , reached by in blocks.Why people get this wrong: All eigenvalues are 0, but that alone does not fix the rank.
-
NATExam level
The value of is ______ (to two decimal places).Answer and solution
Answer: 1 (±0.01)
Write the exponent as with and . Since , . The Pauli part is traceless, so the trace is .Why people get this wrong: Taking the angle as forgets that ; pull out the unit vector first.
-
MCQExam level
matrices and have eigenvalues and . For the Kronecker product ,- ,
- ,
- ,
- ,
Answer and solution
Answer: D
The eigenvalues of are all products : . Sum (also ). Product (also ).Why people get this wrong: The eigenvalues of multiply, they do not add; adding gives the spectrum of .
-
MSQExam level
For a Hermitian matrix , which conditions are each equivalent to being positive definite?- All eigenvalues of are positive
- for every non-zero
- All diagonal entries of are positive
- for some invertible
Answer and solution
Answer: A, B, D
In the eigenbasis , which is positive for all exactly when every . If so, works; conversely . Positive diagonal entries are necessary but not enough: has eigenvalue .Why people get this wrong: Positive diagonal entries follow from positive definiteness, not the other way round.