Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← VII.3 Free Wick polynomials and reflected Gram positivity (notes)Part VII·Unit outlineVII.5 Asymptotic freedom of the running coupling (notes) →

VII.4. Operator product expansion and contact extensions — detailed notes

Contents

1. What this unit proves 3

2. What it uses 9

3. Strategy 11

4. Steps 11

4.1 Rates and sequences 11

4.2 Prescription and Reader 12

4.3 Norms in the ground algebra 13

4.4 The lattice cluster estimate 14

4.5 The OPE at grid configurations 16

4.6 Arbitrary configurations and exponents 17

4.7 The Reader and the separated OPE 18

4.8 Integrated and nested forms 19

4.9 The slab bound of V.1 20

4.10 Contact extensions 21

5. Where the difficulty lies 24

6. Notation 25

7. What remains unexplained 26

The full account of unit VII.4: 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: VII, identification as Yang–Mills. Lean: YM/OPE. Its folders, by role:

Also YM/Next/PHASE, YM/Contacts (Normal, Score, Layers, Harvest, Solstice, Transport), YM/MultipleContact and YM/SharpGram. The public statements are publicOPE and contactDistribution.

Size: about 10,200 lines in 2,035 declarations assigned to this unit:

Conventions.

1. What this unit proves

Proposition VII.4.1 (separated OPE; properties (O1)–(O2) of the main theorem).

Setting.

Conclusions.

\(\displaystyle | M (a, x ; b, y) - \sum_{j \leqslant D} \sum_{\kappa \in \text{Ch}_j} c_{j, \kappa} (a ; x, o) \hspace{0.17em} M \left( (j, O_{j, \kappa}), o ; \hspace{0.17em} b, y \right) |_{\mathcal{A}} \leqslant r^{\hspace{0.17em} D + 1 - w (a) - \varepsilon} ;\)

The coefficients do not depend on \(b\), \(y\), \(s\) or \(D\). The thresholds do not depend on \(x\), \(o\), \(y\) or \(s\).

Status: theorem for every Reader on the given final record under (RG). The main construction supplies the coherent prescription and (RG) in VIII.1.

Lean:

Proposition VII.4.2 (integrated remainder; item (D8)). Fix the data of (O2), a measurable space \(K\) and \(B \geqslant 0\). For all sufficiently small \(r\) the following holds.

Hypotheses. Let \(\mu\) be a positive measure on \(K\), \(w \in L^1 (\mu ; \mathbb{C})\) with \(\int |w| \hspace{0.17em} d \mu \leqslant B\), and \(k \mapsto (x (k), o (k), y (k))\) an a.e.-measurable configuration map. Assume that \(\mu\)-a.e. on \(\{w \ne 0\}\), \((x, o)\) is an \((r, M, \eta)\)-cluster and \(y\) is \(c\)-clear of \(o\).

Conclusion. Take for \(s (k)\) either the mixed state, or \(\xi (k)\) for an arbitrary a.e.-measurable phase map \(\xi : K \to X\). Then:

\(\displaystyle | \int_K w (k) \left[ S^{s (k)} (a, x ; b, y) - \sum_{j \leqslant D} \sum_{\kappa} c_{j, \kappa} (a ; x, o) \hspace{0.17em} S^{s (k)} ((j, O_{j, \kappa}), o ; b, y) \right] d \mu (k) | \leqslant B \hspace{0.17em} r^{D + 1 - w (a) - \varepsilon} .\)

In particular, for every probability measure \(\nu'\) on \(X\), the \(\nu'\)-mixture of the phases satisfies the bound of (O2) (probability_mixtures). The same pointwise threshold works for every \(K\) and \(B\).

Status: theorem.

Lean: estimates_weighted, JointEstimate, FitsOn; clause profiles of SeparatedOPE, through Core.joint.

Proposition VII.4.3 (nested OPE, i.e. composition of coefficients over trees; item (D10)).

Trees and plots.

Admissibility. \((s, z)\) is \((r, M, \eta)\)-admissible if:

Costs. Put

\(\displaystyle \text{toll}_m (s) = r^{\hspace{0.17em} m - w (v) - \varepsilon} \prod_{p \ne \text{root}} \rho_p^{- w_p - \varepsilon}, \qquad \text{nest}_D (s) = \sum_{p \ne \text{root}} \rho_p^{\hspace{0.17em} D_p + 1} .\)

