Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.16 Analytic toolkit (notes)Part IV·Unit outlineV.1 Decomposition of the limit into phases (notes) →

IV.1. Infinite volume: extraction of a subsequence and the Euclidean axioms of the limit — detailed notes

Contents

1. What this unit proves 1

2. What it uses 6

3. Strategy 9

4. Steps 9

4.1 Reflection positivity and chessboard estimates 9

4.2 Boundedness at separated points 11

4.3 Equicontinuity 11

4.4 Compactness and ordered limits 13

4.5 Label derivatives 14

4.6 Smoothness 16

4.7 Euclidean axioms, bounds and assembly 17

5. Where the difficulty lies 18

6. Notation 19

7. What remains unexplained 20

The full account of unit IV.1: 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: IV, infinite volume (chapter 10). Lean: YM/Extraction, YM/Cells, YM/Slice, YM/Euclid, YM/Dash, YM/Next/EXTRACTION, YM/Lane, and the proofs of the work items D01, D02, D03, D04, D05, D06. Their statements are in YM/Bid/Drops.lean, which is filed with III.10. Size: 7,444 lines in 1,049 declarations used by the main theorem. Other material in these folders concerns stress tensors, Maxwell comparison and label quotients (Parts V–VII), or corrected fields (III.11–III.12).

1. What this unit proves

Setting and notation. Let \(G\) be a compact matrix gauge group and \(C\) a Wilson family (II.2, III.13). It has:

Labels. Labels at degree \(d\) (polynomial weight at most \(d\)) form a finite-dimensional complex space \(\text{Label}_d\), given by coefficients in a real basis, so that \(v \mapsto \bar{v}\) is defined. We use the supremum norm on coefficient vectors. \(\text{Label}_d\) carries:

Observables and correlations. A label \(v \in \text{Label}_d\) has a renormalized lattice observable \(I_{N, p} (v, r)\) at each site \(r\), linear in \(v\). Covariance, reality and the unit identity are required for \(N \geqslant \text{ref} (d)\). Write \(\hat{r}\) for the physical position of a site in \((- L_p / 2, L_p / 2]^4\). For a label list \(v = (v_1, \ldots, v_n)\),

\(\displaystyle \mathcal{C}_{N, p} (v ; r) = \left\langle \prod_{i = 1}^n I_{N, p} (v_i, r_i) \right\rangle_{N, p}, \qquad \mathcal{C}_{N, p} (v ; t) = a_N^{4 n} \sum_{r \in \Lambda_{N, p}^n} t (\hat{r}) \hspace{0.17em} \mathcal{C}_{N, p} (v ; r) .\)

For a lifted tuple \(r \in (\mathbb{Z}^4)^n\), \(\mathcal{C}_{N, p} (v ; r)\) means evaluation after reduction modulo \(L_p / a_N\); its lifted physical position is \(a_N r\).

Configuration sets.

Test functions. \(\mathcal{D}_n = C_c^{\infty} (\text{Conf}_n)\). A test function \(t\) is admissible at volume \(p\) if \(\text{supp} t \subset (- L_p / 2, L_p / 2)^{4 n}\).

Extractions. An extraction \(f\) is a pair of strictly increasing sequences \((N_j)\) and \((p_k)\); a refinement \(f \circ g\) passes to subsequences of both. A property of \((N_j, p_k)\) holds eventually along ordered tails if it holds for \(k \geqslant k_0\) and then \(j \geqslant j_0 (k)\). Convergence along ordered tails means that, for each neighbourhood of the limit, membership holds eventually in this sense. The iterated limits in IV.1.1 (c) also require an actual spacing limit at every admissible fixed volume.

Tables. A table \(S\) assigns to each arity \(n\), degrees \(d_1, \ldots, d_n\) and point \(x\) a multilinear form \(S (\cdot \hspace{0.17em} ; x)\) on \(\text{Label}_{d_1} \times \ldots \times \text{Label}_{d_n}\). Its values off \(\text{Conf}_n\) play no role.

Standing hypotheses.

Proposition IV.1.1 (subsequential raw limits). Assume (H1) and (H2) for an extraction \(f\). Then there are a refinement \(f \circ g = ((N_j), (p_k))\), a table \(S\) and tables \(P_p\) (\(p \in \mathbb{N}\)) such that the following hold for every \(n\) and every list of labels \(v\).

(a) (Spacing limit at fixed volume.) For every \(p\), \(P_p (v ; \cdot)\) is continuous on \(\text{Gen}^{(p)}_n\). For every compact \(K \subset \text{Gen}^{(p)}_n\) and \(\varepsilon > 0\), for all sufficiently large \(j\) and all lifted tuples \(r \in (\mathbb{Z}^4)^n\) with \(a_{N_j} r \in K\),

\(\displaystyle |\mathcal{C}_{N_j, p} (v ; r) - P_p (v ; a_{N_j} r) | < \varepsilon .\)

(b) (Volume limit.) \(S (v ; \cdot)\) is continuous on \(\text{Gen}_n\), and \(P_{p_k} (v ; \cdot) \to S (v ; \cdot)\) uniformly on compact subsets of \(\text{Gen}_n\).

(c) (Ordered smeared limit.) For every \(t \in \mathcal{D}_n\):

(d) \(t \hspace{0.17em} S (v ; \cdot)\) is integrable for every \(t \in \mathcal{D}_n\), i.e. \(S\) is locally integrable on \(\text{Conf}_n\).

