computo ergo sum

2026-10-15 · chapter Yang–Mills and the mass gapPart 12 The second roadthe insertion ratio, the tanh form, second moments · Kiichi, Shiori and Rin

The whole book Contents and reading orders
  1. Part 0 Entrance — how to read this book
  2. 0-01 How to read this book
  3. 0-02 One picture
  4. 0-03 Reading the problem statement word by word
  5. 0-04 Four dimensions in mathematics and four dimensions in physics
  6. Part 1 Mathematical preparation
  7. 1-01 Vector spaces and linear maps
  8. 1-02 What a group is
  9. 1-03 Lie groups and Lie algebras
  10. 1-04 SU(2) and SU(3)
  11. 1-05 Manifolds and tangent spaces
  12. 1-06 Differential forms and the exterior derivative
  13. 1-07 Vector bundles and connections
  14. 1-08 Probability and measure
  15. 1-09 Probability in infinite dimensions
  16. 1-10 Hilbert spaces and self-adjoint operators
  17. 1-11 Fourier analysis and distributions
  18. 1-12 Detour: what happens only in four dimensions
  19. Part 2 Physical preparation
  20. 2-01 Lagrangians and the action
  21. 2-02 The idea of a field
  22. 2-03 Electromagnetism is a gauge theory
  23. 2-04 Special relativity and spacetime
  24. 2-05 The bones of quantum mechanics
  25. 2-06 The harmonic oscillator and creation and annihilation
  26. 2-07 The idea of the path integral
  27. 2-08 Statistical mechanics and phase transitions
  28. 2-09 Detour: the gap and the correlation length in the Ising model
  29. 2-10 The relaxation time and the dynamical exponent z
  30. Part 3 Yang–Mills theory (classical)
  31. 3-01 The gauge principle
  32. 3-02 Non-abelian gauge fields
  33. 3-03 The action and the equations
  34. 3-04 Gauge theory as geometry
  35. 3-05 Instantons and topology
  36. 3-06 Detour: Donaldson and exotic R⁴
  37. 3-07 Yang–Mills inside the Standard Model
  38. Part 4 Quantisation
  39. 4-01 Canonical quantisation and the Hamiltonian
  40. 4-02 The path integral and Euclideanisation
  41. 4-03 Perturbation theory and Feynman diagrams
  42. 4-04 Divergences and renormalisation
  43. 4-05 The algebra of divergences
  44. 4-06 Asymptotic freedom
  45. 4-07 Dimensional transmutation and Λ
  46. 4-08 Gauge fixing and Faddeev–Popov
  47. 4-09 The axioms of quantum field theory
  48. 4-10 The Osterwalder–Schrader axioms and reconstruction
  49. 4-11 The definition of the mass gap
  50. 4-12 Detour: the perturbation series diverges
  51. Part 5 Lattice gauge theory
  52. 5-01 Wilson's lattice
  53. 5-02 The strong-coupling expansion
  54. 5-03 Reflection positivity and the transfer matrix
  55. 5-04 The infinite-volume limit and the cluster expansion
  56. 5-05 Weak coupling and the continuum limit
  57. 5-06 How U(1) differs from the non-abelian case
  58. 5-07 The Monte Carlo method
  59. 5-08 Measuring glueballs and the string tension
  60. 5-09 What to hold fixed when taking the limit
  61. 5-10 Lattice gauge theory with finite groups
  62. 5-11 Detour: Bakry–Émery and one-link integration
  63. Part 6 Constructive field theory
  64. 6-01 What constructive field theory is
  65. 6-02 Solvability in two dimensions and the Yang–Mills measure
  66. 6-03 Constructing scalar fields
  67. 6-04 The cluster expansion
  68. 6-05 The sequence of renormalisation group steps
  69. 6-06 Ultraviolet stability of three-dimensional Yang–Mills
  70. 6-07 Four dimensions
  71. 6-08 Triviality of φ⁴ in four dimensions
  72. 6-09 Stochastic quantisation and regularity structures
  73. 6-10 Where four dimensions stops
  74. 6-11 Obstacles other than divergence
  75. 6-12 Detour: "if 1/0 is given a symbol"
  76. Part 7 From the side of physics
  77. 7-01 How physics sees it
  78. 7-02 Mechanisms of confinement
  79. 7-03 The string picture
  80. 7-04 Large N
  81. 7-05 String theory and extra dimensions
  82. 7-06 How extra dimensions become invisible
  83. 7-07 Where gauge fields come from
  84. 7-08 Holography
  85. 7-09 The mass gap becomes geometry
  86. 7-10 Back to four dimensions
  87. 7-11 Supersymmetry and Seiberg–Witten
  88. 7-12 The sentence that plays the role of an equivalence principle
  89. 7-13 Where the way physics digs parts from mathematics
  90. Part 8 A dictionary of two languages — the physical and the mathematical view
  91. 8-01 How to read the dictionary
  92. 8-02 Dictionary A
  93. 8-03 Dictionary B
  94. 8-04 Dictionary C
  95. 8-05 The physical counterparts of our assumptions
  96. The map
  97. Part 9 Where things stand, and open tasks
  98. 9-01 How far the world has come
  99. 9-02 Where the two ways of digging part
  100. 9-03 Candidates for new concepts
  101. 9-04 The list of open tasks
  102. 9-05 Common misconceptions
  103. 9-06 The stages a proof must contain — the table of seven stages
  104. The first road — from the direction of time
  105. Part 10 The first road, first half — from the direction of time: the mass gap and the diffusive-relaxation-time assumption
  106. 10-00 Entrance — the staircase, and the random walk, the ruler and the clock
  107. 10-01 The line of construction and Assumption ξ²
  108. 10-02 Roads tried on the four-dimensional lattice, and walls
  109. 10-03 The four steps of the staircase — why we start from 0+1 dimensions
  110. 10-04 The path measure of the double well, and kinks
  111. 10-05 The statement of the first step — four conditions and Proposition 4.5
  112. 10-06 (H1) Local Poincaré within a phase
  113. 10-07 The map of (H2) — seven routes and the seam of the ring
  114. 10-08 What computer-assisted means — the conditions on the chain inside the window
  115. 10-09 The sector framework and the three strands of route 5
  116. 10-10 The list of detour plans — types of breakage
  117. 10-11 (H3)(H4) and the constant of the core
  118. 10-12 The integrated table and the dependency graph
  119. 10-13 Lean statements and the limits of machine checking
  120. 10-14 Reconciliation — the numbers of the record and the known numbers
  121. 10-15 What remains and its cost — the distance to a theorem
  122. 10-16 What is not claimed
  123. 10-17 Insights and small questions
  124. Part 11 The first road, second half — repairing the form of the assumption, making time continuous
  125. 11-00 Further considerations — entrance
  126. 11-01 One form that obstructs Assumption ξ² — a nearly conserved global quantity
  127. 11-02 Choosing the ruler and the coordinates again — the length at which conservation breaks
  128. 11-03 Two ways to repair Assumption ξ² — the sector Assumption ξ² and the local Assumption ξ²
  129. 11-04 Which Assumption ξ² the one-sided bridge needs
  130. 11-05 Making time continuous — the Hamiltonian lattice and the vacuum measure
  131. 11-06 Paying with rarity instead of convexity — renormalisation on groups and log-Sobolev
  132. 11-07 Because it is four dimensions — the dimensionless coupling and topology
  133. 11-08 Questions, and what is not claimed
  134. 11-A1 Table of notation for Part 11
  135. The second road — from the direction of space
  136. Part 12 The second road: from the direction of space — a small twisted T² and confinement
  137. 12-00 Entrance — space, not time
  138. 12-01 The twisted T² and 't Hooft flux
  139. 12-02 Vortices and fractional instantons
  140. 12-03 Containers — conditioning on the frame makes things independent
  141. 12-04 Slab confinement
  142. 12-05 Vortex-insertion identities
  143. 12-06 Driven insertion and the flow lemma
  144. 12-07 Why fixed maps fail
  145. 12-08 The measured record
  146. 12-09 Where this road stops — widening the T² is the band
  147. The crossover band — two roads reach the same wall
  148. Part 13 The crossover band — two roads reach the same wall
  149. 13-00 Entrance — confluence
  150. 13-01 The correct form of the band
  151. 13-02 Reduction to a single inequality
  152. 13-03 The only place where non-abelian enters
  153. 13-04 Structure alone cannot cross
  154. 13-05 The chessboard and simultaneous flips
  155. 13-06 Renormalisation comparison — a comparison that distinguishes groups
  156. 13-07 The band seen from the side of time
  157. 13-08 A map of the roads tried and stopped
  158. 13-09 The measured record
  159. 13-10 Candidate new viewpoints
  160. 13-11 Ultraviolet control — what it means to close at infinitely many steps
  161. Closing
  162. Part 14 Closing — conditional statements
  163. 14-00 Entrance — the promise of this part
  164. 14-01 The conditional statement — the mass gap and confinement, arrow by arrow
  165. 14-02 The ledger of conditions
  166. 14-03 The table of questions (a cross-index)
  167. 14-04 What is not claimed (a cross-index)
  168. Appendices
  169. A-01 Table of notation
  170. A-02 Glossary
  171. A-03 Guide to the literature
  172. A-04 Lean and machine checking
  173. A-05 How this book was made
  174. A-06 Index of assumptions
  175. 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" TT (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 ρ\rho is 1, and E[ρσ]=−E[σ]\mathbb E[\rho\sigma]=-\mathbb E[\sigma]; (2) the bias of the sector is bounded by the fluctuation of the insertion ratio: 4E[σ]2≤Var(ρˉ)4\mathbb E[\sigma]^2\le\mathrm{Var}(\bar\rho); (3) passing to an involution, a bounded form E[H]=E[Htanh⁡(ΔS/2)]\mathbb E[H]=\mathbb E[H\tanh(\Delta S/2)] and a form averaged over positions; (4) the second-moment form and the Paley–Zygmund form that follow from E[Hρ]=0\mathbb E[H\sqrt\rho]=0. 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 SU(2)SU(2) 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.