Conclusions. Fix \(m\), \(\kappa \in \text{Ch}_m\), truncation degrees \(D_p\) at the inner nodes, \(M \geqslant 0\) and \(\eta, \varepsilon > 0\). For all sufficiently small \(r\) and every admissible \((s, z)\):

Status: theorem for every Reader on the final record under (RG).

Lean:

Proposition VII.4.4 (contact extensions; items (D2), (D11)–(D13)).

Setting.

Conclusions.

In (d)–(e), an admissible stage family consists of a partition \(Q\) of a group \(g\), affine placements \(o + P (E)\), positive subtraction lengths \(s\), and block scales \(R_i \in (0, 1]\). Each \(o\) lies on the block diagonals, and the range of \(P\) contains their normal spaces. A common ceiling \(B \leqslant \min (1, \text{cl} (\sum_i d_i))\) satisfies \(2 s \leqslant B\). At each placement a common linear frame acts by \(R_i\) on every block normal space and preserves each orthogonal complement. The closed stages lie in a fixed ball in frame coordinates and within normal distance \(B\) of each block diagonal; for nonsingleton blocks \(R_i \leqslant C_1 s\) with fixed \(C_1\). Original and spectator labels have uniform norm bounds. Spectator positions and labels are continuous on each stage and constant in each block's normal directions. All centroids of nonempty subgroups of different blocks, and all spectators, are uniformly separated by some \(\delta > 0\). These conditions are the geometric and field hypotheses for the summation and scaling estimates; their constants may depend on the fixed family.

Uniqueness, reflection positivity on overlapping supports, contact Ward identities for arbitrary subtractions and real-time products are not asserted.

Status: theorem (provided). In the main theorem the devices are assembled in contacts_on (VIII.1), with detectors from detector_exists. (D2) appears in the detailed theorem constructed, not in the public joint existence statement.

Lean:

Proposition VII.4.5 (slab-operator bound; the bench V.1.7).

Hypotheses. \((\mathcal{W}, f, S)\) is a seed:

Conclusion. For every \(D \in \mathbb{N}\) and \(R > 0\) there are \(C_0 > 0\) and \(P \in \mathbb{N}\) with the following property. Let \(d > 0\), \(r \in (0, 1]\), and let \(w \neq \emptyset\) be a word with these properties:

Then there are a level \(b\) and a width \(0 < s \leqslant d\) with \(s \in a_b \mathbb{N}\) and \(w\) in the slab \((0, s)\), such that every word \(v\) supported at positive times has a constant \(B_v\) with

\(\displaystyle |S (\Theta v_n \cdot v_n) | \leqslant B_v \hspace{0.17em} \rho^{4 n} \quad (n \in \mathbb{N}), \qquad \rho = C_0^{|w|} \hspace{0.17em} (|w| / r)^{P |w|} .\)

Here \(v_n\) is \(v\) preceded by \(2 n\) consecutive slabs of width \(s\) that hold alternately \(w\) and its reflection. In V.1 an iterated Schwarz inequality turns this into \(\|T_s (w)\| \leqslant \rho\). One may take \(P = 4 (D + 1)\).

Status: theorem: Next.Phase.seats proves Bid.Seats.

Lean: Bid.Bench, OS.QRead, Spread.radius; steps in Lemmas VII.4.o–p.

Proposition VII.4.6 (coherent prescription).

Setting.

Conclusion. There are, for every mode, a vector \(u_i \in F_n\) (needle) and a finitely supported family \(\lambda_i\) of complex weights on probes (sheet), with the following property. Write \(\lambda_i^{(m)} = \sum_p \lambda_i (p) \hspace{0.17em} \text{sp}_m (\cdot) (p)\) for the induced functional (test) on \(F_m\). Then for every \(n\):

Tests of degree \(> n\) vanish on \(F_n\). One prescription serves every truncation degree.

Status: theorem.

Lean: Prescription, SignedOff, Coherent, Prescription.chosen, highVan.

Remark VII.4.7 (hypotheses and order of choices).

