Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.3 Free lattice kernels and covariancesPart III·Detailed notesIII.5 Cluster expansion of the polymer gas →

III.4. Gaussian integration: change of Gaussian sector, determinants, window law

Contents

1. What this unit proves 2

2. What it uses 11

3. Strategy 12

4. Steps 12

5. Where the difficulty lies 13

6. Notation 13

7. What remains unexplained 14

Code dependencies 14

Lean source 14

Additional source locations 16

Key statements 18

Part III — Ultraviolet construction (renormalization group).

Explains the Gaussian changes of variables, determinant bounds and local window estimates used in one 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.3 · Next: III.5 →

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: about 40 work packages. The main ones are YM/SectorNext/GAUSSIAN_SECTOR_CHANGE/ (exact change of variables, gap, windows), YM/AnalyticBridge/RELATIVE_LOGDET_TRACE/ and YM/PhysicalNext/AFTERNOON_INTERACTING_RANK_COMPARISON/ (determinants and the polymer form of a sector), YM/AnalyticBridge/ANNULUS_RATIO_INSERTIONS/, YM/SectorTools/PHYSICAL_GAUSSIAN_INSERTION/ and YM/Primitives/CONNECTED_GAUSSIAN_CUMULANTS/ (Gaussian moments), SECTOR_AFFINE_JETS/, SECTOR_COVARIANCE_JETS/ and SELECTED_ORDERED_KERNELS/ (jets), LOCAL_GAUSSIAN_LAWS/, GAUSSIAN_FIELD_ALIGNMENT/, YM/Push/FREE_RESOLVENT/ and YM/RG08/Gaussian/ (locality, infinite-volume kernels), YM/SectorNext/LARGE_FIELD_REMAINDERS/, and the constant-producing statements in Next/STATIONARY, MergeProof and PhysicalNext/V9_JOINT_ENDPOINT_LOAD. Size: 37,956 lines in 4,737 declarations in the source allocation.

Conventions. \(x = \hat{\beta}_m\) in applications; \(R (x) = \lceil (\log x)^2 \rceil\), \(t (x) = x^{- 1 / 2} e^{(\log \log x)^2}\), \(\beta_F (x, L) = x + s_G \log L\), \(t_L (x) = t (\beta_F (x, L))\), \(g = \beta^{- 1 / 2}\) and \(r_x = \lfloor R (x) / 60 \rfloor\). Write \(\|A\|_s\) for the maximum weighted row and column sums with weight \(e^{s \hspace{0.17em} \text{dist} (i, j)}\), using coarse positions. Matrix inequalities are quadratic-form inequalities. “For large \(x\)” means beyond a threshold depending only on previously fixed constants.

1. What this unit proves

Setting. One block-spin step \(S\) maps a fine torus \(\Lambda_f\) (side \(f = Lc\), block size \(L\) odd) to a coarse torus \(\Lambda_c\). The push-forward of the density at fixed coarse field \(V\) is decomposed (III.1, III.9) into sectors. A sector is given by:

The integration variables are the free links of \(F\), with product Haar measure. In each sector the unit splits the free links as follows (chill):

We write \(n_a = |\mathcal{A}_A | \dim \mathfrak{g}\).

On selected stencils, the step energy contains a sum of affine squares \(Q_Y (a) = \tfrac{1}{2} \lvert Ma + s (Y) \rvert^2\) (guide):

From these the unit defines three objects:

Proposition III.4.1 (exact Gaussian change of variables in one sector). Fix the following data:

Let \(C\) be a matrix on the active coordinates and \(m\) a map from frozen arrays to active coordinates. Assume they are permitted (Permitted):

Let \(\Phi_{A, k} = \text{bill}_A \cdot \text{exposed}_R \cdot \text{enters}_{T, \beta, k, V}\) be the sector integrand. Here \(\text{exposed}_R\) is the interacting density of \(R\), and \(\text{enters}\) is the tagged block-spin kernel times \(e^{- \beta \cdot \text{gap energy}}\). Then the following hold (Licenses):

\(\displaystyle \int \Phi_{A, k} \hspace{0.17em} d \text{Haar}^F = \text{pref}_S (\beta) \hspace{0.17em} J_{\text{sc}}^{\hspace{0.17em} \lvert \mathcal{A}_A \rvert} \hspace{0.17em} (2 \pi g^2)^{n_a / 2} (\det C)^{1 / 2} \int \text{Haar}^{\mathcal{F}_A} (dY) \int \gamma_C (dz) \hspace{0.17em} \Psi (Y, z) .\)