The order of this chapter
  1. Summary [Y3] — the balance of a map that inserts one vortex
  2. The setting — three conditions
  3. The insertion-ratio identity and the bound on the bias — Identity 1, Theorem 2
  4. Bounded forms — tanh and the average over positions — Identity 3, Lemma 4, Theorem 5
  5. Second-moment forms — Identity 6, Theorem 7, Theorem 8
  6. Rederiving slab confinement
  7. What it means, and what is missing — Table 1
  8. What cannot be said
  9. The table of five grades and the dependency graph — Table 2

01

Summary [Y3] — the balance of a map that inserts one vortex

  1. In the sector-summed ensemble (12-03), whether a vortex passes through a region is expressed by a sign σ=±1\sigma=\pm1. A map TT that inserts (or removes) one vortex flips σ\sigma.
  2. We call the ratio of weights when a vortex is inserted in a configuration xx the insertion ratio ρ(x)\rho(x). The smaller ρ\rho is than 1, the more expensive it is to insert a vortex.
  3. 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 E[ρσ]=−E[σ]\mathbb E[\rho\sigma]=-\mathbb E[\sigma] Proved here.
  4. Combining the two, the bias of the sector ∣E[σ]∣|\mathbb E[\sigma]| 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.
  5. The insertion ratio can take large values (heavy tails), so we also prepare a bounded form that is easy to handle. tanh⁡(ΔS/2)\tanh(\Delta S/2) always lies in [−1,1][-1,1], and E[H]=E[Htanh⁡(ΔS/2)]\mathbb E[H]=\mathbb E[H\tanh(\Delta S/2)] holds (Identity 3). 1−E[tanh⁡]1-\mathbb E[\tanh] is twice the mean acceptance rate of a Monte Carlo move that inserts a vortex (Lemma 4) Proved here.
  6. The form using ρ\sqrt\rho has a second moment that is always at most 1, so there is no worry about tails (Identity 6, Theorem 7) Proved here.
  7. 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).
  8. 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.