The order of choices. In the main theorem (WilsonExistence), the family is chosen first, for \(G\) with simple Lie algebra and any penalty \(b > 0\). Then, for every extraction order, a refinement, the table, the final record, the Reader and the devices are chosen together.

The hypotheses (RG) (Services) bundle four items:

For the table of the construction these hypotheses are proved by Run.extractible17 (VIII.1, from Part III outputs; §2 input 6).

Separate existence theorems. through_final and the raw tree theorem allow any penalty \(b > 0\). Orbits.foundation, the single-cluster existence theorem, the covariant tree existence theorem and celestial choose \(b = 1\). The main theorem instead applies the OPE estimates to its already chosen family.

Further results. The same construction also gives:

What is not claimed. The coefficients depend on the prescription and the Reader. Independence of the extraction subsequence is not claimed (Assessment §7.5).

2. What it uses

Inputs from other units

  1. The final record and its seed (IV.1, V.1–V.3, VI.1; assembled in VIII.1). This comprises:

    Lean: Seed, Locals, Final.

  2. Reflection positivity and centred bounds (IV.1, interface item 2; I.1). Two parts:

    Lean: CellHyp.

  3. The ground algebra and phases (V.1). This comprises:

  4. The derivative identity (VI.1, IV.1): the derivative in one point of a correlation is the correlation with the derivative label, of degree one higher. It is used in Lemma VII.4.i.

  5. Haar measure on \(O (4)\) and the rotation laws (VI.1). They are used for the covariant Reader.

  6. The RG hypotheses (RG). The estimates come from Part III and are collected in VIII.1:

Standard mathematics

Imported constants and assumptions

3. Strategy

A coherent system of probes reads every output degree from the mixed correlation table. For mode \(i\), the raw coefficient is \(\lambda_i (a ; x, o) = \sum_p \lambda_i (p) S (a, x - o ; \text{probe } p)\), with each reading set to zero when the combined configuration is not separated (Prescription.ope). Biorthogonality makes these readings exact on single fields (sumAll). Averaging over \(O (4)\), symmetrizing the input and output conjugations, and removing lower-degree components gives the Reader's real covariant strata. These choices are fixed before the spectator labels, state and truncation degree.

The RG estimate replaces a lattice cluster by one label \(Q\) of prescribed degree \(t\). Its remainder gains \((a_m / a_k)^{t + 1 / 16}\), while the label and remainder both pay the factor \(a_j^{- w} (a_m / a_j)^{4 |I|}\). Along the scale induction, nearby groups fuse and separated groups pass through the next block-spin step. After extraction, exact reconstruction of \(Q\) by the probes yields the grid OPE. Reflection positivity bounds decks of widely translated copies by products of chessboard roots, treating a cluster remainder as one factor. The deck limit gives all vacuum moments of \(u^{\ast} u\) in the ground algebra; full support of the phase measure and the Gelfand isometry then give \(\|u\|_{\mathcal{A}}\). Each spectator costs only its own one-field bound. The resulting norm estimate controls every phase and the mixed state with the same coefficients.

Exponential rates organize the choices of lattice scales. A downward induction in total degree extends the grid bounds to arbitrary configurations: each derivative raises the degree by one, while the distance to the fine grid recovers one power. At sufficiently high degree the crude bound already suffices to start the induction. Bringing the auxiliary scale heights together gives an arbitrary \(\varepsilon\)-loss; refinement arguments turn these rates into uniform small-radius estimates. Tree expansions repeat this replacement recursively, leaving leaf labels unchanged. Contacts use a forest recursion: each retained weight receives a normal Taylor subtraction of its own order, and the remainder gains enough radial power for integration. Partial collisions are handled by the same recursion on finer partitions. Separately, the slab-operator bound follows by applying the two-scale chessboard estimate to a reflection-positive train and using iterated Schwarz to remove the fixed exterior cost.

4. Steps

4.1 Rates and sequences

Lemma VII.4.a (from sequences and rates to uniform small-\(r\) bounds).

Proof sketch. For (i), choose a bad configuration at each bad radius and refine to a non-trivial filter supported on those radii. The assumed further refinement is a contradiction. Parts (ii)–(iii) follow from \(r = e^{- T}\). For (iv), choose the first level whose logarithmic spacing exceeds \(cT\) when \(c > 0\), and \(\sqrt{T}\) when \(c = 0\); gentleness makes the relative overshoot tend to zero.

