computo ergo sum

2026-10-15 · chapter Yang–Mills and the mass gapPart 12 The second roaddriven insertion, Crooks and Jarzynski, the flow lemma · 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

Driven insertion and the flow lemma

What this chapter shows — In 12-05 we obtained E[H]=E[Htanh⁡(ΔS/2)]\mathbb E[H]=\mathbb E[H\tanh(\Delta S/2)] from a map τ\tau that inserts a vortex at once. For thin vortices the cost of insertion ΔS\Delta S is large, proportional to the area, and the bound is almost useless. In this chapter, instead of inserting at once, we consider "driven insertion", which updates only the inside of the container by heat bath while flipping the couplings of the vortex sheet little by little, and show (1) that on the space of paths the combination of time reversal and sector flip is an involution, with weight ratio e−We^{-W} (WW is the work along the path) (the Crooks relation); (2) that from this follow E[H]=E[Htanh⁡(W/2)]\mathbb E[H]=\mathbb E[H\tanh(W/2)] (the driven identity) and the Jarzynski equality; (3) for the probability aa that one step of a stationary kernel flips the sector, θ≤1−a\theta\le1-a (the flow lemma), and flip probability ≤1−θ2\le1-\theta^2; and (4) that moving containers simultaneously gives E∏θ≤P(none flips)\mathbb E\prod\theta\le\mathbb P(\text{none flips}). Finally we record that for a one-step kernel this guarantee reaches only θ0∼12\theta_0\sim\tfrac12, and cannot be used to test the crossover band (13-01).

Prerequisite chapters — 12-03 (containers, frame, the bias of the sector θ\theta, the container identity), 12-05 (Identity 3, Lemma 4, Theorem 5), 13-01 (the correct form of the band ln⁡(1/θ(L,L))≥cL2\ln(1/\theta(L,L))\ge cL^2). From Part 2, 2-08 (Gibbs measures, free energy), and from Part 5, 5-07 (heat bath, detailed balance).

Said first — All theorems are statements under "a finite configuration space, positive weights, and kernels that move only the inside of the container", and each row states those conditions. Passing to the continuous configuration space of SU(2)SU(2) is the same as in 12-05 §02 (replace the sums by Haar integrals) and is outside Lean. The Crooks relation and the Jarzynski equality are known results of non-equilibrium statistical mechanics; here we write out their proofs in order to apply them to the sector-summed ensemble of the lattice. Confinement follows from none of the inequalities of this chapter.

The order of this chapter
  1. Summary [Y3] — inserting a vortex slowly
  2. The setting — the driving procedure and the space of paths
  3. The Crooks involution and the driven identity — Lemma 1, Theorem 2, Corollary 3, Corollary 4, Theorem 5
  4. Two limits — inserting at once, inserting quasi-statically
  5. The formula of the cut measure — Proposition 6
  6. The flip-probability lemma and the flow lemma — Theorem 7, Corollary 8, Theorem 9
  7. Simultaneous flips, and the limits of this guarantee — Theorem 10, Table 1
  8. What cannot be said
  9. The table of five grades and the dependency graph — Table 2

01

Summary [Y3] — inserting a vortex slowly

  1. The insertion of 12-05 was an operation that flips at once the signs of the couplings on a vortex sheet. Its cost ΔS\Delta S is, for a thin vortex sheet, proportional to the number of plaquettes on the sheet (the area NT2N_T^2 of the T2T^2), and the factor of the bound tanh⁡(ΔS/2)\tanh(\Delta S/2) is almost 1.
  2. So we split the coupling into mm steps and flip it little by little, updating only the inside of the container by heat bath at each step. The surrounding fluctuations relax to fit the new coupling, so the work paid WW goes down.
  3. On the space of paths, the map "follow time backwards and flip the sector" is an involution, and the weight ratio is e−We^{-W} (the Crooks relation) Cited. Applying Identity 3 of 12-05 to this involution gives E[H]=E[Htanh⁡(W/2)]\mathbb E[H]=\mathbb E[H\tanh(W/2)] Proved here.
  4. From the same relation, independently of the number of steps mm of the procedure, E[e−W ∣ frame]=Z−/Z+\mathbb E[e^{-W}\,|\,\text{frame}]=Z_-/Z_+ (the Jarzynski equality) Cited. With 0 steps, W=ΔSW=\Delta S and we are back to 12-05.
  5. For any stationary kernel that flips the sector, the probability aa that the sector flips in one step is at most 1−θ1-\theta. In other words θ≤1−a\theta\le1-a (the flow lemma) Proved here. There is also a weaker form, a≤1−θ2a\le1-\theta^2 Proved here.
  6. With the frame fixed the containers are independent, so running kernels in all containers simultaneously gives E∏tθt≤P(no container flips)\mathbb E\prod_t\theta_t\le\mathbb P(\text{no container flips}) Proved here. The right-hand side is a quantity measurable by Monte Carlo, and it estimates an upper bound on the Wilson loop in the correct direction.
  7. However, for a one-step kernel aa levels off at about 12\tfrac12, and what this guarantee can say goes only up to θ≲12\theta\lesssim\tfrac12 Reading. It cannot be used to test the form of the band, θ≤e−cL2\theta\le e^{-cL^2}. Its proper use is a lower bound on the slab tension with the T2T^2 fixed.
02

