Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.9 The marginal flow: the running coupling and its resetPart III·Detailed notesIII.11 Interacting rank, Gaussian comparison and the stress tensor →

III.10. One full nonlinear renormalization step: bounds on irrelevant terms

Contents

1. What this unit proves 2

2. What it uses 10

3. Strategy 10

4. Steps 11

5. Where the difficulty lies 12

6. Notation 12

7. What remains unexplained 13

Code dependencies 13

Lean source 13

Additional source locations 14

Key statements 16

Part III — Ultraviolet construction (renormalization group).

Bounds the large-field and fluctuation contributions produced by one nonlinear renormalization step.

Status: edited. Condensed from the unit's detailed notes, which were checked against the linked Lean in two rounds and edited; the local limitations still apply. Status meanings.

Overview · All units · Detailed notes · ← Previous: III.9 · Next: III.11 →

Results · Inputs · Strategy · Proof steps · Notation · What remains unexplained · Code dependencies · Lean source · Key statements

Source inventory and conventions

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 source allocation.

Conventions. Levels are indexed from coarse to fine, as in III.9.

\(\displaystyle t_c (x) = x^{- 1 / 2} e^{(\log \log x)^2} \text{(coarse field)}, \qquad t = t_c (\beta_F) \text{(fine field)}, \qquad T = \beta_F^{- 49 / 100} \text{(large field proper)},\)

with cluster radius \(B = \lceil (\log x)^2 \rceil\) and path-length cutoff \(R = \lfloor B / 10^5 \rfloor\).

1. What this unit proves

One-step energy, activity, derivative and Gaussian bounds support the effective-action construction of III.9; III.10.6 supplies start-up fusion and marker estimates.

Data of a step.

\(\displaystyle \Phi_0^{\ast} \Phi_0 {+ \Phi_0'}^{\ast} \Phi_0' + N_0^{\ast} N_0 = 1.\)

The transported kernels cut at length \(R\) need not satisfy this identity; their defects are estimated in Steps 5–6.

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:

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.

\(\displaystyle \mathcal{A}_F (U) + \frac{a}{2} \sum_b w_b^2 -\mathcal{A}_c (V) .\)

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:

Then

\(\displaystyle \kappa \hspace{0.17em} t^2 \hspace{0.17em} \sharp A \hspace{0.27em} \leqslant \hspace{0.27em} \mathcal{E}_A (U, V), \qquad \kappa = \tfrac{1}{2} \min \{\lambda_F / 8, a / 32, \alpha_c / 64\},\)

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.

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).

\(\displaystyle \sum_{i : o \in X_i} u_i \exp (a_{\ast} N_B (X_i) + 2 \varepsilon d_i) \leqslant \beta_F^r \qquad \text{for every coarse site } o.\)
 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$;
  1. in every manifest sector, the following bounds hold:

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.

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 (rate as defined in §6).

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 shell width \(K\) from \(o\), cutoff \(\chi\), and with the actual coarse flags.

\(\displaystyle \|D^m V_e (y_0)\| \leqslant c_G \mathcal{V} (x)^m \qquad (0 \leqslant m \leqslant i),\)

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

\(\displaystyle \|D^m a_j (y_0)\| \leqslant \text{cost}_j (\rho (x) \text{span}_j)^m \qquad (0 \leqslant m \leqslant i)\)

(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,

\(\displaystyle \int g \hspace{0.17em} d \nu \leqslant |p (x) | \prod_{j \in \mathfrak{p}} \text{fare}_j \hspace{0.17em} (1 + \text{shape} (\mathfrak{p}))^l .\)

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

\(\displaystyle G_i = (1 + \text{dist} (x_i, o))^{pk} .\)

The bounds are

\(\displaystyle |\mathcal{D}^m \Gamma_{ij} | \leqslant \pi e^{- \sigma \text{dist} (x_i, x_j)} G_i^m, \qquad |\mathcal{D}^m (\Gamma \tilde{\Gamma} - 1)_{ij} | \leqslant e^{- dB} \pi e^{- \sigma \text{dist} (x_i, x_j)} G_i^m,\)
\(\displaystyle |\mathcal{D}^m m_i | \leqslant \pi tG_i^m, \qquad |\mathcal{D}^m h_i | \leqslant e^{- dB} \pi G_i^m .\)

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).

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:

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\).

Conclusions.

(I)

\(\displaystyle \mathcal{F}_r = 2 (2 + 4 P_r) + 1 + 6 (\alpha_r + P_r^2) + 4 d_G \left( \log 16 + \tfrac{1}{2} \log \hat{\beta}_r \right),\)

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\).