Here \(\gamma_C = N (0, C)\). Set \(a = m (Y) + gz\), and let \(U\) be the configuration with frozen links \(Y\), active links \(e^{a_e} \nu_e\) and tree links \(1\). Then (dyed)

\(\displaystyle \Psi (Y, z) = \tilde{J}_d (a) \hspace{0.17em} \chi_d (a) \hspace{0.17em} \text{bill}_A \hspace{0.17em} \text{lik}_k (U) \hspace{0.17em} \text{exposed}_R (U) \hspace{0.17em} \exp \hspace{-0.17em} \left( - \beta \hspace{0.17em} \overline{\text{res}} (Y, U, a) - \beta Q_Y (m (Y)) + \eta \cdot z + \tfrac{1}{2} z \cdot (C^{- 1} - W) z \right) .\)

In this formula:

The identity holds for every permitted \((C, m)\) without quantitative locality assumptions.

Status: theorem.

Lean: authorized_change.

Proposition III.4.2 (licence of every committed RG step; the transfer identity). Let \(\mathscr{R}\) be a directed RG run (III.9) whose delays satisfy the rate conditions and the per-stage chart conditions (Starcash). Let \(m < N\), let \(p\) be a period, and let \(R\) be a representation at level \(m + 1\) on its selected history with \(\beta_R \in [\hat{\beta}_{m + 1} / 2, \hspace{0.17em} 2 \hat{\beta}_{m + 1}]\). Write:

Then:

\(\displaystyle \mathcal{S}_{\beta} (\rho_R) (V) = \sum_A \text{sieve} (V) \sum_k \text{pref} \hspace{0.17em} J_{\text{sc}}^{\lvert \mathcal{A}_A \rvert} (2 \pi g^2)^{n_a / 2} (\det C_{A, k, V})^{1 / 2} \iint \Psi \hspace{0.17em} d \gamma_C \hspace{0.17em} d \text{Haar} .\)

Here \(\mathcal{S}_{\beta}\) is the block-spin push-forward, \(\rho_R\) is the fine density, and \(\text{sieve} (V) = \exp (- \beta \cdot \text{orientation-averaged coarse energy of } V)\).

Status: theorem, conditional on the run, history and band hypotheses. III.4.12 supplies the rate and chart conditions; III.9 supplies the selected history.

Lean: committed, displaced_wrong.

Proposition III.4.3 (gap and locality of the actual precision and covariance). Fix \(G\), a patch \(P = (L, J)\) and a teller whose kernel satisfies the branch condition. There are \(v, \eta, b, E > 0\) and \(K \geqslant 0\) (post-\(L\) constants) with the following property. For large \(x\), take any step with patch \(P\) and coarse side \(c \geqslant 100 (1 + R (x))\), any funded tube, and any \(A, F, k, V\) with \(\text{flags} (A) = \text{flags}_{t (x)} (V)\). Then:

The constants do not depend on the volume, the store, the forest or the field.

Status: theorem.

Lean: opaqueCost.

Proposition III.4.4 (window law). Let \(\sigma, \eta > 0\), \(K \geqslant 0\), and fix a nonnegative function \(B : \mathbb{R} \to \mathbb{R}\). There are \(u, E, g > 0\) such that for every sufficiently large integer \(r\) the following holds, uniformly in the torus and the finite coordinate set. Let the coordinate positions \(p_j\) satisfy \(\sum_j e^{- v \hspace{0.17em} \text{dist} (i, p_j)} \leqslant B (v)\) for every coarse site \(i\) and every \(v > 0\) (Revenue). Let \(A\) be a finite symmetric matrix with:

Let \(L\) be the windowed inverse, \(L_{\cdot i} = (A|_{\mathcal{W}_i})^{- 1} e_i\) extended by zero, and \(A_{\mathcal{W}} = \tfrac{1}{2} (L + L^{\top})\) (clouded). Then:

A strengthened form (same_purchase) gives a rate \(s \in (0, \sigma]\) and a constant \(K_1\) such that \(A\), \(A^{- 1}\), \(L\) and \((A_{\mathcal{W}})^{- 1}\) all have \(s\)-weighted Schur norm \(\leqslant K_1\), and \(\lVert e^{s \hspace{0.17em} \text{dist}} (L - A^{- 1}) \rVert_{\text{Schur}} \leqslant K_1 e^{- sr}\).

Status: theorem. The constants depend only on \((\sigma, \eta, K, B)\).

Lean: Schur.windows.

