Solving the one-dimensional Ising chain via mathematical induction: An intuitive approach to the transfer matrix
Wenlong Wang Rogelio Díaz-Méndez Raudys Capdevila
cond-mat.stat-mech






wenlongcmp@gmail.com
Department of Physics, Royal Institute of Technology, Stockholm, SE-106 91, Sweden


Department of Physics, Royal Institute of Technology, Stockholm, SE-106 91, Sweden


Department of Applied Mathematics, Polytechnical University of Valencia, 46022 Valencia, Spain











The aim of this work is to present a formulation to solve the one-dimensional Ising model using the elementary technique of mathematical induction.
This formulation is physically clear and leads to the same partition function form as the transfer matrix method, which is a common subject in the introductory courses of statistical mechanics.
In this way our formulation is a useful tool to complement the traditional more abstract transfer matrix method. The method can be straightforwardly generalized to other short-range chains, coupled chains and is also computationally friendly. These two approaches provide a more complete understanding of the system, and therefore our work can be of broad interest for undergraduate teaching in statistical mechanics.



Solving the one-dimensional Ising chain via mathematical induction: An intuitive approach to the transfer matrix
    Raudys Capdevila
    
================================================================================================================





§ INTRODUCTION

The one-dimensional (1D) Ising model <cit.> is of fundamental importance in an introductory course on statistical mechanics, because it is connected to many interesting physical concepts; see e.g. Ref. <cit.> for a recent entertaining introduction. 
Despite the absence of a genuine phase transition, the 1D Ising model still plays a central role in the comprehension of many principles, phenomena, and numerical methods in statistical physics. 
Indeed, the model itself and its large number of variations have become the most common conceptual platform to which discussions are constantly referred to.
Consequently, in the context of teaching, the development of an intuitive comprehension of the many features of the Ising and related models is an instrumental tool for the proper acquisition of the subsequent content.           
Moreover, while the exact solution of the 2D version of the model is a very challenging exercise <cit.>, the one-dimensional calculation typically becomes for the students the first contact with an exactly solvable many body model at their reach.
In this way facing a decades-old scientific problem which, with slight modifications, can easily turn on current interest <cit.>. 
There exist several analytical methods to solve the 1D Ising model, some of them providing novel approaches and  interesting view points <cit.>.
However, the transfer matrix method is by far the most extended technique in undergraduate lectures, due in part to its wide general use across many physical subjects <cit.>. 
The method is simple to use and can be flexibly generalized to cover other interesting models as next-nearest neighbours <cit.>, Potts spins <cit.> and coupled chains <cit.>.

 


There is, though, a common conceptual barrier from novice students to properly understand the basis of the transfer matrix method, unless the students are comfortable with the bond representation.
The latter is unfortunately not always the case as this is usually their first encounter with the Ising model. 
In this line, many teachers find the physical basis of the regular transfer matrix method a bit uneasy to define and explain.
In many cases, after getting familiar with the method, the lack of an axiomatic presentation of the matrix or even an intuitive analogy makes it to be generally seen as a lucky trick whose underlying idea has no link with the physical problem.


It is expectable that efforts in the direction of offering physical connections to this trick can be very welcomed in the wide community of statistical physics students and teachers.
In this paper we show that, by using elementary mathematical induction, it is possible to solve the 1D Ising model using simple mathematics where mathematical reduction can be seen from the very first step.
More importantly, we find a working transformation from which the transfer matrix result can be derived.
The advantage of this formulation is that: (1) it is very physically clear and mathematically simple, and (2) it connects the transfer matrix method with an intuitively logical mechanism.
We believe this derivation could be very useful for developing the intuitive comprehension of this topic in introductory lectures of statistical mechanics. 





§ THE TRANSFER MATRIX METHOD


We start by a quick review of the regular transfer matrix method. 
In the presence of an external field, the 1D Ising Hamiltonian takes the form

    H = - J ∑_i=1^N S_i S_i+1 - h∑_i=1^N S_i,