Status: theorem. (H2) holds for every \(f\) as soon as the volume-uniform budget of §2, input 2, holds (Wcmain.projects). Part (d) uses the uniform bound of Lemma IV.1.d.

Lean:

Proposition IV.1.2 (limits of label derivatives). Let \(S\) be an ordered limit along \(f\) (IV.1.1 (c)) that is locally integrable (IV.1.1 (d)), with (H1) and (H2) along \(f\). Let \(\text{Null}_d (S)\) be the space of \(u \in \text{Label}_d\) with \(\int tS (\ldots, u, \ldots) = 0\) for every arity \(n\), slot, spectator label list and \(t \in \mathcal{D}_n\). Assume the relay data of §2, input 3:

Then \(\ker \pi_d = \text{Null}_d (S)\). Moreover there are linear maps \(\kappa_{d, e} : \text{Label}_d \to \text{Label}_e\) (\(d \leqslant e\)) and \(\tau_{d, a} : \text{Label}_d \to \text{Label}_{d + 1}\) (\(a\) an axis) such that, for all \(n\), slots \(i\), labels \(v\) and \(t \in \mathcal{D}_n\),

\(\displaystyle \int t \hspace{0.17em} S (v_{i \to \kappa v_i} ; \cdot) = \int t \hspace{0.17em} S (v ; \cdot), \qquad \int t \hspace{0.17em} S (v_{i \to \tau_a v_i} ; \cdot) = - \int (\partial_{x_i^a} t) \hspace{0.17em} S (v ; \cdot) .\)