Proposition III.4.5 (log-determinants as local path series). Let \(A \succ 0\) with windows \(\mathcal{W}\) (\(i \in \mathcal{W}_i\)). Let \(P_u\) be the column-wise windowed inverse of \(A + uI\), and \(\Delta_u = (A + uI) P_u - I\). Assume the following bounds (Priced), at a fixed nonnegative Schur rate, with \(C \geqslant 1\) and \(0 \leqslant q < 1\), for every \(u \geqslant 0\):

Assume also \(A_{\mathcal{W}} \succ 0\). Then

\(\displaystyle \log \det A = \sum_i \left( \ell_i + \sum_{n \geqslant 0} r_{i, n} \right), \qquad \log \det (1 + S) = \sum_i \sum_{n \geqslant 0} \frac{(- 1)^n (S^{n + 1})_{ii}}{n + 1}, \qquad \log \det A_{\mathcal{W}} = - \log \det A + \log \det (1 + S),\)

with:

All series converge absolutely. Moreover (labeled), the matrix products expand into closed index paths. A term \(r_{i, n}\) has one \(P_u\) factor and \(n + 1\) defect factors, hence \(n + 2\) jumps; the corresponding trace-series term has \(n + 1\) jumps. The absolute values, summed over the intermediate indices, are bounded by \(Cq^{n + 1}\) and \(q^{n + 1} / (n + 1)\), respectively.

Status: theorem.

Lean: Priced.chains.

For the relative expansions, the sector regularity conditions are: a lawful representation; matching fine paths and cutoff; a local chart with \(d > 0\), \(4 d < \rho_J\) and \(2 d < \rho_{\text{first}}\); positive coupling and sector width; \(0 < t_L (x) \leqslant 1\); output threshold \(t (x)\); and the tube's geometric, local-readability, predictor-derivative, covariance-positivity and spectral-gap conditions (Chips, Boosted).

Proposition III.4.6 (relative normalisation of a sector and its localisation). Let \(K_F\) be the flat kinetic precision: the Gram matrix of the move at \(V = 1\) with empty store, on all free links of \(F\).

(i) If the fine path family satisfies its path bounds and the kernel satisfies the patch's branch condition, \(\det K_F\) does not depend on the forest or on the gauge tags (Native.shared).

(ii) Assume:

Then on every sector point \(p = (A, F, k, V, Y, z)\) with matching flags, the positive density factor, with the sector masks and polymer product kept outside it, factorises as

\(\displaystyle \text{freight} (p) = \text{loading} (V) \hspace{0.17em} e^{\Lambda (p)}, \qquad \text{loading} (V) = \text{banker} (V) \hspace{0.17em} \text{pref} (\beta) \hspace{0.17em} e^{v_R \lvert \Lambda_f \rvert} \hspace{0.17em} \text{spare} (\beta)^{\lvert F^{\text{free}} \rvert} (\det K_F)^{- 1 / 2} > 0.\)

Here \(\text{freight} = J_{\text{sc}}^{\lvert \mathcal{A} \rvert} (2 \pi g^2)^{n_a / 2} (\det C)^{1 / 2} e^{\frac{1}{2} z \cdot C^{- 1} z} \hspace{0.17em} \tilde{J} \cdot (\text{noise}) \cdot e^{\text{exponent}_R}\), and \(\text{spare} (\beta) = (2 \pi g^2)^{\dim \mathfrak{g}/ 2} J_{\text{sc}}\) is the Gaussian normalisation per link. The exponent is

\(\displaystyle \Lambda (p) = - \beta \hspace{0.17em} \mathcal{E} (p) + \eta \cdot z + \tfrac{1}{2} z \cdot (C^{- 1} - W) z + \kappa (p) + \sum_e \log \tilde{J} (a_e) + (\text{tails}),\)
\(\displaystyle \kappa (p) = - \lvert \mathcal{F}_A \rvert \log \text{spare} (\beta) - \tfrac{1}{2} (\log \det W - \log \det K_F) + \tfrac{1}{2} \log \det (WC) .\)

Here \(\mathcal{E}\) is the orientation-averaged row energy, including the subtraction of the affine energy at \(a\) and its addition at \(m\):

\(\displaystyle \mathcal{E}= E_{\text{noise}} (U, V) + E_{\text{fine}}^{\text{cut}} (U) - E_{\text{coarse}}^{\text{cut}} (V) - Q_Y (a) + Q_Y (m) .\)

The tails are the remaining fine exponent after removing its volume constant and restoring its cut energy, together with the coarse cutoff correction.