where N spins S_i=±1 are placed in a chain, interacting only with their nearest neighbours and with the external field h.  
Periodic boundary conditions are imposed by setting S_N+1≡ S_1.

The canonical partition function for this system can be expressed as

    Z_N= ∑_{S_i} e^-β H(S_1,S_2,…,S_N) =∑_{S_i} e^β[ ∑_i=1^NJS_iS_i+1 + 1/2h∑_i=1^N(S_i+S_i+1)],

where {S_i} means that the sum runs over all (2^N) possible combination of the values of the N variables S_i, i.e., over all possible states of the system.
The next step is to use the bond representation and factor the Boltzmann weights to pairwise factors, a decomposition of the bonds

    Z_N=∑_S_1∑_S_2⋯∑_S_N∏_i=1^N 
    e^β[ JS_iS_i+1 + 1/2h(S_i+S_i+1)].

Introducing a matrix, the transfer matrix, with the corresponding matrix elements from the factors defined as 

    P_S_iS_j=e^β J S_i S_j +1/2β h (S_i+S_j),

the partition function can be written as

    Z_N   =   ∑_S_1∑_S_2⋯∑_S_N  
    P_S_1S_2P_S_2S_3⋯ P_S_NS_1
       =   ∑_S_1 (P^N)_S_1S_1 = Tr(P^N).

It is important to realize that there is no matrix in the partition function itself, only matrix elements. 
The summations remarkably happen to resemble matrix multiplications. 
The approach is not very intuitive, mostly because it is difficult to see a priori that this reduction will take place, at least for the first time, and the students have to take the fact that it works.
As we will demonstrate in the next section, this same result can be obtained by means of a physically intuitive formalism, where reduction can be seen in the first place.

Before ending this section, we summarize some important results here for reference. The matrix P is a 2×2 matrix as the variables S_i has two possible values. Ordering the spins in the state space as 1 and -1, the matrix reads 

    P = 
    [ e^β (J + h)      e^-β J;      e^-β J e^β (J - h) ]

 











The partition function can be calculated as

    Z_N=Tr(P^N)   =   λ_1^N+λ_2^N,

where λ_1 and λ_2 are the eigenvalues of the matrix P, satisfying the usual characteristic equation 

    λ^2-Tr(P)λ+Det(P)=0

with solutions

    λ_1,2=e^β J[ cosh(β h)±√(sinh^2(β h)+e^-4β J)],

where λ_1>λ_2 for any value of h.
Consequently, in the thermodynamic limit, the term involving λ_2 in the right hand side of Eq. (<ref>) can be neglected  

    Z_N   λ_1^N

ending up with a partition function in the form

    Z   ≈λ_1^N = e^N β J[ cosh(β h)+√(sinh^2(β h)+e^-4β J)]^N.


Importantly, the free energy f and the magnetization m per spin are

    f(h,T)   =   -1/Nk_BTln(Z)=-k_BTlnλ_1 
       =   -J -k_BT ln[cosh(β h)+√(sinh^2(β h)+e^-4β J)], 
    
    m(h,T)   =   -∂ f/∂ h
       =   sinh(β h)/√(sinh^2(β h)+e^-4β J),

from which,
since sinh(β h) 0,
it is clear that no spontaneous magnetization occurs at any finite temperature in the absence of an external field.




§ SOLVING VIA MATHEMATICAL INDUCTION


We now consider the more intuitive approach expressed in the following question: given the partition function for N spins Z_N, could one construct the partition function for N+1 spins Z_N+1?
In this situation, the new partition function Z_N+1 seems likely to be expressible in terms of the old partition function Z_N, after all, the new spin only change the interactions locally.
Without loss of generality, we assume this extra spin S_N+1 is inserted at the right end of the chain, i.e., interacting with spins S_N and S_1.

