Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.11 Interacting rank, Gaussian comparison and the stress tensor (notes)Part III·Unit outlineIII.13 Alternative construction: one Wilson family for all labels (notes) →

III.12. Bounds uniform in the volume and convergence as the spacing tends to zero — detailed notes

Contents

1. What this unit proves 2

2. What it uses 6

3. Strategy 8

4. Steps 9

4.1 Calculus of the chessboard budget 9

4.2 Detectors, rank detection and the closure lemma 10

4.3 Differences of primaries (III.12.2) 12

4.4 Observable transfer and coupling dependence 12

4.5 Convergence in the mesh 14

5. Where the difficulty lies 16

6. Notation 17

7. What remains unexplained 17

The full account of unit III.12: every proposition with its proof sketch, checked against the Lean in two rounds and edited. The condensed outline and the map of the Lean are on the unit page.

Unit page · All units · Overview

Part: III, Ultraviolet construction (renormalization group). Lean: chapter 30, YM/FullVolume/. Size: 18,973 lines in the main-theorem closure.

Scope. This unit proves volume-uniform bounds and takes the ultraviolet limit at each fixed volume. It has three outputs:

Notation.

1. What this unit proves

Definitions.

Proposition III.12.1 (kernel bounds uniform in the volume). Let \(R\) be a run (§2) for a simple gauge group \(G\), with Wilson family \(C\). Fix \(n\), labels \(v_i \in \text{Lab}_{d_i}\) (\(1 \leqslant i \leqslant n\)), a finite list \(\lambda\) of pairs (slot \(i\), axis \(\mu\)), and \(r > 0\). Then there are \(B \geqslant 0\) and \(N_0\) with the following property. For all \(N \geqslant N_0\), \(p\) and integer configurations \(x\) satisfying \(a_N \hspace{0.17em} \text{dist} (x_i, x_j) \geqslant r\) for \(i \ne j\),

\(\displaystyle | \Delta_{\lambda} \hspace{0.17em} \mathbb{E}_{N, p} [O_{N, p} (v_1 ; x_1) \cdots O_{N, p} (v_n ; x_n)] | \leqslant B.\)

Here \(\Delta_{(i, \mu)}\) is the normalized forward difference in \(x_i\) along \(e_{\mu}\), and \(\text{dist}\) is the periodic \(\ell^{\infty}\) lattice distance. \(N_0\) and \(B\) may depend on \(R, n, (v_i), \lambda, r\), but not on \(p\). Status: theorem, for every run; the run supplies all inputs (§2). Lean: FixedBounds (statement), gKernel (the differenced kernel), genuine (theorem), funding (reduction to III.12.2).

Proposition III.12.2 (derivative closure of the chessboard budget). Let \(R\) be a run for a simple \(G\). Let \(w = (w_{N, p})\) be a sequence in \(\text{Lab}_d\) with \(\|w_{N, p} \| \leqslant K\) eventually in the mesh, for some \(K \geqslant 0\), and let \(l\) be a list of axes. Then \(\Delta_l O (w)\) is funded: for some \(u (m)\) and all large \(m\), eventually in the mesh it is localized in the central cell and \(R_m (\Delta_l O (w)_{N, p} (0)) \leqslant u (m)\). Status: theorem. Lean: Run.financed.

Proposition III.12.3 (closure lemma). Fix a degree \(d\). Let \(C\) be a Wilson family satisfying its consistency conditions and the following hypotheses:

  1. the centred budget (§2);

  2. the scale-selection data of §2;

  3. sound section data \(V_e\) and linear automorphisms \(W_e\) of the abstract labels, for every degree \(e\), satisfying the section, symmetry and exact local identities described in §2;

  4. a presentation \(\pi\) and the full section-comparison data of §2, including the quantitative comparison with \(V_e\), identification of \(\ker \pi_{N, p}\) with a dressed equation ideal, and a bound \(\sup_{N, p} \| \pi_{N, p} \| < \infty\) for each degree;

  5. degree-\(d\) detector rows satisfying the placement and bounded-lift conditions of Lemma 4.6 and the short-distance comparison of Lemma 4.8 (VitalRank).

Let \(F\) be a funded trial whose values \(F_{N, p} (o)\) are continuous functions of the gauge field, and let \(l\) be a list of axes. Let \(x\) be a coin of degree \(d\) such that \(O (x) - \Delta_l F\) is owed at a cost \(u_{N, p} \to 0\) in the mesh. Then \(\Delta_l F\) is funded. Status: theorem under the stated hypotheses. For a run, these follow from its ties, with the detector comparison obtained from its short-distance estimates (§2). Lean: improved, cap.

Proposition III.12.4 (uniform rank detection). Assume hypotheses 1–5 of III.12.3 and fix a list \(l\) of axes. For all large \(k\) and all sufficiently small \(b > 0\) there is \(Z \geqslant 0\) such that, eventually in the mesh,

