book errata
book errata
We list here typos and errors that have been found in the published version of the
book. We welcome any additional corrections you may find! We indicate page
and line numbers for the published version of the book; negative line numbers are
counted from the bottom of the page. Most typos have already been corrected in
the version available on our web page (the address is given in the footer). When
this has not been done, the relevant pages are indicated in brackets.
¯ ¯
• p. 6, l. 5: ¯ should be ¯ .
¯ ¯
U
e =U 1 U
e1 =U 1
1 def
lim Boltz (ρ) = −ρ log ρ − (1 − ρ) log(1 − ρ) .
SBoltz (Λ; N ) = shard
2V
• p. 66, (2.11): The factor N 1/2 can be removed from the upper bound. The
same is true when applying this bound just after Exercise 2.1.
We thank all readers who have sent us their corrections, among which (our sincere apologies
to those we forgot): Costanza Benassi, Quentin Berthet, Adolfo Camacho Melo, Tecla Cardilli, Loren
Coquille, Yair Daon, Margherita Disertori, Hugo Duminil-Copin, Arved Niklas Fanta, Maëllie Godard,
Christian Hansch, Qidong He, Roman Kotecký, Benjamin Lees, Antoine Maier, Mirmukhsin Makhmu-
dov, Mauro Mariani, Philippe Moreillon, Sébastien Ott, Ron Peled, Elias Reutelsterz, Costanza Rojas-
Molina, Sylvie Roelly, Vedran Sohinger, Daniel Ueltschi, Zichun Ye.
• p. 75, l. −8: 2/N can be replaced by 1/N . In the following line, 4d β/N can be
replaced by 2d β/N .
• p. 83, l. −2: "such that dr=1 |(i r − j r ) mod n|" should be "such that i − j has
P
only one nonzero component and the latter is equal to ±1 modulo n".
• p. 92, l. 1: Λ ⊂ Zd should be Λ ⋐ Zd .
∆2k ∈ Λ2n : n ≥ 1 .
ª
• p. 116: The code for Figure 3.10 has some bug that make it looks rather poor.
• p. 129, l. −3: “with the free boundary condition” should be “with free bound-
ary condition”.
• p. 136, l. −7: “For any A, B ⊂ Λ” should be “For any A ⊂ Λ”. Moreover, the
claim in this exercise (Exercise 3.31) can be strengthened, see the additional
exercises for Chapter 3 below.
• p. 161, l. 11: Theorem 3.59 should be Theorem 3.58. A couple of lines be-
low, [βc (d − 1), βc (d )) should be (βc (d ), βc (d − 1)] and [βc (2), βc (3)) should be
(βc (3), βc (2)].
• p. 181, l. 9: In (4.5), f Λn ;β (ρ) should be f Λn ;β (Nn /|Λn |). 3 lines below, one
might specify explicitly that ρ 7→ f β (ρ) is continuous and convex on [0, 1].
q q
N N N
• p. 183, l. 5: 2π |Λ| (1 − |Λ| ) should be 2πN (1 − |Λ| ).
1−ρ 1−ρ
• p. 183, l. −3: log( ρ ) should be |log( ρ )|.
Once more, for fixed β, once v is taken large enough, pbβvW (v) is well
approximated by the solution to
³ ¡1 1
¢ 1 ´
p+ 2 − 2β (v − 1) = β−1 ,
v2
1
which is essentially van der Waals’ expression (1.23), with a = 2 −
1
2β and b = 1.
• p. 208, Fig. 4.16: The maximizers should be expressed in terms of the variable
x, not the density ρ (so, ρ g should be x g , etc.).
• p. 214, l. 13: “a cube of sidelength ℓ2n , given by” should be “a cube given by”.
• p. 279, l. 14 and 16: the sign before the term H∆ (η ∆ τ′′Λ\∆ ωΛc ) is incorrect
(twice).
• p. 280: The two lines before Definition 6.18 should belong to a new para-
graph.
• p. 284 [p. 265]: In the caption of Fig. 6.1, one can assume, for simplicity, that
A has its support in Λ.
• p. 287, l. −1: it would be better to use η i rather than ωi in the right-hand side.
• p. 291, l. 2: the last identity should be an inequality (since we are taking the
supremum over i .)
• p. 301, l. 8: One should replace the assumption that G (π) ̸= ∅ by the as-
sumption that π is quasilocal. This guarantees that G (π) is a closed subset
of M1 (Ω) (Lemma 6.27). (The condition G (π) ̸= ∅ is not needed anymore by
Theorem 6.26.)
′
• p. 390, l. 6: e −β∥γ∥ should be e −β∥γ ∥ .
b #stable should be ψ
• p. 391, l. 1: ψ b #n,stable .
• p. 434, l. −4: Replace “Let ϵ > 0 be such that e ϵ /(1 + m 2 ) < 1 and n be large
enough to ensure that |η i | ≤ e ϵn for all i ∈ ∂ext B(n). Then,” by “Let ϵ > 0 be
such that e ϵ /(1 + m 2 ) < 1 and, for all n large enough, |η i | ≤ e ϵn for all i ∈
∂ext B(n). Then, for all such n,”.
Chapter 3
▶ The following two exercises are complements to Section 3.3.
Exercise. Consider the one-dimensional Ising model on the torus Tn . Show that
per ∂ per
〈σ0 〉V = ψ (β, h)
n ;β,h ∂h Vn
per
and deduce an expression for 〈σ0 〉β,h = limn→∞ 〈σ0 〉V .
n ;β,h
Exercise. Let Λn = {−n, . . . , n}. Using the transfer matrix, compute ψ+ Λn (β, h),
〈σ0 〉+
Λ ;β,h
and 〈σ0 σi 〉 +
Λ ;β,h
, as well as the corresponding limits as n → ∞.
n n
tanh(h) ≤ 〈σ0 〉+
Λ;β,h ≤ tanh(h + 4d β).
∂
Hint: Use FKG for the upper bound. Then, show that ∂h 〈σ0 〉+
Λ;β,h
≥ 1 − (〈σ0 〉+
Λ;β,h
)2 .
Deduce from that both the lower bound and the strict monotonicity.
Exercise. 1. Check that the 2-state Potts model reduces to the Ising model at
inverse temperature β/2.
2. Check that the Hamiltonian of the Potts model is invariant under permuta-
tion of the spin values.
q−Potts,0 1
lim inf µB(n);β (σ0 = 0) > ,
n→∞ q
which shows that the symmetry under permutation is broken at low temper-
atures. Hint: One way to proceed is to use contours that keep some informa-
tion on the values of the spins on each side.
Exercise. Deduce from Exercise 3.31, under the same assumptions, that
Chapter 9
▶ The following exercise is a complement to Theorem 9.14.
1. Writing e βSi ·S j = e −β (e β(Si ·S j +1) − 1 + 1) and expanding the product over the
edges of B(n), show that
|〈S0 · Sk 〉∅
B(n);β
| ≤ QB(n);β (0 ←→ k),
3. Deduce from this that there exists β0 > 0 such that, for any β < β0 ,
QB(n);β (0 ←→ k) ≤ e −c∥k∥2