02

The setting — three conditions

Throughout this chapter we place the following three.

(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 zz 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 (SU(2)linksSU(2)^{\text{links}} and coclosed zz), one must replace the sums by Haar and counting integrals, and TT 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

ρ(x)={w(Tx)/w(x)(σ(x)=+1)w(T−1x)/w(x)(σ(x)=−1)(1)\rho(x)=\begin{cases}w(Tx)/w(x)&(\sigma(x)=+1)\\ w(T^{-1}x)/w(x)&(\sigma(x)=-1)\end{cases} \tag{1}

The orientation is chosen so that a vortex is inserted by TT into configurations with σ=+1\sigma=+1, and configurations with σ=−1\sigma=-1 are taken back by T−1T^{-1}. In terms of the action S=−ln⁡wS=-\ln w, ρ=e−ΔS\rho=e^{-\Delta S}.

03

The insertion-ratio identity and the bound on the bias

Identity 1 (the mean of the insertion ratio)

Under (F)(W)(T),

E[ρ]=1,E[ρ σ]=−E[σ].(2)\mathbb E[\rho]=1,\qquad \mathbb E[\rho\,\sigma]=-\mathbb E[\sigma]. \tag{2}

Proved here Proof. Set X±={σ=±1}X_\pm=\{\sigma=\pm1\}. TT maps X+X_+ to X−X_- and X−X_- to X+X_+, and since it is a bijection, T(X+)=X−T(X_+)=X_- and T−1(X−)=X+T^{-1}(X_-)=X_+. Hence

∑x∈X+w(x)ρ(x)=∑x∈X+w(Tx)=∑y∈X−w(y),∑x∈X−w(x)ρ(x)=∑x∈X−w(T−1x)=∑y∈X+w(y).\sum_{x\in X_+}w(x)\rho(x)=\sum_{x\in X_+}w(Tx)=\sum_{y\in X_-}w(y),\qquad \sum_{x\in X_-}w(x)\rho(x)=\sum_{x\in X_-}w(T^{-1}x)=\sum_{y\in X_+}w(y).

Adding gives ∑wρ=∑w\sum w\rho=\sum w, and multiplying by σ\sigma and adding gives ∑wρσ=∑X−w−∑X+w=−∑wσ\sum w\rho\sigma=\sum_{X_-}w-\sum_{X_+}w=-\sum w\sigma. ∎

Lean InsertionIdentity (Insertion.mean_one, Insertion.mean_rho_sigma) (hypotheses: XX is finite, w>0w\gt0, TT is a bijection of XX, σ(Tx)=−σ(x)\sigma(Tx)=-\sigma(x), σ=±1\sigma=\pm1. Conclusion: ∑wρ=∑w\sum w\rho=\sum w, ∑wρσ=−∑wσ\sum w\rho\sigma=-\sum w\sigma). No involution, commutativity or measure structure is used.

Theorem 2 (the bias of the sector is bounded by the fluctuation of the insertion ratio)

Under (F)(W), take a sign of the sector σ\sigma and a non-empty finite family T1,…,TnT_1,\dots,T_n of bijections that flip it (each TkT_k satisfying (T)), and let ρˉ=1n∑kρk\bar\rho=\frac1n\sum_k\rho_k be the mean insertion ratio. Then

4 E[σ]2 ≤ E[(ρˉ−1)2]=Var(ρˉ),that is∣E[σ]∣≤12Var(ρˉ).(3)4\,\mathbb E[\sigma]^2\ \le\ \mathbb E\bigl[(\bar\rho-1)^2\bigr]=\mathrm{Var}(\bar\rho),\qquad\text{that is}\quad |\mathbb E[\sigma]|\le\tfrac12\sqrt{\mathrm{Var}(\bar\rho)}. \tag{3}

Proved here Proof. Applying Identity 1 to each TkT_k and averaging gives E[ρˉ]=1\mathbb E[\bar\rho]=1, E[ρˉσ]=−E[σ]\mathbb E[\bar\rho\sigma]=-\mathbb E[\sigma]. Hence E[(ρˉ−1)σ]=−2E[σ]\mathbb E[(\bar\rho-1)\sigma]=-2\mathbb E[\sigma]. From Cauchy–Schwarz and σ2=1\sigma^2=1, 4E[σ]2≤E[(ρˉ−1)2]E[σ2]=Var(ρˉ)4\mathbb E[\sigma]^2\le\mathbb E[(\bar\rho-1)^2]\mathbb E[\sigma^2]=\mathrm{Var}(\bar\rho). ∎

Lean InsertionIdentity (Insertion.sector_bias_le) (hypotheses: XX is finite, the index set of the family is finite and non-empty, w>0w\gt0, each TkT_k is a bijection with σ(Tkx)=−σ(x)\sigma(T_kx)=-\sigma(x), σ=±1\sigma=\pm1. Conclusion: 4(∑wσ)2≤(∑w)∑w(ρˉ−1)24(\sum w\sigma)^2\le(\sum w)\sum w(\bar\rho-1)^2).

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 θj(Φ)=∣E[σj ∣ Φ]∣≤12Var(ρˉ ∣ Φ)\theta_j(\Phi)=|\mathbb E[\sigma_j\,|\,\Phi]|\le\tfrac12\sqrt{\mathrm{Var}(\bar\rho\,|\,\Phi)} Proved here. The reading is that the factor tanh⁡(∣ΔFj∣/2)\tanh(|\Delta F_j|/2) of Lemma 5 is bounded from above by the fluctuation of the mean insertion ratio of insertions at many positions inside the container.

04

Bounded forms — tanh and the average over positions

The insertion ratio ρ=e−ΔS\rho=e^{-\Delta S} can take large values, so Var(ρˉ)\mathrm{Var}(\bar\rho) can be large. We therefore switch to a bounded factor. From the TT of (T) we build the map oriented by the sector

τ(x)={Tx(σ(x)=+1)T−1x(σ(x)=−1)(4)\tau(x)=\begin{cases}Tx&(\sigma(x)=+1)\\ T^{-1}x&(\sigma(x)=-1)\end{cases} \tag{4}

and τ\tau is an involution (τ∘τ=id\tau\circ\tau=\mathrm{id}) (if σ(x)=+1\sigma(x)=+1, then τx=Tx∈X−\tau x=Tx\in X_-, so τ(τx)=T−1Tx=x\tau(\tau x)=T^{-1}Tx=x; the converse is the same) Proved here. We set ΔS=S∘τ−S\Delta S=S\circ\tau-S, ρ=w∘τ/w=e−ΔS\rho=w\circ\tau/w=e^{-\Delta S}, and

t(x):=w(x)−w(τx)w(x)+w(τx)=tanh⁡ΔS(x)2 ∈(−1,1)(5)t(x):=\frac{w(x)-w(\tau x)}{w(x)+w(\tau x)}=\tanh\frac{\Delta S(x)}2\ \in(-1,1) \tag{5}

Identity 3 (the bounded insertion identity)

Under (F)(W), if τ\tau is an involution of XX and HH is a function odd under τ\tau (H∘τ=−HH\circ\tau=-H), then E[H]=E[H t]\mathbb E[H]=\mathbb E[H\,t].

Proved here Proof. Since 1−t=2w∘τ/(w+w∘τ)1-t=2w\circ\tau/(w+w\circ\tau), E[H]−E[Ht]\mathbb E[H]-\mathbb E[Ht] is proportional to 2∑xg(x)/∑w2\sum_xg(x)/\sum w with g(x)=w(x)H(x)w(τx)/(w(x)+w(τx))g(x)=w(x)H(x)w(\tau x)/(w(x)+w(\tau x)). g(τx)=−g(x)g(\tau x)=-g(x) (HH is odd and the rest is symmetric under x↔τxx\leftrightarrow\tau x), so relabelling the sum by τ\tau gives ∑g=−∑g\sum g=-\sum g, hence 0. ∎

Lean BoundedInsertion (Bounded.single) (hypotheses: XX is finite, τ\tau is a bijection with τ∘τ=id\tau\circ\tau=\mathrm{id}, w>0w\gt0, H∘τ=−HH\circ\tau=-H. Conclusion: ∑wHt=∑wH\sum wHt=\sum wH).

Lemma 4 (the fluctuation relation and the acceptance rate)

In the setting of Identity 3, for every real ss, P(ΔS=s)=es P(ΔS=−s)\mathbb P(\Delta S=s)=e^{s}\,\mathbb P(\Delta S=-s). In particular E[t]≥0\mathbb E[t]\ge0, and

1−E[t]=2 E[11+eΔS]=2×(mean Barker acceptance rate of an insertion move).(6)1-\mathbb E[t]=2\,\mathbb E\Bigl[\frac1{1+e^{\Delta S}}\Bigr]=2\times(\text{mean Barker acceptance rate of an insertion move}). \tag{6}

Proved here Proof. Relabelling gives E[g]=E[(g∘τ) ρ]\mathbb E[g]=\mathbb E[(g\circ\tau)\,\rho] for any gg. Since ΔS∘τ=−ΔS\Delta S\circ\tau=-\Delta S, taking g=1{ΔS=s}g=\mathbf 1\{\Delta S=s\} gives g∘τ=1{ΔS=−s}g\circ\tau=\mathbf 1\{\Delta S=-s\}, and on the set {ΔS=−s}\{\Delta S=-s\} we have ρ=e−ΔS=es\rho=e^{-\Delta S}=e^{s}, which gives the first formula. Pairing ss with −s-s gives P(s)tanh⁡s2+P(−s)tanh⁡−s2=P(−s)(es−1)tanh⁡s2≥0\mathbb P(s)\tanh\frac s2+\mathbb P(-s)\tanh\frac{-s}2=\mathbb P(-s)(e^{s}-1)\tanh\frac s2\ge0, so E[t]≥0\mathbb E[t]\ge0. Finally 1−tanh⁡(ΔS/2)=2/(1+eΔS)1-\tanh(\Delta S/2)=2/(1+e^{\Delta S}). ∎ 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 w(τx)/(w(x)+w(τx))w(\tau x)/(w(x)+w(\tau x))". If insertions are almost always refused (the cost is high), E[t]≈1\mathbb E[t]\approx1; if they pass often, E[t]\mathbb E[t] 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 cc, take insertion involutions τc,p\tau_{c,p} at positions p∈Pp\in P in the cell (PP a non-empty finite set), build tc,pt_{c,p} by (5), and set tˉc=1∣P∣∑ptc,p\bar t_c=\frac1{|P|}\sum_pt_{c,p}.

Theorem 5 (a bounded bound averaged over positions)

Under (F)(W), assume that each τc,p\tau_{c,p} is an involution, HH is odd under every τc,p\tau_{c,p}, and the factors of other cells do not move (td,q∘τc,p=td,qt_{d,q}\circ\tau_{c,p}=t_{d,q} if c≠dc\ne d). Then

E[H]=E[H∏ctˉc],∣H∣≤1 implies  ∣E[H]∣≤E[∏c∣tˉc∣].(7)\mathbb E[H]=\mathbb E\Bigl[H\prod_c\bar t_c\Bigr],\qquad |H|\le1\ \text{implies}\ \ |\mathbb E[H]|\le\mathbb E\Bigl[\prod_c|\bar t_c|\Bigr]. \tag{7}

Proved here Proof. First, for ∏ctc,pc\prod_ct_{c,p_c} with one position chosen from each cell, an induction adding cells one at a time gives E[H∏ctc,pc]=E[H]\mathbb E[H\prod_ct_{c,p_c}]=\mathbb E[H]: at the step adding cell dd, the product so far G=∏c≠dtc,pcG=\prod_{c\ne d}t_{c,p_c} does not move under τd,pd\tau_{d,p_d}, so HGHG is odd and Identity 3 applies. Expanding ∏ctˉc\prod_c\bar t_c gives the average over the ∣P∣#cells|P|^{\#\text{cells}} choices, hence the first formula. Taking absolute values with ∣H∣≤1|H|\le1 gives the second. ∎ Each factor lies in [−1,1][-1,1], and no moment assumptions are needed.

Lean BoundedInsertion (Bounded.averaged, Bounded.averaged_bound) (hypotheses: XX, the set of cells and the set of positions PP are finite, PP is non-empty, every τc,p\tau_{c,p} is an involution, w>0w\gt0, HH is odd under every τc,p\tau_{c,p}, td,q∘τc,p=td,qt_{d,q}\circ\tau_{c,p}=t_{d,q} if c≠dc\ne d, and for the latter also ∣H∣≤1|H|\le1. Conclusion: (7)). One step of the induction is BoundedInsertion (Bounded.multi).

05

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 ρ\sqrt\rho.

Identity 6 (the Bhattacharyya form)

Under (F)(W), if τ\tau is an involution, H∘τ=−HH\circ\tau=-H and ρ=w∘τ/w\rho=w\circ\tau/w, then E[Hρ]=0\mathbb E[H\sqrt\rho]=0.

Proved here Proof. wρ=w⋅w∘τw\sqrt\rho=\sqrt{w\cdot w\circ\tau} is symmetric under x↔τxx\leftrightarrow\tau x and HH is antisymmetric, so ∑xw(x)H(x)ρ(x)\sum_xw(x)H(x)\sqrt{\rho(x)} changes sign when relabelled by τ\tau, and is 0. ∎

Lean SecondMoment (SecondMoment.sqrt_identity) (hypotheses: XX is finite, τ\tau is a bijection with τ∘τ=id\tau\circ\tau=\mathrm{id}, w>0w\gt0, H∘τ=−HH\circ\tau=-H. Conclusion: ∑wHw∘τ/w=0\sum wH\sqrt{w\circ\tau/w}=0).

Theorem 7 (the Paley–Zygmund form)

Under (F)(W), take an involution τp\tau_p for each pp of a non-empty finite set PP, and let HH be odd under every τp\tau_p with ∣H∣≤1|H|\le1. Setting Y:=1∣P∣∑pρpY:=\frac1{|P|}\sum_p\sqrt{\rho_p} (a weighted count of insertions that flip the sector),

E[H]2 E[Y2] ≤ E[Y2]−E[Y]2,that isE[H]2≤1−E[Y]2E[Y2],and  E[Y2]≤1.(8)\mathbb E[H]^2\,\mathbb E[Y^2]\ \le\ \mathbb E[Y^2]-\mathbb E[Y]^2,\qquad\text{that is}\quad \mathbb E[H]^2\le1-\frac{\mathbb E[Y]^2}{\mathbb E[Y^2]},\qquad\text{and}\ \ \mathbb E[Y^2]\le1. \tag{8}

Proved here Proof. Averaging Identity 6 gives E[HY]=0\mathbb E[HY]=0. Setting C=E[Y2]C=\mathbb E[Y^2], B=E[Y]B=\mathbb E[Y] gives E[H(C−BY)]=C E[H]\mathbb E[H(C-BY)]=C\,\mathbb E[H]. From Cauchy–Schwarz and H2≤1H^2\le1, C2E[H]2≤E[(C−BY)2]=C2−2CB2+B2C=C(C−B2)C^2\mathbb E[H]^2\le\mathbb E[(C-BY)^2]=C^2-2CB^2+B^2C=C(C-B^2). Dividing by C>0C\gt0 (ρp>0\rho_p\gt0) gives the first formula. The last inequality follows from Y2≤1∣P∣∑pρpY^2\le\frac1{|P|}\sum_p\rho_p (Cauchy–Schwarz) and, for involutions, E[ρp]=∑xw(τpx)/∑w=1\mathbb E[\rho_p]=\sum_xw(\tau_px)/\sum w=1. ∎

Lean SecondMoment (SecondMoment.pz_bound) (hypotheses: XX and PP are finite, PP is non-empty, every τp\tau_p is an involution, w>0w\gt0, HH is odd under every τp\tau_p, ∣H∣≤1|H|\le1. Conclusion: (∑wH)2(∑wY2)≤(∑w)((∑wY2)(∑w)−(∑wY)2)(\sum wH)^2(\sum wY^2)\le(\sum w)\bigl((\sum wY^2)(\sum w)-(\sum wY)^2\bigr), which normalised is the first formula of (8)). E[Y2]≤1\mathbb E[Y^2]\le1 has no Lean check.

(8) says that the more concentrated YY is in the sense of second moments (the closer E[Y2]\mathbb E[Y^2] is to E[Y]2\mathbb E[Y]^2), 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 ρ\rho.

Many cells. We also place a form that handles products of insertion ratios over cells.

Theorem 8 (a second-moment bound for many cells)

Under (F)(W), with ∣H∣≤1|H|\le1, take a function rc:X→Rr_c:X\to\mathbb R (an averaged insertion ratio) for each cc of a finite set of cells CC, and assume oddness under insertion — for every S⊆CS\subseteq C, E[H∏c∈Src]=(−1)∣S∣E[H]\mathbb E[H\prod_{c\in S}r_c]=(-1)^{|S|}\mathbb E[H]. Then

E[H∏c∈C(1−rc)]=2∣C∣ E[H],4∣C∣ E[H]2 ≤ E[∏c∈C(1−rc)2].(9)\mathbb E\Bigl[H\prod_{c\in C}(1-r_c)\Bigr]=2^{|C|}\,\mathbb E[H],\qquad 4^{|C|}\,\mathbb E[H]^2\ \le\ \mathbb E\Bigl[\prod_{c\in C}(1-r_c)^2\Bigr]. \tag{9}

Proved here Proof. Expand ∏c(1−rc)=∑S⊆C(−1)∣S∣∏c∈Src\prod_c(1-r_c)=\sum_{S\subseteq C}(-1)^{|S|}\prod_{c\in S}r_c; using the assumption each term becomes E[H]\mathbb E[H], and there are 2∣C∣2^{|C|} terms. Cauchy–Schwarz and H2≤1H^2\le1 give the second formula. ∎

Lean MultiCell (MultiCell.bound) (hypotheses: XX and CC are finite, w>0w\gt0, ∣H∣≤1|H|\le1, the equalities of "oddness under insertion" above for every S⊆CS\subseteq C. 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 ∑w (w∘T/w) F=∑w F∘T−1\sum w\,(w\circ T/w)\,F=\sum w\,F\circ T^{-1} (MultiCell (MultiCell.pushforward), hypotheses: finite, w>0w\gt0), 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.

06

Rederiving slab confinement

Take the thin insertion of 12-04. Let the cells be the plaquettes p∈S(C)p\in S(C) of the plane inside the loop, with one position (∣P∣=1|P|=1), and let τp\tau_p be the flip of zz on the vortex sheet SpS_p. τp\tau_p is itself an involution, and since it does not change the links it preserves the Haar × counting measure. H=W(C)H=W(C) is odd under each τp\tau_p, and tp=(1−rp)/(1+rp)t_p=(1-r_p)/(1+r_p) is determined only by the values on SpS_p, so it does not move under τq\tau_q for q≠pq\ne p. From Theorem 5,

∣E[W(C)]∣ ≤ E[∏p∈S(C)∣tp∣] ≤ tanh⁡(βN2)A(10)|\mathbb E[W(C)]|\ \le\ \mathbb E\Bigl[\prod_{p\in S(C)}|t_p|\Bigr]\ \le\ \tanh(\beta N^2)^{A} \tag{10}

(∣tp∣≤tanh⁡(βN2)|t_p|\le\tanh(\beta N^2) 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.

07

What it means, and what is missing

The average over positions is entropy. The Var(ρˉ)\mathrm{Var}(\bar\rho) of Theorem 2 is expected to be of order ≈VK/n\approx VK/n, where KK is the number of positions, among the nn, within reach of each other's correlations and VV is the variance of one insertion ratio Reading (physics). Increasing the number of positions nn plays the role of entropy, and the decay of correlations between positions (the mass gap) plays the role of keeping KK small. For insertions of the smooth fractional-instanton type, V∼eSinstV\sim e^{S_{\rm inst}} is expected, the area of the region needed is proportional to VV, and the string tension is of order σ∼e−Sinst/L2\sigma\sim e^{-S_{\rm inst}}/L^2, the same form as the formula for a dilute vortex gas Reading (physics, a semiclassical estimate; not a proof).

Table 1 Comparison of the three forms (factor per cell)
FormFactorStrengthsWeaknesses
Variance of the insertion ratio (Theorem 2)1−ρˉ1-\bar\rhoCaptures the free energy (the exponential average) as it isHeavy tails. The second moment can be large
tanh (Theorem 5)tˉc\bar t_cBounded. Meaning as an acceptance rate (Lemma 4)Not an exponential average, so it captures the entropy of vortex shapes poorly
ρ\sqrt\rho (Theorem 7)YYSecond moment always at most 1, and it can capture the entropy of shapes tooNeeds 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, E[∏c∈inside∣tˉc∣]≤Λn\mathbb E[\prod_{c\in\text{inside}}|\bar t_c|]\le\Lambda^{n} with Λ:=(E[∏all cells∣tˉc∣])1/#cells\Lambda:=(\mathbb E[\prod_{\text{all cells}}|\bar t_c|])^{1/\#\text{cells}}, and if Λ<1\Lambda\lt1 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: Λ<1\Lambda\lt1 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 NN. 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 VV of Theorem 2. This book shows none of the three.

A negative control. Four-dimensional U(1)U(1) does not confine at weak coupling, so if the bounds of this chapter are applied there, they must stop working somewhere (for example, VV becoming large). This check has not yet been done in this book.

08

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 SU(2)SU(2) 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. Var(ρˉ)≈VK/n\mathrm{Var}(\bar\rho)\approx VK/n, V∼eSinstV\sim e^{S_{\rm inst}} and σ∼e−Sinst/L2\sigma\sim e^{-S_{\rm inst}}/L^2 are physical estimates, and none is a proof.

(f) The negative control. That the bounds stop working for four-dimensional U(1)U(1) has not yet been checked.

09

The table of five grades and the dependency graph

Table 2 The rows of this chapter (conditions: (F) finite configuration space, (W) positive weights, (T) a bijection that flips the sector)
RowStatement (one line)GradeEvidenceScopeMachine checking
[01]Identity 1: E[ρ]=1\mathbb E[\rho]=1, E[ρσ]=−E[σ]\mathbb E[\rho\sigma]=-\mathbb E[\sigma]Proved here§03(F)(W)(T). Uses neither involution nor commutativityInsertionIdentity (Insertion.mean_one, Insertion.mean_rho_sigma) (hypotheses: (F)(W)(T), σ=±1\sigma=\pm1)
[02]Theorem 2: 4E[σ]2≤Var(ρˉ)4\mathbb E[\sigma]^2\le\mathrm{Var}(\bar\rho)Proved here§03(F)(W), each TkT_k satisfies (T), the family is finite and non-emptyInsertionIdentity (Insertion.sector_bias_le) (hypotheses: as left)
[03]The τ\tau of (4) is an involutionProved here§04(T)—
[04]Identity 3: E[H]=E[Htanh⁡(ΔS/2)]\mathbb E[H]=\mathbb E[H\tanh(\Delta S/2)]Proved here§04(F)(W), τ\tau an involution, HH oddBoundedInsertion (Bounded.single) (hypotheses: as left)
[05]Lemma 4: the fluctuation relation, E[t]≥0\mathbb E[t]\ge0, the acceptance rate (6)Proved here§04(F)(W), τ\tau an involution—
[06]Theorem 5: (7) averaged over positionsProved here§04(F)(W), involutions, HH odd, factors of other cells do not move, ∣H∣≤1|H|\le1BoundedInsertion (Bounded.averaged, Bounded.averaged_bound) (hypotheses: as left)
[07]Identity 6: E[Hρ]=0\mathbb E[H\sqrt\rho]=0Proved here§05(F)(W), involution, HH oddSecondMoment (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, HH odd, ∣H∣≤1|H|\le1SecondMoment (SecondMoment.pz_bound) (hypotheses: as left)
[09]E[Y2]≤1\mathbb E[Y^2]\le1Proved here§05Involutions—
[10]Theorem 8: (9) for many cellsProved here§05(F)(W), ∣H∣≤1|H|\le1, "oddness under insertion" assumedMultiCell (MultiCell.bound, MultiCell.expand_identity) (hypotheses: as left. "Oddness under insertion" is a hypothesis in Lean too)
[11](10) of slab confinement via thin insertionProved here§06Slab, NN fixed, the sector-summed ensemble— (the core is the bundle of [06])
[12]Var(ρˉ)≈VK/n\mathrm{Var}(\bar\rho)\approx VK/n, σ∼e−Sinst/L2\sigma\sim e^{-S_{\rm inst}}/L^2Reading (physics)§07Dilute region, semiclassical—
[13]The product structure of the chessboardCited(13)(21) of Kovács–TomboulisUnder reflection positivity—
[14]Collapsing onto Λ\Lambda by the chessboard; an area law if Λ<1\Lambda\lt1AssumptionStrand: §07, 13-04, 13-05Under 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 saidWhat is not said
Proved here Under (F)(W)(T), E[ρ]=1\mathbb E[\rho]=1, E[ρσ]=−E[σ]\mathbb E[\rho\sigma]=-\mathbb E[\sigma], 4E[σ]2≤Var(ρˉ)4\mathbb E[\sigma]^2\le\mathrm{Var}(\bar\rho)An upper bound on Var(ρˉ)\mathrm{Var}(\bar\rho) (a bound on the second moment VV)
Proved here For involutions and odd HH: the tanh form, the fluctuation relation, the average over positions, the ρ\sqrt\rho form, the Paley–Zygmund formThe 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 insertionConfinement when the T² is widened. The negative control of four-dimensional U(1)U(1)
Assumption The strand of collapsing onto a single quantity Λ\Lambda by the chessboardA proof of Λ<1\Lambda\lt1

Sources and reproduction

ItemKindSource / tools
Identity 1, Theorem 2, Identity 3, Lemma 4, Theorem 5, Identity 6, Theorem 7, Theorem 8, (10)Proved hereProofs 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 identityCited (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)CitedT. 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 doneS. Chatterjee, arXiv:2602.00436 (bibliographic data from a checked record; the correspondence of theorems not compared)
LeanLeanInsertionIdentity (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 ρ\rho, the involution oriented by the sector τ\tau, the tanh factor tt, acceptance rate, the average over positions, the ρ\sqrt\rho 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 WW.

← 12-04 Slab confinementContents12-06 Driven insertion and the flow lemma →

Revised 2026-10-15: first version.