1. What this unit proves 2
2. What it uses 10
3. Strategy 11
4. Steps 12
4.1 The algebraic identity 12
4.2 Packing and geometry 12
4.3 Kernel bounds 13
4.4 Row-by-row lower bounds 14
4.5 Linearization defects on unaffected cells 15
4.6 Assembly of III.10.1 17
4.7 Activities of one step 18
4.8 Derivatives 20
4.9 Start-up fusion and markers 21
4.10 The schedule 21
5. Where the difficulty lies 22
6. Notation 23
7. What remains unexplained 23
The full account of unit III.10: 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/Work/ (items E01–E09, H01–H04, I01–I04), YM/Bid/, YM/Next/FLUCTUATIONS/, YM/AnalyticNext/CONNECTED_ACTIVITY_JETS_E6/, YM/PhysicalNext/RG_NEXT_COMPLETE_REPEATABLE_NONLINEAR_STEP/, YM/PhysicalNext/V9_JOINT_ENDPOINT_LOAD/, YM/Pressure/ (definitions). Size: 49,448 lines in the main-theorem closure.
Conventions. Levels are indexed from coarse to fine, as in III.9.
Step and couplings. One step \(S\) goes from a fine torus of side \(f = cL\) to a coarse torus of side \(c\), with odd block factor \(L \geqslant 3\). Write \(x\) for the coarse reference coupling \(\hat{\beta}_m\). The fine coupling is \(\beta_F = x + b_G \log L = \hat{\beta}_{m + 1}\) (clock_next), where \(b_G \geqslant 0\) is the one-loop slope of III.9; \(b_G > 0\) when the Lie algebra of \(G\) is simple.
Thresholds, radius and cutoff.
with cluster radius \(B = \lceil (\log x)^2 \rceil\) and path-length cutoff \(R = \lfloor B / 10^5 \rfloor\).
Sizes. Since \(e^{(\log \log \beta)^2} = \beta^{o (1)}\), we have \(t = \beta_F^{- 1 / 2 + o (1)} \ll T\). On the other hand \(\beta_F t^2 = e^{2 (\log \log \beta_F)^2}\) grows faster than every power of \(\log \beta_F\).
Field sizes. \(\chi (g)\) is the chordal distance from \(g \in G\) to \(1\). For a plaquette \(p\), \(|U_p | = \chi (U_{\partial p})\). For a coarse bond \(b\), \(w_b = \chi (V_b Q_b^{- 1})\) measures how far the coarse field \(V\) is from the block-spin predictor \(Q = Q (U, k)\) of the fine field \(U\) with gauge-fixing tags \(k\) (III.1).
"For all large \(x\)" means \(x \geqslant x_0\), with \(x_0\) independent of the period and volume. Other dependencies are specified in each statement.
The unit does not construct the effective actions; that is III.9, with III.5–III.8. It proves the estimates on one nonlinear block-spin step that the construction consumes:
a deterministic lower bound on the action gap of the step near large-field regions (III.10.1);
bounds on the activities produced when the fluctuation field is integrated out, and on all their derivatives in the coarse field (III.10.2, III.10.3);
bounds on the Gaussian sector of the step (III.10.4);
the numerical schedule under which these estimates hold at every level (III.10.5).
III.10.6 collects the start-up fusion and marker estimates. In the energy argument, constants are chosen before \(L\), after \(L\), or after \(W\); this order determines which losses they can absorb. The derivative and Gaussian estimates have their own quantifier orders, stated below.
Data of a step.
Request. A request \(P\) (Teller) consists of:
kernel choices \(K\), with penalty \(a > 0\) and cuts;
a fine stage and a coarse stage, each with clip constants \(\alpha, \lambda, \rho > 0\) satisfying \(\lambda < \alpha / 16\) (Clip), a path width and a path budget;
a step index \(j\) and constants \(\eta > 0\), \(C\).
Tube. A tube \(\mathscr{T}\) (Tube) carries the towers \(\Phi, \Phi', N\) and the fine and coarse path data. \(\Phi\) maps coarse plaquette coordinates to fine plaquette coordinates; \(\Phi'\) maps them to coarse-bond ("interior") coordinates; \(N\) maps them to gauge coordinates.
Admissibility. A step with tube \((S, \mathscr{T})\) is admissible for \(P\) (Teller.Funds) if:
\(S\) uses \(K\) and index \(j\);
the patch is well posed (Branches: unique minimizers whenever the frame or predictor selector uses minimization, and a nonempty set of eligible axial tags for every configuration);
the scalar tower coefficients have exponentially weighted absolute sums at rate \(\eta\) bounded by \(C / L^2\) for the fine kernel and \(C\) for the interior and gauge kernels. Finite differences of order \(\ell \leqslant j - 2\) of the one-form and two-form cross kernels have bounds \(C / L^{1 + \ell}\) and \(C / L^{2 + \ell}\), respectively (YM.Precision.Towers.Deep);
the clips and path budgets are those of \(P\);
the flat, uncut tower matrices satisfy the exact identities Towers.Roll, among them the resolution of the identity
The transported kernels cut at length \(R\) need not satisfy this identity; their defects are estimated in §4.5.
Seeds. A store \(A = (A_F, A_I, A_{\flat})\) (Stores) consists of finite sets of fine plaquettes ("costs"), coarse bonds ("aisles") and coarse sites ("flags"). \(\sharp A\) is the sum of their cardinalities, including coincident seeds of different types. \(D_r (A)\) is the coarse \(r\)-neighbourhood of their positions: all parent sites touched by a fine plaquette, both endpoints of a coarse bond, and each flag site. \(A\) is consistent with \((U, k, V)\) at \((x, W)\) (Plot) if the following hold:
whenever a parent site touched by \(p\) meets \(D_{5 B} (A)\), \(p \in A_F\) implies \(|U_p | \geqslant t / 4\), and \(p \not\in A_F\) implies \(|U_p | \leqslant t / 2\);
whenever an endpoint of \(b\) meets \(D_{5 B} (A)\), \(b \in A_I\) implies \(w_b \geqslant Wt\), and \(b \not\in A_I\) implies \(w_b \leqslant 2 Wt\);
\(A_{\flat}\) agrees with the flags of \(V\) at threshold \(t_c (x)\) on \(D_{5 B} (A)\);
each site tag based in \(D_{5 B} (A)\) has positive frame weight.
Nothing is assumed outside \(D_{5 B} (A)\). The spent seeds \(A^{\text{sp}}\) are the costs with \(|U_p | > T\) and the aisles with \(w_b > T\).
Action gap.
Clipped density. For a stage with clip \((\alpha, \lambda, \rho)\) and threshold \(s\), the clipped density of a plaquette is \(\phi_s (|U_p |) +\boldsymbol{1}_{\text{kept}} \tfrac{1}{2} | \ell_p (U) |^2\) (crown). Here:
Actions. \(\mathcal{A}_F (U)\) is the fine clipped action (fine stage, threshold \(t\)) and \(\mathcal{A}_c (V)\) the coarse one (coarse stage, threshold \(t_c (x)\)).
Step functional. \(\mathcal{E}_A (U, V)\) (assessed) is the sum of the row contributions of Lemma 4.1 over the rows located in \(D_{2 B} (A)\). Summed over all rows of the torus, the same contributions give exactly
So \(\mathcal{E}_A\) is the action gap of the step (fine action, plus block-spin penalty, minus coarse action), localized near the seeds.
Proposition III.10.1 (energy per seed). Let \(P\) be a request. There is \(L_0\) such that for every block factor \(L \geqslant L_0\) there is \(W_0 (L)\) such that for every \(W \geqslant W_0\) there is \(x_0\) with the following property. Take \(x \geqslant x_0\) and:
a step \(S\) of block factor \(L\) with coarse side \(c \geqslant 100 (1 + B)\), and a tube \(\mathscr{T}\) admissible for \(P\);
a spanning forest \(F\) of the block structure, and a fine field \(U\) equal to \(1\) on the trunks of \(F\);
a store \(A\), tags \(k\) and a coarse field \(V\) such that \(A\) is consistent with \((U, k, V)\) at \((x, W)\).
Then
where \(\lambda_F\) is the linear clip constant of the fine stage and \(\alpha_c\) the quadratic clip constant of the coarse stage.
Status: theorem under the stated admissibility, tree-gauge and consistency hypotheses.
The Lean statement (Teller.cash, Teller.Grants) asserts only some \(\kappa > 0\) chosen after \(L\) and \(W\). The value above is the one the proof produces (Lemma 4.14), and it is independent of \(L\) and \(W\).
This deterministic estimate precedes the Gaussian tail and activity bounds of III.10.2.
Lean: proved by Fluctuations.grants. This is Integrated.pressure_grants applied to Fluctuations.bare, through Bid.issues.
Proposition III.10.2 (activities of one step). Let \(P\) be a request and \(\mathcal{T}\) target data (Target): constants \(\varepsilon, \delta > 0\), \(e \geqslant 0\), a rate \(r \in (- \tfrac{1}{2}, 0)\), a halo \(h \geqslant 500\) and a local exponential chart of \(G\), with \(4 \varepsilon\) below the support exponent of the fine stage and \(8 \varepsilon\) below both stage widths. Put \(a_{\ast} = e + 2 \varepsilon + \delta\).
There is \(L_0\) such that for every \(L \geqslant L_0\) and every large \(W\) there is \(\mu > 0\) with the following property. For every patch \(D\) of block factor \(L\) satisfying the branch condition there are window constants \(o\) (Target.Order: a decay rate, a spectral gap, a shell width \(K\), a Lipschitz constant \(\gamma\), a drift cap, a plateau \(a_o\) and a trigger level \(\xi\)) and a constant \(C \geqslant 0\) such that the following holds for all large \(x\), every step \(S\) on \(D\) with \(c \geqslant 100 (1 + B)\) and every tube admissible for \(P\) (Works).
(a) The conclusions GrantBodies hold:
the bound of III.10.1 holds at this \(x\) with constant \(\mu\) (PointCharge);
if \(U\) is in tree gauge and, within coarse distance \(B / 4\) of the bond's parent site, site tags have positive frame weight, fine plaquettes have size at most \(t / 2\), and coarse mismatches are at most \(2 Wt\), that link lies within \(Kt\) of the replicated coarse link; the Lie logarithm is reliable at that radius (ShellAccess);
in every sector whose flags are the actual flags of \(V\) (manifest), the Gaussian precision matrix is symmetric, has exponentially decaying entries and a positive spectral lower bound, and the covariance formed from its local inverses is positive definite (Rotator);
the Gaussian centring drift has norm at most \(\text{cap} \cdot t\) at each fine bond. If the tube also satisfies the compatibility condition in (b), then, for every \(\beta > 0\), a fluctuation satisfying \(|z_j | \leqslant \xi t \sqrt{\beta}\) on all coordinates within distance \(B\) of a site farther than \(30 B\) from the seeds has site and bond tag masses one, \(|U_p | < t / 4\) for plaquettes based there, and \(w_b < Wt\) for bonds based there;
numerical margins hold: \(4 a_o t\) is below the chart radius, and, for the window's positive inverse-kernel constants \(\tau_0, C_0\) and window bound \(Q_0 \geqslant 1\), the quantity \(\epsilon_B = e^{- \tau_0 B} (Q_0 C_0 + 1)\) satisfies \(\epsilon_B < 1\) and \(Q_0 C_0 \epsilon_B < 1\).
(b) The conclusions Invoices hold for every tube satisfying the free-kernel compatibility condition Stamp, and for every input representation \(K\) of the fine-level density as in Intake. The input has the fine-stage support exponent, threshold \(t\), coupling \(\beta \in [\beta_F / 2, 2 \beta_F]\), the path data and clips of \(\mathscr{T}\), cluster radius \(B (\beta_F)\), and activities obeying the incoming bounds of III.9: \(E\)-norm \(\beta_F^{- 11 / 10}\), \(K\)-norm \(e^{- M^{1 / 5}}\) and loop budget \(2 M\), where \(M\) is the fine monitor. The conclusions are:
the cost record with gain \(\beta \mu t^2\) per seed and spend \(C \hspace{0.17em} \text{bill} (x)^5\), where \(\text{bill} = 1 + B + (\log \beta_F)^2\), passes the tree-graph summability test Buy;
the letters of the new gas carry weights \(k_i, y_i, E\) satisfying a rooted Kotecký–Preiss condition with exponent \(\varepsilon\) and total \(\beta_F^{\hspace{0.17em} r}\) (Sales). For a letter with support \(X_i\) and extra length \(d_i\), this means nonnegative weights \(u_i\) with
Here $N_B(H)$ is the minimum number of radius-$B$ balls whose connected union contains $H$. The letters are the forced activities of $K$, the logarithmic letters, and the warning letters. Their weights are respectively $k_i$, $y_i$ and $E$ times a fixed patch-dependent warning-amplitude bound; warning letters have $d_i=0$;
in every manifest sector, the following bounds hold:
the old activities are bounded by \(k_i\);
the logarithmic letters \(\ell_i\) and the differences \(e^{\ell_i} - 1\) are bounded by \(y_i\);
every packet weight satisfies \(| \text{Pack} | \leqslant \exp \left( (C \hspace{0.17em} \text{bill}^5 - \beta \mu t^2) \hspace{0.17em} \sharp A \right)\) (Pack);
for every set \(v\) of warning addresses, the Gaussian measure of the catastrophe set is at most \(E^{\sharp v}\). The catastrophe set consists of the fluctuations \(z\) for which, near the anchor of each address in \(v\), some coordinate within distance \(2 B\) satisfies \(|z_j | \geqslant \xi t \sqrt{\beta}\). Every fluctuation that triggers the warnings on \(v\) lies in that set.
Status: theorem. The target data, fine input bounds and free-kernel compatibility are hypotheses. The input bounds are supplied along the RG trajectory (III.9); the compatibility construction is discussed in §7.
Quantifier order: \(L_0\), then \(W\), then \(\mu\) (uniform in \(D\)), then \((o, C)\) for each patch, then \(x\).
Size of the per-seed factor. Since \(\beta \mu t^2 \geqslant \frac{\mu}{2} e^{2 (\log \log \beta_F)^2}\) and \(\text{bill}^5 = O ((\log \beta_F)^{10})\), the factor \(e^{C \text{bill}^5 - \beta \mu t^2}\) is eventually smaller than every power of \(\beta_F\).
Lean: Target.issue. Target.quotesTogether repackages the output as the bundle Cash (the activity estimates together with witnesses for the letter weights).
Proposition III.10.3 (derivatives of the new activities). Let \(P\) and \(\mathcal{T}\) be as in III.10.2. There is \(L_0\) with the following property. Fix \(L \geqslant L_0\), a patch \(D\) satisfying the branch condition, an order \(i \in \mathbb{N}\), a sector cutoff \(\chi\), \(W, \mu > 0\), window constants \(o\), and chart constants \((A, f)\) satisfying YM.ConnectedActivityE6.Blaze.Eider.Canary. The latter require \(A, f > 0\), \(\log (\exp u) = u\) for \(|u| \leqslant 2 A\), \(\exp (\log (\exp u \hspace{0.17em} g)) = \exp u \hspace{0.17em} g\) for \(|u| \leqslant A\) and \(\|g - 1\| \leqslant f\), and analyticity of \(M \mapsto \log (\exp u \hspace{0.17em} M)\) for \(|u| \leqslant 2 A\), \(\|M - 1\| \leqslant f\). Fix a function \(\mathcal{V}\) of rate \(- 1 / 2\) that is eventually nonnegative (Lemma 4.15).
There are \(C \geqslant 0\), functions \(q, \rho, p\) of rates \(- 1 / 2, 0, 0\), respectively, and \(l \in \mathbb{N}\) such that, for all large \(x\), the following holds for every step on \(D\) satisfying the compatibility condition, every fine representation \(R\), and every bound bundle \(H\) of III.10.2 at \((W, x, \mu)\). One has \(8 a_o t \leqslant A / 2\) and a derivative-bound structure \(\Xi\) (Utopia) with the following properties in every sector at \(x\), of width \(o.K\), cutoff \(\chi\), and with the actual coarse flags.
Its nonpacket weights satisfy the rooted bound of III.10.2(b) with total \(\beta_F^r\). Its catastrophe probabilities, with trigger \(\xi / 2\), are at most \((\text{rad}^2)^{\sharp v}\).
Let \(V (y)\) be a family of coarse fields on a finite-dimensional real normed parameter space, based at the sector field \(V (y_0) = V_0\). Suppose each link matrix is \(C^i\) at \(y_0\) and
where \(c_G\) is the fixed matrix-norm bound in Mode. Transport the fluctuation coordinates compatibly with this family: the physical and Gaussian coordinates represent the same field, their physical displacement has all derivatives through order \(i\) bounded by \(q (x)\), and, near \(y_0\), the resulting fine field agrees with the held fine field on every cold bond and on every hot bond whose physical coordinate has norm at most \(8 a_o t\) (YM.ConnectedActivityE6.Blaze.Silica.Clutch). In a region disjoint from the coarse flags, each letter \(a_j\) is \(C^i\) at \(y_0\) and satisfies
(Brush). Packet spans are one; other spans include their support and path lengths. The costs use the packet estimate and the nonpacket weights before extracting the catastrophe-probability factor.
The same \(\Xi\) satisfies an integrated estimate (Herd). Let \(\mathfrak{p}\) be a finite molecule with connected support-overlap graph and total support disjoint from the flags. Require that its packet stores are connected with pairwise disjoint radius-\(hB\) neighbourhoods, that its old forced supports are pairwise disjoint, and that every site in an old forced inventory touches a fine-plaquette seed in the union of the packet stores. Along a family \(V (y)\) as above, the prescribed transported integrand is \(C^i\) at \(y_0\) and has every derivative of order at most \(i\) bounded by an integrable function \(g\). With \(d \nu = d \lambda_F \hspace{0.17em} d \gamma\), the product of tree-slice Haar measure and Gaussian fluctuation measure,
The fares include a factor \(\text{rad}\) for each distinct warning address. For one measurable, gauge-invariant source letter of amplitude at most \(w_M\), local with its eligibility tests included, the same estimate replaces its fare by \(w_M\). A forced source must vanish outside the original eligibility set; a regular source occupies an unused regular-letter address. The remaining warning and shape factors are unchanged.
Status: theorem, conditional on the input bound bundle and compatibility. The constants and functions are uniform in the volume. Captain and rocketsC also control iterated left derivatives in spatially weighted directions.
Lean: Utopia.whittle (letter jets), timing (integrable majorants).
Proposition III.10.4 (Gaussian sector of the step). Fix a patch \(D\), a request \(Q\) for which \(D\) satisfies the branch condition, an aperture \(B_0 > 0\), a sector cutoff \(\chi\), and \(k, p \in \mathbb{N}\). There are \(\sigma, d > 0\) and \(\pi \geqslant 1\) (Charges) such that the following holds for all large \(x\).
Take \(0 < \beta \leqslant 2 \beta_F\), a budget point of power \(p\) and threshold \(t_c (x)\), a step on \(D\) with \(c \geqslant 100 (1 + B)\) admissible for \(Q\), a forest, tags, and a store \(A\) whose flags equal the flags of \(V\) on the whole coarse torus. Freeze \(A\), the forest and tags while differentiating. Let \(\Gamma\) be the sector precision matrix, \(\tilde{\Gamma}\) its local approximate inverse, \(m\) the smooth sector mean at aperture \(B_0 t\), and \(h = - g^{- 1}\) times its stationarity residual, with \(g = \beta^{- 1 / 2}\). These are the objects in Value. Then \(\Gamma\) and \(\tilde{\Gamma}\) are positive definite, and \(m\) equals the stationary logarithmic mean for every frozen-link input.
For a coarse site \(o\) and \(0 \leqslant m \leqslant k\), let \(\mathcal{D}^m\) be an iterated left derivative in \(m\) directions satisfying \(|A_e | \leqslant t_c (x) (1 + \text{dist} (e, o))^p\). If \(x_i\) is the coarse location of coordinate \(i\), put
The bounds are
Thus the spatial exponent at derivative order \(m\) is \(pkm\).
Status: theorem. JointLoad.stage also supplies a covariance cap and a trigger-tail estimate; its scales are given in §7.
Lean: JointLoad.capital.
Proposition III.10.5 (schedule).
(a) Let \(P\) be a sheet of pre-\(L\) data (III.2) and \(K\) a price map. There are floors \(k_i\) with the following property. Take block factors \(L_i \geqslant k_i\), any protection, any delays \(V\) and any \(m \geqslant 0\). Then there are delays \(W\), differing from \(V\) only by larger entry couplings \(\beta^{\ast}_i\), and numbers \(F_{ij} \geqslant m\), such that for every pair of stages \(P. \text{first} \leqslant j \leqslant i \leqslant j + 1\) the bound of III.10.1 holds at every coarse coupling \(x \geqslant \beta^{\ast}_i\), for the request with fine stage \(i\), coarse stage \(j\) and step index \(i\), with block factor \(L_i\), aisle multiplier \(F_{ij}\) and some \(\mu_{ij} > 0\) uniform in \(x\), period and volume (Ringing).
(b) If \(G\) is simple, then for every window datum of III.2 (entry and plateau requirements) there is a level schedule that meets all requirements of III.2 (Paid) and whose periods are divisible: for every side \(c\) and every \(z\) there is a period index \(p \geqslant z\) with \(c \mid \text{period} (p)\).
(c) Along a directed trajectory satisfying (a), fix an adjacent stage pair \(i = J (m)\), \(j = J (m + 1)\) with \(P. \text{first} \leqslant i\). There is \(\mu > 0\), uniform in the cutoff \(N\), level \(m\) and period, such that for \(m < N\) at this pair and \(x = \hat{\beta}_m\), one has \(\mu \hspace{0.17em} t_c (\hat{\beta}_{m + 1})^2 \hspace{0.17em} \sharp A \leqslant \mathcal{E}_A\) whenever the fine field is in the chosen tree gauge and the store is consistent at multiplier \(F_{ji}\).
Status: theorems. Part (a) is unconditional (pressure_pricing applies Bid.pricing_order to III.10.1). Divisibility is what lets torus tilings fit in III.12–III.13.
Lean: Wait.engine, notation_ticket.
Proposition III.10.6 (start-up fusion H01–H04; markers I01–I04).
(H) Setting. Fix a budget point and:
a pipe \(X\): regular and forced addresses, and supports of logarithmic letters;
a tap \(d\): regular activities, forced activities \(K_i\) and logarithmic letters \(\ell_i\).
The fused gas (fused) groups the forced activities and the factors \(e^{\ell_i} - 1\) into connected clusters (pellets). Each pellet contains at least one forced activity, and the forced supports in a pellet are pairwise disjoint.
Hypotheses. Fix a bijective enumeration of the pellets. Let \(\kappa, \gamma \geqslant 0\).
\(d\) is digested (Digests): the gas is valid with specified regular and forced bounds; the logarithmic family has a summable uniform majorant, and each letter is measurable, gauge invariant, local with the flag tests included, vanishes on healthy configurations, and is translation and lattice-symmetry covariant.
\(d\) is bought with constants \(\kappa, \gamma\) (Buys): \(|K_i | \leqslant e^{- \kappa} f_i\) and \(|e^{\ell_i} - 1| \leqslant f_i\), where \(f \geqslant 0\) satisfies the rooted Kotecký–Preiss condition at support exponent one larger than the budget exponent, with total \(\gamma\), and \((2 B + 1)^4 \gamma \leqslant 1\).
Conclusions.
(H01) For every configuration \(V\), the fused gas equals the original gas times \(\exp (\sum_{i = 0}^{\infty} \ell_i (V))\).
(H02) The fused activities satisfy the \(K\)-bound with any price \(v \geqslant e^{- \kappa} (e^{\gamma} - 1)\).
(H03) The fused system is a forced family and admits the lattice-symmetry moves.
(H04) Fix the paths, clip, budget point, addresses and pellet enumeration. Suppose the original representations form a continuous curve on a subset of \(\mathbb{R}\), each forced or exponentiated logarithmic letter varies continuously in the supremum norm over configurations, and a single nonnegative rooted majorant as above works throughout the parameter set. Then the fused representations form a continuous curve in the same representation norm. This is a fixed-volume assertion.
(I)
(I01) Let \(B \geqslant 8\), let \(F\) be a set of at least two markers with pairwise separation at least \(B^2\), and let \(F \subset H\). Then \(B \hspace{0.17em} \sharp F \leqslant 64 \hspace{0.17em} N_B (H)\), where \(N_B (H)\) is the minimum number of radius-\(B\) balls with connected union covering \(H\). The markers lie on a finite periodic lattice with its max-distance; no nonwrapping hypothesis is required.
(I02) Fix a representation with budget order \(n\). Suppose marker bands satisfy YM.Mix.Stubs.Holds at \(r > 0\): valid local addresses, \(r\) times every unit amplitude at most one, \(B \geqslant 8\) and separation at least \(B^2\) for each pair of distinct markers, factorially weighted derivative majorants, and separate rooted budgets at most one for single-marker and multiple-marker terms. For the multiple-marker budget one may instead use positive weights \(t_v\) and an extra exponent \(\delta \geqslant 0\), with \(r \leqslant t_v e^{\delta B / 64}\) for every marker \(v\) and a rooted budget at most one using support exponent increased by \(\delta\). Then, at weight \(r / n!\), the bands satisfy YM.Overlay.Bands.Radial: positive weights, unit-amplitude bound one, and rooted ordinary derivative and forced-entry bounds at most two each.
(I03) Let a family satisfy the marker schedule condition: \(B_{r + 1}^2 \leqslant 2 B_r^2\) for every \(r\), and \((L_r B_r^2)^4 \mathcal{F}_{r + 1} = o (\text{scale}_{r + 1})\). Here \(a_r\) is the lattice spacing, \(L_r = a_r / a_{r + 1}\), and the vacuum bound is
with \(P_r\) the stage's path budget, \(\alpha_r\) its direct clip coefficient and \(d_G = \dim_{\mathbb{R}} M_m (\mathbb{C})\) for the defining matrix representation. This is the hypothesis of YM.Stock.Tabs. Fix \(k \geqslant 1\) and levels \(m \leqslant i\) such that \(kB_i^2 \leqslant a_m / a_i\) (an open stop). For every \(N \geqslant i\) and every period, the centred copies at level \(N\) are the embedded sites from level \(m\); their parents agree at consecutive levels from \(m\) to \(N\); and distinct embedded sites are separated by at least \(kB_r^2\) for every \(i \leqslant r \leqslant N\).
(I04) Assume \(G\) is simple. For every family, every \(p > 0\) and \(r \in \mathbb{N}\), if \(\text{order}_i ! \leqslant \text{columns}_i\) for all \(i\), then the widths
are positive, and for every \(\varepsilon > 0\) eventually \(5 - \log (w_i / \text{order}_i !) \leqslant \varepsilon \hspace{0.17em} \text{scale}_i\).
Status: theorems. In the main-theorem closure:
H01–H04 are used by the start-up representation at the finest level;
I01, I03 and I04 are used by the replicated-marker constructions;
the assemblies Oust.begins and Bid.installs are not in the closure.
Lean:
Proofs: H01.gathered, H02.answer, H03.fused_forcedFamily, H04.answer, I01.answer, I02.answer, I03.answer, I04.answer.
From other units.
III.1 (block-spin step and gauge fixing).
The step data: patch, kernel choices, tree gauge, predictor \(Q\) and tags.
The definitions of request, admissible tube, store, consistency and action gap, including the identity Tube.locates.
The branch condition. It is proved for the kernel choices of the construction by Foundations.branches (from Axial.viable) and is carried by every sheet (Sheet.has).
With usable tags at the base site, the curvature bound for the predictor qdc:
\(|Q_p | \leqslant C_Q L^{- 2} \hspace{0.17em} \text{port} (x, U)\);
\(|V_p | \leqslant \sum_{b \subset \partial p} w_b + C_Q L^{- 2} \hspace{0.17em} \text{port} (x, U)\).
Here \(\text{port} (x, U)\) is the sum of the fine \(|U_q |\) over the macro box of the coarse site \(x\). Block averaging reduces curvature by \(L^{- 2}\).
III.2 (constants and schedule): sheets, block factors, protection, delays, bar and waits. The target data precede the block choice; the per-step window constants are chosen in III.10.2.
III.3 and III.4 (free kernels, Gaussian integration): the towers, their flat identities and exponential decay (III.3 attribution probable); the Gaussian tail bound rectangle, which for covariance at most \(M\) reads \(\Pr (| \xi_i | > s \forall i \in X) \leqslant 2^{|X|} e^{(- \nu s + M \nu^2 / 2) |X|}\) for every \(\nu > 0\).
III.5 (cluster expansion): polymer norms, budget points, representations of the effective density, Kotecký–Preiss sums.
III.6–III.8 (stationary branch, matching, connected activities): the stationary mean and its jets, the quartic matching of the path data, and the locality of connected activities.
III.9: the slope \(b_G\), the thresholds, the monitor and the incoming allowances. III.9 supplies the fine-level density representation and consumes the activity bounds; the norm conversion remains to be written out (§7).
I.1, II.2, III.16: lattice, Haar measure, chordal distance, polymer activities, Taylor jets.
Standard mathematics. The analytic method is Balaban's lattice-gauge renormalization group. Relevant references are Renormalization group approach to lattice gauge field theories, I, CMP 109 (1987), 249–301, II, CMP 116 (1988), 1–22, and Large field renormalization, I, CMP 122 (1989), 175–202, II, CMP 122 (1989), 355–392. The summability estimates use rooted polymer bounds of Kotecký–Preiss, CMP 103 (1986), 491–498, tree-graph estimates, Schur's test, Gaussian exponential moments, and Taylor estimates on compact charts. Exact correspondences with Balaban's lemmas remain open (§7).
Imported constants and assumptions.
The request and target data precede \(L\). The window constants in III.10.2 are chosen after \(L, W\) and the patch, before the threshold in \(x\). Simplicity of \(G\) is required by III.10.5(b) and I04.
The following are internal choices of the proof: the exponent \(49 / 100\) in \(T\); the factor \(10^{- 5}\) in \(R\); the hysteresis thresholds \(t / 4\), \(t / 2\), \(Wt\), \(2 Wt\); and the radii \(5 B\), \(2 B\), \(4 B / 5\), \(2 B / 5\), \(30 B\).
The incoming bounds on the fine activities (\(\beta_F^{- 11 / 10}\), \(e^{- M^{1 / 5}}\), \(2 M\)) are hypotheses supplied by III.9.
The method combines large-field suppression with Gaussian integration in the small-field region. Seeds record the fine plaquettes, mismatches and coarse flags that exceed their thresholds. The deterministic estimate gives an action cost \(\kappa t^2\) per seed. Since \(\beta \geqslant \beta_F / 2\), its Boltzmann factor is at most \(e^{- (\kappa / 2) e^{2 (\log \log \beta_F)^2}}\). This pays every fixed polylogarithmic entropy loss and is smaller than every inverse power of \(\beta_F\), while \(t = \beta_F^{- 1 / 2 + o (1)}\) remains perturbatively small.
An exact completed-square decomposition separates the fine, interior, coarse and gauge contributions from two kernel defects. Large \(L\) makes the fine prediction small; large \(W\) separates mismatch seeds from the interior prediction. Coarse plaquettes above a fixed threshold lie near spent seeds, whose larger cost \(tT\) pays the affected-cell losses. Away from those seeds, local gauge fixing and the flat tower identities reduce the defects to chart errors and exponentially small kernel tails. Summation over a radius-\(B\) neighbourhood still leaves an error \(o (t^2)\) per seed.
The resulting gas has packet, old forced, logarithmic and warning letters. The energy bound and annulus estimate control packets; Gaussian tails control warnings. Rooted support bounds and tree-graph estimates sum connected molecules. Derivatives are taken with sector data fixed and fluctuation coordinates transported compatibly. The Leibniz rule controls products, and Cauchy–Schwarz retains the square root of the simultaneous-warning probability when integrating their jets.
Unless a lemma gives different hypotheses, the energy estimates in §§4.2–4.6 use the step, tube, forest, fields, tags and consistent store of III.10.1. A sufficiently large threshold in \(x\) may depend on the fixed request, \(L, W\), and any additional parameters already chosen, but never on the period. Row and column bounds refer to sums of operator norms; vector bounds are pointwise in the coordinate index. Distances are native torus max-distances.
Lemma 4.1 (completed squares). Notation:
\(v = v (V)\) are the coarse coordinates (vision). For each coarse plaquette \(q\) they are the pair \((\sqrt{\alpha_c} \hspace{0.17em} \text{curv} (V_q), \ell_q (V))\), with the first component multiplied by \(\min (1, t_c / |V_q |)\), interpreted as one when \(|V_q | = 0\), and the second set to zero unless \(q\) is kept. Let \(d_F, d_c\) denote the clipped densities of §1.
\(X (U)\) and \(X^c (V)\) are the unthinned fine and coarse coordinates.
\(Z_b = \sqrt{a} \hspace{0.17em} \text{curv} (V_b Q_b^{- 1})\).
The rows are:
fine plaquette \(p\): \(d_F (U, p) + \tfrac{1}{2} | (\Phi v)_p |^2 - \langle (\Phi v)_p, X_p \rangle\);
coarse bond \(b\): \(\tfrac{a}{2} w_b^2 + \tfrac{1}{2} | (\Phi' v)_b |^2 - \langle (\Phi' v)_b, Z_b \rangle\);
coarse plaquette \(q\): \(\langle v_q, X^c_q \rangle - \tfrac{1}{2} |v_q |^2 - d_c (V, q)\);
gauge coordinate \(n\): \(\tfrac{1}{2} | (Nv)_n |^2\);
defects at \(q\):
the linear-defect contribution \(\langle v_q, (\Phi^{\ast} {X + \Phi'}^{\ast} Z - X^c)_q \rangle\);
the completeness-defect contribution \(\tfrac{1}{2} \langle v_q, (v - (\Phi^{\ast} {\Phi + \Phi'}^{\ast} \Phi' + N^{\ast} N) v)_q \rangle\).
Their sum over the torus is \(\mathcal{A}_F (U) + \frac{a}{2} \sum_b w_b^2 -\mathcal{A}_c (V)\). The functional \(\mathcal{E}_A\) keeps only the rows located in \(D_{2 B} (A)\).
Proof: adjointness for the three kernels; all cross terms cancel. The cancellation is algebraic and works for any coarse coordinate vector \(v\) if the rows are defined with that vector.
Lean: Tube.locates; rows workF, workI, workC, workN, workL, workD.
Lemma 4.2 (packing; E01). For every \(\delta > 0\) there is \(N\), depending on \(P\) and \(\delta\) but not on \(L\) or \(W\), such that for all \(L\), all \(W > 0\), all large \(x\) and all admissible data with \(A\) consistent:
(i) for every coarse site \(y\), \(\text{port} (y, U) = \sum_q m (y, q) |U_q |\) with nonnegative integer charges \(m\) satisfying \(\sum_y m (y, q) \leqslant N\), and \(m (y, q) > 0 \Rightarrow \text{dist} (y, \bar{q}) \leqslant N\);
(ii) every coarse plaquette of \(D_{2 B} (A)\) with \(|V_q | > \delta\) (a tide) lies within \(4 B / 5\) of \(A^{\text{sp}}\) (the hit set);
(iii) \(\sharp A_{\flat} \leqslant 4 \hspace{0.17em} \sharp \{q \in D_{2 B} : |V_q | > t_c \}\);
(iv) \(\sharp \{ \text{tides} \} \leqslant N \sharp A^{\text{sp}}\);
(v) the coarse plaquettes of \(D_{2 B} (A)\) number at most \(NB^4 \sharp A\), and the hit set at most \(NB^4 \sharp A^{\text{sp}}\).
Proof: the macro box has radius \((j + 7) L\). Counting possible parent sites gives a bounded total multiplicity for each fine plaquette. If no spent seed is within distance \(j + 8\) of a coarse plaquette, consistency bounds every relevant input by \(T\); the predictor-curvature bound then gives \(|V_q | \leqslant C (L, W) T \leqslant \delta\) for large \(x\). Thus every tide has a nearby spent seed, and \(j + 8 \leqslant 4 B / 5\) eventually. A flag is incident to a coarse plaquette above \(t_c\); each plaquette has at most four incident sites. Four-dimensional ball counts give the remaining bounds.
Lean: Bid.E01 (Payments, MacroStore), Work.E01.answer.
Lemma 4.3 (shell comparison; E02). For every gauge group \(G\), block factor \(L\), index \(j\) and kernel choices \(K\), there is \(C > 0\) with the following property. Take a step using \(K\), block factor \(L\) and index \(j\), whose fine side is at least \(100\) times the macro radius, with \(c > 1\); any \(U\) in the tree gauge; any \(V\); and any fine link \(e\) with usable tags. Then
where \(\tilde{V}\) is the replica of \(V\) on fine links and \(\bar{e}\) the parent block. The last term is present only when the ends of \(e\) lie in different blocks.
Sketch: close \(e\) by the two tree paths, lift the loop to \(\mathbb{Z}^4\), and bound the chord of the product by the sum of chords along a walk whose length is bounded by the macro budget. For a crossing link, the predictor estimate controls the discrepancy between the two block roots; the triangle inequality then adds the coarse mismatch \(w_b\).
Lean: Bid.E02, Work.E02.answer.
Lemma 4.4 (rows and columns; E03). There is \(A > 0\), independent of \(L\) and \(W\), such that:
\(\Phi\) has row sums at most \(A / L^2\) and column sums at most \(AL^2\);
\(\Phi'\) and \(N\) have row and column sums at most \(A\);
all entries vanish beyond distance \(B / 50\).
Take absolute values of the cover coefficients. Adjoint transport has norm one, periodization charges each cover term once per row or column, and the fine residue multiplicity is \(L^4\) (anchored_of_terms).
Lean: Bid.E03 (Allowance), Work.E03.answer.
Lemma 4.5 (path series and predictions; E04, given E03). There is \(A > 0\), independent of \(L\) and \(W\), such that, with \(s = t\) at the fine stage and \(s = t_c\) at the coarse stage:
the fine and coarse path series have absolute row and column sums at most \(A\) and range at most \(B / 50\);
\(| \ell_p (U) | \leqslant \sum_q c_{pq} |U_q |\) for the nonnegative absolute path coefficients \(c_{pq}\), and \(| \ell_p | \leqslant As\) on kept plaquettes;
\(|v| \leqslant At\), \(| \Phi v| \leqslant At / L^2\) and \(| \Phi' v| \leqslant At\).
Proof: sum the absolute path coefficients with their exponential length weights. Periodization gives the column count; the kept test bounds each contributing plaquette by the threshold times the same exponential weight. Thinning bounds the coarse coordinates, and the row estimates of Lemma 4.4 bound their predictions. The comparison \(t_c (x) \leqslant 2 t\) holds eventually at fixed \(L\).
Lean: Bid.E04 (LaneCounts, Maximum), Work.E04.answer.
Lemma 4.6 (coarse rows; E05). There are \(\delta, B_1 > 0\), independent of \(L\) and \(W\), such that for every coarse plaquette with \(\tau = |V_q |\):
\(t_c < \tau \leqslant \delta\) implies row \(\geqslant \frac{\alpha_c}{4} t_c \tau\);
\(\tau \leqslant t_c\) implies row \(\geqslant - B_1 t_c^4\);
\(\tau > \delta\) implies row \(\geqslant - \lambda_c t_c \tau\).
Sketch: in matrix space the curvature is the tangential projection of \(V_q - 1\), so \(\chi^2 - | \text{curv} |^2\) is the squared normal displacement divided by the fixed matrix-to-colour normalization, which is \(O (\chi^4)\) in a tubular neighbourhood of \(G\).
The path component cancels whether kept or dropped. For \(\tau \leqslant t_c\) the direct component is unthinned, and the row equals \(- \frac{\alpha_c}{2} (\chi^2 - | \text{curv} |^2)\).
For \(t_c < \tau \leqslant \delta\) the row is \(\geqslant \alpha_c t_c \tau (1 - O (\delta^2)) - \frac{\alpha_c}{2} t_c^2 - \lambda_c t_c \tau \geqslant \frac{\alpha_c}{4} t_c \tau\), using \(\lambda_c < \alpha_c / 16\).
Lean: Bid.E05 (Crowds), Work.E05.answer.
Lemma 4.7 (fine and interior rows; E06, given E03, E04). There is \(L_1\) such that for every \(L \geqslant L_1\) and every \(W \geqslant 2 A / \sqrt{a}\) (with \(A\) from E04), for large \(x\), with \(d = \alpha_F / 128\):
Proof:
Costs with \(|U_p | \leqslant t\). The direct part of the fine row is at least \(\frac{1}{2} (\sqrt{\alpha_F} |U_p | - | (\Phi v)_p |)^2\). For a cost, \(|U_p | \geqslant t / 4\), while \(| (\Phi v)_p | \leqslant At / L^2 \leqslant \sqrt{\alpha_F} t / 8\) for \(L \geqslant L_1\); this gives \(\alpha_F t^2 / 128\).
Costs with \(|U_p | > t\). The clipped action is \(\lambda_F t |U_p |\), and the cross term is at most \(AL^{- 2} \sqrt{\alpha_F} t |U_p | \leqslant \frac{\lambda_F}{4} t |U_p |\).
Path-series part. It is a complete square on kept plaquettes. On dropped plaquettes the cross term is paid by the column bounds of E04, at total cost \(\frac{\lambda_F}{4} t \sum |U_p |\); this works only after summation, not row by row.
Aisles. On an aisle \(w_b \geqslant Wt\) and \(| (\Phi' v)_b | \leqslant At \leqslant \frac{\sqrt{a}}{2} w_b\), so the row is at least \(\frac{1}{2} (\frac{\sqrt{a}}{2} w_b)^2 = \frac{a}{8} w_b^2\).
Unlisted rows. Interior rows are nonnegative by the same square lower bound. Unlisted fine direct parts and kept path parts are nonnegative; the dropped path parts are included in the summed loss above.
Lean: Bid.E06 (Seals), Work.E06.answer.
Lemma 4.8 (affected cells; E07, given E01, E03, E04). For every fixed \(\delta > 0\) there is a pre-\(L\) constant \(C_7 > 0\), and for every \(L\) and \(W > 0\) a constant \(Z\), such that for large \(x\):
Proof:
By qdc, on the hit set \(|V_q | \leqslant r_0 t + H_q\). The macro excess \(H\) is bounded, through the charges of E01, by a pre-\(L\) constant times \(L^{- 2} \sum_{\text{swell}} |U_p | + \sum_{A_I} w_b\).
The defect rows on hit cells are bounded below by Cauchy–Schwarz, using \(|v| \leqslant At\) and the kernel bounds of E03–E04. The inputs \(X\), \(Z\), \(X^c\) split into a uniform part, \(O (t)\) per cell, and the excess.
The uniform part is paid by \(Zt^2 \sharp \text{hit} \leqslant ZNt^2 B^4 \sharp A^{\text{sp}}\); the excess is paid by the two middle terms.
No cancellation of linear terms is used.
Lean: Bid.E07 (Lapse), Work.E07.answer.
Lemma 4.9 (unaffected cells; E08, given E01, E02). For every \(L\) and \(W > 0\) there is \(C\) such that for large \(x\) the following holds. For every coarse plaquette \(q\) of \(D_{2 B} (A)\) outside the hit set there is a gauge transformation \(z\) with:
\(\chi (V^z_b) \leqslant h := CB^{10} T\) for all coarse bonds within \(2 B / 5\) of \(q\);
\(\chi (U^{z \circ \hspace{0.17em} \text{p*a*r*e*n*t}}_e) \leqslant h\) for all fine bonds whose parent is within \(2 B / 5\).
Sketch: there is no spent seed within \(4 B / 5\) of \(q\), so all tolls and wires near \(q\) are at most \(T\). An axial gauge on a box of the coarse cover, with E02 transferring the bound to fine links, loses a polynomial in \(B\).
Lean: Bid.E08 (Stitches), Work.E08.answer.
Lemma 4.10 (flat identities). Consider the linearized uncut kernels \(\Phi_0, \Phi_0', N_0\) (scalar matrices built from the towers), and the linearized inputs for log-fields \(u\) (fine) and \(v\) (coarse): \(X_0 (u)\) (face curls and path series of \(u\)) and \(Z_0 (u, v) = \sqrt{a_{\text{pen}}} \hspace{0.17em} (v - \text{probe} \hspace{0.17em} u)\), where \(a_{\text{pen}}\) is the penalty. Under the admissibility identities and agreement of the beds with the fine and coarse path data, for every \(u, v\) and every coarse two-layer vector \(w\),
Proof: the flat tower identities, applied componentwise to the scalar matrices and the attached path data.
Lemma 4.11 (chart estimates on the torus). For a patch \(D\) satisfying the branch condition there are \(C, \tau, r > 0\) with the following property. For every admissible step on \(D\), all tags, all \(R\), and all log-fields \(a\), \(b\) with \(\|a\|, \|b\| \leqslant h \leqslant r\), set \(U = \exp a\) and \(V = \exp b\). Define the defect vectors \(\mathfrak{l}= \Phi^{\ast} X + (\Phi')^{\ast} Z - X^c\) and \(\mathfrak{d} (w) = w - (\Phi^{\ast} \Phi + (\Phi')^{\ast} \Phi' + N^{\ast} N) w\). At every coarse plaquette, componentwise in its two coordinates,
\(\|\mathfrak{l}\| \leqslant Ch \hspace{0.17em} \omega\);
\(\|\mathfrak{d}(w)\| \leqslant Cq \hspace{0.17em} \omega\) whenever \(q \geqslant 0\) and \(\|w\| \leqslant q\).
Here \(\omega = \omega (R, h, \tau) = (1 + R) h + e^{- \tau R}\) (widen).
Proof: compare every actual object with its linearization, then subtract Lemma 4.10.
Kernels: they are close to their flat versions (kernel_chart_cost).
Path-series coordinates (x_chart_cost):
transporting a curvature of size \(O (h)\) along a path of length at most \(R\) costs \(O (Rh \cdot h)\);
the paths longer than \(R\) are paid by the weight \(e^{\sigma \hspace{0.17em} \text{l*e*n*g*t*h}}\) in the path budget, which gives \(e^{- (\sigma / d) R}\).
Predictor coordinates: quadratic error (z_chart_cost).
Lean: global_chart_cost.
Lemma 4.12 (interior cost). For the same \(D\) there are \(C, \tau, r > 0\) with the following property. Suppose that in some gauge \(z\) both \(U\) and \(V\) are within \(h \leqslant r\) of the identity on all bonds within distance \(3 R + 4 + \text{reach}\) of a coarse plaquette \(q\), where \(\text{reach}\) is the predictor reach and \(h \geqslant 0\). The step must be on \(D\) and admissible for \(P\); the tags and cut length \(R \in \mathbb{N}\) are arbitrary. Then the bounds of Lemma 4.11 hold at \(q\) for every coarse coordinate vector bounded by a nonnegative constant.
Proof:
Gauge covariance: the defect vectors transform by \(\text{Ad} (z_q)\) (gauge_gaps).
Locality: the defect vectors depend only on nearby bonds (local_gaps).
Extension: a configuration that is \(h\)-close to \(1\) on a ball agrees there with \(\exp\) of a global log-field of norm \(O (h)\) (extend_interior).
Apply Lemma 4.11.
Lean: interior_cost.
Lemma 4.13 (unaffected defects; EBare). Assume E03, E04 and the conclusion of E08 at \((P, L, W)\). Then for every \(\varepsilon > 0\) and all large \(x\), the sum of the defect rows over the unhit coarse plaquettes of \(D_{2 B} (A)\) is at least \(- \varepsilon t^2 \sharp A\).
Proof:
Take \(h = CB^{10} T\) from E08 and \(\omega = \omega (R, h, \tau)\). Lemma 4.12 applies, since \(3 R + 4 + \text{reach} \leqslant 2 B / 5\).
Cauchy–Schwarz with \(|v| \leqslant At\) gives, on every unhit cell, defects at least \(- \ell\), where \(\ell = 2 (At) (Ch \omega) + (At) (CAt \hspace{0.17em} \omega)\).
There are at most \(NB^4 \sharp A\) such cells (E01 with \(\delta = 1\)).
\(NB^4 \ell \leqslant \varepsilon t^2\) for large \(x\), because \(B^n \omega \to 0\) and \(B^n h \omega / t \to 0\) for every \(n\) (radius_stitch_errors). Indeed \(h = \beta_F^{- 0.49 + o (1)}\), \(h^2 / t = \beta_F^{- 0.48 + o (1)}\), and \(e^{- \tau R} \leqslant \beta_F^{- 1}\) because \(R \asymp (\log x)^2\).
If no patch with the request's data satisfies the branch condition, the statement is vacuous.
Lean: Bid.EBare (Belly), Fluctuations.bare.
Lemma 4.14 (assembly; E09). For a fixed request, the packing estimate of Lemma 4.2, fine/interior bounds of Lemma 4.7, coarse bounds of Lemma 4.6 at some \(\delta > 0\), affected-cell bound of Lemma 4.8 at that \(\delta\), and unaffected-cell bound of Lemma 4.13 for every \(L, W > 0\), imply III.10.1.
Choice of constants:
\(L \geqslant \max (L_1, L_7)\), where \(C_7 / L_7^2 \leqslant \lambda_F / 4\);
\(W \geqslant \max (1, 2 A / \sqrt{a}, 16 C_7 / a)\);
\(m = \min (\lambda_F / 8, \alpha_F / 128, a / 32, \alpha_c / 64)\) and \(\kappa = m / 2\); since \(\lambda_F < \alpha_F / 16\), this is the value in III.10.1;
\(x\) so large that: \(t_c \leqslant \delta\); \(t \leqslant T\); \(t \leqslant 2 t_c\); \((4 mN + ZB^4) t^2 \leqslant m \hspace{0.17em} tT\); \(B_1 t_c^4 NB^4 \leqslant \frac{m}{4} t^2\); and the unaffected-cell bound holds with \(\varepsilon = m / 4\).
Proof: add the rows.
Swell costs: \(\frac{\lambda_F}{2} t |U_p |\). Half of it pays the \(C_7 L^{- 2}\) term of Lemma 4.8; the remainder is at least \(2 mt^2\), and at least \(m \hspace{0.17em} tT\) when the cost is spent.
Other costs: at least \(\alpha_F t^2 / 128 \geqslant mt^2\).
Aisles: \(\frac{a}{8} w^2 - C_7 tw \geqslant \frac{a}{16} w^2 \geqslant mt^2\); spent aisles carry \(m \hspace{0.17em} tT\).
Tides: paid by Lemma 4.8.
Coarse plaquettes in the intermediate range: \(\frac{\alpha_c}{4} t_c |V_q | \geqslant \frac{\alpha_c}{16} t^2\), which pays \(4 mt^2\) per intermediate plaquette, since \(\sharp A_{\flat} \leqslant 4 (\sharp \text{intermediate} + N \sharp A^{\text{sp}})\).
Small coarse plaquettes: in total at least \(- \frac{m}{4} t^2 \sharp A\).
Gauge rows: \(\geqslant 0\).
Defects: on hit cells they are inside Lemma 4.8; on unhit cells they total at least \(- \frac{m}{4} t^2 \sharp A\).
Spent seeds: their \(m \hspace{0.17em} tT\) covers the flag charge against \(A^{\text{sp}}\) and the \(Z\) term.
The total is at least \(\frac{m}{2} t^2 \sharp A\).
Lean: Bid.E09, Work.E09.answer (with assemble and bank), Bid.issues.
The next estimates use the hypotheses of III.10.2. In statements about packets, logarithmic letters or warnings, the tube satisfies the compatibility condition, the input satisfies the stated fine-level bounds, and sectors have the actual coarse flags. Auxiliary window constants are fixed before the threshold in \(x\).
Lemma 4.15 (rate calculus). A function \(w\) has rate \(a\) if for every \(v > a\), \(|w (x) | \leqslant \beta_F^{\hspace{0.17em} v}\) eventually. Products of functions with rates \(a, b\) have rate \(a + b\); their sums have rate \(\max (a, b)\). Eventual absolute domination preserves a rate, and constants have rate \(0\). Thus \(t\) has rate \(- \frac{1}{2}\), and \(B\) and \(\text{bill}\) have rate \(0\).
Lean: Rate.
Lemma 4.16 (from the action gap to packet weights).
(a) There is \(L_0\) such that for all \(L \geqslant L_0\) and all large \(W\) there is \(\mu > 0\) with two properties. First, the bound of III.10.1 holds with constant \(\mu\) at all large \(x\) (Grant.order; here \(\mu\) is the \(\kappa\) of III.10.1). Second, fix any halo and nonnegative support exponent, \(d \in \mathbb{N}\), \(D \geqslant 0\), \(z < 2\) and \(u > 0\). For all large \(x\) and every \(\beta \geqslant u \beta_F\), the gain \(\beta \mu t^2\) passes the packet summability test for any spend at most \(D \hspace{0.17em} \text{bill}^d M^z\) and any nonnegative prefactor at most its exponential. The total packet charge is exponentially small in the retained gain. The threshold may depend on these additional parameters.
(b) Suppose the local sector and tag tests hold through radius \(300 B\), and the physical fluctuation on hot bonds is bounded by a nonnegative function of rate \(- 1 / 2\) through radius \(304 B\). On the annulus \(2 B < \text{dist} \leqslant 200 B\), every remainder row is at least \(- E (x)\) for some nonnegative \(E\) of rate \(- 3 / 2\) (Coat.annulus). After multiplying \(E\) by the annulus volume and fixed coordinate multiplicity, it still has rate \(- 3 / 2\). Consequently the assigned energy is at least \((\mu t^2 - E) \sharp A\) (Coat.earns). Since \(\beta E\) has rate at most \(- 1 / 2\), the loss is absorbed in \(\text{bill}^5\).
(c) In every manifest sector, \(| \text{Pack} | \leqslant \exp \left( (C \hspace{0.17em} \text{bill}^5 - \beta \mu t^2) \sharp A \right)\) (steam_prices).
((a) and (c) proof read; (b) statement only)
Lemma 4.17 (old and logarithmic letters). Fix \(- 1 / 2 < s < 0\) and any \(u \in \mathbb{R}\). Assume the sector drift and residual estimates, with a residual envelope of rate \(- 1\), as well as the common hypotheses of this subsection. For sufficiently large \(L\) and then all large \(x\), the old forced letters have a rooted bound with total \(\beta_F^u\), and all logarithmic letters have one with total \(\beta_F^s\). The latter include inherited regular activities, local Jacobians and Gaussian determinant corrections. The weights bound both \(| \ell_i |\) and \(|e^{\ell_i} - 1|\). Taking \(u = s\) gives the two totals used in III.10.2.
Proof: transport the incoming forced bounds to coarse supports, and split the logarithmic alphabet into inherited activities, Jacobians and Gaussian corrections. Their envelopes have rate \(- 1 / 2\) or smaller. Choose an intermediate rate strictly between \(- 1 / 2\) and \(s\) to absorb their finite sum, and use \(|e^z - 1| \leqslant 2 |z|\) once the individual logarithmic weights are at most one.
Lean: recommends.
Lemma 4.18 (window, drift, no new seeds). For each patch there are window constants such that, for large \(x\):
every manifest sector satisfies the Hessian conditions of III.10.2(a)(iii) (shoots);
the Gaussian centring drift is \(O (t)\) and the residual of its linear stationarity equation has an envelope of any prescribed rate, in particular \(- 1\) (YM.ConnectedActivityE6.Coat.tends_val);
there is \(\xi > 0\) with \(\sharp \{ \text{colours} \} \cdot \xi \leqslant 1\) such that fluctuations satisfying the radius-\(B\) window test create no seeds at sites farther than \(30 B\) from the given ones (Coat.ready).
Proof: exponential row bounds and coercivity give the precision estimate; the local-inverse error tends to zero and yields a positive covariance. Applying the approximate inverse to the linear term gives the centring drift and a small linear residual. For the no-new-seed assertion, choose \(\xi\) so the Gaussian fluctuation contributes at most one third of the available margin. Linear cancellation from the compatibility identities and the small nonlinear remainder pay the other two thirds. The fine and mismatch prediction bounds then give the strict thresholds \(t / 4\) and \(Wt\).
Lemma 4.19 (catastrophes). For every set \(v\) of warning addresses, the Gaussian measure of the catastrophe set is at most \(E^{\sharp v}\), with \(E\) eventually smaller than every power of \(\beta_F\). The threshold \(\xi t \sqrt{\beta}\) equals \(\xi e^{(\log \log \beta_F)^2} (\beta / \beta_F)^{1 / 2}\) in Gaussian units.
Proof: the covariance has a volume-independent Schur bound. Apply the Gaussian rectangle estimate to simultaneous coordinate excursions and sum the possible witnesses in each radius-\(2 B\) neighbourhood. The resulting envelope can be taken as \(CB^4 e^{- cM^{1 / 2}}\), where \(M = e^{(\log \log \beta_F)^2}\) and \(c > 0\). It is smaller than every inverse power of \(\beta_F\). Repeated warning locations are paid through the fixed multiplicity bound.
Lean: Coat.alarm_bills.
Lemma 4.20 (assembly of III.10.2). The preceding estimates imply III.10.2 with the following parameter choices.
The floor on \(L\) is the sum of the floors from Lemma 4.16(a), the no-new-seed margin, and Lemma 4.17.
\(W\) is taken large for the energy estimate and the no-new-seed margin; \(\mu\) comes from Lemma 4.16(a) and does not depend on the patch.
For each patch:
\(K, \gamma\) come from the shell comparison;
the window constants from the precision estimate;
the drift constant \(C_d\) from the centring estimate, and \(a_o = \max (C_d + 1, \gamma K)\);
\(\xi\) from the no-new-seed estimate;
\(C\) from the packet estimate;
\(s\) is chosen with \(- \frac{1}{2} < s < r\).
All conditions holding for large \(x\) are merged into one threshold. The three letter totals have rate \(s < r\), so their sum is eventually at most \(\beta_F^{\hspace{0.17em} r}\).
Lean: Target.issue.
Lemma 4.21 (letter jets). Under the hypotheses of III.10.3, the letter-jet structure exists before integration. Choose \(- 1 / 2 < s < r\) and set \(\text{rad} = \beta_F^s\). The warning amplitude before probability extraction is a patch constant. The jet scale is a sum \(\rho (x) = B_0 (x) + A_0 (x)\) of two rate-zero envelopes, chosen independently of the input representation and volume.
Proof: combine the packet-jet estimate, the old and logarithmic letter estimates, and the differentiated warning cutoffs, all along compatible transported fluctuation coordinates. Choose the catastrophe envelope of rate \(2 s - 1\); its eventual bound by \(\beta_F^{2 s}\) gives the probability factor \(\text{rad}^2\). The three rooted letter totals have rate \(s < r\).
Lean: Utopia.whittle.
Lemma 4.22 (molecule integrals). The letter bounds of Lemma 4.21 imply the integrated majorants of III.10.3, for the compatible connected molecules specified there.
Proof: the Leibniz rule for Brush adds the letter jet scales. Their sum is bounded by twice the molecule's shape, giving, for rate-zero transport envelopes \(U, J'\) and fixed integers \(k, K \geqslant 0\), a pointwise factor
The bound vanishes outside the catastrophe set for the molecule's distinct warning addresses. If that set is \(\mathcal{C}\) and its address set is \(v\), Cauchy–Schwarz gives
where \(e\) has rate zero. Integration over the probability measure on the tree slice adds no factor. Multiplying by the pointwise coefficient gives a rate-zero prefactor \(p\) and shape power \(l = K + i\). For a marked source, remove its ordinary fare and insert its amplitude bound.
Lean: timing.
Lemma 4.23 (H01–H04). Under the respective hypotheses in III.10.6(H), the four fusion conclusions hold.
H01 is the Mayer identity \(e^{\sum \ell_i} = \prod_i (1 + (e^{\ell_i} - 1))\), regrouped with the forced activities into pellets. Absolute domination of the original and logarithmic series justifies the product expansion and regrouping; the argument also proves summability of the fused series.
H02: retain one factor \(e^{- \kappa}\) from a forced letter in every pellet and use the rooted tree sum \(e^{\gamma} - 1\).
H03: transport every pellet support, inventory and eligibility test under each lattice symmetry. The local flag tests and the permutations of the original addresses induce those of the fused family.
H04: each pellet is a fixed finite product; a common summable envelope then gives continuity of the weighted series by dominated convergence.
(proof read for H01, H02 and H04; H03 forced-family proof read, symmetry moves statement only)
Lean: H01.gathered, H02.answer, H03.fused_forcedFamily, H04.answer.
Lemma 4.24 (I01–I04). Under the respective hypotheses in III.10.6(I), the four marker conclusions hold.
I01: traverse the centres of a minimizing connected \(B\)-ball cover. Distinct markers force gaps of at least \(B^2 - 2 B\) between the traversal times of their covering centres. Comparing total traversal length with the number of balls gives the factor \(64\).
I02: I01 converts extra support decay to an increase of multiple-marker radii. Splitting single-marker and multiple-marker sums gives total two. Shrinking the radius by the order factorial converts factorially weighted derivative bounds to ordinary derivative bounds.
I03: centred embeddings compose and preserve the parent relation. The open-stop inequality persists to later levels because \(B_{r + 1}^2 \leqslant 2 B_r^2\) and each block factor is at least three.
I04 follows from columns_receipt: for every level schedule, \(\sum_{m < i} \log \text{columns}_{m + 1} = o (\text{scale}_i)\). Combine this with \(\log \text{order}_i ! \leqslant \log \text{columns}_i\) and \(\log \hat{\beta}_i = o (\text{scale}_i)\).
Lean: I01.answer, I02.answer, I03.answer, I04.answer.
Lemma 4.25 (pricing order). Under the hypotheses of III.10.5(a), the following choices produce its floors and raised entry couplings.
For each pair of adjacent stages, III.10.1 gives a floor \(b_{ij}\); set \(k_i = \max (b_{ii}, b_{i, i - 1}, \text{sheet floor}_i)\).
For \(L_i \geqslant k_i\), choose \(W \geqslant m\) in the admissible range and a threshold \(x_{ij}\).
Raise \(\beta^{\ast}_i\) to \(\max (\beta^{\ast}_i, x_{ii}, x_{i, i - 1})\).
The conclusion persists under further raising (recheck).
Lean: Bid.pricing_order.
Lemma 4.26 (divisible schedule). Under the hypotheses of III.10.5(b), the following construction gives a schedule satisfying all entry, plateau and divisibility requirements.
Entry couplings come from the bar (using \(G\) simple), leads from the wait data, and a monotone stage-index function \(J\) with steps at most \(1\) and \(J \to \infty\) by the finite-request scheduling lemma of III.2.
The scales are \(s_i\); the initial length \(M\) is the minimal length plus the largest bill over the first stages; the periods are \(4 (M + p + 1)\).
The checks:
\(\hat{\beta}_m \geqslant\) the bar value, and \(\hat{\beta}_m \geqslant \beta^{\ast}_{J (m + 1)}\);
the scale entries;
the volume inequalities: \(\text{shells} \cdot (1 + B_i + B_{i + 1})^{\text{growth}} \leqslant\) side, \(100 (B_i + 1) \leqslant\) side, and \(100 (\text{patch radius} + 1) \leqslant\) next side;
the mesh condition \(\log L_{J (i + 1)} / s_i \to 0\);
divisibility: \(p = c (M + z + 1) - (M + 1)\) gives the period \(4 c (M + z + 1)\).
Lean: Wait.engine.
The energy estimate must preserve \(L\)-independent coefficients on the large fine inputs and \(W\)-independent coefficients on the mismatches. The fine prediction is \(O (t / L^2)\), so increasing \(L\) absorbs its cross terms. The interior prediction is \(O (t)\), so increasing \(W\) absorbs the mismatch cross terms. Losses depending on both \(L, W\) are charged to spent seeds and absorbed only by increasing \(x\).
On unaffected cells, the transported, truncated kernels have no exact completeness identity. The flat identity cancels the linear part, while local gauge fixing, chart estimates and exponential tails control the remaining defects. This is the unaffected-defect estimate Bid.EBare. The constant \(\kappa\) is independent of \(L, W\); the coupling threshold is not.
The activity and derivative estimates additionally require compatible quadratic forms, controlled fluctuation transport and probability bounds for simultaneous warnings. Their product estimates retain one gain for each distinct warning address before the connected-molecule sum. The schedule is numerical; start-up fusion and marker estimates serve separate parts of the construction.
| Written proof | Lean (glossary) | Meaning |
| \(x = \hat{\beta}_m\), \(\beta_F = x + b_G \log L\) | betaF | coarse and fine reference couplings |
| \(t_c (x)\), \(t = t_c (\beta_F)\) | temp, fiery | small-field thresholds; fiery is at the fine coupling |
| \(T = \beta_F^{- 49 / 100}\) | largeT | spent-seed threshold |
| \(B\), \(R\) | radiusB, till | cluster radius \(\lceil (\log x)^2 \rceil\), path cutoff \(\lfloor B / 10^5 \rfloor\) |
| \(\lvert U_p \rvert\), \(w_b\) | toll, wire | plaquette size; mismatch \(\chi (V_b Q_b^{- 1})\) |
| request \(P\); admissible | Teller, Teller.Funds | data of one call of the step estimator |
| \(A = (A_F, A_I, A_{\flat})\), consistent | Stores, Stores.Plot | seeds; two-sided thresholds on \(D_{5 B}\) |
| \(A^{\text{sp}}\), tides, hit | spend, tides, hit | seeds above \(T\); coarse plaquettes above \(\delta\); cells near \(A^{\text{sp}}\) |
| \(\mathcal{E}_A\) | Stores.assessed | localized action gap |
| \(v\), \(\Phi, \Phi', N\) | vision, Φ, Φ', N | coarse coordinates; transported kernels cut at \(R\) |
| \(\Phi_0, \Phi_0', N_0\) | flatF, flatI, flatN | flat, uncut scalar tower operators |
| \(\omega (R, h, \tau)\) | widen | \((1 + R) h + e^{- \tau R}\) |
| rate \(a\) | Rate | \(\leqslant \beta_F^{a + o (1)}\) |
| target data \(\mathcal{T}\) | Target | \(\varepsilon, \delta, e\), rate \(r\), halo, chart |
| letter weights, KP condition | Sales, Buy | rooted Kotecký–Preiss and tree-graph tests |
| new-gas bounds | Cash, Utopia, Herd, Captain | III.10.2 bundle; letter jets; molecule integrals |
| \(N_B (H)\) | coverNumber | minimum connected ball-cover size |
| \(\rho (x)\), \(\text{rad}\) | Utopia.active, Utopia.rad | jet scale of rate zero; square root of a warning-probability bound |
| Gaussian sector | Value, Charges | precision, approximate inverse, mean, residual |
Conversion to the norms of III.9. The rooted optional-letter bound and the packet/tree test are explicit here. Their complete conversion to the outgoing \(E\)- and \(K\)-norms of II.2 and III.5, including the reset, remains to be written out. The relevant per-step assemblies are the activity-bound bundle, its jet version, and the molecule-integral bounds.
Free-kernel compatibility along the trajectory. The condition requires fine and coarse beds satisfying the diagonal and flat tower identities, invariance under lattice symmetries, attachment to the chosen path data, and positive invertibility bounds. YM.PhysicalNext.Repeat.Pane.ovation constructs it on the auxiliary torus from the trajectory's beds, assuming their lattice-symmetry property at every period. The proof of that symmetry property for the final selected trajectory, and the precise III.3 attribution of all tower inputs, have not been checked here.
Depth of the analytic proof checks. The assembly proofs of III.10.2–III.10.4 and their defining estimates have been read. The underlying stationary coercivity, local-inverse, packet-jet and individual letter-jet estimates have not all been read through; their detailed analytic proofs remain to be checked. The proof of H03's forced-family structure was read; its full lift of lattice-symmetry permutations was not checked through. These limitations do not alter the conditional statements above.
Additional reset estimates. meritBar and rimfire give summable jet bounds proportional to the input difference, under matched-input and derivative-control hypotheses. erudite gives positivity of a residual density and a \(\beta_F^{- 23 / 20}\) jet bound on the off-diagonal remainder under matching, finite-bound and small-chart hypotheses. Their complete hypotheses and role in III.9's reset are not included in this unit's numbered outputs.
Gaussian trigger scales. In JointLoad.stage, the scales are \(b (x) = 1 + B (x)\) and \(p (x) = e^{(\log \log \beta_F)^2}\); the trigger estimate absorbs fixed powers of \(b\) into \(e^{- cp^2}\) per distinct endpoint. Its full use in the preconstruction has not been traced here.
Comparison with Balaban. The cited papers describe the corresponding small-field, cluster and large-field operations. A lemma-by-lemma identification, including threshold and normalization choices, remains open. The bibliographic dates and volumes above do not establish such an identification.