The setting — the driving procedure and the space of paths

We use the sector-summed ensemble of 12-03 and 12-04. The weight on the SU(2)SU(2) link variables UU and the ±1\pm1 plaquette variables zz (coclosed) is w(U,z)=exp⁡(β2∑pzp tr Up)w(U,z)=\exp\bigl(\tfrac\beta2\sum_pz_p\,\mathrm{tr}\,U_p\bigr). For a plaquette pp of the (3,4)(3,4) plane of the slab TNT2×(Z/M)2T^2_{N_T}\times(\mathbb Z/M)^2, flipping all the zz of the vortex sheet Sp={p}×T2S_p=\{p\}\times T^2 flips the sign of the sector seen by a Wilson loop enclosing pp (12-04). We take a container Dp×T2D_p\times T^2 around pp (DpD_p is a disc in the (3,4)(3,4) plane), and call the variables outside the container the frame Φ\Phi.

Throughout this chapter we place the following three.

Interpolating the coupling. For λ∈[0,1]\lambda\in[0,1], let SλS_\lambda be the action in which only the couplings of the plaquettes on SpS_p are multiplied by 1−2λ1-2\lambda. S0=SS_0=S, and S1(x)=S(Rx)S_1(x)=S(Rx) (RR is the flip of zz on SpS_p). SλS_\lambda is gauge invariant.

Kernels. Let KλK_\lambda be a heat-bath transition kernel that moves only the links inside the container and is reversible (detailed balance) with respect to e−Sλe^{-S_\lambda}:

e−Sλ(x)Kλ(x,y)=e−Sλ(y)Kλ(y,x).(1)e^{-S_\lambda(x)}K_\lambda(x,y)=e^{-S_\lambda(y)}K_\lambda(y,x). \tag{1}

The forward procedure. λk=k/m\lambda_k=k/m (k=0,…,mk=0,\dots,m). Starting from a configuration x0x_0 in sector ++, at each step k=1,…,mk=1,\dots,m: "change the coupling λk−1→λk\lambda_{k-1}\to\lambda_k, add the resulting change of action to the work, then update xk−1→xkx_{k-1}\to x_k by KλkK_{\lambda_k}". The work is

W=∑k=1m[Sλk(xk−1)−Sλk−1(xk−1)].(2)W=\sum_{k=1}^m\bigl[S_{\lambda_k}(x_{k-1})-S_{\lambda_{k-1}}(x_{k-1})\bigr]. \tag{2}

RxmRx_m, obtained by finally applying RR, is a configuration in sector −-. From configurations in sector −-, the same is done by the reverse procedure mapped by RR (λ\lambda going 1→01\to0). If m=0m=0 there is no update, and W=S1(x0)−S0(x0)=ΔSW=S_1(x_0)-S_0(x_0)=\Delta S, the single insertion of 12-05.

The space of paths. Let Ω={(s,x0,…,xm)}\Omega=\{(s,x_0,\dots,x_m)\} (s=±s=\pm is the sector of the starting point), and set the weight of a path starting in sector ++ to be

W^(+,x0,…,xm)=e−S0(x0)∏k=1mKλk(xk−1,xk),(3)\hat W(+,x_0,\dots,x_m)=e^{-S_0(x_0)}\prod_{k=1}^mK_{\lambda_k}(x_{k-1},x_k), \tag{3}

The weight of a path starting in sector −- is defined by the product of the same form for the reverse procedure. The rows of the kernels sum to 1, so projecting the measure on Ω\Omega to the starting point gives back the original measure. Hence the expectation of a quantity determined by the starting point alone does not change when computed on Ω\Omega Proved here.

The involution. ι(+,x0,…,xm)=(−,Rxm,…,Rx0)\iota(+,x_0,\dots,x_m)=(-,Rx_m,\dots,Rx_0): follow the path backwards and flip the sector (and conversely for paths starting at −-). ι∘ι=id\iota\circ\iota=\mathrm{id}. By (1), paths of positive weight are mapped to paths of positive weight.

03

The Crooks involution and the driven identity

Lemma 1 (the Crooks relation)

Under (F)(W)(K) and (1), for every path ω\omega of positive weight,

W^(ιω)W^(ω)=e−W(ω),W∘ι=−W.(4)\frac{\hat W(\iota\omega)}{\hat W(\omega)}=e^{-W(\omega)},\qquad W\circ\iota=-W. \tag{4}

Cited A relation of this form is due to Crooks (source table); here we write out the standard computation adapted to the lattice procedure. Proof. Let ω=(+,x0,…,xm)\omega=(+,x_0,\dots,x_m). The weight of the reversed path, brought back to the coordinates of ++ using that SλS_\lambda maps to S1−λS_{1-\lambda} under RR, is e−S1(xm)∏k=1mKλk(xk,xk−1)e^{-S_1(x_m)}\prod_{k=1}^mK_{\lambda_k}(x_k,x_{k-1}). Replacing each factor by Kλk(xk−1,xk) eSλk(xk)−Sλk(xk−1)K_{\lambda_k}(x_{k-1},x_k)\,e^{S_{\lambda_k}(x_k)-S_{\lambda_k}(x_{k-1})} using (1), the exponent of the ratio is