\(\displaystyle \| \pi_{N, p} x\| \leqslant Z \hspace{0.17em} | \mathcal{P}_{k, b, l ; N, p} (\pi_{N, p} x) | \qquad \text{for all } x \in \text{Lab}_d .\)

Here \(\mathcal{P}_{k, b, l ; N, p} : \text{Lab}_d \to \mathbb{C}^J\) is the linear detector of Lemma 4.6: correlations with fixed partners, averaged successively in the directions of \(l\) over lengths between \(b\) and \(2 b\). Repeated axes give repeated averages. Status: theorem (conditional on 1–5). Lean: trained, probe.

Proposition III.12.5 (labels in the equation ideal give negligible observables). Assume the consistency conditions on \(C\) and hypotheses 2–4 of III.12.3. Let \(x\) be a coin of degree \(d\) with \(\pi_{N, p} x_{N, p} = 0\) for all \((N, p)\). Then \(O (x)\) is owed at cost \(a_N^{1 / 32}\): it is local, and for all large \(m\), eventually in the mesh, \(R_m (O (x)_{N, p} (0)) \leqslant a_N^{1 / 32}\). Status: theorem. Lean: sweep, banked.

Proposition III.12.6 (polynomial bounds on the dependence on the coupling). Let \(R\) be a run, \(T\) a campaign for \(R\) with pillars \(W\), and assume the bounds Sky. Let \(\bar{\beta}\) be the target level-0 coupling and \(w > 0\) the fan width (ask). Fix \(p\), labels \(V_0\) (an \(n\)-tuple) and \(r > 0\). Then there are \(b, m \in \mathbb{N}\) with \(m \geqslant 1\), \(B \geqslant 0\) and \(c \in (0, 1]\) with the following property.

Take \(m \leqslant j < N\) and \(a \in [- 1, 1]\). Take a family \(s \mapsto F (s)\), \(s \in [- 1, 1]\), of admissible campaign members, with the same block sequence, sections and labels, whose level-0 inverse coupling at \((N, p)\) is \(\bar{\beta} + w \hspace{0.17em} a \hspace{0.17em} s\). Use the expectation and representatives of the attached auxiliary transfer family; their correlations agree with those of the actual successful trajectory at these positive cutoffs (Lemma 4.18). Take an \(r\)-separated configuration \(o\) of sites of \(\Lambda_{j + 1, p}\), embedded into \(\Lambda_{N, p}\). Then the correlation

\(\displaystyle s \longmapsto \mathbb{E}^{F (cs / 2)}_{N, p} \left[ \prod_i O (V_{0, i} ; o_i) \right], \qquad s \in [- 1, 1],\)

equals \(\sum_{i \geqslant 0} P_i s^i\) with \(\sum_i |P_i | \leqslant B \hspace{0.17em} a_{j + 1}^{- b}\). The constants depend only on the campaign data, \(p\), the labels and \(r\). Status: theorem, conditional on the campaign records. These are supplied on the main-theorem route by the assembly (VIII.1). Lean: Face.financed, PaidBeam, Ray.sun (\(= [- 1, 1]\)), intervalClock (\(= a_{j + 1}^{- 1}\) at level \(j + 1\)), slash, verso.

Proposition III.12.7 (Cauchy property in the mesh at fixed volume). Fix a simple gauge group and one renormalization-group construction, with its stationary-path bounds, free amplification, observable-transfer bounds and common reference sections. Assume the uniform perturbation estimates for that construction (§2). Fix \(p\). Let \((C_n)\) be families formed from histories in this construction at cutoffs \(f (n) \to \infty\). Assume:

Fix a finite label list \((v_i)_{i = 1}^s\) and a configuration \(x \in (\mathbb{R}^4)^s\) with \(x_i - x_j \not\in L_p \mathbb{Z}^4\) for \(i \ne j\). Assume that \(x\) lies exactly on a common lattice of some level \(r\): \(x = a_r z\) for an integer configuration \(z\). Then the correlations of \(C_n\) at cutoff \(f (n)\), evaluated at the coordinatewise ceiling lattice points of \(x\), form a Cauchy sequence in \(n\). Status: theorem under these hypotheses. For a run equipped with a campaign, pillars, fixed-level convergence data and the uniform perturbation estimates (§2), it applies with \(C_n = C\) and \(f (n) = n\). Lean: Rising.cinema, Rising.arrives; run instance Campaign.sees.

Proposition III.12.8 (positional ultraviolet limit). Let \(C\) be a Wilson family and \(e\) a strictly increasing sequence of mesh indices. Assume:

Then for every \(p\), \(n\) and \(v_1, \ldots, v_n\) there is a function \(f\) on \((\mathbb{R}^4)^n\), \(C^{\infty}\) on \(\text{NoHit}_p = \{x : x_i - x_j \not\in L_p \mathbb{Z}^4 (i \neq j)\}\) (NoHit), such that:

Status: theorem under the two displayed hypotheses. For a run with a campaign, pillars, fixed-level convergence and uniform perturbation estimates, the full-sequence instance \(e = (0, 1, 2, \ldots)\) is Campaign.realUV. Its pointwise Cauchy hypothesis is derived from III.12.7 in Campaign.purchased. Lean: PositionsUV, positioned. printed is a variant along an extraction order and is not on the main-theorem route.

Use in the assembly. The record Final.Jewel is produced by jewelOf17. Its fields take the outputs of this unit:

2. What it uses

The run and its ties. A Run (II.2, III.14) fixes the block sizes and numerical bounds, bare history, interlevel gauge maps and observable transfers. Its degree-\(d\) reference level satisfies \(J (t (d)) \geqslant d + 3\), and its Wilson family satisfies the consistency conditions.

Run.again, proved through ahead gives an extracted hierarchy and reconstruction after refining any extraction order, together with Run.Ties, which has these fields:

Under the section hypotheses of III.12.3, the section is sound, has the prescribed polynomial realization and finite regularity bounds, and its dressing commutes with signed lattice symmetries and conjugation. Dressed equation labels satisfy the distant-spectator identity of Lemma 4.10.

The section-comparison estimates include cutoff-dependent automorphisms \(A_{d ; N, p}\) on terminal coordinates, auxiliary comparison columns, and a sub-power sequence \(E_d (N)\). Eventually, uniformly in \(p\), \(A_{d ; N, p}\) is the symmetry-averaged map determined by these columns and its inverse increases coefficient size by at most a factor \(2\). For every comparison column and every signed or conjugated version, the centred root of the difference between the auxiliary section evaluation and the chosen section evaluation is bounded by

\(\displaystyle C_d (m, k) E_d (N) a_N^{1 / 8} .\)

This holds for every admissible auxiliary level \(k < N\) and centred scale \(m \leqslant N\); \(C_d (m, k)\) is the comparison constant from III.11. The scale-selection data choose such a \(k\) for each sufficiently large \(m\). The kernel of \(\pi_{N, p}\) is the image of \(\mathcal{N}_d\) under the dressing, threshold rescaling, terminal map and \(A_{d ; N, p}\). The data also retain the projection symmetries and the finite-cutoff equation and difference comparisons needed by extraction.

Other existence formulations are Run.ramp, realized, dagger, rampant, Final.july.

From other units.

Standard mathematics.

Imported constants and assumptions.

3. Strategy

The centred budget applies to primaries with bounded physical labels. A normalized difference carries the divergent factor \(a_N^{- 1}\), so it needs a separate argument. The local regularity estimates and the matching theorem of III.11 write \(\Delta_l O (w)\) as a degree-\((d + |l|)\) primary \(O (x)\) with an error of root cost \(a_N^{1 / 16}\). The inverse terminal coordinates of \(x\) have only sub-power control. To bound \(\pi x\), test against fixed partner observables and average in the differenced directions. Summation by parts bounds these tests by \((2 / b)^{|l|}\) times an undifferenced correlation bound. At short distances the detector approaches a free Maxwell matrix that separates the quotient by the equation ideal. Finite-dimensional stability then bounds \(\pi x\). The auxiliary equation sections have zero chessboard root by their distant-spectator identity; section comparison makes \(O (x - \pi x)\) negligible. Thus \(\Delta_l O (w)\) is funded, and the chessboard inequality bounds products at separated points (III.12.1–III.12.5).

For convergence, fix the volume and an intermediate level \(j\). Fixed-level convergence of the couplings, normalized activities and effective insertions makes the scalar-normalized level-\(j\) correlation Cauchy as the cutoff grows. The full correlation differs from it by at most \(2 F_0 e^{- B_j / 64}\) for all sufficiently large cutoffs, where \(F_0\) is independent of the cutoff and \(j\). Since \(B_j = \lceil (\log \hat{\beta}_j)^2 \rceil \to \infty\), the full correlations are Cauchy at configurations lying on a common lattice. Positional Lipschitz bounds extend convergence from this dense set to every non-collision configuration. Taylor bounds identify limits of differences with derivatives, giving smoothness and the smeared limits (III.12.7–III.12.8).

For dependence on the coupling, vary the level-0 value in a family parametrized by \(\bar{\beta} + ws\). After reducing the parameter interval, the lattice correlations have absolutely convergent power series whose coefficient norms grow polynomially in \(a_j^{- 1}\), uniformly in the cutoff (III.12.6). Their real level-to-level differences are \(O (a_j)\). A polynomial coefficient estimate after a further interval reduction makes the differences summable in coefficient norm. Fixed-level Cauchy convergence of the series then gives analytic continuum correlations on a complex disc. This uses the same fixed-level convergence input as the preceding paragraph, together with the additional analytic estimates.

4. Steps