Lean: refine_geometry, RateLE, loglife, room_regime, free_clear, Height, found.

4.2 Prescription and Reader

Lemma VII.4.b (extension one level at a time). A prescription that is biorthogonal and reconstructing on \(F_n\) extends to one with the same property on \(F_{n + 1}\), without changing the needles and sheets of degree \(\leqslant n\).

Proof sketch.

Lean: startRows, nextRows, Prescription.chosen.

Lemma VII.4.c (the Reader). Fix a coherent prescription.

Construction.

\(\displaystyle A_n (a ; x, o) = \int_{O (4)} \rho_n (g) \hspace{0.17em} \sigma_n (\rho (g^{- 1}) a ; g^{- 1} x, g^{- 1} o) \hspace{0.17em} dg,\)

where \(\rho (g^{- 1})\) acts on every input label. Set \(A_n = 0\) outside the domain where all rotated probes through degree \(n\) stay clear. The conjugation-symmetric reading is

\(\displaystyle \bar{\sigma}_n (a ; x, o) = \tfrac{1}{2} (A_n (a ; x, o) + \overline{A_n (\bar{a} ; x, o)}) .\)

Properties.

Proof sketch.

Lean: checkValue, Reader, averageV, checkReal, knife, cutTest, reconstruct, kills_lower, stratum, fresh, Reader.basis, coef.

4.3 Norms in the ground algebra

Lemma VII.4.d (norm from decks). Let \(u \in \mathcal{A}\) come from a finite combination of separated grid words. It has lattice versions \(U_{N, p}\) at the cutoffs.

Hypothesis. Let \(c \geqslant 0\). The lattice labels converge to those defining \(u\) along a non-trivial refinement of the extraction. For every \(n\) and all sufficiently large translation spacings \(t\), eventually along that refinement the lattice moment of the deck \(\prod_{l < 2 n} U^{(\ast)}_{N, p} \circ \tau_{2 tl}\) (time translates, even ones conjugated) has modulus \(\leqslant c^{2 n}\).

Conclusion. \(\|u\|_{\mathcal{A}} \leqslant c\).

Proof sketch.

Lean: Cards.carrying, Cards.pressure. (proof read; the geometric inputs to B17.answer are taken from V.1)

Lemma VII.4.e (a priori and replacement bounds in \(\mathcal{A}\)). Assume (RG).

Setting. Main points are at mutual distance \(> 2 a_b\). Exterior points are at mutual distance \(> 2 a_l\), and at distance \(> 2 a_b\) from the main points. The levels satisfy \(b \leqslant f \leqslant l \leqslant n\) and \(f \leqslant q\), with

\(\displaystyle |I| \cdot 10 a_f < a_b, \qquad |J| \cdot 6 a_n < a_l .\)

Main tokens have centred bounds \(B_i\) at level \(q\), and exterior tokens have bounds \(D_j\) at level \(n\).

Conclusions.

\(\displaystyle | M (v, x ; \text{ext}) - M ((t, Q), 0 ; \text{ext}) |_{\mathcal{A}} \leqslant \alpha \prod_j D_j .\)

Proof sketch.

Lean: Cards.plant, Cards.mixed, Cards.Hall, civic, viewing_admits, mirrorMatch, admitted, phase_budget, viewer_cost. (proof read; TileDoc.global statement only)

4.4 The lattice cluster estimate

Lemma VII.4.f (lattice cluster replacement). Fix the RG representation, product-cut and transport data of §2 for output degree \(t\). Let \(I\) be finite and nonempty. Levels \(J \leqslant k \leqslant m < m + 1 \leqslant j < N\) are ordered from coarse to fine. Require \(\text{ref} (t) \leqslant k\) and \(\text{ref} (d_i) \leqslant j\) for every input degree \(d_i\).

Hypotheses.

\(\displaystyle (B_{m + 1}^2 + 1) a_{m + 1} \leqslant a_J, \qquad \mathfrak{c}_k^2 a_k \leqslant a_J, \qquad 2 (a_m \ell_t + \tau_m) < a_J .\)