S0(x0)−S1(xm)+∑k=1m[Sλk(xk)−Sλk(xk−1)]=∑k=1mSλk−1(xk−1)−∑k=1mSλk(xk−1)=−WS_0(x_0)-S_1(x_m)+\sum_{k=1}^m\bigl[S_{\lambda_k}(x_k)-S_{\lambda_k}(x_{k-1})\bigr]=\sum_{k=1}^mS_{\lambda_{k-1}}(x_{k-1})-\sum_{k=1}^mS_{\lambda_k}(x_{k-1})=-W

(shift the summation index by one, and let S0(x0)S_0(x_0) cancel against the k=1k=1 term and −S1(xm)-S_1(x_m) against the k=mk=m term). Computing (2) along the reversed path, the same terms appear with opposite signs, so W∘ι=−WW\circ\iota=-W. ∎

Lemma 1 says that "the involution with weight ratio e−ΔSe^{-\Delta S}" of (5) of 12-05 has been replaced, on the space of paths, by "an involution with weight ratio e−We^{-W}". So Identity 3 of 12-05 can be used as it is.

Theorem 2 (the driven identity)

Under (F)(W)(K) and (1), if H=h(Φ) σH=h(\Phi)\,\sigma (hh is a function of the frame alone, σ\sigma is the sign of the sector of the container), then

E[H]=EΩ[Htanh⁡(W/2)].(5)\mathbb E[H]=\mathbb E_\Omega\bigl[H\tanh(W/2)\bigr]. \tag{5}

Proved here Proof. Regard HH as a function on Ω\Omega evaluated at the starting point. The kernels and RR do not change the frame, so hh is invariant under ι\iota and σ\sigma flips, giving H∘ι=−HH\circ\iota=-H. For the weight W^\hat W and the involution ι\iota on Ω\Omega, the factor of (5) of 12-05 is (W^−W^∘ι)/(W^+W^∘ι)=(1−e−W)/(1+e−W)=tanh⁡(W/2)(\hat W-\hat W\circ\iota)/(\hat W+\hat W\circ\iota)=(1-e^{-W})/(1+e^{-W})=\tanh(W/2) by (4). From Identity 3 of 12-05, EΩ[H]=EΩ[Htanh⁡(W/2)]\mathbb E_\Omega[H]=\mathbb E_\Omega[H\tanh(W/2)]. The left-hand side is determined by the starting point alone, so it equals E[H]\mathbb E[H] (§02). ∎

Lean: the core is BoundedInsertion (Bounded.single) (hypotheses: a finite set, an involution, w>0w\gt0, HH odd. Conclusion: ∑wHt=∑wH\sum wHt=\sum wH) applied to the finite space of paths Ω\Omega (restricted to paths of positive weight). The construction of the space of paths and Lemma 1 are outside Lean.

Corollary 3 (the Jarzynski equality)

Under (F)(W)(K) and (1), independently of the number of steps mm,

E[e−W ∣ Φ, σ=+]=Z−(Φ)Z+(Φ),(6)\mathbb E\bigl[e^{-W}\,\big|\,\Phi,\ \sigma=+\bigr]=\frac{Z_-(\Phi)}{Z_+(\Phi)}, \tag{6}

Here Z±(Φ)Z_\pm(\Phi) is the partition function of sector ±\pm with the frame Φ\Phi fixed.

Cited Due to Jarzynski (source table). Proof. From (4), ∑ωW^(ω)e−W(ω)=∑ωW^(ιω)\sum_\omega\hat W(\omega)e^{-W(\omega)}=\sum_\omega\hat W(\iota\omega). The right-hand side is the total weight of the paths starting in sector −-, which is Z−(Φ)Z_-(\Phi) since the rows of the kernels sum to 1. Dividing the left-hand side by the total weight Z+(Φ)Z_+(\Phi) of paths in sector ++ gives (6). ∎

(6) is a quantity that does not depend on the speed of the procedure (the number of steps mm), and can be used as a numerical check. On the other hand, the average of e−We^{-W} is dominated by rare small WW, so with few samples the estimate fluctuates strongly (that is why some rows of the table in 12-08 have negative −ln⁡⟨e−W⟩-\ln\langle e^{-W}\rangle).

Corollary 4 (the acceptance rate)

In the setting of Theorem 2, 1−EΩ[tanh⁡(W/2)]=2 EΩ[1/(1+eW)]1-\mathbb E_\Omega[\tanh(W/2)]=2\,\mathbb E_\Omega\bigl[1/(1+e^{W})\bigr]. The right-hand side is twice the mean acceptance rate of a move that accepts the endpoint of a driven path by the Barker-type rule.

Proved here One just takes the expectation of 1−tanh⁡(W/2)=2/(1+eW)1-\tanh(W/2)=2/(1+e^{W}). It is Lemma 4 of 12-05 with ΔS\Delta S replaced by WW.

Many cells. For each of mutually separated cells cc (containers Dc×T2D_c\times T^2), choose a position PcP_c uniformly and independently from a set of positions PP (a non-empty finite set), and perform driven insertion at the chosen position. The path of each cell reads only its own container and its surroundings in the starting configuration.

Theorem 5 (a driven bound for many cells)

Under (F)(W)(K) and (1), if the containers are separated from each other (no plaquette straddles the insides of two containers), H=h(Φ)∏cσcH=h(\Phi)\prod_c\sigma_c and ∣H∣≤1|H|\le1, then