4.1 Calculus of the chessboard budget

Throughout §§4.1–4.3, the family satisfies its consistency conditions. In §4.2, assume hypotheses 1–5 of III.12.3, with the same detector rows and presentation throughout.

Lemma 4.1 (closure properties). For trials \(F, H\) and costs \(u, v\):

Hence funded trials form a vector space. Sketch: linear combinations preserve locality; the root is homogeneous and satisfies the chessboard triangle inequality. Lean: Affords.sub, Affords.scalar, Affords.enlarged, Affords.recurses, Funded.sub; negation, addition, the zero trial and finite sums are treated in the same file.

Lemma 4.2 (all offsets). Let \(F\) be affordable at cost \(u\). For every \(m\) and every integer \(J \geqslant 1\) there is \(k \geqslant m\) with the following property, eventually in the mesh. For every tiling of physical cell side \(a_m\) and every site \(x\) in its central cell at least one \(J\)-th of the cell side from each wall, \(F_{N, p} (x)\) is localized in that cell and its root on the tiling is at most \(u (k, N, p)\). Sketch: choose \(k\) with \(3 Ja_k \leqslant a_m\) and apply the offset comparison (II.1), using translation covariance. Lean: Affords.every. (proof read; offset comparison imported from II.1)

Lemma 4.3 (bounded primaries are funded). Under the centred budget, let \(v_{N, p} \in \text{Lab}_d\) satisfy \(\|v_{N, p} \| \leqslant Y\) eventually in the mesh for some fixed \(Y\). Then \(O (v)\) is funded, with \(u (m) = A \hspace{0.17em} a_m^{- d - 1}\). Sketch: apply the centred budget with \(\varepsilon = 1\) and \(R = \max (1, Y)\), at the offset \(0\). Lean: Funded.primaries.

Lemma 4.4 (products at separated points). Let \(F_1, \ldots, F_n\) be affordable at costs \(u_1, \ldots, u_n\), and let \(r > 0\). For all large \(k\), eventually in the mesh, every configuration \(z\) with \(a_N \hspace{0.17em} \text{dist} (z_i, z_j) \geqslant r\) satisfies

\(\displaystyle | \mathbb{E}_{N, p} \prod_i F_i (z_i) | \leqslant \prod_i u_i (k, N, p) .\)

If all \(F_i\) are funded, the left side is bounded uniformly, eventually in the mesh. Sketch:

Lean: cohort, FullVolume.financed.

Lemma 4.5 (III.12.1 from III.12.2). Suppose \(\Delta_l O (v)\) is funded for every fixed label \(v\), in every degree, and every list \(l\). Then the bounds of III.12.1 hold for \(C\). Sketch: induction on the list \(\lambda\) of pairs (slot, axis). Differencing slot \(i\) differences its insertion (actuate), by linearity of expectation. Thus the differenced kernel is a correlation of \(\Delta_{l_i} O (v_i)\), each funded. Conclude by Lemma 4.4. Then genuine applies III.12.2 to constant sequences. Lean: funding.

4.2 Detectors, rank detection and the closure lemma

Lemma 4.6 (detectors; summation by parts). A detector row \(j\) at test scale \(k\) consists of:

For a trial \(F\), the monitor is the correlation \(M_j (F) (x) =\mathbb{E}_{N, p} \left[ F (x_0) \prod_u O (w_{k, j, u} ; x_u) \right]\) (monitor). The assay averages the first slot over \(n_b = \lceil b / a_N \rceil\) consecutive sites in each direction of \(l\), starting at the prescribed lattice approximation of \(y_{k, j}\) (assay). The detector is \(\mathcal{P}_{k, b, l} (x)_j = \text{assay}_j (O (x))\). For each fixed \(k, l\), there is \(b_0 > 0\) such that, for every \(0 < b < b_0\), the following hold:

Sketch:

Lean: invites.

Lemma 4.7 (averaging is harmless on primaries). For every \(\varepsilon > 0\) and \(k\), for small \(b\) and eventually in the mesh, \(|\mathcal{P}_{k, b, l} (\beta_c)_j - M_j (O (\beta_c)) (y_{k, j}) | \leqslant \varepsilon\) for all rows \(j\) and all lifted basis labels \(\beta_c\). Sketch: lobby gives a radius \(t > 0\) such that correlations of labels of bounded norm vary by less than \(\varepsilon\) within distance \(t\) of the test configuration. This follows from the positional Lipschitz bound derived from the centred budget (IV.1), uniformly in \(p\). Then choose \(2 |l| b \leqslant t\). Lean: probesUp. (proof read; the single-step Lipschitz bound is an input from IV.1)

