Eigenvalues, commutators & tensor products
How do small matrices become operators on several spins, and when can a large matrix be divided into smaller problems? This bridge develops the finite-dimensional linear algebra behind those steps. You will check an eigenbasis, distinguish an expectation value from an eigenvalue, construct a tensor-product matrix, and use a commutator to identify invariant sectors. Every example is small enough to calculate by hand before returning to the XXX chain.
Required background. Add and multiply complex numbers, including . The entry check repairs conjugation and matrix multiplication. No previous spin-chain calculation is required.
Helpful background. The XXX introduction explains why these operations matter for a finite quantum system.
Complex columns and linear operators
Section titled “Complex columns and linear operators”Work in , for a finite positive integer , with an ordered orthonormal basis . A vector is a column; its adjoint is its conjugate transpose. Thus
The inner product and norm are
For , the vector has norm one. The zero vector cannot be normalized. Quantum notation denotes the same column, while denotes its adjoint. These finite-dimensional conventions agree with Preskill, July 2015 notes, § 2.1, pp. 3–4, equation (2.1), PDF.
A linear operator satisfies . Its th matrix column is , expressed in the chosen basis:
The second index labels the input basis vector; the first labels an output component. Specifying the basis order is part of specifying a matrix. In a product , apply first, then .
All explicit matrices and eigenvalues below are dimensionless. Multiplying a matrix by an energy scale gives the corresponding energy units when it is used as a Hamiltonian.
Entry check and repair
Section titled “Entry check and repair”
Let
Calculate , , and . Normalize . What is the first column of , and which input vector produces it?
Repair: conjugate for the norm, use columns for the action
Since ,
The transpose alone gives the wrong squared norm. The normalized vector is . Row-by-column multiplication gives
The first column is , where . As a retry, reproduces the second column.
A complete two-dimensional eigenvalue calculation
Section titled “A complete two-dimensional eigenvalue calculation”A matrix is Hermitian when . Here means transpose the matrix and conjugate every entry; a complex Hermitian matrix need not equal its transpose. The example above is Hermitian because its two off-diagonal entries are complex conjugates.
An eigenvector is a nonzero vector satisfying . For a Hermitian matrix its eigenvalue is real: the scalar equals its own complex conjugate, and
To find the eigenvalues of our , compute
The eigenvalues are and . Solving each two-row equation and normalizing gives
The subscripts label eigenvalues. In particular, is a unit vector with eigenvalue zero, not the zero vector. Direct checks give
Two orthonormal vectors in a two-dimensional space form a complete basis. More explicitly, their outer products satisfy
An outer product is a matrix, while is a scalar. For normalized , the matrix projects a vector onto the direction . The displayed identity is the spectral resolution of this particular matrix. The finite-dimensional Hermitian spectral theorem supplies an orthonormal eigenbasis in general; see Preskill, § 2.1, pp. 4–5, equations (2.3)–(2.6), PDF.
The resolution also proves positive semidefiniteness, meaning for every :
It is not positive definite, since the nonzero vector gives zero. Hermiticity by itself does not require nonnegative eigenvalues; the first exercise tests that distinction.
An expectation value is not an eigenvalue test
Section titled “An expectation value is not an eigenvalue test”For a normalized vector , the expectation value of is . At it is , even though is not an eigenvalue of . Indeed,
For a proposed pair with , define the normalized eigenvector residual
It is exactly zero precisely when is an eigenvector with the proposed eigenvalue. Dividing by prevents shrinking a wrong vector from making its test look better. An expectation value describes an average in a state; it does not verify the full vector equation. Numerical residuals also require a stated precision and an appropriate operator scale; this page’s checks are exact.
Tensor products need an ordered basis
Section titled “Tensor products need an ordered basis”Take two labeled spaces and . In each, use
These are basis labels. For spin chains they can represent and , respectively. The space has dimension . Fix its basis order as follows:
| Column position | Basis vector | Factor 1 | Factor 2 |
|---|---|---|---|
| 1 | |||
| 2 | |||
| 3 | |||
| 4 |
Here , and the second label varies fastest in this order. Bilinearity gives, for local columns and ,
General vectors in the four-dimensional space are linear combinations of these basis vectors; they need not be a single product . For example, the normalized vector used below must be acted on term by term. No factorization assumption is needed.
For operators on and on , define
and extend by linearity. This factor-wise rule, together with the product inner product, is given in Preskill, § 2.1, p. 7, equations (2.13)–(2.14), PDF.
Derive the Kronecker matrix rule
Section titled “Derive the Kronecker matrix rule”Write and . Applying both operators gives
Thus the entry in row and column is . Grouping the rows and columns by their first label gives the Kronecker product matrix
Each entry shown here is a block. This is a matrix, not the ordinary product .
For a concrete column check, define the Pauli matrices
Then , so column 2 of is . Recovering a column from a basis input is a useful way to catch a reversed factor order. With , physical spin operators are , , , as in Preskill, § 2.2.1, p. 11, equations (2.28)–(2.29), PDF.
Commutators depend on which space is acted on
Section titled “Commutators depend on which space is acted on”For square matrices on the same space, define the commutator
It measures the difference between applying the operators in the two possible orders. A statement is an operator identity: it must hold on every vector. Agreement on a single input does not establish it.
The tensor action rule proves
by applying both sides to and extending linearly. In particular, operators acting on separate factors commute:
This remains true even if the local matrices and , considered on a single copy of , do not commute. When both act on the first factor instead,
Sharing a factor does not force noncommutation, but the separate-factor argument no longer settles the question. For sites, the notation means
with in position ; it acts on a space of dimension . This is the local-operator embedding used in Faddeev 1996, § 2, equations (6), (14)–(15), PDF. The label specifies a tensor factor, not a matrix row.
Why a commuting operator identifies invariant sectors
Section titled “Why a commuting operator identifies invariant sectors”Let and be Hermitian matrices on the same finite-dimensional space, and suppose . For an eigenvalue of , define its eigenspace
It includes the zero vector and may have dimension larger than one. If , then
Therefore : preserves the whole eigenspace. Choosing a basis grouped by these eigenspaces makes block diagonal, so each block can be solved separately. If generates time evolution, its powers and hence its exponential preserve the same spaces. The commutation condition is the conservation condition discussed in Preskill, § 2.2.1, p. 10, equation (2.23), PDF.
Within a degenerate eigenspace of , can still mix vectors. Commutation does not make every prechosen eigenvector of an eigenvector of . The restriction of Hermitian to each invariant eigenspace can itself be diagonalized; doing this supplies a common orthonormal eigenbasis. The transfer exercise exhibits the distinction explicitly.
In the XXX chain, can be total magnetization. Its eigenspaces are the sectors with a fixed number of down spins. This linear-algebra argument explains the reduction used by the short-chain lesson; symmetry sectors alone do not establish quantum integrability.
Exercises
Section titled “Exercises”
Guided: shift and rescale the spectrum
Section titled “Guided: shift and rescale the spectrum”Using the worked matrix , set . Find its explicit matrix, normalized eigenvectors and eigenvalues without solving a new characteristic equation. Is Hermitian? Is it positive semidefinite? Explain separately what an identity shift and a negative rescaling do to eigenvalues and eigenvectors.
Hint
If , compute . To disprove positive semidefiniteness, one vector with a negative quadratic form is sufficient.
Solution
Direct subtraction gives
For the same normalized vectors as before,
Thus the eigenvalues are . The off-diagonal entries are complex conjugates, so is Hermitian, but shows it is not positive semidefinite.
More generally, retains every eigenvector of and changes its eigenvalue to . An identity shift adds the same constant to all eigenvalues; a negative real rescaling reverses their ordering. Neither requires changing the eigenvectors. This is the matrix reason an energy offset can change the vacuum energy without changing states.
Independent: separate factors and shared factors
Section titled “Independent: separate factors and shared factors”In the ordered basis , construct , , and . Apply each to
Then calculate and as operator identities. Two of the three individual actions on coincide. Does that make their operators equal? Find a basis input that answers the question.
Hint
interchanges the local basis states; leaves unchanged and negates . Find the four columns from those rules. For the shared-factor commutator, multiply the two local matrices first.
Solution
The matrices are
Acting term by term or multiplying these matrices gives
The tensor multiplication rule proves
For the other pair, and , so
As an independent sign check, this last commutator sends to , a nonzero vector of norm .
Finally, and are different despite their equal action on : on their outputs are and , respectively. One successful input test cannot prove equality of operators.
Transfer: break an invariant sector
Section titled “Transfer: break an invariant sector”In , use the ordered basis and matrices
Verify , identify the two -sectors, and find the complete eigenbasis of . Is the displayed basis already a common eigenbasis of both operators?
Now let be real and define
Compute . For , show explicitly that the old sectors are no longer invariant. Which properties survive? You do not need to solve the perturbed cubic eigenvalue equation.
Hint
For diagonal with entries , . Reuse the worked eigenvectors in the upper block. To test the perturbation, inspect .
Solution
The only off-diagonal entries of join basis states with the same -eigenvalue, so its commutator with vanishes. The sectors are
The normalized eigenvectors and corresponding -eigenvalues are
They form a common orthonormal eigenbasis of and . The original displayed basis is an eigenbasis of , but not of : for example, is not proportional to . Degeneracy permits mixing inside .
The perturbed commutator is
For nonzero ,
The old sector decomposition therefore fails. The matrix remains Hermitian for real , so its eigenvalues are real and it has an orthonormal eigenbasis, but the old three eigenvectors no longer solve its eigenvalue problem. A broken symmetry label does not imply that the matrix ceases to define a valid finite quantum problem.
Return to the spin chain
Section titled “Return to the spin chain”Use these calculations in Construct a small spin-chain Hamiltonian: the site labels specify tensor factors, matrix columns encode actions on basis states, and magnetization conservation selects invariant blocks. That lesson uses these operations to derive the physical bond interaction.
For the algebraic route, continue to Check a rational R-matrix. Its permutation operators act on specified tensor factors and compose from right to left, exactly as the matrices do here. The larger argument will establish commuting transfer matrices; basic Hermiticity, finite diagonalization or a single symmetry reduction is not that integrability argument.
These results apply to finite-dimensional complex spaces. No assertion about domains of unbounded operators or completeness of an infinite-dimensional eigenfunction expansion is being used.
References
Section titled “References”- Faddeev, L. D. How Algebraic Bethe Ansatz works for integrable model. Les Houches lecture notes, 1996. arXiv:hep-th/9605187v1, 26 May 1996. Version record. Open PDF, § 2, equations (6), (14)–(15).
- Preskill, John. Lecture Notes for Ph219/CS219: Quantum Information, Chapter 2, “Foundations I: States and Ensembles.” California Institute of Technology, updated July 2015. Author’s PDF, § 2.1, pp. 3–7, equations (2.1)–(2.6) and (2.13)–(2.14); § 2.2.1, pp. 10–11, equations (2.23), (2.28)–(2.29).