The whole book Contents and reading orders
- Part 0 Entrance — how to read this book
- 0-01 How to read this book
- 0-02 One picture
- 0-03 Reading the problem statement word by word
- 0-04 Four dimensions in mathematics and four dimensions in physics
- Part 1 Mathematical preparation
- 1-01 Vector spaces and linear maps
- 1-02 What a group is
- 1-03 Lie groups and Lie algebras
- 1-04 SU(2) and SU(3)
- 1-05 Manifolds and tangent spaces
- 1-06 Differential forms and the exterior derivative
- 1-07 Vector bundles and connections
- 1-08 Probability and measure
- 1-09 Probability in infinite dimensions
- 1-10 Hilbert spaces and self-adjoint operators
- 1-11 Fourier analysis and distributions
- 1-12 Detour: what happens only in four dimensions
- Part 2 Physical preparation
- 2-01 Lagrangians and the action
- 2-02 The idea of a field
- 2-03 Electromagnetism is a gauge theory
- 2-04 Special relativity and spacetime
- 2-05 The bones of quantum mechanics
- 2-06 The harmonic oscillator and creation and annihilation
- 2-07 The idea of the path integral
- 2-08 Statistical mechanics and phase transitions
- 2-09 Detour: the gap and the correlation length in the Ising model
- 2-10 The relaxation time and the dynamical exponent z
- Part 3 Yang–Mills theory (classical)
- 3-01 The gauge principle
- 3-02 Non-abelian gauge fields
- 3-03 The action and the equations
- 3-04 Gauge theory as geometry
- 3-05 Instantons and topology
- 3-06 Detour: Donaldson and exotic R⁴
- 3-07 Yang–Mills inside the Standard Model
- Part 4 Quantisation
- 4-01 Canonical quantisation and the Hamiltonian
- 4-02 The path integral and Euclideanisation
- 4-03 Perturbation theory and Feynman diagrams
- 4-04 Divergences and renormalisation
- 4-05 The algebra of divergences
- 4-06 Asymptotic freedom
- 4-07 Dimensional transmutation and Λ
- 4-08 Gauge fixing and Faddeev–Popov
- 4-09 The axioms of quantum field theory
- 4-10 The Osterwalder–Schrader axioms and reconstruction
- 4-11 The definition of the mass gap
- 4-12 Detour: the perturbation series diverges
- Part 5 Lattice gauge theory
- 5-01 Wilson's lattice
- 5-02 The strong-coupling expansion
- 5-03 Reflection positivity and the transfer matrix
- 5-04 The infinite-volume limit and the cluster expansion
- 5-05 Weak coupling and the continuum limit
- 5-06 How U(1) differs from the non-abelian case
- 5-07 The Monte Carlo method
- 5-08 Measuring glueballs and the string tension
- 5-09 What to hold fixed when taking the limit
- 5-10 Lattice gauge theory with finite groups
- 5-11 Detour: Bakry–Émery and one-link integration
- Part 6 Constructive field theory
- 6-01 What constructive field theory is
- 6-02 Solvability in two dimensions and the Yang–Mills measure
- 6-03 Constructing scalar fields
- 6-04 The cluster expansion
- 6-05 The sequence of renormalisation group steps
- 6-06 Ultraviolet stability of three-dimensional Yang–Mills
- 6-07 Four dimensions
- 6-08 Triviality of φ⁴ in four dimensions
- 6-09 Stochastic quantisation and regularity structures
- 6-10 Where four dimensions stops
- 6-11 Obstacles other than divergence
- 6-12 Detour: "if 1/0 is given a symbol"
- Part 7 From the side of physics
- 7-01 How physics sees it
- 7-02 Mechanisms of confinement
- 7-03 The string picture
- 7-04 Large N
- 7-05 String theory and extra dimensions
- 7-06 How extra dimensions become invisible
- 7-07 Where gauge fields come from
- 7-08 Holography
- 7-09 The mass gap becomes geometry
- 7-10 Back to four dimensions
- 7-11 Supersymmetry and Seiberg–Witten
- 7-12 The sentence that plays the role of an equivalence principle
- 7-13 Where the way physics digs parts from mathematics
- Part 8 A dictionary of two languages — the physical and the mathematical view
- 8-01 How to read the dictionary
- 8-02 Dictionary A
- 8-03 Dictionary B
- 8-04 Dictionary C
- 8-05 The physical counterparts of our assumptions
- Part 9 Where things stand, and open tasks
- 9-01 How far the world has come
- 9-02 Where the two ways of digging part
- 9-03 Candidates for new concepts
- 9-04 The list of open tasks
- 9-05 Common misconceptions
- Part 10 Towards a proof of the mass gap — building the first step of the staircase
- 10-00 Entrance — the staircase, and the random walk, the ruler and the clock
- 10-01 The line of construction and Assumption H
- 10-02 Roads tried on the four-dimensional lattice, and walls
- 10-03 The four steps of the staircase — why we start from 0+1 dimensions
- 10-04 The path measure of the double well, and kinks
- 10-05 The statement of the first step — four conditions and Proposition 4.5
- 10-06 (H1) Local Poincaré within a phase
- 10-07 The map of (H2) — seven routes and the seam of the ring
- 10-08 What computer-assisted means — the conditions on the chain inside the window
- 10-09 The sector framework and the three strands of route 5
- 10-10 The list of detour plans — types of breakage
- 10-11 (H3)(H4) and the constant of the core
- 10-12 The integrated table and the dependency graph
- 10-13 Lean statements and the limits of machine checking
- 10-14 Reconciliation — the numbers of the record and the known numbers
- 10-15 What remains and its cost — the distance to a theorem
- 10-16 What is not claimed
- 10-17 Insights and small questions
- Part 11 Further considerations — beyond Assumption H, and other views
- 11-00 Further considerations — entrance
- 11-01 One form that obstructs H — a nearly conserved global quantity
- 11-02 Choosing the ruler and the coordinates again — the length at which conservation breaks
- 11-03 Two ways to repair H — the sector H and the local H
- 11-04 Which H the one-sided bridge needs
- 11-05 Making time continuous — the Hamiltonian lattice and the vacuum measure
- 11-06 Paying with rarity instead of convexity — renormalisation on groups and log-Sobolev
- 11-07 Because it is four dimensions — the dimensionless coupling and topology
- 11-08 Questions, and what is not claimed
- 11-A1 Table of notation for Part 11
- Appendices
- A-01 Table of notation
- A-02 Glossary
- A-03 Guide to the literature
- A-04 Lean and machine checking
- A-05 How this book was made
- A-06 Index of assumptions
The Monte Carlo method — make configurations that follow the weight, count the correlations, and give the error
What this chapter shows
- How the integral for a lattice expectation value (tens of thousands of dimensions) is estimated by a sample mean over a Markov chain that follows the weight.
- How to count the extra error caused by correlation between samples (the autocorrelation time, binning, the Γ method).
- Critical slowing down: as the continuum limit is approached, the correlation time grows as (for a free field, by a formula).
Prerequisite chapters — 5-01 Wilson's lattice, 1-08 Probability and measure. For the mathematical side, see 8-03 §06–§08.
Said first — The Monte Carlo method estimates expectation values on a finite lattice with error bars; it does not prove the mass gap or the continuum limit. The calculations in this chapter are small examples: one point of on , and a two-dimensional free field.
- Why integrate with random numbers
- Markov chains and detailed balance
- Moving one link at a time — the step size (Figure 1, Table 1)
- Heat bath and overrelaxation
- Thermalisation and autocorrelation — three update methods (Table 2)
- Estimating the error — bins, the jackknife, the Γ method
- Critical slowing down — for a free field (Figure 2, Table 3)
- HMC and topological freezing
- Monte Carlo seen from mathematics — the line between theorems and observations
The of this chapter is the coupling of the Wilson action (5-01), not an inverse temperature.
Why integrate with random numbers — an integral in fifteen thousand dimensions
A lattice expectation value is an integral over all links (5-01 §06; is the Haar measure).
A four-dimensional lattice of side 6 has 5,184 links, and is 3-dimensional per link, so it is an integral in 15,552 dimensions Computed. So we make configurations that follow the weight and take the sample mean.
The error decreases as whatever the dimension (1-08) Known. Drawing uniformly does not work. At on , the mean of the 7,776 plaquettes is 0.6026 in equilibrium, while uniform configurations scatter around 0 with standard deviation 0.00567, so the equilibrium value is 106 standard deviations away Computed.
Markov chains and detailed balance — making a distribution that stands still
We make a random rule that changes the configuration one step at a time (a Markov chain, with transition probability ), so that after a long time it follows the weight . A sufficient condition for the distribution not to change in one step (stationarity) is detailed balance.
Summing the right-hand side over gives the left. A chain satisfying the right-hand side is called reversible. If moreover one can get from anywhere to anywhere (irreducible), the time average of a finite-state chain converges to the expectation value (the ergodic theorem). If it is also free of periodicity (aperiodic), the distribution itself approaches (the convergence theorem) Known. For continuous state spaces too, under conditions such as the transitions having a positive density, there are a law of large numbers and a central limit theorem of the same form (Tierney 1994) Known.
The Metropolis method (Metropolis et al. 1953; the first application was the equation of state of two-dimensional hard spheres) proposes a candidate with a symmetric proposal , accepts it with the following probability, and stays put if it is rejected.
If , then , so (3) holds, and is not needed. Example: two states, , with the proposal "go to the other one", gives with eigenvalues , and the distribution from state 0 is after 5 steps Computed. The deviation decreases as powers of the eigenvalue of largest absolute value other than 1 (here ), and this is the source of the autocorrelation time of §05.
Moving one link at a time — Metropolis and the step size
In four dimensions 6 plaquettes contain the link , and the part of the action that depends on has the following form.
A staple is the product of the three edges of a plaquette other than (5-01 §03). A unit that goes once through all links is called a sweep.
The Metropolis proposal is near the current value. If the step size is large, rejections increase; if it is small, the chain moves only a little. We look at a single link (weight ).
ComputedThe numbers in this figure were computed on this machine (the readings are from Table 1; the chain in the figure is an example run on the spot).
| Acceptance rate | |||
|---|---|---|---|
| 0.1 | 0.975 | 242(37) | 0.747(17) |
| 0.25 | 0.937 | 63.9(5.5) | 0.695(10) |
| 1 | 0.757 | 5.90(18) | 0.6972(31) |
| 2.5 | 0.494 | 1.94(4) | 0.6990(18) |
| 0.426 | 2.00(4) | 0.6990(18) |
Widening from 0.1 to 2.5 halves the acceptance rate and makes (§05) about 120 times smaller. A high acceptance rate does not indicate efficiency. At the mean is off from the exact value by 2.9 standard deviations; for a slow chain, the error estimate is itself uncertain.
Heat bath and overrelaxation — redrawing from the conditional distribution
The heat-bath method redraws a single link directly from the conditional distribution with the rest held fixed. A sum of matrices is a real multiple of an matrix (the quaternions of 1-04), so we can write (); also moves with the Haar measure, and the weight is (). is the three-sphere , and the Haar measure is the uniform measure on it. The slice at fixed is a two-sphere of radius , with area proportional to . When moves by , the width (arc length) on the three-sphere is . The product is , so
we draw from this, choose the remaining direction uniformly, and set Known. This is the method said to have been used in the calculation of Creutz (1980). Kennedy–Pendleton (1985) is an improvement that draws (6) quickly, and Cabibbo–Marinari (1982) is a method that updates one subgroup at a time.
Overrelaxation is a move that goes far without changing the action; for it is . With the action does not change, two applications return to the start, and it preserves the Haar measure, so it satisfies detailed balance. On its own it is not ergodic, so it is mixed with the heat bath (Adler 1981, Creutz 1987, Brown–Woch 1987). Note that a sweep in a fixed order is in general not reversible (the chain seen backwards in time is the one updated in reverse order), and only stationarity remains Known.
Thermalisation and autocorrelation — forgetting the starting point and counting the correlations
A chain starts either from a cold start, with all links set to the identity matrix, or from a hot start drawn uniformly, and the first stretch is discarded (thermalisation). For the plaquette at , (equilibrium 0.6026, the heat bath of Table 2), the heat bath enters the equilibrium band from both sides in 20 sweeps, while the hot side of Metropolis lags, at 0.482 after 20 sweeps and 0.593 after 150 Computed. Agreement of the two starting points is only a necessary condition (5-06 §04; the mathematical counterpart is the mixing time of 8-03 §06).
Even in equilibrium the configurations are not independent. We define the autocorrelation function, the correlation of the time series at a separation of steps divided by the variance, and the integrated autocorrelation time
(, ). The effectively independent samples number (formulas (23) and (25) of Wolff 2004) Known. For the heat bath of Table 2 that is . The time of the slowest decay is set by , the eigenvalue of the transition of largest absolute value other than 1, as (in the example of §02, ).
On the mathematical side, slowness is measured by the Poincaré constant . is the smallest constant such that for every function (1-10 §07; for a discrete chain the right-hand side is replaced by half the mean square change in one step, ). Langevin dynamics is a continuous-time dynamics that adds noise to motion down the gradient of the action, and there holds with equality. For a discrete-time chain, the following three are different quantities Known (Levin–Peres–Wilmer §12.2, 8-03 §06).
- : is the gap between 1 and the second largest eigenvalue .
- The relaxation time : is the absolute gap.
- .
When is small, the ratio of the last two is . The Polyakov loop in the last column of Table 2 is the quantity obtained by taking, at each spatial point, the trace of the product of links once around the time direction, and averaging over space (here we look at its absolute value). It is an example of a slowly moving quantity spread over the whole lattice.
| Method | Cost | Plaquette | : plaquette | : |Polyakov| |
|---|---|---|---|---|
| Metropolis | 1 | 0.60291(57) | 42(10) | 79(24) |
| Heat bath | 1 | 0.60261(21) | 5.1(6) | 6.0(7) |
| Heat bath + overrelaxation 3 | 4 | 0.60297(19) | 2.1(2) | 0.87(6) |
The sample sizes are 9,500, 9,500 and 4,500. At the same sample size the error of Metropolis is 2.7 times that of the heat bath, consistent with . Comparing multiplied by the cost, overrelaxation loses for the plaquette, 8.3 against 5.1, and gains for the Polyakov loop, 3.5 against 6.0. What gains are slow global quantities Computed. For too, overrelaxation is reported to have shrunk the of the magnitude of the Polyakov loop from 28 sweeps to 9 (Brown–Woch 1987), and the tendency agrees Physics.
Estimating the error — bins, the jackknife, the Γ method
is estimated from the data. Binning cuts the time series into blocks of length and treats the block means as independent. One reads off where the error levels off for (Flyvbjerg–Petersen 1989). The jackknife gives the error of a non-linear quantity from the means with one block left out at a time.
It is used for Creutz ratios and masses (5-02 §06, 5-08). For the heat-bath plaquette of Table 2, (bin error / naive error)² grows as 1.00, 2.85, 6.23, 10.19 for , reaching the Γ-method . For – (47 to 9 blocks) it fluctuates downwards, 7.4 to 7.7. With few blocks the error of the error matters (for the square of the ratio the relative error is about ) Computed.
The Γ method estimates the sum (7) directly, cut off at a window .
The right-hand side is formula (42) of Wolff (2004). It is derived by error propagation from the approximate formula for the error of the windowed sum given by Madras–Sokal (1988) (Wolff's formula (40)) Known. If is short there is bias; if long, noise matters. The of this chapter use Wolff's (2004) automatic window (). Wolff asks one to “verify by eye” that is flat. In the lower panel of Figure 2 (§07) one can check by eye that it is flat around the window of the vertical line.
Critical slowing down — seeing by a formula for a free field
As the continuum limit is approached the correlation length (in lattice units) grows (5-05 §01), and the of local updates grows too. Physics writes and calls the dynamical exponent (the review of Hohenberg–Halperin 1977, 8-03 §07) Physics. The lattice free field (1-08 §07) is where this can be checked by a formula.
In a checkerboard heat bath, let be the sum over even points and over odd. An odd point neighbours even points, so (noise), with . For the zero momentum
From , , so , and for this dynamics Computed. The intuition is a random walk: a local update takes steps to carry information a distance . Precisely, the of (11) approaches 1 as , so the fraction that shrinks in one sweep becomes .
ComputedThe numbers in this figure were computed on this machine (the curves compute (11) on the spot. If JavaScript is disabled, Table 3).
| measured | (11) | (11) | ||
|---|---|---|---|---|
| 1 | 1.039 | 2.57(10) | 2.5 | 2.316 |
| 0.5 | 2.020 | 8.17(53) | 8.5 | 2.082 |
| 0.25 | 4.010 | 33.1(3.9) | 32.5 | 2.021 |
| 0.125 | 8.005 | 125(23) | 128.5 | 2.005 |
Each doubling of multiplies by about 4. The cost of a calculation of the same precision is estimated to grow roughly as (5-05) Physics. For Langevin dynamics (§05) the relaxation time is (8-03; in the free-field normalisation where the field values themselves are the coordinates in which gradients are measured; changing the choice of coordinates changes only by a constant factor). Both are proportional to (). The of the heat bath is measured in sweeps and the of Langevin in Langevin time, so we do not compare the coefficients.
HMC and topological freezing — a global step, and a wall hard to cross
HMC (hybrid Monte Carlo, Duane et al. 1987) moves all links at once. Momenta (traceless Hermitian matrices; real linear combinations of the of 1-03) are given normal distributions, and
the classical mechanics is run with the leapfrog method and accepted with probability . The leapfrog method can be run backwards in time and preserves phase-space volume, so even with step errors is exactly the stationary distribution Known. Estimating the autocorrelation time of HMC by the Langevin is an assumption (the generators are different).
As the continuum limit is approached, the field splits into sectors of topological charge (the number counting how the field is twisted, integer-valued for continuum fields; for its definition on the lattice see 3-05 §08), and small steps find it hard to move between them. Schaefer–Sommer–Virotta (2011) reported, for HMC in pure gauge theory, an “effective dynamical critical exponent of about 5” for , and held that Wilson loops can be decoupled from this slow mode Physics. Lüscher–Schaefer (2011) showed a method that lets topological charge flow in and out through open boundary conditions in the time direction Physics. As a metaphor it is crossing passes in a landscape with many valleys. Precisely, if the measure near the boundaries of sectors is small the Poincaré constant becomes large (8-03 §08) Known, but whether that is the cause of freezing has not been established.
Monte Carlo seen from mathematics — the line between theorems and observations
On a finite lattice (1) is a probability measure on a compact space (5-01 §06). What can be said as theorems is the convergence of time averages by the ergodic theorem (for continuous state spaces, under the conditions of §02) and the central limit theorem. For a reversible chain, if the asymptotic variance is finite, a central limit theorem of the form (7) holds (Kipnis–Varadhan 1986) Known. What remains observation is the error bar. If there is a slow mode invisible at finite , the error bar comes out too small ( in Table 1, §08). Extrapolation from finite volume and finite (5-05 §07, 5-09) needs further assumptions.
The glueball masses and string tension of 5-08 are physical results that rely on that extrapolation Physics, not a proof of the existence and the gap of the problem statement (4-11). On the other hand is a mathematical object, and at strong coupling a Poincaré inequality for lattice Yang–Mills has been shown (Shen–Zhu–Zhu 2023, 5-04) Known. For four-dimensional Yang–Mills there is no theorem fixing the -dependence of on the side .
What this chapter can say
| Matter | Said | Not said |
|---|---|---|
| Update methods | That Metropolis, heat bath, overrelaxation and HMC preserve the stationary distribution; (6) Known | The speed of mixing on a four-dimensional lattice |
| Tables 1 and 2 | and errors in small examples Computed | Generalisation to large lattices. That the error bars are upper bounds |
| Critical slowing down | (11) and for the free field with a checkerboard heat bath Computed. The general is a hypothesis Physics | The of four-dimensional Yang–Mills |
| Topological freezing | The number in the abstract (effective exponent about 5) Physics | A mathematical explanation of freezing |
| The mass gap | — | This chapter shows nothing about the mass gap or the continuum limit |
Sources and reproduction
| Item | Kind | Source / tools |
|---|---|---|
| §02 | Abstract | N. Metropolis et al., J. Chem. Phys. 21 (1953) 1087 |
| The ergodic theorem and convergence theorem in §02, the relaxation time in §05 | Text | D. A. Levin, Y. Peres, E. L. Wilmer, Markov Chains and Mixing Times, 2nd ed.: Theorem C.1 (ergodic theorem, Appendix C.1), Theorem 4.9 (convergence theorem, §4.3), §12.2, Theorems 12.4–12.5 (relaxation time and mixing time) |
| Continuous state spaces in §02 and §09 | Abstract | L. Tierney, Ann. Statist. 22 (1994) 1701 |
| §04, §05 (Brown–Woch's 28→9 sweeps) | Abstract (the attribution of the heat bath to Creutz not checked) | M. Creutz, PRD 21 (1980) 2308 / N. Cabibbo, E. Marinari, PLB 119 (1982) 387 / A. D. Kennedy, B. J. Pendleton, PLB 156 (1985) 393 / S. L. Adler, PRD 23 (1981) 2901 / M. Creutz, PRD 36 (1987) 515 / F. R. Brown, T. J. Woch, PRL 58 (1987) 2394 |
| (7)(9) and the automatic window in §05 and §06 | Text (formulas (23), (25), (40), (42), (50)–(52); (42) is error propagation from (40)) | U. Wolff, CPC 156 (2004) 143 (erratum: CPC 176 (2007) 383), arXiv:hep-lat/0306017 |
| §06 (the origin of formula (40) for the error of the windowed sum, binning) | Abstract | N. Madras, A. D. Sokal, J. Stat. Phys. 50 (1988) 109 / H. Flyvbjerg, H. G. Petersen, J. Chem. Phys. 91 (1989) 461 |
| The dynamical exponent in §07 | Abstract | P. C. Hohenberg, B. I. Halperin, Rev. Mod. Phys. 49 (1977) 435 |
| §08 | Abstract | S. Duane, A. D. Kennedy, B. J. Pendleton, D. Roweth, PLB 195 (1987) 216 / S. Schaefer, R. Sommer, F. Virotta, NPB 845 (2011) 93, arXiv:1009.5228 / M. Lüscher, S. Schaefer, JHEP 07 (2011) 036, arXiv:1105.4749 |
| §09 | Bibliographic data only / abstract | C. Kipnis, S. R. S. Varadhan, CMP 104 (1986) 1 / H. Shen, R. Zhu, X. Zhu, CMP 400 (2023) 805, arXiv:2204.12737 |
| Tables 1–3, Figures 1 and 2, the numbers in §01, §02 and §05–§07 | Computed on this machine | Python 3, NumPy, SciPy. one_link_metropolis.py, su2_algos.py, analyze_su2.py, free_field.py, exact_tint.py, free_field_ext.py (extension for Figure 2), gamma_method.py (checked with AR(1)), small_numbers.py |
Next chapter to read: 5-08 Measuring glueballs and the string tension (reading masses and the string tension from configurations made by the methods of this chapter).
← 5-06 How U(1) differs from the non-abelian caseContents5-08 Measuring glueballs and the string tension →