\(\displaystyle w_i = \frac{\hat{\beta}_i^{- r / 2}}{p \hspace{0.17em} \text{columns}_i \prod_{m < i} \text{columns}_{m + 1}}\)

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:

Lean:

2. What it uses

Standard results: Balaban's lattice-gauge renormalization method, rooted Kotecký–Preiss and tree-graph bounds, Schur's test, Gaussian exponential moments and Taylor estimates on compact charts. Request and target data precede \(L\); window constants follow \(L, W\) and the patch. Simplicity is required in III.10.5(b) and I04.

3. Strategy

Seeds cost \(\kappa t^2\) each. At \(\beta \geqslant \beta_F / 2\), their Boltzmann suppression pays every fixed polylogarithmic entropy loss. Completed squares isolate positive row contributions and two kernel defects: affected cells are paid by spent seeds, while local gauge fixing and flat identities reduce unaffected defects to chart errors and exponentially small tails.

Gaussian integration produces packet, old forced, logarithmic and warning letters. Energy and annulus estimates bound packets; simultaneous Gaussian excursions bound warnings. Rooted bounds sum connected molecules. Compatible fluctuation transport controls derivatives, and Cauchy–Schwarz preserves one square root of the simultaneous-warning probability in integrated bounds.

4. Steps

Steps 1–7 use III.10.1's admissibility, tree gauge and consistency hypotheses; all thresholds are independent of period. Steps 8–10 use III.10.2–III.10.3's activity, compatibility and derivative hypotheses; Steps 11–12 use III.10.6 and III.10.5, respectively.

  1. Complete the squares. Fine, interior, coarse and gauge rows, together with the linear and completeness defects, sum exactly to \(\mathcal{A}_F + \frac{a}{2} \sum_b w_b^2 -\mathcal{A}_c\) by adjoint cancellation; \(\mathcal{E}_A\) retains rows in \(D_{2 B} (A)\). Tube.locates.

  2. Pack seeds and compare links. Fine plaquettes have bounded macro-box multiplicity; coarse plaquettes above a fixed \(\delta > 0\) lie within \(4 B / 5\) of spent seeds, and the relevant neighbourhood contains \(O (B^4 \sharp A)\) coarse plaquettes. Closing fine links by tree paths bounds their distance from replicated coarse links by macro-box curvature plus crossing mismatches. Work.E01.answer; Work.E02.answer.

  3. Bound kernels and predictions. Absolute row and column sums control transported kernels and path series; in particular \(|v| \leqslant At\), \(| \Phi v| \leqslant At / L^2\), \(| \Phi' v| \leqslant At\), with \(A\) independent of \(L, W\). Norm-one adjoint transport and exponentially weighted coefficient sums give these estimates. Work.E03.answer; Work.E04.answer.

  4. Obtain positive row charges. Large \(L\) separates fine seeds from their predictions, and large \(W\) separates mismatch seeds; dropped path terms are paid after summation by column bounds. Coarse rows above \(t_c\) and below a fixed \(\delta\) are positive, while small coarse rows lose \(O (t_c^4)\); affected-cell losses are charged to large fine inputs, mismatches and \(O (t^2 B^4 \sharp A^{\text{sp}})\). Work.E05.answer; Work.E06.answer; Work.E07.answer.

  5. Cancel flat defects. Outside the affected set, local axial gauge fixing makes fine and coarse links \(h = CB^{10} T\)-close to identity; the flat uncut tower identities cancel both linearized defects. Comparing transported, truncated quantities with their flat versions leaves errors governed by \(\omega = (1 + R) h + e^{- \tau R}\). Work.E08.answer; roll_l; roll_d; global_chart_cost.

  6. Sum unaffected defects. Gauge covariance, locality and extension to global log-fields apply the chart estimates locally; the total defect loss is at most \(\varepsilon t^2 \sharp A\) for every \(\varepsilon > 0\) and all large \(x\). The factor \(B^4\) is absorbed because \(B^n \omega \to 0\) and \(B^n h \omega / t \to 0\) for every \(n\). interior_cost; Fluctuations.bare.

  7. Assemble the energy bound. Choose \(L\), then \(W\), then \(x\): the first absorbs fine cross terms, the second mismatch losses, and the last all remaining losses, using spent-seed charges of size \(tT\). The row sum gives exactly III.10.1's \(\kappa\). Work.E09.answer.

  8. Bound packets and other letters. The annulus remainder has rate \(- 3 / 2\) and is absorbed into \(C \hspace{0.17em} \text{bill}^5\); retained energy gives the packet estimate. Incoming bounds and rate calculus control old and logarithmic letters, including both \(\ell_i\) and \(e^{\ell_i} - 1\). Coat.earns; steam_prices; recommends. (annulus statement only; other proofs read)

  9. Control Gaussian warnings. Coercivity and exponentially decaying rows give a positive precision and covariance, an \(O (t)\) drift and a small residual; compatibility gives the no-new-seed margins. Gaussian rectangle tails, summed over local witnesses, make catastrophe weights smaller than every inverse power of \(\beta_F\); these bounds combine with Step 8 into III.10.2. shoots; Coat.ready; Coat.alarm_bills; Target.issue.

  10. Differentiate letters and integrate molecules. Compatible coordinate transport gives letter jets with rate-zero derivative scale and catastrophe probability \(\text{rad}^{2 \sharp v}\). Leibniz bounds and Gaussian moments, followed by Cauchy–Schwarz, retain \(\text{rad}^{\sharp v}\) in the integrable molecule majorant; a source amplitude replaces its fare. Utopia.whittle; timing.

  11. Fuse and propagate markers. Absolute convergence justifies Mayer regrouping; a retained forced-letter factor and rooted tree sum give \(e^{- \kappa} (e^{\gamma} - 1)\), while common domination gives continuity. Connected ball-cover traversal proves I01; extra support decay and factorial rescaling give I02, composing centred embeddings gives I03, and subscale logarithmic column growth gives I04. H01.gathered; H02.answer; H04.answer; I01.answer; I02.answer; I03.answer; I04.answer. (proof read; H03 symmetry moves statement only)

  12. Choose levels and periods. Adjacent-stage floors and larger entry couplings enforce the energy estimates; finite-request scheduling supplies the remaining requirements. Periods \(4 (M + p + 1)\) admit arbitrarily late multiples of every side. Bid.pricing_order; Wait.engine.

5. Where the difficulty lies

Fine-input coefficients must remain independent of \(L\), and mismatch coefficients independent of \(W\), until those parameters absorb the cross terms. Transported, truncated kernels lack exact completeness: only their flat versions cancel, so local gauge fixing and tail estimates must control the defects after neighbourhood summation. Derivative integration must also retain a gain for every distinct warning address under compatible fluctuation transport.

6. Notation

\(\sharp A\) counts all three seed types, including coincident types; \(D_r (A)\) uses coarse max-distance. \(\Phi, \Phi', N\) are transported towers, with subscript zero denoting flat uncut operators; \(v\) denotes thinned coarse coordinates. \(N_B (H)\) is the minimum connected radius-\(B\) ball-cover size. A function has rate \(a\) when, for every \(v > a\), its absolute value is eventually at most \(\beta_F^v\) (Rate). In III.10.3, \(\rho\) is the rate-zero jet scale and \(\text{rad}\) is the square root of a warning-probability bound; in III.10.4, \(\Gamma, \tilde{\Gamma}, m, h\) denote precision, approximate inverse, mean and scaled stationarity residual.

7. What remains unexplained

Detailed notes: the full account of this unit, with proof sketches for every step, is on the detailed notes page.

Code dependencies

Code dependencies (from the compiled Lean). These lists follow references between declarations allocated to units; they can include shared definitions, record fields and alternative constructions. They are not a mathematical reading order. Only unit pairs with at least 25 references are shown; see the counting rules.

References to: III.1, I.1, III.5, III.4, III.6, III.9, VIII.1, III.2, II.2, IV.1, III.16, II.1, III.15, VI.1, III.3, V.1, V.2.

Referenced by: III.13, III.12, III.11, III.2, III.15, III.4, VIII.1, VII.4, III.6, III.5, VII.2, III.14, V.1, II.1, V.2, III.7, III.3, VI.1, IV.1, III.9, V.3, VII.6, VII.1.

Lean source

Source allocation: 49,448 attributed lines; 5,929 line-counted declarations; 7,823 assigned declaration names. Of the assigned names, 7,561 are in the compiled closure of the seventeen headline results. These quantities have different scopes.

The folders and result chains below are source inventories. Their line counts cover each whole group, including any share allocated to another unit; percentages use attributed lines plus one per assigned name. They need not sum to the unit total.

Additional source locations

Further pinned locations for the definitions and comparisons discussed in this unit.

Key statements

In the selected statement order. K- identifiers name this generated list; proposition and lemma numbers in the outline are separate. Each sentence is an automatically drafted summary of a Lean statement; follow its link for the exact hypotheses and conclusion. The outline status does not certify these summaries. Main result and key result describe importance, not correctness. Full names are in the statement table.

All units · Overview of the proof · Repository

← III.9 The marginal flow: the running coupling and its resetPart III·Detailed notesIII.11 Interacting rank, Gaussian comparison and the stress tensor →