Here \(\mathfrak{c}_k\) is the supplied cover count, \(\ell_t\) is the output stencil radius plus \(4\), and \(\tau_m = 30 a_m (\jmath_m + 5)\) is the cone-tail bound with supplied aperture parameter \(\jmath_m\). All \(f_i\) and all \(I_{N, p} (z, 0)\) are interior to the centre chamber.

\(\displaystyle 0 < A \leqslant \alpha^H \left( \frac{a_j}{a_{m + 1}} \right)^{4 H} \left( \frac{\alpha}{8} \right)^{H^2} \left( \frac{\delta_j \varphi_j}{8} \right)^H \prod_i \alpha_i .\)
\(\displaystyle \mathfrak{m}_{k, m} (b) \leqslant \frac{\delta_m A}{16 x_m}, \qquad 8 (1 + c_m) a_{m + 1}^t \frac{4 x_m}{A} \leqslant e,\)
\(\displaystyle 32 (1 + c_m) b \hspace{0.17em} \|A_{k, t} \| \frac{e}{(a_k / a_m)^{1 / 8}} \leqslant \frac{\zeta (t, k)}{2} .\)

Conclusion. There is a lattice label \(z\) of degree \(t\) with these properties:

Here \(\text{stakes} (J, k) = \exp ((a_J / a_k)^4 \text{treasury}_k + 5)\) is the supplied per-cell chessboard factor. In Lemma VII.4.g the two coarse levels are chosen so that this factor has upper rate \(0\).

Proof sketch.

Lean: joins, inductionLive, Ballet, ranch, hitB. (statement read; proof read in outline, at the level of the calls in Ballet, inductionLive, Live.gathers, bequeathed)