In order to keep track of the modifications raised by the new spin, we now split the configuration space in four subsets, according to the four possible orientations of the first and the last spins. This is a preparation step for mathematical induction, as we know one can adjust the Boltzmann factors properly when a new spin is added if the additional interactions (with S_1 and S_N) are fully known.
All configurations with S_1=S_N=1 form the subset {↑↑}, configurations with S_1=1 and S_N=-1 form the subset {↑↓}, and so on, each of them has 2^N-2 configurations.
That is to say

    {S_i}={↑↑}∪{↑↓}∪{↓↑}∪{↓↓}.
 
Such a splitting is illustrated in Fig. <ref> A.
Extending the split to the sum in the partition function, one can define four terms associated to these sectors Z_N^↑↑, Z_N^↑↓, Z_N^↓↑ and Z_N^↓↓, 
such that 

    Z_N^↑↑   =   ∑_{↑↑} e^-β H(S_1,S_2,…,S_N)
    =∑_{S_i} : S_1=S_N=1 e^-β H(S_1,S_2,…,S_N)
    
    Z_N^↑↓   =   ∑_{↑↓} e^-β H(S_1,S_2,…,S_N)
    =∑_{S_i} : S_1=1,S_N=-1 e^-β H(S_1,S_2,…,S_N)
    
    Z_N^↓↑   =   ∑_{↓↑} e^-β H(S_1,S_2,…,S_N)
    =∑_{S_i} : S_1=-1,S_N=1 e^-β H(S_1,S_2,…,S_N)
    
    Z_N^↓↓   =   ∑_{↓↓} e^-β H(S_1,S_2,…,S_N)
    =∑_{S_i} : S_1=S_N=-1 e^-β H(S_1,S_2,…,S_N)

and the partition function can be expressed as

    Z_N = Z_N^↑↑+
    Z_N^↑↓+
    Z_N^↓↑+
    Z_N^↓↓.



 
The next step is to explicitly find the transformations of each component of the partition function when going from a system of N spins to N+1 spins.
Since the new spin is inserted at the right end, it is clear, for instance, that the subset {↑↑} of the new N+1 system will emerge from the union of the sets {↑↑} and {↑↓} of the N-spin chain with an extra spin up S_N+1=1.
This case is shown schematically in Fig. <ref> B.
Consequently, the new term Z_N+1^↑↑ will have two contributions, one involving   
Z_N^↑↑
and the other involving Z_N^↑↓.
The first contribution comes from adding a spin +1 at the site N+1 to the previous set {↑↑}.
The second contribution comes from adding a spin +1 at the site N+1 to the previous set {↑↓}.

    Z_N+1^↑↑ = c_1Z_N^↑↑ + c_2Z_N^↑↓,

where c_1 and c_2 are proper modifications to the Boltzmann weights.

The factors can be written down very simply. For example, in the first term, a new spin up is added, which contributes a factor exp(β h) from interactions with the field, two new satisfied bonds are created and one satisfied bond is eliminated, this contributes to a factor exp(β J). Putting the magnetic and bond contributions together, c_1=exp(β(h+J)). Similarly, c_2=exp(β(h+J)) as well. The whole transformation can be simply enumerated, introducing for simplicity a vector partition function

    z⃗_N=
    [ Z_N^↑↑, Z_N^↑↓, Z_N^↓↑, Z_N^↓↓ ]
    ^T,

in such a way that the partition function of the system can be expressed as a summation reduction Z_N = ∑ (z⃗_N). 
And the recurrence relation can be expressed concisely in the form

    z⃗_N+1   =    M z⃗_N,

where the recurrence matrix M is

    M=
    [    e^β(J+h)    e^β(J+h)           0           0; e^-β (3J+h)    e^β(J-h)           0           0;           0           0    e^β(J+h) e^-β (3J-h);           0           0    e^β(J-h)    e^β(J-h) ]

