Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.7 Matching the Wilson energy to fourth order (notes)Part III·Unit outlineIII.9 The marginal flow: the running coupling and its reset (notes) →

III.8. Connected activities and backward dependence cones — detailed notes

Contents

1. What this unit proves 2

Part A 2

Part B 5

2. What it uses 7

3. Strategy 8

4. Steps 9

A. Connected heat coefficients 9

B. Backward dependence cones 12

5. Where the difficulty lies 15

6. Notation 16

7. What remains unexplained 16

The full account of unit III.8: 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: YM/RG08/Steam/, YM/RG08/Forms/, YM/RG08/Skiff/, YM/RG08/Jetty/, YM/Push/GRID_APPROXIMATION/. The support packages are listed in §7. Size: 4,147 lines in the main-theorem closure:

The unit has two independent halves.

1. What this unit proves

Part A

Conventions.

\(\displaystyle \lVert F \rVert_{\sigma} = \max_{1 \leqslant i \leqslant n} \sup_{z \in I} \sum_{x \in I^n, x_i = z} |F (x) | e^{\sigma \text{diam}_d (x)} \in [0, \infty] .\)

For \(n = 0\) set \(\lVert F \rVert_{\sigma} = 0\): a rooted bound imposes no condition on the scalar coefficient. Suprema over empty index sets also have value \(0\).

\(\displaystyle [\Gamma]_{\sigma} = \max \left( \sup_u \sum_v | \Gamma (u, v) |e^{\sigma d (u, v)}, \sup_v \sum_u | \Gamma (u, v) |e^{\sigma d (u, v)} \right) .\)

Formal potentials. A formal potential is a family \(V = (V_{e, n})_{e, n \geqslant 0}\) of rank-\(n\) tensors; \(V_{e, n}\) is the coefficient of \(g^e\) with \(n\) field variables. In Gaussian applications the variables may include spectators, on which \(\Gamma\) vanishes. \(V\) is eligible if \(V_{0, n} = 0\) for all \(n\), and \(V_{e, n} \ne 0\) implies \(n \leqslant e + 2\) and \(e + n\) even. Eligibility does not require symmetry.

Heat coefficients. The heat coefficients \(V^{(j)} = V^{(j)} (\Gamma, V)\) are defined by \(V^{(0)} = V\) and

\(\displaystyle V^{(j + 1)}_{e, n} = \frac{1}{j + 1} \left[ \binom{n + 2}{2} \Delta_{\Gamma} V^{(j)}_{e, n + 2} + \sum_{c = 0}^n \sum_{i = 0}^j \sum_{a = 0}^e \frac{(c + 1) (n - c + 1)}{2} V^{(i)}_{a, c + 1} \star_{\Gamma} V^{(j - i)}_{e - a, n - c + 1} \right] . \qquad (\text{A1})\)

Here \(\Delta_{\Gamma}\) (contraction) and \(\star_{\Gamma}\) (join) are defined in Step A1. For infinite \(I\), the recursions assign value \(0\) to a sum that is not summable. The bounds below justify the required sums absolutely for positive-rank unmarked outputs and for all marked outputs; they make no convergence assertion for unmarked scalar contractions. The formal heat-equation interpretation for finite \(I\) and symmetric \(V, \Gamma\) is given in A1.

Proposition III.8.1 (bounds at fixed order for the connected heat coefficients). Fix \(j, e, n \in \mathbb{N}\) and put

\(\displaystyle T_j (e, n) = \{(a, r) : 1 \leqslant a < e, 1 \leqslant r \leqslant a + 2\} \cup \{(e, r) : 1 \leqslant e, n < r \leqslant e + 2\},\)

enlarged by \((e, n)\) when \(j = 0\), \(e \geqslant 1\) and \(1 \leqslant n \leqslant e + 2\). There is a polynomial majorant \(P\) with the following property. Let \(I\) be a set, \(d\) a pseudometric on it, \(\sigma \geqslant 0\), \(\delta \geqslant 0\), \(W \geqslant 1\), \(V, V'\) eligible and \(\Gamma, \Gamma'\) propagators. Suppose \((\Gamma, \Gamma')\) is \((W, \delta)\)-controlled, and so is \((V_{a, r}, V'_{a, r})\) for every \((a, r) \in T_j (e, n)\). Then \((V^{(j)}_{e, n} (\Gamma, V), V^{(j)}_{e, n} (\Gamma', V'))\) is \((P (W), \delta)\)-controlled.

Status: theorem. Lean: YM.RG08.Steam.navigation, input range taps, norms Held, Wire, Cot, WireCot, majorants Wage.

Proposition III.8.2 (support; the heat-time series is finite). Let \(V\) be eligible and \(\Gamma\) arbitrary.