∣E[H]∣ ≤ E[∏c1∣P∣∑p∈PE[ ∣tanh⁡(Wc,p/2)∣ ∣ x0]].(7)|\mathbb E[H]|\ \le\ \mathbb E\Bigl[\prod_c\frac1{|P|}\sum_{p\in P}\mathbb E\bigl[\,|\tanh(W_{c,p}/2)|\ \big|\ x_0\bigr]\Bigr]. \tag{7}

Proved here Proof. Build the enlarged space consisting of the starting point x0x_0, the choice of positions (Pc)(P_c) and the path of each cell. The involution ιd\iota_d of cell dd follows the path of cell dd backwards and replaces the inside of container dd of the starting point by the flip of the endpoint of the path. Since the containers are separated, the weight with the frame fixed splits into a product over containers, and ιd\iota_d does not change the path weights or works of other cells. So the weight ratio of ιd\iota_d is e−Wde^{-W_d}, and the factors tanh⁡(Wc/2)\tanh(W_c/2) of the other cells (c≠dc\ne d) do not move under ιd\iota_d. The proof of Theorem 5 of 12-05 (the induction adding cells one at a time) goes through as it is, giving E[H]=E[H∏ctanh⁡(Wc,Pc/2)]\mathbb E[H]=\mathbb E[H\prod_c\tanh(W_{c,P_c}/2)]. Taking absolute values, and using that with the starting point fixed the paths of the cells and the choices of positions are independent, gives (7). ∎

Unlike Theorem 5 of 12-05, (7) has the absolute value inside the average over positions. It is weaker by the amount that it does not use cancellation of signs between positions.

04

Two limits — inserting at once, inserting quasi-statically

Zero steps. At m=0m=0, W=ΔSW=\Delta S, and Theorem 2 is Identity 3 of 12-05 Proved here. For thin vortices ΔS\Delta S is proportional to the area of the T2T^2, and tanh⁡(W/2)\tanh(W/2) is almost 1.

The quasi-static limit. As m→∞m\to\infty (driving slowly), WW is expected to approach the conditional free energy of the container with the frame fixed, ΔFD(Φ)=ln⁡(Z+(Φ)/Z−(Φ))\Delta F_D(\Phi)=\ln\bigl(Z_+(\Phi)/Z_-(\Phi)\bigr) Reading (physics; the standard estimate of thermodynamic integration, which requires the kernel to mix well enough at each λ\lambda. Not proved in this book). The factor of Theorem 2 then becomes tanh⁡(ΔFD/2)=θD(Φ)\tanh(\Delta F_D/2)=\theta_D(\Phi), and we return to the container identity of 12-03 (the Mack–Petkova identity). The reading is that the length mm of the procedure connects the crude bound of inserting at once with the exact conditional free energy.

The numerical picture. For SU(2)SU(2), β=2.3\beta=2.3, the slab 2×2×8×82\times2\times8\times8, twist n12=1n_{12}=1, disc radius 2, 6 configurations × 4 positions, the mean work at m=0,4,16m=0,4,16 steps was 10.7, 6.5, 2.9, and the mean of tanh⁡(W/2)\tanh(W/2) was 0.990, 0.968, 0.688 Reading. Increasing the number of steps lowers the work and moves the factor away from 1. The records for other β\beta, NTN_T and container radii are collected in 12-08. If the container is smaller than the vortex, the work does not come down fully even as the number of steps increases (same table).

05

The formula of the cut measure

Inside the container D×T2D\times T^2, let μcut\mu_{\rm cut} be the measure (with the frame Φ\Phi fixed) in which only the plaquette terms on the flip sheet S={p0}×T2S=\{p_0\}\times T^2 are removed from the action, and set X:=∑p∈Szp tr UpX:=\sum_{p\in S}z_p\,\mathrm{tr}\,U_p (zz is the representative of sector ++). The weight on the sheet is e(β/2)zptrUpe^{(\beta/2)z_p\mathrm{tr}U_p}, and in sector −- the zz on SS are flipped, so

Proposition 6 (the formula of the cut measure) Z±(Φ)Zcut(Φ)=Ecut[e±βX/2],θ(Φ)=∣Ecut[sinh⁡(βX/2)]∣Ecut[cosh⁡(βX/2)].(8)\frac{Z_\pm(\Phi)}{Z_{\rm cut}(\Phi)}=\mathbb E_{\rm cut}\bigl[e^{\pm\beta X/2}\bigr],\qquad \theta(\Phi)=\frac{\bigl|\mathbb E_{\rm cut}[\sinh(\beta X/2)]\bigr|}{\mathbb E_{\rm cut}[\cosh(\beta X/2)]}. \tag{8}

Proved here The first formula is from the definition; the second just puts the first into θ=∣Z+−Z−∣/(Z++Z−)\theta=|Z_+-Z_-|/(Z_++Z_-) and uses ea∓e−a=2sinh⁡a, 2cosh⁡ae^{a}\mp e^{-a}=2\sinh a,\ 2\cosh a.

Lean FlipLemma (FlipLemma.cut_formula) (hypotheses: real-valued weights vv on a finite set (non-negativity not used either), real-valued XX, a real bb. Conclusion: ∑vebX/2−∑ve−bX/2=2∑vsinh⁡(bX/2)\sum ve^{bX/2}-\sum ve^{-bX/2}=2\sum v\sinh(bX/2), and the equality in sum form for cosh⁡\cosh). What is guaranteed is only the algebra of sums.

