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
Driven insertion and the flow lemma
What this chapter shows — In 12-05 we obtained from a map that inserts a vortex at once. For thin vortices the cost of insertion 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 ( is the work along the path) (the Crooks relation); (2) that from this follow (the driven identity) and the Jarzynski equality; (3) for the probability that one step of a stationary kernel flips the sector, (the flow lemma), and flip probability ; and (4) that moving containers simultaneously gives . Finally we record that for a one-step kernel this guarantee reaches only , and cannot be used to test the crossover band (13-01).
Prerequisite chapters — 12-03 (containers, frame, the bias of the sector , the container identity), 12-05 (Identity 3, Lemma 4, Theorem 5), 13-01 (the correct form of the band ). 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 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.
- Summary [Y3] — inserting a vortex slowly
- The setting — the driving procedure and the space of paths
- The Crooks involution and the driven identity — Lemma 1, Theorem 2, Corollary 3, Corollary 4, Theorem 5
- Two limits — inserting at once, inserting quasi-statically
- The formula of the cut measure — Proposition 6
- The flip-probability lemma and the flow lemma — Theorem 7, Corollary 8, Theorem 9
- Simultaneous flips, and the limits of this guarantee — Theorem 10, Table 1
- What cannot be said
- The table of five grades and the dependency graph — Table 2
Summary [Y3] — inserting a vortex slowly
- The insertion of 12-05 was an operation that flips at once the signs of the couplings on a vortex sheet. Its cost is, for a thin vortex sheet, proportional to the number of plaquettes on the sheet (the area of the ), and the factor of the bound is almost 1.
- So we split the coupling into 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 goes down.
- On the space of paths, the map "follow time backwards and flip the sector" is an involution, and the weight ratio is (the Crooks relation) Cited. Applying Identity 3 of 12-05 to this involution gives Proved here.
- From the same relation, independently of the number of steps of the procedure, (the Jarzynski equality) Cited. With 0 steps, and we are back to 12-05.
- For any stationary kernel that flips the sector, the probability that the sector flips in one step is at most . In other words (the flow lemma) Proved here. There is also a weaker form, Proved here.
- With the frame fixed the containers are independent, so running kernels in all containers simultaneously gives 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.
- However, for a one-step kernel levels off at about , and what this guarantee can say goes only up to Reading. It cannot be used to test the form of the band, . Its proper use is a lower bound on the slab tension with the fixed.
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 link variables and the plaquette variables (coclosed) is . For a plaquette of the plane of the slab , flipping all the of the vortex sheet flips the sign of the sector seen by a Wilson loop enclosing (12-04). We take a container around ( is a disc in the plane), and call the variables outside the container the frame .
Throughout this chapter we place the following three.
- (F) A finite configuration space . The continuous case is as noted in 12-05 §02.
- (W) Positive weights .
- (K) Kernels that move only the inside of the container: the kernels below update only the variables inside the container and do not change the frame.
Interpolating the coupling. For , let be the action in which only the couplings of the plaquettes on are multiplied by . , and ( is the flip of on ). is gauge invariant.
Kernels. Let be a heat-bath transition kernel that moves only the links inside the container and is reversible (detailed balance) with respect to :
The forward procedure. (). Starting from a configuration in sector , at each step : "change the coupling , add the resulting change of action to the work, then update by ". The work is
, obtained by finally applying , is a configuration in sector . From configurations in sector , the same is done by the reverse procedure mapped by ( going ). If there is no update, and , the single insertion of 12-05.
The space of paths. Let ( is the sector of the starting point), and set the weight of a path starting in sector to be
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 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 Proved here.
The involution. : follow the path backwards and flip the sector (and conversely for paths starting at ). . By (1), paths of positive weight are mapped to paths of positive weight.
The Crooks involution and the driven identity
Under (F)(W)(K) and (1), for every path of positive weight,
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 . The weight of the reversed path, brought back to the coordinates of using that maps to under , is . Replacing each factor by using (1), the exponent of the ratio is
(shift the summation index by one, and let cancel against the term and against the term). Computing (2) along the reversed path, the same terms appear with opposite signs, so . ∎
Lemma 1 says that "the involution with weight ratio " of (5) of 12-05 has been replaced, on the space of paths, by "an involution with weight ratio ". So Identity 3 of 12-05 can be used as it is.
Under (F)(W)(K) and (1), if ( is a function of the frame alone, is the sign of the sector of the container), then
Proved here Proof. Regard as a function on evaluated at the starting point. The kernels and do not change the frame, so is invariant under and flips, giving . For the weight and the involution on , the factor of (5) of 12-05 is by (4). From Identity 3 of 12-05, . The left-hand side is determined by the starting point alone, so it equals (§02). ∎
Lean: the core is BoundedInsertion (Bounded.single) (hypotheses: a finite set, an involution, , odd. Conclusion: ) applied to the finite space of paths (restricted to paths of positive weight). The construction of the space of paths and Lemma 1 are outside Lean.
Under (F)(W)(K) and (1), independently of the number of steps ,
Here is the partition function of sector with the frame fixed.
Cited Due to Jarzynski (source table). Proof. From (4), . The right-hand side is the total weight of the paths starting in sector , which is since the rows of the kernels sum to 1. Dividing the left-hand side by the total weight of paths in sector gives (6). ∎
(6) is a quantity that does not depend on the speed of the procedure (the number of steps ), and can be used as a numerical check. On the other hand, the average of is dominated by rare small , so with few samples the estimate fluctuates strongly (that is why some rows of the table in 12-08 have negative ).
In the setting of Theorem 2, . 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 . It is Lemma 4 of 12-05 with replaced by .
Many cells. For each of mutually separated cells (containers ), choose a position uniformly and independently from a set of positions (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.
Under (F)(W)(K) and (1), if the containers are separated from each other (no plaquette straddles the insides of two containers), and , then
Proved here Proof. Build the enlarged space consisting of the starting point , the choice of positions and the path of each cell. The involution of cell follows the path of cell backwards and replaces the inside of container 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 does not change the path weights or works of other cells. So the weight ratio of is , and the factors of the other cells () do not move under . The proof of Theorem 5 of 12-05 (the induction adding cells one at a time) goes through as it is, giving . 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.
Two limits — inserting at once, inserting quasi-statically
Zero steps. At , , and Theorem 2 is Identity 3 of 12-05 Proved here. For thin vortices is proportional to the area of the , and is almost 1.
The quasi-static limit. As (driving slowly), is expected to approach the conditional free energy of the container with the frame fixed, Reading (physics; the standard estimate of thermodynamic integration, which requires the kernel to mix well enough at each . Not proved in this book). The factor of Theorem 2 then becomes , and we return to the container identity of 12-03 (the Mack–Petkova identity). The reading is that the length of the procedure connects the crude bound of inserting at once with the exact conditional free energy.
The numerical picture. For , , the slab , twist , disc radius 2, 6 configurations × 4 positions, the mean work at steps was 10.7, 6.5, 2.9, and the mean of 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 , 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).
The formula of the cut measure
Inside the container , let be the measure (with the frame fixed) in which only the plaquette terms on the flip sheet are removed from the action, and set ( is the representative of sector ). The weight on the sheet is , and in sector the on are flipped, so
Proved here The first formula is from the definition; the second just puts the first into and uses .
Lean FlipLemma (FlipLemma.cut_formula) (hypotheses: real-valued weights on a finite set (non-negativity not used either), real-valued , a real . Conclusion: , and the equality in sum form for ). What is guaranteed is only the algebra of sums.
has no sectors. 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 (compatible with the involution of Lemma 1).
The flip-probability lemma and the flow lemma
Let be the conditional measure with the frame fixed, the sign of the sector of the container, , . Let be a Markov kernel that moves only the inside of the container, and ( drawn from and advanced one step by gives ).
If is stationary with respect to (), then
Proved here Proof. Since , . Bound it above by , and use that the rows sum to 1 and stationarity to turn both sums into , giving . ∎ Reversibility is not used.
Lean FlipLemma (FlipLemma.flip_le) (hypotheses: a finite set, , , , rows sum to 1, stationarity , . Conclusion: ).
If is reversible with respect to and positive as an operator on (), the right-hand side of (9) drops to .
Proved here Proof. (inner product in ). Setting , since the rows of sum to 1 and it is reversible, . ∎ This corollary has no Lean check.
The next form is sharper, and is the one mainly used in this chapter.
In the setting of Theorem 7 (stationary ), letting be the probability that the sector flips in one step,
Proved here Proof. Take the flow from and the flow from . By stationarity the distribution of the sector of is the same as that of , so . Also , . Hence . ∎ Since , , and (10) is a sharper form than (9).
Lean FluxLemma (FluxLemma.flip_le_one_sub_abs) (hypotheses: a finite set, , , , rows sum to 1, stationarity, the values of are or . Conclusion: ).
How to use it. If one can build a stationary kernel that flips the sector with flip probability at least , then . A kernel that proposes a driven insertion and accepts the endpoint with probability is reversible (hence stationary) with respect to by Lemma 1, and its flip probability is the acceptance rate. The acceptance rate is at least , so there is no need to control the average of ; it is enough that "cheap work occurs with positive probability" Proved here.
Simultaneous flips, and the limits of this guarantee
Take a finite set of mutually separated containers, and let be the bias of the sector of each container (the frame is the variables outside all containers).
Under (F)(W), if the containers are separated from each other, and for each container one takes a stationary kernel that moves only the inside of that container and moves all containers one step simultaneously, then
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 . By Theorem 9 each factor is at least . Take expectations. ∎
The container identity of 12-03 had the form (for the containers inside ). Together with (11), an upper bound on the Wilson loop is bounded in the correct direction by a quantity measurable by Monte Carlo, Proved here.
Limits (an important caution). What (10) gives is . The flip probability 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 Reading (Tables 1, 2, 8 and 9 of 12-08). So what can be said for containers of size is with at best. Even if this held uniformly in , all that follows is
and this is exactly the "weak form" of 13-01 (a form that also satisfies) Proved here. To show the correct form of the band by (10), one needs a kernel with , 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 of the fixed, and an estimate from above of the chessboard density (13-05).
| Bound | Form | What can be said | What cannot be said |
|---|---|---|---|
| Driven identity (Theorems 2 and 5) | Increasing the number of steps can move the factor away from 1 (numerics) | That the upper bound on the factor is uniform in | |
| Jarzynski (Corollary 3) | A numerical check | Precision with few samples (dominated by rare events) | |
| Flip probability (Theorem 7) | — (weaker than Theorem 9) | ||
| Flow lemma (Theorem 9) | A lower bound on the slab tension with the fixed | For a one-step kernel only up to . The form of the band does not follow | |
| Simultaneous flips (Theorem 10) | An estimator in the correct direction for an upper bound on the Wilson loop | A numerical test of the band (withdrawn) |
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 and the lattice spacing, or a kernel with close to 1, and this book shows neither.
(b) The quasi-static limit. That as 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 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. " levels off at about " is a measurement and a judgement of the record, not a theorem. The conclusion that only up to can be said rests on this reading. Conversely, if there were a kernel with 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.
The table of five grades and the dependency graph
| Row | Statement (one line) | Grade | Evidence | Scope | Machine checking |
|---|---|---|---|---|---|
| [01] | The marginal of the starting point on the space of paths is the original measure | Proved here | §02 | (F)(W)(K), rows of the kernels sum to 1 | — |
| [02] | Lemma 1: , | Cited | §03, Crooks | (F)(W)(K), detailed balance (1) | — |
| [03] | Theorem 2: | Proved here | §03 | (F)(W)(K), (1), | BoundedInsertion (Bounded.single) applied to (hypotheses: finite, involution, , odd. The construction of 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: acceptance rate | Proved here | §03 | The setting of [03] | — |
| [06] | Theorem 5: (7) for many cells | Proved here | §03 | Containers separated, , positions chosen independently and uniformly | — (the type of induction is BoundedInsertion (Bounded.averaged) of 12-05) |
| [07] | as | Reading (physics) | §04 | The kernels mix well enough at each | — |
| [08] | The work goes down with the number of steps (, ) | Reading | §04, 12-08 | , 6 configurations × 4 positions | — |
| [09] | Proposition 6: the formula of the cut measure (8) | Proved here | §05 | Frame fixed, terms of the flip sheet removed | FlipLemma (FlipLemma.cut_formula) (hypotheses: a finite set, real-valued , , ) |
| [10] | Theorem 7: flip probability | Proved here | §06 | Stationary kernels (reversibility not needed) | FlipLemma (FlipLemma.flip_le) (hypotheses: , , , rows sum to 1, stationary, ) |
| [11] | Corollary 8: for positive kernels | Proved here | §06 | Reversible and a positive operator | — |
| [12] | Theorem 9: the flow lemma | Proved here | §06 | Stationary kernels (reversibility not needed) | FluxLemma (FluxLemma.flip_le_one_sub_abs) (hypotheses: , , , rows sum to 1, stationary, ) |
| [13] | The kernel with acceptance is stationary, acceptance rate | Proved here | §06 | The setting of [02] | — |
| [14] | Theorem 10: | Proved here | §07 | Containers separated, a stationary kernel per container | — (the core is [12]) |
| [15] | The of a one-step kernel levels off at about | Reading | §07, 12-08 | The range of , and containers measured | — |
| [16] | What follows from (10) is (the weak form). The form of the band needs | Proved here | §07 | When only 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 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 said | What is not said |
|---|---|
| Proved here Under (F)(W)(K), the driven identity and its form for many cells | An upper bound on the factor uniform in 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 |
| Proved here For stationary kernels, , , and simultaneous flips | A construction of a kernel with close to 1. The form of the band |
| Reading For one-step kernels only up to (cannot be used to test the band) | The same theorems on the continuous configuration space (outside Lean) |
Sources and reproduction
| Item | Kind | Source / tools |
|---|---|---|
| The Crooks relation (path weight ratio ) | Cited | G. 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 equality | Cited | C. 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 10 | Proved here | Proofs 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 identity | Cited (indirect) | G. Mack, V. B. Petkova (as in 12-03) |
| Tempered transitions, non-equilibrium candidate methods | Comparison not done | The Monte Carlo literature (bibliographic data not checked) |
| Numerics (§04) | Reading | The same measurement as the first row of Table 1 of 12-08 |
| Lean | Lean | FlipLemma (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 , the work , the space of paths , the Crooks involution , 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 →