Lemma 4.8 (short distances: the free Maxwell values). For every \(\varepsilon > 0\), eventually in \(k\), eventually in the mesh, simultaneously for all rows \(j\) and basis indices \(c\): \(|M_j (O (\beta_c)) (y_{k, j}) - \phi_{jc} | < \varepsilon\). Here \(\phi_{jc}\) is the value of the \(j\)-th test of the free Maxwell table on the \(c\)-th basis vector of \(F_d\) (focus). Sketch: the short-distance comparison of III.11 makes the lattice correlation approach the free Maxwell correlation at the rescaled test configuration. The latter configurations converge to the prescribed free tests, whose correlations are continuous there. Lean: gaugesFull, packaged as VitalRank. (proof read; short-distance estimates imported from III.11)

Lemma 4.9 (rank detection; III.12.4). The matrix \((\phi_{jc})\) is injective on \(F_d\) (true_lower): the free tests separate the quotient. Sketch:

Lean: trained.

Lemma 4.10 (equation terms; III.12.5). Let \(x\) be a coin with \(\pi x = 0\). Then \(O (x)\) is owed at cost \(a_N^{1 / 32}\). Sketch: undo the section-comparison automorphism and terminal map to obtain a terminal-coordinate row \(y\) of sub-power growth whose associated abstract labels belong to the dressed equation ideal. The inverse coefficient-size bound in §2 controls this change of coordinates.

The auxiliary equation sections are an input from II.1 (§7). Lean: sweep, banked.

Lemma 4.11 (a priori bound on \(\pi x\)). Under the hypotheses of III.12.3, there is a constant \(A\) such that \(\| \pi_{N, p} x_{N, p} \| \leqslant A\) eventually in the mesh. Sketch:

Rearrange to obtain \(A = 2 Zc + 1\). Lean: cap.

Lemma 4.12 (closure lemma; III.12.3). \(O (\pi x)\) is funded by Lemmas 4.11 and 4.3. \(O (x - \pi x)\) is owed at \(a_N^{1 / 32} \to 0\) by Lemma 4.10, hence funded: a cost tending to \(0\) is eventually below \(1\) (fixed_cost). So \(O (x)\) is funded. Finally \(\Delta_l F = O (x) - (O (x) - \Delta_l F)\) is funded, by Lemma 4.1. Lean: improved.

4.3 Differences of primaries (III.12.2)

Lemma 4.13 (regularity under normalized differences). Call \(F\) tucked of degree \(d\) if the following holds. There are a stencil containing \(0\) and sequences \(c_{N, p}, b_{N, p}\) of sub-power growth. Eventually in the mesh, for every site \(o\), \(a_N^d F_{N, p} (o)\) is regular on the stencil around \(o\), its field-derivative bounds are at most \(c_{N, p}\), and its sup norm is at most \(b_{N, p}\). Then:

Sketch: \(a_N^d O (w)\) is the section evaluation at the threshold-scaled coefficients (charged, II.1); the bounds come from the regularity and supremum estimates for section evaluations. For the difference, \(a_N^{d + 1} \Delta_{\mu} F (o) = a_N^d F (o + e_{\mu}) - a_N^d F (o)\). The stencil grows by one step, and the derivative bounds pick up the sub-power shift cost. Lean: Tucked, Tucked.up, Tucked.farther, Tucked.hops.

Lemma 4.14 (matching a local observable by a primary). Assume a simple gauge group, the scale-selection data and the observable remainder and regularity bounds of III.11 (§2). Let \(F\) be tucked of degree \(d\), local, and continuous as a function of the gauge field at the insertion site \(0\), eventually in the mesh. Then there is a coin \(v\) of degree \(d\) such that \(O (v) - F\) is owed at cost \(a_N^{1 / 16}\). Sketch: apply the local regularity comparison of III.11 to \(a_N^d F\). After undoing this normalization, the centred root of \(O (v) - F\) at scale \(m\) is at most a constant (depending on \(m\) and an auxiliary level chosen by the scale-selection conditions) times a sub-power factor times \(a_N^{\gamma}\), with \(\gamma = 1 / 8\). readyCoin and the sub-power absorption estimate absorb the sub-power factor into \(a_N^{1 / 8 - 1 / 16}\). Lean: prepared_rows. (statement and reduction read; the III.11 inputs statement only)

Lemma 4.15 (proof of III.12.2). In a run for a simple gauge group, let \(w\) be eventually bounded in the mesh and set \(F = O (w)\). Lemma 4.3 funds \(F\). By Lemma 4.13, \(\Delta_l F\) is tucked of degree \(d + |l|\); it is also local and continuous in the gauge field. Lemma 4.14 gives a coin \(x\) of that degree with \(O (x) - \Delta_l F\) owed at \(a_N^{1 / 16} \to 0\). The run's ties supply hypotheses 1–5 at degree \(d + |l|\), so III.12.3 funds \(\Delta_l F\). Lean: Run.financed.

4.4 Observable transfer and coupling dependence

The analytic transfer bounds use III.12.6's campaign data; analytic continuum convergence also uses III.12.7's fixed-level convergence and perturbation inputs.