Hence, at fixed \((e, n)\), the heat-time series is zero if \(n > 3 e\) and otherwise is a polynomial in \(t\) of degree at most \(\lfloor (3 e - n) / 2 \rfloor\). For every real \(t\) the complete series is

\(\displaystyle \mathcal{E}_t (V)_{e, n} = \sum_{j = 0}^{3 e} t^j V^{(j)}_{e, n} = V_{e, n} +\mathcal{R}_t (V)_{e, n}, \qquad \mathcal{R}_t (V)_{e, n} = \sum_{j = 1}^{3 e} t^j V^{(j)}_{e, n},\)

and \(\mathcal{E}_t (V)\) is eligible. Status: theorem. Lean: preserves, live, off, coal, ember, cinder, smoulder, appropriate.

Proposition III.8.3 (expansion with one marked insertion).

Test functions and their norms. Let \(\mathcal{S}\) be the real vector space of smooth real-valued functions on \(\mathbb{R}^4\) whose derivatives of every order have polynomial growth. For \(k \in \mathbb{N}\) and \(\sigma > 0\), using the Euclidean norm \(|y|\), put

\(\displaystyle \lVert f \rVert_{k, \sigma} = \max_{| \alpha | \leqslant k} \sup_{y \in \mathbb{R}^4} | \partial^{\alpha} f (y) | e^{- \sigma |y|},\)

and, for a real-linear functional \(\lambda\) on \(\mathcal{S}\), \(\lVert \lambda \rVert^{\ast}_{k, \sigma} = \sup \{| \lambda (f) | : \lVert f \rVert_{k, \sigma} \leqslant 1\}\).

Marked tensors and the marked norm. A marked rank-\(n\) tensor assigns to each \(x \in I^n\) a real-linear functional \(M (x)\) on \(\mathcal{S}\). Let \(h : I \to [0, \infty)\) be 1-Lipschitz for \(d\) (a height, for instance a distance to the insertion), and set \(h (x) = \max (0, \max_i h (x_i))\) for a tuple \(x\). The marked norm is the unrooted weighted \(\ell^1\) norm

\(\displaystyle \lVert M \rVert_h = \sum_{x \in I^n} \lVert M (x) \rVert^{\ast}_{k, \sigma} e^{\sigma h (x)} .\)

