Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.8 Connected activities and backward dependence cones (notes)Part III·Unit outlineIII.10 One full nonlinear renormalization step: bounds on irrelevant terms (notes) →

III.9. The marginal flow: the running coupling and its reset — detailed notes

Contents

1. What this unit proves 3

2. What it uses 10

3. Strategy 13

4. Steps 13

4.1 Reference scales 13

4.2 The Wilson start-up 13

4.3 The scalar response 15

4.4 The reset step 16

4.5 Continuity of the transport 18

4.6 Entry thresholds 18

4.7 Assembly and the running law 20

4.8 Auxiliary results 21

5. Where the difficulty lies 22

6. Notation 23

7. What remains unexplained 24

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

Unit page · All units · Overview

Part: III, Ultraviolet construction (renormalization group). Lean: chapter 21: YM/UVNext/COUPLING_RESET/, YM/AnalyticBridge/VERIFIED_RESET_STEP/, YM/Extra/WILSON_STARTUP/, YM/Push/BETA_TRANSPORT/, YM/Further/STRONG_STARTUP_CREDIT/, YM/Push/PRICE_COMPILER/, YM/Extra/MULTISOURCE_BOUNDS/. It also includes five small packages: PhysicalNext/UNMASKED_THROUGH_LAUNCH, Planned/RECIPE_STARTUP_PORT, R2I/Wind, Further/THRESHOLD_SOURCE_RESTART and PhysicalNext/SERVICE. The interfaces this unit fills are in YM/RG/History.lean and YM/PCalc/Band.lean, both in unit III.1. Size: 7,215 lines in the main-theorem closure:

package lines
verified reset step 2,659
Wilson start-up 2,422
transport of the coupling 652
coupling reset 592
multi-source bounds 344
each remaining package at most 213

Conventions.

Effective actions. An effective action at level \(m\) is a representation \(\rho = (P, c, E, K, b, \beta, v)\). It evaluates to

\(\displaystyle \rho (U) = \exp \left( v| \Lambda_m | - \beta \hspace{0.17em} \mathcal{K}_P (U) -\mathcal{L}_P (U) -\mathcal{E}(U) \right) \hspace{0.17em} \mathcal{G} (U) .\)

