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
- 9-07 A map of the tools — where the known tools used by this book live
- 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)
- The ultraviolet wall — the foundation beneath both roads
- Part 15 Ultraviolet control — what it means to close at infinitely many steps
- 15-00 Entrance — what ultraviolet control is
- 15-01 Why the ultraviolet is hard — dimensionless coupling, group-valued fields, gauge
- 15-02 A map of the sources — Bałaban's programme, the BBS chain, two rows absent from the sources
- 15-03 The decomposition statement — a class that closes with finitely many parameters, and three remainders
- 15-04 The one-link heat-kernel class and the hierarchical model
- 15-05 The flux-network theorem — the transverse contraction and the parameter flow in one projection
- 15-06 Counting the parameters — couplings by loop shape and the attracting class
- 15-07 Background-dependent fluctuations η — absorption step by step
- 15-08 The four rows that do not close, and proposals for them
- 15-09 What cannot be said, the index of questions, the dependency diagram
- 15-10 Systematic attempts — naming the recurring patterns of the record
- 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
- A-08 私達の研究における証明までの道標
Systematic attempts — giving names to the recurring patterns of the record
This chapter is this book's study. It is not a component of the proof on the main line of argument. §01–§03 and §05 are restatements in known frameworks, and §04 is at the level of an estimate.
What this chapter shows — We give names and definitions to five pieces of handwork that came up again and again in the record of computations in Part 15. The first is the estimate of a matrix that "exceeds 1 in one step but contracts when several steps are taken together" (the dominant matrix); the second is what is lost when signs are discarded to take an upper bound (the loss from discarding signs); the third is the choice made when a map determined only on a constraint is represented by a local kernel (the local representative); the fourth is the matching of the two expansions at strong and at weak coupling (the double valuation); the fifth is the computation that bounds a polynomial of degree by an cone and pulls it back step by step (the cone calculus). For each we write candidate theorems, show row by row which known result each one restates, set out which quantity each number of the record corresponds to, and gather the remaining questions as F-SYS1–F-SYS16.
Reading level — Third year and above. §01 uses the linear algebra of non-negative matrices, §02 inequalities for finite sums, §03 Fourier series on the lattice, §04 only the leading terms of asymptotic series, and §05 inequalities for finite sums and the statements of interpolation theorems. §00 and the opening paragraph of each section alone can be read by second-year students.
Prerequisite chapters — 15-05 Theorem G′ (local representatives and an upper bound uniform in the volume), the corollary in 15-05 (the weighted Stein bound and the cone), 15-08 §06 (the W coordinates and the multi-step cone).
Said first — This chapter is not the main line of argument. Its results have no direct effect either on ① ultraviolet control or on ⑦ the crossover band of the ledger (14-02). Many of the candidate theorems are restatements of known facts — the Perron–Frobenius theorem, the Collatz–Wielandt formula, Gelfand's formula, contraction in a weighted maximum norm, the order of multigrid transfer operators, the sum rules of subdivision, the Riesz–Thorin interpolation theorem, the Schur test — and no novelty is claimed. What is new in this chapter lies on the side of the "questions". The aim is to write out which quantity of a known framework each number of the record corresponds to, and where it goes beyond the known framework. Labels are attached row by row: Lean (a statement that passed in a Lean file), Computed (a floating-point computation, not an interval estimate), Reading (only a line of argument on paper, or at the level of the abstract of a source), Cited (a standard known fact), Assumption (an estimate).
- What this chapter shows — the four patterns and how to read this chapter
- Dominant matrices and k-step contraction — how to build a weight that contracts in one step (Table 1)
- The loss from discarding signs — the loss is the inverse square of the alignment (Tables 2–5)
- The geometry of local representatives — the order of folding does not depend on the representative (Tables 6 and 7)
- The geometry of the double valuation — a scale-independent κ and the lens (Tables 8–10)
- The cone calculus — the window is an interval; the correct form of dilution (Tables 11 and 12)
- Dictionary with the known, what can be said, questions (Tables 13–15)
What this chapter shows
How to read this chapter. The record of computations in Part 15 contains the same kind of handwork again and again. There are five kinds: measuring the norm of a three-step composite and writing "it exceeds 1 in one step but contracts in three"; taking the absolute value of a signed kernel to build an upper bound; applying a local kernel to a map that is determined only on fields satisfying the Bianchi identity; setting the leading terms of the strong-coupling and weak-coupling series side by side to look for the point where they meet; and pulling a degree- cone back step by step and bounding it by the weighted Stein bound. This chapter is an attempt to give each of them a definition and axioms (what can be said under what assumptions). Many of the results are restatements of known facts, and we say so row by row for the candidate theorems of each section. What remains after the restatement — quantities that do not correspond directly to a known framework, and regularities shown by the numbers of the record that have not been made into theorems — are the questions of this chapter. §01–§03 can be read independently of one another. §04 shares no tools with §01–§03; it is an attempt to restate the band of ⑦. §05 extends Candidate 1.4 of §01 to the language of cones and can be read alongside §01.
Dominant matrices and k-step contraction
The non-negative matrix that lists the norms of the blocks of an operator split into blocks transfers estimates of powers of the operator to estimates of powers of a non-negative matrix. On the side of non-negative matrices the Perron–Frobenius theory applies as it stands, so "in how many steps does it contract" and "with which weight must we measure for it to contract in one step" can be written in the language of matrices. Everything up to this point is known; the role of this section is to bring the estimates of the record into line with this framework.
Definitions
Definition 1.1 (dominant matrix). Let be a finite set, () normed spaces, and an operator on split into blocks . A non-negative matrix is a dominant matrix of if for all we have . The smallest one is the matrix of block norms .
- Products and powers: (entrywise). Hence if are dominant matrices of , then is a dominant matrix of and is a dominant matrix of Lean (
norm_mul_apply_le,dominant_mul,dominant_pow; the power version assumes that the identity has norm 1). - The class is also closed under sums and non-negative scalar multiples Reading.
- The max-plus side: for the maximal cycle mean of (entrywise), Cited (Friedland 1986). In the record, the max-plus eigenvalue bounded the optimal weighted norm from below to within 1–2.5% Computed.
Definition 1.2 (weighted block norm). For a positive weight , , and the version is . The operator norm is ().
Definition 1.3 (-step contraction, transient constant). For a non-negative matrix put ; when for some we say that it "contracts in steps". The transient constant is . By Gelfand's formula , is equivalent to for some Cited.
Definition 1.4 (one-step weight). For , , , we call
the one-step weight built from .
Candidate theorems and labels
Candidate 1.1 (from -step contraction to a weight that contracts in one step). If , , , and (entrywise), then and Lean (liftWeight_step; lemmas mulVec_pow_succ, pow_mulVec_nonneg).
Combined with Candidate 1.2 (the one-step estimate), this says that if "the -step composite contracts by a factor in the weight ", then "measured in the weight it contracts by a factor in every step". The weight ratio lies in , so the constant of re-measurement does not depend on the number of steps (Candidate 1.3). The content is the constructive half of " ⇔ there is with ", known from Varga's analysis of iterative methods and from the line of Berman–Plemmons on the characterisation of M-matrices Cited.
| Candidate | Statement (one line) | Label | What it restates |
|---|---|---|---|
| 1.1 | ⇒ , | Lean | The constructive half of the Varga / Berman–Plemmons characterisation of M-matrices Cited |
| 1.2 | () ⇒ . Even with differing from step to step, | Lean (weighted_step, weighted_iter) | Collatz–Wielandt: (the equality itself is not in Lean) Cited |
| 1.2′ | Given right and left positive Perron vectors , gives , and further | Reading | The Schur test applied to Cited |
| 1.3 | If (), a sequence that contracts by in each step in the weight satisfies in the weight | Lean (weight_change) | An elementary fact about equivalence of norms |
| 1.4 (a) | , , () ⇒ | Lean (norm_pow_block_le, norm_pow_le_const_mul) | A finite version of Gelfand's formula Cited |
| 1.4 (b) | ⇒ (independent of ) | Lean (sum_norm_pow_le; lemmas geom_sum_le_inv, sum_range_mul_eq) | An estimate of partial sums of the Neumann series |
| 1.4 (c) | (, ) ⇒ | Lean (affine_uniform) | An elementary fact about affine recursions |
| 1.4 second half | If irreducible with a Perron vector , then ( norm). An explicit formula bounding the ratio of by the entries of | Reading (the explicit formula is not written out in full) | Minc's ratio estimate Reading |
| 1.5 | If the matrix obtained by aggregating blocks with satisfies , the original contracts in one step by in the weight . If has two points, , , and , then in the weight we have | Lean (aggregate_step, two_by_two_weight, two_by_two_exists) | An elementary fact about the test for of a two-by-two matrix Cited |
Correspondence with the numbers of the record
- The matrix of the finite types of the W coordinates (quadratic including differences, dimension 6) had spectral radius 0.36, a one-step norm above 1, and 0.05–0.13 in three steps Computed. It is a typical case of with a one-step norm above 1, and the of Candidate 1.4 (a) corresponds to the transient constant. Candidates 1.1 and 1.2 read this as: taking the Perron weight, it contracts in one step (in the record, 0.546 in one step with the Perron weight) Computed.
- The weighted Stein bound of the cone (15-05) was 4.45 in one step and 0.10 in three steps Computed. Put in the form of Candidate 1.1 it would read "if it is 0.10 in three steps, a weight that contracts to in one step can be built", but this requires the three-step estimate to come from powers of a single linear dominant operator. The cone is a quartic quantity obtained through Riesz–Thorin, and the kernel differs from step to step, so it is not a power. What can be used in this case is only the form of a product over steps (
weighted_iter) Reading. - The pair of finite types and remaining returns has the form of the two-by-two aggregation of Candidate 1.5. Putting the remaining block in the lower right and checking has not yet been done (F-SYS4).
- The Dobrushin column sum used in the coarse chain of the double well in Part 10 is Candidate 1.2 with the weight . Taking the Perron weight could improve the contraction constant Reading.
A question proper to this pattern — the loss from discarding signs
A dominant matrix discards signs. For the actual operator and a dominant matrix , define the loss at step as
Then the loss is not necessarily bounded in the number of steps. has as a dominant matrix, , and every entry of is . Hence for Lean (absEx_eq, signedEx_sq, absEx_pow). Conversely, if is non-negative () or sign-similar, ( a diagonal matrix of ), then in the norm with the Perron weight Reading.
How far the choice of signs can reach towards the estimate of is treated by Rump's sign-real spectral radius (Rump 1997) Reading. We have not found a source that treats how the loss behaves over steps (not found, which does not mean there is none). In the record the loss grows only slowly, 7.6 in one step and 9.3 in two, and the conditions for making this a theorem are not determined by the information of the dominant matrix alone (the example above shows this). We take up this question in §02.
The loss from discarding signs
A closer look at the loss in the record showed that it was of a different type from the counterexample of §01. The Stein bound of the record takes the upper bound after composing the step kernels. The counterexample of §01 is a quantity that composes after taking absolute values. In the former, the upper bound of the composite for the nilpotent example is also 0. In this section we see from the numbers that the loss with the upper bound taken after composition hardly moves over steps, and we write an inequality that bounds it by a geometric quantity within a single row (the row alignment).
Definitions
Definition 2.1 (composite kernel and loss). Write the composite of the step kernels as . Let the true ratio be , and the Stein bound the weighted quantity of the form of (11) of 15-05 (weighted by the norms of the rows of the composite kernel); we put
The true ratio is replaced by a lower bound from maximisation (the larger of a quasi-Newton method and a maximisation over period-2 fields), so the loss in the tables is an estimate of the loss from above.
Definition 2.2 (row alignment). The Stein bound of a translation-invariant has the form ; let be its maximiser. Put , , and call
the alignment of row in the worst direction ( is coherence_le_one Lean). is the average weighted by .
The numbers of the record — the loss stops, and falls a little
| k | Stein | Lower bound of the true ratio (quasi-Newton / period 2) | Loss | Step ratio: lower bound | Step ratio: Stein |
|---|---|---|---|---|---|
| 1 | 3.708 | 0.5903 / 0.5566 | 6.28 | — | — |
| 2 | 0.7746 | 0.1405 / 0.1405 | 5.51 | 0.238 | 0.209 |
| 3 | 0.07632 | 0.014967 / 0.01497 | 5.10 | 0.107 | 0.0985 |
| 4 | 0.00576 | 0.001095 / 0.00109 | 5.26 | 0.073 | 0.0755 |
The true ratio and the Stein bound decrease at the same rate (both step ratios tend to about 0.07), so the loss stops. The shape is the same on larger tori (Table 3). The earlier recorded two-step value 9.3 was due to a weak lower bound of the true ratio, 0.108; with period-2 fields the lower bound becomes 0.1405 Computed. For , 99.8–100% of the energy of the maximiser of the true ratio was at , sitting on period-2 points of type Computed.
| k | Torus | Stein | Lower bound of the true ratio | Loss | Product of per-step Stein ÷ lower bound |
|---|---|---|---|---|---|
| 1 | 4.431 | 0.591 | 7.50 | 7.5 | |
| 2 | 0.9554 | 0.1405 (period 2) | 6.80 | 182 | |
| 3 | 0.09575 | 0.01497 (period 2) | 6.40 | ||
| 3 | 0.09092 | 0.014955 | 6.07 | — |
The rightmost column is the product of the one-step upper bounds of each step (4.45, 5.75, 6.50, 6.81) divided by the lower bound of the true ratio; it grows by a factor of 60–90 per step, 7.5 → 182 → → Computed. Only the side that composes after taking absolute values grows exponentially. This column shows how much is gained by taking the upper bound on the composite kernel.
The three hypotheses failed, and they failed in the same way
As reasons for the loss stopping we tried three: (a) composition reduces the proportion of the negative part; (b) the cancellation takes place within a cell; (c) the signs align at the maximiser of the true ratio. None of them holds in the form written. All three, however, failed in the same way: "it does not change over steps".
| Hypothesis | Quantity | k=1 | k=2 | k=3 | k=4 () | Verdict |
|---|---|---|---|---|---|---|
| (a) | Proportion of the negative part (row signs chosen freely) | 0.411 | 0.432 | 0.435 | 0.426 | Does not hold (constant at about 0.43; on , 0.405, 0.425, 0.427, 0.426) |
| (b) | Inner shell (distance 0.5–1.5): share of / negative proportion | 0.58 / 0.22–0.33 | 0.48 / 0.32 | 0.44 / 0.31–0.37 | 0.53 / 0.32–0.38 | Does not hold (the cancellation is between the positive centre and the negative ring at distance 1.5–2.5; summing over blocks leaves 41–56% of ) |
| Outer ring (distance 1.5–2.5): share of / negative proportion | 0.33 / 0.59–0.63 | 0.38 / 0.56–0.60 | 0.40 / 0.53–0.60 | 0.46 / 0.53–0.59 | ||
| (c) | Alignment / efficiency at the maximiser | 0.74 / 4.5% () | 0.56 / 1.3% () | 0.57 / 1.5% () | 0.60 / 1.8% | Does not hold (the alignment stops at around 0.6) |
| — | Row alignment in the worst direction | 22.9 () | 10.6 (), 5.55 () | 10.2 (), 5.13 () | 5.31 | Bounded over steps |
That all three quantities hardly move over steps can be read as showing not that "composition brings the kernel closer to positive" but that "composition brings the profile of the kernel (its normalised shape) closer to a single one" Reading. A profile positive at the centre and negative around it, a negative proportion of 0.43 and an alignment of 0.6 are kept independently of the step. This is close to the view of the limit function of subdivision Reading. Note that the signs "positive at the centre, negative around it" depend on the sign convention for the components of the direction; what does not depend on the convention is the negative proportion and the alignment.
The inequality that held — loss ≤ inverse square of the alignment
Candidate 2.1. Suppose , , , for every component, and for every row. Then
Lean (stein_le_inv_sq_mul_test; lemmas stein_form_le, sum_four_le). The bracket on the left is the value of the Stein quadratic form and the right-hand side is the value of the test, so it reads "upper bound ÷ test value ".
On the lattice, using as the test the real plane wave in the worst direction , we get
is the phase factor; it is 1 if and , and also 1 at period-2 points () if is taken real Reading (the average of cancels between numerator and denominator; this step and the Stein formula itself are not in Lean).
- For on the torus, the maximiser of Stein was a period-2 point, and its plane wave was itself the maximiser of the lower bound of the true ratio (test values 0.1396, 0.01487, 0.00109). Then Stein ÷ test value 5.55, 5.13, 5.31, and the shape factor and the phase factor were exactly 1 Computed.
- On larger tori the maximiser of Stein moves away from period 2, and becomes 22.9, 10.6, 10.2 (). As an upper bound of the loss it is bounded and falls over steps, but it does not agree with the loss itself (6.4 and so on) Computed.
How to read it: on the side the Stein bound remembers all the signs; what it forgets is only the "row " on the side. So the loss reduces to the amount of cancellation within a row, Reading. This gives a conditional statement — if the alignment in the worst direction is bounded below over steps, the loss is bounded over steps — but that the alignment is bounded below is not shown (F-SYS1).
A pattern that did not apply — positive part dominant
For a sign field , if the negative part of each row is at most times the positive part, then ( the row ), and combined with the Schur test , loss ( the non-uniformity factor of the row ). Under composition degrades additively (alignment ) Lean (coherent_of_neg_le, schur_four, loss_le_of_coherent, comp_coherent).
The theorem is correct, but it does not apply to the kernels of the record. The read from the -weighted average alignment is about 0.46, 0.39, 0.39, 0.35 and is not small; grows as 3.0, 4.5, 8.8, 15.8; and the minimal alignment per row is almost 0 (the assumption of on every row is not satisfied) Computed. The Schur test itself was also two orders of magnitude coarser than the Stein bound (Schur ÷ lower bound 437 → 745 → 1453 → 1777) Computed.
The W coordinates — the absolute value after composition stops at a rank-one value
| k | Compose after absolute value | Absolute value after composing | Negative proportion | |
|---|---|---|---|---|
| 1 | 0.3631 | 1.01 | 1.01 | 0.210 |
| 2 | 0.1249 | 1.08 | 1.06 | 0.325 |
| 3 | 0.0422 | 1.16 | 1.09 | 0.387 |
| 4 | 0.0142 | 1.24 | 1.10 | 0.411 |
| 5 | 0.0048 | 1.33 | 1.10 | 0.421 |
The loss is the ratio of 's (). The value 1.10 at which the side taking the absolute value after composition stops almost agrees with the rank-one value built from the left and right dominant eigenvectors Computed. If the dominant eigenvalue has a gap, , and since and are continuous it converges to this value Reading. The side composing after taking absolute values grows as for powers of a single matrix (here by a factor of 1.070 each time), and is bounded only when , which for irreducible matrices means (Wielandt) Cited. That the absolute value after composition is at most the composition after absolute values (row ) is abs_comp_le, row_l1_comp_le Lean.
The geometry of local representatives
Representing by a local kernel a map determined only on fields satisfying the coarse Bianchi identity — this handwork came up as the choice of "representative" in Theorem G′ of 15-05. In this section we separate the overall shape of the representatives (an affine space), the quantities that do not depend on the representative (the value of the zero mode, and the order of folding restricted to the constraint), and the quantities that do (the overall order of folding and the tail norm). The content is a restatement of the order of multigrid transfer operators and of the sum rules of subdivision (conditions of Strang–Fix type).
Definitions
Definition 3.1 (constrained map and extension). We call a quadruple of finite-dimensional spaces over a field , a subspace and a linear map a constrained map, and a with an extension. Extensions exist (the restriction map is surjective), any two extensions agree on , and the set of extensions is the affine space , of dimension Lean (exists_extension, restrict_surjective, IsExtension.eqOn, isExtension_iff_mem_coset, finrank_freedom). The freedom is 0 only when (; freedom_eq_zero_iff).
Definition 3.2 (lattice representative). The coarse plaquette field is , the constraint subspace is (fields satisfying the coarse Bianchi identity), and the output is a fine plaquette field with components per coarse cell. A translation-invariant kernel whose symbol satisfies for all (with ) is called a representative of , and one that has finite range, exponential decay or is called a local representative. For , has rank 3, the symbol at each is an instance of the template ", , ", and the freedom is -dimensional.
Definition 3.3 (zero mode, moments). We call the zero mode and the moments.
Definition 3.4 (order of folding). For , and the fine position within a coarse cell, the folded component is . We write for the minimal order to which with vanishes as , and for the minimal order of , multiplied by the projection onto the constraint subspace.
Quantities that do not depend on the representative
The zero mode is determined by continuity alone (Candidate 3.1). If is an representative (continuous symbol), , and , then is the unique solution of () Reading. The last step (maps that agree on a family of subspaces whose sum spans the whole are equal) is eq_of_eqOn_iSup, correction_eq_zero_of_iSup Lean. The value in the record is , ( uniformly at every position), with deviation over four steps Computed. On the torus , so the zero mode is unconstrained, and for the symmetric representative on finite tori , , at Computed. This is the numerical trace of the constraint of locality being lost in a finite box.
The minimal-norm representative is not local (Candidate 3.2). (the Moore–Penrose representative) does not lie in unless the limits along different directions agree, because the projection is a function of homogeneous of degree 0 and leaves a memory of direction at Reading. The freedom of local representatives can be seen as the room to repaint this memory of direction into a continuous function. The decay of the kernel has not been measured (F-SYS9).
The order restricted to the constraint does not depend on the representative (Candidate 3.3). With the singular value decomposition , can be written using only the folding of , so is an invariant of . Restriction does not lower the order of vanishing, so for every representative Reading.
| Representative | Construction | (whole ) | (on ) |
|---|---|---|---|
| sym | Rows of the cone homotopy (finite torus) | 0 (–) | 0 |
| A3 | Add the difference of the zero mode at the single point | 1 ( for ) | 1 () |
| A4 | Add to A3 a first-moment correction as antisymmetric pairs at | 2 () | 2 |
| itself | From | — | 2 () |
A4 attains on the whole . That is, within the types of the record, A4 is a representative that reaches the ceiling.
Tail norm and order — D ≤ 4 is the upper limit
Candidate 3.4. In the -step map of the W coordinates ( runs over paths, is a product of foldings), suppose that the representatives of all steps satisfy and that . (a) If , is bounded in the norm on the symbol side . (b) If and the leading coefficient of the paths with is non-zero, then for a peaked input near it diverges at the rate Reading (a line of argument assuming constants uniform in the number of steps; uniformity over infinitely many steps is not treated). In the version restricted to the constraint, is replaced by .
| Representative | Values | Type in Candidate 3.4 | |
|---|---|---|---|
| A3 | 1 | 1.486, 5.88, 23.5, 93.8 (grows as ) | |
| A4 | 2 | 0.01638, 0.01640, 0.01643, 0.01643 (bounded) | constant |
From () it was bounded at , at , and at Computed. All cases in the record fit the types (a)(b). Since , the tail on diverges however the representative is chosen, and this reads as: within the types of the record, is the upper limit for the tail of sup Reading.
The 2 in "" comes from the map of the W coordinates being a congruence with the same representative on both sides. In multigrid the orders of prolongation and restriction can be chosen separately, and there is the rule "order of prolongation + order of restriction ≥ order of the equation" (Hemker 1990) Reading. Here a single representative plays both roles.
Representatives with matched first moments, and the sum rules
Candidate 3.5 (order and shifted jets). Putting ( the symbol of the 6 rows at position ), ⇔ the Taylor polynomial of up to degree does not depend on Reading. The line of argument is together with the orthogonality of the 15 non-trivial characters of (inner product 0 with all of them ⇔ constant).
- : does not depend on ( has this form).
- : the first moments are ( independent of ). From , . This agrees with the target moments used to build A4, . The is (position within the cell ) × ().
The target is determined from the term of . Against 24 unknowns per row (4 directions × 6), the part determined by had rank 20, leaving 4 dimensions of freedom Computed. This count is of the type of a finite-dimensional "extension with conditions": if is surjective, there is a satisfying both and , and the remaining freedom is Lean (exists_extension_with_conditions, finrank_freedom_with_conditions, conditions_count_le). The remaining 4 dimensions were fixed by linear programming to minimise the increase of ; the moments matched the target to within , and the row went from 2.26 to 2.34 (first step) Computed.
Composition of representatives and compatibility
If and are compatible (), the composite of representatives is a representative of the composite, and its value on does not depend on the choice of representatives. If they are not compatible (), the value of the composite changes with the choice Lean (comp_extension_eqOn, comp_isExtension, comp_depends_of_not_le). The chain of W coordinates in the record composes representatives, but whether the output of the representative at step lies in the constraint subspace of step has not been checked (F-SYS8). The difference between the chain on , 0.3426, and the chain, 0.3446, is a clue to this Computed. As examples of norms changing with the representative: the zero-mode correction moved the three-step Stein bound from 0.09743 to 0.09868, and the signed Stein bound went from 4.25 for A3 to 4.48 for A4 (first step) Computed.
Dictionary
- corresponds to the high-frequency order of the representative viewed as a prolongation (Hemker 1990). That the definition by symbols and the definition by preservation of polynomials are equivalent is stated in a later note, and the condition on the zeros of the symbol in Toeplitz multigrid is in Donatelli (arXiv:0807.2565) Reading. is the same as the 16 components of the harmonic subspaces of local Fourier analysis Cited.
- Candidate 3.5 is exactly the standard argument that turns the sum rules of subdivision and wavelets into polynomial generation (Strang–Fix 1973, Jia 1998, Charina–Conti arXiv:1202.3931, Daubechies's vanishing moments) Cited. The part of the target of A4 is a restatement of the sum rule of order 2.
- Two points fall outside the sum rules: (i) the part where is determined by the term of (a condition of the type of order of consistency of differences); (ii) the ceiling set by the constraint . That the masks are not scalars but matrices is within the range of sum rules for vector-valued subdivision Reading.
The geometry of the double valuation
There is no payoff theorem yet. This section is an attempt to restate ⑦ the crossover band of the ledger (13-06) in the language of two valuations, those of the strong-coupling expansion and the weak-coupling expansion. The definitions and the computation of the leading terms are done, but there is as yet no theorem that this view newly says about the band. The labels are mainly Assumption and Computed.
Definitions
The space of couplings : the space of character coefficients of the plaquette weight . Its coordinates are and the shape coordinates.
Two valuations. (strong coupling) is the order on the side (the order in for the Wilson action), and (weak coupling) is the order in on the side . Terms of type are treated as (another branch of the transseries).
Two coordinates. For an observable with values in (, ; the plaquette , for example), the coordinate on the strong-coupling side is and the coordinate on the weak-coupling side is . We write the leading coefficients as (strong coupling) and (weak coupling).
Tie sets. (i) the complementary tie ; (ii) the same-coordinate tie ; (iii) the error tie -term optimal truncations have equal errors. We call the region between the two roots of (ii), , the lens.
The invariant κ and the lens
Candidate 4.1 (a scale-independent quantity). Changing the scale of the coupling as gives , , so
does not depend on the scale. The complementary tie is at , where the value of the leading terms is . The same-coordinate tie is at the roots of , whose discriminant is , so the lens opens only when . The geometric mean of the two roots is always . A tie for the string tension exists only when Reading (the elementary fact of the discriminant of a quadratic).
Looking at the leading term on one side only, the difference between groups is absorbed into the scale. Looking at the leading terms on both sides at once, a change of scale is only a translation in the plane, and the height at which they cross does not move. The view is that the information about the group remains in "the height of the crossing" Assumption.
Examples
| Quantity | ||
|---|---|---|
| Strong-coupling series | ||
| Weak-coupling series | ||
| (the lens is empty, ) | (the lens is the single point ) | |
| , | , | , |
| Complementary tie and the true | , ( at is 2.4469) | 1.0000, ( at is 1.1593) |
| Tie for | None (maximum of the difference ) | 0.232 and 1.399 |
| Error tie () | 3.274 (error ) | 2.124 (error ) |
| Fisher zeros (imaginary axis) | , , … | , , … |
The specific heat has a peak (0.680) at for , while for it rises monotonically to Computed. This difference goes in the same direction as the difference in the sign of ( and ), and can be read as: the difference between groups lives not in the leading terms of the valuations but in the sign of the next term Assumption. That for does not hold for (0.446), so it is not a general law.
The lens of the leading terms alone in four dimensions. Using equipartition , .
| d | Group | Complementary tie | Lens | |
|---|---|---|---|---|
| 2 | 2.449 | None | ||
| 2 | 1.000 | Single point | ||
| 3 | 2.000 | Single point | ||
| 3 | 0.816 | |||
| 4 | 1.732 | |||
| 4 | 0.707 |
The transition of four-dimensional , (13-06), lies inside the lens (not at its centre 0.707). The lens contains the range in the table of 13-06 over which moves from the strong-coupling value to the one-loop value, and also overlaps , where the literature says "neither the strong-coupling nor the weak-coupling expansion works well" (abstract of arXiv:0807.0185) Reading. These are numbers derived only from first-order leading terms and equipartition, without the true four-dimensional series. The overlaps may include coincidence Assumption.
Tie sets under the Migdal–Kadanoff flow
We followed the level lines of the fundamental-representation coefficient after steps of flow from the Wilson action. A level line is an object that does not depend on how is read.
| Group | Difference at step 6, | |||
|---|---|---|---|---|
| 0.1575 | 0.641 | 2.230 | 0.259 | |
| 0.5 | 2.447 | 3.535 | 0.2553 | |
| 0.9 | 14.73 | 15.58 | 0.2511 | |
| 0.1575 | 0.319 | 0.582 | 0.017 (positive while decreasing) | |
| 0.5 | 1.159 | 0.844 | ||
| 0.7 | 2.014 | 1.5101 | (stops) | |
| 0.9 | 5.305 | 4.8478 | (stops) |
- For , the difference per step approaches 0.25 for every (the of the heat kernel). The tie sets escape linearly in the direction of , and in terms of the valuation of the flow, has (a constant) Computed.
- For , the level lines with stop. The one-step movement after the shape has settled, , is at , at 0.78, at 0.88, at 0.99, at 1.09 and at 1.29, and the exponential slope read from the ratios of neighbouring points is 13.4–14.1. It is of type , but has not been identified (it does not reach ). The valuation of the flow is Computed. At floating-point resolution, "stops" cannot be distinguished from "flows at about " Assumption.
- The map on the strong-coupling side, , is the same for both groups once the scale is matched by . Flowing the complementary tie of the strong-coupling leading terms, goes 2.449 → 1.140 → 0.785 → 0.750 and the solution disappears for , while converges 1.0 → 0.5 → 0.361 → … → 0.3152. The candidate for the limit is , that is, the edge of the strong-coupling basin , common to both groups Computed.
- Caution: reading by Wilson's gives on the weak-coupling side for both groups. This is the shift in caused by the Wilson form and the heat-kernel form differing at , and it is not a flow Computed.
Why the candidate theorem does not stand, and a weakened form
The form "a comparison that distinguishes groups is needed only near the codimension-one skeleton of the tie sets" is not expected to hold as it stands Assumption. This is because the distinction between groups already appears at the level of the leading terms, over the whole weak-coupling coordinate, as the valuation of the flow ( for , for ; that is, the presence or absence of ).
Candidate B (weakened form) Assumption. For a family of observables and groups , assume three things: (B1) the maps of the valuations of the strong-coupling coordinate agree for and under matching of the scale by ; (B2) the valuations of the flow of the weak-coupling coordinate differ; (B3) regions , can be taken in which the error of each coordinate is at most times the leading term of that coordinate. Then information beyond the leading terms is needed to decide the direction of the comparison (whether ) only on , and this set shrinks to the lens as .
- What it says: the need to carry the distinction is localised in the lens. It restates the same content as "the band is a bounded interval" of 13-06 in the language of valuations, and does not claim to make the band easier.
- What it does not say: what is needed inside the lens. The transition of is on the branch, so the reading stops at: inside the lens a comparison is needed that handles the transseries branch becoming the same size as the perturbative branch Assumption.
- For the two-dimensional single plaquette with () the lens is empty and Candidate B holds vacuously. However, two-dimensional also has no phase transition, so alone does not determine the phase diagram Reading.
Relation to the known
- A view is known in which the Fisher zeros form the edge of the basin of attraction of the strong-coupling fixed point (Denbleyker–Du–Liu–Meurice–Zou, arXiv:1005.1993; the Wilson action of four-dimensional ) Reading. That the tie of the strong-coupling leading terms is drawn by the flow to the basin edge can be read as the shadow of this view on the real axis Assumption. For a single plaquette, the radius of convergence of the convergent strong-coupling series is the absolute value of the first Fisher zero Cited.
- The error tie (iii) puts into numbers, as it stands, the question of resurgence "which series dominates". For a single plaquette, the optimal error of the weak-coupling asymptotic series was of order Computed.
- Two-point Padé approximation joining the series at the strong and weak ends should be known as a classical way of filling in the lens Reading (the literature has not been checked).
The cone calculus
The record of Part 15 contains the following handwork again and again: bounding a polynomial of degree by an cone , pulling it back by a linear map (the local representative of the blocking), bounding the pull-back factor from above by the weighted Stein bound, checking that it contracts in a composite of several steps even if it does not contract in one step, and absorbing the terms that the loops add at each step into an affine recursion to obtain a bound valid at every step (the corollary in 15-05, 15-08 §06). Like §01–§03, this section is an attempt to give this handwork definitions. Much of the content is a restatement of known facts — the Riesz–Thorin interpolation theorem, Stein–Weiss interpolation with change of measure, the Schur test, Hölder's inequality, and the log-convexity of operator norms in the exponent — and no novelty is claimed. What is new lies on the side of the questions: after setting out which quantity each number of the record corresponds to, we pose as questions the "window" and the "bundle number" as the exponent is varied.
Setting
are finite-dimensional real vector spaces, and we fix one set of coordinates. is the of the coordinates. In the lattice case, is the plaquette field on the coarse torus (6 components per point), is the fine plaquette field arranged as 96 components per cell, and commutes with coarse translations. The supremum of the cone is taken over all of (it is not restricted to the image of the Bianchi identity). Hence the quantities here are upper bounds for the restricted quantities.
Definitions
Definition 5.1 (cone constant). When is a homogeneous polynomial of degree (or grows no faster than that),
In Lean this is written IsCone f N c ( for all ), with an abstract playing the role of .
Definition 5.2 (-contraction). For a linear map ,
In Lean this is written Contracts K N μ ( for all ) and read as "".
Definition 5.3 (row and column ). Put , , . Then , and () Cited.
Definition 5.4 (the weighted Stein bound for general ). For a positive weight put
( is the matrix with on the diagonal). The standard form becomes the bare at , at and at , recovering the and formulas of the record. For commuting with translations, is replaced by .
- Derivation Reading: put ; then . If is the norm of in with weight , then . Interpolating between and with , that is , the norm is at most and the weight on the range becomes . Hence , and from we get .
- The source for the interpolation: interpolation that changes the measure on the range is of the Stein–Weiss form. But the weight has no effect at the end, so taking both ends as statements on the same measure , Riesz–Thorin alone suffices Cited.
- The range of application is ( is needed). At , and the upper bound equals the true value.
Definition 5.5 (bundle number). For a sequence of step maps and a bundle length , put and
If the upper-bound version with replaced by is , then .
Definition 5.6 (window). Fixing the bundle length , put .
Definition 5.7 (affine recursion). (, ). The bundle version is . corresponds to the cone constant at step , and to the size of the degree- terms newly born at that step.
Definition 5.8 (Schur threshold exponent). When , put . The bound of Candidate 5.6 below falls below 1 when .
Candidate theorems and labels
Candidate 5.1 (pull-back and submultiplicativity). If , then Lean (cone_pullback; a map , and may differ). On a single space, (), and Lean (contracts_comp, contracts_iterate, cone_pullback_iterate; ).
Candidate 5.2 (exceeding in one step, contracting in a bundle). If in one step ( is allowed) and in steps, then Lean (block_decay; , ). This is the cone version of Candidate 1.4 (a) of §01. The upper bound itself is not necessarily submultiplicative, so the of a composite is computed directly from the composite kernel Reading.
Candidate 5.3 (log-convexity of the upper bound). is convex in Reading. This is because , and for each the right-hand side is a positive sum of exponential functions of and hence log-convex (Cauchy–Schwarz), and the supremum of log-convex functions is log-convex. What is in Lean is a discrete midpoint version Lean:
weighted_rpow_midpoint: for , , .stein_form_midpoint: its Stein form ().sup_midpoint,midpoint_below_one: from the pointwise midpoint inequality, an upper bound by the geometric mean of the suprema; in particular, if the value at the midpoint falls below 1.
As a consequence, . What looked in the record like " is a little above " was not a comparison of two different upper bounds but the margin of the curvature of a single function . is one number measuring the size of that curvature (Table 12).
Candidate 5.4 (log-convexity of the true -contraction). is also convex in . By Riesz–Thorin, is convex for Cited, and is the perspective of and hence convex Reading. Candidate 5.3 is what can be said directly about the upper bound (as a sum of exponentials), while Candidate 5.4 is what can be said about the true from convexity in through the perspective. They rest on different things. There are two consequences Reading.
- The window is an interval (the set where a convex function is negative).
- From the asymptotic slope is , and by convexity for . For this is the same as using Riesz–Thorin between . The upper-bound version follows directly Lean (
weighted_rpow_shift: for , , , ;sup_shift: moves the pointwise inequality to the supremum).
Candidate 5.5 (bundle number and spectral radius). For a fixed finite-dimensional operator , Gelfand's formula gives , and does not depend on Cited. Hence " ⇔ ", and only the smallest changes with . This is the same fact as Definition 1.3 of §01, said in terms of the -contraction. The blocking map, however, is a map from the coarse lattice to the fine lattice, not a single operator on one space. Identifying the fine lattice back with gives the type "dilation by 2 and convolution" (a subdivision operator), and for this type the spectral radius depends on Reading.
- A constant field gives a dimension count. The plaquette field shrinks by a factor of about in one step while the number of points grows by , so the ratio for a constant field is about per step Reading. The recorded values at were 1.080, 0.2807, 0.07297, a factor of about for each increase of by 1 Computed. This agrees with the dimensional reading that is marginal ( is dimensionless in four dimensions) and that for , acts in an irrelevant direction.
- The link with dominant matrices (§01): from we get , and the Perron weight can be used for . In the kernels of the record, however, the cancellation of signs is large: is much smaller than Computed. Moving to loses this factor of about 6 at the outset. This is one number, in , for the loss from discarding signs of §02 Reading.
Candidate 5.6 (the correct form of dilution). The naive form "if the row sums are 1, the entries are non-negative and each entry is , then " does not hold in general Reading. An averaging map preserves constant fields, so if it is square, (a constant field is a counterexample). What holds is the following.
- The version of the Schur test: for , , that is Lean (
row_rpow_le: by Jensen;lp_schur: row , column , ). If , the upper bound on decreases in with ratio and falls below 1 for . - Its equality: if all row sums are and all column sums are , equality holds for a constant field Lean (
lp_schur_sharp). The Schur form cannot be improved in general. - Dilution of a localised field: for a field, (, ) Lean (
delta_dilution). If the entries are at most , this is a factor of . The dilution works only for localised fields; spread-out fields are diluted only by the row . - The minimal form in which the cone contracts: (a consequence of Candidate 5.4) Reading, and the upper-bound version Lean (
weighted_rpow_shift,sup_shift). The reading is that is marginal and stays at , the row of the composite drops below 1 as steps accumulate, and for one gains by the factor Reading. That the field maximising the one-step in the record was spread out (degree of localisation 0.006) agrees with the obstruction lying on the side of spread-out fields, that is, the side where the dilution of fields does not work Computed.
Candidate 5.7 (affine recursion). There are the following five Lean. They extend Candidate 1.4 (c) of §01 (affine_uniform) to coefficients that vary with the step and to bundles.
affine_const: (, ) ⇒ .affine_varying: , (), ⇒ .affine_invariant: under the same assumptions, if , then for all (an invariant interval).affine_eventually: under the same assumptions, for any , for all sufficiently large (the form ).affine_block: (, ) ⇒ . Combined with Candidate 5.2, the steps between bundles pick up a factor () only once.
| Candidate | Statement (one line) | Label | What it restates |
|---|---|---|---|
| 5.1 | , , | Lean (cone_pullback, contracts_comp, contracts_iterate, cone_pullback_iterate) | Submultiplicativity of operator norms |
| 5.2 | One step , steps ⇒ steps | Lean (block_decay) | A finite version of Gelfand's formula (Candidate 1.4 (a) of §01) |
| 5.3 | is convex in ; in particular | Continuous version Reading, discrete midpoint version Lean (weighted_rpow_midpoint, stein_form_midpoint, sup_midpoint, midpoint_below_one) | Hölder's (Cauchy–Schwarz) inequality; the supremum of log-convex functions |
| 5.4 | is convex in , is an interval, (). Upper-bound version | True : Cited + Reading; upper-bound version: Lean (weighted_rpow_shift, sup_shift) | Riesz–Thorin (convexity in ) and the perspective |
| 5.5 | For a fixed operator, ⇔ . The blocking map is of subdivision type, and its spectral radius depends on . The ratio for a constant field is about per step | Cited, Reading, numbers Computed | Gelfand's formula; the theory of subdivision |
| 5.6 | The naive dilution does not hold (constant field). What holds is (with equality cases), for fields, and | Counterexample Reading; the three forms Lean (row_rpow_le, lp_schur, lp_schur_sharp, delta_dilution, weighted_rpow_shift); Reading | The Schur test; finite sums for Riesz–Thorin between and |
| 5.7 | Affine recursion: constant coefficients, coefficients varying with the step, invariant interval, upper limit, bundles of steps | Lean (affine_const, affine_varying, affine_invariant, affine_eventually, affine_block) | An elementary fact about affine recursions (Candidate 1.4 (c) of §01) |
Correspondence with the numbers of the record
One step is the step-0 kernel on the torus (no truncation); two steps is (coarse , kernels truncated at , with the lost being 0.8% for and 1.9% for ); three steps is (coarse , ). The one-step lower bound is the value of the true ratio from a quasi-Newton method (L-BFGS, two starting points); for it was replaced by the value for the sign field of the largest row. The lower bound is not shown to be the maximum. All are floating-point computations, not interval estimates Computed.
| One step | One step lower bound | One step constant field | Two steps | Three steps | |
|---|---|---|---|---|---|
| 2 | 1.9806 | 1.9806 | 1.080 | 3.0189 | 3.6658 |
| 2.5 | 2.3626 | 1.4106 | 0.551 | 2.2358 | — |
| 3 | 2.8641 | 1.0233 | 0.2807 | 1.6642 | 0.57864 |
| 3.5 | 3.5442 | 0.7730 | 0.1431 | 1.2501 | — |
| 4 | 4.4457 | 0.6470 | 0.0730 | 0.9707 | 0.09599 |
| 5 | 7.8474 | 0.7328 | 0.0190 | 0.6144 | — |
| 6 | 14.910 | 1.2326 | 0.0049 | 0.4093 | — |
| 8 | 65.160 | 5.0155 | 0.0003 | 0.2197 | — |
| 16 | 3.91e4 | 18.2 (sign field) | 0.0598 | — | |
| 32 | 1.71e10 | 7.96e6 (sign field) | 0.0143 | — | |
| () |
- Convexity of : the second difference quotients were all positive for one step (–), two steps (–) and three steps (). The three-point ratios are 0.858–0.99999, all at most 1 (Candidate 5.3) Computed.
- : one step 1.036, two steps 1.029, three steps 1.025 () and 1.016 () Computed.
- Asymptotic slope: , and falls with the steps: 2.252 for one step, 0.928 for two, 0.332 for three. The slope of at large agreed with (one step: slope 0.8125 for against ) Computed.
- Monotonicity of the slope and extrapolation: the slope of for three steps increases from for to for , heading towards the asymptotic slope . By the upper-bound version of Candidate 5.4, for , so cones of high can be bounded from above without recomputation (the inequality in Lean, the numbers Computed).
- Three values of for three steps: 3.67, 0.58, 0.092 at (for , the values 3.6658, 0.57864, 0.09599 of Table 12; from to , 3.673–3.682, 0.5715–0.5732, 0.0920–0.0922, almost the same regardless of the step). The one-step upper bound grows with , but for three steps it shrinks with : in three steps stretches while and contract Computed.
- Schur is weak for the kernels of the record: the column is large, (one step) and (two steps), and is 52–6856 for one step and 13–122 for two. The two-step is , while the Stein bound already falls below 1 at for two steps. The minimal form is also 1.065 at and 0.587 at for two steps, a much weaker upper bound than itself Computed.
- Upper bound on the bundle number (from , bundles starting at ): 3 at , 2 for – (two-step ), 2 at (); at every one up to three steps exceeds 1 Computed.
- The true one-step : from the lower bound, for and . For the lower bound is 0.65–0.77 and the upper bound 3.5–7.8, and whether the true one-step falls below 1 is undecided Computed. The lower bound is U-shaped in , 1.98 → 0.60 () → 5.0 (), which does not contradict the convexity of the true (Candidate 5.4). The possibility that the one-step window is non-empty remains. Its location, however, can be narrowed. From the one-coordinate Hölder inequality, , which is at least 1 for , and the ratio of an explicit field (the field alternating on the mesh of the lattice) is at least 1 for and Computed (the inequality is Lean: OneStepWindow (holder_dual_ratio, exists_lpRatio_ge_row)). Since the window is an interval (Candidate 5.4; Lean: window_ordConnected_of_logConvex, convexity of assumed), , if non-empty, is a single interval inside . On the side of the upper bound, the family of row weights saturates at (Lean: stein_row_weight_saturation), and for the column weights too is optimal Computed, so weighted interpolation on tightens no further. The field giving the lower bound is the pattern alternating on the mesh of the lattice (), and the obstruction at one step is an ultraviolet pattern, not an infrared one Reading.
In the language of windows, the window given by contains for two steps and for three steps. For one step the window given by is empty, and the true window is undetermined. Since is 1.98, 3.02, 3.67 for , all at least 1, each (), being an interval, does not straddle 2 Reading.
A question proper to this pattern — the window, the bundle number, the threshold exponent
- The extent of the window. For the sequence of blocking maps, how does the window widen with ? By Candidate 5.4 each is an interval; it is open above if and closed above if . Where the lower end moves cannot be told from the numbers of the record. If the true values for one step at are settled, whether is empty is settled (F-SYS14). If is non-empty, it is a single interval inside .
- Divergence of the bundle number as . On the side , the ratio for a constant field is about per step, so for large it is expected not to enter the window Assumption. If the limit of is determined by the dimension count of the constant field, then diverges like . If it is not, the lower end of is a critical exponent determined by the geometry of the lattice. Which of these holds has not been checked Assumption (F-SYS15).
- The meaning of the threshold exponent . Does the gap between the Schur (about 66.5 for two steps) and the lower end of the Stein window (about 4 for two steps) come from the size of the column or from the cancellation of signs? How far can be lowered by a weighted Schur test (positive test functions) (F-SYS16)?
Dictionary
| Handwork of the record | Known framework | Label |
|---|---|---|
| Interpolation between and ; convexity of | The Riesz–Thorin interpolation theorem (M. Riesz 1927, G. O. Thorin 1939): is convex in | Cited |
| Interpolation that changes the weight on the range (Definition 5.4) | Stein–Weiss, Interpolation of operators with change of measures (Trans. AMS 87, 1958). If the measures at both ends are fixed, Riesz–Thorin suffices | Cited, bibliography Reading |
| Upper bound by the row and column (Candidate 5.6) | The Schur test (I. Schur 1911). The weighted version (positive test functions) is known in the forms of Aronszajn and Halmos–Sunder | Cited, bibliography Reading |
| Pointwise inequalities of the cone; the midpoint inequality (Candidate 5.3) | Hölder's inequality, Cauchy–Schwarz, the arithmetic–geometric mean inequality | Cited |
| Convexity of in (Candidate 5.4) | Log-convexity of operator norms (Riesz–Thorin) and the perspective function of convex analysis (Boyd–Vandenberghe, Convex Optimization §3.2.6) | Cited, Reading |
| Computing itself | For , approximating the norm of a matrix is NP-hard (Hendrickx–Olshevsky, SIAM J. Matrix Anal. Appl. 2010). For lower bounds, Boyd's power method (D. W. Boyd 1974, Linear Algebra Appl. 9). This is the reason for using the upper bound | Reading |
| Contracting in a bundle (Candidate 5.5) | Gelfand's spectral radius formula. For operators involving dilation there is the theory of subdivision (R.-Q. Jia, Subdivision schemes in spaces, Adv. Comput. Math. 1995), in which convergence is decided by the -norm joint spectral radius | Cited, Reading |
The bibliography is at the level of abstracts and has not been checked against the texts of the original sources. Every candidate theorem of this section is a finite-dimensional form of one of the frameworks above, or an elementary consequence of one.
Dictionary with the known, what can be said, questions
Summary of the five grades
| Section | Claim | Label | Conditions |
|---|---|---|---|
| §01 | Dominant matrices are closed under products and powers | Lean | Finitely many blocks with values in a normed ring. For powers, the identity has norm 1 |
| §01 | Candidate 1.1: if it contracts in steps, there is a weight that contracts in one step | Lean | , , , , |
| §01 | Candidates 1.2–1.5 (one-step estimate, change of weight, finite Gelfand, affine recursion, aggregation of blocks and the two-by-two test) | Lean | Finite-dimensional. The Collatz–Wielandt equality, Gelfand's formula itself and the existence of Perron vectors are not included |
| §01 | Candidate 1.2′ ( weight, the Schur test), explicit formula for the transient constant | Reading | Right and left positive Perron vectors exist |
| §01 | The loss from discarding signs is not necessarily bounded over steps (nilpotent example) | Lean | The quantity that composes after taking absolute values |
| §01 | Perron–Frobenius, Collatz–Wielandt, Gelfand, the max-plus bounds, the characterisation of M-matrices | Cited | — |
| §02 | The loss stops from two steps on and falls a little (6.28, 5.51, 5.10, 5.26) | Computed | torus, steps cut at , the true ratio is a lower bound, |
| §02 | Candidate 2.1: upper bound ÷ test value | Lean | for every row, |
| §02 | Loss (5.55, 5.13, 5.31) | Computed | , , shape and phase factors equal to 1 |
| §02 | Phase factor , the formula for the plane-wave test | Reading | and , or period 2 with real |
| §02 | Hypotheses (a)(b)(c) fail, and the way they fail is constant over steps | Computed | (larger tori), () |
| §02 | The profile of the composite kernel approaches a single one over steps | Reading | A reading from the numbers |
| §02 | Upper bound of the positive-part-dominant type (Schur and degradation under composition) | Lean | Negative positive on every row. The assumption is not satisfied for the kernels of the record |
| §02 | The loss for the W coordinates stops at 1.10, close to the rank-one value 1.085 | Computed | Kernel with the zero mode corrected, 60 types, |
| §03 | Existence of extensions, affine structure, dimension of the freedom, extension with conditions, compatibility of composition | Lean | Finite-dimensional linear algebra |
| §03 | Candidates 3.1–3.5 (uniqueness of the zero mode, the Moore–Penrose representative is not local, invariance of , the rule for the order of the tail, shifted jets) | Reading | The lattice steps are lines of argument on paper. Candidate 3.4 assumes constants uniform in the steps |
| §03 | : sym 0, A3 1, A4 2; ; the tail is bounded for | Computed | Representatives of the record, axial input at , |
| §03 | Correspondence with sum rules, high-frequency order and Strang–Fix | Cited, Reading | Details of how the original sources count orders (±1) not checked |
| §04 | does not depend on the scale, and the lens opens for | Reading | A count with the leading coefficients only |
| §04 | Single-plaquette series, ties, error ties, the lens in dimensions, MK level lines | Computed | Single plaquette, leading terms with equipartition, the approximate MK map |
| §04 | Information about the group remains in the height of the crossing and the sign of the next term; overlap of the four-dimensional lens with the band | Assumption | Leading terms only; may include coincidence |
| §04 | Candidate B (the comparison that carries the distinction is localised in the lens) | Assumption | Assumes (B1)(B2)(B3). Statement only |
| §05 | Candidates 5.1, 5.2, 5.7 (pull-back of cones, submultiplicativity, exceeding in one step and contracting in a bundle, five forms of affine recursion) | Lean | Statements written with an abstract (in the role of ). Theorem-specific assumptions such as , , . The supremum of the operator norm itself is not included |
| §05 | Candidates 5.3 and 5.6: midpoint convexity of , Schur's and its equality, dilution of fields, | Lean | Finite sums. , , , . Convexity in continuous and the formula for itself (interpolation) are not included |
| §05 | Derivation of the weighted Stein bound for general , convexity of the true , the window is an interval, counterexample to the naive dilution (constant field) | Reading, Cited | (). Convexity via Riesz–Thorin and the perspective |
| §05 | Second difference quotients of all positive; –; (2.252, 0.928, 0.332); upper bounds on the bundle number (3 at ; 2 for – and ); the true one-step is undecided for (lower bound 0.65–0.77, upper bound 3.5–7.8); if is non-empty, a single interval inside | Computed | One step without truncation; two steps coarse ; three steps coarse ; truncated at ; the lower bound is not shown to be the maximum |
| §05 | diverges like as , or there is a lower end of | Assumption | An estimate from the dimension count of the constant field alone |
The Lean of this chapter
None of the five files contains sorry or uses native_decide, and the axioms printed at the end were the three standard ones (propext, Classical.choice, Quot.sound) or a subset of them. None of the files contains lattices, groups, measures, minimisation or the Fourier transform itself.
| File (namespace) | Number of theorems | Main theorems and assumptions | Place in the text | Not included |
|---|---|---|---|---|
DominantMatrixContraction (DominantMatrix) | 21 | dominant_mul, dominant_pow (the identity has norm 1), weighted_step, weighted_iter (), weight_change (, ), liftWeight_step (, , , , ), norm_pow_le_const_mul, sum_norm_pow_le, affine_uniform (, ), aggregate_step, two_by_two_weight, two_by_two_exists, signedEx_sq, absEx_pow | §01 | The Collatz–Wielandt equality, Gelfand's formula itself, the existence of Perron vectors, Candidate 1.2′ ( weight), the max-plus bounds |
SignLossBound (SignLoss) | 16 | jensen_four, schur_four (row , column ), coherent_of_neg_le (negative positive), loss_le_of_coherent, comp_coherent, coherence_le_one, sum_four_le (), stein_form_le, stein_le_inv_sq_mul_test (), abs_comp_le, row_l1_comp_le | §02 | The Stein formula itself (Plancherel and interpolation), the average of the plane-wave phase, Wielandt's theorem, convergence to rank one, the numbers of the loss |
ConstrainedExtension (ConstrainedExtension) | 20 | exists_extension, isExtension_iff_mem_coset, finrank_freedom (finite-dimensional), freedom_eq_zero_iff (), exists_extension_with_conditions ( surjective), finrank_freedom_with_conditions, eq_of_eqOn_iSup (the sum of the family of subspaces is the whole), comp_isExtension (), comp_depends_of_not_le | §03 | Lattices, continuity of symbols, the order of folding, moments, the lattice steps of Candidates 3.1–3.5 |
ConeCalculus (ConeCalculus) | 20 | Definitions IsCone, Contracts. cone_pullback (), contracts_comp, contracts_iterate, cone_pullback_iterate (), block_decay (, ), row_rpow_le, lp_schur (, row , column ), lp_schur_sharp (row sums constant at , column sums constant at ), delta_dilution, weighted_rpow_midpoint (, ), stein_form_midpoint, weighted_rpow_shift (, ), sup_shift, sup_midpoint, midpoint_below_one, affine_const (, ), affine_varying, affine_invariant, affine_eventually, affine_block | §05 | The operator norm (the supremum of the true norm) itself, the formula for the Stein bound (interpolation and Plancherel), Riesz–Thorin, convexity in continuous , Gelfand's formula, lattices and kernels, the numbers of the record |
OneStepWindow (LatticeGauge.OneStepWindow) | 20 | holder_dual_ratio, norm_conj_rpow, exists_lpRatio_ge_row (the one-coordinate Hölder lower bound, ), lamMax_mono, lamMax_smul ( is defined as the supremum of the Rayleigh quotient), steinWeighted_ge, stein_row_weight_saturation (the family of row weights saturates at ), window_ordConnected, window_ordConnected_of_logConvex (convexity of is assumed) | §05 | Courant–Fischer, the number and the interval (computed), the operator norm itself |
What is not said
(a) We do not claim to have set up a new theory or new theorems. The candidate theorems of §01–§03 and §05 are all finite-dimensional forms of known facts, elementary consequences of them, or restatements in known frameworks (Perron–Frobenius, multigrid orders, sum rules, Riesz–Thorin interpolation, the Schur test). What this chapter adds is the correspondence that reads the numbers of the record as those quantities, and the questions that come out of it.
(b) What passed in Lean is only the 77 theorems of Table 14. Candidate 1.2′, the explicit formula for the transient constant, the phase factor, the lattice steps of Candidates 3.1–3.5, all of §04, the derivation of the Stein bound for general in §05, the convexity of the true , and Candidate 5.5 are lines of argument on paper or estimates.
(c) The numbers are not estimates in the rigorous sense. The numbers in §02–§04 are floating-point computations, not interval estimates. The true ratio is a lower bound from maximisation and is not shown to be the maximum (for one step on , two starting points stopped at 0.5767, short of the recorded 0.591).
(d) That the loss is bounded at every step is not shown. What is shown is only the numbers for () and (), and the conditional inequality "if the alignment is bounded below, the loss is bounded". The torus wraps the support of the kernel heavily, so "loss " there is a fact about the operator of that period.
(e) The tail rule of Candidate 3.4 is a line of argument assuming constants uniform in the steps. Uniformity over infinitely many steps is not treated. Whether compatibility of composition holds in the chain of the record has not been checked.
(f) The four-dimensional numbers of §04 are derived only from first-order leading terms and equipartition. The true four-dimensional series is not used. The overlaps with the band and the transition may include coincidence. MK is an approximate map, and whether the stopping level lines of are true fixed lines has not been distinguished. Candidate B is a restatement and does not claim to make the band easier.
(g) The results of this chapter have no direct effect on ① or ⑦. The table of correspondence with the record in §01 is a rereading of the record.
(h) Much of the literature was read at the level of abstracts and excerpts. For Hemker, Charina–Conti, Jia, Donatelli, Rump, Varga, Bertsekas–Tsitsiklis, arXiv:1005.1993, arXiv:0807.0185, Stein–Weiss, Hendrickx–Olshevsky and Boyd (power method), the details of the definitions in the original sources have not been checked.
(i) The windows and bundle numbers of §05 are windows of upper bounds. The window given by contains for two steps and for three steps, but the values of the ends of the window of the true have not been obtained. The one-step range is undecided, and the dependence of the two- and three-step numbers on truncation and on the size of the coarse torus has not been assessed. The behaviour of as is an estimate.
Remaining questions
| No. | Question | Section |
|---|---|---|
| F-SYS1 | Can the lower bound of the row alignment in the worst direction be estimated on the limiting kernel of the steps, and the amount by which moves under perturbation of the steps be bounded row by row, so as to say loss at every step? | §02 |
| F-SYS2 | If the part by which the maximiser of Stein moves away from period 2 on larger tori (upper bound 10.2 against a loss of 6.4) is measured by splitting into Stein restricted to period-2 points and the other , where does the difference come from? | §02 |
| F-SYS3 | If one quantity measuring the cancellation on the side of the true operator is fixed (for example, the ratio of and divided by its minimum over the sign-similarity class), what can the regularity of the loss growing only slowly over steps be said to come from? | §01, §02 |
| F-SYS4 | Aggregating the finite types and the remaining returns into a two-by-two matrix, does hold for the matrix of the record? If so, can it be raised to an interval estimate? | §01 |
| F-SYS5 | The record for the W coordinates measures in . Reread with Candidate 1.2′ (the weight of the Schur test), what does the one-step contraction constant become? | §01 |
| F-SYS6 | The upper limit of constrained sum rules: for any , can a local representative with be taken with finite range? Is there a general form for cases where rises with other steps or other blockings? | §03 |
| F-SYS7 | A canonical choice of the freedom: does a representative minimising a Stein-type norm exist, is it unique, and is it local? | §03 |
| F-SYS8 | Compatibility of composition: does the output of the representative at step lie in the constraint subspace of step (the image of Bianchi on the fine side)? If not, how much does the freedom outside affect the chain? | §03 |
| F-SYS9 | At what rate does the kernel of the Moore–Penrose representative decay (of type , from a discontinuous symbol homogeneous of degree 0)? | §03 |
| F-SYS10 | Why does the zero mode of the symmetric representative on finite tori appear to approach faster than exponentially? | §03 |
| F-SYS11 | In a triple valuation with a third valuation (the exponent of the transseries) added, does the distinction stand that the band of is a tie between the weak-coupling and exponential valuations, while that of is a tie between the strong-coupling and weak-coupling valuations? What does the MK slope 13–14 for tend to? | §04 |
| F-SYS12 | If the error tie is found with the genuine four-dimensional series (higher strong-coupling terms and higher-loop weak-coupling coefficients), how does the lens overlap the band of 13-06? | §04 |
| F-SYS13 | In the space of the two couplings, fundamental and adjoint, , does the codimension-one skeleton of the tie sets become a non-trivial polyhedral complex? How does it line up with the end point of the line of first-order transitions? | §04 |
| F-SYS14 | For the sequence of blocking maps, how does the lower end of the window move with ? Does the true fall below 1 for one step at (decide whether is empty, either by tightening the upper bound by optimising the Stein weight beyond , or by raising the lower bound with starting points that mix localised and spread-out fields or with the power method)? Answer (partial): if is non-empty, a single interval inside . The family of row weights saturates at , and weighted Stein tightens no further (Lean: OneStepWindow). The one-step lower bound at has risen to 0.6470, but the gap to 1 is undecided | §05 |
| F-SYS15 | How does the bundle number diverge as ? Is the limit of determined by the dimension count of the constant field, giving , or is the lower end of determined by the geometry of the lattice? | §05 |
| F-SYS16 | Does the gap between the Schur threshold exponent (about 66.5 for two steps) and the lower end of the Stein window (about 4 for two steps) come from the size of the column or from the cancellation of signs? How far can be lowered by a weighted Schur test (positive test functions)? | §05, §01 |
Sources
| Item | Kind | Source |
|---|---|---|
| Perron–Frobenius, Collatz–Wielandt, comparison by domination | Cited | The chapter on non-negative matrices in R. A. Horn, C. R. Johnson, Matrix Analysis (Reading) |
| Contraction in weighted maximum norms and iterative methods, M-matrices | Cited (Reading) | R. S. Varga, Matrix Iterative Analysis. A. Berman, R. J. Plemmons, Nonnegative Matrices in the Mathematical Sciences. D. P. Bertsekas, J. N. Tsitsiklis, Parallel and Distributed Computation (1989) |
| Max-plus eigenvalues and bounds | Cited | S. Friedland (1986). F. Baccelli, G. Cohen, G. J. Olsder, J.-P. Quadrat (1992). P. Butkovič (2010). M. Akian, S. Gaubert, A. Marchesini, arXiv:1309.7319 (Reading) |
| Sign-real spectral radius | Reading | S. M. Rump (1997) |
| Order of transfer operators | Reading | P. W. Hemker, On the order of prolongations and restrictions in multigrid procedures, J. Comput. Appl. Math. 32 (1990) 423–429. M. Donatelli, arXiv:0807.2565. U. Trottenberg, C. W. Oosterlee, A. Schüller, Multigrid (local Fourier analysis) |
| Sum rules, Strang–Fix conditions, order of approximation | Cited (Reading) | G. Strang, G. Fix (1973). R.-Q. Jia, Math. Comp. 67 (1998). M. Charina, C. Conti, arXiv:1202.3931. I. Daubechies, Ten Lectures on Wavelets |
| Fisher zeros and the strong-coupling basin, crossover | Reading (abstracts) | A. Denbleyker, D. Du, Y. Liu, Y. Meurice, H. Zou, arXiv:1005.1993. arXiv:1112.2734. arXiv:0807.0185 |
| Riesz–Thorin, Stein–Weiss, the Schur test, the difficulty of computing norms, the theory of subdivision | Cited (Reading) | M. Riesz (1927), G. O. Thorin (1939). E. M. Stein, G. Weiss, Trans. AMS 87 (1958). I. Schur (1911). J. M. Hendrickx, A. Olshevsky, SIAM J. Matrix Anal. Appl. (2010). D. W. Boyd, Linear Algebra Appl. 9 (1974). R.-Q. Jia, Adv. Comput. Math. (1995). S. Boyd, L. Vandenberghe, Convex Optimization §3.2.6 |
| The numbers of §02–§05 | Computed | The record of computations of this book's study (cross-check of the direct action of the rows of the composite kernel against the step-by-step action; two routes, quasi-Newton and period-2 fields; the single-plaquette series built in rational numbers; the of §05 computed directly from the composite kernels) |
| The theorems of Table 14 | Lean | The Lean files DominantMatrixContraction, SignLossBound, ConstrainedExtension, ConeCalculus, OneStepWindow |
Words used in this chapter — dominant matrix, weighted block norm, -step contraction, transient constant, one-step weight, the loss from discarding signs, row alignment, constrained map, extension, local representative, freedom, zero mode, moments, the order of folding and , shifted jets, double valuation, complementary tie, same-coordinate tie, error tie, lens, , cone constant , -contraction , weighted Stein bound , bundle number , window , Schur threshold exponent .
2026-10-22 (second revision): added to §05 the location of the one-step window (inside ) and the saturation of the family of weights, and revised the one-step lower bounds of Table 12, the current state of the answer to F-SYS14 and Table 14 (OneStepWindow).
← 15-09 What cannot be said, the index of questions, the dependency diagramContentsA-01 Table of notation →