(iii) Assume in addition the sector regularity conditions stated above, a nonnegative polymer exponent, and both path-counting bounds of Lemma 4.21 of the detailed notes. Then \(\kappa (p) = - \lvert \mathcal{F}_A \rvert \log \text{spare} + \sum_e \text{sect}_e + I + \text{Sh}\) (book_price), where:

(iv) Regrouping (rate_pass) gives \(\kappa = \sum_o \text{rent}_o + \text{far} + I + \text{Sh}\):

Status: theorem.

Lean: Dyed.cardinal_spin, Dyed.keptEarly, Dyed.spoolLift.

Proposition III.4.7 (polymer form of a sector, with large-field suppression). Fix:

Then for large \(x\) the following holds. Let \(y = \text{retime} (x)\), \(z = \beta_F (x, D.L)\) and \(\text{hot} (s) = e^{(\log \log s)^{3 / 2}}\). Eventually \(x \leqslant y \leqslant x^2\) and \(t (y) = x^{- 1 / 2} \text{hot} (x)\). Take a step with patch \(D\), a sector datum with chart \(J\), and positive cutoff parameter \(W_0\), subject to the following assumptions:

For such data there is a decomposition (Plate)

\(\displaystyle \Lambda (p) = \sum_{o \in \text{cores} (A)} \text{base}_o (p) + \sum_X \text{aux}_X (p)\)

whenever the flags match and the product of the fine-field, block, gauge-tag and chart cutoffs is nonzero. The bounds below hold for every flag-matched \(p\), including points outside that support. In it:

Status: theorem.

Lean: foreshadows, with hypotheses Helps.

Proposition III.4.8 (moments under the sector law). Fix \(G\). For every covariance cap \(L > 0\) and \(k \in \mathbb{N}\) there is \(D \geqslant 1\) with the following property. Take:

Then \(f = v \prod_{i \in Y} r_i \in L^1 (\mu \otimes \gamma_C)\) and

\(\displaystyle \int \lvert f \rvert \hspace{0.17em} d (\mu \otimes \gamma_C) \leqslant H \hspace{0.17em} D \hspace{0.17em} (1 + \lvert P \rvert \dim \mathfrak{g})^{2 k + 1} \hspace{0.17em} e^{- c \lvert J \rvert \rho^2} \hspace{0.17em} 2^{\dim \mathfrak{g} \hspace{0.17em} \lvert J \rvert} \prod_{i \in Y} \left( e^c \hspace{0.17em} 4^{\dim \mathfrak{g}} w_i \right) .\)

In a sector, take \(\mu = \text{Haar}^{\mathcal{F}_A}\) and \(C = W_{\mathcal{W}}\); III.4.3 supplies a uniform covariance cap. Moreover:

Status: theorem.

Lean: same_law.

Proposition III.4.9 (Gaussian insertions supported on selected coordinates). Fix \(p \geqslant 1\), a finite jet order, \(G\), a patch and a teller satisfying the branch condition. There are post-\(L\) constants \(K, M, s, b > 0\) and \(B \geqslant 0\) such that, for large \(x\), the following holds. Take a funded step with that patch, \(c \geqslant 100 (1 + R (x))\) and matching flags. Fix any \(g, d, \theta > 0\), frozen array and slot set \(U\). Restrict the linear and quadratic correction to \(U\), obtaining \(t \cdot z_U + \tfrac{1}{2} z_U \cdot \mathcal{J}z_U\), where \(t = \eta\) and \(\mathcal{J}= C^{- 1} - W\). Its tilted law is \(N (\mathcal{A}t_U, \mathcal{A})\), with \(\mathcal{A}= (C^{- 1} -\mathcal{J}_U)^{- 1} \succ 0\). The likelihood ratio of the \(U\)-marginals satisfies

\(\displaystyle \mathbb{E}_{\gamma_{C, U}} [(dN_U / d \gamma_{C, U})^p] \leqslant \exp \hspace{-0.17em} (2 p (\lvert U \rvert \ell^2 / (4 \theta) + 2 K \lvert U \rvert (\theta + \varepsilon / 2)))\)

whenever \(Kp (\theta + \varepsilon / 2) \leqslant 1 / 4\). The parameters are:

The restriction is on \(z\); coefficients may depend on all background and frozen data.

Status: theorem.

Lean: Physical.blocks, built on insert_letter.