Lemma VII.4.g (replacement rates and the limit label). Assume (RG), fix a nonempty finite token list of total degree \(w\), and take heights \(0 \leqslant b < a < c\) for the coarse, output and insertion levels. Fix a target degree \(t\), and put \(Z' = w \hspace{0.17em} c + 4 |I| (c - a)\).

Conclusion. There are rate functions \(g\) and \(o\) with these properties:

Up to subpower factors, the coefficient size is bounded by \(a_j^{- w} (a_m / a_j)^{4 |I|} a_m^t\), and the remainder root by \(a_j^{- w} (a_m / a_j)^{4 |I|} (a_m / a_k)^{t + 1 / 16}\). For each fixed configuration satisfying the cluster and interior conditions, bounded coefficient size gives a convergent refinement of the extraction in the finite-dimensional label space. Its limit \(Q\) retains the remainder bound.

Proof sketch.

Lean: funding, PriceAt, price_plot, Survival, for_plot.

4.5 The OPE at grid configurations

Lemma VII.4.h (grid estimates).

Setting. Assume (RG) and fix a coherent prescription and a nonempty finite token list \(a\). Heights satisfy \(0 < \beta < a_0 < x < d\), for levels \(k, m, j\) at heights \(\beta, a_0, d\). The cluster consists of level-\(j\) grid points with distinct coordinates on every axis, extent of upper rate \(- x\) about the origin and reciprocal separation of upper rate \(x\). Spectator distances from the origin have reciprocal upper rate \(0 \leqslant c < \beta\), and their mutual distances have reciprocal upper rate \(u \geqslant c\). Put \(\text{tax} = w (a) d + 4 |I| (d - a_0)\).

Conclusions.

Proof sketch. For the remainder choose \(q \geqslant N\) with \((N + 1) a_0 \leqslant (q + \tfrac{1}{16}) (a_0 - \beta)\); for a coefficient choose \(q \geqslant \deg i\) with the analogous inequality. Let \(Q\) be the degree-\(q\) label of Lemma VII.4.g. Then:

Lean: grid_coeff, grid_remainder, see_cost, det_cost, at_grade, sumAll.

4.6 Arbitrary configurations and exponents

Lemma VII.4.i (derivative bootstrap). Fix a finite index set \(I\) and levels \(j\) of height \(d > x_0\). A configuration path \(x (T)\) lies in the height-\(x_0\) corridor if its extent about the origin has upper rate \(- x_0\) and its reciprocal separation has upper rate \(x_0\). Let \(h_T (v ; x)\) be functions for every token list \(v\) on \(I\). Suppose the following hold for every such list and every configuration path in this corridor, with constants \(c_0, d_0\) independent of the list:

Then \(h\) has rate \(d \hspace{0.17em} w (v) + d_0\) on the whole corridor.

Proof sketch.

Lean: interpolated, cloud_jump, leap_cost. (proof read for interpolated)

Lemma VII.4.j (raw coefficient and remainder rates).

Setting. Assume (RG) and fix a coherent prescription and finite token lists \(a, b\). Along \(T \to \infty\), the cluster has extent of upper rate \(- x\) around \(o\) and reciprocal separation of upper rate \(x > 0\). Spectator distances from \(o\) have reciprocal upper rate \(0 \leqslant y < x\), and their mutual distances have reciprocal upper rate \(u \geqslant y\).

Conclusions.

Proof sketch.

Lean: coefficient_rough, common_rate, early_rate, group_coeff, group_remainder, ground_cost, groundError, arrangement_cost.

4.7 The Reader and the separated OPE

Lemma VII.4.k (transfer to the Reader). In the regime of Lemma VII.4.j:

Proof sketch.

Lean: fresh_bridge, fresh_price, balance_rate, coefficient_rate, algebra_rate. (proof read; fit_old, discrepancy_rate_old statement only)

Lemma VII.4.l (proof of VII.4.1). For (O1) and (O2), apply Lemma VII.4.a with \(T = - \log r\).

Lean: coefficient_separated, quantitative_separated, produce; assembly in R2IGoals.fromFunded.

4.8 Integrated and nested forms

Lemma VII.4.m (integrated forms; VII.4.2).

Proof sketch.

Lean: estimates_weighted, probability_mixtures.

Lemma VII.4.n (nested OPE; VII.4.3).

Proof sketch.

Lean: Fusion.tariff, Quantified.lean (Limits.coe_power, Limits.tested_power), Tree.Tapered, Tree.Relative. (proof read for coe_power, tested_power, tariff; supplies proof read; sequential and high statement only)

4.9 The slab bound of V.1

Lemma VII.4.o (point and train bounds). Take levels \(m \leqslant k \leqslant l \leqslant b\).

\(\displaystyle |S (\Theta v_q \cdot v_q) | \leqslant B^{2 |v|} A^{4 q |w|} .\)

Proof sketch.

Lean: cutoff_bound, point_bound, Gapped, travel_price.

Lemma VII.4.p (uniform constants; proof of VII.4.5).

Proof sketch.

Lean: rates, replicas, seats. In V.1: Drive.against, producer.

4.10 Contact extensions

Lemma VII.4.q (Taylor deviation on shells). Let \(E\) be a finite-dimensional Euclidean space, \(K \subset E\) a subspace, \(m, n \in \mathbb{N}\), \(B \geqslant 1\), and \(U\) a compact subset of \(\{ \tfrac{1}{2} \leqslant |x_K | \leqslant 2\}\). Write \(D_a x = ax_K + x_{K^{\perp}}\). There is \(X \geqslant 1\), depending only on \(E, K, U, m, n, B\), with the following property. Let \(a, r, s > 0\) and let \(A : E \to E\) be a linear isomorphism satisfying \((Ax)_K = rx_K\) for every \(x\) and \(Ax = rx\) for \(x \in K\). Let \(f\) be smooth and assume \(ra / s \leqslant B\), \(r \leqslant Bs\), and

\(\displaystyle \text{supp} (f \circ A) \subset \{x : |x_K | \leqslant B / 2\}, \qquad \|f \circ A\|_{C^{n + m + 1}} \leqslant H.\)

Then the cut-off normal Taylor operator satisfies

\(\displaystyle | (f - T^K_{m, s} f) \circ A \circ D_a |_{C^n (U)} \leqslant XH \left\{ \begin{array}{ll} a^{m + 1}, & a \leqslant 1,\\ a^m, & a > 1. \end{array} \right.\)

Proof sketch. Taylor's formula with remainder, together with jet bounds for the smooth cut-off.

Lean: compact_deviation.

Lemma VII.4.r (the subtraction formula).

Notation.

Definition. Set \(C_{\{i\}} = \varphi_i \otimes 1\) and, for \(|h| \geqslant 2\),

\(\displaystyle C_h = - \sum_{w < L_h} R^h_w (\Pi_h) \cdot T^h_{L_h - 1 - w}, \qquad \Pi_h = \sum_{\pi} \prod_{\beta \in \pi} C_{\beta}, \qquad \text{full}_h = \Pi_h + C_h,\)

where \(\pi\) runs over partitions of \(h\) into at least two blocks. For a singleton the full expression is \(\varphi_i \otimes 1\); for the empty group it is the unit. The kernel of \(\mathcal{D}^s_a\) at \(x\) is the \(s\)-expectation of \(\text{full}_{\{1.. k\}}\) applied to \(f\). Expanding the recursion gives a Zimmermann-type forest sum. The child expressions are constructed recursively first. On the test function, the parent Taylor operator acts first, followed by the operators already present in the child expression; nested operators need not commute.

Per-group form. \(\left[ \Pi_h - \sum_{w < L_h} R^h_w \Pi_h \right] f + \sum_{w < L_h} R^h_w (\Pi_h) \hspace{0.17em} (1 - T^h_{L_h - 1 - w}) f\).

Lean: takeRight, Score/Formula.lean, Normal.taylor, majorKernel, Devices, Devices.clearance. (definitions read)

Lemma VII.4.s (absolute bound; summation and scaling). Fix the devices, labels, state and subtraction length as in VII.4.4. For every compact \(U \subset (\mathbb{R}^4)^k\) there is \(C > 0\) such that

\(\displaystyle \int | \langle \text{full} \rangle_s (f ; x) | \hspace{0.17em} dx \leqslant C \hspace{0.17em} \|f\|_{C^{(2 + w (a)) k}} \quad \text{whenever } \text{supp} f \subset U.\)

The summation formulas and scaling bounds hold under the stage-family hypotheses of VII.4.4(d)–(e).

Proof sketch.

Lean: glues_total, global_charge, commissions, Claim, Annulus. (proof read in outline)

Lemma VII.4.t (distribution and restriction).

Lean: Charge, Transport.harmonic, contactDistribution.

Lemma VII.4.u (real bases and thresholds).

\(\displaystyle g_n = \min (f_n, 2^{- n}, \text{cl} (n) / (2 (n + 1))), \qquad t_0 = g_0, \qquad t_{n + 1} = \min (t_n / 8, g_{n + 1}) .\)

The thresholds define smooth scalar cutoffs. At a length \(0 < \ell \leqslant t_n\), the cutoff-weighted projection agrees with the original projection through degree \(n\). These cutoffs do not enter \(\mathcal{D}^s_a\).

Lean: real_basis, installs.

5. Where the difficulty lies

Routine but long.

Main estimates.

  1. The OPE comes from the RG. The basic estimate (Lemmas VII.4.f–g) is a lattice statement: a cluster of renormalized observables equals one observable of degree \(t\) plus a remainder that gains \((a_m / a_k)^{t + 1 / 16}\), at a cost \((a_m / a_j)^{4 |I|}\). The margin \(\tfrac{1}{16}\) is set by the transport gain \((a_k / a_m)^{1 / 8}\) of Part III's RG, not by the contraction \((a_m / a_k)^{t + 1}\) of the irrelevant part. This is where Part III enters.

  2. Uniformity in states and spectators comes from the C*-norm. The norm of \(\mathcal{A}\) is computed by chessboard bounds on decks of translated copies, together with Gelfand and the full support of \(\nu\) (Lemmas VII.4.d–e). The spectators then cost only their own one-field bounds, at their own scale, and the bound holds in every phase at once.

  3. The derivative bootstrap (Lemma VII.4.i). Each derivative costs one power of the fine spacing, so a first-order comparison with the grid gains nothing. The induction therefore starts from high degree, where the crude bound is already strong enough.

  4. One coefficient system for every truncation degree. It comes from a coherent prescription (VII.4.6) and the strata of the Reader.

Unusual, weaker or stronger than expected.

6. Notation

object code name proposed notation
upper and exact exponential rates RateLE, RateIs \(f \preceq e^{\kappa T}\); \(\log f / T \to \kappa\) with \(f > 0\) eventually
height of a level sequence Height \(m \to \infty\), \(\log (1 / a_m) / T \to c\)
cluster, clearance WithinRoom, ClearOf \((r, M, \eta)\)-cluster; \(c\)-clear
total degree weight, sigma \(w (a)\)
needles, sheets, tests Prescription \(u_i\), \(\lambda_i\), \(\lambda_i^{(n)}\)
raw coefficient Prescription.ope \(\lambda_i (a ; x, o)\)
Reader Orbits.Reader \(\mathcal{R}\)
lower-degree removal, cut test, stratum knife, cutTest, stratum \(\pi_n\), \(\tau_{n, q}\), \(E_n\)
channels, actors, coefficients channels, actor, coef \(\text{Ch}_j\), \(O_{j, \kappa}\), \(c_{j, \kappa} (a ; x, o)\)
ground algebra, states unselected.algebra, glance, Viewers \(\mathcal{A}\); \(s \in X \sqcup \{ \text{mix} \}\)
error element algebraError, groundError \(\mathcal{E}_D (a, x ; b, y)\)
chessboard root with interior condition Cards.PaidAt \(|F|_{\mathcal{T}_k} \leqslant A\)
deck of translates deck, Episode \(\prod_{l < 2 n} U^{(\ast)} \circ \tau_{2 tl}\)
limit label of a cluster Survival \(Q\)
coefficient size of a label quota \(|z|_m\)
RG insertion, step and column bounds paid, ζ, δ, φ, x, columns, alto, march, gainChart \(\text{paid}_j\), \(\zeta\), \(\delta\), \(\varphi\), \(x\), \(c_m\), \(A_{k, t}\), \(\mathfrak{m}_{k, m}\), \((a_k / a_m)^{1 / 8}\)
cell and stencil fitting data coverSize, lensScope, GridApprox.tail, clock.J \(\mathfrak{c}_k\), \(\ell_t\), \(\tau_m\), \(\jmath_m\)
RG package Services (RG)
tree plot, admissibility Accept, Plot \((s, z)\) admissible
tree costs Tree.toll, nestPrice \(\text{toll}_m\), \(\text{nest}_D\)
one-field bound, separation Next.Phase.Single, Gapped \(|I (v, \cdot) |_{\mathcal{T}_k} \leqslant A\)
train, quantum read ride, QRead \(v_n\); bench bound \(\rho\)
contact devices, clearance Contacts.Devices, clearance \(\mathcal{M}\), \(\text{cl} (n)\)
cumulant, punctured, full cumulant, punctured, full \(C_h\), \(\Pi_h\), \(\text{full}_h\)
normal Taylor operator Normal.taylor \(T^h_m\)
distribution of finite order Charge, totalTestOrder \(\mathcal{D}^s_a\), order \((2 + w) k\)
contact thresholds Thresholds \(t_n\)

7. What remains unexplained

  1. RG inputs below the cluster replacement. Lemmas VII.4.f–g identify the scalar inequalities and the scale induction. The polymer norm estimates inside the one-step representation, fusion and final remainder transport have not been checked line by line. The dependence of their constants, and the complete Part III proofs of these inputs, remain to be reconciled with the stated RG package.

  2. Proofs used through their statements. The full geometry behind the vacuum deck limit and the two-scale continuum transfer belongs to V.1. The rotated comparison estimates used in Lemma VII.4.k, and the triangular replacement and high-horizon lemmas used in VII.4.n, have not been checked internally. Their uses and exponent arithmetic agree with their stated conclusions.

  3. Contact sector induction. The global patching argument, subtraction recursion, shell Taylor bound and scaling normalization have been checked. The finer angular decompositions and the full induction through partially coincident strata remain checked only at the level of their theorem calls. Lemma VII.4.r's radial estimate alone does not settle these partial collisions.

  4. Contact projection versus Reader coefficients. The devices share the Reader's prescription but use separate detectors and a separate graded splitting. An identity between their weight-\(w\) rows and \(\sum_{\kappa} c_{w, \kappa} O_{w, \kappa}\) has not been located. No such identity is used in the contact statement above.

  5. Limits of the conclusions. The results do not assert uniqueness of coefficients or contact extensions, independence of the extraction subsequence, convergence as \(D \to \infty\), reflection positivity or Ward identities for the extensions, or agreement with perturbative coefficients.

← VII.3 Free Wick polynomials and reflected Gram positivity (notes)Part VII·Unit outlineVII.5 Asymptotic freedom of the running coupling (notes) →