Skip to content

A.1

Linear algebra reference

Vector spaces, inner products, eigenvalues, diagonalisation and tensor products — all in quantum mechanics' own notation, so you can look things up and head straight back to the main text.

Recommended first

  • High-school vectors and complex arithmetic

After this section you should be able to

  • Translate "states are vectors, observables are Hermitian operators" into concrete matrix computations
  • Find the eigenvalues and eigenvectors of a 2×2 Hermitian matrix and carry out the diagonalisation
  • Compute the tensor product of two small systems and read the subscripts of a many-body state

This section is a reference table doubling as a remedial station. If a word like “eigenvalue”, “unitary” or “tensor product” stops you in the main text, come here, find the matching subsection, read the minimum necessary explanation plus one worked example, and go back to reading. All notation follows the quantum-mechanical conventions (ψ\ket{\psi} rather than a column vector v\vec v), so any result you look up can be carried back into the main text verbatim.

Where the main text needs this: the whole of Chapter 3 is built on this language; 5.3 Spin 1/2 and 9.1 Qubits are the home turf of 2×2 matrices; 8.1 Identical particles and 9.3 Entanglement cannot do without tensor products.

Vector spaces and inner products

A vector space is, plainly put, “a set plus two rules”: the elements of the set (here called state vectors ψ\ket{\psi}) can be added together and multiplied by complex numbers, and the result stays inside the set. The superposition principle of quantum mechanics — a superposition of two allowed states is still an allowed state — is at bottom the statement that “states form a vector space”.

An inner product is a rule assigning a complex number ϕ|ψ\braket{\phi}{\psi} to every pair of vectors; it measures how much two states “resemble” each other. Three properties are required:

PropertyFormulaIn plain words
Conjugate symmetryϕ|ψ=ψ|ϕ\braket{\phi}{\psi}=\braket{\psi}{\phi}^*Swapping the order means taking the complex conjugate
Linear in the right slotϕ|aψ1+bψ2=aϕ|ψ1+bϕ|ψ2\braket{\phi}{a\psi_1+b\psi_2}=a\braket{\phi}{\psi_1}+b\braket{\phi}{\psi_2}Linear in the second argument
Positive definiteψ|ψ0\braket{\psi}{\psi}\ge 0, with equality only for ψ=0\ket{\psi}=0The inner product of a state with itself is its “length squared”

Mind the second row: the physics convention is linear on the right, conjugate-linear on the left (aϕ=aϕ\bra{a\phi}=a^*\bra{\phi}) — the opposite of most mathematics textbooks.

Two consequences you will use constantly:

Cauchy–Schwarz:ϕ|ψ2ϕ|ϕψ|ψ(A.1.1)\text{Cauchy–Schwarz:}\quad |\braket{\phi}{\psi}|^2\le\braket{\phi}{\phi}\braket{\psi}{\psi}\tag{A.1.1}

This inequality is the mathematical backbone of the uncertainty principle. The normalisation condition ψ|ψ=1\braket{\psi}{\psi}=1 corresponds to total probability 1.

Orthonormal basis: a set {ei}\{\ket{e_i}\} satisfying ei|ej=δij\braket{e_i}{e_j}=\delta_{ij}. Any state can be expanded as ψ=iciei\ket{\psi}=\sum_i c_i\ket{e_i}, with coefficients read off directly from inner products: ci=ei|ψc_i=\braket{e_i}{\psi}. Abstracted into a single identity, this is the completeness relation

ieiei=1^(A.1.2)\sum_i \ket{e_i}\bra{e_i}=\hat{\mathbb{1}}\tag{A.1.2}

— “inserting a complete basis anywhere changes nothing”, the single most frequently used move in Chapter 3.

The eigenvalue problem

A matrix A^\hat A acting on a generic vector both rotates and stretches it. But every matrix has some “special directions”: acting along them produces pure stretching, no change of direction. These directions are the eigenvectors, and the stretch factors are the eigenvalues:

A^a=aa(A.1.3)\hat A\ket{a}=a\ket{a}\tag{A.1.3}

Finding them takes two steps:

  1. Eigenvalues: solve the characteristic equation det(A^a1^)=0\det(\hat A-a\hat{\mathbb{1}})=0. An nn-dimensional matrix gives a degree-nn polynomial with nn roots.
  2. Eigenvectors: substitute each aa back into (A^a1^)a=0(\hat A-a\hat{\mathbb{1}})\ket{a}=0 and solve the linear system.