Proposition III.4.10 (jets of the block coefficients and of the covariance). Fix \(G\), a patch \(P\), a teller satisfying the branch condition, and an order \(n\). There are \(r, d, v, \eta, \lambda_0, C_{\ast} > 0\) such that for large \(x\) the following holds. Take every funded step with patch \(P\) and \(c \geqslant 100 (1 + R (x))\), every \(A, F, V\) with matching flags, every \(k\), and every logarithmic perturbation \(B\) of the background with \(\lVert B \rVert \leqslant r\). The store, forest and tags remain fixed as \(B\) varies. Then:

\(\displaystyle \prod_{b \in \ell} e^{d \hspace{0.17em} \text{dist} (p_b, p_i)} \sum_j e^{d \hspace{0.17em} \text{dist} (p_i, p_j)} \lvert \partial_{\ell} X_{ij} (B) \rvert \leqslant C_{\ast},\)

and the analogous column bound holds with the external weights anchored at \(p_j\);

The selected predictor rows are real-analytic, with \(k\)-jets bounded by constants depending only on \((G, P, K, k)\), on a ball of fixed radius (sounds, chosen_branch). The precision \(W\) is also real-analytic; covariance and resolvent conclusions are finite-order jet bounds.

Status: theorem.

Lean: assembly, fromTeller, coverall, stores.

Proposition III.4.11 (affine squares in the large-field annulus). Fix a teller, a block size \(L\), \(W_0 > 0\), \(K \in \mathbb{R}\) and an integer halo \(D \geqslant 0\). There are \(C \geqslant 1\) and an eventually nonnegative function \(e (x)\) with \((1 + R (x))^n \beta_F (x, L) e (x) \to 0\) for every \(n \in \mathbb{N}\), such that for large \(x\) the following holds. Take a funded step of block size \(L\) with \(c \geqslant 100 (1 + R (x))\), stores \(O, A\), a forest \(F\), fields \(U, V\) and tags \(k\). Assume \(U\) is in tree gauge. In the \((D + 5) R (x)\)-halo of \(O\), assume the following local sector conditions: fine plaquettes whose support meets that halo and which belong to \(A\) have toll at least \(t_L (x) / 4\), those outside \(A\) have toll at most \(t_L (x) / 2\); block bonds whose support meets that halo and which belong to \(A\) have discrepancy at least \(W_0 t_L (x)\), those outside have discrepancy at most \(2 W_0 t_L (x)\); the coarse flags match \(V\); and the chosen frames have positive mass. Then there is a direction \(a\), vanishing on the tree links, such that for every pair of windows \(H, Q\) with \(H_{\text{face}} \subseteq Q_{\text{face}}\) and \(H_{\text{noise}} \subseteq Q_{\text{noise}}\), and with the face, noise and coarse rows of \(Q\) in \(\{p \not\in A^{(2 R)}, p \in O^{(DR)} \}\):

