A Hermitian matrix is a square matrix with complex entries that equals its conjugate transpose. Thus, a matrix is Hermitian if
where , also written , is obtained by transposing and taking the complex conjugate of every entry. Hermitian matrices are the complex counterparts of real symmetric matrices. They are fundamental in linear algebra because their eigenvalues are real and they admit orthonormal eigenvector bases, properties central to optimization, numerical computation, statistics, and quantum mechanics.
Definition and examples
For a complex number , its conjugate is . The Hermitian condition requires entries on opposite sides of the main diagonal to be complex conjugates. Every diagonal entry must therefore be a real number, since
For example,
is Hermitian. By contrast,
is not Hermitian: its two off-diagonal entries are equal rather than conjugates.
A real matrix is Hermitian exactly when it equals its transpose, so the real case reduces to symmetry. For complex matrices, symmetry and Hermitian symmetry are distinct conditions.
Every Hermitian matrix can be written uniquely as
where is a real symmetric matrix and is a real skew-symmetric matrix:
In particular, the imaginary part of every diagonal entry is zero.
The terminology honors the French mathematician Charles Hermite, whose name is also associated with Hermitian forms.
Interpretation as a self-adjoint linear map
On , use the standard inner product
A matrix is Hermitian exactly when
for all vectors . Thus it represents a self-adjoint operator with respect to this inner product.
This statement depends on the inner product and the coordinates used. A self-adjoint linear map has a Hermitian matrix in any orthonormal basis, but its matrix in an arbitrary basis need not be Hermitian.
More generally, if an inner product has the coordinate expression
where is Hermitian positive definite, then a coordinate matrix represents a self-adjoint map precisely when
The familiar condition is the special case .
Spectral properties
The finite-dimensional spectral theorem states that is Hermitian if and only if
where is a unitary matrix and
has real diagonal entries.
The columns of form an orthonormal basis of eigenvectors. Consequently:
- Every eigenvalue is real.
- Eigenvectors associated with distinct eigenvalues are orthogonal.
- Each eigenvalue’s algebraic multiplicity equals the dimension of its eigenspace.
- Every Hermitian matrix is diagonalizable, including when eigenvalues are repeated.
Why the eigenvalues are real
Suppose with . Then
Hermitian symmetry gives
so is real. Since ,
This argument explains why Hermitian symmetry constrains eigenvalues and eigenvectors so strongly. Merely having real eigenvalues, however, does not make a matrix Hermitian: the unitary diagonalization condition is essential.
Spectral projections
Let be the distinct eigenvalues of . Then
where is the orthogonal projection onto the eigenspace associated with . These projections satisfy
This representation separates the action of into independent real scalings on mutually orthogonal subspaces.
Quadratic forms and definiteness
For a Hermitian matrix , the expression
is real for every . It is the complex analogue of a real quadratic form, often called a Hermitian form when expressed through its associated sesquilinear form .
Conversely, if a complex square matrix satisfies for every complex vector , then it is Hermitian. Requiring the condition for every complex vector is important; testing only real vectors does not suffice.
Hermitian matrices are classified by the signs of these values:
| Type | Condition for every nonzero | Eigenvalue condition |
|---|---|---|
| Positive definite | All eigenvalues are positive | |
| Positive semidefinite | All eigenvalues are nonnegative | |
| Negative definite | All eigenvalues are negative | |
| Negative semidefinite | All eigenvalues are nonpositive | |
| Indefinite | Takes both positive and negative values | Has both positive and negative eigenvalues |
A positive definite matrix is necessarily invertible. A positive semidefinite matrix may be singular.
For any complex matrix , the Gram matrix
is Hermitian positive semidefinite because
It is positive definite exactly when the columns of are linearly independent. Conversely, every Hermitian positive semidefinite matrix can be factored as .
For example,
has eigenvalues
It is positive definite exactly when
Rayleigh quotient and variational characterization
For , the Rayleigh quotient is
If the eigenvalues are ordered as
then
The extreme values are attained at eigenvectors:
More generally, intermediate eigenvalues have minimax characterizations over subspaces. These connect spectral theory to mathematical optimization and underpin many eigenvalue approximation methods.
The spectral norm satisfies
If is invertible, its spectral condition number is
Thus Hermitian symmetry does not guarantee good conditioning: an eigenvalue very close to zero can make a matrix highly ill-conditioned.
Algebraic structure
Hermitian matrices are closed under addition and multiplication by real scalars. The Hermitian matrices therefore form a real vector space of dimension : there are real diagonal parameters and two real parameters for each of the entries above the diagonal.
They do not form a complex vector space. If is Hermitian, then is skew-Hermitian:
Several useful closure properties follow directly:
- If is invertible and Hermitian, its inverse is Hermitian.
- If and are Hermitian, then is Hermitian exactly when .
- If is Hermitian, then is Hermitian for every compatible matrix .
- Every principal submatrix of a Hermitian matrix is Hermitian.
- Every polynomial in with real coefficients is Hermitian.
Every complex square matrix has a unique decomposition
where both and are Hermitian.
The trace and determinant of a Hermitian matrix are real:
Neither is necessarily positive.
Functions of a Hermitian matrix
The spectral decomposition defines matrix functions through
Whenever is real-valued on the eigenvalues, is Hermitian.
Important cases include:
- A positive semidefinite matrix has a unique positive semidefinite square root.
- A positive definite matrix has a unique Hermitian logarithm.
- For Hermitian , the matrix exponential is positive definite.
- For real , the matrix is unitary.
The last property connects Hermitian generators with unitary evolution.
Applications
Quantum mechanics
In finite-dimensional quantum mechanics, observables are represented by Hermitian operators. Their eigenvalues are possible measurement outcomes, and their orthogonal spectral projections specify the associated measurement probabilities.
A quantum state represented by a density matrix is Hermitian positive semidefinite and has trace one. A Hermitian Hamiltonian generates unitary time evolution, for a time-independent system, through
where is the reduced Planck constant.
In infinite-dimensional Hilbert spaces, the corresponding theory requires care with operator domains. For unbounded operators, symmetry alone is weaker than self-adjointness; the finite-dimensional matrix equivalence does not transfer without qualification.
Statistics and signal processing
For a complex random vector with mean , its covariance matrix
is Hermitian positive semidefinite. Its eigenvalues measure variation along orthogonal directions, supporting principal component analysis for complex data.
Hermitian covariance and spectral-density matrices also occur in multichannel signal processing, array processing, and frequency-domain analysis.
Optimization
Positive semidefinite Hermitian matrices form a convex cone. Constraints of the form
where each is Hermitian, are linear matrix inequalities. They are central to semidefinite programming, a branch of convex optimization.
Numerical computation
Algorithms in numerical linear algebra exploit Hermitian structure to reduce storage and computation. Only one triangular part and the real diagonal need to be stored.
Dense Hermitian eigenvalue algorithms commonly reduce the matrix to real symmetric tridiagonal form using unitary transformations, then solve the tridiagonal eigenproblem. For large sparse matrices, iterative methods can estimate selected eigenvalues without computing the full spectrum.
Positive definite Hermitian systems admit Cholesky decomposition,
where is lower triangular with positive real diagonal entries. Indefinite Hermitian matrices generally require other factorizations, often with pivoting.
Perturbations and computational limitations
Hermitian eigenvalues obey strong perturbation bounds. If and are Hermitian and their eigenvalues are arranged in increasing order, then
Thus a small Hermitian perturbation cannot move an eigenvalue by more than the perturbation’s spectral norm.
Eigenvectors can be much more sensitive. When eigenvalues are close together, small perturbations may substantially rotate individual eigenvectors, even though the invariant subspace associated with the cluster is more stable.
In floating-point computation, an intended Hermitian matrix may acquire a small non-Hermitian component. Replacing by
removes that component and is the orthogonal projection onto the Hermitian matrices under the real Frobenius inner product. This operation enforces Hermitian symmetry but does not ensure positive semidefiniteness or correct errors in the underlying data.