μcut\mu_{\rm cut} has no sectors. θ(Φ)\theta(\Phi) can be read as "the strength with which the information of the frame reaches the sheet, crossing the cut measure over the size of the container". Driven insertion can also be set up in the symmetric form +→cut measure←−+\to\text{cut measure}\leftarrow- (compatible with the involution of Lemma 1).

06

The flip-probability lemma and the flow lemma

Let μΦ\mu_\Phi be the conditional measure with the frame Φ\Phi fixed, σ∈{±1}\sigma\in\{\pm1\} the sign of the sector of the container, mΦ=E[σ ∣ Φ]m_\Phi=\mathbb E[\sigma\,|\,\Phi], θ(Φ)=∣mΦ∣\theta(\Phi)=|m_\Phi|. Let KK be a Markov kernel that moves only the inside of the container, and (X,X′)∼μΦ⊗K(X,X')\sim\mu_\Phi\otimes K (XX drawn from μΦ\mu_\Phi and advanced one step by KK gives X′X').

Theorem 7 (the flip-probability lemma)

If KK is stationary with respect to μΦ\mu_\Phi (∑xμΦ(x)K(x,y)=μΦ(y)\sum_x\mu_\Phi(x)K(x,y)=\mu_\Phi(y)), then

P(σ(X′)≠σ(X)) ≤ 1−mΦ2=1−θ(Φ)2.(9)\mathbb P\bigl(\sigma(X')\ne\sigma(X)\bigr)\ \le\ 1-m_\Phi^2=1-\theta(\Phi)^2. \tag{9}

Proved here Proof. Since σ=±1\sigma=\pm1, P(σ(X′)≠σ(X))=∑x,yμΦ(x)K(x,y)(σ(x)−σ(y))2/4\mathbb P(\sigma(X')\ne\sigma(X))=\sum_{x,y}\mu_\Phi(x)K(x,y)(\sigma(x)-\sigma(y))^2/4. Bound it above by (a−b)2≤2(a−m)2+2(b−m)2(a-b)^2\le2(a-m)^2+2(b-m)^2, and use that the rows sum to 1 and stationarity to turn both sums into ∑xμΦ(x)(σ(x)−m)2=1−m2\sum_x\mu_\Phi(x)(\sigma(x)-m)^2=1-m^2, giving 12(1−m2)+12(1−m2)\tfrac12(1-m^2)+\tfrac12(1-m^2). ∎ Reversibility is not used.

Lean FlipLemma (FlipLemma.flip_le) (hypotheses: a finite set, w≥0w\ge0, ∑w=1\sum w=1, K≥0K\ge0, rows sum to 1, stationarity ∑xwxKxy=wy\sum_xw_xK_{xy}=w_y, σ2=1\sigma^2=1. Conclusion: ∑x,ywxKxy(σx−σy)2/4≤1−(∑wσ)2\sum_{x,y}w_xK_{xy}(\sigma_x-\sigma_y)^2/4\le1-(\sum w\sigma)^2).

Corollary 8 (positive kernels)

If KK is reversible with respect to μΦ\mu_\Phi and positive as an operator on L2(μΦ)L^2(\mu_\Phi) (⟨f,Kf⟩≥0\langle f,Kf\rangle\ge0), the right-hand side of (9) drops to (1−θ2)/2(1-\theta^2)/2.

Proved here Proof. P(flip)=(1−⟨σ,Kσ⟩)/2\mathbb P(\text{flip})=(1-\langle\sigma,K\sigma\rangle)/2 (inner product in μΦ\mu_\Phi). Setting σ~=σ−m\tilde\sigma=\sigma-m, since the rows of KK sum to 1 and it is reversible, ⟨σ,Kσ⟩=⟨σ~,Kσ~⟩+m2≥m2\langle\sigma,K\sigma\rangle=\langle\tilde\sigma,K\tilde\sigma\rangle+m^2\ge m^2. ∎ This corollary has no Lean check.

The next form is sharper, and is the one mainly used in this chapter.

Theorem 9 (the flow lemma)

In the setting of Theorem 7 (stationary KK), letting a(Φ)a(\Phi) be the probability that the sector flips in one step,

a(Φ) ≤ 1−θ(Φ),that isθ(Φ) ≤ 1−a(Φ).(10)a(\Phi)\ \le\ 1-\theta(\Phi),\qquad\text{that is}\qquad \theta(\Phi)\ \le\ 1-a(\Phi). \tag{10}

Proved here Proof. Take the flow A=P(σ(X)=+,σ(X′)=−)A=\mathbb P(\sigma(X)=+,\sigma(X')=-) from +→−+\to- and the flow BB from −→+-\to+. By stationarity the distribution of the sector of X′X' is the same as that of XX, so A=BA=B. Also A≤P(σ(X)=+)=(1+m)/2A\le\mathbb P(\sigma(X)=+)=(1+m)/2, B≤(1−m)/2B\le(1-m)/2. Hence a=A+B=2A≤2min⁡((1+m)/2,(1−m)/2)=1−∣m∣a=A+B=2A\le2\min\bigl((1+m)/2,(1-m)/2\bigr)=1-|m|. ∎ Since θ≤1\theta\le1, 1−θ≤1−θ21-\theta\le1-\theta^2, and (10) is a sharper form than (9).

Lean FluxLemma (FluxLemma.flip_le_one_sub_abs) (hypotheses: a finite set, w≥0w\ge0, ∑w=1\sum w=1, K≥0K\ge0, rows sum to 1, stationarity, the values of σ\sigma are 11 or −1-1. Conclusion: ∑x,ywxKxy(σx−σy)2/4≤1−∣∑wσ∣\sum_{x,y}w_xK_{xy}(\sigma_x-\sigma_y)^2/4\le1-|\sum w\sigma|).

How to use it. If one can build a stationary kernel that flips the sector with flip probability at least cc, then θ≤1−c\theta\le1-c. A kernel that proposes a driven insertion and accepts the endpoint with probability min⁡(1,e−W)\min(1,e^{-W}) is reversible (hence stationary) with respect to μΦ\mu_\Phi by Lemma 1, and its flip probability is the acceptance rate. The acceptance rate is at least P(W≤w0) e−w0\mathbb P(W\le w_0)\,e^{-w_0}, so there is no need to control the average of e−We^{-W}; it is enough that "cheap work occurs with positive probability" Proved here.

07

Simultaneous flips, and the limits of this guarantee

Take a finite set SS of mutually separated containers, and let θt(Φ)\theta_t(\Phi) be the bias of the sector of each container t∈St\in S (the frame Φ\Phi is the variables outside all containers).

Theorem 10 (simultaneous flips)

Under (F)(W), if the containers are separated from each other, and for each container tt one takes a stationary kernel KtK_t that moves only the inside of that container and moves all containers one step simultaneously, then

E[∏t∈Sθt(Φ)] ≤ P(S : no container flips).(11)\mathbb E\Bigl[\prod_{t\in S}\theta_t(\Phi)\Bigr]\ \le\ \mathbb P\bigl(S\ \text{: no container flips}\bigr). \tag{11}

Proved here Proof. With the frame fixed, the insides of the containers are conditionally independent (the conditional independence of 12-03), and the kernels also move independently per container, so P(none flips ∣ Φ)=∏t(1−at(Φ))\mathbb P(\text{none flips}\,|\,\Phi)=\prod_t(1-a_t(\Phi)). By Theorem 9 each factor is at least θt(Φ)\theta_t(\Phi). Take expectations. ∎

The container identity of 12-03 had the form ∣⟨W(C)⟩∣≤E∏tθt|\langle W(C)\rangle|\le\mathbb E\prod_t\theta_t (for the containers inside CC). Together with (11), an upper bound on the Wilson loop is bounded in the correct direction by a quantity measurable by Monte Carlo, P(none flips)\mathbb P(\text{none flips}) Proved here.

Limits (an important caution). What (10) gives is θ≤1−a\theta\le1-a. The flip probability aa of a one-step kernel (a kernel that proposes one driven insertion and decides whether to accept it) was at most 0.46 in the range measured, and in the judgement of the record it levels off at about 12\tfrac12 Reading (Tables 1, 2, 8 and 9 of 12-08). So what can be said for containers of size LL is θ≤θ0\theta\le\theta_0 with θ0∼12\theta_0\sim\tfrac12 at best. Even if this held uniformly in LL, all that follows is

σ ≥ ln⁡(1/θ0)L2 ⟶ 0(L→∞)(12)\sigma\ \ge\ \frac{\ln(1/\theta_0)}{L^2}\ \longrightarrow\ 0\qquad(L\to\infty) \tag{12}

and this is exactly the "weak form" of 13-01 (a form that U(1)U(1) also satisfies) Proved here. To show the correct form of the band θ(L,L)≤e−cL2\theta(L,L)\le e^{-cL^2} by (10), one needs a kernel with a≥1−e−cL2a\ge1-e^{-cL^2}, that is, a kernel that flips the sector almost surely Proved here (a rewriting of (10)). There is no prospect of building that with a one-step kernel.

Therefore, the guarantee from simultaneous flips cannot be used as a numerical test of the crossover band. There is a measured record of this tool as a numerical picture of the band, but that positioning has been withdrawn (12-08 §06). Its proper uses are a lower bound on the slab tension with the size LL of the T2T^2 fixed, and an estimate from above of the chessboard density κcb\kappa_{cb} (13-05).

Table 1 What the bounds of this chapter can and cannot say (conditions (F)(W)(K))
BoundFormWhat can be saidWhat cannot be said
Driven identity (Theorems 2 and 5)E[H]=E[Htanh⁡(W/2)]\mathbb E[H]=\mathbb E[H\tanh(W/2)]Increasing the number of steps can move the factor away from 1 (numerics)That the upper bound on the factor is uniform in LL
Jarzynski (Corollary 3)E[e−W]=Z−/Z+\mathbb E[e^{-W}]=Z_-/Z_+A numerical checkPrecision with few samples (dominated by rare events)
Flip probability (Theorem 7)a≤1−θ2a\le1-\theta^2θ≤1−a\theta\le\sqrt{1-a}— (weaker than Theorem 9)
Flow lemma (Theorem 9)θ≤1−a\theta\le1-aA lower bound on the slab tension with the T2T^2 fixedFor a one-step kernel only up to θ0∼12\theta_0\sim\tfrac12. The form of the band e−cL2e^{-cL^2} does not follow
Simultaneous flips (Theorem 10)E∏θ≤P(no flip)\mathbb E\prod\theta\le\mathbb P(\text{no flip})An estimator in the correct direction for an upper bound on the Wilson loopA numerical test of the band (withdrawn)
08

What cannot be said

(a) Confinement. None of the identities and inequalities of this chapter implies confinement. One would need the factors of Theorems 2 and 5 to stay away from 1 uniformly in LL and the lattice spacing, or a kernel with aa close to 1, and this book shows neither.

(b) The quasi-static limit. That W→ΔFDW\to\Delta F_D as m→∞m\to\infty is the estimate of §04; this book has no proof of it, including bounds on how the kernels mix.

(c) The continuous configuration space. All theorems are finite versions under (F). The version on the Haar measure of SU(2)SU(2) needs the reversibility of the heat-bath kernels and the measure on the space of paths to be rewritten for the continuous case, and is outside Lean.

(d) The levelling off of one-step kernels. "aa levels off at about 12\tfrac12" is a measurement and a judgement of the record, not a theorem. The conclusion that only up to θ0∼12\theta_0\sim\tfrac12 can be said rests on this reading. Conversely, if there were a kernel with aa close to 1, (10) could be used as it is, but no construction of one is known.

(e) Novelty. The Crooks relation and the Jarzynski equality are known, and the application to the sector-summed ensemble and Theorems 7, 9 and 10 are elementary. Techniques that raise the acceptance rate with non-equilibrium proposals that flip a sector are known in the Monte Carlo literature as tempered transitions and non-equilibrium candidate methods (not yet checked). No novelty is claimed for the results of this chapter.

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, (K) kernels that move only the inside of the container)
RowStatement (one line)GradeEvidenceScopeMachine checking
[01]The marginal of the starting point on the space of paths is the original measureProved here§02(F)(W)(K), rows of the kernels sum to 1—
[02]Lemma 1: W^∘ι/W^=e−W\hat W\circ\iota/\hat W=e^{-W}, W∘ι=−WW\circ\iota=-WCited§03, Crooks(F)(W)(K), detailed balance (1)—
[03]Theorem 2: E[H]=EΩ[Htanh⁡(W/2)]\mathbb E[H]=\mathbb E_\Omega[H\tanh(W/2)]Proved here§03(F)(W)(K), (1), H=h(Φ)σH=h(\Phi)\sigmaBoundedInsertion (Bounded.single) applied to Ω\Omega (hypotheses: finite, involution, w>0w\gt0, HH odd. The construction of Ω\Omega is outside Lean)
[04]Corollary 3: the Jarzynski equality (independent of the number of steps)Cited§03, Jarzynski(F)(W)(K), (1), frame fixed—
[05]Corollary 4: 1−E[tanh⁡(W/2)]=2×1-\mathbb E[\tanh(W/2)]=2\times acceptance rateProved here§03The setting of [03]—
[06]Theorem 5: (7) for many cellsProved here§03Containers separated, ∣H∣≤1|H|\le1, positions chosen independently and uniformly— (the type of induction is BoundedInsertion (Bounded.averaged) of 12-05)
[07]W→ΔFD(Φ)W\to\Delta F_D(\Phi) as m→∞m\to\inftyReading (physics)§04The kernels mix well enough at each λ\lambda—
[08]The work goes down with the number of steps (β=2.3\beta=2.3, 2×2×8×82\times2\times8\times8)Reading§04, 12-08SU(2)SU(2), 6 configurations × 4 positions—
[09]Proposition 6: the formula of the cut measure (8)Proved here§05Frame fixed, terms of the flip sheet removedFlipLemma (FlipLemma.cut_formula) (hypotheses: a finite set, real-valued vv, XX, bb)
[10]Theorem 7: flip probability ≤1−θ2\le1-\theta^2Proved here§06Stationary kernels (reversibility not needed)FlipLemma (FlipLemma.flip_le) (hypotheses: w≥0w\ge0, ∑w=1\sum w=1, K≥0K\ge0, rows sum to 1, stationary, σ2=1\sigma^2=1)
[11]Corollary 8: (1−θ2)/2(1-\theta^2)/2 for positive kernelsProved here§06Reversible and a positive operator—
[12]Theorem 9: the flow lemma θ≤1−a\theta\le1-aProved here§06Stationary kernels (reversibility not needed)FluxLemma (FluxLemma.flip_le_one_sub_abs) (hypotheses: w≥0w\ge0, ∑w=1\sum w=1, K≥0K\ge0, rows sum to 1, stationary, σ=±1\sigma=\pm1)
[13]The kernel with acceptance min⁡(1,e−W)\min(1,e^{-W}) is stationary, acceptance rate ≥P(W≤w0)e−w0\ge\mathbb P(W\le w_0)e^{-w_0}Proved here§06The setting of [02]—
[14]Theorem 10: E∏θt≤P(no flip)\mathbb E\prod\theta_t\le\mathbb P(\text{no flip})Proved here§07Containers separated, a stationary kernel per container— (the core is [12])
[15]The aa of a one-step kernel levels off at about 12\tfrac12Reading§07, 12-08The range of β\beta, NTN_T and containers measured—
[16]What follows from (10) is σ≥ln⁡(1/θ0)/L2\sigma\ge\ln(1/\theta_0)/L^2 (the weak form). The form of the band needs a≥1−e−cL2a\ge1-e^{-cL^2}Proved here§07When only θ≤1−a\theta\le1-a is used—

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). flip_le and cut_formula are in the file FlipLemma, and flip_le_one_sub_abs is in the file FluxLemma.

Dependency graph (the numbers of premises are smaller than the number of the conclusion):

[01] PRV MARG    marginal of start on paths = original measure   rows sum to 1
[02] CIT CROOKS  weight ratio e^(−W), W∘ι = −W                   detailed balance (1)
[03] PRV DRIVEN  E[H] = E[H tanh(W/2)] ⟸ [01][02]               Lean Bounded.single on Ω
[04] CIT JARZ    E[e^(−W) | frame] = Z₋/Z₊ ⟸ [02]
[05] PRV ACC     1 − E[tanh(W/2)] = 2 × acceptance ⟸ [03]
[06] PRV MULTI   many cells (7) ⟸ [02]                           containers separated
[07] RDG QSTAT   m → ∞ gives W → ΔF_D (physics) ⟸ [04]
[08] RDG NUM     work goes down with the number of steps          β = 2.3, 2×2×8×8
[09] PRV CUT     formula of the cut measure                      Lean cut_formula
[10] PRV FLIP    flip probability ≤ 1 − θ²                       Lean flip_le
[11] PRV POS     (1 − θ²)/2 for positive kernels ⟸ [10]
[12] PRV FLUX    θ ≤ 1 − a                                       Lean flip_le_one_sub_abs
[13] PRV MH      min(1, e^(−W)) kernel stationary, lower bound ⟸ [02]
[14] PRV SIMUL   E∏θ ≤ P(no flip) ⟸ [12]                         containers separated
[15] RDG HALF    a of one-step kernels levels off at about ½     range measured
[16] PRV WEAK    only the weak form; band needs a ≥ 1 − e^(−cL²) ⟸ [12]

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. This chapter has no assumption rows. The reading [15] is not made a premise of [16] ([16] is a rewriting that follows from θ≤1−a\theta\le1-a alone, and [15] is a judgement of how far it can be used). There is 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)(K), the driven identity E[H]=E[Htanh⁡(W/2)]\mathbb E[H]=\mathbb E[H\tanh(W/2)] and its form for many cellsAn upper bound on the factor tanh⁡(W/2)\tanh(W/2) uniform in LL and the lattice spacing
Cited The Crooks relation and the Jarzynski equality (written out for the lattice procedure)A proof of the quasi-static limit W→ΔFDW\to\Delta F_D
Proved here For stationary kernels, a≤1−θ2a\le1-\theta^2, θ≤1−a\theta\le1-a, and simultaneous flips E∏θ≤P(no flip)\mathbb E\prod\theta\le\mathbb P(\text{no flip})A construction of a kernel with aa close to 1. The form of the band θ≤e−cL2\theta\le e^{-cL^2}
Reading For one-step kernels only up to θ0∼12\theta_0\sim\tfrac12 (cannot be used to test the band)The same theorems on the continuous configuration space (outside Lean)

Sources and reproduction

ItemKindSource / tools
The Crooks relation (path weight ratio e−We^{-W})CitedG. E. Crooks, “The entropy production fluctuation theorem and the nonequilibrium work relation for free energy differences”, Phys. Rev. E 60 (1999) 2721, arXiv:cond-mat/9901352 (bibliographic data checked on the arXiv page. The original source of the Markov-chain form not checked)
The Jarzynski equalityCitedC. Jarzynski, “A nonequilibrium equality for free energy differences”, Phys. Rev. Lett. 78 (1997) 2690, arXiv:cond-mat/9610209 (bibliographic data checked on the arXiv page)
Theorem 2, Corollary 4, Theorem 5, Proposition 6, Theorem 7, Corollary 8, Theorem 9, Theorem 10Proved hereProofs in the text, §03–§07. Theorem 2 has the same content as the driven identity 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). Theorem 9 has the same content as the flux bound of Paper 2 of A-07
The container identityCited (indirect)G. Mack, V. B. Petkova (as in 12-03)
Tempered transitions, non-equilibrium candidate methodsComparison not doneThe Monte Carlo literature (bibliographic data not checked)
Numerics (§04)ReadingThe same measurement as the first row of Table 1 of 12-08
LeanLeanFlipLemma (FlipLemma.flip_le, FlipLemma.cut_formula), FluxLemma (FluxLemma.flip_le_one_sub_abs), BoundedInsertion (Bounded.single). What the bundles guarantee is only the algebra of finite sums

Words used in this chapter — driven insertion, the number of steps mm, the work WW, the space of paths Ω\Omega, the Crooks involution ι\iota, quasi-static, the cut measure, the flip probability, the flow lemma, simultaneous flips. Their meanings are in A-02 Glossary (the words of Part 12 are to be added).

Next chapter to read: 12-07 Why fixed maps fail — why driven insertion is cheap and a fixed map applied at once is expensive, explained at the one-loop level as the difference of "whether the shape of the fluctuations is changed".

← 12-05 Vortex-insertion identitiesContents12-07 Why fixed maps fail →

Revised 2026-10-15: first version.