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
- 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
- Part 10 Towards a proof of the mass gap — building the first step of the staircase
- 10-00 Entrance — the staircase, and the random walk, the ruler and the clock
- 10-01 The line of construction and Assumption H
- 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 Further considerations — beyond Assumption H, and other views
- 11-00 Further considerations — entrance
- 11-01 One form that obstructs H — 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 H — the sector H and the local H
- 11-04 Which H 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
- 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
(H3)(H4) and the constant of the core
What this chapter shows — We state Steps 1 and 2 of Proposition 4.5 of the first step (10-05 §04) as Proposition H3 (reduction to the box, using only the Poincaré inequality) and Proposition H4 (the gap inside the box, with a table of assumptions), and we give the proof of the product inequality for boxes, which 10-05 graded "Proved here". Next, we bound the constant of the core that enters the fast side of Proposition H4 in three stages by the length of the core (convexity, two blocks, and the reduction to the box applied to the core). Finally, we state how far the set of values at the ends of the core is covered, and how the bistability that appears at ends beyond the top is paid for by the margin of the action barrier.
Prerequisite chapters — 10-05 §03, §04 (the statements of conditions (H3)(H4) and the single line of argument), 10-04 (the path measure, the correlation length , kinks), 10-09 §06 (the curvature of one site at the top).
Said first — The level is [Res], and only §01 is written so that it can be read at [Y3]. §02 onwards are sections at the research level; you can skip them and go to the table of remaining rows in §07 and still read the conclusion of this chapter. This part places Assumption H at the axis of the study (10-01), and this chapter states how far conditions (H3)(H4) of its first step could be put in the form of propositions. Propositions H3 and H4 are propositions that leave assumption rows in place; they do not show conditions (H3)(H4). All numbers are values on the 0+1-dimensional double well on the lattice , and triples are in the order .
- Summary — a section readable at [Y3]
- Proposition H3 — reduction to the box (Figure 1, Table 1)
- Proof of the product inequality for boxes — the Markov property and Efron–Stein
- Proposition H4 — the gap inside the box (Table 2)
- Three stages for the constant of the core — Proposition CORE3 (Tables 3 and 4)
- The set of ends — what is covered, and how to pay for bistability
- The list of remaining rows (Table 5)
- The table of the five grades (Table 6)
- The dependency graph
Summary
(H3) bounds the Poincaré constant of a long path by the Poincaré constant of a box of length , and (H4) bounds the gap inside that box at the order of .
- Proposition H3. Cover the line with overlapping boxes and split them into even boxes and odd boxes; then . It uses only the lemma of two projections, the product inequality for boxes and averaging over shifts, and does not use the logarithmic Sobolev inequality. The remaining assumption rows are that the maximal correlation between even and odd, , is uniform, and the over the boundary values. The correlation length is read as , and a box does not cut the plateau at the top.
- Proposition H4. Splitting the inside of the box by the configuration of kinks gives . If the reduced kink gas is put in the same type as the Glauber dynamics of the one-dimensional Ising model, the gap is the sum of "creation and annihilation of pairs" and "diffusion of kinks", . The remaining rows are the cross term (X), the type of the gas (KG), (H1) for scraps, and the constant of the core.
- Three stages for the constant of the core. Core length is bounded by convexity, (independent of and of the end values); by the lemma of two blocks; and by applying the reduction to the box to the core. Taking the end values as samples in gives Reading.
- The set of ends. In the core of the sector framework, the ends are only on the side of the well, and there is no hole. In the core on the box side, the ends can lie beyond the top, and there the wall of conditioning creates bistability; but its barrier is about 95 times smaller than , and the local term of Proposition H4 vanishes as (on the reading at ).
Proposition H3 — reduction to the box
Setting. Take the action on the lattice line (spacing ) at , the infinite-volume measure of , and the Dirichlet form (the uniqueness of and the nearest-neighbour Markov property are the premise row P0, 10-05 Step 0). A box is an interval of sites, the boundary values are the values at the neighbouring sites to the left and right of , is the conditional measure with these fixed, and is the sum over the sites of only. We put
The maximal correlation of two -algebras is .
Lemma TP (two projections). If , then for every
Proved here (proof in 10-05 Step 1) Leantwo_proj_sum_le (assumptions: Cauchy–Schwarz and the inequality of maximal correlation), two_proj_var (assumption: ).
The family of boxes. Line up boxes of sites so that neighbours overlap in sites (), and let be the family of even-numbered boxes and the family of odd-numbered ones. is the -algebra generated by the values at the sites outside , likewise, and (independent of translation).
Figure 1 Even and odd boxes, and the shift (example with L = 8, l = 2; each character in a column is 1 site) sites ....|....|....|....|....|....|....|.... even E [ B0 ] [ B2 ] [ B4 ] odd O [ B1 ] [ B3 ] overlap ^^ ^^ ^^ ^^ ← l sites each shift s=1 move the whole row of boxes l sites right (the overlaps move to other sites) with n = ⌊(L−l)/l⌋ shifts, the overlap sites are mutually disjoint
The product over boxes. Even boxes are sites apart from each other, and the following inequality holds (proof in §03).
Proposition H3. . If , then
Proved here Proof. Fix one shift and let its even and odd families be . From (1) and (2) for the two families, . The boxes cover the line, each site lies in the even family at most once and in the odd family at most once, and only the overlap sites lie in both, so the bracket is (the sum over the overlap sites only). Averaging over the shifts , the overlap sites are mutually disjoint across shifts, so , hence . ∎ Leanbox_two_family (assumptions: Lemma TP, (2) for each family, , ), box_shift_average (assumptions: the two-family inequality for each shift, the sum over overlaps is at most ).
(3) is built only from Poincaré inequalities and does not use the logarithmic Sobolev inequality. Conditions (H1)(H2) enter only through (§04). Putting in of (H4) together with and gives , the form of Proposition 4.5 LeanH3_with_H4, H3_H4_compose (assumptions: (3), (H4), , , ). It is the same type as the box dynamics of the Glauber dynamics of discrete spins (Propositions 3.4 and 3.5 of Martinelli's lectures) Cited; here we rewrite it in one dimension, in , and in the form of maximal correlation.
The remaining assumption rows, and the numbers
- (MIXalt): uniformly in . There is no paper proof Assumption. As values, on the reading that the slow part is a two-state chain of the sign (the telegraph chain), boxes with give for Reading (values of a family that copies the values of the closed formula of the two-state chain). These values agree with of Proposition G in §05 with and (at , ).
- The over boundary values. takes the over all real boundary values. We see in §04 that boundary values near the top are the worst.
- The size of . Computing the difference of the even and odd eigenvalues of the transfer operator in the logarithmic domain gives and Reading (two independent computational routes agree to six digits at intermediate ). That is, , and its ratio to the length of the plateau at the top (the crossing length , 10-10 type 5) is Lean
xi_over_ellx(assumption: the measured ). A box of length does not cut the plateau; it contains it whole. In exchange, the constant of the core inside the box has to be uniform in the length of the core (§05).
| Model | What was compared | Result |
|---|---|---|
| Pure Gaussian () | The right-hand side against | Right-hand side () Reading. Approaches 1 as , Leangauss_box_le_one |
| Heat-bath Glauber for the one-dimensional Ising model (rings of 12 and 16 sites, couplings ) | Both sides of (3) | Holds in all 9 cases, with a loss of 1.17–1.35 times Reading (even at ) Leanising_K1_holds (assumption: measured values) |
| Negative control | () | The reduction says nothing Leanno_bound_when_c_one, blowup_as_c_to_one |
In the Glauber dynamics examples, even when the gap of the ring (the lower edge of the band) was only about a sixth of the gap of the box, carried exactly that difference. The band structure of the kink gas does not break the form of the box.
Proof of the product inequality for boxes
We give the proof of (7) of 10-05 ((2) of this chapter). Row ES was graded "Proved here" in the table of the five grades in 10-05 because of the proof in this section.
When the boxes of the even family are sites apart from each other, (2) holds for smooth functions that depend on finitely many sites only.
Step (a) Conditional independence. The action is the sum of terms between neighbours and one-site terms . If all values outside a box are fixed, the conditional density of is determined only by the terms of that contain , which are the terms inside and the two terms joining the two ends of to the two neighbours . So the conditional law is , and it depends on the values outside only through the two neighbours (the nearest-neighbour Markov property). Between even boxes there is at least one site fixed by , so given , the conditional density of the even boxes splits into a product of factors, one per box, and the values of the even boxes are mutually independent with the product law Proved here (one line on the density splitting into a product in finite volume; that the measure at has the same conditional law is the premise row P0).
Step (b) The Efron–Stein inequality for product measures. Let be a product measure on , , and the variance obtained by moving only the -th coordinate (the other coordinates fixed). Then
Proved here Proof. Put (, ) and . The are mutually orthogonal, so . Since the coordinates are independent, is integrated over the -th coordinate with , and . Moreover is averaged over the later coordinates , and is convex (the square of a seminorm), so Jensen's inequality gives . Taking expectations, , and summing over gives (4). ∎
Step (c) Poincaré for the box. Apply (4) to the conditional product of Step (a) (with the coordinate the value of the box ). The variance obtained by moving only the coordinates of a box is the variance of the measure , so
by the in the definition of .
Step (d) Putting it together. From (4) and Step (c), . Taking expectations, by the tower property of conditional expectation each term on the right becomes , which is (2). Since depends on finitely many sites only, finitely many boxes are involved, and the terms of boxes that do not touch the support of are . ∎
The extension to general in the domain of (approximation by functions depending on finitely many sites) is included in the premise row P0. The odd family is the same. (4) of Step (b) is the Efron–Stein inequality (Efron–Stein 1981); since we give the proof here, the grade is "Proved here".
Proposition H4 — the gap inside the box
Fix a box () and boundary values , and let and . The expected number of kinks in the box is from the kink density , which is Proved here Leanpair_fugacity (assumption: ).
The naive split goes round in a circle. Splitting by a rare set (for example, configurations with a long core), with , gives Proved here (an identity). The second term can be paid with a constant on , but the first term is as large as if is concentrated on , and the smallness of does not come out. What can be paid is up to , which is not a gap but a weak form of the Poincaré inequality Leannaive_split_weak (algebra). It is an example of 10-10 type 4: rarity cannot be paid with variance. So we take the split not by a rare set but by a slow variable.
Splitting by the slow variable. Let be the configuration of kinks in the box (the number of kinks, and the position of each kink defined by projection onto the manifold of kinks), and take the identity for conditional expectation Proved here
as the starting point.
- The first term (the fast side). By the nearest-neighbour Markov property, the conditional measure with fixed splits into a product of scraps of the phase without kinks (length , with values at both ends), the tubes around the kinks, and the cores inside them. The Poincaré constant of a product measure is at most the maximum of the constants of the components ((4) and Poincaré for each component), so with Proved here (the algebra of products). The three constants are assumption rows Assumption, and the constant of the core is bounded in §05 and §06.
- The second term (the slow side). is a function of alone and relaxes by diffusion of the kink positions (mobility , row (Mob) Cited) and by the creation and annihilation of kink pairs. Row (KG): the Poincaré constant of the box of the reduced kink gas, Assumption. Row (X): the cross term Assumption (of the type of the cross constant of a two-scale inequality; a statement of this form has not been drawn from a known theorem).
Proposition H4. Under the rows above, for every
Proved here (the sum of the two terms above) LeanH4_two_scale (assumptions: the decomposition inequality, first term , (KG), (X), ), H4_gap_form (assumptions: , , , , ). (5) is the same formula as (12) of 10-05.
Comparison with the Glauber dynamics of the one-dimensional Ising model
The constant of row (KG) is fixed by the assumption that puts the reduced kink gas in the same type as the heat-bath Glauber dynamics of the one-dimensional Ising model. The gap of a box of sites with the spins at both ends fixed has the closed formula
Assumption (the original source is bibliographic only; diagonalisation on the lattice agrees to the 6 digits shown, and it is the same whether the boundary values are or Reading) Leanglauber_split (the right-hand equality, no assumptions). In the limit of long correlation length, the first term is the infinite-volume gap = creation and annihilation of pairs, and the second term is the diffusion of kinks in an interval of length . Written in the Glauber unit , it is , that is, Proved here (algebra) Leankg_constant (assumption: ). The pair term is not a small perturbation; it enters additively as one of the main terms of the gap. The local term of the part without kinks does not appear at the lower edge of the gap.
When the boundary values are near the top, a half kink can sit at the end of the box. This corresponds to a free end of the Ising model, and there is no closed formula. Read by diagonalisation on the lattice, the gap does not fall below for any type of boundary (ratio ), but a free end is slower than a fixed end.
| 1 | 2 | 3 | 4 | 6 | |
|---|---|---|---|---|---|
| Fixed ends | 10.87 | 13.87 | 18.87 | 25.87 | 45.87 |
| Free ends (lattice values) | 2.86 | 7.17 | 12.94 | 20.32 | 39.07 |
| (two-state chain) | 0.915 | 0.731 | 0.550 | 0.410 | 0.234 |
| (fixed ends only) | 1.44 | 1.43 | 1.41 | 1.40 | 1.37 |
| (the including boundary values at the top) | 5.46 | 2.76 | 2.06 | 1.78 | 1.60 |
LeanK_fixed_C2, K_ff_C2, K_ff_C4 (assumptions: the measured and ; arithmetic only). Since decreases with , with fixed ends only hardly depends on , and including boundary values at the top, the larger is taken, the better.
The rows remaining in (H4). (X), (KG) (the Glauber type and free ends), (H1seg) (Proposition H1 of 10-06 is a statement on the ring, and there is no version for scraps with end values), (H2tube), and the row of the core. The second term of vanishes if is sufficiently smaller than , because is of size Reading. We use this margin for the core in §06.
Three stages for the constant of the core — Proposition CORE3
Setting. A core is a maximal interval of sites at which the path stays between the top and the well, (). In this chapter we reverse the direction by symmetry and write the core as (the mirror image of in 10-09). The measure of the core is with the outside values at both ends fixed, restricted to with Neumann boundary, and the Dirichlet form is (converted from the convention of 10-09 by ). What the fast side of condition (H4) needs is that is bounded uniformly in the length of the core and in the end values (row (T0′P)).
Stage 1 : convexity (Lemma BV)
The Hessian of the action of the core is
, and the end values enter only in first-order terms, so they do not appear in the Hessian. From Proved here (the closed formula for the eigenvalues of a tridiagonal matrix) and , at
. This is the same formula that appeared in 10-09 §06 as the smallest eigenvalue on the surface of the top; it is positive for and negative at (, ) Leankappa7_pos, kappa8_neg (no assumptions).
Lemma BV. If , then for all end values and all , .
Proved here Proof. By (7), is uniformly convex with . A uniformly log-concave measure restricted with Neumann boundary to a convex domain (the box ) satisfies Cited (Bakry–Émery on convex domains, checked in Theorem 1.2 (1) of Kolesnikov–Milman), and rewritten in this is . ∎ Leanlemma_BV (assumptions: the lower bound of the Hessian is independently of the end values, and the pointwise Bakry–Émery inequality).
The values are (), independent of both and the end values. The measured at ( and ) lie within these Reading. If the blocks are cut to 7 sites or fewer, the difficulty of the over end values disappears by convexity. The price moves to the side of the correlation at the seams of the cut blocks.
Stage 2 : two blocks (Lemma TB)
Lemma MR (reduction to the ends). If the chain is Markov, then for , .
Proved here Proof. Right-hand side left-hand side follows from the inclusion of -algebras. Conversely, let be a centred function of the front piece and one of the back piece. By the Markov property , so putting and gives . ∎
Lemma TB. Let , , . Then
Proved here Proof. Apply Lemma TP to and . By Lemma MR, . The conditional law given is the chain of length (with ends and ) restricted to the box, and Lemma BV gives . likewise gives and . Taking expectations and putting them into (1), the coefficient of site is ; both are switched on only when , which happens only when . ∎ Leantb_far, tb_adjacent (assumptions: the conclusion of Lemma TP, BV for each block, , ).
From the conditions , , we get , and at there is no Leantb_range, tb_none_at_15 (arithmetic of natural numbers). The input is a single two-point maximal correlation , which is the second singular value of the normalised matrix of the joint distribution of two sites Cited (the singular-value representation of Witsenhausen and Rényi, checked in a restatement). For the measure on the lattice, this value can be computed from products of transfer matrices.
Values. With the ends sampled in , the of the upper bound over is attained at with both ends and is , and the lower bound from polynomial test functions (Rayleigh–Ritz) is Reading (at , the from Lemma TB alone is at ). is just outside the threshold of convexity; on the reading at , the smallest eigenvalue of the Hessian at the constrained minimiser is , and is approached. There is a peak at (lower bound 57, upper bound 99) Reading, and it is not monotone in .
Why the form of Stage 3 is not used here. In a core with and both ends at the top, the alternating maximal correlation of subboxes of length 5 rises to , and the coefficient of Stage 3 becomes or more Reading Leancoeff_k8 (assumption: the measured ). This is because the soft direction () pushes the correlation at the seams towards 1; the form of two blocks avoids the alternating correlation and can be paid with the two-point correlation alone.
Stage 3 : applying the reduction to the box to the core (form (β))
The measure of the core is also one-dimensional and nearest-neighbour Markov (restriction to a product box preserves the Markov property), so the construction of §02 and §03 can be used literally inside the core. Taking subboxes of length with overlap (), the constant of the subboxes (all of 5 sites or fewer, including short ones cut at the ends) is uniformly in the end values by Lemma BV, so for every and all end values
Proved here (the proof of Proposition H3 transferred to the core) Leancore_uniform_L5 (assumptions: the conclusion of Proposition H3, , the measured ). is the alternating maximal correlation between the even and odd subboxes inside the core; the values measured at are over end values (including negative ends beyond the top), and at they are saturated to 7 digits Reading (a measurement of a lower bound of the maximal correlation by additive polynomial functions and two points at the seams). Putting this in gives .
The form of the alternating maximal correlation (Proposition G). In a stationary Gaussian chain with correlation inside a piece and correlation at the seams (, , ; the chain is taken to continue infinitely on both sides), the maximal correlation between the even pieces and the odd pieces is , where
. Derivation: for the uniform type , , the covariance per period is , because by the Markov property a two-point correlation is the product of the correlations of the links in between; the variance is , and the ratio is Proved here (sum of a geometric series) Leangauss_mode0, one_sub_phi. This ratio falls within the framework of the convergence rate of two-block Gibbs sampling for a Gaussian target distribution Cited. The rate of Gibbs sampling that alternately redraws all the even pieces and all the odd pieces is the square of the largest eigenvalue of the block Jacobi matrix (Theorem 5 and §2.4 of Roberts–Sahu 1997), and that largest eigenvalue is the maximal correlation of the two pieces. The case of pieces of length 1 (; the value obtained by putting in (10)) is in Theorem 1 of Pitt–Shephard 1999 and Corollary 2 of Mider–Jenkins–Pollock–Roberts 2022, its square being the rate in the limit of infinite chain length Cited. The value of (10) for general piece length is the same quantity as the convergence radius of line Jacobi iteration in numerical linear algebra (the bibliography on that side has not been cross-checked). That the maximal correlation of a Gaussian chain equals the linear canonical correlation is Cited (Kolmogorov–Rozanov, checked in a restatement); that the uniform type is the maximum within it has only been confirmed by computation Reading. Since , the naive product is false Leannaive_product_false (assumption: ). The of the two-state chain in §02 is the at , .
It does not reduce to two-point quantities. In the core, the Gaussian proxy built from the two-point maximal correlation agrees with the measured value at the order of Reading. Even so, for a general Markov chain there is no inequality that bounds the alternating maximal correlation by two-point quantities alone. A chain of three variables : ; if then ; if then are independently 1 with probability ; , . A function of a binary variable is affine, so the maximal correlation between binary variables is , and (). But has () Proved here (computation of covariances) LeanrareR_pair, rareR_joint (arithmetic of rational numbers). It is an example in which a non-linear function that holds a rare state from both sides is effective; the paper for row (MIXcore) needs a comparison theorem that uses the fact that the conditional law of the core is close to log-concave.
Proposition CORE3 and the table of the three stages
Proposition CORE3. For a set of end values , let and . Then for every and
Proved here (split into cases by and apply Stages 1–3) Leanthree_stage (assumption: the upper bound of each stage).
| Stage | Tool | Grade | Upper bound | Lower bound | |
|---|---|---|---|---|---|
| 1 | Lemma BV (convexity) | Proved here + Cited (Bakry–Émery on convex domains) | (independent of and the ends) | — | |
| 2 | Lemma TB + two-point maximal correlation | Proved here + Reading | |||
| 3 | Form (β) + alternating maximal correlation | Proved here + Reading + Assumption (MIXcore) | ( is a measurement of a lower bound) | — |
From Table 3, Reading Leanthree_stage_3em4 (assumption: the measured values of Stages 2 and 3). The ratios of upper to lower bound are . The input of Stage 2 (the two-point maximal correlation) is a product of matrices and a second singular value, so it is of a type that can be put on interval arithmetic; but it needs a paper estimate of the difference between the lattice measure and the continuum measure, and the cost of running it is estimated at the order of CPU hours (not yet). In Stage 3, what is measured is a lower bound, and there is no paper for the upper bound.
The set of ends — what is covered, and how to pay for bistability
Table 3 took the end values as samples in . A core is a maximal interval of sites in , so the neighbouring sites outside it actually take values in . We separate which ends are needed in which construction.
The core of the sector framework — ends only on the side of the well
The core of the sector framework (10-09) is defined as having both end values on the side of the well ( in the direction of this chapter). So ends beyond the top do not enter there Proved here (by definition) Leanp5_end_not_negative (assumption: ), and the set of ends has no hole. In the stationary chain, a fraction of the mass of runs of length is of this type, and the minimiser on the reading at is a single shape with every site pressed against the wall Reading.
The core on the box side — ends beyond the top, and the wall of conditioning
In the core on the fast side of Proposition H4 (the core after splitting by the configuration of kinks), the outside neighbour can take negative values beyond the top. There, two local minimisers at appear in cores with , the barrier is (depending on the end values), and the lower bound of for with ends is , growing in the manner of Reading.
- Both minimisers sit on the wall of conditioning. One is a bump spanning the core interval as it is; the other has the zeros at both ends moved inwards by one site each. Because we conditioned the core interval to be "exactly this interval", a wall stands in the direction in which the zeros want to move, and the two types compete. The Peierls–Nabarro barrier of a discrete kink on this lattice is or less, a different order from the bistability barrier Reading Lean
pn_vs_bistab(assumption: measured values). The bistability is not physical metastability; it is made by the choice of conditioning. - Cutting by the binary of the bump brings the fibres back. Splitting by the binary of whether a site near the top is at or above the threshold (whether there is a bump), the of each fibre returns, by Lemma TB (the same proof applies to products of intervals), to upper bound and lower bound , the same order as Stage 2 of Table 3 Reading.
- only moves. In exchange, the Poincaré constant of the marginal of the binary takes on , with () Reading Lean
y_side_k9_3em4(assumption: measured values). Cutting does not remove the barrier; it takes the form of transfer of 10-10 type 7. Extending the constant of the core to the actual set of ends while keeping it cannot be done by this split.
Paying with the margin of the action barrier — row (ΔScore)
In Proposition H4 the constant of the core enters , and appears in only in the form ((5)). is of the order of , so the constant of the core need not be ; it suffices that the action barrier is smaller than . We put this as an assumption row.
Row (ΔScore). There are and such that, for the conditional measures of the core on the box side and of the windows containing it (the core, its two neighbours and sites outside, with arbitrary outer ends), (for small ) Assumption.
Reading. On the reading at (numerical minimisers checked for stationarity and positive definiteness, and the height of the connection bracketed from above and below), the of the depth of non-global minimisers over the range , , outer ends is ; its ratio to is , a margin of about 95 times Reading Leanmeasured_ratio (assumption: the measured upper bound ). It is 5–8 times deeper than the value with the ends fixed (), and the is attained where moving the outer ends makes the two types degenerate. The lower bound of approaches from below ( by a fit), but the prefactor of the upper bound has not been measured.
Proposition (the local term vanishes). Under (ΔScore) and the reading of , , for any
Proved here Proof. From (), . Multiplying this by the two assumptions gives , which is (12). ∎ Leancloc_term_poly, cloc_term_vanishes (assumptions: (ΔScore), the reading of , ); negative control no_vanish_if_no_gap (if , the estimate does not vanish).
If is taken smaller than , the right-hand side of (12) goes to as , and the measured values leave a margin of . The bistability of the core on the box side does not affect the coefficient of Proposition 4.5, whether one conditions or not (on the assumption (ΔScore) and the reading at ). Cores with negative ends appear in the sector framework inside the sector of kink positions (the bridge), and their mass in the stationary chain has the rarity () Reading.
The list of remaining rows
| Row | What remains | Present support | Grade |
|---|---|---|---|
| P0 | Uniqueness of the measure at , the nearest-neighbour Markov property, extension from local functions, regularity of the conditional measures and the coordinates of kinks | That the kernel of the transfer operator is positive (the original source for the version on not yet checked) | Assumption |
| (MIXalt) | The alternating maximal correlation between boxes is uniform in and the boundary values (a paper on the mixing of boxes) | The reading of the two-state chain (), the form of Proposition G | Assumption |
| (BV) | The over boundary values: near the top (the free-end type) and far away (steep descent) | The reading of for free ends; far away, only the prospect that the gap does not vanish | Assumption |
| (X) | The cross term , with uniform | None (the type of a two-scale inequality) | Assumption |
| (KG) | That the reduced kink gas falls in the Glauber type, and the loss at free ends | The closed formula of the Ising model and diagonalisation | Assumption |
| (H1seg) | Local Poincaré for scraps with end values | Proposition H1 in the ring version (10-06) | Assumption |
| (H2tube) | Poincaré for the tube, uniform in the tube length | None | Assumption |
| Mechanisation of Stage 2 | Enclosing the two-point maximal correlation in interval arithmetic, and a paper on the difference between lattice and continuum | Floating-point transfer (cost estimated at the order of CPU hours) | Reading |
| (MIXcore) | An upper bound for of Stage 3 | Measurement of a lower bound . Does not reduce to two-point quantities (counterexample) | Assumption |
| (ΔScore) | for the core on the box side and its windows, in particular the prefactor and windows with , | The reading at , , and the lower bound of | Assumption |
The construction of the steps of (H3)(H4) itself ((1)–(5), (7)–(12)) is algebra for which elementary proofs are given, and what remains as assumptions are the rows of Table 5. There is still no at which all the rows of the four conditions are in place together (10-05 §08).
The table of the five grades — the rows of (H3)(H4) and the core
| Row | Statement (one line) | Grade | Basis | Range of | Machine checking |
|---|---|---|---|---|---|
| P0 | The premise row (uniqueness, Markov property, extension, regularity) | Assumption | §03, 10-05 Step 0 | — | — |
| TP | The lemma of two projections (1) | Proved here | Proof in 10-05 Step 1 | Independent of | two_proj_var (assumption: ) |
| ES | Efron–Stein for product measures (4) | Proved here | Proof in §03 Step (b) | Independent of | — |
| BOX | Product over boxes (2) ⟸ P0, ES | Proved here | §03 Steps (a)–(d) | Independent of | — |
| H3 | Proposition H3 (3) | Proved here | Proof in §02 | Independent of | box_two_family, box_shift_average (assumptions: the two-family inequality, , the sum over overlaps ) |
| MXA | (MIXalt) | Assumption | §02 | — | — |
| CAL | () | Reading | §02 (values of a family copying the values of the two-state chain) | Model independent of | — |
| XI | , | Reading | §02 | Three points | xi_over_ellx (assumption: the measured difference) |
| CTL | Positive controls (Gaussian, Ising) | Reading | Table 1 | — | gauss_box_le_one, ising_K1_holds (assumption: measured values) |
| DEC | Decomposition of the variance and the product on the fast side | Proved here | §04 | Independent of | — |
| SEG, TUBE | (H1seg), (H2tube) | Assumption | §04 | — | — |
| KG, X | (KG), (X) | Assumption | §04 | — | — |
| MOB | Mobility of a single kink | Cited | 10-04 §03, 10-05 Step 2 | — | |
| GLA | The gap of the Glauber box with fixed ends (6) | Assumption | §04 (original source bibliographic only; a 6-digit reading by diagonalisation on the lattice) | — | glauber_split (equality) |
| KGC | Proved here | §04 (algebra of the limit of (6)) | Independent of | kg_constant (assumption: ) | |
| CFF | for free ends and the values of (Table 2) | Reading | §04 | Model independent of | K_ff_C2, K_ff_C4 (assumption: measured values) |
| H4 | Proposition H4 (5) | Proved here | §04 | Independent of | H4_two_scale, H4_gap_form (assumptions in §04) |
| BE | Bakry–Émery on convex domains | Cited | Kolesnikov–Milman Theorem 1.2 (1) | Independent of | — |
| BV | Lemma BV ( for ) | Proved here | §05 (7) and proof | Independent of | lemma_BV, kappa7_pos, kappa8_neg |
| MR | Lemma MR (reduction to the ends) | Proved here | Proof in §05 | Independent of | — |
| TB | Lemma TB (8), for only | Proved here | Proof in §05 | Independent of | tb_far, tb_adjacent, tb_range, tb_none_at_15 |
| SV | Singular-value representation of maximal correlation | Cited | Witsenhausen 1975, Rényi 1959 (checked in a restatement) | — | — |
| MC2 | The two-point maximal correlation of Stage 2 and () | Reading | §05 Table 3 | Three points | — |
| BET | Inequality (9) of form (β) | Proved here | §05 (a copy of Proposition H3) | Independent of | core_uniform_L5 (assumption: the measured ) |
| MXC | (MIXcore): an upper bound for | Assumption | §05 | — | — |
| CB | (measurement of a lower bound) | Reading | §05 | Three points | — |
| G | The ratio of Proposition G (10) | Cited (framework) + Proved here (closed formula) | §05 (geometric series), Theorem 5 of Roberts–Sahu 1997 | Independent of | gauss_mode0, one_sub_phi, naive_product_false |
| KR | For Gaussians, maximal correlation = linear canonical correlation | Cited | Kolmogorov–Rozanov (checked in a restatement) | — | — |
| RR | Two-point quantities cannot bound the alternating maximal correlation (example with three variables) | Proved here | §05 | — | rareR_pair, rareR_joint (arithmetic of rational numbers) |
| CORE3 | Proposition CORE3 (11) | Proved here | §05 | Independent of | three_stage (assumption: the upper bound of each stage) |
| PHY | The ends of the core of the sector framework are only on the side of the well | Proved here | §06 (by definition) | Independent of | p5_end_not_negative |
| BIS | Bistability of the core on the box side, the fibres of the binary of the bump, the marginal of | Reading | §06 | Three points | pn_vs_bistab, y_side_k9_3em4 (assumption: measured values) |
| DSC | (ΔScore) | Assumption | §06 | — | — |
| DSV | , ratio to | Reading | §06 (reading at ) | measured_ratio (assumption: the measured upper bound) | |
| CLOC | The local term vanishes (12) | Proved here | Proof in §06 | cloc_term_poly, cloc_term_vanishes (assumptions: DSC, XI, ) |
The "Proved here" rows of Table 6 are either algebra on top of assumption rows or general inequalities whose proofs are given in the text. They do not mean that (H3)(H4) have been shown, nor that the constant of the core has been bounded unconditionally.
The dependency graph
The format is the same as 10-05 §07: the numbers to the right of "⟸" are always smaller than the number on the left.
[01] ASM P0 uniqueness at T=∞, Markov property, extension, regularity ħ: —
[02] ASM MXA (MIX_alt) c_alt < 1 between boxes ħ: —
[03] ASM SEG (H1_seg) local Poincaré for scraps ħ: —
[04] ASM TUBE (H2_tube) Poincaré for the tube ħ: —
[05] ASM KG box gap of the reduced kink gas ħ: —
[06] ASM X cross term ℰ_Y ≤ (1+χ)ℰ ħ: —
[07] ASM MXC (MIX_core) alternating maximal correlation in the core c̄ < 1 ħ: —
[08] ASM DSC (ΔS_core) C_P ≤ c ħ^(−p) e^(ΔS/ħ) for core and window ħ: —
[09] CIT MOB mobility D = ħ/S₀ ħ→0
[10] CIT BE Bakry–Émery on convex domains independent of ħ
[11] RDG XI ξ ∝ ħ^½ e^(S₀/ħ), D/(Cξ)² ≤ d e^(−2S₀/ħ) ħ: three points
[12] RDG CAL values of c_alt model
[13] RDG MC2 two-point maximal correlation of Stage 2 ħ: three points
[14] RDG CB c̄ ≤ 0.535 (measurement of a lower bound) ħ: three points
[15] RDG BIS bistability, fibres of the binary of the bump ħ: three points
[16] PRV TP lemma of two projections (1) independent of ħ
Lean two_proj_var
[17] PRV ES Efron–Stein for products (4) independent of ħ
[18] PRV BOX product over boxes (2) ⟸ [01][17] independent of ħ
[19] PRV H3 Proposition H3 (3) ⟸ [02][16][18] independent of ħ
Lean box_two_family, box_shift_average
[20] PRV DEC decomposition of the variance ⟸ [01] independent of ħ
[21] PRV KGC c_kg = C²+π² independent of ħ
Lean kg_constant
[22] PRV BV Lemma BV (7) ⟸ [10] independent of ħ
Lean lemma_BV (assumptions: lower bound of the Hessian, BE)
[23] PRV MR reduction to the ends ⟸ [01] independent of ħ
[24] PRV TB Lemma TB (8) ⟸ [16][22][23] independent of ħ
Lean tb_far, tb_adjacent, tb_range
[25] PRV G ratio of Proposition G (10) independent of ħ
[26] PRV RR example that does not reduce to two-point quantities independent of ħ
[27] PRV BET inequality (9) of form (β) ⟸ [01][16][17][22] independent of ħ
[28] PRV CORE3 (11) ⟸ [07][13][14][22][24][27] ħ: three points
Lean three_stage (assumption: upper bound of each stage)
[29] PRV PHY ends of the core of the sector framework on the well side independent of ħ
[30] PRV CLOC (12) ⟸ [08][11] ħ→0
Lean cloc_term_poly, cloc_term_vanishes
[31] PRV H4 Proposition H4 (5) ⟸ [03][04][05][06][09][17][20][21] independent of ħ
Lean H4_two_scale, H4_gap_form
[32] PRV K4 K_4 independent of ħ ⟸ [28][30][31] ħ→0
[33] PRV H3H4 C_P ≤ Kξ²S₀/ħ ⟸ [19][32] ħ→0
Lean H3_H4_compose
How to check. The rows with ⟸ are [18] ([01][17]), [19] ([02][16][18]), [20] ([01]), [22] ([10]), [23] ([01]), [24] ([16][22][23]), [27] ([01][16][17][22]), [28] ([07][13][14][22][24][27]), [30] ([08][11]), [31] ([03]–[06][09][17][20][21]), [32] ([28][30][31]) and [33] ([19][32]); in every one the numbers on the right are smaller than the one on the left, and there is no circle.
What to read. The conclusion [33] depends on all the assumption rows [01]–[08] ([07][08] through the constant of the core [28] and the local term [30]). [12][15][25][26][29] are premises of no conclusion; they are rows that explain the reading of values, the nature of the bistability, the form of the alternating correlation and the drawing of the line at the ends. The range of of [28] is "three points" because the values of Stages 2 and 3 are readings at three values of ; the form of (11) itself does not depend on .
We also check that the statements of the assumption rows do not contain the quantity of the conclusion. The quantity of the conclusion is of the whole measure at . [02][07] are quantities of correlation, [03][04][08] are constants of scraps, tubes, and cores and windows, [05] is a constant of the reduced gas, [06] is a comparison of forms, and [01] is a property of the measure; none of them contains .
Correspondence with the graph of 10-05. In the integrated graph (10-12), the leaves [02] (H1seg), [03] (H2tube), [05] (KG), [06] (X) and [07] (MIXalt) of 10-05 are the same nodes as [03][04][05][06][02] of this chapter; [04] (T0′P) of 10-05 is replaced by [28] (Proposition CORE3) and [30] (the local term) of this chapter, and the leaves move to [07][08]. [11] (ES), [14] (Proposition H3), [15] (Proposition H4) and [16] (Proposition 4.5) of 10-05 are [18], [19], [31] and [33] of this chapter.
To the next chapter
10-12 joins the dependency graphs of 10-05 to 10-11 into one, puts every row into one table of the five grades, and shows in a figure of bands that there is still no at which all rows are in place. This part places Assumption H at the axis of the study, and this chapter was the step that put (H3)(H4) of its first step in the form of propositions. The viewpoint of carrying the form of the reduction to the box over to the four-dimensional lattice or to other quantities is taken up in Part 11 (11-03).
What this chapter can say
| Can say | Cannot say |
|---|---|
| Proved here The product over boxes (2) and its proof, Proposition H3 (3), Proposition H4 (5), Lemmas BV, MR and TB, the inequality of form (β), the ratio of Proposition G, the example that does not reduce to two-point quantities, the construction of Proposition CORE3, the vanishing of the local term (12) Lean (algebra) | Conditions (H3)(H4). The rows (MIXalt), (X), (KG), (H1seg), (H2tube), (MIXcore), (ΔScore) |
| Reading The size of , the values of , and , the constant of the core , the bistability barrier and the 95-fold margin | Mechanisation of the upper bound for the constant of the core, uniformity as , the prefactor of (ΔScore) |
| Cited Bakry–Émery on convex domains, the singular-value representation of maximal correlation, maximal correlation of Gaussians, the type of the box dynamics | A at which all rows of the four conditions are in place |
Sources and reproduction
| Item | Kind | Source, tool |
|---|---|---|
| Bakry–Émery on convex domains | Cited | D. Bakry, M. Émery, Sém. Probab. XIX, LNM 1123 (1985) 177–206; A. V. Kolesnikov, E. Milman, J. Geom. Anal. 27 (2017) 1680–1702 (Theorem 1.2 (1), checked in the text). |
| Box dynamics (discrete spins) | Cited | F. Martinelli, "Lectures on Glauber dynamics for discrete spin models", LNM 1717 (1999) 93–191 (Propositions 3.4 and 3.5, checked in the text of the preprint). |
| Singular-value representation of maximal correlation | Cited | H. S. Witsenhausen, SIAM J. Appl. Math. 28 (1975) 100–113; A. Rényi, Acta Math. Acad. Sci. Hungar. 10 (1959) 441–451 (statement checked in a restatement). |
| For Gaussians, maximal correlation = linear canonical correlation; maximal correlation of stationary chains | Cited | A. N. Kolmogorov, Yu. A. Rozanov, Theory Probab. Appl. 5 (1960) 204–208; R. C. Bradley, Probab. Surveys 2 (2005) 107–144 (checked in a restatement). |
| The rate of two-block Gibbs sampling (the framework of Proposition G, and the case of pieces of length 1) | Cited | G. O. Roberts, S. K. Sahu, J. R. Stat. Soc. B 59 (1997) 291–317, doi:10.1111/1467-9868.00070 (Theorem 5, Corollary 3, §2.4, checked in the text); M. K. Pitt, N. Shephard, J. Time Series Anal. 20 (1999) 63–85 (Theorem 1; checked in the text of the 1996 working-paper version, the published version not cross-checked); M. Mider, P. A. Jenkins, M. Pollock, G. O. Roberts, arXiv:2009.10440v2 (2022) (Theorem 2, Corollary 2, checked in the text). The bibliography on the line Jacobi side has not been cross-checked. |
| The Efron–Stein inequality | Proved here | B. Efron, C. Stein, Ann. Statist. 9 (1981) (bibliographic; the proof is given in §03). |
| Glauber dynamics of the one-dimensional Ising model | Assumption | R. J. Glauber, J. Math. Phys. 4 (1963) 294–307 (bibliographic only; the values are readings by diagonalisation on the lattice). |
| Eyring–Kramers type (the barrier and ) | Cited | G. Menz, A. Schlichting, Ann. Probab. 42 (2014) (the statement in the case without boundary checked in the text; the version for minimisers on a wall has not been obtained, and (ΔScore) is an assumption row). |
| Algebra of the construction | Proved here, Lean | Proofs in the text. two_proj_var, box_two_family, box_shift_average, H4_two_scale, H4_gap_form, H3_H4_compose, lemma_BV, tb_far, tb_adjacent, three_stage, gauss_mode0, cloc_term_poly. |
| Numbers | Reading | Floating point for the transfer operator (two routes: the power method in the logarithmic domain and dense eigenvalues), diagonalisation of the Ising model on the lattice, polynomial Rayleigh–Ritz, numerical minimisers and heights of connection at . Interval arithmetic is not used. |
Terms used in this chapter — box dynamics (reduction to the box), even and odd boxes, averaging over shifts, maximal correlation, alternating maximal correlation, the lemma of two projections, the Efron–Stein inequality, the reduced kink gas, free end, cross term, core, the threshold of convexity, the lemma of two blocks, reduction to the ends, Proposition CORE3, the wall of conditioning, the binary of the bump, the action barrier. Their meanings are in the A-02 glossary.
Next chapter: 10-12 The integrated table and the dependency graph — puts every row of the four conditions into one table of the five grades, and confirms that the dependency graph of the steps has no circle.
← 10-10 The list of detour plans — types of breakageContents10-12 The integrated table and the dependency graph →