Unlike the rooted norm, it gives a genuine bound for \(n = 0\). A pair \((M, M')\) is \((U, \delta)\)-controlled if \(\lVert M \rVert_h \leqslant U\), \(\lVert M' \rVert_h \leqslant U\) and \(\lVert M - M' \rVert_h \leqslant U \delta\).

Marked heat coefficients. For a marked series \(F = (F_{e, n})\) they are \(M^{(0)} = F\) and

\(\displaystyle M^{(j + 1)}_{e, n} = \frac{1}{j + 1} \left[ \binom{n + 2}{2} \Delta_{\Gamma} M^{(j)}_{e, n + 2} + \sum_{c = 0}^n \sum_{i = 0}^j \sum_{a = 0}^e (c + 1) (n - c + 1) M^{(i)}_{a, c + 1} \star_{\Gamma} V^{(j - i)}_{e - a, n - c + 1} \right] .\)

The cross term has twice the coefficient of its unmarked counterpart. The recursive outputs are initially maps on test functions; the bounds below prove that they are real-linear. Their interpretation as a normalised Gaussian expectation is discussed in §7.

(i) Fixed-order bound. Fix \(j, e, n\). There is a polynomial majorant \(P\) with the following property, for all \(I, d, h\) as above, \(\sigma > 0\), \(k \in \mathbb{N}\), \(\delta \geqslant 0\), \(W \geqslant 1\), \(U \geqslant 0\), eligible \(V, V'\), propagators \(\Gamma, \Gamma'\) and marked series \(F, F'\). Assume:

Then \((M^{(j)}_{e, n} (\Gamma, V, F), M^{(j)}_{e, n} (\Gamma', V', F'))\) is \((P (W) U, \delta)\)-controlled, with real-linear output values. The majorant depends only on \((j, e, n)\); in particular it is independent of \(k, \sigma\) and the height \(h\).

(ii) Support. Let \(l \in \mathbb{N}\). If \(V\) is eligible and \(F_{a, r} \ne 0\) implies \(r \leqslant l + a\) for every \(a, r\), then \(M^{(j)}_{e, n} \ne 0\) implies \(n + 2 j \leqslant l + 3 e\) and \(n \leqslant l + e\).

(iii) Full positive-time part. Fix \(l, e, n\). There is a polynomial majorant \(P\) such that the pair

\(\displaystyle \sum_{j = 1}^{l + 3 e} t^j M^{(j)}_{e, n} (\Gamma, V, F), \qquad \sum_{j = 1}^{l + 3 e} t^j M^{(j)}_{e, n} (\Gamma', V', F')\)

is \((P (W) U, \delta)\)-controlled for every real \(t\) with \(|t| \leqslant W\). The hypotheses are those of (i), with marked inputs required only for \(a < e\), or \(a = e\) and \(r > n\). By (ii), this is the whole positive-time part when both \(F_{a, r}\) and \(F'_{a, r}\) vanish for \(r > l + a\), for every \(a, r\).

Status: theorem. This is the form in which the main theorem uses Part A (in III.14). Lean: journey, full, registry. Test space: Pearl. Norms: Sings, Dyad, purse, beam, Loom, fits.

Part B

Setting.

\(\displaystyle (\mathcal{B}F) (U) = \int k_{\beta} (U, V) F (V) dV.\)

Patch hypothesis (III.1). The minimising frame and the best predictor are unique whenever their respective branches are used. The set of admissible fallback frame tags is nonempty for every cover configuration.

Proposition III.8.4 (one step: the pull-back is local). Assume the patch hypothesis, and let \(\beta \in \mathbb{R}\).

(i) Let \(F\) be a bounded measurable complex function local on a coarse set \(X\), and let \(Y\) be a set of fine sites containing \(\Lambda_{10 \rho} (\iota x)\) for every \(x \in X\). Then \(\mathcal{B}F\) is local on \(Y\).

(ii) Assume moreover that the density is gauge covariant, \(k_{\beta} (U^g, V^{g \circ \iota}) = k_{\beta} (U, V)\) for every fine gauge transformation \(g\). If \(F \in \mathcal{I} (\Lambda_R (o))\), then \(\mathcal{B}F \in \mathcal{I} (\Lambda_{LR + 10 \rho} (\iota o))\), with the same sup bound.

Status: theorem. III.1 supplies these kernel properties for its chosen kernel parameters: the patch hypothesis is Next.Foundations.branches. Gauge covariance follows from StepData.covary. For each step of a history, both are fields of the block-control data built in Calendar.blocks_go. Lean: back_local, back_cylinder.

Proposition III.8.5 (exact factorisation). Assume the patch hypothesis.

Status: theorem. It is an identity, not an estimate, and the fine windows of \(\mathcal{B}F\) and \(\mathcal{B}G\) may overlap. Lean: back_factors, back_cells, backTo_cells, backTo_copies.

History.

Proposition III.8.6 (pull-back along the history). For all \(N, p\) and \(k \leqslant m\):

(i) \(\mathcal{B}_{k \to m}\) maps bounded measurable functions to bounded measurable functions, with \(\sup |\mathcal{B}_{k \to m} F| \leqslant \sup |F|\). It is linear, fixes constants and commutes with complex conjugation.

(ii) For every bounded measurable complex \(F\) at level \(k\) and every integrable complex \(g\) at level \(m\), \(\int (\mathcal{B}^{\ast}_{k \to m} g) F = \int g\mathcal{B}_{k \to m} F\) and \(\int \mathcal{B}^{\ast}_{k \to m} g = \int g\). All integrals here use the Haar probability measures at their respective levels; the push-forward is integrable.

(iii) Let \(h \leqslant k\) and \(i\) a level-\(h\) site. If \(F \in \mathcal{I} (\Lambda_r (\iota_{h \to k} i))\), then \(\mathcal{B}_{k \to m} F \in \mathcal{I} (\Lambda_{r_{k \to m} (r)} (\iota_{h \to m} i))\).

(iv) On bounded measurable functions, \(\mathcal{B}_{k \to m}\) commutes with signed permutations of the axes followed by translation by \(\iota_{h \to \cdot} i\), for \(h \leqslant k\) and each level-\(h\) site \(i\), and with the copy maps of the centred level-\(h\) tiling.

Status: theorem. The hypotheses on the kernels are supplied by the history. Lean: backTo, pushTo, backTo_bound, backTo_env, backTo_add, backTo_const, backTo_star, pushTo_dual, pushTo_integral, backTo_local, backTo_orient, backTo_copy.

Proposition III.8.7 (size of the cone in physical units). For the history above and all nonnegative integer levels and radii:

(i) \(\tau_{m + 1} \leqslant \frac{2}{3} \tau_m\); hence \(\tau_m \leqslant (2 / 3)^m \tau_0 \to 0\).

(ii) \(a_m r_{k \to m} (r) + \tau_m \leqslant a_k r + \tau_k\) for \(k \leqslant m\). Thus an observable of lattice radius \(r\) at level \(k\) has, at every finer level, a backward cone of physical radius at most \(a_k r + \tau_k\), uniformly in \(m\), \(N\) and \(p\).

(iii) If \(h \leqslant k\) and \(\text{room} (h, k, r)\) holds, then for every \(m \geqslant k\) and every level-\(h\) site \(i\), the box \(\Lambda_{r_{k \to m} (r)} (\iota_{h \to m} i)\) lies in the cell of \(i\) of the centred level-\(h\) tiling at level \(m\). That cell has \(L_h \cdots L_{m - 1}\) sites per side, i.e. physical side \(a_h\).

(iv) For fixed \(h\) and \(r\), \(\text{room} (h, k, r)\) holds for all sufficiently large \(k \geqslant h\).

Status: theorem. Lean: tail, tail_next, tail_zero, scales_next, scales_budget, room, room_fits, plenty.

2. What it uses

3. Strategy

Part A. Each step of (A1) either contracts two slots of one coefficient or joins two coefficients by a propagator line. The rooted norm absorbs the internal sums without changing \(\sigma\): the output diameter is bounded by the input diameters plus the line length, so the exponential weights multiply. For a marked coefficient, the height inequality plays the same role, with the marked factor summed over all its slots.

Induction on heat order gives a polynomial majorant in \(W\). Telescoping the inputs gives the corresponding difference bound with the same \(\delta\). Every primitive vertex has positive coupling order and at most three times that order in slots; every propagator removes two slots. This gives \(n + 2 j \leqslant 3 e\) and finiteness in heat time at each coupling order. Positive heat order uses only lower coupling orders and higher ranks at the same coupling order.

Part B. Given the fine field, the kernel first draws independent site tags, then independent predictor tags on bonds, and finally independent coarse links conditional on these tags. Integrating an observable local on \(X\) removes all unused bonds and site tags. The remaining factors read the fine field within radius \(10 \rho\) of \(\iota X\). Observables on disjoint coarse site sets use disjoint tags and bonds, so their pull-backs multiply. Under iteration the radius grows by \(R \mapsto L_m R + 10 \rho_m\). In physical units the added radius is at most \(\tau_m / 3\), while \(\tau_{m + 1} \leqslant 2 \tau_m / 3\). The total radius therefore stays within \(a_k r + \tau_k\). When this fits in one level-\(h\) cell, different cells remain separate at every intermediate step, allowing the product formula to iterate.

4. Steps

A. Connected heat coefficients

A1. Operations and the recursion.

Definitions. For \(F\) of rank \(m + 2\),

\(\displaystyle (\Delta_{\Gamma} F) (x) = \text{Sym} \sum_{u, v \in I} \Gamma (u, v) F (u, v, x) .\)

For \(F\) of rank \(p + 1\) and \(G\) of rank \(q + 1\), the join has rank \(p + q\):

\(\displaystyle (F \star_{\Gamma} G) (x, y) = \text{Sym} \sum_{u, v \in I} F (u, x) \Gamma (u, v) G (v, y) .\)

\(\text{Sym}\) averages over permutations of the slots.

Combinatorial factors. On a finite index set, write \(W = \sum_n \langle W_n, \phi^{\otimes n} \rangle\) with symmetric coefficient tensors and no slot factorials. For symmetric \(\Gamma\), the differential operators \(\tfrac{1}{2} \sum_{u, v} \Gamma (u, v) \partial_u \partial_v W\) and \(\tfrac{1}{2} \sum_{u, v} \Gamma (u, v) \partial_u W \hspace{0.17em} \partial_v W\) give the factors \(\binom{n + 2}{2}\) and \((c + 1) (n - c + 1) / 2\). For nonsymmetric tensors (A1) remains a definition, without this identification.

Vanishing terms and symmetry. For eligible \(V\) the pair terms with \(a = 0\) or \(a = e\) vanish, because \(V^{(i)}_{0, \cdot} = 0\). Every \(V^{(j)}\) with \(j \geqslant 1\) is symmetric, since every term is symmetrised.

Formal heat equation. For finite \(I\), eligible \(V\) symmetric in every rank (waxed), and symmetric \(\Gamma\), III.14 proves:

These identities support the formal cumulant interpretation. They do not assert convergence of a Gaussian integral or of the series in \(g\). The norm estimates use only the recursion.

Lean: lap, bridge, bleach, unilateral, pair, wheels, bank, burn, blaze, coal.

A2. Support (Proposition III.8.2). Since \(\Delta_{\Gamma} 0 = 0\) and \(0 \star_{\Gamma} G = F \star_{\Gamma} 0 = 0\), a nonzero \(V^{(j + 1)}_{e, n}\) has a nonzero predecessor: either \(V^{(j)}_{e, n + 2} \ne 0\), or both \(V^{(i)}_{a, c + 1}\) and \(V^{(j - i)}_{e - a, n - c + 1}\) are nonzero for some \(c \leqslant n\), \(i \leqslant j\), \(a \leqslant e\). Strong induction on \(j\) gives \(n + 2 j \leqslant 3 e\):

Parity and \(n \leqslant e + 2\) propagate the same way. Splitting off \(j = 0\) gives \(\mathcal{E}_t = V +\mathcal{R}_t\). Lean: predecessors, preserves, live, off, smoulder, appropriate.

A3. The two contraction estimates. Let \(\sigma \geqslant 0\), let the input rooted norms and \([\Gamma]_{\sigma}\) be finite, and require positive output rank. Then

\(\displaystyle \lVert \Delta_{\Gamma} F \rVert_{\sigma} \leqslant \lVert F \rVert_{\sigma} \sup | \Gamma | \leqslant \lVert F \rVert_{\sigma} [\Gamma]_{\sigma}, \qquad \lVert F \star_{\Gamma} G \rVert_{\sigma} \leqslant \lVert F \rVert_{\sigma} [\Gamma]_{\sigma} \lVert G \rVert_{\sigma} .\)

Symmetrisation. \(\text{Sym}\) does not increase the rooted norm: it permutes the slots and preserves diameters.

Contraction. Fix a slot of \(x\). Then \(\text{diam} (x) \leqslant \text{diam} (u, v, x)\) and \(| \Gamma (u, v) | \leqslant \sup | \Gamma |\), and the sum over \((u, v, x)\) with that slot fixed is a rooted sum of \(F\).

Join. The key inequality is

\(\displaystyle \text{diam} (x, y) \leqslant \text{diam} (u, x) + d (u, v) + \text{diam} (v, y) .\)

With a slot of \(x\) fixed, sum in three stages:

  1. over \(y\) at fixed \(v\): at most \(\lVert G \rVert\), rooted at \(v\);

  2. over \(v\): at most the row sum of \(\Gamma\);

  3. over \((u, x)\): at most \(\lVert F \rVert\).

A fixed slot of \(y\) is treated symmetrically, with column sums.

Differences. Absolute convergence permits telescoping: \(\Delta_{\Gamma} F - \Delta_{\Gamma'} F' = \Delta_{\Gamma} (F - F') + \Delta_{\Gamma - \Gamma'} F'\), and the join gives three terms. If the tensor pairs are \((P, \delta)\)- and \((Q, \delta)\)-controlled and \((\Gamma, \Gamma')\) is \((B, \delta)\)-controlled, with \(P, Q, B, \delta \geqslant 0\), the contraction pair is \((2 PB, \delta)\)-controlled and the join pair is \((3 PBQ, \delta)\)-controlled. At output rank \(0\) these controlled-pair conclusions are vacuous; telescoping need not be valid for divergent scalar sums.

Lean: Ground, Held with ensign, Wire, unary, Held.lap, arc, root_sum, binary_EN, Held.bridge, Held.bleach, lap_compare, bridge_compare, Held.lap_diff, Held.bridge_diff, Cot.lap', Cot.bridge'.

A4. Proof of Proposition III.8.1. Strong induction on \(j\), for all \((e, n)\) at once.

Base, \(j = 0\). For \(n = 0\) the claim is vacuous. For \(e = 0\), or \(n > e + 2\), the coefficient is zero by eligibility. Otherwise \((e, n) \in T_0 (e, n)\) and the bound is \(W\).

Step, \(j \to j + 1\). Use (A1).

With \(B = W\) for the propagator, A3 gives the polynomial majorant

\(\displaystyle P_{j + 1, e, n} (x) = \frac{1}{j + 1} \left[ \binom{n + 2}{2} 2 xP_{j, e, n + 2} (x) + \sum_{c = 0}^n \sum_{i = 0}^j \sum_{a = 0}^e \frac{(c + 1) (n - c + 1)}{2} 3 xP_{i, a, c + 1} (x) P_{j - i, e - a, n - c + 1} (x) \right] .\)

Lean: navigation, taps, Wage.

A5. Full correction and change of index set (outside the main-theorem closure).

Lean: postage, raft, lighthouse, street, Alley, Cot.raft, paving, strict, allG.

A6. Marked expansion (Proposition III.8.3).

Operations. For \(M\) marked and \(G\) unmarked, the contraction \(\Delta_{\Gamma} M\) is as in A1, and the join is \((M \star_{\Gamma} G) (x, y) = \text{Sym} \sum_{u, v} \Gamma (u, v) G (v, y) M (u, x)\).

Estimates.

\(\displaystyle \lVert \Delta_{\Gamma} M \rVert_h \leqslant \sup | \Gamma | \lVert M \rVert_h, \qquad \lVert M \star_{\Gamma} G \rVert_h \leqslant \lVert M \rVert_h [\Gamma]_{\sigma} \lVert G \rVert_{\sigma} .\)

The first holds because \(h (x) \leqslant h (u, v, x)\). The second follows from \(h (x, y) \leqslant h (u, x) + d (u, v) + \text{diam}_d (v, y)\), which uses that \(h\) is 1-Lipschitz. Sum the marked factor over all its slots, the propagator by its row bound, and the unmarked factor by its rooted bound at \(v\). With finite input bounds, the sum of the dual norms is finite. Evaluation at each test function is therefore absolutely summable and preserves linearity, including at output rank \(0\). The difference constants are \(2\) and \(3\), as in A3.

Induction for (i). Induct on \(j\) as in A4.

This gives (i) with output \(P (W) U\).

(ii) and (iii). For (ii), a nonzero contraction has a marked predecessor of rank \(n + 2\). A nonzero join has marked and unmarked predecessors whose ranks sum to \(n + 2\) and whose coupling orders sum to \(e\). Add the marked induction bounds to the unmarked bounds of III.8.2 to obtain \(n + 2 j \leqslant l + 3 e\) and \(n \leqslant l + e\). For (iii), sum (i) over \(1 \leqslant j \leqslant l + 3 e\), using \(|t|^j \leqslant W^j\); no bound for the initial rank-\(n\), order-\(e\) marked coefficient is needed.

Consistency. Evaluating a marked tensor at a fixed test function turns its contraction and join into those of A1.

Lean: Loom, Sings, purse, beam, Lyrics, Dyad, fits, pocket, cloak, Dyad.pocket, Dyad.cloak, shim, shift, rungs, skate, climbs, across, journey, Lit, full, shaker, cruising, registry, clocked, reel_stamp.

B. Backward dependence cones

B1. Product structure of the kernel. Summing the bond tags out of the definition in III.1 gives

\(\displaystyle k_{\beta} (U, V) = \sum_t \prod_x q_x (U, t_x) \prod_b p_b (U, t ; V_b) .\)
\(\displaystyle p_b (U, t ; v) = \sum_r w_r (Y_b) Z_{\beta}^{- 1} \exp (- \beta \kappa \text{price} (vQ_r (Y_b)^{- 1})) .\)

Here \(\kappa > 0\) is the kernel penalty of III.1, called \(b\) in the main theorem.

Each \(p_b\) has Haar integral \(1\). The identity \(\sum_r q_x (U, r) = 1\) uses the patch hypothesis (the fallback set is nonempty). Hence

\(\displaystyle \mathcal{B}F (U) = \sum_t \left( \prod_x q_x (U, t_x) \right) S_F (U, t), \qquad S_F (U, t) = \int \prod_b p_b (U, t ; V_b) F (V) dV.\)

Given \(U\), the site tags are independent; given \(U\) and the tags, the coarse links are independent. Adjacent bonds share a tag, so the links are not independent given \(U\) alone. Lean: density_parts, noiseLink, perLink, perSite, noiseLink_mass, perLink_mass, site_unit, parts_back.

B2. Read sets.

(a) Frames. The frame and the frame mass at \(x\) depend only on \(U\) on links inside \(\Lambda_{10 \rho} (\iota x)\). There are two branches:

All transports run along coordinate routes between points of \(\Lambda_{\rho}\), of length at most \(8 \rho\), so they stay in \(\Lambda_{9 \rho}\). The minimiser is selected by a global choice. Its uniqueness (patch hypothesis) is what forces two configurations that agree on the window to select the same frame.

(b) Connectors. The connector of the bond from \(x\) to \(x + e_{\mu}\) depends only on the tags at both ends and on \(U\) in \(\Lambda_{10 \rho} (\iota x) \cup \Lambda_{10 \rho} (\iota (x + e_{\mu}))\). It is built from the two frames and from straight transports of length \(L \leqslant \rho\).

Lean: patch_dep, route_bound, visits_bound, site_dep, connector_dep, reach.

B3. Locality (Proposition III.8.4). Two elementary facts:

Proof of (i). If \(F\) is local on \(X\), it reads only bonds with both ends in \(X\). By (P1) and B2(b), \(S_F (U, t)\) depends only on \(t|_X\) and on \(U\) in the windows around \(\iota X\). By (P2), the tags off \(X\) sum out. By B2(a), \(q_x\) for \(x \in X\) reads \(U\) only in \(\Lambda_{10 \rho} (\iota x)\).

Proof of (ii). If \(y \in \Lambda_R (o)\) then \(\iota y \in \Lambda_{LR} (\iota o)\), and \(\Lambda_{10 \rho}\) of a point of \(\Lambda_{LR} (\iota o)\) lies in \(\Lambda_{LR + 10 \rho} (\iota o)\). Gauge invariance follows from the covariance of \(k_{\beta}\) and the invariance of Haar measure. The sup bound and measurability hold because \(k_{\beta}\) is a probability kernel.

Lean: Reads, pi_ignores, sum_ignores, actualEdges, state_reads, back_local, window_embed, window_add, back_natural, back_bound, back_env, back_cylinder.

B4. Factorisation (Proposition III.8.5).

Lean: pi_independent, sum_independent, back_factors, back_cells, backTo_cells, copy_window, backTo_copies.

B5. Iteration (Proposition III.8.6). Induct on \(m - k\), with \(\mathcal{B}_{k \to m + 1} =\mathcal{B}_m \circ \mathcal{B}_{k \to m}\).

Lean: backTo_next, backTo_env, backTo_bound, backTo_add, backTo_const, backTo_star, back_dual, pushTo_integral, pushTo_dual, anchor_next, backTo_local, backTo_orient, backTo_copy.

B6. Physical size of the cone (Proposition III.8.7).

Lean: expansion, grows, grows_next, tail_next, tail_zero, scales_next, scales_budget, tiling_window, window_fits, room_fits, plenty.

B7. Two consequences used downstream.

(a) Replicated differences (used by III.11). Fix \(N, p\) and \(h \leqslant k \leqslant N\). Let \(O\) be a bounded measurable complex function at level \(N\), let \(F \in \mathcal{I} (\Lambda_w (0))\) at level \(k\) with \(\text{room} (h, k, w)\), and let \(s\) be a finite set of level-\(h\) sites. Then

\(\displaystyle Z_N \left\langle \prod_{i \in s} \text{copy}_i (\mathcal{B}_{k \to N} F - O) \right\rangle_N = \sum_{l \subseteq s} \int \mathcal{B}^{\ast}_{k \to N} \left[ e^{- S_N} \prod_{i \in s \setminus l} (- \text{copy}_i O) \right] \prod_{i \in l} \text{copy}_i F.\)

Here \(S_N = \beta_{N, p, N} E_N\) is the Wilson action, \(Z_N = \int e^{- S_N} \hspace{0.17em} dU\), and \(\langle Q \rangle_N = Z_N^{- 1} \int e^{- S_N} Q \hspace{0.17em} dU\). The copies on each side use the level-\(h\) tiling at the level of their argument; the integrals on the right are at level \(k\). Expand the product, commute the copies with subtraction, then apply III.8.5 and the duality in III.8.6(ii). The old factors stay together inside one push-forward; no independence of \(O\) is required.

(b) Chessboard telescoping (used by III.13, VII.2). Fix \(h \leqslant N\), \(p\) and a real coupling \(\beta\) for which the chessboard inequality of IV.1 holds; the Wilson law has this property for \(\beta \geqslant 0\). Let \(T\) be the centred level-\(h\) tiling at level \(N\). For a central-cell observable \(Q\), define

\(\displaystyle \text{root}_T (Q) = | \left\langle \prod_{a \in T} \text{copy}_a Q \right\rangle_{\beta} |^{1 / (\sharp T)},\)

where \(\sharp T\) is the number of cells. Let the index set be finite, let \(a_i\) be distinct level-\(h\) sites, and let \(O_i, Z_i \in \mathcal{I} (T_0)\), where \(T_0\) is the central cell. Put \(b_i = \iota_{h \to N} a_i\) and let \(\tau_{b_i}\) act on configurations by lattice translation. If real bounds \(c_i, e_i\) satisfy \(\text{root}_T (O_i) \leqslant c_i\) and \(\text{root}_T (Z_i - O_i) \leqslant e_i\), then

\(\displaystyle | \left\langle \prod_i (Z_i \circ \tau_{b_i}) \right\rangle_{\beta} - \left\langle \prod_i (O_i \circ \tau_{b_i}) \right\rangle_{\beta} | \leqslant \prod_i (e_i + c_i) - \prod_i c_i .\)

Expand \(\prod_i (O_i + (Z_i - O_i))\) over subsets. The empty-subset term cancels, and the chessboard estimate bounds each remaining term by the corresponding product of \(c_i\) and \(e_i\). To apply it to literal translates, undo the reflection in each copy and, on odd cells, conjugate its source. These operations preserve the central-cell class and its root. Summing the nonempty-subset bounds gives the right-hand side.

Lean: Joint.restored, tariff; rooted_translates.

5. Where the difficulty lies

6. Notation

Written proof Lean Meaning
\(I\), \(d\), \(\text{diam}_d\) Ground, Ground.radius cells with a pseudometric; largest distance within a tuple
rank-\(n\) tensor Tape, Flake; file function on \(I^n\), ordered slots
\(\lVert F \rVert_{\sigma} \leqslant p\) Held rooted weighted \(\ell^1\) bound (empty at rank \(0\))
\(\Gamma\), \([\Gamma]_{\sigma} \leqslant B\) Line, Wire propagator; weighted row and column sums
\((W, \delta)\)-controlled Cot, WireCot both at most \(W\), difference at most \(W \delta\)
polynomial majorant Wage \(0 \leqslant P (x) \leqslant Cx^t\) for \(x \geqslant 1\)
\(V = (V_{e, n})\), eligible Grain, Eligible formal potential
\(\Delta_{\Gamma}\), \(\star_{\Gamma}\), \(\text{Sym}\) lap, bridge, bleach contraction, join, symmetrisation
\(V^{(j)}\) burn heat coefficient
\(T_j (e, n)\) taps (Residual is \(T_1\)) admissible inputs
\(\mathcal{E}_t\), \(\mathcal{R}_t\) ember, cinder full series; positive-time part
\(h\), \(h (x)\) Loom, Loom.cage height; its maximum over a tuple
\(\lVert f \rVert_{k, \sigma}\), \(\lVert \lambda \rVert^{\ast}_{k, \sigma}\) beam, purse weighted \(C^k\) norm of test functions; dual norm
\(\lVert M \rVert_h\); \((U, \delta)\)-controlled Sings, Dyad marked norm; marked pairs
marked \(\Delta_{\Gamma}\), \(\star_{\Gamma}\) pocket, cloak marked contraction and join
\(M^{(j)}\); \(\sum_{j \geqslant 1} t^j M^{(j)}\) skate; shaker marked heat coefficients; positive-time part
\(k_{\beta}\) StepData.density conditional density of the coarse field given the fine field
\(\mathcal{B}\) back one-step pull-back
\(q_x\), \(p_b\) perSite, perLink tag law at a site; link law at a bond
\(\Lambda_r (x)\) window periodic \(\ell^{\infty}\) box
\(10 \rho\); \(\rho = (J + 3) L\) reach; Patch.radius read radius; patch radius
\(\mathcal{I} (X)\) Interior gauge invariant, measurable, bounded, local on \(X\)
\(\mathcal{B}_{k \to m}\), \(\mathcal{B}^{\ast}_{k \to m}\) backTo, pushTo iterated pull-back; push-forward
\(\iota_{h \to m}\) anchor image of a level-\(h\) site at level \(m\)
\(r_{k \to m} (r)\) grows, expansion cone radius in lattice units
\(\tau_m\) tail physical cone budget \(30 a_m (J_m + 5)\)
\(\text{room} (h, k, r)\) room \(2 (a_k r + \tau_k) < a_h\)

7. What remains unexplained

  1. Application of the bounds. The marked bound III.8.3 feeds III.14 through Necks.slushy_uniform. The support and finite-sum identities of III.8.2 also enter III.14 directly. The choices of \(W, \delta, \sigma, h\) and the covariance line bounds must be explained there; their derivation from earlier covariance estimates has not been traced here. The paired covariance and potential bounds are explicit hypotheses of that application.

  2. Gaussian interpretation. A1 verifies the unmarked formal heat equations for finite index sets and symmetric input tensors and propagators. For symmetric marked inputs, the intended identity is

\(\displaystyle M_t (\phi) = \frac{\mathbb{E}_{t \Gamma} [F (g, \phi + \zeta) e^{V (g, \phi + \zeta)}]}{\mathbb{E}_{t \Gamma} [e^{V (g, \phi + \zeta)}]} \qquad \text{(probable)},\)

coefficientwise in \(g\), with expectation interpreted by Wick's rule. The marked source announces this identification for later work, but a proof was not located. In particular the marked rank-\(0\) coefficient should not yet be described as a proved normalised expectation. No analytic convergence of the series in \(g\) is asserted. 3. Infinite-lattice scalars. The unmarked norm leaves rank \(0\) uncontrolled. The scalar recursions are total-sum definitions, whose values need not represent convergent infinite-volume sums. A use of these scalars requires a separate finite-volume or vacuum-density argument. 4. Scope beyond the stated results. Step A5 gives bounds outside the main-theorem closure; III.14 uses the transported-potential definitions without those bounds. The marked transport in Skiff/Pave.lean and the further applications in GRID_APPROXIMATION/Birth, Nil, Candidates, Picture, Estimate and Attach* are not developed in this outline. The relation between these formal connected coefficients and the polymer activities of III.5 also remains to be explained in III.14 (tentative). 5. Support packages. About 1,970 assigned lines lie outside the two arguments above. Their mathematical roles have only been classified from documentation (tentative): Carrel treats path templates and their leading curl; Camera treats jets of chart germs; Room treats field pull-backs, Jacobians and centred Wick operations; Rudder treats symmetric lifts; and Pert/Bulk and Packets supply weighted sums. AnalyticNext/QUARTIC_MATCH belongs with the quartic analysis of III.7 and III.10. Other assigned packages include Isles, Anchor, parts of Cloud and Glyph, WilsonBulk/Web and ProofPorts/…. These packages need separate outlines if their results are to be included here.

← III.7 Matching the Wilson energy to fourth order (notes)Part III·Unit outlineIII.9 The marginal flow: the running coupling and its reset (notes) →