Notice that if
I is countable, the above series will be convergent for suffi-
ciently large
N. By factoring
l
max
(b) out of the series
Z
N
=l
max
(b)
N
[j(P
max
(b))+E
N
],
E
N
= C
n ¥
IŒ
1
l
n
(b)
l
max
(b)
2
N
j( P
n
(b)),
(28)
where
IŒ is
I with the index corresponding to
l
max
(b) removed. Equation (26)
simply follows from the fact that
lim
N Q .
[j(P
max
(b))+E
N
]
1/N
=1
(29)
because
j( P
max
(b)) ]
0.
Now,
T(
b) fulfills the hypothesis of Theorem 3, thus
l
max
(b) > 0 has
multiplicity one. Then taking
S={l
max
(b)} in Theorem 4 it follows that
this eigenvalue is an analytic function in
b > 0 and the proof is com-
plete.
L
4.3. Discussion
4.3.1. Boundary Conditions
Among the hypotheses of the theorem, the only one whose signifi-
cance may not be evident is
j( P
max
(b)) ]
0. As stated in the proof, this is
actually needed to show that the partition function can be written in terms
of the maximum eigenvalue. Actually, the condition is related to the choice
of boundary conditions for the system. In the examples mentioned above,
j( T )=tr
( T ) arises from periodic boundary conditions, whereas
j( T )=
O
f, TgP arises from fixed boundary conditions given by the two vectors
f
and
g. The condition is then excluding boundary conditions that would
suppress the eigenstates of the maximum eigenvalue as allowed states for
the model. Otherwise nothing can be said about the existence or not of
phase transitions and, in fact, they are possible: As an illustrative example,
consider a transfer matrix for a three-state system of the form
T —
R
3
1
1
1
b
1
1
1
b
S
.
(30)
This is a positive, irreducible matrix which, according to Perron–Frobenius
theorem, can not have a phase transition. However, the spectrum of this
matrix is
s( T )={b − 1,
1
2
(4+b ± `
12 − 4b+b
2
)}.
(31)
Do'stlaringiz bilan baham: