computo ergo sum

2026-10-01 · chapter Yang–Mills and the mass gapPart 6 Constructive field theorycluster expansion

The whole book Contents and reading orders
  1. Part 0 Entrance — how to read this book
  2. 0-01 How to read this book
  3. 0-02 One picture
  4. 0-03 Reading the problem statement word by word
  5. 0-04 Four dimensions in mathematics and four dimensions in physics
  6. Part 1 Mathematical preparation
  7. 1-01 Vector spaces and linear maps
  8. 1-02 What a group is
  9. 1-03 Lie groups and Lie algebras
  10. 1-04 SU(2) and SU(3)
  11. 1-05 Manifolds and tangent spaces
  12. 1-06 Differential forms and the exterior derivative
  13. 1-07 Vector bundles and connections
  14. 1-08 Probability and measure
  15. 1-09 Probability in infinite dimensions
  16. 1-10 Hilbert spaces and self-adjoint operators
  17. 1-11 Fourier analysis and distributions
  18. 1-12 Detour: what happens only in four dimensions
  19. Part 2 Physical preparation
  20. 2-01 Lagrangians and the action
  21. 2-02 The idea of a field
  22. 2-03 Electromagnetism is a gauge theory
  23. 2-04 Special relativity and spacetime
  24. 2-05 The bones of quantum mechanics
  25. 2-06 The harmonic oscillator and creation and annihilation
  26. 2-07 The idea of the path integral
  27. 2-08 Statistical mechanics and phase transitions
  28. 2-09 Detour: the gap and the correlation length in the Ising model
  29. 2-10 The relaxation time and the dynamical exponent z
  30. Part 3 Yang–Mills theory (classical)
  31. 3-01 The gauge principle
  32. 3-02 Non-abelian gauge fields
  33. 3-03 The action and the equations
  34. 3-04 Gauge theory as geometry
  35. 3-05 Instantons and topology
  36. 3-06 Detour: Donaldson and exotic R⁴
  37. 3-07 Yang–Mills inside the Standard Model
  38. Part 4 Quantisation
  39. 4-01 Canonical quantisation and the Hamiltonian
  40. 4-02 The path integral and Euclideanisation
  41. 4-03 Perturbation theory and Feynman diagrams
  42. 4-04 Divergences and renormalisation
  43. 4-05 The algebra of divergences
  44. 4-06 Asymptotic freedom
  45. 4-07 Dimensional transmutation and Λ
  46. 4-08 Gauge fixing and Faddeev–Popov
  47. 4-09 The axioms of quantum field theory
  48. 4-10 The Osterwalder–Schrader axioms and reconstruction
  49. 4-11 The definition of the mass gap
  50. 4-12 Detour: the perturbation series diverges
  51. Part 5 Lattice gauge theory
  52. 5-01 Wilson's lattice
  53. 5-02 The strong-coupling expansion
  54. 5-03 Reflection positivity and the transfer matrix
  55. 5-04 The infinite-volume limit and the cluster expansion
  56. 5-05 Weak coupling and the continuum limit
  57. 5-06 How U(1) differs from the non-abelian case
  58. 5-07 The Monte Carlo method
  59. 5-08 Measuring glueballs and the string tension
  60. 5-09 What to hold fixed when taking the limit
  61. 5-10 Lattice gauge theory with finite groups
  62. 5-11 Detour: Bakry–Émery and one-link integration
  63. Part 6 Constructive field theory
  64. 6-01 What constructive field theory is
  65. 6-02 Solvability in two dimensions and the Yang–Mills measure
  66. 6-03 Constructing scalar fields
  67. 6-04 The cluster expansion
  68. 6-05 The sequence of renormalisation group steps
  69. 6-06 Ultraviolet stability of three-dimensional Yang–Mills
  70. 6-07 Four dimensions
  71. 6-08 Triviality of φ⁴ in four dimensions
  72. 6-09 Stochastic quantisation and regularity structures
  73. 6-10 Where four dimensions stops
  74. 6-11 Obstacles other than divergence
  75. 6-12 Detour: "if 1/0 is given a symbol"
  76. Part 7 From the side of physics
  77. 7-01 How physics sees it
  78. 7-02 Mechanisms of confinement
  79. 7-03 The string picture
  80. 7-04 Large N
  81. 7-05 String theory and extra dimensions
  82. 7-06 How extra dimensions become invisible
  83. 7-07 Where gauge fields come from
  84. 7-08 Holography
  85. 7-09 The mass gap becomes geometry
  86. 7-10 Back to four dimensions
  87. 7-11 Supersymmetry and Seiberg–Witten
  88. 7-12 The sentence that plays the role of an equivalence principle
  89. 7-13 Where the way physics digs parts from mathematics
  90. Part 8 A dictionary of two languages — the physical and the mathematical view
  91. 8-01 How to read the dictionary
  92. 8-02 Dictionary A
  93. 8-03 Dictionary B
  94. 8-04 Dictionary C
  95. 8-05 The physical counterparts of our assumptions
  96. Part 9 Where things stand, and open tasks
  97. 9-01 How far the world has come
  98. 9-02 Where the two ways of digging part
  99. 9-03 Candidates for new concepts
  100. 9-04 The list of open tasks
  101. 9-05 Common misconceptions
  102. Part 10 Towards a proof of the mass gap — building the first step of the staircase
  103. 10-00 Entrance — the staircase, and the random walk, the ruler and the clock
  104. 10-01 The line of construction and Assumption H
  105. 10-02 Roads tried on the four-dimensional lattice, and walls
  106. 10-03 The four steps of the staircase — why we start from 0+1 dimensions
  107. 10-04 The path measure of the double well, and kinks
  108. 10-05 The statement of the first step — four conditions and Proposition 4.5
  109. 10-06 (H1) Local Poincaré within a phase
  110. 10-07 The map of (H2) — seven routes and the seam of the ring
  111. 10-08 What computer-assisted means — the conditions on the chain inside the window
  112. 10-09 The sector framework and the three strands of route 5
  113. 10-10 The list of detour plans — types of breakage
  114. 10-11 (H3)(H4) and the constant of the core
  115. 10-12 The integrated table and the dependency graph
  116. 10-13 Lean statements and the limits of machine checking
  117. 10-14 Reconciliation — the numbers of the record and the known numbers
  118. 10-15 What remains and its cost — the distance to a theorem
  119. 10-16 What is not claimed
  120. 10-17 Insights and small questions
  121. Part 11 Further considerations — beyond Assumption H, and other views
  122. 11-00 Further considerations — entrance
  123. 11-01 One form that obstructs H — a nearly conserved global quantity
  124. 11-02 Choosing the ruler and the coordinates again — the length at which conservation breaks
  125. 11-03 Two ways to repair H — the sector H and the local H
  126. 11-04 Which H the one-sided bridge needs
  127. 11-05 Making time continuous — the Hamiltonian lattice and the vacuum measure
  128. 11-06 Paying with rarity instead of convexity — renormalisation on groups and log-Sobolev
  129. 11-07 Because it is four dimensions — the dimensionless coupling and topology
  130. 11-08 Questions, and what is not claimed
  131. 11-A1 Table of notation for Part 11
  132. Appendices
  133. A-01 Table of notation
  134. A-02 Glossary
  135. A-03 Guide to the literature
  136. A-04 Lean and machine checking
  137. A-05 How this book was made
  138. A-06 Index of assumptions

The cluster expansion — a tool that splits into weakly linked small lumps and rewrites the logarithm as a convergent sum

What this chapter shows — The formula that writes the logarithm of the partition function as a sum over "connected lumps" (clusters), and its convergence condition. That convergence gives the infinite-volume limit, analyticity and exponential decay of correlations all at once. That continuum fields, too, can be decoupled cube by cube.

Prerequisite chapters — 6-03. We also use stages 4 and 6 of 6-01, 4-11 and 1-08 (Gaussian measures). The language of graphs is defined on the spot.

Said first — This is a tool for when there is a small parameter (weak coupling, high temperature, strong coupling on the lattice), and it does not reach the infinite-volume limit or the gap of four-dimensional Yang–Mills. The computations concern a one-dimensional model and small graphs.

The order of this chapter
  1. What the tool is for — if independent, the logarithm is a sum. Weak links are added in as corrections
  2. The smallest example: the one-dimensional hard-core lattice gas — coefficients, radius of convergence 1/4, the singularity on the side of negative activity (a table of computations)
  3. Polymer models — the common form of a gas of incompatible lumps
  4. Taking the logarithm: Ursell functions and connected graphs — only connected clusters remain
  5. Why it can converge: cancellation and trees — the signs cancel, and only the number of trees remains (a moving figure)
  6. Criteria for convergence — inequalities such as Kotecký–Preiss, and the range they guarantee (a moving figure)
  7. Detour: the same inequality as the local lemma of probability — the Lovász local lemma and the zeros of the independent set polynomial
  8. What the expansion gives: infinite volume, analyticity, exponential decay — the decay rate of correlations is the "mass gap" of this model
  9. To continuum fields: cut into cubes and decouple by interpolation — rewritten as a gas of lumps of cubes
  10. Uses and limits for gauge fields — works on the strong-coupling side, and does not reach the infrared in four dimensions

01

What the tool is for

What stages 4 and 6 need are estimates independent of the size of the box, and quantities far apart becoming nearly independent (formula (9) of 6-01). The problem statement says that because perturbation series usually diverge, expansion methods collectively called "cluster expansions" were developed, and writes 'Refined estimates yield the rate of exponential decay of Green's functions, magnitude of masses, ...' (JW §6.1). Known

The core is a single point. If the blocks are independent of each other, the partition function is a product and the logarithm is a sum.

ZΛ=∏jZj⟹log⁡ZΛ=∑jlog⁡Zj(1)Z_\Lambda=\prod_{j}Z_j\quad\Longrightarrow\quad\log Z_\Lambda=\sum_j\log Z_j \tag{1}

If it is a sum, quantities per unit volume do not depend on the box, and distant blocks have no effect. Real blocks are weakly linked, and the cluster expansion adds those links in as corrections for each "set of connected blocks" and shows that the sum converges. As a metaphor, it is a thin gas that hardly ever collides. More precisely, two things are needed: (i) the correction linking nn of them is of the order of a small number to the power nn, and (ii) the number of ways of linking, divided by n!n!, is of exponential order (§05).

Example: if each block is independently "empty" or "one particle (weight zz)", then Z=(1+z)NZ=(1+z)^N. log⁡Z/N=z−z22+⋯\log Z/N=z-\tfrac{z^2}{2}+\cdots converges for ∣z∣<1|z|\lt1 and stops at z=−1z=-1, where Z=0Z=0. The reach of the series is decided by where the partition function vanishes for complex zz.

02

The smallest example: the one-dimensional hard-core lattice gas

This example is used throughout the chapter. Place particles at the points x=1,…,Nx=1,\dots,N (nx∈{0,1}n_x\in\{0,1\}), forbid neighbours from being occupied together (hard-core repulsion), and give each particle the weight zz (the activity).

ΞN(z)=∑n∈{0,1}Nnxnx+1=0z n1+⋯+nN(2)\Xi_N(z)=\sum_{\substack{n\in\{0,1\}^N\\ n_xn_{x+1}=0}}z^{\,n_1+\cdots+n_N} \tag{2}

If points NN and 11 are also regarded as neighbours to make a ring, one can write ΞN=tr⁡TN\Xi_N=\operatorname{tr}T^N with the transfer matrix T=(1zz0)T=\begin{pmatrix}1&\sqrt z\\ \sqrt z&0\end{pmatrix} (transfer matrices are in 2-08 §03; the example of the Ising model is in 2-09, and lattice gauge theory in 5-03). The entries are Tnn′=z(n+n′)/2T_{nn'}=z^{(n+n')/2} (n,n′∈{0,1}n,n'\in\{0,1\}; only n=n′=1n=n'=1 gives 0). So in tr⁡TN=∑n1,…,nN∏x=1NTnxnx+1\operatorname{tr}T^N=\sum_{n_1,\dots,n_N}\prod_{x=1}^{N}T_{n_xn_{x+1}} (nN+1=n1n_{N+1}=n_1), the weight of each nxn_x is picked up twice, half each time, giving znxz^{n_x}, and simultaneous occupation of neighbours vanishes with 0. This is exactly formula (2) on the ring. Of the eigenvalues λ±=12(1±1+4z)\lambda_\pm=\tfrac12(1\pm\sqrt{1+4z}), the larger survives. We call the following p(z)p(z) the pressure (the physical pressure times the inverse temperature, the log⁡\log partition function per unit volume).

p(z)=lim⁡N→∞1Nlog⁡ΞN=log⁡1+1+4z2=∑n≥1bnzn,bn=(−1)n−1n(2n−1n)(3)p(z)=\lim_{N\to\infty}\frac1N\log\Xi_N=\log\frac{1+\sqrt{1+4z}}{2}=\sum_{n\ge1}b_nz^n,\qquad b_n=\frac{(-1)^{n-1}}{n}\binom{2n-1}{n} \tag{3}

ComputedTable 1 The coefficients bnb_n (agree with the closed form up to n≤24n\le24 by series operations with rational numbers).

nn23462060
bnb_n−3/210/3−35/4−77−3.4×10⁹−8.1×10³²
∣bn/bn−1∣|b_n/b_{n-1}|1.5002.2222.6253.0563.7053.901

The ratio approaches 4, and the radius of convergence is 1/41/4. The radius of convergence of a power series is the distance to the nearest point to the origin at which the function stops being analytic in the complex plane (a theorem of complex analysis) Known. Here that point is z=−1/4z=-1/4, where the inside of the square root vanishes and the eigenvalues coincide. There is no phase transition for z>0z\gt0, and yet the series cannot go beyond 1/41/4. The reach of the expansion is decided by a singularity on the side of non-physical negative activity. The zero of Ξ\Xi for a chain of length nn nearest to the origin is −1/(4cos⁡2πn+2)-1/(4\cos^2\frac{\pi}{n+2}) (Scott–Sokal 2005, Ex. 3.2), which for n=5,10,20n=5,10,20 is −0.3080,−0.2679,−0.2552-0.3080,-0.2679,-0.2552. Computed

03

Polymer models

We extract the structure. Prepare a collection P\mathcal P of finite lumps (polymers) γ\gamma, a relation of being incompatible, γ≁γ′\gamma\not\sim\gamma' (overlapping, touching and so on; each is incompatible with itself), and complex activities zγz_\gamma, and count only the sets in which every two are compatible.

ΞΛ=1+∑n≥11n!∑(γ1,…,γn)∈Λnzγ1⋯zγn∏j<k1{γj∼γk}(4)\Xi_\Lambda=1+\sum_{n\ge1}\frac1{n!}\sum_{(\gamma_1,\dots,\gamma_n)\in\Lambda^n}z_{\gamma_1}\cdots z_{\gamma_n}\prod_{j\lt k}\mathbf 1\{\gamma_j\sim\gamma_k\} \tag{4}

Λ\Lambda is a finite collection, and 1{⋅}\mathbf 1\{\cdot\} is 1 if the condition is true and 0 if false. This formalism is said to have been introduced by Gruber–Kunz (1971) (Fernández–Procacci 2007 §1). Known

Example: in §02, a polymer = one occupied point, incompatible = the same point or a neighbour. In the high-temperature Ising model without external field (2-08), the polymers are connected sets of edges with even degree at every point, they are incompatible if they share a vertex, and the activity is (tanh⁡β)number of edges(\tanh\beta)^{\text{number of edges}}. Strong coupling in lattice gauge theory (5-04) has connected sets of plaquettes, and continuum fields at weak coupling (§09) have connected sets of cubes. The reason the lumps are small becomes the small parameter of the expansion.

04

Taking the logarithm: Ursell functions and connected graphs

In the device that goes by the name of Mayer (said to go back to Mayer 1937), one writes 1{γj∼γk}=1+ζjk\mathbf 1\{\gamma_j\sim\gamma_k\}=1+\zeta_{jk} (−1-1 if incompatible, 0 if compatible) and expands the product. Each term corresponds to a graph (points, and edges joining pairs of points) on the points 1,…,n1,\dots,n, and in the logarithm only connected graphs remain. The reason is that the weight of a graph splits into the product of the weights of its connected components. Organising by the ways of dividing the points into connected components, between the sums over all nn with 1/n!1/n! attached, sum over all graphs=exp⁡(sum over connected graphs)\text{sum over all graphs}=\exp\big(\text{sum over connected graphs}\big) (the exponential formula) holds, and taking the logarithm leaves only the connected ones. Known

log⁡ΞΛ=∑n≥11n!∑(γ1,…,γn)φT(γ1,…,γn) zγ1⋯zγn,φT=∑G⊂Gγconnected, spanning(−1)∣E(G)∣(5)\log\Xi_\Lambda=\sum_{n\ge1}\frac1{n!}\sum_{(\gamma_1,\dots,\gamma_n)}\varphi^{\mathrm T}(\gamma_1,\dots,\gamma_n)\,z_{\gamma_1}\cdots z_{\gamma_n},\qquad\varphi^{\mathrm T}=\sum_{\substack{G\subset G_\gamma\\ \text{connected, spanning}}}(-1)^{|E(G)|} \tag{5}

GγG_\gamma is the graph joining j,kj,k when γj≁γk\gamma_j\not\sim\gamma_k, the sum is over connected subgraphs using all the points, and ∣E(G)∣|E(G)| is the number of edges (1 for n=1n=1). φT\varphi^{\mathrm T} is the Ursell function (unrelated to the field ϕ\phi), and it is 0 if GγG_\gamma is not connected. Only sets connected by incompatibility, that is clusters, contribute (Fernández–Procacci (2.3)(2.4). Still a formal series).

Example: in §02, averaging over translations, bn=1n!∑x2,…,xnφT(0,x2,…,xn)b_n=\frac1{n!}\sum_{x_2,\dots,x_n}\varphi^{\mathrm T}(0,x_2,\dots,x_n). For n=2n=2, each of x2=−1,0,1x_2=-1,0,1 gives −1-1 with one edge, so b2=−3/2b_2=-3/2. The (0,0)(0,0) forbidden in configurations appears in the logarithm. Summing by brute force up to n≤6n\le6 agreed with Table 1 in rational numbers. Computed

05

Why it can converge: cancellation and trees

The sum in formula (5) is huge. When every two are incompatible, GγG_\gamma is the complete graph KnK_n (joining all pairs), there are nearly as many connected spanning subgraphs as graphs in all, and if they remained as ±1\pm1 the sum would not converge even after dividing by n!n!. But the sum cancels, and only (−1)n−1(n−1)!(-1)^{n-1}(n-1)! remains.

ComputedTable 2 KnK_n (brute force for n≤6n\le6, a recurrence for n=10n=10).

nnConnected spanning subgraphsSpanning trees nn−2n^{n-2}Alternating sum
43816−6
1034 496 488 594 816100 000 000−362 880

The mechanism is due to Penrose (1967). Dividing the connected spanning subgraphs into intervals [T,R(T)][T,R(T)], one for each spanning tree (a subgraph without cycles connecting all the points) TT, the sum of signs within an interval vanishes by the factor ∏e∈R(T)∖T(1−1)\prod_{e\in R(T)\setminus T}(1-1), and only the trees with R(T)=TR(T)=T (Penrose trees) remain (Fernández–Procacci, Prop. 5). Known

φT(γ1,…,γn)=(−1)n−1 #{Penrose trees}⟹∣φT∣≤#{Gγ ’s spanning trees}(6)\varphi^{\mathrm T}(\gamma_1,\dots,\gamma_n)=(-1)^{n-1}\,\#\{\text{Penrose trees}\}\quad\Longrightarrow\quad\big|\varphi^{\mathrm T}\big|\le\#\{G_\gamma\ \text{'s spanning trees}\} \tag{6}

The number of Penrose trees agreed with the absolute value of the alternating sum by brute force for n≤6n\le6 Computed. Even for KnK_n there are nn−2n^{n-2} spanning trees, and nn−2/n!n^{n-2}/n! is of order ene^n. Since only an exponential remains after dividing by n!n!, (5) can converge if the activities are small. Identities that write the sum in terms of trees or forests from the start were refined from Brydges–Federbush (1978) to the forest formula of Brydges–Kennedy (1987) (Abdesselam–Rivasseau 1994).

Figure 1 Choose a graph and press "Play": the connected spanning subgraphs are counted in order of increasing number of edges, and the running total of the signs (−1)∣E∣(-1)^{|E|} changes (bar: green +1, red −1)
1234K4: 38 subgraphs, no. 386 edges → sign +1running total −6
K4: 38 connected spanning subgraphs, running total −6

ComputedThe numbers in this figure were computed on this machine. The running total for K4K_4 is −16 at 3 edges (16 spanning trees), −1 at 4 (15 of them), −7 at 5 (6 of them) and −6 at 6. C4C_4 gives −3, P4P_4 −1 and K3K_3 +2.

06

Criteria for convergence

Summing up the tree estimates gives a condition. The widely used condition of Kotecký–Preiss (1986) assigns to each lump a "budget" a(γ)≥0a(\gamma)\ge0 and requires

∑γ′≁γ∣zγ′∣ ea(γ′) ≤ a(γ)(for all γ)(7)\sum_{\gamma'\not\sim\gamma}|z_{\gamma'}|\,e^{a(\gamma')}\ \le\ a(\gamma)\qquad(\text{for all }\gamma) \tag{7}

(the left-hand side includes γ\gamma itself). If it holds, the series obtained by differentiating log⁡ΞΛ\log\Xi_\Lambda with respect to zγ0z_{\gamma_0} (the sum of clusters containing the lump γ0\gamma_0; the sum per polymer) is at most ea(γ0)e^{a(\gamma_0)} independently of Λ\Lambda, even with each term replaced by its absolute value (Fernández–Procacci (2.6)(2.7)(2.14)(2.15)). log⁡ΞΛ\log\Xi_\Lambda itself grows with the volume, but because this per-polymer upper bound does not depend on Λ\Lambda, (5) converges absolutely with estimates uniform in Λ\Lambda (ibid., the sentence right after (2.7)). The change in the logarithm when the lump γ0\gamma_0 is removed is also at most ∣zγ0∣ea(γ0)|z_{\gamma_0}|e^{a(\gamma_0)} (ibid. (2.11)). Read it as "the total weighted activity of the incompatible partners fits within one's own budget". The conditions of the same type of Dobrushin (1996) and Fernández–Procacci (2007) widen the range of application in that order. Known

ComputedTable 3 The range guaranteed for the gas of §02 (maximum degree Δ=2\Delta=2). Numerical maximisation agrees with the formulas of Fernández–Procacci Table 1.

ConditionForm for this gasGuaranteed ∣z∣|z|
Kotecký–Preiss3∣z∣ea≤a3|z|e^{a}\le a1/(3e)=0.12261/(3e)=0.1226
Dobrushin∣z∣≤μ/(1+μ)3|z|\le\mu/(1+\mu)^34/27=0.14814/27=0.1481
Fernández–Procacci∣z∣≤μ/(1+3μ+μ2)|z|\le\mu/(1+3\mu+\mu^2)1/5=0.20001/5=0.2000
Exact radiusFormula (3)1/4=0.25001/4=0.2500

1+3μ+μ21+3\mu+\mu^2 counts the mutually compatible subsets of three incompatible points (the empty set, the three single points, {x−1,x+1}\{x-1,x+1\}), and (1+μ)3(1+\mu)^3 is coarser by also counting the sets that are not. The 1/41/4 in the last row is the exact value (Δ−1)Δ−1/ΔΔ(\Delta-1)^{\Delta-1}/\Delta^{\Delta} on the infinite tree with every degree Δ\Delta (Shearer / Scott–Sokal; the starred entry in Fernández–Procacci Table 1) with Δ=2\Delta=2 put in. This tree with Δ=2\Delta=2 is the line of integers itself, so it agrees with the 1/41/4 of formula (3). All three conditions above are sufficient conditions.

Figure 2 As the number of terms NN increases, the partial sum of series (3) (thick line) lies on the exact pressure (thin line) for ∣z∣<1/4|z|\lt1/4, and runs wild outside (bands are the range of each condition)
N = 10, z = 0.200: difference 3.86e-4

ComputedThe numbers in this figure were computed on this machine. ∣SN(z)−p(z)∣|S_N(z)-p(z)| for N=5,20,40N=5,20,40 is 3e−3, 1.5e−5, 6.4e−8 at z=0.2z=0.2 and 0.029, 0.063, 0.88 at z=0.3z=0.3.

07

Detour: the same inequality as the local lemma of probability

Detour

A section you may skip.

The Lovász local lemma of combinatorics (Erdős–Lovász 1975) is a condition for the probability that none of the "bad events" AxA_x occurs to be positive. The way the events depend on each other is represented by a graph. Write Γ(x)\Gamma(x) for the set of points adjacent to the point xx.

Dependency graph: when each AxA_x is independent of the events other than xx and its neighbours Γ(x)\Gamma(x) (taken all together), this graph is called a dependency graph. The theorem has the following form (Scott–Sokal 2005, Thm 1.1; Ax cA_x^{\,c} is the event that AxA_x does not occur).

0≤rx<1,P(Ax)≤rx∏y∈Γ(x)(1−ry) (for all x) ⟹ P(⋂xAx c)≥∏x(1−rx)>0(8)0\le r_x\lt1,\quad \mathbb P(A_x)\le r_x\prod_{y\in\Gamma(x)}(1-r_y)\ (\text{for all }x)\ \Longrightarrow\ \mathbb P\Big(\bigcap_x A_x^{\,c}\Big)\ge\prod_x(1-r_x)\gt0 \tag{8}

Scott–Sokal showed the following equivalence. That the conclusion of the local lemma (the probability that none occurs is positive) holds for every family of events with dependency graph GG and P(Ax)≤px\mathbb P(A_x)\le p_x is equivalent to the partition function of the hard-core gas on GG not vanishing on the polydisc of radii pxp_x (the tuples of complex numbers (zx)(z_x) with ∣zx∣≤px|z_x|\le p_x for every xx). This partition function is the sum ∑S∏x∈Szx\sum_S\prod_{x\in S}z_x over sets SS of mutually non-adjacent points (the independent set polynomial; the multivariate version with an activity for each point), and if GG is a path it becomes the gas of §02. They also show that the usual proof of the local lemma corresponds to the induction on "having no zeros" found implicitly by Shearer (1985) and explicitly by Dobrushin (abstract).

Setting r=μ/(1+μ)r=\mu/(1+\mu), the hypothesis of (8) is Dobrushin's form in Table 3, and for a sequence of events depending only on their left and right neighbours p≤4/27p\le4/27 is enough. The best is 1/41/4, bounded from above by Example 8.1 of Scott–Sokal §8.4 (the zeros of finite paths approach −1/4-1/4) and from below by the exact radius of Table 3 (Shearer's value (Δ−1)Δ−1/ΔΔ(\Delta-1)^{\Delta-1}/\Delta^{\Delta} with Δ=2\Delta=2). The symmetric version often seen in textbooks also follows from here. When each event depends on at most dd other events and every probability is at most pp, setting rx=1/(d+1)r_x=1/(d+1) in (8) gives r(1−r)d=1d+1(dd+1)d≥1e(d+1)r(1-r)^d=\frac1{d+1}\big(\frac d{d+1}\big)^d\ge\frac1{e(d+1)}, so ep(d+1)≤1ep(d+1)\le1 is enough. For d=2d=2 this is 1/(3e)1/(3e), the Kotecký–Preiss value of Table 3. In this way all four values of Table 3 also appear on the side of the local lemma. Known

08

What the expansion gives: infinite volume, analyticity, exponential decay

If condition (7) holds independently of the volume, three things follow. (i) The limit of the pressure exists and is analytic in the disc. (ii) Only clusters that touch the edge or go round feel the size of the box. (iii) In truncated correlations only clusters touching both xx and yy, that is, connected from xx to yy by a chain of incompatibility, remain, and each link contributes a factor of order ∣z∣|z| (Ueltschi 2004, Thm 3). Known

∣⟨AxBy⟩−⟨Ax⟩⟨By⟩∣ ≤ C e−m∣x−y∣(9)\big|\langle A_xB_y\rangle-\langle A_x\rangle\langle B_y\rangle\big|\ \le\ C\,e^{-m|x-y|} \tag{9}

Example: counting the gas of §02 on a ring of 14 points, the coefficients of log⁡Ξ14/14\log\Xi_{14}/14 agree with bnb_n for n≤13n\le13, and first differ at n=14n=14 (going round needs all 14 points). The correction is 1Nlog⁡(1+(λ−/λ+)N)\frac1N\log\big(1+(\lambda_-/\lambda_+)^N\big), and for small zz, λ−/λ+≈−z\lambda_-/\lambda_+\approx-z, so it is of order (−z)N/N(-z)^N/N (the difference in the coefficient at n=14n=14 is exactly 1/141/14). The truncated correlation of the density is proportional to (λ−/λ+)∣x−y∣(\lambda_-/\lambda_+)^{|x-y|}, and the decay rate is m(z)=log⁡(λ+/∣λ−∣)m(z)=\log(\lambda_+/|\lambda_-|). Computed

ComputedTable 4 The decay rate m(z)m(z) and the estimate from chains log⁡(1/∣z∣)\log(1/|z|).

zz−0.249−0.10.010.251
m(z)m(z)0.12672.06344.62491.76270.9624
log⁡(1/∣z∣)\log(1/|z|)1.39032.30264.60521.38630

For small zz, m≈log⁡(1/z)m\approx\log(1/z) and the picture of chains is right; as z→−1/4z\to-1/4, m→0m\to0 (decay stops at the singularity that fixed the radius). z=1z=1 is outside the radius and still has m>0m\gt0: convergence is a sufficient condition.

m(z)m(z) is the ratio of eigenvalues of the transfer matrix, the "mass gap" of this model (stage 6 of 6-01, 4-11). In field theory too, if truncated correlations in the time direction decay like e−mte^{-mt} uniformly in the volume, and the vectors ψ\psi (with the vacuum component subtracted) made from the observables for which this decay can be shown are dense in the subspace orthogonal to the vacuum, then the Hamiltonian HH of the OS reconstruction (4-10) has no spectrum in (0,m)(0,m). Known

The tool is the spectral measure. For each ψ\psi there is a measure μψ\mu_\psi on [0,∞)[0,\infty) with ⟨ψ,e−tHψ⟩=∫e−tλ dμψ(λ)\langle\psi,e^{-tH}\psi\rangle=\int e^{-t\lambda}\,\mathrm d\mu_\psi(\lambda) (the spectral theorem of 1-10; if there is a basis of eigenvectors eke_k, μψ\mu_\psi puts the weight ∣⟨ek,ψ⟩∣2|\langle e_k,\psi\rangle|^2 on each eigenvalue λk\lambda_k). If ∫e−tλdμψ≤Ce−mt\int e^{-t\lambda}\mathrm d\mu_\psi\le Ce^{-mt} holds for all tt, then looking at t→∞t\to\infty, μψ\mu_\psi cannot put weight on λ<m\lambda\lt m. Since this holds for a dense set of ψ\psi, no spectrum remains in (0,m)(0,m). The converse is formula (2) of §5 of the problem statement.

09

To continuum fields: cut into cubes and decouple by interpolation

For continuum fields, the covariance C(x,y)C(x,y) of the free field links even distant points. Cut the box into unit cubes bib_i (indicator functions χi\chi_i), and multiply the parts straddling cubes by sij∈[0,1]s_{ij}\in[0,1].

C(s)(x,y)=∑iχi(x)C(x,y)χi(y)+∑i≠jsij χi(x)C(x,y)χj(y),sij=sji(10)C(\mathbf s)(x,y)=\sum_i\chi_i(x)C(x,y)\chi_i(y)+\sum_{i\ne j}s_{ij}\,\chi_i(x)C(x,y)\chi_j(y),\qquad s_{ij}=s_{ji} \tag{10}

If all the ss are 1 this is the original covariance, and if all are 0 the cubes are independent (Abdesselam–Rivasseau 1994 (V.A.5)). The two are joined by Taylor's formula (ibid. (III.1)). The index ℓ\ell in formula (11) runs over pairs of cubes {i,j}\{i,j\}, and sℓ=sijs_\ell=s_{ij}. f(s)f(\mathbf s) is the partition function with covariance C(s)C(\mathbf s), II is a set of pairs, and ψI(h)\psi_I(h) is the point with sℓ=hℓs_\ell=h_\ell for ℓ∈I\ell\in I and sℓ=0s_\ell=0 for ℓ∉I\ell\notin I.

f(1,…,1)=∑I⊂{pairs} ∏ℓ∈I∫01 ⁣dhℓ (∏ℓ∈I∂∂sℓ)f(ψI(h))(11)f(1,\dots,1)=\sum_{I\subset\{\text{pairs}\}}\ \prod_{\ell\in I}\int_0^1\!\mathrm dh_\ell\ \Big(\prod_{\ell\in I}\frac{\partial}{\partial s_\ell}\Big)f\big(\psi_I(h)\big) \tag{11}

For a single pair, f(1)=f(0)+∫01f′(h) dhf(1)=f(0)+\int_0^1f'(h)\,\mathrm dh, and (11) repeats this pair by pair. ∂/∂sℓ\partial/\partial s_\ell (ℓ={i,j}\ell=\{i,j\}) brings down one line joining the cubes bi,bjb_i,b_j, of size about ∣C∣|C|, and with mass m0m_0 about e−m0∣x−y∣e^{-m_0|x-y|}. The differentiated pairs form lumps, the integral splits lump by lump, and it becomes a gas whose polymers are connected sets of cubes YY (ibid. (V.A.7)(V.A.8)).

However, the interpolated covariance must stay positive definite (the condition for it to make sense as a Gaussian measure), so in practice one uses the forest formula (the Taylor forest formula of Brydges–Kennedy, ibid. Thm III.1). This is the version in which the parameter joining two cubes is set to the minimum of hℓh_\ell along the path joining them in the tree of the forest, and this keeps positive definiteness (ibid. (V.A.9), Thm IV.5). In this form, for any constant KK, with an ultraviolet cutoff in place and the coupling gg taken small enough (depending on KK), ∑Y∋0∣A(Y)∣K∣Y∣≤1\sum_{Y\ni0}|A(Y)|K^{|Y|}\le1 (ibid. (V.A.10); ∣Y∣|Y| is the number of cubes in YY). It was Glimm–Jaffe–Spencer who brought this type of expansion into constructive field theory (ibid. §I), and the results are in 6-03 §05 and §08. Known

Example: the tool is Gaussian integration by parts (Gaussian distributions are in 1-08 §06). For a standard normal ϕ\phi, the derivative of the density e−ϕ2/2e^{-\phi^2/2} is −ϕ e−ϕ2/2-\phi\,e^{-\phi^2/2}, so integration by parts gives E[ϕF(ϕ)]=E[F′(ϕ)]\mathbb E[\phi F(\phi)]=\mathbb E[F'(\phi)]. Extending this to Gaussian variables with mean 0 and covariance matrix C(s)C(s) gives ddsEs[H]=12∑a,bdCabds Es[∂a∂bH]\frac{\mathrm d}{\mathrm ds}\mathbb E_s[H]=\frac12\sum_{a,b}\frac{\mathrm dC_{ab}}{\mathrm ds}\,\mathbb E_s[\partial_a\partial_bH] Known. For Gaussian variables (ϕ1,ϕ2)(\phi_1,\phi_2) with variance 1 and covariance scsc, dC12/ds=dC21/ds=c\mathrm dC_{12}/\mathrm ds=\mathrm dC_{21}/\mathrm ds=c, so ddsEs[F(ϕ1)G(ϕ2)]=c Es[F′(ϕ1)G′(ϕ2)]\frac{\mathrm d}{\mathrm ds}\mathbb E_s[F(\phi_1)G(\phi_2)]=c\,\mathbb E_s[F'(\phi_1)G'(\phi_2)]. At s=0s=0 the two are independent, so integrating in ss from 0 to 1 gives

Cov⁡(F(ϕ1),G(ϕ2))=c∫01Es[F′(ϕ1) G′(ϕ2)] ds,∣Cov⁡∣≤∣c∣ sup⁡∣F′∣ sup⁡∣G′∣(12)\operatorname{Cov}\big(F(\phi_1),G(\phi_2)\big)=c\int_0^1\mathbb E_s\big[F'(\phi_1)\,G'(\phi_2)\big]\,\mathrm ds,\qquad\big|\operatorname{Cov}\big|\le|c|\,\sup|F'|\,\sup|G'| \tag{12}

and the correlation of lumps is bounded by the covariance ∣c∣|c| that links them. For F=G=cos⁡F=G=\cos the value is e−1(cosh⁡c−1)e^{-1}(\cosh c-1) (0.159323580.15932358 at c=0.9c=0.9), and numerical integration of the left- and right-hand sides agreed to 8 digits. Computed

10

Uses and limits for gauge fields

Strong coupling on the lattice. For small β\beta the expansion in lumps of plaquettes works (5-02, 5-04), and the existence and analyticity of the infinite-volume limit and estimates of confinement have been shown (Osterwalder–Seiler 1978). But Chatterjee (2018) cautions that this area law holds for every group including U(1)U(1), and is not evidence of non-abelian confinement. Known

Phase-space expansion. When there is no small parameter at the unit scale, the field is split by scale, expanded in the "phase-space cells" of each scale, and the results piled up (Battle–Federbush 1982; the 'phase-space localization' of JW §6.1). In lattice gauge theory, Bałaban's series of papers is this (6-05). Known

The infrared limit. In four dimensions the coupling becomes strong at long distances. Magnen–Rivasseau–Sénéor 1993 §I writes 'there is no easy solvable model of these phenomenons around which to expand', and the problem statement also says that a gap uniform in the volume needs new ideas (JW §6.5). The small β\beta where the expansion converges is the shore opposite to the continuum limit β→∞\beta\to\infty. More precisely, the expansion converges on a finite interval on the side of small β\beta, and the continuum limit is taken at β→∞\beta\to\infty (5-09).

Seam The reach, and where we want to go

In §02 the singularity that stopped the expansion was on the side of negative activity. On the four-dimensional U(1)U(1) lattice there really is a phase at large β\beta in which the area law fails (Guth 1980; a fully rigorous proof and the massless phase are Fröhlich–Spencer 1982). For the non-abelian case (the Wilson action of SU(2)SU(2) and SU(3)SU(3)), it is believed that there is no phase transition that loses confinement Physics, but it is not a theorem. Where the convergence of the expansion stops says nothing about whether there is a phase transition beyond it. In the organisation of this book, what is missing is one step between the weak-coupling ultraviolet (6-05 to 6-07) and the strong-coupling expansion, where the coupling becomes O(1)O(1) (6-10).


What this chapter can say

Content
SaidThe formula of the expansion, Penrose's identity, the three convergence conditions and their consequences (analyticity, exponential decay) Known
SaidThe coefficients, radius 1/41/4, thresholds and decay rate of the one-dimensional hard-core lattice gas. Agreement of the alternating sum of KnK_n with the Penrose trees (n≤6n\le6). Formula (12) Computed
Not saidThe content of the convergence proofs for continuum fields and for strong coupling on the lattice (original papers not followed; 5-04). An expansion usable in the infrared in four dimensions (none is known)

Sources and reproduction

ItemKindSource / tools
Quotations from the problem statement (§5, §6.1, §6.5)Text checkedA. Jaffe, E. Witten, Quantum Yang–Mills Theory, Clay Mathematics Institute (2000)
Formulas (4)–(7), the conditions of Dobrushin and FP, the formulas of Table 3Text checkedR. Fernández, A. Procacci, CMP 274 (2007) 123–140, arXiv:math-ph/0605041
Formulas (10)(11), the forest formula / decay of correlationsText checkedA. Abdesselam, V. Rivasseau, arXiv:hep-th/9409094 (1994). D. Ueltschi, Moscow Math. J. 4 (2004) 511–522
The local lemma, the equivalence, the zeros of chains, λc≤1/4\lambda_c\le1/4, Shearer's valueAbstract, §1, §4.1, §5.2, §8.4 checkedA. D. Scott, A. D. Sokal, J. Stat. Phys. 118 (2005) 1151–1261, arXiv:cond-mat/0309352
Original sources, lineageBibliographic data onlyKotecký–Preiss, CMP 103 (1986) 491. Dobrushin, AMS Transl. (2) 177 (1996) 59. Gruber–Kunz, CMP 22 (1971) 133. Penrose, in Statistical Mechanics: Foundations and Applications (T. A. Bak ed.), Benjamin (1967) 101–109. Mayer, J. Chem. Phys. 5 (1937) 67. Brydges–Federbush, J. Math. Phys. 19 (1978) 2064. Brydges–Kennedy, J. Stat. Phys. 48 (1987) 19. Battle–Federbush, Ann. Phys. 142 (1982) 95. Glimm–Jaffe–Spencer, in Constructive Quantum Field Theory (G. Velo, A. Wightman eds.), Lecture Notes in Physics 25, Springer (1973) (Part II: The cluster expansion), and Ann. Math. 100 (1974) 585. Erdős–Lovász, in Infinite and Finite Sets II, Colloq. Math. Soc. J. Bolyai 10, North-Holland (1975) 609–627. Shearer, Combinatorica 5 (1985) 241
Strong coupling on the lattice, the phases of U(1)U(1), the quotation on the infraredFrom the abstracts and the checks of this book's materialsOsterwalder–Seiler, Ann. Phys. 110 (1978) 440 (text not obtained). Chatterjee, arXiv:1803.01950 §4. Guth, PRD 21 (1980) 2291 (bibliographic data from Chatterjee's reference list). Fröhlich–Spencer, CMP 83 (1982) 411. Magnen–Rivasseau–Sénéor, CMP 155 (1993) 325
The exponential formula, spectral measures, Gaussian integration by parts, radius of convergence and singularitiesKnownStandard facts (1-08, 1-10)
Tables, zeros, rings, formula (12), figuresComputedPython on this machine: hardcore1d.py, graphs.py, decouple.py. The figures are plain JavaScript

Next chapter to read: 6-05 The sequence of renormalisation group steps (piling up the expansion into a sequence of scales).

← 6-03 Constructing scalar fieldsContents6-05 The sequence of renormalisation group steps →

Revised 2026-10-01: first version.