Irreducible nonnegative matrix 2026-10-05
A square nonnegative matrix is irreducible if for each pair there is an integer with . This says that every index can reach every other through positive entries. The Perron–Frobenius theorem then gives a positive leading eigenvector and an algebraically simple eigenvalue. Irreducibility alone permits other eigenvalues of the same modulus: the cyclic permutation matrix has eigenvalues .
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 303 2 a Solution Created 2026-10-03 Updated 2026-10-05
Take the couplings in the Hamiltonian to include inverse temperature, so the Boltzmann factor is . If physical energies are used instead, first replace by their products with . Split the on-site term equally between its two bonds. For spin states the spin-chain transfer matrix has entriesUsing the specified coupling coordinates, in the order this isFor example, and . This is the nearest-neighbour Blume–Emery–Griffiths model with an additive constant and the paper's sign convention for .
Summing the periodic spin chain gives the partition function . For finite real couplings all entries of are strictly positive; the Perron–Frobenius theorem gives a unique positive dominant eigenvalue with for . Since is a symmetric matrix, all its eigenvalues are real. Thus in the thermodynamic limit,The positivity condition is stronger and more useful than mere ordering by signed value: subdominant eigenvalues can be negative. Also, the printed strict ordering between the other two is not guaranteed for all couplings. For instance, makes the positive constant matrix with two equal zero eigenvalues. Degeneracy there does not affect the largest-eigenvalue limit; no explicit generic eigenvalues are needed.
For spin magnetization, introduce a dimensionless field through , or insert into the trace. Thenwhere is a normalized eigenvector of the largest eigenvalue and . Spin inversion symmetry gives , since the positive eigenvector of the largest eigenvalue is unique. Thereforeat zero field, both at finite and in the finite-coupling thermodynamic limit. The finite- result follows directly by pairing each configuration with its spin-reversed partner. Eigenvalues at a single fixed field do not determine a general observable: a field derivative of the largest eigenvalue, or its eigenvector, is required. Positivity and the real analytic dependence on the couplings exclude a finite-temperature spontaneous symmetry breaking transition in this one-dimensional finite-range chain; singular zero-temperature coupling limits require separate treatment.
For even , spin decimation on alternate sites sums the middle spin of each two-bond segment, hence the coarse spin-chain transfer matrix is . DefineDirect multiplication gives . Matching its entry ratios to the original parameterization yields the spin-1 chain decimation recursionThe remaining overall positive factor is absorbed into . Keeping that factor preserves the free energy as well as normalized spin probabilities. Indeed , exactly; on an odd ring an unmatched boundary segment needs separate handling rather than assuming a uniform two-site block decomposition.
Primitive nonnegative matrix 2026-10-05
A square nonnegative matrix is primitive if some positive integer power has strictly positive entries. It is therefore an irreducible nonnegative matrix. The Perron–Frobenius theorem gives a leading eigenvalue whose modulus is strictly larger than that of every other eigenvalue. Every strictly positive matrix is primitive; the two-cycle permutation matrix is irreducible but not primitive.
Transfer matrix for a classical spin chain 2026-10-05
For a nearest-neighbour classical chain with finitely many spin states and dimensionless bond energy , its transfer matrix is . On-site energies are divided between adjacent bonds. Periodic boundary conditions give partition function by direct multiplication and summation over spin labels. For a strictly positive symmetric matrix, the Perron–Frobenius theorem gives . A diagonal local observable has expectation , tending to for a normalized dominant eigenvector.