Recursion relation

A corner transfer matrix A_2^m (defined for an m×m quadrant) may be expressed in terms of smaller corner transfer matrices A_2^m-1 and A_2^m-2 (defined for reduced (m-1)×(m-1) and (m-2)×(m-2) quadrants respectively). This recursion relation allows, in principle, the iterative calculation of the corner transfer matrix for any lattice quadrant of finite size.

Like their row-to-row counterparts, corner transfer matrices may be factored into face transfer matrices, which correspond to adding a single face to the lattice. For the lattice quadrant given earlier, the face transfer matrices are of size 2^m×2^m and defined entry-wise by

${\displaystyle \left(U_{i}\right)_{\sigma |\sigma '}=\delta \left(\sigma _{1},\sigma _{1}'\right)\cdots \delta \left(\sigma _{i-1},\sigma _{i-1}'\right)w\left(\sigma _{i},\sigma _{i+1},\sigma _{i}',\sigma _{i-1}\right)\delta \left(\sigma _{i+1},\sigma _{i+1}'\right)\cdots \delta \left(\sigma _{m},\sigma _{m}'\right),}$

where 2 ≤ i ≤ m+1. Near the outer boundary, specifically, we have

${\displaystyle \left(U_{m}\right)_{\sigma |\sigma '}=\delta \left(\sigma _{1},\sigma _{1}'\right)\cdots \delta \left(\sigma _{m-1},\sigma _{m-1}'\right)w\left(\sigma _{m},+1,\sigma _{m}',\sigma _{m-1}\right),}$