Here \(v_{i \to w}\) is \(v\) with the \(i\)-th label replaced by \(w\). In other words, \(\partial_{x_i^a} S (v ; \cdot) = S (v_{i \to \tau_a v_i} ; \cdot)\) in \(\mathcal{D}' (\text{Conf}_n)\).

Status: theorem, conditional on the relay data and the dimension count. Their suppliers in III.10–III.11 are listed in §2, input 3.

Lean: Work.D04.answer (conclusion Spans), Bin.exactC, lifts_model (maps MonitorOps, identities MonitorOps.Wakes), Wakes.through_ties.

Proposition IV.1.3 (smoothness of the limit). Let \(S\) be as in IV.1.1, along an extraction for which IV.1.2 applies. Then there is a table \(T\) with the following properties.

\(\displaystyle T (\ldots, \text{rise} \hspace{0.17em} u, \ldots) = T (\ldots, u, \ldots), \qquad T (\ldots, \partial_a u_i, \ldots) = \partial_{x_i^a} T (\ldots, u_i, \ldots) .\)

Such a pair of maps is a derivative plan with its inclusion and derivative identities.

On \(\text{Conf}_n\), the smooth ordered limit along a given extraction is unique (Order.determined).

Status: theorem.

Lean: Org.Arrives.serves (filed with VIII.1; hypotheses Org.Arrives, conclusion Org.Cleaner), Dash.awake, RawLimits.ready, DiffPlan with Inclusions and Derivatives.

Proposition IV.1.4 (the Euclidean hierarchy). Let \(T\) be a table and let \(f\) be an extraction. Assume (H1), IV.1.1 (a)–(c) hold for \(T\) and \(T (v ; \cdot) \in C^{\infty} (\text{Conf}_n)\) for every arity \(n\) and label list \(v\). Then \(T\) satisfies (E1)–(E5), with all points in \(\text{Conf}_n\):

\(\displaystyle \sum_{i, j} \bar{c}_i c_j \hspace{0.17em} T (\Theta_a w_i \hspace{0.17em} w_j) \geqslant 0.\)

If in addition (E7) (polynomial bounds on derivatives) holds, then \(T\) satisfies the hierarchy (E1)–(E7), where:

Status: theorem. (E6) and (E7) are hypotheses of the assembly. (E6) is supplied by IV.1.3; (E7) is supplied by IV.1.5 together with the promotion lemma B10 of V.1.

Lean:

Proposition IV.1.5 (polynomial bound at short distance; D05). Assume (H1) and (H2) along \(f\). Let \(T (v ; \cdot)\) be smooth on \(\text{Conf}_n\) for every arity and label list, and suppose \(T\) satisfies IV.1.1 (a)–(b) along \(f\). Then for every arity \(n\), degree list \((d_i)\) and label list \(v\) there is \(C \geqslant 0\), independent of \(r\) and \(x\), such that

\(\displaystyle |T (v ; x) | \leqslant C \hspace{0.17em} r^{- A} \quad \text{whenever } 0 < r \leqslant 1 \text{ and } |x_i - x_{\ell} |_{\infty} \geqslant r \text{ for every } i \ne \ell, \qquad A = 4 n (1 + \max_i d_i) .\)

The maximum of an empty degree list is taken to be \(0\). The displayed exponent follows by choosing the largest degree in the proof.

Status: theorem. Together with the derivative plan of IV.1.3, the lemma B10 of V.1 upgrades this to (E7).

Lean: Work.D05.answer (statement Bid.D05, conclusion Bid.OneCap); promotion Bid.B10, proved by Work.B10.answer.

Proposition IV.1.6 (the derivative plan respects the symmetries; D06). Let \(T\) be smooth on \(\text{Conf}_n\) for every arity and label list, permutation symmetric and with real spin, and let \((\text{rise}, \partial)\) be a derivative plan for \(T\) satisfying its inclusion and derivative identities. Use \(\rho_d\) also for the induced action on \(F_d\). For every \(d \leqslant e\), axis and \(s \in H_4\):

Status: theorem.

Lean: Work.D06.compat, Work.D06.answer, DiffPlan.Orientation.

Remarks.

  1. The package handed downstream is the bundle Next.Extract.Base. It contains (H1), (H2), the relay data, the raw limit \(S\) with local integrability and the spanning property, the smooth table \(T\) with its plan, the bound of IV.1.5 and the hierarchy of IV.1.4. It also records \(\ker \pi_d = \text{Null}_d (T)\) (Base.null). On the main theorem's path it is assembled in III.11 (MergeProof.Accent.rated) as follows:

  2. The extraction is subsequential in both indices. It gives no independence from the volume subsequence. The public form of the theorem (WilsonFamily.Converges, via wilsonLimit) needs the ordered limit along the full sequence of spacings. The upgrade is proved in III.13 by UVExtension.Reports.useFull, using full_tests. At each admissible fixed volume, uniqueness identifies the full-sequence smeared limit with its subsequential limit; the volume limit and the table \(T\) are retained.

2. What it uses

Inputs from other units.

  1. Specification of the family. The definition is in II.1–II.2. It is proved for the constructed family in III.13 (UVExtension.Mast.calibrated). Its consequences used here are the following; covariance, reality and the unit identity require \(N \geqslant \text{ref} (d)\):

  2. Centered chessboard budgets (interface item 2). A sufficient volume-uniform input is the following: for every degree \(d\), every \(R > 0\) and every \(\varepsilon > 0\) there is \(A \geqslant 0\) such that for every \(m \geqslant \text{ref} (d)\) there is \(N_0 \geqslant m\) with the following property. For all \(N \geqslant N_0\), all \(p\), all \(v \in \text{Label}_d\) with \(\|v\| \leqslant R\), and all sites \(x\):

    This stronger volume-uniform input implies (H2) along every extraction \(f\). Precisely, (H2) requires:

    On the main theorem's path it is supplied by MergeProof.Accent.gardena (III.11). The variant Org.Assembly.wcmain is not on that path. Lean: Wcmain, centeredBudget, Cells.center, CellHyp, CenterPort.book, CenteredBook.

  3. Relay data (interface item 3, in the form used here; III.10–III.11). A family \(Q_{N, p} (x)\) is chessboard-small if there is a real rate \(y (N, p) \to 0\) along ordered tails with the following property. For every integer \(q \geqslant 0\) and lower scale \(m\), there is \(k \geqslant m\) such that, eventually along ordered tails with \(N \geqslant k\), the bound \(\|Q_{N, p} (x)\|_{\mathcal{T}} \leqslant y (N, p)\) and the interior condition hold for every translated bond tiling \(\mathcal{T}\) of side \(a_k\) and every \(x\) in its base cell with lattice coordinates \(z^a\) relative to the base corner satisfying

    \(\displaystyle M \leqslant z^a, \qquad z^a + M + 1 \leqslant a_k / a_N, \qquad M = \left\lfloor \frac{a_k / a_N}{8 (q + 1)} \right\rfloor .\)

    Thus the error bound must hold for translated cells with prescribed relative interior margins. Centered cells alone do not suffice.

    A label family \(w (N, p)\) has subpolynomial growth if, for every \(\varepsilon > 0\),

    \(\displaystyle \|B_{d, N, p}^{- 1} w (N, p)\| \leqslant a_N^{- \varepsilon}\)

    eventually along ordered tails. For each degree \(d\) the relay data are:

    Here \(e_a\) is one lattice step, of physical length \(a_N\).

    Supplied in III.11 by MergeProof.Scotia, savings and Beam.arriving_seed. Lean: Presentation, Affordable, RelayCosts, Bid.RelayBin, vet, close, dollar, heighten, Bin.shortage.

  4. Analytic toolkit (III.16). The Lipschitz bound for traces of products of a positive kernel (Lemma IV.1.e). Lean: TimeKernel.passage, Holder.finite_lip, Holder.estimation, Holder.convexStrip, TimeKernel.learns.

  5. Scale schedule (I.1, III.2, V.1).

  6. Promotion of derivative bounds (V.1). The lemma B10 (see IV.1.5).

Interface item 4 (whole-sequence convergence at fixed volume) enters only in Remark 2: the extraction itself passes to a spacing subsequence. Interface item 5 (corrected fields) is not used either: CellHyp consists only of the chessboard inequality and the budget for \(I_{N, p}\). The corrected-field definitions serve III.11–III.12.

Standard mathematics.

Imported constants and hypotheses.

3. Strategy

Chessboard estimates bound correlations at distinct points uniformly in the cutoff and volume. To obtain equicontinuity, fix an axis and express a correlation as a cyclic trace of transfer kernels and observable kernels supported in slabs. Moving one insertion transfers length between two gaps. Finite-dimensional complex interpolation bounds the trace for complex gap shifts; Cauchy's estimate gives a Lipschitz bound. The required column moments are bounded by the same chessboard budgets. This argument needs separation in every coordinate. Two applications of Arzelà–Ascoli, with countable basis indices, give spacing limits at every fixed volume and then a volume limit on \(\text{Gen}_n\). Bounds on all of \(\text{Conf}_n\) supply domination for smeared limits.

Smoothness uses the label calculus. The relay estimates approximate each lattice forward difference quotient by a degree-raised observable. Summation by parts computes its weak limit, and chessboard-small errors have vanishing smeared limits. The projections and dimension count identify the null labels. A finite-dimensional compactness argument then replaces the varying approximating labels by fixed linear maps, giving distributional derivatives as kernels with raised labels. Iteration yields rapid Fourier decay after localization, hence a smooth representative on all distinct-point configurations.

The exact lattice symmetries pass first at generic grid points and then by continuity. Reflection positivity passes for joint tests supported in a half-space; normalized bump functions give its pointwise form. A two-scale choice of cells yields a polynomial bound at short distances, and the derivative identities promote it to bounds of every order. These arguments assemble the Euclidean hierarchy.

4. Steps

4.1 Reflection positivity and chessboard estimates

Lemma IV.1.a (reflection positivity of the Wilson measure). Let \(\Lambda = (\mathbb{Z}/ n\mathbb{Z})^4\) with \(n\) even. Let \(a\) be an axis, \(b \in \mathbb{Z}/ n\), and \(\Theta\) either the site reflection \(x^a \mapsto 2 b - x^a\) or the bond reflection \(x^a \mapsto 2 b - 1 - x^a\) (other coordinates fixed), acting on configurations by pull-back. Let \(\Lambda_+\) be the half-torus \(0 < (x^a - b) \bmod n < n / 2\) (site case) or \(0 \leqslant (x^a - b) \bmod n < n / 2\) (bond case), with residues in \(\{0, \ldots, n - 1\}\). For every \(\beta \geqslant 0\) and every bounded, measurable, gauge-invariant \(F\) depending only on links in \(\Lambda_+\),

\(\displaystyle \langle F \hspace{0.17em} \overline{F \circ \Theta} \rangle_{\beta} \geqslant 0.\)

Proof sketch. This is the Osterwalder–Seiler argument. Reparametrize configurations by the links in the two fixed planes, the links crossing them, and the two open halves; this map preserves the measure.

Lean: Slice.reflected_positive, Cells.Positive, Cells.Interior, Cells.Cut, Slice.portPos, Slice.step_positive.

Lemma IV.1.b (chessboard estimate). Let \(\mathcal{T}\) be a tiling of \(\Lambda\) into \(M^4\) congruent cells (\(M\) even), with site or bond seams. For a cell \(c\) let \(\theta_c\) be the composition of seam reflections carrying the base cell to \(c\). Put \(\text{copy}_c F = F \circ \theta_c\), or its complex conjugate when \(\theta_c\) reverses an odd number of axes. For \(F\) interior to the base cell (bounded, measurable, gauge invariant, depending only on links inside it) put \(\|F\|_{\mathcal{T}} = | \langle \prod_c \text{copy}_c F \rangle_{\beta} |^{1 / M^4}\). If \(\beta \geqslant 0\), then for interior \(F_c\)

\(\displaystyle | \left\langle \prod_c \text{copy}_c F_c \right\rangle_{\beta} | \leqslant \prod_c \|F_c \|_{\mathcal{T}},\)

and \(\| \cdot \|_{\mathcal{T}}\) is subadditive. By (H1) this holds for every \((N, p)\) of the family.

Proof sketch. This is the Fröhlich–Israel–Lieb–Simon argument.

Lean: Cells.Seam, Cells.laws, Tiling.tiles, Tiling.maximize, Tiling.fold_both, Tiling.existence, Tiling.adds, Tiling.rootTest, Tiling.copy, Tiling.planted, Cells.seamless.

Lemma IV.1.c (roots of uncentered observables). Assume (H1), \(m \leqslant k \leqslant N\) and \(N \geqslant \text{ref} (d)\). Let \(\mathcal{X}\) be a bond tiling of \(\Lambda_{N, p}\) with cells of side \(a_m\), and let \(u \in \text{Label}_d\) have all stencil offsets of coordinate size \(< a_k / a_N\), and assume that for every image \(gu\), \(g \in H_4 \times \{1, \text{conj} \}\), the centered roots satisfy \(\|I (gu, y)\|_{\mathcal{T}_k (y)} \leqslant A\) for all \(y\), with the centered interior conditions. If \(o\) is at distance \(\geqslant 3 a_k\) from the boundary of the base cell of \(\mathcal{X}\), then \(\|I (u, o)\|_{\mathcal{X}} \leqslant A\).

Proof sketch.

Lean: Around.interior_from, Around.swept, Tiling.pathway, Tiling.trip, Spin.uses.

4.2 Boundedness at separated points

Lemma IV.1.d (uniform bound). Assume (H1). Let \(x_1, \ldots, x_n \in \Lambda_{N, p}\) be such that every pair has some coordinate at cyclic physical distance \(\geqslant r\). Let \(m \leqslant k \leqslant N\) with \(a_m < r\) and \(6 n \hspace{0.17em} a_k < a_m\), and let \(A \geqslant 0\) bound the centered roots at scale \(k\) of all images \(gv_i\), \(g \in H_4 \times \{1, \text{conj} \}\), with the centered interior conditions. Assume \(N \geqslant \max_i \text{ref} (d_i)\) and that all stencil offsets of these labels have coordinate size \(< a_k / a_N\). Then \(|\mathcal{C}_{N, p} (v ; x) | \leqslant A^n\). Under (H1)–(H2) this yields the bound (B):

Proof sketch.

Lean: Around.fits_budget, Around.size_done (conclusion Bound), Tiling.fits_together, Gaps.some, Gaps.someGrows.

4.3 Equicontinuity

Lemma IV.1.e (Lipschitz bound for traces; proved in III.16). Let \(X\) be a compact metric space with a finite Borel measure, \(K\) a continuous positive semidefinite kernel, and \(B_1, \ldots, B_n\) continuous kernels, with \(n \geqslant 2\). Let \(q, w \geqslant 1\) be integers, put \(M = 2 qw\), and assume \(Z = \text{Tr} \hspace{0.17em} K^M > 0\). Take gaps \(Y, Y' \in \mathbb{N}^n\) with \(nw + \sum_k Y_k = M\). Suppose \(Y'\) transfers an integer \(\ell \geqslant 0\) units from one gap to a different gap, \(Y_k > 2 r\) for every \(k\), and \(0 \leqslant \ell \leqslant r\) with \(r > 0\). If

\(\displaystyle \|B_k \|_{2 q} := (\text{Tr} (B_k^{\ast} B_k)^q)^{1 / (2 q)} \leqslant c_k Z^{1 / (2 q)},\)

then

\(\displaystyle | \text{Tr} \prod_k B_k K^{Y'_k} - \text{Tr} \prod_k B_k K^{Y_k} | \leqslant Z \left( \prod_k c_k \right) \frac{\ell}{r} .\)

Here traces of kernel products are their cyclic integrals.

Proof sketch. Approximate the cyclic integrals by finite matrices \((A, b_k)\) using one quadrature for all kernels and their adjoints. For the positive semidefinite matrix \(A\), use the entire spectral family equal to \(e^{z \log \lambda}\) on positive eigenvalues and zero on \(\ker A\) for every \(z\). It agrees with \(A^m\) at positive integers \(m\). The trace with gap vector \(W (z) = Y + z (e_i - e_j)\) is entire. On \(|z| \leqslant 2 r\), all real gap parts are nonnegative and

\(\displaystyle \frac{n}{2 q} + \sum_k \frac{\text{Re} \hspace{0.17em} W_k (z)}{M} = 1.\)

Writing \(Z_A = \text{Tr} \hspace{0.17em} A^M\), complex interpolation gives the bound \(\prod_k \|b_k \|_{2 q} \hspace{0.17em} Z_A^{1 - n / (2 q)}\). Cauchy's estimate bounds the derivative on \(|z| \leqslant r\) by this quantity divided by \(r\). Integrate from \(0\) to \(\ell\) and pass to the kernel limit; the partition traces and column moments converge under the common quadrature.

Lean: TimeKernel.passage, Holder.finite_lip, Holder.estimation, Holder.leap.

Lemma IV.1.f (the Wilson transfer matrix). Fix \(\beta \geqslant 0\), an axis \(a\) and \(\Lambda_{N, p}\). The one-step kernel \(K_{\beta}\) on slice configurations, with the links in direction \(a\) integrated out and half of each slice action assigned to either side, is continuous and positive semidefinite. With \(M = L_p / a_N\), \(\text{Tr} \hspace{0.17em} K_{\beta}^M = Z\) is the partition function. Every continuous observable local to a slab of width \(1 \leqslant w < M\) lattice steps has a slab representation, whose weighted integration gives a continuous kernel \(B\). Products of such observables, all of width \(w\) and separated by gaps \(Y\), satisfy

\(\displaystyle \left\langle \prod_k F_k \right\rangle_{\beta} = \frac{\text{Tr} \prod_k B_k K_{\beta}^{Y_k}}{Z}, \qquad nw + \sum_k Y_k = M.\)

If \(M = 2 qw\) with \(q \geqslant 1\), the normalized column bounds \((\text{Tr} (B_k^{\ast} B_k)^q / Z)^{1 / (2 q)} \leqslant c_k\) therefore give the difference bound \((\prod_k c_k) \ell / r\) under the gap and shift hypotheses of Lemma IV.1.e.

Proof sketch. Fill the complement of the slab with a fixed configuration to express the observable as a function of its slab links. Integrate the interior links with the Wilson weights. Fubini's theorem identifies the product with the cyclic kernel integral. Apply Lemma IV.1.e and divide by \(Z > 0\).

Lean: Slice.step_positive, Time.partition_seen, Time.powering, Time.selects, Time.organized.

Lemma IV.1.g (chessboard bound for the column norm). Assume (H1), \(m \leqslant N\) and \(N \geqslant \text{ref} (d_v)\) for a label \(v\) of degree \(d_v\). Put \(d = a_m / a_N\). Suppose \(F = I_{N, p} (v, x)\) and \(J = I_{N, p} (\theta_a v, x)\) are interior to the base cell of \(\mathcal{T}_m (x)\) with roots \(\leqslant c\). Then \(F\) has a slab representation of width \(2 d\) lattice steps. Its kernel \(B\) and the kernel of \(J\) are adjoints. Writing \(L_p / a_N = 4 qd\), with \(q \geqslant 1\), and letting \(Z\) be the partition function, one has

\(\displaystyle \left( \frac{\text{Tr} (B^{\ast} B)^q}{Z} \right)^{1 / (2 q)} \leqslant c.\)

Proof sketch. The observable \(J\) equals \(\overline{F \circ \Theta}\) for the site reflection through \(x^a\). Reversing the slab gives the adjoint kernel. The column consists of \(2 q\) alternating copies of \(J\) and \(F\), placed in every other cell of the row of \(\mathcal{T}_m (x)\) in direction \(a\). Apply the chessboard estimate with \(1\) in all other cells and take the \(1 / (2 q)\)-th power.

Lean: Tiling.enough, Difference.reading, Difference.stars.

Lemma IV.1.h (Lipschitz bound in one coordinate). Assume (H1), \(m \leqslant N\) and \(N \geqslant \max_i \text{ref} (d_i)\). Let \(n \geqslant 2\) lattice points have pairwise cyclic physical \(a\)-gaps \(> 2 a_m + 2 \rho\), with \(\rho > 0\). Assume the centered interior conditions and let \(c_i\) bound the roots of \(I (v_i, x_i)\) and \(I (\theta_a v_i, x_i)\) on \(\mathcal{T}_m (x_i)\). Moving one point by \(h \in a_N \mathbb{N}\), \(0 \leqslant h \leqslant \rho\), in direction \(+ e_a\) changes \(\mathcal{C}_{N, p} (v ; x)\) by at most \((\prod_i c_i) \hspace{0.17em} h / \rho\).

Proof sketch. Put \(d = a_m / a_N\) and reorder the points cyclically in the \(a\)-direction (permutation symmetry). Represent each observable by a brick of width \(2 d\); the gaps are then \(> 2 \rho / a_N\) in lattice units. Combine Lemmas IV.1.f and IV.1.g.

Lean: Difference.primitive, Difference.chrono.

Lemma IV.1.i (equicontinuity). Under (H1)–(H2), for every arity \(n\):

Quantitatively, let \(R > 0\) bound below all cyclic coordinate gaps on a closed neighbourhood of \(K\), and let \(A\) bound the centered roots of the \(v_i\) and all \(\theta_a v_i\) at a scale \(a_m < R / 4\). Then \(| \Delta \mathcal{C}| \leqslant 16 nA^n |x - y| / R\) for \(|x - y|\) sufficiently small.

Proof sketch. Telescope through at most \(4 n\) coordinate moves inside the neighbourhood and apply Lemma IV.1.h with \(\rho = R / 4\). For a negative move, interchange its endpoints. For \(n = 1\) use translation invariance; \(n = 0\) is constant.

Lean: Difference.completed (conclusion TransferLip), comparable, stepTotal, permits, Gaps.all, Gaps.allGrows.

4.4 Compactness and ordered limits

Lemma IV.1.j (Arzelà–Ascoli for countably many families). Let \((Y_i)\) be a countable family of locally compact separable metric spaces, \(U_i \subset Y_i\) open, and \(T^{(j)}_i : Y_i \to \mathbb{C}\). Assume that \(T^{(j)}_i (y)\) is eventually bounded for each \(y \in U_i\), and that the family is eventually equicontinuous on compact subsets of \(U_i\). Then one strictly increasing sequence \((t_j)\) makes every \(T^{(t_j)}_i\) converge locally uniformly on \(U_i\) to a continuous limit.

Proof sketch. Take countable dense sets and replace the finitely many out-of-bound values at each dense point by a point in its bounding ball. By Tychonoff, the countable product of closed balls is sequentially compact, which gives a single subsequence converging at all dense points. Equicontinuity upgrades this to locally uniform convergence.

Lean: localAscoli, simultaneous, oscillation.

Lemma IV.1.k (two-stage extraction). The bound (B) and equicontinuity (Q) along \(f\) imply IV.1.1 (a)–(b) along a refinement.

Proof sketch.

Lean: first_surface, setMeshes, each_oscillates, volume_oscillates, fitted.

Lemma IV.1.l (ordered smeared limits and local integrability). The bound (B) together with IV.1.1 (a)–(b) implies IV.1.1 (c)–(d).

Proof sketch. Dominated convergence, applied twice.

IV.1.1 is Lemmas IV.1.d, IV.1.i, IV.1.k and IV.1.l combined.

Lean: Order.poses, Order.ordinary, Order.intraperiod, Order.ring_bound, almostGeneric; crops.

4.5 Label derivatives

Lemma IV.1.m (one-slot difference quotients; D03). Assume (H1), IV.1.1 (c)–(d) and (B) along \(f\). For every arity \(n\), label list \(v\), slot \(i\), axis \(a\) and \(t \in \mathcal{D}_n\), put \(u = v_i\) and replace \(I (u, x_i)\) by the forward difference quotient \(a_N^{- 1} [I_{N, p} (u, x_i + e_a) - I_{N, p} (u, x_i)]\). The resulting smeared lattice correlation converges along ordered tails to \(- \int (\partial_{x_i^a} t) \hspace{0.17em} S (v ; \cdot)\).

Proof sketch.

Lean: Work.D03.answer (statement Bid.D03), on_lattice, error_sum, heighten.

Lemma IV.1.n (chessboard-small observables are invisible; D02). Assume (H1)–(H2). Let \(Q_{N, p}\) be chessboard-small with rate \(y (N, p) \to 0\). For every \(\delta > 0\), arity, slot and fixed spectator label list, there is \(A_{\delta} \geqslant 0\) such that, eventually along ordered tails, the correlation with \(Q\) in that slot has modulus at most \(A_{\delta} |y (N, p) |\) at every configuration separated by \(\delta\) in the periodic physical supremum norm. Consequently every smeared lattice correlation with \(Q\) in one slot tends to \(0\) along ordered tails.

Proof sketch. The first claim is the chessboard argument of Lemma IV.1.d with \(Q\) in one cell. For the second, write the smeared sum as the integral of a step function supported in a fixed ball and bounded by \(\sup |t| \hspace{0.17em} A_{\delta} |y|\).

Lean: Lease.take, Lease.rents, Lease.gain, Work.D02.answer (statement Bid.D02).

Lemma IV.1.o (bounded labels have subpolynomial cutoff coordinates; D01). Under (H1), every degree-\(d\) label family \(w (N, p)\) bounded along ordered tails has subpolynomial growth in the sense of §2, input 3.

Proof sketch. The inverse terminal transfer is bounded, up to a fixed degree-dependent norm factor, by the product of the column constants up to level \(N\), and their logarithms sum to \(o (\log a_N^{- 1})\).

Lean: Work.D01.answer (statement Bid.D01), terminal_ball, columnLogs_le.

Lemma IV.1.p (spanning; D04). Assume (H1), (H2), IV.1.1 (c)–(d), and the relay data and dimension count for every \(d\). Then:

  1. for each fixed \(u \in \text{Label}_d\), the smeared lattice correlations of \(u - \pi_d (N, p) u\) (in any slot, with any spectators and tests) tend to \(0\) along ordered tails; together with the dimension count this gives \(\ker \pi_d = \text{Null}_d (S)\);

  2. for \(d \leqslant e\) and \(u \in \text{Label}_d\) there are degree-\(e\) labels \(w (N, p)\) whose smeared correlations converge along ordered tails to those of \(u\) in the limit;

  3. for \(u \in \text{Label}_d\) and each axis \(a\) there are degree-\((d + 1)\) labels \(w (N, p)\) whose smeared correlations converge along ordered tails to \(- \int (\partial_{x_i^a} t) \hspace{0.17em} S (v ; \cdot)\).

In 2 and 3, one family \(w (N, p)\) works for every arity, slot, spectator list and test. It may be chosen with subpolynomial growth, and the normalized remainders \((w - \pi w) / (1 +\| \pi w\|)\) also have vanishing smeared limits.

Proof sketch.

Lean: Work.D04.answer (statement Bid.D04), Spans, Bin.Upper, Bin.exactC.

Lemma IV.1.q (fixed derivative labels). The conclusions of Lemma IV.1.p yield the maps \(\kappa\) and \(\tau\) of IV.1.2.

Proof sketch. This is a finite-dimensional compactness argument.

The identity for \(\tau\) is the distributional relation \(\partial_{x_i^a} S_v = S_{v_{i \to \tau_a v_i}}\).

Lean: lifts_model, Dash.brace, Wakes.through_ties, Dash.monitor.

4.6 Smoothness

Lemma IV.1.r (distributional regularity). Let \(K_w\), with \(w\) ranging over label lists of arity \(n\), be locally integrable on \(\text{Conf}_n\) and continuous on \(\text{Gen}_n\). Assume that for every \(w\), slot \(i\) and axis \(a\) there is \(w'\) with \(\partial_{x_i^a} K_w = K_{w'}\) in \(\mathcal{D}' (\text{Conf}_n)\). Then every \(K_w\) agrees almost everywhere on \(\text{Conf}_n\), and everywhere on \(\text{Gen}_n\), with a function in \(C^{\infty} (\text{Conf}_n)\).

Proof sketch.

Lean: Dash.awake, aggregate, repair, arises, Hidden, currents, closeBy.

Lemma IV.1.s (the smooth version is a raw limit with a derivative plan). Let \(T\) be given by Lemma IV.1.r applied to \(S\) and the maps of IV.1.2. Then \(T\) satisfies the conclusions of IV.1.3.

Proof sketch.

Lean: Org.Arrives.serves, RawLimits.ready, Table.Field.

4.7 Euclidean axioms, bounds and assembly

Lemma IV.1.t (symmetries and basic identities). If \(T\) is smooth on \(\text{Conf}_n\) and is a point limit (IV.1.1 (a)–(b)) along \(f\), and (H1) holds, then \(T\) satisfies (E1)–(E3).

Proof sketch.

Lean: Order.limits_basic, Order.spin, Order.homogeneous, Order.inPatch, Order.equal.

Lemma IV.1.u (reflection positivity of the limit). If \(T\) is smooth, symmetric and an ordered limit along \(f\), and (H1) holds, then (E5) holds; (E5) implies (E4).

Proof sketch.

Lean: Order.realPositive, Banks.at_cut, Banks.kept, Banks.plane, Pairing.at_point, Pairing.nearGram.

Lemma IV.1.v (the polynomial bound). Under the hypotheses of IV.1.5, its stated exponent \(4 n (1 + \max_i d_i)\) is valid.

Proof sketch. Set \(D = 1 + \max_i d_i\). The centered power budgets for all transformed labels can be bounded by \(Ba_k^{- D}\) for every \(k \geqslant M\), with fixed \(B \geqslant 0\) and \(M\).

Lean: Work.D05.answer, image_power, scales, separated_bound.

Lemma IV.1.w (orientation). Under the hypotheses of IV.1.6, its four symmetry identities hold on the quotient spaces \(F_d\).

Proof sketch. A class in \(F_d\) is determined by its kernels against all spectators. Compare the kernels of both sides using (E2) and the chain rule for \(x \mapsto sx\) and for complex conjugation.

Lean: Work.D06.compat.

Lemma IV.1.x (assembly). If \(T\) is an ordered limit and a point limit along \(f\), (H1) holds, \(T\) is smooth and (E7) holds, then \(T\) satisfies the hierarchy (E1)–(E7).

Proof sketch. Lemmas IV.1.t and IV.1.u give (E1)–(E5); (E6)–(E7) are assumed. When (H2) and the derivative plan of IV.1.3 are also available, IV.1.5 and B10 supply (E7). B10 inducts on the derivative order: each coordinate derivative is a kernel with one raised label, and the operator norm is bounded by a finite sum of coordinate norms. The base case is IV.1.5. On the main path, compactness of the bounded projection matrices gives a common refinement before forming the bundle of Remark 1.

Lean: Order.assembles, Org.Cleaner.stay, Bid.healthy, Work.B10.capped_tags, include_projections, Projected.ready, Next.Extract.Base.

5. Where the difficulty lies

The main estimates are the transfer-kernel Lipschitz bound and the control of uncentered chessboard roots. Complex interpolation and Cauchy's estimate turn reflection positivity into equicontinuity without prior derivative bounds. Translation log-convexity allows the centered budgets to control observables at arbitrary interior positions.

The regularity argument depends on more than compactness: the relay estimates supply degree-raised approximants to differences, and the rank comparison identifies precisely which labels vanish. The normalized remainder estimate in Lemma IV.1.p is needed to obtain fixed derivative labels. Fourier regularity, passage of symmetries by density, and positivity of limiting Gram matrices then use standard arguments.

Three distinctions matter:

6. Notation

object code name proposed notation
Wilson family; spacing, period, coupling Family (C.S.a, C.S.period, C.beta) \(C\); \(a_N\), \(L_p\), \(\beta_{N, p}\)
specification of the family Family.Makes (H1)
label, register of labels Register.Token, Family.book \(v \in \text{Label}_d\)
unit label; reflected label Register.one, Register.reflectedToken \(1_d\); \(\theta_a v = \rho_d (s_a) \bar{v}\)
renormalized lattice observable Family.O \(I_{N, p} (v, x)\)
lattice correlation; smeared Family.numeric, Order.smears \(\mathcal{C}_{N, p} (v ; x)\), \(\mathcal{C}_{N, p} (v ; t)\)
configuration sets conf, generic, NoHit, Cyclic \(\text{Conf}_n\), \(\text{Gen}_n\), \(\text{Conf}^{(p)}_n\), \(\text{Gen}^{(p)}_n\)
test functions; admissible at \(p\) Test, suitable \(\mathcal{D}_n\); \(\text{supp} t \subset (- L_p / 2, L_p / 2)^{4 n}\)
extraction; refinement; ordered sense Order, refine, late, fuse \(f = ((N_j), (p_k))\), \(f \circ g\), "\(k\) large, then \(j\) large"
table Table \(S (v ; x)\), \(T (v ; x)\)
raw limits RawLimits, PointLimits IV.1.1 (a)–(c); \(P_p\)
tiling, copy, chessboard root Tiling, copy, rootTest \(\mathcal{T}\), \(\text{copy}_c\), \(|F|_{\mathcal{T}}\)
centered tiling at \(x\), cells of side \(a_m\) Cells.center \(\mathcal{T}_m (x)\)
interior function of a cell Interior \(F \in \mathcal{A} (\text{cell})\)
reflection positivity and chessboard inequality Seam (RP), (CB)
budgets Wcmain, CenterPort input 2; (H2)
uniform bound; equicontinuity Bound, TransferLip (B1)–(B2), (E1)–(E2)
forward difference quotient heighten \(a_N^{- 1} [I (v, \cdot + e_a) - I (v, \cdot)]\)
chessboard-small; subpolynomial growth close, dollar —
projections; relay data Dash.Bin, RelayBin \(\pi_d (N, p) \to \pi_d\); pace, transit, mark
null labels; label quotient Dash.monitor, Table.null, Table.Field \(\text{Null}_d\), \(F_d = \text{Label}_d / \text{Null}_d\)
derivative labels; derivative plan MonitorOps, DiffPlan \(\kappa_{d, e}\), \(\tau_{d, a}\); \(\text{rise}_{d, e}\), \(\partial_{d, a}\)
Euclidean hierarchy Table.Hierarchy (E1)–(E7)
zeroth-order polynomial bound Bid.OneCap IV.1.5
bundle handed downstream Next.Extract.Base —

7. What remains unexplained

  1. Ultraviolet relay and rank estimates. The interfaces in MergeProof.Scotia and savings were checked, together with their use in the dimension argument. The upstream proofs of the matching estimates and interacting rank comparison in III.10–III.11 were not audited here. In particular, the dimension inequality is a separate input; it does not follow from the centered root budgets.

  2. Volume-uniform budget. The supplier is gardena (III.11). Its proof reduces to earlier estimates on the same family, but their relation to the volume-uniform bounds assigned to III.12 was not traced in full.

  3. Fixed-volume ultraviolet limit. The full-spacing upgrade required by wilsonLimit is located and explained in Remark 2. The upstream construction of the full fixed-volume kernels used by that upgrade was not audited here.

  4. Alternative assembly. Next.Extract.finish and common give another conditional route to the same bundle. They require relay costs and detector estimates in addition to the centered budgets. Their hypotheses were checked; they are not additional proofs of the ultraviolet inputs.

← III.16 Analytic toolkit (notes)Part IV·Unit outlineV.1 Decomposition of the limit into phases (notes) →