Skip to main content

Welcome to a Grasp lesson

Create a free account to keep studying and create your own study path.

Lesson 28

Symmetric and Hermitian Matrices

Recommended resources

Hello! Welcome to the first lesson of our new module, where we'll explore some of the most important and "well-behaved" matrices in linear algebra.

In the previous module, we saw the power of diagonalization for computing matrix powers. However, we also noted a key limitation: not all matrices are diagonalizable. This raises a crucial question: can we identify a class of matrices that are guaranteed to be diagonalizable and possess other useful properties?

The answer is a resounding yes! This lesson introduces that class. Our goal is to define symmetric and Hermitian matrices. These matrices are not just mathematical curiosities; they are absolutely central to your future studies. Symmetric matrices are fundamental in deep learning for optimization and data analysis, while their complex counterparts, Hermitian matrices, are the foundation for representing physical measurements in quantum mechanics.

1. Symmetric Matrices: The Real Case

Let's start in the familiar territory of real numbers. You've encountered the transpose of a matrix, , which is formed by flipping the matrix across its main diagonal. A symmetric matrix is simply a matrix that is its own transpose.

Definition: Symmetric Matrix
A square matrix with real entries is symmetric if it is equal to its transpose:

This means that for any row index and column index , the element is equal to the element .

For example, this matrix is symmetric:

To formalize this and see a list of key properties, please read the first section of the following resource.

Special Matrix Types

This article from 'Math for AI' provides a clear, concise definition of a symmetric matrix.

Read the section titled 'Symmetric matrix'. Focus on the definition A = Aᵀ and how it relates to the individual elements (A_ij = A_ji).

Symmetric matrices are special for two incredible reasons that we will prove in later lessons:

  1. All of their eigenvalues are real numbers.
  2. They always have a full set of orthogonal eigenvectors, which means they are always diagonalizable.

To get a first look at these remarkable properties and why they are so important, let's watch the beginning of a classic lecture by Prof. Gilbert Strang.

25. Symmetric Matrices and Positive Definiteness

Prof. Strang introduces symmetric matrices and immediately highlights their two most important properties: real eigenvalues and orthogonal eigenvectors. This gives great intuition for why we care about them.

Watch the first four minutes of the video (from 0:08 to 4:20). Pay close attention to the two main facts he states about the eigenvalues and eigenvectors of symmetric matrices.


2. Generalizing to Complex Numbers: The Conjugate Transpose

Your goal of studying quantum mechanics requires us to work with complex numbers. If we simply apply the definition of symmetry () to complex matrices, we unfortunately lose the guaranteed real eigenvalues. We need a new definition that preserves this crucial property.

This "correct" generalization involves a new operation: the conjugate transpose. This operation, as its name suggests, involves two steps:

  1. Complex Conjugate: Take the complex conjugate of every entry in the matrix. The conjugate of a number is .
  2. Transpose: Take the transpose of the resulting matrix.

This combined operation is also called the Hermitian conjugate or adjoint, and is denoted by a dagger symbol () or a superscript . So, .

The following video provides an excellent step-by-step guide through complex matrices and the definition of the conjugate transpose.

Complex, Hermitian, and Unitary Matrices

This video from 'Professor Dave Explains' clearly breaks down the concepts of complex matrices, their conjugates, and the all-important conjugate transpose operation.

Watch from the beginning up to 5:01. The video will guide you through: What a complex matrix is. How to find the complex conjugate of a matrix. How to find the conjugate transpose (Hermitian transpose), denoted Mᴴ or M†.


3. Hermitian Matrices: The Complex Analogue of Symmetry

Now that we have the conjugate transpose operation, we can define the complex analogue of a symmetric matrix.

Definition: Hermitian Matrix
A square matrix with complex entries is Hermitian if it is equal to its own conjugate transpose:

This means that for any row index and column index , the element is equal to the complex conjugate of the element , or .

Notice that if a matrix contains only real numbers, the conjugation step does nothing (), so . This means a real Hermitian matrix is simply a symmetric matrix. The Hermitian property is the more general concept.

Let's continue with the video to see this definition in action.

Complex, Hermitian, and Unitary Matrices

The video now uses the concept of the conjugate transpose to define a Hermitian matrix and provides a clear example.

Watch the segment from 5:01 to 5:48. It provides a concise definition and a worked example of a Hermitian matrix.

The image below gives a perfect summary of the definition and an important consequence.

Definition and Example of a Hermitian Matrix
This image provides two equivalent definitions for a Hermitian matrix: one using matrix notation (\(A = A^*\), where \(A^*\) is the conjugate transpose) and another based on individual elements (\(a_{ij} = \overline{a_{ji}}\)). It also illustrates a key property: the diagonal elements must be real, since a number equal to its own conjugate must have a zero imaginary part.

To solidify this, let's return to our text resource.

Special Matrix Types

This section on Hermitian matrices will reinforce the definition and formally prove why the diagonal elements must be real.

Read the section 'Hermitian matrix'. Pay attention to the definition A = A† and the short proof for why the diagonal elements must be real numbers.

Just like symmetric matrices, Hermitian matrices are guaranteed to have real eigenvalues and a full set of orthogonal eigenvectors, making them central to the mathematics of quantum mechanics.

Test your understanding!

For each of the following matrices, determine if it is symmetric, Hermitian, or neither.

Show answer
  1. Matrix A is Hermitian. The diagonal elements (1, 3) are real. The off-diagonal element is the complex conjugate of . So, .
  2. Matrix B is Symmetric, but not Hermitian. is equal to , so . However, is not the conjugate of (), so it is not Hermitian.
  3. Matrix C is Hermitian. The diagonal elements (0, 0) are real. The off-diagonal element is the complex conjugate of . So, . (This is a famous matrix in physics, related to the Pauli spin matrices!)
  4. Matrix D is neither. is not equal to , so it's not symmetric. Since it's a real matrix, not being symmetric also means it's not Hermitian.

Conclusion

In this lesson, we have defined two exceptionally important types of matrices that form the bedrock for many advanced applications.

Key Takeaways:

  • A symmetric matrix is a real matrix that equals its own transpose ().
  • The conjugate transpose () of a matrix is found by taking the transpose and then the complex conjugate of every element.
  • A Hermitian matrix is a complex matrix that equals its own conjugate transpose ().
  • The Hermitian property is a generalization of the symmetric property to complex spaces. A real Hermitian matrix is a symmetric matrix.
  • Key properties of Hermitian matrices include having real diagonal elements. More importantly (as we will see), they always have real eigenvalues.

Preview of the Next Lesson:

We've stated that symmetric and Hermitian matrices have real eigenvalues. In the next lesson, we will prove this fundamental property. The proof itself is elegant and will make use of the conjugate transpose operation we learned today, further highlighting its importance for working in complex vector spaces. This will be our first major step in building the mathematical framework required for quantum mechanics.