Lemma 4.16 (composition of observable transfers). Fix a simple gauge group, a branch from level \(k\) to cutoff \(N\), the observable-transfer bounds and compatible intermediate representations of §2. Fix \(k \leqslant r \leqslant N\) and \(d + 3 \leqslant J (r)\). There are degree-\(d\) transfer data based at the reference section at \(r\), obtained by composing the one-step transfers along the branch. Sketch: a one-step transfer tool with its capacity estimate acts on an observable at level \(m + 1\) and produces an observable at level \(m\) whose density is the exact renormalization-group pushforward with the degree-dependent block normalization. It preserves linearity and symmetry and supplies coefficient, remainder and response bounds (motor). These steps compose with the prescribed top observable (composeT). The branch includes selectedness, available coefficient spaces and the one-step transfer data (Branch); its estimates provide the required capacities. Lean: Branch.composing. Fixed-level convergence follows from Branch.stays, using the stability of the step maps under two cutoff subsequences (Branch.tiers) (Lemma 4.19). (proof read for composition and fixed-level reduction; one-step capacity estimate statement only)

Lemma 4.17 (power series in the tuning parameter, level by level). Assume the campaign data and estimates of III.12.6. Write \(f \in \text{PB} (t)\) if \(f (s) = \sum_i P_i s^i\) on \([- 1, 1]\) with \(\sum \|P_i \| \leqslant t\). This class is closed under sums (\(\text{PB} (t) + \text{PB} (t') \subset \text{PB} (t + t')\)) and under rescaling \(s \mapsto as\) with \(|a| \leqslant 1\).

cruise gives per-label bounds. polynomial bounds a correlation item at \(s \mapsto cs\) by \(B_0 a_{j + 1}^{- b_0}\) for fixed \(B_0, b_0\). Here \(c\) is fixed by aperture so that \(|c| \hspace{0.17em} Q / Z_{\ast} \leqslant \frac{1}{2}\), where \(Q\) bounds the source contribution and \(Z_{\ast} > 0\) bounds the scalar-normalized partition function from below; see also storms. Face.financed identifies the item for the full mode with the correlation (absolute), which gives III.12.6. The weighted analytic bounds for the parameter-dependent effective densities (attic_close, many, program) belong to this fan analysis. Amp.give and Amp.stage extend a multilinear series from a dense isometric image, with geometric bounds; this builds the series on real jets without complexifying the field. (proof read for the power-series calculus, parameter rescaling, interval selection and final correlation bound; intermediate analytic estimates statement only)

Lemma 4.18 (analytic continuum correlations). Assume a campaign and pillars, the analytic estimates of III.12.6, fixed-level convergence and the uniform perturbation estimates of §2. Fix \(p\), finitely many labels, a compact \(K \subset \text{NoHit}_p\) and \(q \in \mathbb{N}\). There is a positive parameter width, independent of the cutoff, and an open neighbourhood \(\Omega\) of \(K\) within \(\text{NoHit}_p\), on which the limiting kernels are \(C^q\) in position and analytic in the complex parameter. For each spatial stencil list of length at most \(q\), the lattice kernels, their multilinear interpolations and their admissible smeared sums have analytic continuations whose parameter derivatives of every fixed order converge uniformly on compact subdiscs and compact spatial subsets of \(\Omega\). Sketch: pricedB gives coefficient-norm bounds \(Ba_j^{- b}\) for differenced kernels on a fixed compact set. traceS chooses series representing these kernels. Their real values at consecutive levels differ by \(O (a_j)\). A polynomial coefficient estimate after a fixed reduction of the parameter interval turns this into a coefficient-norm bound \(C \sqrt{a_j}\), summable in \(j\). For each fixed \(j\), Cauchy convergence of the real values gives Cauchy convergence of the series in the cutoff after another interval reduction (astronomer). Thus the series converge uniformly in position (charted). Their absolutely convergent complex power series give analytic limits and convergence of all parameter derivatives on smaller discs. The width may depend on \(p, K, q\). The final identification uses the actual successful Wilson trajectories, whose correlations agree with those of the auxiliary transfer families at every positive cutoff. This is the content of the analytic spatial statement Spending and its theorem Fan.standing, used by the assembly's analytic family. (proof read for the series-convergence and final assembly reductions; spatial derivative identification statement only)

Additional estimates in this folder.

These are inputs to the transfer and analytic estimates, not additional convergence assertions. Their full hypotheses and proofs belong to III.8–III.10; see §7.

4.5 Convergence in the mesh

Lemma 4.19 (fixed-level convergence). In the setting of III.12.7, fix \(m \geqslant k\) and above the reference levels of all labels used. Then:

Sketch: the kinetic-path reserve and activity convergence control the normalized density. Stability of the composed transfers gives Cauchy coefficients and remainders; evaluation preserves their uniform Cauchy bounds. (proof read for these reductions; transfer stability estimates statement only)