The block-spin step. \(T^{(m)}_{\beta'}\) denotes one step from level \(m + 1\) to level \(m\) at inverse coupling \(\beta'\):

\(\displaystyle (T^{(m)}_{\beta'} \rho') (V) = \int k_{\beta'} (V, U) \hspace{0.17em} \rho' (U) \hspace{0.17em} dU.\)

The kernel \(k_{\beta'}\) is a probability kernel (unit III.1). Densities are taken relative to product Haar probability measure and are not normalized.

1. What this unit proves

This unit tracks the scalar coefficient \(\beta\) of the normalized curvature-squared term through the blocking history. Its three results are:

Combined with the shooting argument of III.2 and the constructions of III.10 and III.13, this yields the selected history of III.9.3 and the law \(\beta_{N, p} / \log (1 / a_N) \to \kappa\) of the main theorem.

Proposition III.9.1 (the slope constant). Let \(\mathfrak{g}\) be simple and nonabelian, and let \((b_i)\) be an orthonormal basis of \((\mathfrak{g}, \langle \cdot, \cdot \rangle)\). Put

\(\displaystyle C_G = - \frac{1}{\dim \mathfrak{g}} \sum_i \text{tr}_{\mathfrak{g}} ((\text{ad} b_i)^2), \qquad \kappa = \frac{11 \hspace{0.17em} C_G}{24 \pi^2} .\)

Then \(\kappa > 0\).

Here \(C_G\) is the adjoint Casimir in the chosen inner product, and \(\kappa = 2 b_0\) in the conventional one-loop notation \(b_0 = 11 C_G / (48 \pi^2)\). For \(SU (N)\) in the defining representation, this normalization gives \(C_G = 2 N^2\) and \(\kappa = 11 N^2 / (12 \pi^2)\).

The invariant form \(- \text{tr} (\text{ad} X \hspace{0.17em} \text{ad} Y)\) is \(C_G \langle X, Y \rangle\). Its value at \((X, X)\) is \(\sum_i | [X, b_i] |^2\), and nonabelianness makes this positive for some \(X\). Thus \(C_G > 0\).

Status: definition; positivity is a theorem and uses simplicity. Inside this unit only two things are used: \(\kappa > 0\), and the identity \(\hat{\beta}_{m + 1} = \hat{\beta}_m + \kappa \log L_m\). The fact that the one-loop coefficient of the actual blocked action is \(- \kappa \log L + O (1)\) is proved in III.7, where \(11 / (24 \pi^2)\) is the value of an explicit momentum integral (§2).

Lean: YM.Gauge.slopeConstant, YM.Gauge.casimir, YM.Gauge.slopeConstant_pos, YM.Gauge.trace_color.

Proposition III.9.2 (reference coupling and scale functions). Fix \(\kappa > 0\), \(\bar{\beta} > 1\) and an infinite sequence of odd block factors \(L_m \geqslant 3\). Define

\(\displaystyle \hat{\beta}_m = \bar{\beta} + \kappa s_m, \quad M_m = e^{(\log \log \hat{\beta}_m)^2}, \quad t_m = \hat{\beta}_m^{- 1 / 2} M_m, \quad \varepsilon_m = \hat{\beta}_m^{- 11 / 10}, \quad \tilde{\varepsilon}_m = e^{- M_m^{1 / 5}},\)

and set \(B_m = \lceil (\log \hat{\beta}_m)^2 \rceil\) and \(\mathfrak{B}_m = [\hat{\beta}_m / 2, \hspace{0.17em} 2 \hat{\beta}_m]\). These are, in order: the reference coupling, the threshold multiplier, the small-field threshold, the regular and forced allowances, the cover size and the band.

Then \(\hat{\beta}_{m + 1} = \hat{\beta}_m + \kappa \log L_m\), \(\hat{\beta}\) is nondecreasing, and \(s_m \geqslant m \log 3\), so \(\hat{\beta}_m \to \infty\).

The scale conditions are hypotheses on the scale sequence, not consequences of the definitions. They are:

Status: definitions (III.1) and elementary theorems. The scale conditions are part of the scale sequence produced in III.2.

Lean: Calendar.hatBeta, threshold, allowance, forcedAllowance, coverSize, Calendar.Fits, Shoot.band, Deployment.hat, Timing.hat_mono, Schedule.divergent.

Proposition III.9.3 (selected histories). A history assigns to all \(N, p\) and \(m \leqslant N\) a level-\(m\) representation \(\rho_{N, p, m}\) with coupling \(\beta_{N, p, m}\). It is selected if the following hold.

  1. Common path data. The path data \(P_{N, m}\) of \(\rho_{N, p, m}\) do not depend on \(p\).

  2. Shape. \(\rho_{N, p, m}\) carries the level-\(m\) norm parameters and clip. It is lawful at level \(m\):

    The whole activity family transforms under translations and signed permutations of the axes.

    Moreover \(\beta_{N, p, m} \in \mathfrak{B}_m\).

  3. Start. \(v_{N, p, N} = 0\) and \(\rho_{N, p, N} (U) = e^{- \beta_{N, p, N} S_W (U)}\) for all \(U\).

  4. Transfer. For \(m < N\), \(\rho_{N, p, m} = T^{(m)}_{\beta_{N, p, m + 1}} \rho_{N, p, m + 1}\) at every configuration, and

    \(\displaystyle | \beta_{N, p, m + 1} - \beta_{N, p, m} - \kappa \log L_m | \leqslant \omega_{J_{m + 1}} .\)
  5. End point. \(\beta_{N, p, 0} = \bar{\beta}\).

  6. Running. For every \(\varepsilon > 0\) there is \(m_0\) with \(| \beta_{N, p, m} - \hat{\beta}_m | \leqslant \varepsilon s_m\) for all \(m \geqslant m_0\), \(N \geqslant m\) and all \(p\).

Consequences:

Status: (1)–(6) are a specification (III.1). It is proved for the history of the main theorem in III.13 (Spire.Uses.exists_bolt), using the reset steps of III.9.5, the step program from III.10, and the finite-cutoff construction of Lemma 4.22. The interval shooting of Lemma 4.20 also gives a selected history from the step program. In both constructions, Lemma 4.21 derives (6) from (4) and (5).

The partition identity follows by induction from probability-kernel normalization and integrability of lawful representations. The calibration condition of VIII.1 requires one datum (scales, kinetic data and recipe) and one family of trails realizing this history, with every step a reset step for all \(N, p\) and \(m < N\).

Lean: History.Selected, Conv, Transfer, Running, History.partition_eq, Spec.Calibrated.

Proposition III.9.4 (one reset step along a curve). Fix a datum \(\mathfrak{D}\) consisting of three things:

Fix \(N, p\) and \(m < N\), let \(I = [l, u]\) with \(l \leqslant u\), and let \(x \mapsto \rho'_x\) (\(x \in I\)) be a continuous curve of admissible level-\((m + 1)\) representations.

Write \(\beta'_x = \beta (\rho'_x)\) and \(H_x = T^{(m)}_{\beta'_x} \rho'_x\). Let \((c_m, r_m)\) be the reset constants of the stage pair \((J_{m + 1}, J_m)\), with \(c_m > 0\) and \(0 < r_m \leqslant 1\). Let \(g = g_{J_{m + 1}} > 0\) be the prescribed fine-stage forced-decay constant. Assume:

Conclusion. There is a continuous \(d : I \to [- r_m, r_m]\) with the following properties. Let \(\rho_x\) have path data \(P_{N, m}\), activities \(F (x, d (x))\), coupling \(\beta'_x + \alpha_{N, m} + d (x)\) and \(v_x = | \Lambda_m |^{- 1} \log H_x (1)\). Then:

Exact density transfer, recipe continuation, admissibility, the stronger forced bound and the error bound \(| \beta - \beta' - \alpha_{N, m} | \leqslant 1\) define a reset step. Without (R), the same \(d\) is the unique zero in \([- r_m, r_m]\) of the scalar residual. In that case \(\rho_x (1) = H_x (1)\) and \(\rho_x (V) = H_x (V)\).

Status: theorem.

Lean: CouplingReset.advance, correct, Income, Remainder, PricedReset, Usable, Directed.Move.

Proposition III.9.5 (explicit reset and step program).

(a) Explicit correction. Fix the datum, input curve and reset constants of III.9.4, and assume \(G\) is simple and the input couplings lie in \(\mathfrak{B}_{m + 1}\). Suppose that, for every \(x \in I\), the blocked density has the early presentation

\(\displaystyle H_x (U) = \exp \left( \tau_x | \Lambda_m | - \beta'_x \mathcal{K}(U) -\mathcal{L}(U) - \sum_i \chi_{X_i} (U) E_{x, i} (U) \right) \hspace{0.17em} \mathcal{G}_x (U) \hspace{0.17em} e^{- \alpha_{N, m} \mathcal{S} (U)},\)

where \(\chi_X\) indicates that \(X\) is small-field and \(\mathcal{S}\) is the masked quadratic receipt of the coarse path data. Assume:

Then the reset correction is the isotropic Hessian coefficient \(\delta_x\) of the early regular functions (Lemma 4.12):

\(\displaystyle d (x) = \delta_x, \qquad \beta (\rho_x) = \beta'_x + \alpha_{N, m} + \delta_x, \qquad t_m^2 | \delta_x | \leqslant H_x^E \leqslant c_m \varepsilon_m / 4, \qquad v_x = \tau_x - | \Lambda_m |^{- 1} \sum_i E_{x, i} (1) .\)

The output is continuous and has all the properties of III.9.4. The Gaussian-sector formulation additionally requires its integration licenses and the identity between that integral and the push; a direct early presentation of the push supplies the equality used in the reset.

(b) Program. Assume \(G\) is simple. Suppose the numerical conditions above hold at every level, the early presentation and its local bounds and continuity are available along every continuous admissible input curve with couplings in \(\mathfrak{B}_{m + 1}\), and the recipe accepts these outputs. Suppose also that the start-up curves below exist and pass the recipe's initial and retention tests. Then:

The output coupling may lie outside \(\mathfrak{B}_m\); shooting restricts the parameter interval to restore the band (Lemma 4.20).

Status: conditional theorems. III.10 supplies the physical inputs, including the Gaussian-sector identity and the early presentation. Its Roost.Factor.worksNow concludes the step program from these results.

Lean: Return.reset, Return.result, Collection.earlyValue, Use.supplier, CouplingReset.program, Supplier.ports, Directed.Program, Return.Prices, Collection.Fees, Collection.Compared.

Proposition III.9.6 (Wilson start-up). Let \(c\) be a clip and \(b\) a set of norm parameters with \(0 < t \leqslant 1\). They are compatible if \(c_{\text{dir}} \leqslant 1\), \(B \geqslant 2\), and \(t \hspace{0.17em} e^{(B - 2) / c_{\text{rel}}} \geqslant 2\).

  1. Exact start. For every \(\beta \in \mathbb{R}\) and every configuration \(U\), \(\rho^{\text{start}}_{\beta} (U) = e^{- \beta S_W (U)}\). Here \(\rho^{\text{start}}_{\beta}\) has:

  2. Residual bound. For every gauge group \(G\) and all orders \(k\) and spatial powers \(q\) there are \(C > 0\) and \(\delta \in (0, 1]\) with the following property. For every set of norm parameters with order \(k\), power \(q\) and threshold \(t \leqslant \delta\), every torus, every plaquette \(p\) and every site \(o\) of \(p\), the residual \(R_p\) has weighted sup-jet norm at most \(Ct^5\) at \(o\).

  3. Eventual bounds and continuity. For each fixed stage with \(c_{\text{dir}} \leqslant 1\), there is \(\beta^{\ast}\) such that, for every realized choice of levels and every \(N\) at that stage with \(\hat{\beta}_N \geqslant \beta^{\ast}\), the start-up conditions hold: compatibility, small threshold, and the regular and forced norm bounds \(\varepsilon_N, \tilde{\varepsilon}_N\). The start-up curve is continuous on \(\mathfrak{B}_N\). It is admissible for a given recipe if its prescribed top paths are \(P^{\text{top}}\), these paths satisfy the stage bounds, and its initial and retention tests accept the displayed curve.

  4. Installation. Suppose the old kinetic data satisfy the planned conditions, the Wilson top paths satisfy the stage bounds, and a revised horizon is supplied whose top quadratic datum is the Wilson one, whose lower data agree with the old horizon, and whose initial stationary guesses agree. Then the kinetic data can be replaced by data for that horizon with \(P_{N, N} = P^{\text{top}}\), the same \(\alpha\), and every planned condition preserved.

Status: theorem.

Lean: WilsonStartup.Start.evaluates, residual_price, Start.Allows, Timing.enough, Planned.Port.card, Change.engine, WilsonStartup.Decent, Design.Suitable, Change.Overlay.

Proposition III.9.7 (entry thresholds). Fix a pre-block stage profile and assume \(G\) is simple. There are sensor constants \(\eta_j > 0\), chosen before the block sizes, with the following property. Fix the block factors \(\ell_j\), exponents \(0 < \theta_j \leqslant 1\), reset constants, forced-decay forecasts and post-block costs. For each allowed stage transition \(i \leqslant j \leqslant i + 1\), let \(f_{ji}\) be the inherited coefficient and assume

\(\displaystyle 8 f_{ji} \leqslant q_i \ell_j^{\min}, \qquad u_{ji} (x) \longrightarrow 0 \quad (x \to \infty),\)

where \(q_i = 1 / [64 (1 + A_i)] > 0\), \(A_i \geqslant 0\) is the coefficient of the early size in the regular reorganization bound (Lemma 4.17), and \(\ell_j^{\min}\) is the preassigned block-size floor.

Every entry-threshold record \(V\) has a componentwise increase \(U\) such that every further increase \(W \geqslant U\) satisfies the following conditions beyond its thresholds:

For a realized choice of levels, these conclusions require the same stage profile, block factors and exponents, and payment of the thresholds: \(W^{\text{entry}}_{J_{m + 1}} \leqslant \hat{\beta}_m\) for every \(m\). To obtain III.9.5's physical bounds, also assume \(4 q_i \leqslant c_{ji}\) and \(4 g_j \leqslant \text{rate}_{ji}\); raising thresholds does not supply these inequalities or the early presentation. Start-up bounds admit the same monotone choice of thresholds when \(c_{\text{dir}} \leqslant 1\) at every used stage.

Status: theorem about numerical conditions, conditional on the compatibility inequalities stated above.

Lean: Time.beforeWait, StrongStartup.prices, Timing.choose, Time.credit.

Proposition III.9.8 (marker-rooted to site-pinned polymer sums). Fix \(M, \mu \in \mathbb{N}\), \(a \in \mathbb{R}\) and \(c \geqslant 0\). Let \((X_i)\) be polymers on a four-dimensional torus with weights \(f_i \geqslant 0\), indexed by an arbitrary set. Fix a finite set of marker names; each polymer carries a subset of these names, the markers sitting at sites \(o (v)\), with at most \(\mu\) markers per site. Suppose that every polymer with \(f_i > 0\) contains the site of one of its markers, and that for every marker \(v\)

\(\displaystyle \sum_{i : \hspace{0.17em} v \text{ is a marker of } i} e^{(a + 1) \hspace{0.17em} \text{cover}_M (X_i)} f_i \leqslant c.\)

All sums of nonnegative terms here are required to be summable, including when the index set is uncountable. Then for every site \(x\)

\(\displaystyle \sum_{i : \hspace{0.17em} x \in X_i} e^{a \hspace{0.17em} \text{cover}_M (X_i)} f_i \leqslant \mu \hspace{0.17em} e \hspace{0.17em} (2 (16 M + 9))^4 \hspace{0.17em} c,\)

uniformly in the size of the torus.

Status: theorem. It is used for observable insertions in III.12 and III.15, not for the coupling flow.

Lean: Extra.Multi.root_hit.

What the rest of the construction uses.

2. What it uses

Standard mathematics.

References:

Imported constants and assumptions.

3. Strategy

The nonlinear step gives an early presentation of the blocked density. Its marginal coefficient has three contributions: the input coupling \(\beta'\), the one-loop shift \(\alpha_{N, m}\), and the isotropic Hessian coefficient \(\delta\) of the early regular functions. The reset sets \(\beta = \beta' + \alpha_{N, m} + \delta\). Subtracting flat values and quadratic projections, adding compensating path terms, and absorbing mask discrepancies into the forced gas preserves the full density. The output activity bounds and \(| \delta | \leqslant r_m \leqslant 1\), together with \(| \alpha_{N, m} + \kappa \log L_m | + 1 \leqslant \omega\), give the transfer inequality.

Two configurations identify the reset: the flat field and a small-field stripe \(V\) with \(\mathcal{K} (V) \geqslant | \Lambda | \eta t^2\). Matching at the flat field fixes \(v = | \Lambda |^{- 1} \log H (1)\). Matching the log-ratio at \(V\) gives a scalar equation \(f (x, d) = 0\). The pricing and activity-motion bounds make \(f\) increasing with slope at least \(\mathcal{K} (V) / 2\), and give \(|f (x, 0) | \leqslant \mathcal{K} (V) r / 2\). Its unique root lies in \([- r, r]\) and depends continuously on \(x\). Shape control gives equality at every configuration. For the reorganized activities, \(f (x, d) = (d - \delta_x) \mathcal{K} (V)\), so the correction is explicit.

The interval shooting chains these steps from the Wilson lattice down to level \(0\). At each level, the transfer inequality forces the two endpoint couplings to lie on opposite sides of \([\bar{\beta} + \kappa s_m / 2, \bar{\beta} + 2 \kappa s_m]\). Continuity selects a subinterval whose couplings stay within that window and attain its endpoints. At level \(0\), a surviving bare parameter gives \(\beta_0 = \bar{\beta}\). Summing the transfer errors gives the running law, uniformly in cutoff and volume. III.13 uses compatible finite-cutoff fixed points to obtain the centered history and its analytic continuations.

4. Steps

4.1 Reference scales

Lemma 4.1 (recursion of the reference coupling). \(s_{m + 1} = s_m + \log L_m\), so \(\hat{\beta}_{m + 1} = \hat{\beta}_m + \kappa \log L_m\). \(\hat{\beta}\) is nondecreasing if \(\kappa \geqslant 0\). Since \(L_i \geqslant 3\), \(s_m \geqslant m \log 3 \to \infty\), and \(\hat{\beta}_m \to \infty\) when \(\kappa > 0\).

Sketch: \(a_m = (L_0 \cdots L_{m - 1})^{- 1}\) and the definitions.

Lean: Schedule.scale_succ, Deployment.hat, Timing.hat_mono, Schedule.divergent.

4.2 The Wilson start-up

Lemma 4.2 (splitting the plaquette action). Write \(s (u) = |F (u) |^2 / 2 + Q_4 (F (u)) + R (u)\). Near the identity, curvature gives local coordinates on \(G\). Here \(Q_4\) is the diagonal fourth Taylor coefficient of the plaquette function in those coordinates. The odd coefficients vanish by inversion symmetry. The residual \(R\), defined by the displayed identity for every \(u \in G\), has vanishing derivatives of orders \(0, \ldots, 4\) at the identity.

For \(c_{\text{dir}} \leqslant 1\), the top path data \(P^{\text{top}}_c\) consist of:

They satisfy the zero-momentum normalization (\(c_{\text{dir}} + (1 - c_{\text{dir}}) = 1\)). On the small-field region, \(\beta S_W = \beta \hspace{0.17em} \mathcal{K}_{P^{\text{top}}} + \beta (1 - c_{\text{dir}}) \sum_p R_p\).

Sketch: The derivative of the curvature map at the identity is the identity, so the analytic inverse function theorem gives curvature coordinates. Inversion sends \(F\) to \(- F\) and preserves \(s\). Taylor expansion through order \(4\) gives the quadratic and quartic terms and the residual. The identity \(s = \tfrac{1}{2} \text{chord}^2\) fixes the normalization.

Lean: convert_taylor, surplus, surplus_jet, Design.top, Design.principal_top.

Lemma 4.3 (exact start). For a compatible pair \((c, b)\), every \(\beta\) and every \(U\): the path-data channels of \(P^{\text{top}}\) at \(\beta\), plus the regular activities (residuals of small-field plaquettes), plus the large-field remainders, add up to \(\beta S_W (U)\), the sum being averaged over the point group. Moreover the gas equals \(\exp (- \beta \cdot \text{(large-field remainder)})\). Hence \(\rho^{\text{start}}_{\beta} = e^{- \beta S_W}\), which is III.9.6(1).

Sketch: Fix \(U\). The only nonzero gas term is the family of connected components of the large-field region for the padded adjacency relation (cover size \(B \geqslant 2\) and the compatibility condition separate the padded components). So the gas collapses to a single product \(\prod_D e^{- \beta \hspace{0.17em} \text{charge} (D, U)}\). The charges sum to the large-field remainder, and the channel identity accounts for the rest.

Lean: channel_split, Start.gas_raw, Start.issues, Start.evaluates.

Lemma 4.4 (one-plaquette residual). This is III.9.6(2).

Sketch: \(R_p\) is a real-analytic function of the four link matrices of \(p\). On a small-field plaquette (chord \(\leqslant t\)) its derivatives of order \(l \leqslant k\) along directions of size \(\leqslant t (1 + 4)^q\) are bounded by \(C_l t^5\). This is Taylor's formula with the flatness of Lemma 4.2 and compactness of \(G\); the factor \((1 + 4)^q\) is the spatial weight of sites within distance \(4\). Take \(C = 1 + \sum_l C_l\) and the smallest \(\delta\).

Lean: residual_price, residual_jet, healthy_chord, Quad.small_jet.

Lemma 4.5 (eventual start-up bounds). Under the hypotheses of III.9.6(3), the start-up bounds hold beyond a stage-dependent threshold, uniformly in \(N, p\) and \(\beta \in \mathfrak{B}_N\). With the top-path bounds and recipe approval specified there, the start-up curve is admissible.

Sketch: Put \(x = \hat{\beta}_N\) and \(M = e^{(\log \log x)^2}\). The regular bound is a stage-dependent constant times \(2 xt_N^5 = 2 x^{- 3 / 2} M^5 = o (x^{- 11 / 10})\). For the forced terms, the proof uses a decay exponent \(M\) and an additional polymer-counting factor \(e^{\gamma} - 1\), with \(\gamma = e^{- M / 2}\). The connected-polymer estimate bounds the forced norm by \(e^{- M + 1} \leqslant e^{- M^{1 / 5}}\) for large \(x\). Compatibility follows from \(B_N \asymp (\log x)^2\) and \(t_N = x^{- 1 / 2} M\). These estimates give the displayed continuous start-up family; admissibility also uses its path bounds and the recipe tests.

Lean: Timing.enough, Start.ink, Start.Loan.kernel, Planned.Port.card.

Lemma 4.6 (installing the Wilson top). Assume the old fine paths satisfy the stationary, positive-Hessian, initial-guess, classical-matching and finite-period one-loop conditions for a step. Let the new fine paths have the same main-action jets through order \(4\), and suppose both fine loop kernels vanish. With the same local Haar chart and block branches, there are new stationary data satisfying those same conditions, with the same coarse paths and one-loop coefficient. With the revised horizon and top-path bounds of III.9.6(4), this replacement gives planned kinetic data at every cutoff, preserving the stationary data for \(m + 1 < N\).

Sketch: Equality of fourth jets gives equality of the fluctuation Hessians at the flat field and of their determinant jets through order \(2\). The analytic implicit function theorem constructs the new stationary branch; finite-order agreement transfers the initial guess, classical match and one-loop bound. The old and Wilson top actions both match the Wilson energy through order \(4\). Only the step \(N \to N - 1\) changes.

Lean: Change.top_step, Change.engine.

4.3 The scalar response

Lemma 4.7 (sensor). Assume \(\mathfrak{g} \ne \{0\}\), fix a clip with \(A = c_{\text{dir}} > 0\), and let \(C \geqslant 0\). Then there is \(\eta > 0\), depending only on these data, with the following property. For every even torus side, every path datum satisfying the path bounds with cap \(C\), and every set of norm parameters with \(0 < t \leqslant 1\), there is a configuration \(V\) that is small-field everywhere and satisfies \(\mathcal{K} (V) \geqslant | \Lambda | \hspace{0.17em} \eta \hspace{0.17em} t^2\).

Sketch:

Lean: CouplingReset.sensor, reachable_chord.

Lemma 4.8 (monotone response, continuous root). Let \(I = [l, u]\) with \(l \leqslant u\), let \(r \geqslant 0\), and let \(f : I \times [- r, r] \to \mathbb{R}\) satisfy:

Then there is a unique \(d (x) \in [- r, r]\) with \(f (x, d (x)) = 0\). The function \(d\) is continuous, and \(|d (x) - a| \leqslant |f (x, a) | / \mu\) for every \(x \in I\) and \(a \in [- r, r]\).

Sketch: \(f (x, - r) \leqslant 0 \leqslant f (x, r)\), so the intermediate value theorem gives a zero, unique by strict monotonicity. Moreover \(|d (y) - d (x) | \leqslant |f (y, d (x)) - f (x, d (x)) | / \mu \to 0\).

Lean: Response, Response.balance_solve, Response.continuous, solve.

Lemma 4.9 (two-point readout). Fix path data, a clip, norm parameters and activities \(F (x, d)\) whose regular functions vanish at the flat configuration. Let \(V\) be small-field everywhere and suppose \(H_x (1), H_x (V) > 0\). Define

\(\displaystyle f (x, d) = (\beta'_x + \alpha + d) \hspace{0.17em} \mathcal{K} (V) +\mathcal{L} (V) +\mathcal{E}_{F (x, d)} (V) - \log \frac{H_x (1)}{H_x (V)} .\)

Install the trial with coupling \(\beta'_x + \alpha + d (x)\) and vacuum constant \(v_x = | \Lambda |^{- 1} \log H_x (1)\). If \(f (x, d (x)) = 0\), the trial equals \(H_x\) at \(1\) and at \(V\). If moreover the template satisfies shape control (III.9.4(R)), it equals \(H_x\) at every configuration.

Sketch: At \(U = 1\) the kinetic, loop and activity terms vanish and the gas is \(1\). At small-field \(V\) the gas is \(1\). Shape control at a zero of \(f\) gives \(\text{shape} = H_x / H_x (1)\).

Lean: Template.residual, Template.passes, Template.realizes, Template.response.

Lemma 4.10 (surplus from a pre-reset presentation). Suppose that on \(V = 1\) and on every small-field \(V\)

\(\displaystyle H_x (V) = \exp \left( u_x | \Lambda_m | - \beta'_x \hspace{0.17em} \mathcal{M}(V) - \alpha_{N, m} \hspace{0.17em} \mathcal{S}(V) -\mathcal{L}(V) -\mathcal{E}_x (V) \right),\)

where \(\mathcal{M}\) is the unmasked main term (quadratic, cubic and quartic), \(\mathcal{S}\) its quadratic part, and \(\mathcal{E}_x\) has size \(\leqslant c_m \varepsilon_m / 4\). Assume the coarse path bounds with cap \(C\) and the cubic condition \(| \alpha_{N, m} | \hspace{0.17em} 2 Ct_m^3 \leqslant c_m \varepsilon_m / 2\). Then the surplus inequality of III.9.4(I) holds. If, in addition, the output activities satisfy the catalogue and slow-variation assumptions of III.9.4(I), then all of (I) holds.

Sketch:

Lean: Prereset.income, Prereset.value_income, pays_surplus, higher_estimate, CubicGate, within_alpha.

4.4 The reset step

Lemma 4.11 (one step). This is III.9.4.

Sketch:

Lean: correct, advance, Income.paidResponse, Income.balance.

Lemma 4.12 (the marginal coefficient of the activities). Let \(f\) be a local, gauge-invariant regular function anchored at \(o\), smooth through the prescribed derivative order, and let \(\mathfrak{g}\) be simple. The second derivative of \(f\) at the trivial configuration, along the canonical affine link test fields centered at \(o\), with curls \(X\) in orientation \(b\) and \(Y\) in orientation \(b'\), equals \(\text{coeff}_f (b, b') \langle X, Y \rangle\) (Schur). For the projection used below, retain this Hessian coefficient when the support enlarged by the radius-\(2\) halo of \(o\) does not wrap around the torus, and set the projected coefficient to \(0\) otherwise.

For a family \(A\) of such functions with an anchored regular norm bound, whose addresses and values transform under translations and the point group, assume the torus side is at least \(4\) and put

\(\displaystyle \delta (A) = \sum_{f \text{ anchored at } 0} q_f (01, 01) .\)

Here \(q_f\) denotes the projected coefficient just defined. Then:

Sketch: Gauge invariance makes each color bilinear form invariant under the adjoint action, hence scalar by simplicity. For each pair of distinct plaquette orientations, reflecting an axis belonging to exactly one of them reverses the corresponding off-diagonal coefficient; its sum therefore vanishes. Signed permutations carry each diagonal coefficient to \((01, 01)\). The bound follows from the second derivative in a direction of size \(t\).

Lean: Averaging.delta, Averaging.isotropic, Averaging.identity, Averaging.delta_bound, label_color, projection.

Lemma 4.13 (exact reorganization). Assume the early presentation, local bounds, compatible clip, width, reorganization inequalities and recipe acceptance of III.9.5(a). Let \(\delta_x\) be the coefficient of Lemma 4.12. The reorganized representation has the same paths, coupling \(\beta'_x + \alpha_{N, m} + \delta_x\), and vacuum constant \(\tau_x - | \Lambda_m |^{- 1} \sum_i E_{x, i} (1)\). Its density equals \(H_x\) at every configuration, and it obeys the level-\(m\) allowances and the forced bound \(e^{- gM_{m + 1}^2}\).

Sketch: For an early regular function \(E_i\) with support \(X_i\) and anchor \(o_i\), put \(Y_i = X_i \cup \text{halo}_2 \{o_i \}\). Let \(Q_i\) be one half of its projected Hessian applied to the local clover curvatures, and set \(E_i^0 = E_i - E_i (1) - Q_i\). Define \(D_i\) to vanish when \(Y_i\) is small-field, and otherwise by

\(\displaystyle D_i = E_i (1) + \chi_{\{o_i \}} Q_i - \chi_{X_i} E_i .\)

Then, at every configuration,

\(\displaystyle \chi_{X_i} E_i = E_i (1) + \chi_{\{o_i \}} Q_i - D_i + \chi_{Y_i} E_i^0 .\)

The projected terms sum to \(\delta_x / 2\) times the small-field clover-curvature square. The regular terms also acquire \(\delta_x\) times the difference between each quadratic clover proxy and its original quadratic path term, and \(- (\alpha_{N, m} + \delta_x)\) times each masked cubic or quartic path term. The remaining mask discrepancies become logarithmic factors in the forced gas.

More precisely, let \(\mathcal{E}^{\text{new}}_x\) denote the resulting regular sum and \(\ell_x\) the sum of these logarithmic factors before they are absorbed into the gas. The activity and path splitting identities give

\(\displaystyle (\alpha_{N, m} + \delta_x) \mathcal{K}+\mathcal{E}^{\text{new}}_x - \ell_x = \alpha_{N, m} \mathcal{S}+\mathcal{E}^{\text{early}}_x - \sum_i E_{x, i} (1) .\)

Absorbing \(e^{\ell_x}\) into the original forced gas proves equality of the full densities, including at configurations where masks fail. The reorganization estimates bound the regular terms and the added forced factors; the numerical closure conditions give the claimed allowances. Recipe acceptance is a separate hypothesis.

The trial activities are independent of the correction parameter \(d\). Thus exact equality at \(d = \delta_x\) gives \(f (x, d) = (d - \delta_x) \mathcal{K} (V)\) and shape control on \([- r_m, r_m]\). The unique root of Lemma 4.11 is therefore \(\delta_x\).

Lean: Collection.Local.actual, Local.exponent, Return.settled, Return.grants, Return.earns, Return.remainders, Return.physical_shape, Return.reset, Residual.splits, Local.first_split, Collection.path_split. (proof read, including the reorganized activities in Local.renew)

Lemma 4.14 (from per-step inputs to the program). This is III.9.5(b). The numerical conditions (Use.Machine), the existence of early presentations along every admissible input curve (Use.Offering) and the start-up curves (Use.Origins) together give the step program, assuming \(G\) is simple and the machine uses the compatible recipe and physical bounds of III.9.5.

Sketch: For each input curve, Lemma 4.7 provides a probe. Lemma 4.13 provides (I) and (R). Lemma 4.11 then gives the output curve and the bound \(| \beta - \beta' - \alpha | \leqslant r_m\).

Lean: Use.supplier, Machine.packet, Supplier, program.

4.5 Continuity of the transport

Lemma 4.15 (joint continuity of the blocked density). Let \(x \mapsto \rho'_x\) be a continuous curve of lawful representations with fixed path data, clip and norm parameters, and assume the block kernel satisfies the branch conditions of III.1. Then \((x, V) \mapsto (T^{(m)}_{\beta'_x} \rho'_x) (V)\) is jointly continuous, and \(x \mapsto \rho'_x (U)\) is continuous for every \(U\).

Sketch: Continuity of the activities in the polymer norm gives uniform convergence of the additive part and of the gas in \(U\). This yields a local uniform bound on \(\rho'_y\), and dominated convergence applies under the kernel. The kernel itself is continuous in \(\beta\) and in the coarse configuration.

Lean: FixedRepData.continuous_push, FixedRepData.continuous_eval, Catalog.stable.

4.6 Entry thresholds

Lemma 4.16 (monotone thresholds). Let \(T_j (x)\) be properties, one for each stage \(j\), each holding for all large \(x\). Then any record \(u_j\) can be raised to a nondecreasing record \(m_j \geqslant u_j\) such that \(T_j (x)\) holds for all \(x \geqslant m_j\). For each fine stage \(j\), combine the two possible coarse targets \(i = j\) and \(i = \max (j - 1, 0)\) first.

Sketch: Take \(m_j\) to be the prefix maximum of \(\max (\text{threshold}_i, u_i)\) over \(i \leqslant j\).

Lean: collect_upper, eventually_transitions, StepStages, DelayLe.

Lemma 4.17 (eventual reset inequalities). Fix an allowed transition from fine stage \(j\) to coarse stage \(i\), its block factor \(L\), and all the constants in III.9.7. Write \(x = \hat{\beta}_m\), \(y = x + \kappa \log L\), \(M = e^{(\log \log x)^2}\) and \(q_i\) for the early-activity fraction. The conclusions are uniform for \(| \alpha | \leqslant \omega_j + \kappa \log L\) and \(\beta \in [y / 2, 2 y]\). Then all the delay-dependent reset conditions hold for sufficiently large \(x\).

Sketch: The sufficient pricing condition \(2 (c + 1) \leqslant \eta rM^2\) holds because \(M \to \infty\). Multiplication by \(x^{- 1}\) gives \(2 (c + 1) x^{- 1} \leqslant \eta rt^2\); since \(\varepsilon = x^{- 11 / 10} \leqslant x^{- 1}\) for \(x \geqslant 1\), this implies the required pricing inequality. The cubic condition follows from \(t^3 / \varepsilon = x^{- 2 / 5} M^3 \to 0\).

For the local reorganization, its regular bound has the form \(A_i H + B_i | \alpha | t^3\), with \(A_i, B_i\) fixed before \(L\). The choice \(H = q_i \varepsilon\), with \(A_i q_i \leqslant 1 / 64\), leaves room for an output bound \(\varepsilon / 32\). The forced estimate controls both the early forced terms and the added logarithmic factors, at support exponent \(a + 1\), where \(a\) is the coarse support exponent. The width condition is \(4 (a + 1) \leqslant \sigma B\), where \(\sigma\) is the path-decay width. It holds since \(B \to \infty\), as does clip compatibility. The corresponding forced output bound is \(e^{- R_{ji} (y, \beta)}\). If \(4 g_j \leqslant \text{rate}_{ji}\) and \(\beta \in [y / 2, 2 y]\), its definition gives \(R_{ji} (y, \beta) \geqslant g_j M (y)^2\); for large \(x\) it also gives the ordinary forced allowance at \(x\).

The inherited condition is

\(\displaystyle (f_{ji} / L + u_{ji} (x)) \varepsilon (y) +\mathcal{R}_{ji} (x, y, \beta) \leqslant q_i \varepsilon (x), \qquad \beta \in [y / 2, 2 y] .\)

Here \(\mathcal{R}_{ji}\) is the fixed step-estimator residual at exponent \(\theta_j\); it is \(o (\varepsilon (x))\) uniformly in this band when \(\theta_j \leqslant 1\), and \(u_{ji} (x) \to 0\). The pre-block inequality gives \(f_{ji} / L \leqslant q_i / 8\). Together with \(\varepsilon (y) / \varepsilon (x) \to 1\), these bounds prove the inequality. Lemma 4.16 combines the conditions in the order: inherited estimates, local reorganization, cubic estimate, reset pricing; the sensors were fixed before \(L\).

Lean: can_delay_reset, buys_reset, sensors, delay_cubic, Time.cash, Time.late, Time.open_shop, Time.now, Time.rawGate, Time.beforeWait.

Lemma 4.18 (joint start-up thresholds). Assume \(G\) is simple and \(c_{\text{dir}} \leqslant 1\) at every used stage. Fix the observable sections, marker bounds and nonnegative additional start-up requests. Before choosing block sizes, enlarge the path and column bounds so that the Wilson top paths satisfy the stage bounds and the column bound is at least the factorial of the derivative order. Then the block-size floors and the coupling and scale thresholds can be enlarged so that every realized choice of levels meeting them has the start-up bounds of Lemma 4.5 and the following additional bounds. Write \(x = \hat{\beta}_N\), \(t = t_N\), \(M = M_N\), \(B = B_N\) and \(a\) for the support exponent at stage \(j = J_N\).

These conclusions persist when the thresholds are increased.

Sketch: At a fixed stage only finitely many observable degrees are requested. At fixed stage, the stencil and cylinder constants are fixed, while \(B \to \infty\) and \(e^{- M^{1 / 5}}\) absorbs every fixed power of \(t^{- 1}\). The additional support weights and the first-step cost grow polynomially in \(\log x\), whereas \(xt^2 = M^2\) grows faster than every such polynomial. Take common thresholds and enlarge the block-size floors for the cross-level support estimates. The joint pricing theorem also increases the scale thresholds, while preserving the prescribed volume and growth data. This establishes numerical preparation; subsequent nonlinear steps still require their own activity estimates.

Lean: StrongStartup.prices, StrongStartup.before, Extra.Multi.pricing, Timing.receive, ThroughLaunch.developer, Mark.Ready, StrongStartup.Escrow, StrongStartup.BondFuel, Mixture.Extras.

4.7 Assembly and the running law

Lemma 4.19 (bounds at the edges of the shooting window). Assume \(\kappa > 0\) and \(\bar{\beta} > 0\). Put \(\phi_m = \bar{\beta} + \tfrac{\kappa}{2} s_m\) and \(\psi_m = \bar{\beta} + 2 \kappa s_m\). Then \([\phi_m, \psi_m] \subset \mathfrak{B}_m\), and \(\phi_0 = \psi_0 = \bar{\beta}\). Assume \(\omega_{J_{m + 1}} \leqslant \tfrac{\kappa}{4} \log L_m\) (guaranteed by the choice of block sizes). If a step satisfies the transfer inequality, then:

Sketch: \(\beta_m \leqslant \phi_{m + 1} - \kappa \log L_m + \omega \leqslant \phi_m - \tfrac{\kappa}{4} \log L_m\), and symmetrically for \(\psi\).

Lean: Shoot.gates, Shoot.limits, Shoot.Drifting.pay.

Lemma 4.20 (shooting in the bare coupling). Suppose the step program holds and \(G\) is simple. Then for all \(N, p\) there is a trail \((\rho_{N, p, m})_{m \leqslant N}\) with the following properties:

Choosing these trails for all \(N, p\) gives a history satisfying (1)–(5) of III.9.3. The common-path clause follows because every trail uses the same prescribed \(P_{N, m}\).

Sketch: Decreasing induction on \(m\) carries an interval \([l, u]\) of bare couplings and a continuous curve of trails.

Lean: Shoot.steps, Shoot.narrow, Shoot.successful, Recipe.races, Graces.winnow.

Lemma 4.21 (running). For a history on levels satisfying the drift-smallness and stage-divergence conditions of III.9.2, clauses (4) and (5) of III.9.3 imply clause (6).

Sketch:

Lean: Shoot.trajectory, Orchard.traject. The second version replaces (5) by the band at level \(0\).

Lemma 4.22 (the history of the main theorem). Fix the compatible data of III.13, including its analytic continuation bounds and finite-cutoff solutions. For every \(N, p\) and every real \(b\) with \(|b| < r_{\ast}\), there is a trail in that construction with level-\(0\) coupling \(\bar{\beta} + b\). Its bare coupling is unique within the specified class of finite-cutoff solutions. The coupling and activity arrays admit analytic continuation to the complex disc \(|b| < r_{\ast}\), with \(r_{\ast} > 0\) independent of \(N, p\). At \(b = 0\), these trails form a selected history, and every step is a reset step.

Sketch: III.13 solves a coupled finite-cutoff fixed-point problem for all the level couplings. For real offsets its fixed point gives real trails and the stated endpoint; the comparison theorem gives uniqueness in this class. At \(b = 0\), their admissibility gives the common paths and level-wise bounds; their reset steps give exact transfer. Lemma 4.21 supplies running. This is the history used in the Wilson family. The calibration condition records its realized trails and reset steps; it does not assert uniqueness among all representations of the same density.

Lean: Spire.Uses.exists_bolt, Spire.Uses.hits, Upland.Arc.exists_trial, Mast.calibrated, Upland.Arc.finiteCut, Spire.Fitted.acts, Spire.Fitted.unions. (proof read for the displayed assembly and finite-cutoff uniqueness theorem; inputs from III.13)

4.8 Auxiliary results

Lemma 4.23 (marker-rooted sums). This is III.9.8.

Sketch:

Lean: Extra.Multi.root_hit, torus_kernel.

Lemma 4.24 (decay of a shifted Gram inverse). Fix a finite channel set \(I\), \(r, \eta > 0\) and \(A \geqslant 0\). There are \(C \geqslant 0\) and \(\tau > 0\), depending only on \(I, r, \eta, A\), such that every real convolution kernel \(P\) on \(\mathbb{Z}^4\) with

\(\displaystyle \sum_{z \in \mathbb{Z}^4} e^{\eta |z|_1} |P_{ab} (z) | \leqslant A \qquad (a, b \in I)\)

has a real convolution kernel \(S\) with the corresponding bound \(C\) at exponent \(\tau\), and, on every torus,

\(\displaystyle S_n (rI + P_n^{\textsf{T}} P_n) = I.\)

Here \(P_n, S_n\) are periodizations. Thus \(S_n = (rI + P_n^{\textsf{T}} P_n)^{- 1}\), uniformly in the torus side.

Sketch: On real momentum, \(rI + \hat{P} (k)^{\ast} \hat{P} (k)\) is positive definite. Compactness in the fixed finite channel space and the weighted kernel bound give invertibility and a uniform inverse bound in a narrower complex strip. Fourier coefficient estimates give an exponentially summable inverse kernel. The discrete Fourier transform identifies its periodization with the inverse matrix on every torus.

Lean: Polar.deliver, Polar.invert_tori, Polar.writes.

5. Where the difficulty lies

The early presentation with local bounds comes from III.10, the one-loop coefficient from III.7, and the compatible kinetic data from III.13. Given those inputs, the reset must preserve the full masked density, including failed-mask discrepancies and the forced gas. Two-point matching alone does not prove that identity. Lemma 4.13 supplies it and proves the output activity bounds.

The marginal coefficient is isolated by gauge symmetry, simplicity and lattice isotropy. It is a Hessian coefficient, so its quadratic energy carries a factor \(1 / 2\). The Wilson start-up has a uniform \(O (t^5)\) residual even when individual links are far from the identity. Continuity in the bare parameter must hold in the activity norms despite the hard configuration masks; shooting depends on this continuity.

The block factors grow. The planned one-loop condition implies \(\omega_{J_{m + 1}} \geqslant 1\), while the drift condition gives \(\log L_m \geqslant J_{m + 1}^2 \to \infty\). The gentle-scale condition requires \(\log L_m = o (s_m)\). The reset correction is small:

\(\displaystyle | \delta_x | \leqslant \frac{c_m}{4} \hat{\beta}_m^{- 1 / 10} e^{- 2 (\log \log \hat{\beta}_m)^2} .\)

The constants \(c_m\) depend on the stage pair, so this is a fixed-stage estimate. The separate one-loop error is bounded independently of \(L\) once its earlier parameters are fixed; no decay of that error in \(L\) is required. The argument gives \(\beta_m = \bar{\beta} + \kappa s_m + o (s_m)\) uniformly in the cutoff and volume. It does not give a bounded remainder or a two-loop expansion.

The coarsest coupling is prescribed exactly. Shooting chooses the bare coupling separately for each cutoff and volume and restricts the surviving parameter intervals to keep every level in its band. The uniqueness theorem in III.13 applies to its specified continuation class.

6. Notation

Written proof Lean (glossary) Meaning
\(\kappa = \frac{11 C_G}{24 \pi^2} = 2 b_0\) Gauge.slopeConstant, Gauge.casimir slope of \(\beta\) against \(\log (1 / a)\)
\(s_m\), \(a_m\), \(L_m\) Schedule.scale, Schedule.a, block scale \(\log (1 / a_m)\), spacing, block factor (odd, \(\geqslant 3\))
\(\bar{\beta}\) Calendar.bar ("barrier") coupling at the coarsest level
\(\hat{\beta}_m\), \(\mathfrak{B}_m\) Calendar.hatBeta, band reference coupling, band \([\hat{\beta} / 2, 2 \hat{\beta}]\)
\(t_m\), \(M_m\), \(B_m\) threshold, monitor, coverSize small-field threshold, its multiplier, cover size
\(\varepsilon_m\), \(\tilde{\varepsilon}_m\) allowance, forcedAllowance sizes of regular and forced activities
\(J_m\), \(\omega_j\), \(\theta_j\) Calendar.J, Stage (drift), theta stage index, drift allowance, smallness exponent
\(\rho = (P, c, E, K, b, \beta, v)\) Rep effective action ("representation")
\(\mathcal{K}_P\) BetaTransport.kinetic \(\beta\)-coefficient of the leading terms
\(T^{(m)}_{\beta}\) StepData.push one block-spin step
\(\beta_{N, p, m}\), \(\rho_{N, p, m}\) History.β, History.rep selected history
\(\alpha_{N, m}\), \(P_{N, m}\) Kin (alpha, path) one-loop shift of the step, path data
\(\mathfrak{D}\) Directed scale sequence, kinetic data and recipe
reset step Directed.Move one step with exact transfer and \(\lvert \beta - \beta' - \alpha \rvert \leqslant 1\)
step program Directed.Program start-up curves and reset along all admissible curves
\((c_m, r_m)\) ResetPrices (cost, radius) income multiplier, reset window (\(\leqslant 1\))
\(\eta_j\), probe \(V\) Sensor, Usable lower bound \(\mathcal{K} (V) \geqslant \lvert \Lambda \rvert \eta t^2\)
\(f (x, d)\), \(d\) Template.residual scalar residual, coupling correction
\(\chi_X\), \(Q_i\), \(E_i^0\), \(D_i\) Residual.splits small-field indicator, local quadratic projection, subtracted regular function, mask discrepancy
\(\delta (A)\) Averaging.delta isotropic curvature-squared coefficient of activities
early presentation Collection.earlyValue, Return.atlas blocked density before the reset
\(P^{\text{top}}\), \(R_p\), \(Q_4\) Design.top, residual, fourth Wilson top path data, one-plaquette residual, quartic coefficient
\(\rho^{\text{start}}_{\beta}\) Bid.Cake with payload, dictionary Wilson start-up representation
compatible \((c, b)\) WilsonStartup.Decent \(c_{\text{dir}} \leqslant 1\), \(B \geqslant 2\), \(te^{(B - 2) / c_{\text{rel}}} \geqslant 2\)
\(\phi_m, \psi_m\) floorBeta, ceilBeta shooting window
numerical bounds and entry thresholds glossary item 1 constants in the polymer norm estimates and lower bounds on \(\hat{\beta}\)

7. What remains unexplained

  1. Nonlinear inputs. The reset is conditional on the early presentation, stronger local activity bounds and continuity. Their supply is the conclusion of Rain.glazing and Roost.Factor.offering. Their assembly proofs identify the required inputs; the underlying nonlinear and Gaussian-sector estimates belong to III.10 and III.4 and are not independently verified here.

  2. Activity reorganization. The explicit splitting and the proof of Local.renew give Lemma 4.13. A full written proof should expand the local reorganization constants and the connected-polymer estimate that absorbs the logarithmic factors. Their detailed norm estimates are inputs from II.2 and III.10.

  3. Finite-cutoff uniqueness. The uniqueness in Lemma 4.22 concerns the class of solutions specified in III.13, with its fixed data and continuation bounds. This construction solves coupled fixed-point equations rather than choosing a subinterval by Lemma 4.20. The displayed assembly and uniqueness theorem have been checked; the analytic existence and comparison estimates underneath them remain for III.13. Real offsets satisfy \(|b| < r_{\ast}\); complex offsets parametrize analytic continuations, not real positive densities.

  4. Relaxed histories. The intermediate history predicate with no endpoint restriction is distinct from the selected-history specification. Its running estimate uses the band at level \(0\). The final centered history satisfies the exact endpoint clause.

  5. Numerical and bibliographic scope. Lemma 4.18 gives the start-up numerical bounds; their use for source polynomials and first-step observations requires the norm definitions in III.12 and III.15. The cited numerical preparation does not itself construct those observables or their nonlinear continuations. The literature citations in §2 are background references; their exact bibliographic details and comparison with this construction remain unchecked here.

  6. Verification scope. The correspondence checks use the supplied Lean source and link table. No Lean build or independent axiom-closure check was performed. The package sizes and main-theorem dependency counts are retained from the unit map (tentative).

← III.8 Connected activities and backward dependence cones (notes)Part III·Unit outlineIII.10 One full nonlinear renormalization step: bounds on irrelevant terms (notes) →