corner transfer matrix

corner transfer matrix
Name	Corner transfer matrix
Field	Statistical mechanics; Mathematical physics
Introduced	1970s
Developer	Rodney Baxter
Applications	Exactly solved models; Tensor networks; Quantum many-body physics

corner transfer matrix

The corner transfer matrix is an analytical and numerical tool in statistical mechanics and mathematical physics used to study two-dimensional lattice models, integrable systems, and tensor-network representations of many-body states. It provides a way to compute partition functions, correlation functions, and boundary contributions by focusing on quadrant- or corner-shaped regions of a lattice, connecting to exact results in models like the Ising model, the six-vertex model, and the eight-vertex model. Developed alongside breakthroughs in integrability, the method links to algebraic structures such as the Yang–Baxter equation, the Bethe ansatz, and the quantum inverse scattering method.

Introduction

The corner transfer matrix formalism reorganizes the computation of the partition function of a two-dimensional lattice by dividing the lattice into four corners and associating an operator to each quadrant that transfers boundary states into partition-weight contributions. Rodney Baxter introduced corner transfer matrices while solving the hard-hexagon model and the eight-vertex model, providing new access to order parameters and finite-size scaling. The approach complements techniques like the transfer-matrix method and the finite-size scaling analysis developed in studies of critical phenomena linked to the renormalization group and conformal field theory.

Historical development and origins

Corner transfer matrices emerged in the 1970s in the work of Rodney Baxter during the search for exact solutions of lattice models such as the chiral Potts model and the hard-hexagon model. The method grew out of a lineage including the Bethe ansatz pioneered by Hans Bethe, the Yang–Baxter equation introduced by C. N. Yang and Rodney Baxter's contemporaries, and the quantum inverse scattering method advanced by Ludwig Faddeev and collaborators. Subsequent developments connected corner transfer matrices to results by Barry McCoy, Tai Tsun Wu, and Elliott Lieb, and influenced later frameworks like the density matrix renormalization group and tensor-network algorithms developed by Steven White and Guifré Vidal.

Mathematical formulation

Mathematically, a corner transfer matrix is an operator C acting on a boundary Hilbert space associated with half-infinite rows or columns, constructed by summing Boltzmann weights over interior degrees of freedom of a quadrant. Its eigenvalue spectrum encodes free-energy contributions and boundary entropies and satisfies functional equations derived from integrability constraints such as the Yang–Baxter equation and inversion relations related to Baxter's T-Q relations. The formalism interfaces with representation theory of quantum groups like U_q(sl_2) and with commuting families of operators arising in the quantum inverse scattering method, enabling exact derivations of order parameters in models solvable by algebraic techniques.

Applications in statistical mechanics and tensor networks

Corner transfer matrices have been applied to compute spontaneous magnetization in the Ising model, correlation lengths in vertex models like the six-vertex model, and critical exponents accessible via connections to conformal field theory and modular invariance studied in works related to Alexander Zamolodchikov and John Cardy. In modern tensor-network language, corner transfer matrices serve as environment tensors in algorithms such as the corner transfer matrix renormalization group (CTMRG), interfacing with tensor network ansätze like matrix product states and projected entangled pair states, and contribute to studies of entanglement spectra in systems related to the Hubbard model and Heisenberg model.

Numerical methods and algorithms

Numerical incarnations include the corner transfer matrix renormalization group introduced by Nishino and Okunishi, which adapts ideas from the density matrix renormalization group to two-dimensional classical systems and one-dimensional quantum systems via Suzuki–Trotter mappings. CTMRG and related iterative algorithms compute leading eigenvectors of corner operators, truncate boundary spaces using reduced density matrices, and accelerate convergence with techniques inspired by the Arnoldi iteration and Lanczos algorithm. These numerical methods are routinely used in computational studies involving lattices like the square lattice, the triangular lattice, and models exhibiting topological order studied in contexts referencing the Kitaev model.

Properties and exact solutions

In integrable cases, corner transfer matrices satisfy commutation relations and functional identities that yield exact eigenvalue spectra; Baxter exploited such properties to derive closed-form expressions for order parameters in the hard-hexagon model and spontaneous magnetization in the Ising model. The asymptotic scaling of corner eigenvalues reveals universal quantities, connecting to central charges in conformal field theory classifications by Belavin, Polyakov, and Zamolodchikov. Exact solutions often invoke elliptic function parametrizations associated with the eight-vertex model and utilize analytic continuation techniques developed in the theory of special functions and modular forms studied by Srinivasa Ramanujan and others.

Extensions and generalizations

Generalizations extend corner transfer matrices to non-integrable models via variational tensor-network approximations, to quantum Hamiltonians through path-integral mapping, and to classical systems with quenched disorder building on approaches used in spin-glass studies by Giorgio Parisi. Higher-dimensional analogues inspire methods for three-dimensional lattices and relate to ongoing research in tensor renormalization group methods advanced by Guifre Vidal, Zheng-Cheng Gu, and Xiao-Gang Wen exploring topological phases and entanglement renormalization frameworks like the multi-scale entanglement renormalization ansatz. Interdisciplinary extensions connect the corner formalism to computational complexity results in algorithmic studies by Scott Aaronson and to categorical frameworks influenced by John Baez and Jacob Lurie.

Category:Statistical mechanics Category:Mathematical physics Category:Integrable systems