${\displaystyle \left(U_{m+1}\right)_{\sigma |\sigma '}=\delta \left(\sigma _{1},\sigma _{1}'\right)\cdots \delta \left(\sigma _{m},\sigma _{m}'\right)w\left(+1,+1,+1,\sigma _{m}\right).}$

So the corner transfer matrix A factorises as

${\displaystyle A=F_{2}\cdots F_{m+1},}$

where

${\displaystyle F_{j}=U_{m+1}\cdots U_{j}.}$

Graphically, this corresponds to:

We also require the 2^m×2^m matrices A* and A**, defined entry-wise by

${\displaystyle \left(A^{*}\right)_{\sigma |\sigma '}=\delta \left(\sigma _{1},\sigma _{1}'\right)A_{\sigma _{2},\ldots ,\sigma _{m}|\sigma _{2}',\ldots ,\sigma _{m}'},}$

${\displaystyle \left(A^{**}\right)_{\sigma |\sigma '}=\delta \left(\sigma _{1},\sigma _{1}'\right)\delta \left(\sigma _{2},\sigma _{2}'\right)A_{\sigma _{3},\ldots ,\sigma _{m}|\sigma _{3}',\ldots ,\sigma _{m}'},}$

where the A matrices whose entries appear on the RHS are of size 2^m-1×2^m-1 and 2^m-2×2^m-2 respectively. This is more clearly written as

${\displaystyle A^{*}=I_{2}\otimes A_{2^{m-1}}=\left[{\begin{array}{cc}A&0\\0&A\end{array}}\right],}$

${\displaystyle A^{**}=I_{2}\otimes I_{2}\otimes A_{2^{m-2}}=\left[{\begin{array}{cccc}A&0&0&0\\0&A&0&0\\0&0&A&0\\0&0&0&A\end{array}}\right].}$

Now from the definitions of A, A*, A**, U_i and F_j, we have

${\displaystyle A^{*}=F_{3}\cdots F_{m+1},A^{**}=F_{4}\cdots F_{m+1}}$

${\displaystyle \Rightarrow A=F_{2}A^{*},A^{*}=F_{3}A^{**}}$

${\displaystyle \Rightarrow A=A^{*}\left(A^{**}\right)^{-1}U_{2}A^{*},}$

which gives the recursion relation for A_2^m in terms of A_2^m-1 and A_2^m-2.

Diagonal form

When using corner transfer matrices to perform calculations, it is both analytically and numerically convenient to work with their diagonal forms instead. To facilitate this, the recursion relation may be rewritten directly in terms of the diagonal forms and eigenvector matrices of A, A* and A**.

Recalling that the lattice in our example is reflection-invariant, in the sense that

${\displaystyle w\left(\sigma _{i},\sigma _{j},\sigma _{k},\sigma _{l}\right)=w\left(\sigma _{k},\sigma _{j},\sigma _{i},\sigma _{l}\right)=w\left(\sigma _{i},\sigma _{l},\sigma _{k},\sigma _{j}\right),}$

we see that A is a symmetric matrix (i.e. it is diagonalisable by an orthogonal matrix). So we write

${\displaystyle A=\alpha _{m}PA_{d}P^{T},}$

where A_d is a diagonal matrix (normalised such that its numerically largest entry is 1), α_m is the largest eigenvalue of A, and P^TP = I. Likewise for A* and A**, we have

${\displaystyle A^{*}=\alpha _{m-1}P^{*}A_{d}^{*}\left(P^{*}\right)^{T},}$

${\displaystyle A^{**}=\alpha _{m-2}P^{**}A_{d}^{**}\left(P^{**}\right)^{T},}$

where A_d*, A_d**, P* and P** are defined in an analogous fashion to A* and A**, i.e. in terms of the smaller (normalised) diagonal forms and (orthogonal) eigenvector matrices of A_2^m-1 and A_2^m-2.

By substituting these diagonalisations into the recursion relation, we obtain

${\displaystyle A_{t}=\kappa RA_{d}R^{T},}$

where

${\displaystyle \kappa ={\frac {\alpha _{m}\alpha _{m-2}}{\alpha _{m-1}^{2}}},}$

${\displaystyle R=\left(P^{*}\right)^{T}P,}$

${\displaystyle A_{t}=A_{d}^{*}\left(R^{*}\right)^{T}\left(A_{d}^{**}\right)^{-1}U_{2}R^{*}A_{d}^{*}.}$

Now A_t is also symmetric, and may be calculated if A_d*, A_d** and R* are known; diagonalising A_t then yields its normalised diagonal form A_d, its largest eigenvalue κ, and its orthogonal eigenvector matrix R.

Spin expectation value

Corner transfer matrices (or their diagonal forms) may be used to calculate quantities such as the spin expectation value at a particular site deep inside the lattice. For the full lattice given earlier, the spin expectation value at the central site is given by

${\displaystyle \left\langle \sigma _{1}\right\rangle ={\frac {1}{Z_{N}}}\sum _{all \atop spins}\sigma _{1}\prod _{all \atop faces}w\left(\sigma _{i},\sigma _{j},\sigma _{k},\sigma _{l}\right).}$

With the configurations ordered such that A is block diagonal as before, we may define a 2^m×2^m diagonal matrix

${\displaystyle S=\left[{\begin{array}{cc}I&0\\0&-I\end{array}}\right],}$

such that

${\displaystyle \left\langle \sigma _{1}\right\rangle ={\frac {{\textrm {tr}}SA^{4}}{{\textrm {tr}}A^{4}}}={\frac {{\textrm {tr}}\alpha _{m}^{4}PSA^{4}P^{T}}{{\textrm {tr}}\alpha _{m}^{4}PA^{4}P^{T}}}={\frac {{\textrm {tr}}SA_{d}^{4}}{{\textrm {tr}}A_{d}^{4}}}.}$

Partition function per site

Another important quantity for lattice models is the partition function per site, evaluated in the thermodynamic limit and written as

${\displaystyle \kappa =\lim _{N\rightarrow \infty }\left(Z_{N}\right)^{1/N}.}$

In our example, this reduces to

${\displaystyle \kappa =\lim _{N\rightarrow \infty }\left(\alpha _{m}^{4}{\textrm {tr}}A_{d}^{4}\right)^{1/N}\sim \alpha _{m}^{4/N},}$

since tr A_d⁴ is a convergent sum as m → ∞ and A_d becomes infinite-dimensional. Furthermore, the number of faces 2m(m+1) approaches the number of sites N in the thermodynamic limit, so we have

${\displaystyle \alpha _{m}\sim \kappa ^{m\left(m+1\right)/2},}$

which is consistent with the earlier equation giving κ as the largest eigenvalue for A_t. In other words, the partition function per site is given exactly by the diagonalised recursion relation for corner transfer matrices in the thermodynamic limit; this allows κ to be approximated via the iterative process of calculating A_d for a large lattice.

The matrices involved grow exponentially in size, however, and in actual numerical calculations they must be truncated at each step. One way of doing this is to keep the n largest eigenvalues at each step, for some fixed n. In most cases, the sequence of approximations obtained by taking n = 1,2,3,... converges rapidly, and to the exact value (for an exactly solvable model).