Lemma 4.20 (correlations computed at a fixed level converge). Let the level-\(j\) data be as in Lemma 4.19. Assume the effective insertions and their polymer components are measurable, and that the scalar-normalized partition function is eventually bounded below by \(a > 0\). Then the level-\(j\) value

\(\displaystyle C_j^I (n) = Z_{j, n}^{- 1} \int Q_{j, n}^I (U) \hspace{0.17em} d \mu_{\text{Haar}} (U)\)

is Cauchy in \(n\) for every fixed label subset \(I\). Here \(Q_{j, n}^I\) is the coefficient indexed by \(I\) in the scalar-normalized effective polynomial obtained by retaining the vacuum and singleton source data; \(Z_{j, n}\) is its vacuum normalization, and \(\mu_{\text{Haar}}\) is the product Haar probability measure. Sketch: uniform convergence passes through the Haar integral. The normalizations have a positive limit, so the quotients converge. The additive action scalar cancels. Lean: Confluence.laven, Rising.latter, with the uniform bounds ships and limitVault.

Lemma 4.21 (tail bound uniform in the cutoff). In the setting of III.12.7, fix a non-collision configuration lying exactly on a lattice of some level. Choose a sufficiently large base level \(r\), above the reference levels and with distinct insertion sites. Fix positive label weights so that their weighted coefficient costs are within the allowances at \(r\); these weights exist by creditP. For every fixed subset \(I\) of the labels, there is \(F_0 \geqslant 0\), independent of \(j\) and the cutoff, such that for each sufficiently large \(j > r\), eventually in \(n\),

\(\displaystyle |p_n^I - C_j^I (n) | \leqslant 2 F_0 e^{- B_j / 64} .\)

Here \(p_n^I\) is the product correlation at cutoff \(f (n)\) and \(C_j^I (n)\) is its scalar-normalized level-\(j\) approximation. The lower threshold on \(j\) ensures separation by \(B_j^2\) lattice units, support exponent at least \(2\), and \(e^{B_j / 64} > 2\). The threshold on \(n\) may depend on \(j\). Sketch: propagate the exact polynomial density of the inserted observables down the renormalization group. The weighted remainder estimate controls its part of degree at least two. Separation forces a nonzero such term to occupy enough blocks to gain the factor \(e^{- B_j / 64}\). The remaining omission estimate divides by a uniformly positive scalar-normalized partition function. Uniform bounds on the effective insertions at \(r\) and \(j\) follow from Lemma 4.19; the final numerator depends only on the data at \(r\). Lean: Sever.echoes. (proof read for the exact-density, remainder and omission reduction; underlying multiscale estimates are inputs)

Lemma 4.22 (Cauchy property). Under the hypotheses of Lemma 4.21, \(p_n^I\) is Cauchy for every fixed subset \(I\) of the labels. Sketch: \(B_j = \lceil (\log \hat{\beta}_j)^2 \rceil\), so \(g (j) = e^{B_j / 64} \to \infty\) because \(\hat{\beta}_j = \text{const} + \kappa_G \log a_j^{- 1} \to \infty\). Choose \(j\) with \(g (j) > 2\) and \(2 F_0 / g (j) \leqslant \varepsilon / 4\). Lemma 4.21 bounds \(|p_n^I - C_j^I (n) |\) by \(\varepsilon / 4\) for large \(n\). Lemma 4.20 gives the Cauchy property of \(C_j^I (n)\). Conclude with the triangle inequality. Lean: Rising.arrives.

Lemma 4.23 (III.12.7). Under the hypotheses of III.12.7, take the subset containing all labels. The full-subset quantity is the correlation itself (absolute). The positions are \(o_N = \text{wrap} (\alpha_N (x))\). For \(x \in \text{NoHit}_p\) lying exactly on a lattice of some level, these satisfy the separation \(B_j^2\) for all large \(j\) by the lattice-ancestry estimates, and they are injective at the base level. Lean: Rising.cinema.

Lemma 4.24 (all non-collision points, full sequence). For a run with a campaign, pillars, fixed-level convergence and uniform perturbation estimates, III.12.7 holds on the full sequence of cutoffs (Campaign.sees, with the same cutoff-dependent history family repeated for every sequence index and \(f (n) = n\)). Configurations lying exactly on some lattice are dense. III.12.1 gives a local Lipschitz bound (localLip), hence asymptotic equicontinuity on compact subsets of \(\text{NoHit}_p\) (circulating). The dense-set convergence theorem (IV.1) then gives locally uniform convergence on \(\text{NoHit}_p\), in particular the Cauchy property on the subset with no coordinate ties. Lean: Campaign.purchased.

Lemma 4.25 (positional limits; III.12.8). Assume the two hypotheses of III.12.8.

