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)
- 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
Vortex-insertion identities
What this chapter shows — In 12-04 we obtained slab confinement by averaging over maps that flip thin vortex sheets. In this chapter we list what can be said unconditionally when that map is replaced by a general "bijection that flips the sector" (a map that inserts one vortex). We use only three things: a finite configuration space, positive weights, and a bijection that flips the sign of the sector. From these follow (1) the mean of the insertion ratio is 1, and ; (2) the bias of the sector is bounded by the fluctuation of the insertion ratio: ; (3) passing to an involution, a bounded form and a form averaged over positions; (4) the second-moment form and the Paley–Zygmund form that follow from . All are elementary identities and Cauchy–Schwarz, and their finite-sum versions are checked in Lean.
Prerequisite chapters — 12-03 (the sector-summed ensemble, the sign of the sector, the bias), 12-04 (slab confinement). From Part 1, 1-08 (probability and measure, Cauchy–Schwarz).
Said first — Every theorem of this chapter is a statement under three conditions — a finite configuration space, positive weights, and a bijection that flips the sector (a finite version of a Haar-preserving map) — and the row of each theorem states those conditions. To pass to the continuous configuration space of one must replace the sums by Haar integrals and have the map preserve the measure (or put the Jacobian into the weight), and that part is outside Lean. The results are elementary, and comparison with earlier literature is not done. Nothing about confinement follows from these identities alone. What is missing is written in §07 and §08.
- Summary [Y3] — the balance of a map that inserts one vortex
- The setting — three conditions
- The insertion-ratio identity and the bound on the bias — Identity 1, Theorem 2
- Bounded forms — tanh and the average over positions — Identity 3, Lemma 4, Theorem 5
- Second-moment forms — Identity 6, Theorem 7, Theorem 8
- Rederiving slab confinement
- What it means, and what is missing — Table 1
- What cannot be said
- The table of five grades and the dependency graph — Table 2
Summary [Y3] — the balance of a map that inserts one vortex
- In the sector-summed ensemble (12-03), whether a vortex passes through a region is expressed by a sign . A map that inserts (or removes) one vortex flips .
- We call the ratio of weights when a vortex is inserted in a configuration the insertion ratio . The smaller is than 1, the more expensive it is to insert a vortex.
- The mean of the insertion ratio is always exactly 1 (Identity 1). This is nothing but a balance equation: "relabelling configurations by a map does not change the total sum of weights". From the same balance also follows Proved here.
- Combining the two, the bias of the sector is at most half the square root of the fluctuation (variance) of the insertion ratio (Theorem 2). If one inserts at many positions and averages the insertion ratio, the fluctuation can become small. Averaging over positions plays the role of entropy Proved here.
- The insertion ratio can take large values (heavy tails), so we also prepare a bounded form that is easy to handle. always lies in , and holds (Identity 3). is twice the mean acceptance rate of a Monte Carlo move that inserts a vortex (Lemma 4) Proved here.
- The form using has a second moment that is always at most 1, so there is no worry about tails (Identity 6, Theorem 7) Proved here.
- Taking the flip of a thin vortex sheet (12-04) as the insertion, the slab-confinement theorem comes out as a special case of this chapter (§06).
- These are not a proof of confinement. An area law needs the bias to be small in many regions at once (large deviations) and a bound on the cost of insertion uniform in the lattice spacing (the ultraviolet), and both are outside this chapter.
The setting — three conditions
Throughout this chapter we place the following three.
- (F) A finite configuration space (a finite set).
- (W) Positive weights . The expectation is .
- (T) A bijection that flips the sector: a sign of the sector and a bijection with .
(T) is a finite version of "a map that preserves the Haar measure and flips the sign of the sector of some region" in the sector-summed ensemble (for example, the composite of flipping the of a vortex sheet with a smooth left multiplication supported inside the region). Being an involution, commuting with one another, and worst-case bounds are not used in §03. To pass from (F) to the continuous configuration space ( and coclosed ), one must replace the sums by Haar and counting integrals, and must preserve the measure (if not, the Jacobian must be put into the weight). The proofs go through with the same relabelling of variables, but that version is outside Lean.
We set the insertion ratio to be
The orientation is chosen so that a vortex is inserted by into configurations with , and configurations with are taken back by . In terms of the action , .
The insertion-ratio identity and the bound on the bias
Under (F)(W)(T),
Proved here Proof. Set . maps to and to , and since it is a bijection, and . Hence
Adding gives , and multiplying by and adding gives . ∎
Lean InsertionIdentity (Insertion.mean_one, Insertion.mean_rho_sigma) (hypotheses: is finite, , is a bijection of , , . Conclusion: , ). No involution, commutativity or measure structure is used.
Under (F)(W), take a sign of the sector and a non-empty finite family of bijections that flip it (each satisfying (T)), and let be the mean insertion ratio. Then
Proved here Proof. Applying Identity 1 to each and averaging gives , . Hence . From Cauchy–Schwarz and , . ∎
Lean InsertionIdentity (Insertion.sector_bias_le) (hypotheses: is finite, the index set of the family is finite and non-empty, , each is a bijection with , . Conclusion: ).
To apply it to containers (12-03), use Theorem 2 on the conditional measure with the frame fixed. A bijection that moves only the inside of a container does not change the frame, so Proved here. The reading is that the factor of Lemma 5 is bounded from above by the fluctuation of the mean insertion ratio of insertions at many positions inside the container.
Bounded forms — tanh and the average over positions
The insertion ratio can take large values, so can be large. We therefore switch to a bounded factor. From the of (T) we build the map oriented by the sector
and is an involution () (if , then , so ; the converse is the same) Proved here. We set , , and
Under (F)(W), if is an involution of and is a function odd under (), then .
Proved here Proof. Since , is proportional to with . ( is odd and the rest is symmetric under ), so relabelling the sum by gives , hence 0. ∎
Lean BoundedInsertion (Bounded.single) (hypotheses: is finite, is a bijection with , , . Conclusion: ).
In the setting of Identity 3, for every real , . In particular , and
Proved here Proof. Relabelling gives for any . Since , taking gives , and on the set we have , which gives the first formula. Pairing with gives , so . Finally . ∎ This lemma has no Lean check.
How to read (6). A Barker-type move is a Monte Carlo move that "accepts the configuration with a vortex inserted with probability ". If insertions are almost always refused (the cost is high), ; if they pass often, moves away from 1. The first formula has the same form as what non-equilibrium statistical mechanics calls Crooks' fluctuation relation (comparison with the original source, and the version driven by dynamics, are in 12-06).
Many cells and the average over positions. For each of mutually separated cells , take insertion involutions at positions in the cell ( a non-empty finite set), build by (5), and set .
Under (F)(W), assume that each is an involution, is odd under every , and the factors of other cells do not move ( if ). Then
Proved here Proof. First, for with one position chosen from each cell, an induction adding cells one at a time gives : at the step adding cell , the product so far does not move under , so is odd and Identity 3 applies. Expanding gives the average over the choices, hence the first formula. Taking absolute values with gives the second. ∎ Each factor lies in , and no moment assumptions are needed.
Lean BoundedInsertion (Bounded.averaged, Bounded.averaged_bound) (hypotheses: , the set of cells and the set of positions are finite, is non-empty, every is an involution, , is odd under every , if , and for the latter also . Conclusion: (7)). One step of the induction is BoundedInsertion (Bounded.multi).
Second-moment forms
The tanh form is bounded, but it does not capture the exponential average (the free energy) as it is. Another bounded form is .
Under (F)(W), if is an involution, and , then .
Proved here Proof. is symmetric under and is antisymmetric, so changes sign when relabelled by , and is 0. ∎
Lean SecondMoment (SecondMoment.sqrt_identity) (hypotheses: is finite, is a bijection with , , . Conclusion: ).
Under (F)(W), take an involution for each of a non-empty finite set , and let be odd under every with . Setting (a weighted count of insertions that flip the sector),
Proved here Proof. Averaging Identity 6 gives . Setting , gives . From Cauchy–Schwarz and , . Dividing by () gives the first formula. The last inequality follows from (Cauchy–Schwarz) and, for involutions, . ∎
Lean SecondMoment (SecondMoment.pz_bound) (hypotheses: and are finite, is non-empty, every is an involution, , is odd under every , . Conclusion: , which normalised is the first formula of (8)). has no Lean check.
(8) says that the more concentrated is in the sense of second moments (the closer is to ), the smaller the bias. The second moment is always at most 1, so there is no worry about heavy tails as in the variance form of .
Many cells. We also place a form that handles products of insertion ratios over cells.
Under (F)(W), with , take a function (an averaged insertion ratio) for each of a finite set of cells , and assume oddness under insertion — for every , . Then
Proved here Proof. Expand ; using the assumption each term becomes , and there are terms. Cauchy–Schwarz and give the second formula. ∎
Lean MultiCell (MultiCell.bound) (hypotheses: and are finite, , , the equalities of "oddness under insertion" above for every . Conclusion: the second formula of (9)) and MultiCell (MultiCell.expand_identity) (the first formula). Within Lean, "oddness under insertion" is an equality placed as a hypothesis. For a single bijection it follows from the pushforward equality (MultiCell (MultiCell.pushforward), hypotheses: finite, ), but that the equality holds when insertions in separate cells are composed depends on the commutativity of the maps and the invariance of the ratios, and is outside Lean.
Rederiving slab confinement
Take the thin insertion of 12-04. Let the cells be the plaquettes of the plane inside the loop, with one position (), and let be the flip of on the vortex sheet . is itself an involution, and since it does not change the links it preserves the Haar × counting measure. is odd under each , and is determined only by the values on , so it does not move under for . From Theorem 5,
( is the one-sheet inequality of 12-04) Proved here. This is exactly (4) of step 4 of 12-04, and the projection to a fixed sector is the same as step 5 of 12-04. The slab-confinement theorem is the special case "thin insertion, one position" of Theorem 5. (10) on the continuous configuration space is the same argument with sums replaced by integrals, and is outside Lean.
What it means, and what is missing
The average over positions is entropy. The of Theorem 2 is expected to be of order , where is the number of positions, among the , within reach of each other's correlations and is the variance of one insertion ratio Reading (physics). Increasing the number of positions plays the role of entropy, and the decay of correlations between positions (the mass gap) plays the role of keeping small. For insertions of the smooth fractional-instanton type, is expected, the area of the region needed is proportional to , and the string tension is of order , the same form as the formula for a dilute vortex gas Reading (physics, a semiclassical estimate; not a proof).
| Form | Factor | Strengths | Weaknesses |
|---|---|---|---|
| Variance of the insertion ratio (Theorem 2) | Captures the free energy (the exponential average) as it is | Heavy tails. The second moment can be large | |
| tanh (Theorem 5) | Bounded. Meaning as an acceptance rate (Lemma 4) | Not an exponential average, so it captures the entropy of vortex shapes poorly | |
| (Theorem 7) | Second moment always at most 1, and it can capture the entropy of shapes too | Needs bounds on the overlaps between positions and shapes |
Collapsing onto a chessboard. If there is reflection positivity in the directions of the plane, chessboard estimates collapse things into a single translation-invariant quantity, with , and if an area law follows; this is a strand Assumption (where the evidence is: the treatment of reflection positivity is in 13-04 and 13-05. The same structure is in (13)(21) of Kovács–Tomboulis Cited).
What is missing. (i) The large-deviation stage: needs the event that insertions are often refused in all cells at once to be exponentially rare in the number of cells. (ii) The ultraviolet stage: the lower bound on the acceptance rate must be uniform in the lattice spacing, and with thin flips (12-04) it gets worse with . With smooth insertions, it is known that fixed maps pay an extra cost in the ultraviolet (12-07). (iii) An upper bound on second moments: an upper bound on the of Theorem 2. This book shows none of the three.
A negative control. Four-dimensional does not confine at weak coupling, so if the bounds of this chapter are applied there, they must stop working somewhere (for example, becoming large). This check has not yet been done in this book.
What cannot be said
(a) Confinement. None of the identities and inequalities of this chapter implies confinement. (i)–(iii) of §07 remain.
(b) The continuous configuration space. All the theorems are finite versions under (F)(W)(T); the version on the Haar measure of is the same argument with the measure preservation of the maps (or the Jacobian) added, but it is outside Lean.
(c) The hypothesis of Theorem 8. The equalities of "oddness under insertion" are not shown in this chapter for maps composed of insertions in separate cells (in Lean too they are hypotheses).
(d) Novelty. All are elementary combinations of relabelling of variables and Cauchy–Schwarz, and comparison with earlier literature is not done. The summed ensemble and the container identity lie within the framework of Mack–Petkova, the form bounding Wilson loops by twisted partition functions within Tomboulis–Yaffe, and products on a chessboard within Kovács–Tomboulis. The combination of insertion averaged over positions with Cauchy–Schwarz is recorded as a standard technique in proofs of Mermin–Wagner type, and is said to appear in gauge theory in Chatterjee (arXiv:2602.00436) as well (not yet checked). No novelty is claimed for the results of this chapter.
(e) The estimates of §07. , and are physical estimates, and none is a proof.
(f) The negative control. That the bounds stop working for four-dimensional has not yet been checked.
The table of five grades and the dependency graph
| Row | Statement (one line) | Grade | Evidence | Scope | Machine checking |
|---|---|---|---|---|---|
| [01] | Identity 1: , | Proved here | §03 | (F)(W)(T). Uses neither involution nor commutativity | InsertionIdentity (Insertion.mean_one, Insertion.mean_rho_sigma) (hypotheses: (F)(W)(T), ) |
| [02] | Theorem 2: | Proved here | §03 | (F)(W), each satisfies (T), the family is finite and non-empty | InsertionIdentity (Insertion.sector_bias_le) (hypotheses: as left) |
| [03] | The of (4) is an involution | Proved here | §04 | (T) | — |
| [04] | Identity 3: | Proved here | §04 | (F)(W), an involution, odd | BoundedInsertion (Bounded.single) (hypotheses: as left) |
| [05] | Lemma 4: the fluctuation relation, , the acceptance rate (6) | Proved here | §04 | (F)(W), an involution | — |
| [06] | Theorem 5: (7) averaged over positions | Proved here | §04 | (F)(W), involutions, odd, factors of other cells do not move, | BoundedInsertion (Bounded.averaged, Bounded.averaged_bound) (hypotheses: as left) |
| [07] | Identity 6: | Proved here | §05 | (F)(W), involution, odd | SecondMoment (SecondMoment.sqrt_identity) (hypotheses: as left) |
| [08] | Theorem 7: the first formula of the Paley–Zygmund form (8) | Proved here | §05 | (F)(W), a family of involutions, odd, | SecondMoment (SecondMoment.pz_bound) (hypotheses: as left) |
| [09] | Proved here | §05 | Involutions | — | |
| [10] | Theorem 8: (9) for many cells | Proved here | §05 | (F)(W), , "oddness under insertion" assumed | MultiCell (MultiCell.bound, MultiCell.expand_identity) (hypotheses: as left. "Oddness under insertion" is a hypothesis in Lean too) |
| [11] | (10) of slab confinement via thin insertion | Proved here | §06 | Slab, fixed, the sector-summed ensemble | — (the core is the bundle of [06]) |
| [12] | , | Reading (physics) | §07 | Dilute region, semiclassical | — |
| [13] | The product structure of the chessboard | Cited | (13)(21) of Kovács–Tomboulis | Under reflection positivity | — |
| [14] | Collapsing onto by the chessboard; an area law if | Assumption | Strand: §07, 13-04, 13-05 | Under reflection positivity in the directions of the plane | — |
The bundles in the machine-checking column are those confirmed, by re-checking the main text, to contain no sorry and to use axioms forming a subset of the three standard ones. What is guaranteed is only the algebra of sums over finite sets (10-13). In every chapter Lean names are written in the form "file (namespace.theorem)". The theorems of the namespace Insertion are in the file InsertionIdentity, and those of Bounded in the file BoundedInsertion.
Dependency graph (the numbers of premises are smaller than the number of the conclusion):
[01] PRV MEAN E[ρ] = 1, E[ρσ] = −E[σ] (F)(W)(T) [02] PRV BIAS 4E[σ]² ≤ Var(ρ̄) ⟸ [01] Lean sector_bias_le [03] PRV INV the oriented τ is an involution (T) [04] PRV TANH E[H] = E[H t] ⟸ [03] Lean Bounded.single [05] PRV CROOKS fluctuation relation, acceptance rate ⟸ [03] [06] PRV AVG average over positions (7) ⟸ [04] Lean averaged_bound [07] PRV SQRT E[H√ρ] = 0 ⟸ [03] Lean sqrt_identity [08] PRV PZ Paley–Zygmund (8) ⟸ [07] Lean pz_bound [09] PRV Y2 E[Y²] ≤ 1 ⟸ [01][03] [10] PRV MULTI many cells (9) (oddness under insertion assumed) Lean MultiCell.bound [11] PRV SLAB slab confinement via thin insertion ⟸ [06] slab, N fixed [12] RDG HEUR VK/n, e^(−S_inst)/L² (physics) ⟸ [02] [13] CIT KT product structure of the chessboard [14] ASM CHESS collapse to Λ; area law if Λ < 1 ⟸ [06][13] under reflection positivity
The way to check is to see by eye that every number to the right of "⟸" is smaller than the number on the left. There are no circles. The only assumption row is [14], and it enters as a premise of no row. The "oddness under insertion" of [10] is a hypothesis within the statement of the theorem, and does not come from another row. This chapter has neither a node of confinement nor a node of the mass gap.
What this chapter can say
| What is said | What is not said |
|---|---|
| Proved here Under (F)(W)(T), , , | An upper bound on (a bound on the second moment ) |
| Proved here For involutions and odd : the tanh form, the fluctuation relation, the average over positions, the form, the Paley–Zygmund form | The large-deviation stage (rarity of the event of simultaneous refusal in all cells). The ultraviolet stage (a lower bound on the acceptance rate uniform in the lattice spacing) |
| Proved here The slab-confinement theorem is a special case of thin insertion | Confinement when the T² is widened. The negative control of four-dimensional |
| Assumption The strand of collapsing onto a single quantity by the chessboard | A proof of |
Sources and reproduction
| Item | Kind | Source / tools |
|---|---|---|
| Identity 1, Theorem 2, Identity 3, Lemma 4, Theorem 5, Identity 6, Theorem 7, Theorem 8, (10) | Proved here | Proofs in the text, §03–§06. The same content as the theorems of the draft paper "Exact centre-vortex insertion identities in the twist-summed ensemble, and bounded, averaged and driven confinement bounds" (Paper 1 of A-07) |
| The summed ensemble, the container identity | Cited (indirect) | G. Mack, V. B. Petkova, Ann. Phys. 125 (1980) 117 (as in 12-03; text not checked) |
| The product structure of the chessboard (13)(21) | Cited | T. G. Kovács, E. T. Tomboulis, arXiv:hep-lat/0108017 (Phys. Rev. D 65 (2002) 074501) |
| The combination of the average over positions with Cauchy–Schwarz (an example in gauge theory) | Comparison not done | S. Chatterjee, arXiv:2602.00436 (bibliographic data from a checked record; the correspondence of theorems not compared) |
| Lean | Lean | InsertionIdentity (Insertion.mean_one, Insertion.mean_rho_sigma, Insertion.sector_bias_le), BoundedInsertion (Bounded.single, Bounded.multi, Bounded.averaged, Bounded.averaged_bound), SecondMoment (SecondMoment.sqrt_identity, SecondMoment.pz_bound), MultiCell (MultiCell.pushforward, MultiCell.expand_identity, MultiCell.bound). What the bundles guarantee is only the algebra of finite sums |
Words used in this chapter — insertion map, the insertion ratio , the involution oriented by the sector , the tanh factor , acceptance rate, the average over positions, the form, the Paley–Zygmund form, oddness under insertion. Their meanings are in A-02 Glossary (the words of Part 12 are to be added).
Next chapter to read: 12-06 Driven insertion and the flow lemma — if, instead of applying the map at once, the vortex is inserted slowly by heat-bath dynamics, Identity 3 takes the form of the work .
← 12-04 Slab confinementContents12-06 Driven insertion and the flow lemma →