For 2×2 matrices there is a handy shortcut: the eigenvalues sum to the trace (sum of diagonal entries), and their product equals the determinant:

a++a=trA^,a+a=detA^(A.1.4)a_+ + a_- = \operatorname{tr}\hat A,\qquad a_+ a_- = \det\hat A\tag{A.1.4}

Hermitian and unitary matrices

First define the Hermitian conjugate (symbol \dagger, read “dagger”): transpose the matrix, then complex-conjugate every entry, (A^)ij=A^ji(\hat A^\dagger)_{ij}=\hat A_{ji}^*. It satisfies (A^B^)=B^A^(\hat A\hat B)^\dagger=\hat B^\dagger\hat A^\dagger — the order reverses.

TypeDefinitionPhysical roleKey properties
HermitianA^=A^\hat A^\dagger=\hat AObservablesAll eigenvalues real; eigenvectors of distinct eigenvalues mutually orthogonal
UnitaryU^U^=1^\hat U^\dagger\hat U=\hat{\mathbb{1}}Time evolution, change of basis, quantum gatesPreserves inner products Uϕ|Uψ=ϕ|ψ\braket{U\phi}{U\psi}=\braket{\phi}{\psi}; eigenvalues are unit-modulus complex numbers eiθ\ee^{\ii\theta}
ProjectorP^2=P^=P^\hat P^2=\hat P=\hat P^\daggerMeasurementEigenvalues are only 0 and 1

The first two are linked by the exponential map: if H^\hat H is Hermitian, then eiH^t/\ee^{-\ii\hat H t/\hbar} is unitary — which is why the solution of the Schrödinger equation automatically conserves probability.

Two core theorems about Hermitian matrices (proofs in section 3.5):

  1. Eigenvalues must be real — so measurement outcomes are real numbers.
  2. Spectral theorem: a Hermitian matrix always admits an orthonormal set of eigenvectors forming a complete basis.

Diagonalisation and spectral decomposition

Diagonalising a matrix means switching to the basis made of its eigenvectors — in that basis the matrix becomes diagonal and all its information sits in plain view. Concretely: stack the normalised eigenvectors as the columns of a matrix UU (for a Hermitian matrix, UU is automatically unitary); then

UA^U=diag(a1,a2,)(A.1.6)U^\dagger \hat A\, U=\operatorname{diag}(a_1,a_2,\dots)\tag{A.1.6}

An equivalent way to write it is the spectral decomposition — splitting the matrix into a sum of “eigenvalue × corresponding projector”:

A^=iaiaiai(A.1.7)\hat A=\sum_i a_i\ket{a_i}\bra{a_i}\tag{A.1.7}

Its greatest use is defining functions of a matrix: just apply the function eigenvalue by eigenvalue,

f(A^)=if(ai)aiai(A.1.8)f(\hat A)=\sum_i f(a_i)\ket{a_i}\bra{a_i}\tag{A.1.8}

For instance eiH^t/=neiEnt/EnEn\ee^{-\ii\hat H t/\hbar}=\sum_n \ee^{-\ii E_n t/\hbar}\ket{E_n}\bra{E_n} — that single line is the entire mathematical content of the standard routine “expand in energy eigenstates, then attach a phase to each term”.

Tensor products

When two systems A and B combine into one larger system, the big system’s state space is not a “concatenation” but a tensor product HAHB\mathcal{H}_A\otimes\mathcal{H}_B: the dimensions multiply (2×2=42\times2=4), and the basis consists of all pairings iAjB\ket{i}_A\otimes\ket{j}_B (often abbreviated ij\ket{ij}).

The tensor (Kronecker) product of matrices expands as “each entry of the left matrix times the whole right matrix”:

A^B^=(A11B^A12B^A21B^A22B^)(A.1.9)\hat A\otimes \hat B=\begin{pmatrix}A_{11}\hat B & A_{12}\hat B\\ A_{21}\hat B & A_{22}\hat B\end{pmatrix}\tag{A.1.9}

The operating rule in one phrase: each factor minds its own system(A^B^)(ϕχ)=(A^ϕ)(B^χ)(\hat A\otimes\hat B)(\ket{\phi}\otimes\ket{\chi})=(\hat A\ket{\phi})\otimes(\hat B\ket{\chi}). “Act on system A only” is written A^1^\hat A\otimes\hat{\mathbb{1}}.

Section 99 of 106 · use to turn the page