Under the hypotheses of Lemma 4.24, the run instance is Campaign.realUV: III.12.8 applied to III.12.1 and Lemma 4.24. Lean: positioned. (proof read for equicontinuity, Taylor comparison, derivative convergence, stencil averaging, interpolation and smearing)

5. Where the difficulty lies

Matching controls only inverse terminal coordinates. Rank detection must bound the projected physical labels, while the equation-section comparison controls the projection kernel. These estimates precede every limit.

The estimates of III.12.1–III.12.5 are uniform in every admitted volume. The convergence results III.12.7–III.12.8 fix the volume first. Their thresholds may depend on the period, labels, compact spatial set, derivative order and test function. The parameter width in Lemma 4.18 may also depend on these data.

All positional limits are off collisions on the torus, including configurations with coordinate ties and configurations crossing the boundary of a period cell. Extension across collisions belongs to VII.4. Every derivative order or stencil is fixed before the cutoff threshold is chosen.

Sub-power factors are absorbed by the positive error exponents. Fixed-level convergence uses a positive lower bound on the scalar-normalized partition function; the additive action scalar need not converge.

6. Notation

Written proof Lean (glossary) Meaning
eventually in the mesh mesh for \(N \geqslant N_0\) and all \(p\)
sub-power growth Sluggish, flight \(|w| \leqslant a_N^{- \varepsilon}\) for all \(\varepsilon > 0\); flight \((\varepsilon) = a_N^{- \varepsilon}\)
trial \(F\), local Trial, Stencil site-indexed lattice observables on a fixed stencil
\(T_m (o)\), \(R_m\) center, rootTest centred tiling of side \(a_m\); chessboard root
affordable, owed, funded Affords, Owed, Funded centred root bound by \(u (m, N, p)\), \(v (N, p)\), \(u (m)\)
\(\Delta_{\mu}\), \(\Delta_l\) farther, hops \(a_N\)-normalized forward differences
tucked of degree \(d\) Tucked \(a_N^d F\) regular with sub-power bounds
coin; \(O (x)\) Coin, Bid.upper label sequence with sub-power inverse terminal coordinates; its representative
\(\pi_{N, p}\) Presentation, display idempotent with kernel the dressed equation ideal
\(M_j\), detector \(\mathcal{P}_{k, b, l}\) monitor, assay, probe test correlation; iterated directional average
\(\phi_{jc}\) focus free Maxwell value of test \(j\) on basis vector \(c\)
centred budget Wcmain root \(\leqslant A \hspace{0.17em} a_m^{- d - \varepsilon}\)
kernel bounds FixedBounds III.12.1
run, ties Run, Run.Ties record of one construction; its inputs for this unit
fan parameter \(s \in [- 1, 1]\) Ray.sun, ask level-0 coupling \(\bar{\beta} + ws\)
\(\text{PB} (t)\) PaidBeam power series on \([- 1, 1]\) with \(\ell^1\) coefficient norm \(\leqslant t\)
\(a_j^{- 1}\) intervalClock \(D_j = \ell_0 \cdots \ell_{j - 1}\)
campaign, pillars, sky Campaign, Pillars, Sky records carrying the fan and its bounds
fixed-level convergence; function convergence Helmet, Confluence Cauchy couplings and weighted activities; eventual uniform boundedness and uniform Cauchy convergence of functions
point-Cauchy property Purchased Cauchy correlations at ceiling addresses when no coordinate projections tie
positional limit PositionsUV III.12.8; (D5) of the main statement

7. What remains unexplained

  1. Local matching and equation sections. Lemma 4.14 imports the local-to-primary estimate of III.11; only its reduction to a coin and an \(a_N^{1 / 16}\) root bound is checked here. The construction of the auxiliary sections from the Maxwell equation ideal, and its relation to a lattice Schwinger–Dyson identity, remain unverified. Lemma 4.10 uses their exact distant-spectator identity, without identifying it with the Wilson action's naive equation of motion.

  2. One-step observable transfer. The capacity estimate used by Lemma 4.16 remains at statement level. Its coefficient and remainder constants require the one-step analysis.

  3. Analytic estimates. The intermediate weighted estimates in Lemma 4.17 and the identification of spatial derivatives of the analytic limit in Lemma 4.18 remain at statement level. The outer series-convergence argument is checked.

  4. Additional estimates in §4.4. The large-field and primary-step results and the two transfer comparisons retain their full hypotheses in III.8–III.10. Their proofs, and the detailed small-shift lawfulness estimate, are not checked here.

  5. Fixed-level convergence and tails. The analytic trajectory-convergence theorem and the multiscale remainder and omission estimates remain imported inputs; their applications are checked. The tail argument needs only \(B_j = \lceil (\log \hat{\beta}_j)^2 \rceil \to \infty\), not geometric decay in \(j\).

← III.11 Interacting rank, Gaussian comparison and the stress tensor (notes)Part III·Unit outlineIII.13 Alternative construction: one Wilson family for all labels (notes) →