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
The sector framework and the three strands of route 5
What this chapter shows — We prove, split into five steps, the construction that controls the gap of the core uniformly in the core length (the sector framework), and derive the condition under which it closes, , and the needed value determined by it. We sort the constants of the condition into those that come from the structure and those that come from the choice of tools, and list the directions that raise the needed value and that lower the insufficient side. We put in one table how far the three strands (componentwise, scalar, Feynman–Kac) that attacked the one remaining proposition (that the logarithmic Sobolev constant of the site window lies within the needed value) got, and state in one line of diagonal dominance why all three stop at the same place: the curvature at one site at the top falls short of convexity.
Prerequisite chapters — 10-07 (the positions of routes 3 and 5), 10-08 §02 (the chain condition), 10-05 §03 (condition (H2) and row (T0′P)), 1-10 §07–§09 (Poincaré inequalities).
Said first — The level is [Res], and only §01 is written to be readable at [Y3]. §02 onwards are sections at the research level, and you can skip ahead to Table 4 in §05 and the common wall in §06 and still read the conclusions of this chapter. This part places Assumption H at the axis of the study (10-01), and this chapter says how far the core row of condition (H2) of its first step could be built. The sector framework has been shown, but the one remaining proposition is not closed by any of the three strands.
- Summary — a section readable at [Y3]
- The five steps of the sector framework — sum over sectors, Gibbs in marginal form, componentwise localisation, locality of volume, composition
- The closing condition and the needed value — where the constants come from, and two directions (Tables 1 and 2)
- The threshold mismatch — an example where the condition, taken literally, gave nothing
- The three strands of route 5 — componentwise, scalar (Proposition P5, Table 3), Feynman–Kac, and how far they got (Table 4)
- The common wall — the curvature at one site at the top, against
- The table of the five grades (Table 5)
- The dependency graph
Summary
The core is an interval of sites where the path stays near the top, and here the Hessian of the action has negative directions. To control the gap of the measure of the core (row (T0′P)) uniformly in , one must pay using the fact that places with negative curvature are rare. The sector framework splits that payment into five steps.
- Sum over sectors. Even when the space of configurations is split into a direct product of boxes, the Dirichlet form, the variance and the entropy split into sums over sectors, and the number of sectors does not enter the constants.
- Gibbs in marginal form. The weight on a rare set (measure at most ) can be paid with the entropy and : .
- Componentwise localisation. Applying 2. to each component of the gradient with the logarithmic Sobolev constant of the marginal of the marks on the 17 sites around that site (the site window), does not enter the sum.
- Locality of volume. The rarity exponent does not depend on .
- Composition. Combining the above with the two inequalities of Barta and Bochner gives, for the gap of the core , . The condition for the right-hand side to be positive is the closing condition .
The closing condition rewritten for is the needed value . At the three values , the original form on the road that defines defects by three sites is negative at (it closes for no ), and , and correcting two choices of tools raises it to Reading (arithmetic on the measured rarity exponents). On the other hand, in the current construction the upper bound on is of order Reading (including estimates), 29–74 times short.
The one remaining proposition "" was attacked by three strands. The componentwise strand stopped at 1.4–5.5 times the needed value, the scalar strand became a proposition with a table of assumptions (Proposition P5) for , and the Feynman–Kac strand lies within 0.54 times the threshold by a Monte Carlo reading, but its upper bound is times the threshold. All three stop at the same place: at the top, the diagonal at one site, , does not reach the sum of the couplings to the neighbours, (§06).
The five steps of the sector framework
Setting. Take the core (), fix the end values , and let and (Neumann on the faces of the box). Let be the first non-zero eigenvalue of , the eigenfunction, , and put
. is the defect set of site (configurations where or one of its neighbours lies on the top side of the threshold , ). Attach a mark to each site, and write for the set of marks on the window around site . A sector is a direct product of boxes for each type of marks, .
(Σ.1) Sum over sectors
For any partition into direct products of boxes, (a) (faces have measure 0, and is the same function on each sector), (b) (the law of total variance; the entropy has a chain rule of the same form), (c) if on each sector, the first term is at most Proved here. The number of sectors appears only in the weights , which sum to 1. Leanvar_split_cells (no assumptions), cell_sum_sup (assumptions: , , ).
(Σ.2) The Gibbs step in marginal form
The Gibbs variational inequality. For a probability measure , and a function ,
Proved here Proof. Put . Jensen's inequality gives . Multiplying both sides by gives (2). ∎
Taking and in (2) gives , and with this is Leangibbs_ln2_cell (assumptions: , , ). If is a set determined by a coarse variable , taking gives
. This is the form that pays for the weight on a rare set with the entropy of the marginal of the coarse variable.
(Σ.3) Componentwise localisation
As input we assume, for all and , the logarithmic Sobolev inequality of the marginal on the window
Assumption, and let ( a set determined by , ). Applying (3) to and summing over , from and ,
Proved here Leancomp_sum_le (assumptions: , the inequality for each component). does not enter. For contrast, if (3) is applied to a single union with a scalar , without splitting the gradient into components, just putting in the constant function makes the defect term at least , and it is not uniform in Proved here Leanscalar_not_uniform (assumption: ; the conclusion is "there is no with for all "). Uniformity in and having enter the condition are a trade-off.
(Σ.4) Locality of volume
is the rarity exponent of the defect set, and does not depend on . On the road that defines defects by three sites, the measured values give () Reading (floating-point transfer matrix; is an extrapolation, and the remeasured value is ). On the road that defines defects by lumps of length 8 or more, (, ) Reading. To say the same on the bridge, one needs that the remainder of the transfer operator of a scrap is small uniformly in the end values (PFseg) Assumption.
(Σ.5) Composition
We combine the following three inequalities.
- Barta: . It comes from the row inequality obtained by applying a weight to the componentwise operator ( satisfies ). is the lower bound on the rows outside the defects, and is the depth of the defects, determined by the worst row over the whole box Assumption (the paper estimate of the rows is not placed in the book).
- (5): (Σ.3) itself.
- Bochner: , , . The identity is the integrated form of Bochner's formula Cited (Proposition 1.3 of Ledoux's lectures, checked in the original text), and the vanishing of the boundary terms on the flat faces of the box and the smoothness of the eigenfunction up to the corners are Assumption.
Putting Bochner into (5), and that into Barta, gives
Proved here Leancomp_close (assumptions: , , , and the three inequalities Barta, (5), Bochner). If the right-hand side is positive, that is, if
, the gap of the core is bounded below by a positive number that does not depend on . (7) is the closing condition. Of the five steps, the constructions of (Σ.1)–(Σ.3) and (Σ.5) have elementary proofs placed in the text, and what remains as assumptions is the inputs (LSW), (PFseg), the Barta rows, the regularity for Bochner, and whether is small enough to satisfy (7). What remains as an assumption is not structure but the size of a constant.
The closing condition and the needed value
Solving (7) for gives the needed value
Proved here (rearranging (7)). That is smaller than this is the one remaining proposition (LSW♭), route 5 of 10-07 §02.
Where the constants come from. We sort the six constants of (7) into those that come from the structure and those that come from the choice of tools.
| Constant | Value | Origin | Side |
|---|---|---|---|
| Lower bound on the Barta rows outside the defects (small because the threshold is placed just above the one-site threshold ) | Structure | ||
| The worst value of the same rows over the whole box ( on the top side) | Structure | ||
| Table 2 | The rarity exponent of the defect set (not a length) | Structure | |
| In the Bochner step, the minimum of the negative curvature paid uniformly over the whole core | Choice of tools | ||
| The value with the tilt in the Gibbs step fixed at | Choice of tools | ||
| A construction that puts no defect term in (LSW) | — |
The reason enters the condition multiplied by is this: when on the right of (5) is replaced by using Bochner, the part can be moved to the left side, but remains without a factor and can only be paid by . The amplification multiplies here.
Two directions — raising the needed side, lowering the insufficient side
Raising the needed side (correcting the choice of tools).
- Localising Bochner. The negative curvature exists only for , and that region is already inside the defect set . From the one-line interval bound (, ) Proved here Lean
negw_le_localized(assumptions: , , ), and using that the kinetic term is positive semi-definite, we get Proved here Leanbochner_localized(assumptions: the identity , ). is a term already paid by (5), so the coefficient of goes down from to (; about 1/32). - Optimising the Gibbs tilt. in (2) may also satisfy , and at , which maximises , the cost is replaced by Proved here (maximum of a concave function of one variable) Lean
tilt_cost_le(assumptions: , ).
The closing condition with both combined is , and the needed value is . Raising the threshold further to near gives , and the condition becomes in effect .
| Form | Remarks | |
|---|---|---|
| Original form (road defining defects by lumps of length 8 or more) | ||
| Original form (road defining defects by three sites) | Negative / / | At it does not close even with |
| Gibbs tilt only | Three-site road | |
| Localised Bochner only | Negative / / | As above |
| Both combined | As above. Leanjudge_i_inside (assumptions: , , , ) | |
| Raising the threshold to | and are floating-point lattice values |
Lowering the insufficient side (rebuilding the upper bound on ). The upper bound on for the three-site window is in the current construction Reading (including estimates), which is 74 / 31 / 29 times outside the needed value with both combined, and 14.5 / 6.2 / 5.7 times outside the needed value with the threshold raised (the latter is an estimate that assumes the same upper-bound technique gives the same value when the threshold is raised). On the other hand, the lower bound on measured by test functions is and does not exclude the needed value. That the true lies within the needed value is not excluded; what falls short is the way the upper bound is built. This is the starting point of the three strands of route 5.
The threshold mismatch — an example where the condition, taken literally, gave nothing
(Σ.3) uses , with a set determined only by the marks of the window . In Table 1, , and were values measured with the defect threshold , while was measured with the mark threshold . If , the atom of marks "all marks in the window on the valley side" contains points with , that is, points of . The only set determined by the marks that contains is the whole space, so and Proved here (one line of measurability). With the two thresholds mismatched, (7), taken literally, gives nothing. The fix is not to lower to (at the lower bound on the Barta rows becomes negative), but to measure with marks at , which is an order to the insufficient side. It is an example showing that, when numerical constructions are stacked, a step is needed that checks literally whether each of the conditions being composed holds on the same definitions.
The three strands of route 5
The one remaining proposition was attacked in three forms that differ in the functional form of the condition. None of the strands has shown (Σ.5), (T0′) or (H2). All numbers are values on the 0+1-dimensional double well on the lattice . The full list of detour plans and the types of breakage are sent to 10-10.
Strand 1 The componentwise form
On top of the localised Bochner and the Gibbs tilt, adding a form that pays the negative curvature at each point by the rarity of that point (paying the curvature with a function of height ) raises the needed value to Reading. The upper bound is built in the product form of "a coarse step" and "a propagation step".
- The coarse step is exhausted. With a mark chain that is multi-valued only in the middle, the logarithmic Sobolev constant of the coarse step is , a ratio of to the lower bound from the indicator of a single point Reading (a rational decomposition on double-precision data). Nothing more can be gained from this step.
- The propagation step has no upper bound. Moving the rest into a weighted conditional Poincaré constant , the needed value is , and the lower bound from a family of test functions is (almost independent of ) Reading. With the Lyapunov-function criterion (of the Bakry–Barthe–Cattiaux–Guillin type Cited, checked in a restatement in a secondary source), the family of Lyapunov functions that do not depend on the far end was times outside the needed value on the top face . Measuring by duality the best of a split family extended to the far end goes beyond this leading term, but on the finest grid it stops at = times the needed value Reading (grid values; the lower goes, the more sensitive to the grid). The floor that holds for all Lyapunov functions is (uniform in ) Reading Lean
tilt_g1(assumption: ), and the form of the criterion itself can get below the needed value.
The remaining step: a Lyapunov function with a coupling term between neighbours that lowers the finite- correction. Grades: Reading and Assumption.
Strand 2 The scalar form — Proposition P5
This form does not split the gradient into components: it applies Bakry–Émery to the convex bottom (the box on the valley side) and pays for the band at the top by the Gibbs step at each site. The condition is only , and , , and are not needed, but enters as , so it works only over a finite range of core lengths. The Poincaré constant of the core becomes the sum of and a remainder (Rem2), and, restricted to the first eigenfunction, the remainder only needs to be small, . Proposition P5 turns this into a proposition with a table of assumptions.
0+1-dimensional double well, , , core length , central lump , the first non-zero eigenfunction. Under the rows of Table 3, at each node of , the remainder quantity satisfies , with and .
Leanpath5_conditional (assumptions, named: the remainder inequality, the proxy ratio, the rarity, the arithmetic margin ), p5_assembly (assumptions: the proxy ratio, the rarity, the threshold, arithmetic, monotonicity).
| Row | Statement (one line) | Grade | Notes |
|---|---|---|---|
| Spec | Discrete spectrum, existence and regularity of eigenfunctions, simplicity of | Assumption | Regularity of the Neumann problem on a box with corners does not follow from standard theorems |
| LS1 | Logarithmic Sobolev with a defect at one site of the band | Assumption | Not yet |
| SB | Convex bottom and propagation in the band () | Assumption | The paper argument is not placed in the book |
| Hλ | Upper bound on uniform in (Rayleigh quotient) | Reading | Interval-arithmetic scheme (1 run per node), not yet run |
| EH | Estimate of localisation in the direction of exit | Assumption | A paper estimate. The IMS localisation formula is Cited (checked in a secondary source) |
| Rare | Rarity of the target , | Reading | Floating-point transfer. Interval-arithmetic scheme with 7 runs per node, not yet run |
| Proxy | Proxy ratio (, ) | Assumption | The only assumption that lifts beyond the measured range: a linear lift from the measured values for two-site lumps, , by per step (tolerance ) |
| BT | Comparison of level sets | Reading | Interval-arithmetic scheme with 3 runs per node, not yet run |
| Num | Arithmetic of the margin | Proved here | Arithmetic |
| Range | Enclosure of between the nodes | Assumption | Not yet. The range is point values at 8 nodes |
The number of runs to move to interval arithmetic is 8 nodes × 14 runs = 112 runs plus the enclosures between the nodes, and not a single one has been run yet. Slightly beyond the two conditions no longer hold together on the same window (they do not hold together at Reading), and it does not extend towards either, because the estimate in the direction of exit is not uniform, by . Proposition P5 is a proposition with a table of assumptions on a finite range at the lower end of the window.
Strand 3 The Feynman–Kac form
In the form that keeps the Feynman–Kac weight on the diagonal of the comparison, what is needed is that the logarithmic Sobolev constant of the whole core is with (the question extends to the coefficient of ). The lower bound from a family of test functions is Reading, a margin of 1.6–1.9 times. Splitting into radial chains, the chain constant is times the needed value (on the model chain) Reading, and what remains is the quantity in the Helffer–Sjöstrand representation Cited (bibliographic only; the statement is unchecked, so this book treats it as Assumption), with threshold , that is, ( is the ratio of the needed value to the chain constant).
- Monte Carlo reading: values from below after searching for starting points, () and (); adding 3σ gives = 0.54 times the threshold Reading (the maximum over starting points, not an upper bound over the whole fibre = assumption (MC-sup)).
- Paper upper bound: a pathwise Grönwall-type upper bound counted at the same points along the same paths gives = about times the threshold Reading. Most of the width comes from the step where the scalar Grönwall discards the direction of the gradient and reduces every direction at the softest rate. The version that controls the contraction by the smallest eigenvalue of the time-averaged matrix is false Lean
mbar_bound_false(a two-dimensional counterexample, no assumptions).
The remaining step: an upper bound that keeps the direction (a matrix Lyapunov function along the path, or an estimate split into soft and hard subspaces).
The three side by side
| Strand | How far it got | Grade | Range of | The remaining step |
|---|---|---|---|---|
| 2 Scalar | Proposition P5 (with a table of assumptions, one lifting assumption, 112 interval-arithmetic runs not yet made) | Assumption + Reading | 8 nodes of | Interval arithmetic at each node, enclosures between the nodes, making the lifting assumption explicit |
| 3 Feynman–Kac | 0.54 times the threshold by the Monte Carlo reading. The paper upper bound is times the threshold | Reading | , | An upper bound that keeps the direction |
| 1 Componentwise | Went beyond the leading term of the Lyapunov criterion, but 5.5 / 2.6 / 1.4 times the needed value. The floor for all Lyapunov functions is 31 | Reading | Three points | A Lyapunov function with coupling terms |
Table 4 is not a ranking of which strand is "close". Strand 2 has a form only at the lower end of the window, and only strands 1 and 3 have forms that cover the whole window. Read progress by the grade of each row.
The common wall — the curvature at one site at the top, against
The Hessian of the action of the core is, on the lattice , the tridiagonal matrix
(the neighbour term gives on the diagonal and next to it). Looking at one row, the diagonal is , and the sum of the absolute values of the couplings to the neighbours is . At the top , , so
, and diagonal dominance fails by Proved here. Row-by-row estimates (Gershgorin discs) only go as far as "smallest eigenvalue ", and in fact on the face where every site is at the top, the smallest eigenvalue of a lump of sites with both ends fixed is , negative for Proved here (the closed formula for the eigenvalues of ). To check by hand: at , ; at , .
The three strands came back to this one-line shortfall in changed forms.
- However the Barta weight is chosen, the floor of the row of the one-site weight at the top is .
- The criterion of the uniform road of strand 1 was with diagonal and coupling .
- The top face where the Lyapunov criterion of strand 1 stopped is exactly the face where the gradient of the action vanishes.
- In strand 3, the coefficient of lived in the radius from the corner at the top (the non-convex direction of the plateau).
Why the wall is universal (one line). Tools whose entrance is convexity (a positive lower bound on the Hessian) — Bakry–Émery, Brascamp–Lieb, the Barta rows, diagonal dominance — must, since the Hessian really has a negative direction on the plateau at the top, pay this somewhere with the rarity (entropy) of the plateau, and enters that payment. A detailed study of this view, and other viewpoints that do not rely on convexity, are treated in Part 11 (11-06).
The table of the five grades — the rows of the sector framework and route 5
| Row | Statement (one line) | Grade | Grounds | Range of | Machine checking |
|---|---|---|---|---|---|
| LSW | Input (LSW) (the form of logarithmic Sobolev for the marginal on the window) | Assumption | §02 (4) | — | — |
| PF | (PFseg) (locality of volume on the bridge) | Assumption | §02 (Σ.4) | — | — |
| BAR | Barta rows , | Assumption | §02 (Σ.5) (the paper argument is not placed in the book) | Independent of | — |
| REG | Vanishing of the Bochner boundary terms and regularity of eigenfunctions | Assumption | §02 (Σ.5) | — | — |
| PROX | The lifting assumption of Proposition P5 and the other Assumption rows of Table 3 | Assumption | §05 Table 3 | — | — |
| BOC | The integrated form of Bochner's formula | Cited | Proposition 1.3 of Ledoux's lectures (checked in the original text) | Independent of | — |
| ELL | Reading | §02 (Σ.4) (transfer matrix, including extrapolation) | Three points | — | |
| AW | Upper bound and lower bound on | Reading | §03 (including estimates / family values) | Three points | — |
| S1 | (Σ.1) Sum over sectors | Proved here | §02 | Independent of | var_split_cells (no assumptions), cell_sum_sup (assumptions: , ) |
| S2 | (Σ.2) The Gibbs variational inequality (2) and (3) | Proved here | Proof in §02 | Independent of | gibbs_ln2_cell (assumptions: , , ) |
| S3 | (Σ.3) Componentwise localisation (5) ⟸ LSW | Proved here | §02 | Independent of | comp_sum_le (assumptions: , the inequality for each component) |
| SK | The scalar form is not uniform in | Proved here | §02 (Σ.3) | Independent of | scalar_not_uniform (assumption: ) |
| S5 | (Σ.5) Composition (6) and the closing condition (7) | Proved here | §02 | Independent of | comp_close (assumptions: , , , Barta, (5), Bochner) |
| AMX | The needed value (8) | Proved here | §03 (the values are arithmetic on ELL, hence Reading) | Three points | — |
| R1 | Localised Bochner (9) | Proved here | §03 | Independent of | negw_le_localized, bochner_localized (the assumptions are in the text of §03) |
| R2 | Optimising the Gibbs tilt | Proved here | §03 | Independent of | tilt_cost_le (assumptions: , ) |
| AM2 | The needed value with both combined | Reading | §03 Table 2 | Three points | judge_i_inside (assumptions: lower bounds on the measured , ) |
| THR | With mismatched thresholds | Proved here | §04 | Independent of | — |
| P5 | Proposition P5 | Assumption | §05 strand 2 (a construction on the Assumption rows PROX and Spec) | 8 nodes of | path5_conditional, p5_assembly (the assumptions are in §05) |
| ST1 | How far strand 1 got (1.4–5.5 times the needed value, floor 31) | Reading | §05 strand 1 | Three points | tilt_g1 (assumption: ) |
| ST3 | How far strand 3 got (reading 0.54 times, paper upper bound times) | Reading | §05 strand 3 | Two points | mbar_bound_false (counterexample, no assumptions) |
| WALL | Diagonal dominance fails by at one site at the top | Proved here | §06 (11) | Independent of | — |
| LSWb | (LSW♭) | Assumption | Route 5 | — | — |
The "Proved here" rows of Table 5 are all either algebra on assumption rows or general inequalities whose proofs are placed in the text. They do not mean that a lower bound on the gap of the core has been shown unconditionally.
The dependency graph
The format is the same as 10-05 §07, and the numbers to the right of "⟸" are always placed smaller than the number on the left.
[01] ASM LSW input (LS_W) ħ: —
[02] ASM PF (PF_seg) ħ: —
[03] ASM BAR Barta rows κ = 3/1000, b = 493/1000 independent of ħ
[04] ASM REG Bochner boundary terms and regularity ħ: —
[05] ASM PROX Assumption rows of Proposition P5 (lifting assumption etc.) ħ: —
[06] ASM LSWb (LS_W♭) A_W < A_max ħ: —
[07] CIT BOC integrated form of Bochner's formula independent of ħ
[08] RDG ELL ℓ_min = 38.3 / 121.9 / 406.8 ħ: three points
[09] RDG AW upper and lower bounds on A_W ħ: three points
[10] PRV S1 (Σ.1) sum over sectors independent of ħ
Lean var_split_cells, cell_sum_sup
[11] PRV S2 (Σ.2) Gibbs variational inequality independent of ħ
Lean gibbs_ln2_cell (assumptions: p ≥ 0, ℓ ≥ 0, p·e^ℓ ≤ 1)
[12] PRV S3 (Σ.3) componentwise localisation (5) ⟸ [01][10][11] independent of ħ
Lean comp_sum_le
[13] PRV SK the scalar form is not uniform in k independent of ħ
Lean scalar_not_uniform (assumption: p > 0)
[14] RDG S4 (Σ.4) ℓ_min does not depend on k ⟸ [02][08] ħ: three points
[15] PRV R1 localised Bochner (9) ⟸ [04][07] independent of ħ
Lean negw_le_localized, bochner_localized
[16] PRV R2 optimising the Gibbs tilt independent of ħ
Lean tilt_cost_le
[17] PRV S5 composition (6), closing condition (7) ⟸ [03][04][07][12][14] independent of ħ
Lean comp_close (assumptions: Barta, (5), Bochner)
[18] PRV AMX needed value (8) ⟸ [17] independent of ħ
[19] RDG AM2 needed value 25.1 / 90.3 / 312.3 ⟸ [08][15][16][18] ħ: three points
Lean judge_i_inside (assumption: lower bounds on the measured ℓ)
[20] PRV THR with mismatched thresholds ℓ = 0 independent of ħ
[21] ASM P5 Proposition P5 ⟸ [05] ħ: 8 nodes
Lean path5_conditional, p5_assembly
[22] RDG ST1 how far strand 1 got ⟸ [19] ħ: three points
[23] RDG ST3 how far strand 3 got ħ: two points
[24] PRV WALL diagonal dominance fails by ¼ at the top independent of ħ
[25] PRV CORE positive lower bound on the core gap uniform in k ⟸ [06][17] ħ: —
How to check. The rows with ⟸ are [12] ([01][10][11]), [14] ([02][08]), [15] ([04][07]), [17] ([03][04][07][12][14]), [18] ([17]), [19] ([08][15][16][18]), [21] ([05]), [22] ([19]) and [25] ([06][17]). In each the numbers on the right are smaller than the one on the left, so there is no circle.
What to read. The conclusion [25] depends, through [17], on the structural steps ([10]–[14]) and the input assumptions ([01]–[04]), and further on the assumption row [06] (the one remaining proposition). The candidates to support [06] are the three strands [21][22][23], and none of them shows [06] ([21] is a proposition with a table of assumptions at the lower end of the window, [22][23] are readings). [20] is a checking row: unless [01] and [03] are measured at the same threshold, [12] is empty. [24] explains where the three strands stopped, and is a premise of no conclusion.
We also check that the statements of the assumption rows do not contain the quantity of the conclusion. The quantity of the conclusion is the gap of the measure of the core. [01] and [06] are logarithmic Sobolev constants of the marginal of the marks on the window, [02] the remainder of the transfer operator of a scrap, [03] the lower bound on the weighted rows, [04] the boundary terms and regularity, [05] the remainder quantity and the proxy ratio. None of them contains .
To the next chapters
The full list of detour plans tried for route 5 (twenty-two, plus two born along the way, and their derivatives) and the types of breakage that appeared repeatedly are treated in 10-10. The construction that controls the core constant in three steps from the side of the box is 10-11. This part places Assumption H at the axis of the study, and this chapter has said how far the core row of (H2) of its first step could be built. A viewpoint that handles the negative curvature at the top without relying on convexity is treated in Part 11 (11-06).
What this chapter can say
| What is said | What is not said |
|---|---|
| Proved here The constructions of (Σ.1)–(Σ.3) and (Σ.5) of the sector framework, the closing condition (7), the needed value (8), the localised Bochner and the Gibbs tilt, the consequence of the threshold mismatch, the failure of diagonal dominance at the top Lean (algebra) | The inputs (LSW), (PFseg), the Barta rows, regularity |
| Reading The needed value , the gap of 29–74 times to the upper bound on , how far the three strands got | The one remaining proposition (LSW♭). Hence the core row (T0′P) and condition (H2) |
| Assumption Proposition P5 (8 nodes of , with a table of assumptions) | Interval arithmetic for Proposition P5, between the nodes, the upper half of the window and |
Sources and reproduction
| Item | Kind | Source / tools |
|---|---|---|
| The integrated form of Bochner's formula | Cited | M. Ledoux, Sém. Probab. XXXV, LNM 1755 (2001) 167–194 (Proposition 1.3; text checked). |
| Lyapunov functions and criteria for local Poincaré | Cited | D. Bakry, F. Barthe, P. Cattiaux, A. Guillin, Electron. Commun. Probab. 13 (2008); D. Bakry, P. Cattiaux, A. Guillin, J. Funct. Anal. 254 (2008) 727–759 (Theorem 3.6 checked in a restatement in a secondary source). |
| The IMS localisation formula | Cited | H. L. Cycon, R. G. Froese, W. Kirsch, B. Simon, Schrödinger Operators, Springer 1987 (checked in a restatement of §3). |
| The Helffer–Sjöstrand representation | Assumption | B. Helffer, J. Sjöstrand, J. Stat. Phys. 74 (1994) 349–409 (bibliographic only; statement unchecked). |
| The Gibbs variational inequality, sum over sectors, componentwise localisation, composition | Proved here, Lean | Proofs in §02 of the text. var_split_cells, cell_sum_sup, gibbs_ln2_cell, comp_sum_le, comp_close, scalar_not_uniform. |
| The two corrections on the needed side | Proved here, Reading, Lean | §03. negw_le_localized, bochner_localized, tilt_cost_le, judge_i_inside. The rarity exponents from the transfer matrix (midpoint rule, the smaller of grids 600 and 1200). |
| Numbers of the three strands | Reading, Lean | Strand 1: duality and the primal problem on floating-point grids (grids 40–160), tilt_g1. Strand 2: floating-point transfer, path5_conditional, p5_assembly. Strand 3: Monte Carlo of the adjoint estimator (32 paths, search for starting points), mbar_bound_false. |
Words used in this chapter — sector framework, sector, mark, site window, defect set, rarity exponent, Gibbs variational inequality, componentwise localisation, closing condition, needed value, choice of tools and structure, threshold mismatch, the three strands, Proposition P5, lifting assumption, the common wall, diagonal dominance. Their meanings are in A-02 Glossary.
Next chapter to read: 10-10 The list of detour plans — types of breakage — puts the detour plans into one table with "the line that killed it", and reads the three sides (the needed side, the form, the floor) and the types of breakage that appeared repeatedly.
← 10-08 What computer-assisted means — the conditions on the chain inside the windowContents10-10 The list of detour plans — types of breakage →