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
- The map
- 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
- 9-06 The stages a proof must contain — the table of seven stages
- The first road — from the direction of time
- Part 10 The first road, first half — from the direction of time: the mass gap and the diffusive-relaxation-time assumption
- 10-00 Entrance — the staircase, and the random walk, the ruler and the clock
- 10-01 The line of construction and Assumption ξ²
- 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 The first road, second half — repairing the form of the assumption, making time continuous
- 11-00 Further considerations — entrance
- 11-01 One form that obstructs Assumption ξ² — 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 Assumption ξ² — the sector Assumption ξ² and the local Assumption ξ²
- 11-04 Which Assumption ξ² 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
- The second road — from the direction of space
- Part 12 The second road: from the direction of space — a small twisted T² and confinement
- 12-00 Entrance — space, not time
- 12-01 The twisted T² and 't Hooft flux
- 12-02 Vortices and fractional instantons
- 12-03 Containers — conditioning on the frame makes things independent
- 12-04 Slab confinement
- 12-05 Vortex-insertion identities
- 12-06 Driven insertion and the flow lemma
- 12-07 Why fixed maps fail
- 12-08 The measured record
- 12-09 Where this road stops — widening the T² is the band
- The crossover band — two roads reach the same wall
- Part 13 The crossover band — two roads reach the same wall
- 13-00 Entrance — confluence
- 13-01 The correct form of the band
- 13-02 Reduction to a single inequality
- 13-03 The only place where non-abelian enters
- 13-04 Structure alone cannot cross
- 13-05 The chessboard and simultaneous flips
- 13-06 Renormalisation comparison — a comparison that distinguishes groups
- 13-07 The band seen from the side of time
- 13-08 A map of the roads tried and stopped
- 13-09 The measured record
- 13-10 Candidate new viewpoints
- 13-11 Ultraviolet control — what it means to close at infinitely many steps
- Closing
- Part 14 Closing — conditional statements
- 14-00 Entrance — the promise of this part
- 14-01 The conditional statement — the mass gap and confinement, arrow by arrow
- 14-02 The ledger of conditions
- 14-03 The table of questions (a cross-index)
- 14-04 What is not claimed (a cross-index)
- The ultraviolet wall — the foundation beneath both roads
- Part 15 Ultraviolet control — what it means to close at infinitely many steps
- 15-00 Entrance — what ultraviolet control is
- 15-01 Why the ultraviolet is hard — dimensionless coupling, group-valued fields, gauge
- 15-02 A map of the sources — Bałaban's programme, the BBS chain, two rows absent from the sources
- 15-03 The decomposition statement — a class that closes with finitely many parameters, and three remainders
- 15-04 The one-link heat-kernel class and the hierarchical model
- 15-05 The flux-network theorem — the transverse contraction and the parameter flow in one projection
- 15-06 Counting the parameters — couplings by loop shape and the attracting class
- 15-07 Background-dependent fluctuations η — absorption step by step
- 15-08 The four rows that do not close, and proposals for them
- 15-09 What cannot be said, the index of questions, the dependency diagram
- 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
- A-07 Papers that came out of this book
The flux network theorem — transverse contraction and the flow of the parameter from one projection
What this chapter shows — If we fix the angle of the loop of the single coarse plaquette, restrict to commuting configurations and minimise the tree-level action , the minimiser is unique, , ( is a surface with boundary , and is the orthogonal projection onto the space of plaquette angles that come from links) (Theorem F). From this, the ratio of the coarse coupling , the factor by which the fine quartic term maps to the coarse quartic term, and the one-step factor of the deviation from the heat-kernel class (the transverse contraction) are all determined, and follows in one line. In a three-dimensional box with free boundary, is the effective resistance of a resistor network. We set out, with their conditions, the table of numbers for varying box size, boundary and size of the coarse plaquette; that when the coarse plaquette is enlarged the action is paid along the perimeter; that the genuine two steps and the iterated two steps do not agree; and that in the network with all coarse plaquettes fixed at once (Theorem G) the contraction becomes a matrix and exceeds in coarse directions.
Chapters assumed — 15-00 §01 (steps, the same form), 15-03 §02 (the statement of the decomposition), 15-03 §04 (the ledger of the transverse contraction), 15-04 §02 (one Migdal–Kadanoff step and ). We use linear algebra (orthogonal projections, Cauchy–Schwarz) and Kirchhoff's laws for electric circuits.
Said first — All numbers in this chapter are numbers for a step that looks at the marginal distribution of one coarse plaquette (not a genuine blocking step); only §07 is "a step with all coarse plaquettes fixed at once". Theorem F and Theorem G are statements at tree level restricted to commuting configurations (the main term as ); they do not include the minimum over non-commuting configurations, the one-loop correction (the source), large fields, or the re-fixing of the gauge. The numbers for the source are one-loop values, started from the heat kernel, with a single image, at . This chapter does not show ultraviolet control ①.
- Setting — commuting configurations, the projection , the unit flux
- Theorem F — the minimiser, , the map of the quartic term, (equations (2)–(6))
- The three-dimensional free boundary is a resistor network — solved by hand
- Inequalities — monotonicity under inclusion,
- The table of boxes (Table 1)
- Enlarging the coarse plaquette — the perimeter type; the genuine two steps and the iterated two steps (Tables 2 and 3)
- The network with all coarse plaquettes fixed — Theorem G (Tables 4 and 5)
- Implications for the decomposition, and questions (Table 6)
- What cannot be said
- The five grades table and the dependency graph (Table 7)
What this chapter shows
- At tree level restricted to commuting configurations, the minimal configuration with the angle of the single coarse plaquette fixed is determined by the projection and the unit flux alone, and , the map of the quartic term and the transverse contraction all follow from it (Theorem F, §02).
- At , in a box where the 4 plaquettes of the coarse plaquette carry symmetrically, . The Migdal–Kadanoff is the upper end of this (§04).
- The more the box is widened, made periodic or embedded in the lattice, the more rises and falls. For a 2×2 coarse plaquette embedded in the four-dimensional lattice, , and the source is (§05).
- With a 4×4 coarse plaquette, falls to 0.29–0.31, smaller than the iterated . The action is paid along the perimeter, and the source is diluted as (§06).
- If all coarse plaquettes are fixed at once, the coarse action does not stay a plaquette action, the map of the quartic term becomes a matrix, and in coarse directions it exceeds (Theorem G, §07).
Setting — commuting configurations, the projection, the unit flux
Lattice. Take the cubical complex of a -dimensional box (free boundary) or a -dimensional torus (periodic). Let be the space of real-valued functions on the -dimensional cells ( are links, plaquettes, cubes), with inner product the sum of the products of the values on each cell, and let be the map that makes plaquette angles from link angles (the coboundary).
Commuting configurations. Restrict all links of to rotations about one direction () and write them by link angles ; then the plaquette angles are . The action of a single image of the heat kernel is , and Wilson's action is (the same conventions as 15-04 §01).
The single coarse plaquette. Take a coarse loop (for example the 8 links of the outer boundary of a square) and a surface with boundary (the 4 plaquettes of that square, coefficients , support written ). The constraint that the angle of the holonomy of is is .
Allowed fields and the projection. Let be the space of plaquette angles that come from links, the orthogonal projection onto , and . Since a box with free boundary is contractible, coincides with the space in which "the oriented sum over each cube is 0"; in the periodic case the condition that the flux through each coordinate 2-torus is 0 is added Proved here.
and call the flux. , (the unit flux), .
The "one step" of this chapter means: given the angle of the single coarse plaquette, integrate out all the remaining degrees of freedom, and read the resulting distribution of (the marginal distribution) as the weight of a single plaquette at the next step. It is a step that looks at the marginal distribution of one coarse plaquette, not a genuine blocking step (the joint distribution of all plaquettes of the coarse lattice is treated only in part, in §07).
Theorem F — the minimiser and three ratios
Theorem F. In the setting above, under the conditions (a) restriction to commuting configurations, (b) the main term in (tree level; the one-loop correction and are not included), (c) free boundary or periodic, fixed, the following holds Proved here.
- (i) For each the minimiser of is exactly one, , and the minimum is .
- (ii) The coarse action of the action is with and the lower bound holds. The upper bound "" is not unconditional (at , if that plaquette is a face of a cube, ).
- (iii) Let the fine action be (; for Wilson ), and set the local coarse action . With and , if then that is, the coefficient of in the coarse action is exactly (excluding and higher).
- (iv) The normalised quartic deviation maps in one step to and
Proof. (i) If , then from and the self-adjointness of , . By Cauchy–Schwarz , hence . lies in , satisfies the constraint and gives equality. The constraint set is closed under midpoints, and on it is strictly convex by the parallelogram identity, so the minimiser is unique. If then .
(ii) (2) follows from the minimum and . The lower bound is Cauchy–Schwarz on . If , then itself is not closed (the sum over the boundary of a cube is not 0), so , , .
(iii) Every satisfying the constraint can be written uniquely as (). The upper bound is . Lower bound: from , . Expanding the quartic term, , , , and bounding with , we get, with and , .
(iv) The coarse action has the same form as , so . The inequality on the right is added up. The one on the left follows from the power mean (, Cauchy–Schwarz twice) and . ∎
The meaning of (iv). For two weights that arrived at the same ( started from Wilson and started from the heat kernel), the difference of the coefficients of , normalised by , is multiplied by in one step. This is the main term of the transverse contraction in the ledger of 15-03 §04. It agrees with the ratio of total-variation distances measured at finite (0.0443, 0.0451, 0.0463, 0.0469 for at ) approaching from below, but we have not shown that the ratio of total-variation distances converges to Reading.
The three-dimensional free boundary is a resistor network
In a box with free boundary the orthogonal complement of consists of 2-cycles, and since the box is contractible it coincides with sums of boundaries of cubes. Hence ( is a function on cubes; Dirichlet's principle) Proved here. In three dimensions, consider the dual resistor network whose nodes are the cubes, whose edges of resistance 1 are the interior faces, with the faces of as edges to a source S and the other outer faces as edges to a sink T; then says that the oriented sum at each cube is 0 (Kirchhoff's current law), the constraint says that the amount of current from S to T is , is the effective resistance between S and T, and is the unit current (Thomson's principle) Cited (a restatement of standard facts about electric circuits).
Example: the slab. Each cube receives the current from the bottom face and passes it to the 2 side faces on the outer rim (in parallel, resistance ) and to the top face (resistance 1). The resistance of a column is ; with four in parallel, Proved here. The flux is on the bottom faces, on the top faces and the outer side faces, and 0 on the inner walls. In four dimensions the network is a potential not on cubes but on 3-cells, and the picture is harder to draw, but the projection formula (1) can be used as it is, independently of dimension.
Inequalities — monotonicity under inclusion, and both sides of the contraction
(a) Monotonicity under inclusion. For complexes containing , Proved here. Proof: restricting a configuration on to does not change the holonomy of , and the action (a sum of non-negative terms) decreases, so the minimum is larger for the larger complex. ∎ In three dimensions this is the same content as Rayleigh's monotonicity (a box with free boundary is the result of shorting the surrounding cubes to the sink, and shorting lowers the effective resistance). So a small box with free boundary makes look small.
(b) Both sides of the contraction. When the 4 plaquettes of the coarse plaquette carry symmetrically (when the box is invariant under the 90° rotation about the coarse plaquette; this holds for all boxes in Table 1), . Moreover, the trial configuration " on each of the 8 links of , 0 elsewhere" gives to each plaquette of the coarse plaquette and to each of the other plaquettes containing a link of , so from Thomson's inequality (i), in any box (even in the infinite lattice) . Together, Proved here (the equality on the right, , holds when the largest flux is on the coarse plaquette; we have confirmed this in all boxes computed, but there is no general proof Reading). In four dimensions , in three . The equality holds when the flux sits only on the faces of , and the 16 plaquettes of Migdal–Kadanoff (15-04 §02) are exactly this. For a step of the type in which the coarse plaquette is made of 4 fine plaquettes, the Migdal–Kadanoff is the upper end of the transverse contraction, and the more parallel paths there are, the more thinly the flux is divided and the smaller becomes.
In the boxes computed, stays within 1.04–1.22 times , and the movement of is determined almost entirely by the reciprocal of the denominator (the slope of the invariant curve) Reading (an observation).
The table of boxes
Table 1 lists, box by box, the three numbers of one step for a 2×2 coarse plaquette. and are the main terms of the flux network (for the three-dimensional free boundary and the boxes free only on the outer rim they are rational, and the two formulations agree Proved here; in four dimensions and the periodic case they are floating-point, and the two formulations agree to about Reading), and the source is the numerical value of the coefficient of at one loop, started from the heat kernel, with a single image, at Reading. "Free only on the outer rim" means that only the outer faces on the rim of the slab are free boundary, with cubes left around the coarse plaquette; "interior" means the coarse plaquette is embedded in the interior of the box; "periodic" is a torus with only one coarse plaquette fixed and the other plaquettes free.
| System | Source | Checks and notes | ||
|---|---|---|---|---|
| Two-dimensional open strip (two plaquettes combined in series) | Proved here | Only series (convolution), so it closes in the heat-kernel class | ||
| Migdal–Kadanoff (, ) | The map on the hierarchical lattice. Flux on 16 plaquettes (15-04) | |||
| Three-dimensional , free boundary | For the source, the extrapolation of finite sums of characters and the one-loop value agree to 4 digits. Heat-bath Monte Carlo on all links and finite sums of characters give at – | |||
| Three-dimensional , free boundary | One loop in two implementations (finite differences and the analytic Hessian). Monte Carlo gives at | |||
| Three-dimensional , free boundary | One loop in one implementation | |||
| Three-dimensional | from the ladder formula Proved here. The source is an estimate from three points | |||
| Three-dimensional, the centre of , free only on the outer rim | The flux agrees across three implementations. At one loop the two implementations agree to relative | |||
| Three-dimensional slab of thickness 2, widened (, , …) | At within 1% (flux) and 5% (source) of the limit. The limit of the source is an estimate | |||
| Three-dimensional , interior of (coarse plaquette on a plane inside the box) | , | , | , | One loop in one implementation. The source is not monotone in the box size |
| Three-dimensional, periodic , , (only one plaquette fixed) | , , | , , | — | Flux in two formulations. for agrees to 15 digits |
| Four-dimensional , free boundary | One loop in two implementations | |||
| Four-dimensional , free boundary | One loop in one implementation | |||
| Four-dimensional , free boundary | At one loop the two implementations agree to relative | |||
| Four-dimensional, the centre of , free only on the outer rim | One loop in one implementation | |||
| Four-dimensional, interior of (open box) | One loop in two implementations, sparse and dense, agreeing in log det to . In the interior of , , (flux only) | |||
| Four-dimensional, periodic , , (only one plaquette fixed) | , , | , , | — | Flux in two formulations. agrees to 13 digits |
| Villain for (any box) | Same | — | Proved here | Closes at , and the deviation is only (Poisson summation) |
What to read from Table 1 Reading.
- Direction. The more lattice is added around the coarse plaquette (free boundary → free only on the outer rim → interior → periodic), the more rises (as in §04 (a)) and the more falls. In four dimensions goes from 0.44 () to 0.73 (the limit embedded in the lattice), and from 0.039 to 0.026. The free boundary created "a sink for the flux" and made look small and look large.
- The flow of the parameter. The main term of is , and the shift at one loop is a independent of (started from the heat kernel): for , for , at the centre of (all ). It is the same type as the Migdal–Kadanoff .
- The source. It is positive and converges to a value independent of : – in four-dimensional boxes (1.8–2.1 times Migdal–Kadanoff), and – in three-dimensional slabs. For the Villain action of it is 0: this reads as saying that the source needs both "parallel", where the weights of two discs are multiplied on a closed surface, and the Haar weight of a non-commutative group. An open two-dimensional region is series only, so it has no source.
Enlarging the coarse plaquette — the perimeter type, and the genuine two steps
We widen the coarse plaquette to (the outer boundary has links). is one step, and is the "genuine two steps" that take the factor 4 in the plane directions at once. The "iterated two steps" compared with it are the approximation of applying the one-step map once more to the coarse lattice (feeding the marginal distribution of one coarse plaquette back in as the action of the next step); we count , as and the source as .
(a) Upper bound. The trial configuration " on each of the links of , 0 elsewhere" gives to the 4 corner plaquettes of the coarse plaquette, to the edge plaquettes and 0 to the inner plaquettes (the sum over the coarse plaquette is 1, matching the holonomy of ), and the outer plaquettes containing each link of number at most . Hence , and in any box (even in the infinite lattice) Proved here (the right side from Stokes, i.e. the sum of over the plaquettes of the coarse plaquette is 1, and the power mean). In four dimensions is and (the same as §04), and is and .
(b) The genuine two steps lower much more than the iteration does. By monotonicity under inclusion, one step embedded in the four-dimensional lattice has (the value in the interior of ; the two formulations agree Reading), hence Proved here (the input 0.717961 is a computed number). The iteration falls only by about in , while the genuine is by (8), so the ratio tends to 0 with the number of steps. The of the marginal distribution of one coarse plaquette falls in four dimensions with the perimeter type (), and cannot be expressed by repeating the square of one step. In the two-dimensional plane alone the two agree (for a 4×4 coarse plaquette, , ).
(c) The perimeter type. In the four-dimensional boxes computed, 44–51% of sits on "the plaquettes in transverse directions touching " ( per link of ), and this proportion hardly changes when the coarse plaquette goes from 2×2 to 4×4 Reading. This reads as the action being paid not over the area of the coarse plaquette but along the perimeter of .
| Box | Quantity | One step (coarse plaquette 2×2) | Iterated two steps | Genuine two steps (coarse plaquette 4×4) | Genuine / iterated |
|---|---|---|---|---|---|
| (the 4×4 coarse plaquette reaches the edge of the box in the plane directions) | 0.7180 | 0.5155 | 0.2564 | 0.50 | |
| 3.7 | |||||
| Source | 0.073 | ||||
| (margin 1 in the plane directions) | 0.7218 | 0.5210 | 0.2895 | 0.56 | |
| 3.4 | |||||
| Source | 0.066 | ||||
| (flux only) | 0.7301 | 0.5330 | 0.3060 | 0.57 | |
| 3.7 |
| Upper bound (8) | Coefficient of at one loop | Source | Source | |||
|---|---|---|---|---|---|---|
| 1 (a single plaquette) | 1.989 | 2 (the trial of ) | 0.521 | 0.499 | ||
| 2 | 0.7180 | 7/8 | 0.0266 | 0.238 | ||
| 3 | 0.4190 | 5/9 | 0.00598 | 0.156 | ||
| 4 | 0.2895 | 13/32 | 0.00237 | 0.116 |
What to read from Tables 2 and 3 Reading (an observation of four points, transverse thickness 4, one implementation). The source is , and is –. If read as , is an operator of dimension 8, and the coefficient falling as fits the same counting as the Migdal–Kadanoff . So the source of a genuine blocking looks not like "a number reborn in a fixed band at each step" but like the type in which "the shift of born at the finest scale is diluted by about at each step", and the fixed point of the iterated ledger lies, in this way of measuring, on the side of an upper bound. For it is the other way round: the genuine two steps are 3.4–3.7 times the iterated , and the iteration makes the contraction look fast. But at – the denominator of the ledger stays almost 1.
The network with all coarse plaquettes fixed at once — Theorem G
The periodic rows of Table 1 were networks in which "only one coarse plaquette is fixed and the surrounding coarse plaquettes are free". The main term of a genuine blocking step is the network in which the lattice is divided into blocks and the angles of all plaquettes of the coarse lattice are fixed at once, and this is a different network. Conditions of this section: restriction to commuting configurations, tree level (the main term in ), a periodic lattice ( even), blocks, and the coarse angle is the linearisation of the angle around the 2×2 outer boundary spanning the coarse plaquette .
Notation. Let be the matrix with the in rows, the coboundary of the coarse lattice, and the map to coarse links ( is the sum of the angles of the 2 fine links that make up the coarse link ); then . Let , (), (the Moore–Penrose pseudoinverse), and the matrix with the as columns.
Theorem G. Under the conditions above Proved here:
- (i) The constraint () is non-empty if and only if (Bianchi sum 0 for each coarse cube, and coarse flux 0 through each coordinate 2-torus). In particular, that twists only one coarse plaquette and keeps the others at 0 is not allowed.
- (ii) For the minimiser is unique, , , and the minimum is . The coarse action is
- (iii) Written in the coarse link variables , , . The Lagrange multipliers are exactly the gradient of the coarse action (the divergence of current at each coarse link).
- (iv) Since are not independent coordinates, the off-diagonal entries of and the "diagonal / cross" components of the quartic form depend on the representation. Quantities that do not depend on the representation are: the spectrum of on , the ratio by direction , , (an oriented version of the of Theorem F).
- (v) For all , .
Proof. (i) . Conversely, putting on the first fine link of each coarse link and 0 elsewhere gives . (ii) The minimum-norm solution lies in , and with , . Since , a solution exists, and , , . Uniqueness is the same strict convexity as in Theorem F. (iii) The inner minimum is invariant under coarse gauge directions, so substitute and read off the KKT conditions. (v) The sets of 4 plaquettes of the coarse plaquettes do not overlap one another, so (Cauchy–Schwarz on each coarse plaquette). ∎
A smooth trial. For a configuration in which the fine field has the same value on the plaquettes of each coarse plaquette, the energy ratios are , (independent of ) Proved here (arithmetic). This configuration cannot be uniform on the torus, and has meaning only as a trial in the limit of long wavelength. In Migdal–Kadanoff (all coarse plaquettes independent, with taken as the identity) , .
| Box | Eigenvalues of (on ) | at the longest wavelength | Deviation from the plaquette action | of one coarse link | in the smooth direction | Sup found |
|---|---|---|---|---|---|---|
| Three-dimensional – | – | 0.4744 at | 15–17% | 0.066–0.068 | 0.055 at | 0.11–0.12 |
| Three-dimensional | 0.4968 at | 16% | 0.068 | 0.0615 at | (no optimisation) | |
| Four-dimensional – | – | 0.8108 at | 24–27% | 0.085–0.091 | 0.037–0.046 | 0.22–0.27 |
| Four-dimensional | 0.8786 at | 24% | 0.091 | 0.047 at | (no optimisation) |
| Network | (factor of ) | Label | |
|---|---|---|---|
| One plaquette in with free boundary | 0.442 | 0.0386 | Proved here (rational) |
| One plaquette in periodic (others free) | 0.731 | 0.0264 | Reading |
| All coarse plaquettes fixed, long wavelength | (0.879 at ) | in the smooth trial; 0.037–0.047 at the measured | Reading (the trial value is Proved here) |
| All coarse plaquettes fixed, one coarse link | 0.354 | 0.091 | Reading |
| All coarse plaquettes fixed, the coarsest direction | 0.25 (smallest eigenvalue) | Sup found | Proved here (), Reading (sup) |
| Migdal–Kadanoff | 1 | Proved here |
What to read from Tables 4 and 5 Reading. (1) The coarse action does not stay a plaquette action. In four dimensions the eigenvalues spread from up to nearly 1 at long wavelength, and already at quadratic order terms of loops of length 2 or more are born (this seems to correspond to the quadratic part of the classical fixed-point action, but we have not checked against the original sources). (2) The long-wavelength is larger than the 0.731 for one plaquette fixed, and moves towards the Migdal–Kadanoff side of 1. (3) The map of the quartic term is a matrix that mixes with neighbours, and in coarse directions it exceeds (0.091 for one coarse link, 0.27 for the sup found). In the smooth direction, in three dimensions it heads towards (0.0615 at ), while in four dimensions it is 0.047 up to and convergence is not yet visible. The Migdal–Kadanoff survives in a genuine step only as the value in the long-wavelength direction. (4) The values found are all below 0.3, but the pseudoinverse representative is non-local, and the Riesz–Thorin upper bound grows with the box (4.2 in four-dimensional ); we have not obtained an upper bound uniform in the volume. So we do not say "the transverse contraction is smaller than 1".
Candidate coordinates for writing it as a matrix. If the class of quartic deviations is taken to be "" (quartic forms bounded by ), the tree-level step preserves this class with Proved here (). The diagonal class of plaquettes (the Migdal–Kadanoff class) is not preserved, but the cone of is.
Implications for the decomposition, and questions
The ledger of 15-03 §04 said that if the one-step map contracts transversely around the class (, ), the deviation is bounded not by a sum but by the supremum Proved here (under the linear inequality with quadratic terms dropped). This chapter showed that this and the main term of the flow of the parameter can be counted beforehand on paper from the same projection for the marginal distribution of one coarse plaquette (Theorem F). The numbers to ask about for one four-dimensional step are two, "the size of the source" and ""; the former is a one-loop quantity and the latter a tree-level one. However, when all coarse plaquettes are fixed, becomes a matrix and exceeds in coarse directions (§07), so to show the of the ledger for a genuine step, an upper bound, uniform in the volume, on an operator norm that does not depend on the representation is needed Reading.
| Q. | Question | Size | What moves if settled | What does not move even if settled |
|---|---|---|---|---|
| F-UV6 | In the sequence in the side of the coarse plaquette, does the source (now – at – and transverse thickness 4) approach a constant when the transverse extent is widened? If so, the sum of the sources over steps is geometric and finite, and the ledger's assumption that "the source is in a fixed band at each step" can be strengthened | Small computation (the coefficient of at one loop by a perturbative formula) | The handling of the source in (Rem-shape) | Non-commuting configurations, large fields |
| F-UV7 | In the tree-level network with all coarse plaquettes fixed at once, construct a local representative that agrees with on , and see whether the operator norm of has an upper bound uniform in the volume. Also, whether the operator norm of in coarse directions (the sup found is 0.27 in four dimensions) goes below 1 | Paper and small computations | The main term of the transverse contraction of a genuine step | One loop, large fields, re-fixing of the gauge |
What cannot be said
(a) Theorem F and Theorem G are statements at tree level restricted to commuting configurations (the main term in ). They do not include that the global minimum, including non-commuting configurations, is commuting; the one-loop correction (the source, the shift of ); or large fields (outside ).
(b) The numbers in Tables 1–3 are numbers for a step that looks at the marginal distribution of one coarse plaquette, not for a genuine blocking step. The iterated two steps are the approximation of feeding back the marginal distribution of one plaquette.
(c) The source, and the ratios at finite are computer values, and the source is at one loop, started from the heat kernel, with a single image, at . The one-loop values for the 4×4 coarse plaquette and for large boxes are from one implementation. The source is an observation of four points; there is no limit or closed form.
(d) The equality on the right of (7), , and that the largest flux is on the coarse plaquette in the boxes computed, are box-by-box confirmations; there is no general proof.
(e) The numbers of Theorem G (Tables 4 and 5) are values under periodic boundary, blocks and linearisation of the coarse angle, and the sup is a lower bound from local optimisation. We have not obtained an upper bound uniform in the volume, and we say neither "the transverse contraction is smaller than 1" nor "at most 1/16". The four-dimensional long-wavelength is an estimate from the arithmetic of the smooth trial and the three-dimensional numbers.
(f) This chapter does not show ultraviolet control ①. It implies nothing about the renormalisation of the four-dimensional lattice or the mass gap.
The five grades table and the dependency graph
| Row | Statement (one line) | Grade | Basis | Scope |
|---|---|---|---|---|
| [01] | Theorem F (i)(ii): the minimiser , , . "" is not unconditional | Proved here | §02 | Restricted to commuting, tree level |
| [02] | Theorem F (iii)(iv): the coefficient of is exactly , , (5) | Proved here | §02 | Local minimum, |
| [03] | For the three-dimensional free boundary, is the effective resistance; at , and | Proved here | §03 | Three-dimensional, free boundary |
| [04] | Monotonicity under inclusion and | Proved here | §04 | The 4 plaquettes of the coarse plaquette symmetric, ; the position of the largest flux confirmed box by box |
| [05] | The rational numbers of Table 1 (three-dimensional free boundary and free only on the outer rim) | Proved here | §05 (two formulations) | Main term |
| [06] | The floating-point numbers and the source of Table 1; agreement with Monte Carlo | Reading | §05 | , started from the heat kernel, , one loop |
| [07] | (8): the upper bound on and the lower bound on ; genuine two steps iterated two steps | Proved here | §06 | , in any box (the comparison with the iteration takes the input 0.717961 as a computed number) |
| [08] | The perimeter type, Tables 2 and 3, the source | Reading | §06 | Four-dimensional, transverse thickness 4, one implementation, four points |
| [09] | Theorem G (i)–(v); preservation of the cone of | Proved here | §07 | Commuting, tree level, periodic, blocks, linearisation |
| [10] | Tables 4 and 5: at long wavelength, in coarse directions, no upper bound | Reading | §07 | The boxes measured; the sup is a lower bound |
| [11] | Questions F-UV6 and F-UV7 | Assumption | §08 | Question |
Dependency graph (the numbers of premises are smaller than the number of the conclusion):
[01] PRV F1 minimiser θf, β′/β = Σf² (commuting, tree level)
[02] PRV F2 θ⁴ exactly σΣf⁴, λ, (5) ⟸ [01] (local minimum)
[03] PRV NET three-dimensional resistor network, 1/3, 7/144 ⟸ [01] (free boundary)
[04] PRV BOUND monotonicity under inclusion, 1/(16d−8) ≤ λ ≤ 1/16 ⟸ [01][02] (coarse plaquette symmetric)
[05] PRV RAT the rational numbers of Table 1 ⟸ [01][03]
[06] RDG BOX the floating-point numbers and the source of Table 1 ⟸ [02][05] (one loop, β→∞)
[07] PRV LBOUND (8), genuine two steps < iteration ⟸ [04] (L ≥ 2)
[08] RDG PERIM perimeter type, source ≈ 8e−3/L⁴ ⟸ [06][07] (four points, one implementation)
[09] PRV G Theorem G ⟸ [01] (periodic, 2^d blocks)
[10] RDG GNUM long wavelength 2^{d−4}, coarse directions λ > 1/16 ⟸ [09]
[11] ASM Q F-UV6, F-UV7 ⟸ [08][10]
Every number to the right of "⟸" is smaller than the one on the left, and there are no cycles. The only assumption row is [11], and it is in the form of a question.
What this chapter can say
| Can say | Cannot say |
|---|---|
| Proved here At tree level restricted to commuting configurations: that , the map of the quartic term and are determined by the projection (Theorem F); ; if the coarse plaquette is symmetric; (8); Theorem G and | The minimum including non-commuting configurations, one loop, large fields. A general proof of the position of the largest flux |
| Reading The numbers box by box (Tables 1–5), the perimeter type, the source , and that with all coarse plaquettes fixed in coarse directions | and the source of a genuine blocking step. An upper bound on the operator norm uniform in the volume. A closed form for the source |
Sources and reproduction
| Item | Type | Source, tools |
|---|---|---|
| Thomson's principle, Kirchhoff's laws, Rayleigh's monotonicity, Dirichlet's principle | Cited | Standard facts about electric circuits and harmonic functions (of the kind in P. G. Doyle, J. L. Snell, Random Walks and Electric Networks, 1984) |
| Theorem F, Theorem G, (5)(7)(8), the hand computation of | Proved here | The proofs in the text of this chapter. The parts that are inequalities on finite sums have records of machine checking in this book's study, and the re-verification by the main session is also done (15-09 Table 3) |
| The numbers of Tables 1–5 | Reading (rational numbers: Proved here) | The numerical records of this book's study (two to three formulations of the flux network: Kirchhoff on the dual network, the normal equations in the tree gauge, the projection formula, the Hodge Laplacian of the Lagrange conditions. Two implementations of the one-loop Hessian: finite differences and analytic, and a sparse-matrix version. Finite sums of characters; heat-bath Monte Carlo on all links. For Theorem G, two implementations: projection and pseudoinverse, and KKT on coarse links) |
Terms used in this chapter — flux, the flux network, the projection , the unit flux, Theorem F, the transverse contraction , the source , monotonicity under inclusion, the perimeter type, the genuine two steps, the iterated two steps, Theorem G, quantities that do not depend on the representation. Their meanings are in A-02 Glossary.
Next chapter to read: 15-06 Counting the parameters — how many coordinates are needed at quadratic order, and where the one-step map draws in.
← 15-04 The one-link heat-kernel class and the hierarchical modelContents15-06 Counting the parameters — couplings by loop shape and the attracting class →
2026-10-15 (same day): reflected in the table of scope that the re-verification of the Lean records is done.