Note that in spite of the matrix is 4×4 compared with the transfer matrix, it is block diagonal. Indeed we will see in the following the partition function, upon summation reduction, takes exactly the same form as that of the transfer matrix method. And most importantly for the learning context, the derivation of this recurrent relation is absolutely intuitive, it comes just from considering the energetic effect of inserting a new spin in the chain.
This is the most important step of the method, the rest is straightforward algebraic calculations.

Next the job is to find the vector partition function for a small system to start the induction e.g. a two-spin system. It is natural to start from N=2, however, one can check that it is also possible to start from N=1, i.e., a single spin on a ring which loops over and interact with itself. In this case we have

    z⃗_1=
    [ exp(β(J+h)),0, 0, exp(β(J-h)) ]
    ^T.


Therefore, we readily have z⃗_N = M^N-1z⃗_1. 
As M is a block diagonal matrix, let us call M_11 and M_22 to the first and last non-zero blocks respectively, we then write

    z⃗_N    =   [ M_11^N-1        0;        0 M_22^N-1 ]z⃗_1 
       =   [ M_11^N-1z⃗_1(1:2); M_22^N-1z⃗_1(3:4) ],

where u⃗(m:n) is the vector formed by the elements from m-th to n-th of the vector u⃗. Naturally,

    Z_N    =   ∑(z⃗_N) = ∑(z⃗_N(1:2)) + ∑(z⃗_N(3:4)).

Note that we are going in this step from a 4×4 matrix towards a 2×2 matrix upon the summation reduction, the same matrix size as the transfer matrix.

Now we introduce a lemma which is easy to prove:

Lemma: If A is a 2×2 matrix and b is a 2 × 1 vector, then ∑(Ab) = Tr(A × [b,b]).

Therefore,

    Z_N    =    Tr (M_11^N-1 [z⃗_1(1:2),z⃗_1(1:2)]) + Tr (M_22^N-1 [z⃗_1(3:4),z⃗_1(3:4)]) 
       =    Tr (M_11^N-1 [z⃗_1(1:2),z⃗_1(1:2)] + M_22^N-1 [z⃗_1(3:4),z⃗_1(3:4)]).


Both M_11 and M_22 can be easily symmetrized using similarity transformations

    M_11   =   [  e^β (J + h/2)              0;              0 e^-β (J + h/2) ][ e^β (J+h)    e^-β J;    e^-β J e^β (J-h) ][ e^-β (J + h/2)              0;              0  e^β (J + h/2) ]
    
    M_22   =   [ e^-β (J - h/2)              0;              0  e^β (J - h/2) ][ e^β (J+h)    e^-β J;    e^-β J e^β (J-h) ][  e^β (J - h/2)              0;              0 e^-β (J - h/2) ]


Plugging these two equations to Z_N, Eq. <ref> remarkably simplifies to

    Z_N = Tr
    [ e^β (J+h)    e^-β J;    e^-β J e^β (J-h) ]^N,

which is identical to the transfer matrix result in Eq. (<ref>).

Finally, we mention that the method can also be used in a purely numerical manner directly from the recurrence relation. This is computationally appealing because the setup is straightforward, and it can be easily applied to e.g. free boundary conditions. While this may seem unnecessary for our example, the method can be readily generalized to disordered systems such as random ferromagnets <cit.> and even spin glasses <cit.> with competing interactions.









§ CONCLUSIONS


In this work, we have presented a mathematical induction approach to the solution of the 1D Ising model, complementing the more traditional transfer matrix method.
The analytical procedure is rather intuitive, physically clear, and computationally friendly, which makes the formalism very suited to be used in introductory statistical mechanics courses.
Remarkably, the algebraic derivation following this path connects with the formalism of the transfer matrix method. This fully equivalence is an extra benefit since it provides a physical interpretation of the transfer matrix, that appears naturally from considering the recurrent summation of the energetic cost of inserting a new spin in the chain.

W.W. gratefully acknowledges support from the Swedish Research Council Grant No. 642-2013-7837 and Goran Gustafsson Foundation for Research in
Natural Sciences and Medicine.





 




