Module 1: Mathematical physics · Lesson 1.2 · about 55 min
Hermitian and unitary matrices, diagonalisation
Hermitian, anti-Hermitian, unitary and normal matrices and where their eigenvalues live, unitary diagonalisation and the spectral theorem, commuting matrices, functions of matrices from Pauli exponentials to Jordan blocks, Cayley-Hamilton, and the trace and determinant tricks that save minutes in GATE.
Module 1 · about 55 minutes. By the end you will be able to say at a glance where the eigenvalues of a special matrix must lie, diagonalise Hermitian and normal matrices with a unitary change of basis, decide when two matrices can be diagonalised together, compute functions of matrices (exponentials, square roots, powers) without long multiplication, and use the Cayley-Hamilton theorem and trace and determinant tricks under exam time pressure. The basics (characteristic equation, 2 × 2 eigenvalues, inverse, rank) are in the IIT JAM lesson on matrices and eigenvalues; here we go one level deeper. The language of the previous lesson on vector spaces and Dirac notation is used throughout.
1. The family and where its eigenvalues live
For a complex square matrix, is the conjugate transpose. Four kinds matter in physics:
| Kind | Definition | Eigenvalues |
|---|---|---|
| Hermitian | real | |
| anti-Hermitian | purely imaginary (or 0) | |
| unitary | modulus 1 (on the unit circle) | |
| normal | anywhere |
All three special kinds are normal, and normality is exactly the condition for being diagonalised by a unitary matrix. The eigenvalue facts take one line each:
- Hermitian: , so is real.
- Anti-Hermitian: is Hermitian, so is imaginary. Real antisymmetric matrices are the real case: eigenvalues , determinant , and .
- Unitary: , so . A real orthogonal with determinant is a reflection with eigenvalues and .
Careful with complex matrices: symmetric is not Hermitian. is symmetric, but . In fact , so is unitary, with eigenvalues on the unit circle.
- Hermitian H
- an observable: its eigenvalues are the possible results of a measurement
- Unitary U
- a change of basis or a time evolution that keeps all probabilities and overlaps
- U†HU
- the same observable written in another orthonormal basis: same eigenvalues, different matrix
- [A, B] = 0
- A and B can be measured together: they have a common eigenbasis
- Physical meaning
- Diagonalising H means finding the states with definite values (energies, spins, normal-mode frequencies); every other state is a superposition of these.
2. Unitary diagonalisation and the spectral theorem
If is normal, its normalised eigenvectors are orthonormal and can be put as the columns of a unitary :
The second form, the spectral decomposition, is the most useful: the projectors satisfy and , so any function acts eigenvalue by eigenvalue:
Worked example. has eigenvectors and , so the Hadamard matrix gives . Now take with and . The positive square root is , whose top-right entry is . Taking square roots of the entries of would be nonsense.
Quadratic forms and principal axes. A real symmetric is diagonalised by a rotation, so the curve becomes in the eigenvector axes: an ellipse if both eigenvalues are positive, a hyperbola if they have opposite signs, empty if both are negative. The off-diagonal entry tilts the axes and decides the shape: has eigenvalues 3 and , a hyperbola.
The same idea solves small oscillations with unequal masses: with trial solution gives the generalised eigenvalue problem
For and this is , so . Diagonalising alone would ignore the masses. For a refresher on normal modes with equal masses, see the JAM lesson on superposition and coupled oscillators.
3. Commuting matrices
Theorem. Two diagonalisable matrices can be diagonalised by the same similarity transformation exactly when they commute. For Hermitian matrices the common transformation is unitary.
One direction is immediate: diagonal matrices commute. For the other, if and , then , so maps each eigenspace of into itself.
- If every eigenvalue of is non-degenerate, each eigenspace is a line, so every eigenvector of is an eigenvector of : is diagonal in ’s eigenbasis (in fact a polynomial in ).
- If is degenerate, only has to be block-diagonal: inside a degenerate eigenspace you must diagonalise separately. That is how quantum mechanics labels states with several quantum numbers (energy, then , then ).
Quick test. has distinct eigenvalues with eigenvectors , so the matrices that commute with it are exactly ; qualifies and does not.
4. Functions of matrices
Define by the power series of . Four methods cover every GATE question:
-
Diagonalise: , eigenvalue by eigenvalue. Eigenvalues of are , so and . For , .
-
A matrix that squares to itself or to the identity. If (any unit vector ), the series splits into even and odd parts:
So and . If (as for any rank-one matrix with trace ), then and .
-
Jordan blocks (not diagonalisable). For with , Taylor expansion stops after one term: . So and .
-
Cayley-Hamilton reduces any power series to a polynomial of degree (next section).
Two identities to know by heart: for every square matrix, and is unitary whenever is Hermitian (which is why time evolution conserves probability). But unless and commute. When commutes with both, (the simplest Baker-Campbell-Hausdorff formula, used for and ).
5. Cayley-Hamilton at GATE level
Every square matrix satisfies its own characteristic equation . Uses beyond the reduction you saw in JAM:
- Inverses without row reduction. If , then , so .
- High powers. Divide by ; only the remainder (degree below ) survives. For with distinct eigenvalues, where for both eigenvalues. The Fibonacci matrix gives , with from its eigenvalues .
- Adjugate. has eigenvalues ; for , .
6. Trace and determinant tricks
Worked example (rank one). Find for .
- Every row is a multiple of : with , .
- , and anything orthogonal to is sent to zero: eigenvalues .
- has eigenvalues , so .
More shortcuts that GATE rewards:
- Spectrum fixed by an equation. forces eigenvalues ; the trace then counts them. A Hermitian with and trace 2 has eigenvalues and . A real with has eigenvalues (complex roots of a real polynomial pair up) and .
- Equality in the triangle inequality. A unitary with trace 3 has three unit-modulus eigenvalues adding to 3, so all equal 1; being normal it is diagonalisable, hence .
- Circulants and permutations. A matrix whose rows are cyclic shifts has eigenvectors built from roots of unity; the row sum is always an eigenvalue (eigenvector ). The cyclic permutation of three objects has eigenvalues .
- Kronecker products. has eigenvalues : and for of size and of size .
- Positive definite Hermitian matrices: all eigenvalues positive, equivalently for all , equivalently with invertible. Positive diagonal entries are necessary but not sufficient.
- Nilpotent: if then the image of lies in its kernel, so .
“If all the eigenvalues of a matrix equal 1, the matrix is the identity.” Only if the matrix is diagonalisable. The shear has eigenvalue 1 twice but only one eigenvector, and it is certainly not . For normal matrices (Hermitian, unitary, anti-Hermitian) the conclusion is safe, because they are always diagonalisable: . Before reading off a matrix from its eigenvalues, ask whether it is normal.
Check your diagonalisations in fibub’s matrix calculator, and watch a matrix act on vectors with the matrix transform tool.
- Hermitian: real eigenvalues. Anti-Hermitian: imaginary. Unitary: modulus 1. All three are normal, and normal matrices are exactly the unitarily diagonalisable ones. Complex symmetric is not Hermitian.
- Spectral decomposition gives ; , , .
- ; for a Jordan block ; only if they commute.
- Commuting diagonalisable matrices share an eigenbasis; with degeneracy, diagonalise the second matrix inside each eigenspace.
- Small oscillations: . Quadratic forms: the signs of the eigenvalues decide ellipse or hyperbola.
- Cayley-Hamilton gives inverses and high powers; is the sum of pairwise eigenvalue products; .
Practise: exam questions on this lesson
From warm-up to top-rank level, with full solutions. For the BSc-level basics, the JAM matrices questions are a good warm-up. More on the GATE practice page for this topic.
Before this: lesson 1.1, linear vector spaces and Dirac notation. Next: lesson 1.3, analytic functions and Cauchy’s theorem. Back to the GATE Physics course home.
Going on to CSIR NET? Group theory for physicists shows how unitary matrices like these form groups such as SU(2).
Check yourself
Sources
- G. Strang, Introduction to Linear Algebra, 5th ed. (2016), chapters 6 and 7
- R. A. Horn and C. R. Johnson, Matrix Analysis, 2nd ed. (2013), chapters 1, 2 and 4
- G. B. Arfken, H. J. Weber and F. E. Harris, Mathematical Methods for Physicists, 7th ed. (2013), chapter 6
- H. Goldstein, C. Poole and J. Safko, Classical Mechanics, 3rd ed. (2002), chapter 6 (small oscillations)
- GATE Physics (PH) syllabus, Mathematical Physics section, published by the organising institute each year
Your ticks stay in this browser. Save them as a file on the course home.
Updated 2026-11-22. Not affiliated with the IITs, IISc or the GATE organising institute. The general aptitude part of GATE is not covered here. Check the official GATE website for the current pattern. All questions are original.