Here \(|O|\) is the number of cost cells, aisles and flags. The comparison with \(a'\) uses uniqueness of the logarithm on the selected stencils.

Status: theorem.

Lean: annulus_pay, with cleans_at and reacts.

Proposition III.4.12 (production of the step constants). Assume:

Then there are pre-\(L\) data with kernel \(K\) and the prescribed orders, two families of path prices, free-field and slope bounds, and a cost bound, with the following property. For every tariff and scope there is a sequence of block-size floors. After any increase of those floors and any choice of block sizes above them, there is a stagewise Hessian spectral gap \(\eta\). For every compatible post-\(L\) cost choice (spectral gap \(\eta\), activity cap at least \(1\), and slope bound below the chosen cap), protection and initial delays, the delays can be enlarged so that the rate and chart conditions hold for all further enlargements. On every paid run with these data there are stationary path families, including the full stationary estimates in the retained family. For each adjacent stage pair \((j, i)\) above the initial stage, the per-step chart conditions hold with \(a_{ji}, E_{ji}\) chosen after \(L_j\) (sponsored_permit). issue_cosmos replaces each entry value by the maximum of its old value and the thresholds for \((j, j)\) and \((j, j - 1)\), preserving the rate conditions.

Status: theorem under these kernel and order assumptions.

Lean: sailsV, using geared.

2. What it uses

Constants are chosen before \(L\), after \(L\), then before the threshold in \(x\). Packet-energy, support-exponent, chart, noise and representation assumptions in III.4.7 remain separate inputs.

3. Strategy

Keep links near the store as Haar variables and put the remaining links in exponential coordinates. Split off affine squares, shift by the windowed mean and divide by a Gaussian density; the linear and quadratic errors remain in the integrand. A local Poincaré inequality gives the precision's spectral gap, and decay estimates make its windowed inverse positive and exponentially close to the full inverse.

Expand relative log-determinants into window and path terms, then collect terms near large-field cores. Packet energy absorbs their logarithmic cost; the remainder has a small polymer norm. Gaussian moments control exponential insertions, marked jets control background derivatives, and annulus estimates recover affine squares away from the store.

4. Steps

  1. Chart transport and Gaussian scaling. Under III.4.1's support and chart hypotheses, extended Jacobians and cutoffs preserve the sector integral and its integrability. Translate and dilate the Lebesgue variables, then expand the affine square to obtain the exact Gaussian formula. Lean: authorized_change.

  2. Precision and windows. Under III.4.3's hypotheses, a linkwise gauge choice compares predictor derivatives with the flat field, and the local Poincaré estimate absorbs the errors. Combes–Thomas bounds the window defect, giving III.4.4 and positivity. Lean: Gap.not_flat, Schur.windows.

  3. Admission along the run. Under the funding and size hypotheses, axial gauge bounds active-link chords by a constant times \(t_L (x)\), so the logarithmic chart gives the standing condition. With III.4.2’s run and band assumptions, enlarge stage thresholds, apply the sector identity to matching flags, and use vanishing for wrong flags to recover the push-forward. Lean: matinee, committed.

  4. Relative determinants. Identity completion puts actual and flat precisions on the same coordinates. Under III.4.5–III.4.6's assumptions, the resolvent integral and Neumann series give window letters and closed paths, which are regrouped near cores. Lean: Priced.chains, rate_pass.

  5. Core suppression. Under III.4.7's hypotheses, packet energy dominates core normalisation costs; the remaining terms have powers \(y^{- 1 / 8}\), \(y^{- 1 / 24}\) or exponential decay. Clamping preserves core values on the cutoff support, and symmetrisation gives the \(y^{- 1 / 48}\) bound. Lean: foreshadows. (proof read; some supporting path and interaction bounds statement only)

  6. Gaussian moments and local insertions. Under III.4.8–III.4.9's assumptions, exponential quadratic moments and polynomial moments control insertions and tails. A correction supported on selected coordinates has a likelihood ratio determined by those marginals. Lean: same_law, insert_letter. (moment and insertion proofs read; marginal-support assertion statement only)

  7. Jets. Under III.4.10's hypotheses, transplant predictor stencils to a fixed torus and use a local gauge to obtain uniform analytic rows. Perturbation preserves the precision's spectral gap and supplies the weighted inverse and window jet bounds. Lean: sounds, assembly. (predictor and precision proofs read; transport and cut-error bounds statement only)

  8. Annulus squares and constants. Under III.4.11's hypotheses, clean logarithmic coordinates give cubic row errors; summing the rows and discarding unselected positive squares proves the annulus bound. Under III.4.12's assumptions, choose stationary paths and block sizes, then enlarge delays and chart thresholds. Lean: annulus_pay, sailsV. (assembly and constant selection proofs read; clean-field construction and row recovery statement only)

5. Where the difficulty lies

The spectral gap requires a different gauge comparison for each link; its smallness radius comes from continuity. Inverse bounds spend decay rate while remaining uniform in volume and sector. Relative determinants compare different active dimensions, and the large-field threshold must absorb their core costs while preserving polymer summability.

6. Notation

\(N_{B_0} (X)\) is the cover number; store size counts cost cells, aisles and flags.

7. What remains unexplained

The simultaneous supply of III.4.7's packet-energy and support-exponent assumptions on the selected run, and the transfer of stationary paths to work rows, remain unexplained. Several supporting kernel, counting, transport and clean-field proofs were read only as statements. The free-kernel comparison is for flat sectors without frozen links under compatibility assumptions; no direct comparison for arbitrary interacting sectors was located. Downstream reset and repeatable-step results and the additional assigned packages remain unchecked; precise bibliographic references remain open.

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: I.1, III.1, III.11, III.10, III.7, III.5, III.16, III.6, II.2, III.2, III.9, II.1, III.8, III.3, III.15, VIII.1.

Referenced by: III.10, III.11, III.2, VII.6, III.13, III.9, III.12, VII.2, VII.1, III.15.

Lean source

Source allocation: 37,956 attributed lines; 4,737 line-counted declarations; 5,885 assigned declaration names. Of the assigned names, 5,618 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.3 Free lattice kernels and covariancesPart III·Detailed notesIII.5 Cluster expansion of the polymer gas →