Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.14 The construction run: flat representations and the ultraviolet rate (notes)Part III·Unit outlineIII.16 Analytic toolkit (notes) →

III.15. Cost accounting for observables and the remainder comparison — detailed notes

Contents

1. What this unit proves 3

Part A: pair-step pricing 3

Part B: derivative bounds for local observables 5

Part C: launch data for the remainder comparison 6

2. What it uses 9

3. Strategy 10

4. Steps 10

4.1 Elementary asymptotics 10

4.2 Pair-step rates 11

4.3 Merging hard and soft families 11

4.4 Slots and atoms 12

4.5 The Chron chain (Part C) 13

4.6 Records and other fragments (Part D) 18

5. Where the difficulty lies 18

6. Notation 19

7. What remains unexplained 20

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

Unit page · All units · Overview

Part: III, Ultraviolet construction (renormalization group). Lean: chapter 32: YM/RemainderComparison/ (packages Chron, Cadenza, Halo, Muse, Solo, Lyric, Herbal, Cascade, Sleet, Access, Portal, Aux and about twenty smaller ones), YM/Progress/DIRECTED_RECIPE/, YM/Next/SCHEDULE/, YM/RG05Readout/, YM/Integration/ChronPreconstruction/, YM/Integration/RG05Preconstruction/, and small parts of YM/R2I/, YM/RG12/, YM/OPE/Therm/. Size: 7,382 lines in 1,053 declarations used by the main theorem. About 4,200 of these lines are the launch theorem and its prerequisites.

Overview. The unit has three independent parts, plus some record types.

Status of the parts for the main theorem.

Conventions.

For \(\beta > 0\) and \(x > 1\), use the scale functions

\(\displaystyle g (\beta) = \beta^{- 1 / 2}, \qquad p (x) = e^{(\log \log x)^2}, \qquad t (x) = g (x) \hspace{0.17em} p (x), \qquad \mathcal{B} (x) = \lceil (\log x)^2 \rceil .\)

Growth classes, at fixed \(L\), as \(x \to \infty\):

Weighted hit bound (YM.Ac.Hit): for supports \(X_i\), weights \(f_i \geqslant 0\), scale \(M\) and exponent \(a\), write \(\text{Hit}_M (f ; a) \leqslant \gamma\) if

\(\displaystyle \sum_{i : \hspace{0.17em} z \in X_i} f_i \hspace{0.17em} e^{aN_M (X_i)} \leqslant \gamma \quad \text{for every site } z,\)

where \(N_M (X)\) is the minimal number of \(M\)-balls with connected union covering \(X\).

The quote is \(\text{quote} (\kappa, \gamma) = e^{- \kappa} (e^{\gamma} - 1)\) (YM.Bid.quote).

In the code, a price or bill is a numerical bound; “financed” means that the bound satisfies the specified growth conditions.

1. What this unit proves

Part A: pair-step pricing

Proposition III.15.1 (pair-step rates). Let \(\rho > 0\), \(C \geqslant 0\), \(r > \rho\), \(d \in \mathbb{N}\), \(e \in \mathbb{R}\) and \(q > 0\). For \(y > 1\) and \(\beta > 0\) put

\(\displaystyle s (y, \beta) = \frac{t (y)}{g (\beta)} = p (y) \sqrt{\beta / y}, \quad \text{mild} (y) = C (1 +\mathcal{B}(y))^d p (y)^e g (y)^q,\)
\(\displaystyle \text{strong} (y, \beta) = Ce^{- rs^2}, \quad \kappa (y, \beta) = \rho s^2 .\)

For all sufficiently large \(y > 1\), the following holds for every \(\beta \in [y / 4, 4 y]\) and every integer \(0 \leqslant B \leqslant \mathcal{B} (y)\). With \(a = \text{strong} (y, \beta)\), \(b = \text{mild} (y)\) and \(\gamma = e^{\kappa} a + 2 b\):

\(\displaystyle \kappa \geqslant 0, \quad a \geqslant 0, \quad 0 \leqslant b \leqslant 1, \quad (2 B + 1)^4 \gamma \leqslant 1, \quad \text{quote} (\kappa, \gamma) \leqslant e^{- \kappa} .\)

These are the rate conditions with target \(w = e^{- \kappa}\). The threshold in \(y\) depends only on \((\rho, C, r, d, e, q)\). Status: theorem. Lean: YM.Progress.DirectedRecipe.Payments.Pairing.currency; data YM.Progress.DirectedRecipe.Payments.Pairing; conditions YM.Progress.DirectedRecipe.Payments.Rates and YM.Progress.DirectedRecipe.Payments.inflation. Used in:

Proposition III.15.2 (merging a hard and a soft family). Fix a parameter point \(P\) with derivative order \(K \geqslant 6\), direction power \(P_0 \geqslant 2\), cluster scale \(B_P \geqslant 1\), support exponent \(\sigma > 0\) and threshold \(0 < t_P \leqslant 1\). Consider a countably indexed regular family \(E_i\), a hard family of forced activities \(F_i\) with supports \(X_i\), and a soft family of real local exponential corrections \(\ell_i\) with nonempty supports \(X'_i\). Assume:

  1. The regular terms satisfy the regular-family conditions at \(P\): regularity on their supports, vanishing at the flat field, and vanishing affine Hessian on nonwrapping supports. The forced terms and their eligibility tests are gauge invariant, measurable and determined by the links and final flags on their supports; a nonzero forced term satisfies its eligibility test. The regular and forced families admit the prescribed translation/reflection permutations, including the support and inventory transformations. Each \(\ell_i\) is gauge invariant, measurable and determined by the links and final flags on \(X'_i\); it vanishes on configurations small-field on \(X'_i\). The soft family is also covariant under translations and reflections.

  2. The regular family has bound \(\delta\): it admits nonnegative bounds on all left derivatives through order \(K\) on its small-field supports, in the directions specified by \(P\), whose weighted sum at each anchor is at most \(\delta\).

  3. For every \(i\) and every configuration \(U\), \(|F_i (U) | \leqslant p_i\) and \(| \ell_i (U) | \leqslant q_i\), with \(p_i, q_i \geqslant 0\).

  4. \(\text{Hit}_{B_P} (p ; \sigma + 1) \leqslant a\) on \((X_i)\) and \(\text{Hit}_{B_P} (q ; \sigma + 1) \leqslant b\) on \((X'_i)\).

  5. The rate inequalities of III.15.1 hold with \(B = B_P\), with the final inequality replaced by \(\text{quote} (\kappa, e^{\kappa} a + 2 b) \leqslant w\).

Then the fusion input condition with \((\delta, w)\) holds. Explicitly:

Status: theorem. The only analytic input is \(|e^z - 1| \leqslant 2 |z|\) for \(|z| \leqslant 1\). Through the fusion lemmas of III.10 (Work.H01–H03, used in YM.Progress.DirectedRecipe.Ingredients.gates), the conclusion gives the fused polymer family with norm bound \(\leqslant w\). With \(w = e^{- \kappa}\) from III.15.1, this is the Gaussian large-field factor \(\exp (- \rho \hspace{0.17em} (\beta / y) \hspace{0.17em} p (y)^2)\). Lean: YM.Progress.DirectedRecipe.Payments.tender; YM.Progress.DirectedRecipe.Payments.hardCost, YM.Progress.DirectedRecipe.Payments.softCost, YM.Progress.DirectedRecipe.Payments.rooted, YM.Progress.DirectedRecipe.Payments.Fittings, YM.Progress.DirectedRecipe.Ingredients. Used in: III.9 (YM.AnalyticBridge.VerifiedReset.Collection.Local.renew) and III.10 (YM.PhysicalNext.Repeat.Marlin.cannon).

Part B: derivative bounds for local observables

A slot \(s\) is a lattice walk \(\omega\) from the origin, followed by a plaquette \(\pi\) (two axes) at the endpoint of \(\omega\) (YM.RG.Slot). Its length is \(|s| = | \omega | + 4\), and its value at a site \(o\) is the transported curvature

\(\displaystyle s (U, o) = \text{Ad} (U_{\omega}) \hspace{0.17em} \mathcal{C} (U_{\pi}) \in \mathfrak{g},\)

where \(\mathcal{C}\) is the colour projection of the anti-Hermitian part.

A \(k\)-leg atom \(a\) has slots \(s_1, \ldots, s_k\) and a real coefficient tensor \(c_b\) indexed by colour multi-indices \(b \in \{1, \ldots, \dim \mathfrak{g}\}^k\) (YM.RG.Atom). Its value is \(a (U, o) = \sum_b c_b \prod_i s_i (U, o)^{b_i}\), its size is \(|a| = \sum_b |c_b |\), and its length is \(\text{len} (a) = \sum_i |s_i |\).

Fix a parameter point with derivative order \(K \geqslant 6\), power \(P \geqslant 2\) and threshold \(t \in (0, 1]\). Directions are colour-valued increments \(A\) of the left derivative \(\partial_A\). A direction is admissible at \(o\) if

\(\displaystyle \|A_e \| \leqslant t \hspace{0.17em} (1 + \text{dist} (e, o))^P \quad \text{for every link } e.\)

Here \(\text{dist} (e, o)\) is the periodic maximum distance from the basepoint of \(e\) to \(o\) (YM.RG.BudgetPoint.dirBound).

A configuration is small-field on \(X\) (healthy, YM.RG.Healthy) if every plaquette touching a site of \(X\) has chord distance \(\leqslant t\) from the identity. Let \(\kappa_G > 0\) be the colour scale of \(G\) and \(\|1\|\) the Frobenius norm of the identity matrix.

Proposition III.15.3 (slot derivative bound). Let \(\ell \in \mathbb{N}\) and \(s\) be a slot with \(|s| \leqslant \ell\), let \(S\) be a finite set of points of \(\mathbb{Z}^4\) containing the stencil of \(s\), and let \(o\) be a site. Then \(U \mapsto s (U, o)\) is \(K\) times left-differentiable. Let \(U\) be small-field on \(o + S\) (wrapped on the torus), and let \(A_1, \ldots, A_m\) be admissible directions at \(o\) with \(m \leqslant K\). Then

\(\displaystyle | \partial_{A_1} \cdots \partial_{A_m} s (U, o) | \leqslant \text{slotCost} (P, K, \ell) \hspace{0.17em} t,\)
\(\displaystyle \text{slotCost} (P, K, \ell) = (1 + \kappa_G^{- 1} \|1\|) \hspace{0.17em} \text{margin} (P, \ell)^K, \qquad \text{margin} (P, \ell) = 2 (\kappa_G + 1) \hspace{0.17em} 2^P (\ell + 1)^{P + 1} .\)

The constant depends on \(P, K, \ell, G\) only, not on \(t\), \(o\) or the volume. At \(m = 0\) the stronger order-zero bound is \(\|s (U, o)\| \leqslant t\). Status: theorem. Lean: YM.Next.Scheduling.Wages.slotPays; YM.Next.Scheduling.Wages.slotCost, YM.Next.Scheduling.Wages.margin, YM.Work.G07.LeftBound. Used in: III.9 (YM.AnalyticBridge.VerifiedReset.Low.plain_bill) and III.15.4.

Proposition III.15.4 (bound for \(k\)-leg atoms). Let \(k \in \mathbb{N}\), let \(a\) be a \(k\)-leg atom, \(o\) a site, and \(U\) small-field on the footprint \(o + \text{stencil} (a)\). Then \(U \mapsto a (U, o)\) is \(K\) times left-differentiable, and every left derivative of order \(m \leqslant K\) in admissible directions at \(o\) is bounded by

\(\displaystyle \text{price} (a) = |a| \hspace{0.17em} 2^K \left( 2^K \hspace{0.17em} \text{slotCost} (P, K, \text{len} (a)) \hspace{0.17em} t \right)^k = \text{start} (G, k, P, K) \hspace{0.27em} t^k \hspace{0.27em} |a| \hspace{0.27em} (\text{len} (a) + 1)^{(P + 1) Kk},\)

where \(\text{start} (G, k, P, K) = 2^K (2^K \text{slotCost} (P, K, 0))^k\). Status: theorem. Lean: YM.Next.Scheduling.Wages.fin, YM.Next.Scheduling.Wages.price, YM.Next.Scheduling.Wages.scan, YM.Next.Scheduling.Wages.startup. Used in: III.9 (YM.AnalyticBridge.VerifiedReset.High.paid) and III.10.

Part C: launch data for the remainder comparison

A connected-activity target \(Q\) (YM.ConnectedActivityE6.Target, III.10) carries:

Its relative exponent is \(\text{rel}_Q = \text{e}_Q + 2 \varepsilon_Q + \delta_Q\).

Stage pairs \((j, i)\) are those with \(i \in \{j, j - 1\}\) (YM.Push.PriceCompiler.StepStages). The stage profile \(P_j\) has support exponent \(\sigma_j\).

Proposition III.15.5 (launch data). Let \(G\) be simple. Fix:

Then there are thresholds \(f : \mathbb{N} \to \mathbb{N}\) and constants \(C'_{ji} \geqslant 1\) such that:

  1. For all \(j, i\), the quotation bound holds for \((C_{ji}, \text{power} (P_i), r_{ji})\) with fine exponent \(\sigma_j\), coarse exponent \(\sigma_i + 2\) and constant \(C'_{ji}\). More precisely, take an RG step of side \(L\), fine and coarse parameter points \(B, P\), and supports \(X, Y\) such that \(Y\) lies in the \(r_{ji} \mathcal{B} (x)\)-neighbourhood of the coarse image of \(X\). Assume \(P\) has the power of \(P_i\), \(B\) has support exponent \(\sigma_j\), \(B_P =\mathcal{B} (x)\), \(B_B \leqslant 2 B_P\), \(t_P \leqslant 2 t_B\), and the acceptance condition in (c) below. For every \(u \geqslant 0\) satisfying the local analytic smallness condition for the return fee and every \(\tau \geqslant 0\),

    \(\displaystyle e^{(\sigma_i + 2) N_{B_P} (Y)} \hspace{0.17em} \tau \hspace{0.17em} \text{returnFee} \leqslant C'_{ji} L^{- 5} e^{\sigma_j N_{B_B} (X)} \tau .\)
  2. For every stage pair \((j, i)\) and every block side \(L \geqslant f_j\):

Status: theorem. The construction run calls it with rates \(< - \tfrac{7}{16}\); these are supplied by III.2's company selection, and \(- \tfrac{7}{16}\) implies the hypothesis. Lean: YM.RemainderComparison.Chron.sails, YM.RemainderComparison.Chron.Pledge, YM.PhysicalNext.JointLoad.Heir.Release.Quotation, YM.PhysicalNext.JointLoad.Heir.Release.accepts, YM.RemainderComparison.Lyric.radiusCost, YM.RemainderComparison.Chron.Contemple (tolerances).

The heart condition on rays for a stage \(E'\) and exponent \(\text{e}_Q\) consists of the support inequalities

\(\displaystyle 0 \leqslant \sigma_{\ast}, \quad \sigma_{E'} \leqslant \sigma_{\ast}, \quad \sigma_{\ast} + 1 \leqslant a_{\ast}, \quad \varepsilon_{\ast} > 0, \quad a_{\ast} + 3 \varepsilon_{\ast} \leqslant \text{e}_Q,\)

and the order inequalities

\(\displaystyle \text{ord} (E') \leqslant J_{\ast}, \quad \text{ord} (E') + (p_{\ast} + 1) + p_{\ast} + 2 \leqslant n_{\ast}, \quad p_{\ast} + 1 \leqslant s_{\ast}, \quad k_{\ast} + 1 \leqslant s_{\ast} .\)

The starred quantities are the support exponents, slack and requested orders carried by the rays.

Proposition III.15.6 (the quay for large sides). Let \(G\) be simple, \(K\) a kernel choice, and \(Q\) a target with \(\tfrac{3}{8} + \rho_Q < 0\). There is \(n\) such that for every block side \(L \geqslant n\) the following holds. Take any:

Then there exist a quarry \(D\) (a record of bounding functions of \(x\), with \(d (D) > 0\) and paint supply) and a threshold \(P_1\) with:

Here tempered means that \(Z\) has cluster radius \(\mathcal{B} (x)\), threshold \(t (x)\), the order, power and support exponent of \(E'\), and threshold at most \(2 t (\beta_F (x, L))\). The active conditions comprise the local analytic estimates, readiness of the spatial restrictions, compatibility estimates and the prescribed tail bounds. The block-side threshold \(n\) is independent of the auxiliary data; the quarry and \(P_1\) may depend on all of them. The quarry is a fixed record of functions of \(x\). Status: theorem. Lean: YM.RemainderComparison.Cadenza.buoys, YM.RemainderComparison.Cadenza.Quay, YM.RemainderComparison.Cadenza.Allot, YM.RemainderComparison.Cadenza.Coaxes, YM.RemainderComparison.Cadenza.Quarry.Financed.

Proposition III.15.7 (using the launch data). Fix a sheet, compatible target and expense tables \(R, X\), chosen block sizes \(L_j\), a protection, a register and a firmament. The register supplies \(W_{ji}, \mu_{ji}\) and order data, with positivity for stage pairs. The firmament gives, for each stage pair, finitely many request slots; each carries a scrollwork, a songbook, grade and order data, a reserve, positive constants, and an extra condition that holds eventually for every financed quarry. Fix also tolerances, libraries \(C_{ji}\), mark numbers \(r_{ji}\) and records \(u_{ji}\). Assume:

Then for every initial delay datum \(T_0\) there are a delay datum \(W \geqslant T_0\) and a quarry \(V_{jig}\) for every request slot \(g\), indexed at all \((j, i)\), with the following properties for every delay datum \(U \geqslant W\):

The order on delay data increases entry couplings, scale-entry functions, shell counts and growth exponents componentwise. The quarries are chosen before \(U\).

Status: theorem. Lean: YM.RemainderComparison.Chron.grows, YM.RemainderComparison.Chron.Pillar, YM.RemainderComparison.Chron.Firmament, YM.RemainderComparison.Chron.Glint. Use of III.15.5 and III.15.7: III.2 (YM.PhysicalNext.Repeat.Legato.R2I.RG05Joint.joinExpensesShipWithPrediction), whose comparison conjunct reaches the selected-run theorem of III.14 and is discarded by the final construction-run theorem (see the overview).

2. What it uses

From other units.

Standard mathematics.

Imported constants and assumptions.

3. Strategy

Part A separates the numerical loss from the fusion argument. On the coupling band, the hard bound is \(Ce^{- rs^2}\) with \(s \geqslant p (y) / 2\). Retaining \(e^{- \rho s^2}\) leaves \(Ce^{- (r - \rho) s^2}\) to absorb the support-counting factor. The soft bound decays because its negative power of \(y\) dominates its powers of \(p (y)\) and \(\mathcal{B} (y)\). The Mayer expansion then combines the hard activities with \(e^{\ell_i} - 1\); their weighted bounds add to \(e^{\kappa} a + 2 b\). Both families may be supported on large fields. The terminology “hard” and “soft” distinguishes their estimates.

Part B represents a transported curvature slot as the projection of the single group word \(\omega \cdot \partial \pi \cdot \omega^{- 1}\). Unitarity bounds each differentiated product without an exponential loss in path length. Each derivative contributes one direction norm, at most \(t (1 + 2 \ell)^P\), and has at most \(2 \ell\) possible link occurrences. For positive derivative order, \(t^m \leqslant t\); at order zero, the small-field plaquette bound gives the factor \(t\). The Leibniz rule gives \(t^k\) for a product of \(k\) slots, with a polynomial loss in total path length.

Part C first chooses a block-side threshold and then, for each permitted side and each fixed set of auxiliary data, chooses comparison functions and an entry coupling. The connected-activity bounds have rate \(\rho_Q\); the extra tree weight \(\beta_F^{3 / 8}\) still leaves negative rate. A marked input family of size \(\delta \leqslant \beta_F^{- 11 / 10}\) gives an anchored output bound \((C' / L + o (1)) \delta\), subject to the support and local analytic conditions in Lemma 4.16. Clusters with at least one marked occurrence and \(m\) further occurrences outside the inserted leaves gain an additional factor \(S' (x)^m\) of negative rate. At each fixed expansion order, the tail bounds are small enough to absorb any prescribed power of \(g (\beta)\). Finally, finitely many requests at each stage are met by enlarging the entry coupling and spatial-size thresholds.

4. Steps

4.1 Elementary asymptotics

Lemma 4.1. For every \(k \in \mathbb{N}\), as \(x \to \infty\):

  1. \(p (x)^a g (x)^q \to 0\) for all \(a \in \mathbb{R}\) and \(q > 0\);

  2. \((1 +\mathcal{B}(x))^k / p_d (x)^a \to 0\) for \(d > 1\) and \(a > 0\), where \(p_d (x) = e^{(\log \log x)^d}\);

  3. \(g (x)^q e^{- c \hspace{0.17em} p_d (x)^a} \to 0\) for every real \(q\), \(c, a > 0\) and \(d > 1\).

Sketch: substitute \(u = \log \log x\), so that \(\log x = e^u\); each claim reduces to a polynomial or exponential in \(u\) against \(e^u\) or \(e^{u^d}\). Lean: Clocks.lean; YM.Next.Scheduling.Clock.light, YM.Next.Scheduling.Clock.ceiling_cheaper, YM.Next.Scheduling.Clock.burnt.

4.2 Pair-step rates

Lemma 4.2 (III.15.1). Under the hypotheses of III.15.1, the rate conditions hold eventually, uniformly over the coupling band and \(B \leqslant \mathcal{B} (y)\).

Proof sketch:

  1. Put \(\eta = (r - \rho) / 4\). On the band, \(g (\beta) \leqslant 2 g (y)\), so \(s \geqslant p (y) / 2\). Hence \(e^{\kappa} \hspace{0.17em} \text{strong} = Ce^{- (r - \rho) s^2} \leqslant h (y) := Ce^{- \eta p (y)^2}\).

  2. Put \(v = h + 2 \hspace{0.17em} \text{mild}\). For every \(k\), \((1 +\mathcal{B})^k v \to 0\):

  3. With \(k = 4\): \((2 B + 1)^4 \gamma \leqslant 2^4 (1 +\mathcal{B})^4 v \leqslant 1\) eventually.

  4. \(e^v - 1 \leqslant 1\) eventually gives \(\text{quote} (\kappa, \gamma) \leqslant e^{- \kappa}\), and \(\text{mild} \to 0\) gives \(\text{mild} \leqslant 1\).

All thresholds are independent of \(\beta\) and of \(B \leqslant \mathcal{B} (y)\). Lean: YM.Progress.DirectedRecipe.Payments.Pairing.currency, the two private asymptotic estimates in Economy.lean. The same file also defines the record of these rate conditions along the chosen sequence of scales.

4.3 Merging hard and soft families

Lemma 4.3 (blend). Let \(p, q \geqslant 0\) satisfy \(\text{Hit}_B (p ; \sigma + 1) \leqslant a\) on \((X_i)\) and \(\text{Hit}_B (q ; \sigma + 1) \leqslant b\) on \((X'_i)\). Then the weights \((e^{\kappa} p_i) \sqcup (2 q_i)\) on the disjoint union satisfy \(\text{Hit}_B (\cdot \hspace{0.17em} ; \sigma + 1) \leqslant e^{\kappa} a + 2 b\).

Sketch: multiply a hit bound by a constant, then add two summable families. Lean: YM.Progress.DirectedRecipe.Payments.give, YM.Progress.DirectedRecipe.Payments.blend, YM.Progress.DirectedRecipe.Payments.merges.

Lemma 4.4 (activity bounds of the merged family). Under the nonempty-support and positive-exponent conventions of III.15.2, assume \(p_i, q_i \geqslant 0\), \(|F_i | \leqslant p_i\), \(| \ell_i | \leqslant q_i\), the soft hit bound \(b\), and \(b \leqslant 1\). Then \(\|F_i \| \leqslant e^{- \kappa} (e^{\kappa} p_i)\) and \(|e^{\ell_i} - 1| \leqslant 2 q_i\).

Sketch:

  1. Dropping one unit of support exponent gives a sum bound for the weights \(e^{\sigma N (X'_i)} q_i\).

  2. A single term is at most the sum, so \(| \ell_i | \leqslant q_i \leqslant e^{\sigma N (X'_i)} q_i \leqslant b \leqslant 1\).

  3. Then \(|e^z - 1| \leqslant 2 |z|\) for \(|z| \leqslant 1\).

Lean: YM.Progress.DirectedRecipe.Payments.shares, YM.Progress.DirectedRecipe.Payments.drop_reserve.

Lemma 4.5 (III.15.2). Under the hypotheses of III.15.2, the fusion input condition holds, with witness \((\kappa, e^{\kappa} a + 2 b, a)\).

Sketch: the original-family estimate combines the structural assumptions, the regular bound \(\delta\), the hard sup bounds and the reduction of the support exponent by one. The merged-family estimate uses \(\gamma \geqslant 0\) and \(\kappa \geqslant 0\), the capital inequality, Lemma 4.3 and Lemma 4.4. The quote inequality is the last rate condition. Lean: YM.Progress.DirectedRecipe.Payments.tender.

4.4 Slots and atoms

Lemma 4.6 (a slot is one group word). For every slot \(s\), site \(o\) and configuration \(U\),

\(\displaystyle s (U, o) = \Pi (U_{\omega \cdot \partial \pi \cdot \omega^{- 1}}), \qquad \Pi (A) =\mathcal{P}_G \left( \tfrac{1}{2} (A - A^{\ast}) \right), \qquad \| \Pi (A)\| \leqslant \kappa_G^{- 1} \|A\| .\)

Here \(\mathcal{P}_G\) is the colour-coordinate projection with the normalization of \(G\).

Sketch: \(\mathcal{C} (hgh^{- 1}) = \text{Ad} (h) \hspace{0.17em} \mathcal{C} (g)\). The detour has length \(2| \omega | + 4 \leqslant 2 |s|\). Lean: YM.Next.Scheduling.Wages.detour, YM.Next.Scheduling.Wages.projector, YM.Next.Scheduling.Wages.hangs, YM.Next.Scheduling.Wages.norm_projector.

Lemma 4.7 (derivatives of a word). Let \(w\) be a product of link variables and inverses with \(n\) link uses, and let \(T \geqslant 0\). Write \(\iota_G\) for the colour-to-matrix map. Suppose the matrix representative of every increment satisfies \(\| \iota_G (A_e)\| = \kappa_G \|A_e \| \leqslant T\) on every used link \(e\), for every direction in the list \(\vec{A}\). Then

\(\displaystyle \| \partial_{\vec{A}} U_w \| \leqslant \|1\| \hspace{0.17em} (Tn)^{| \vec{A} |} .\)

Sketch: the Leibniz rule; each derivative replaces one factor by its left increment. Lean: YM.Next.Scheduling.Wages.Path.bill.

Lemma 4.8 (III.15.3). Under the hypotheses of III.15.3, the slot derivative bound holds.

Sketch:

  1. Every used link basepoint of the detour is within distance \(2 \ell\) of \(o\). Admissible directions therefore give \(T = \kappa_G t (1 + 2 \ell)^P\), and \(T \cdot 2 \ell \leqslant \text{margin} \cdot t\).

  2. Lemma 4.7, then \(\Pi\), give \(\kappa_G^{- 1} \|1\| (\text{margin} \hspace{0.17em} t)^m\).

  3. Since \(\text{margin} \geqslant 1\), \(t \leqslant 1\) and \(1 \leqslant m \leqslant K\), this is at most \(\kappa_G^{- 1} \|1\| \hspace{0.17em} \text{margin}^K t\).

  4. For \(m = 0\), use the order-zero small-field slot bound.

Lean: YM.Next.Scheduling.Wages.slotPays.

Lemma 4.9 (III.15.4). Under the hypotheses of III.15.4, the atom derivative bound and its closed form hold.

Sketch:

  1. Extract colour components by an orthonormal projection.

  2. Apply the Leibniz rule to the product of the \(k\) leg components: two derivative bounds \(c_1, c_2\) up to order \(K\) give \(2^K c_1 c_2\).

  3. Multiply by \(c_b\) and sum over \(b\).

  4. The closed form follows from \(\text{slotCost} (P, K, \ell) = \text{slotCost} (P, K, 0) (\ell + 1)^{(P + 1) K}\).

Lean: YM.Next.Scheduling.Wages.fin, YM.Next.Scheduling.Wages.scan.

4.5 The Chron chain (Part C)

The following conventions specify the conditional estimates in this chain. An admissible step record consists of step data with the prescribed patch, a stamped tube, an input representation \(R\), and its connected-activity hypotheses at \((W, x, \mu, L, Q)\). A marked input \((E, w, \delta)\) is a set \(E\) of regular input indices with derivative bounds \(w_i \geqslant 0\), zero outside \(E\), satisfying

\(\displaystyle \sum_{i : \hspace{0.17em} o_i = z} e^{\sigma_R N_{B_R} (X_i)} w_i \leqslant \delta \qquad \text{for every fine site } z.\)

Here \(o_i, X_i\) are the input anchors and supports, and the derivative bounds use the input parameter point. In particular, \(\delta \geqslant 0\).

For a finite family of inserted leaves with supports \(Z_{\alpha}\), nonnegative coefficients \(l_{\alpha}\), attached root sets \(A_{\alpha}\) and leaf weights \(\omega_{\alpha}\), the leaf-scale condition with parameters \((n, \sigma, Y)\) requires \(Y \geqslant 0\), at most \(n\) roots over each coarse site, and

\(\displaystyle \sum_{\alpha : \hspace{0.17em} v \in A_{\alpha}} e^{\sigma N_{B_R} (Z_{\alpha})} \omega_{\alpha} \leqslant Y \qquad \text{for every root } v.\)

The weights \(\omega_{\alpha}\) include the leaf norm and \(l_{\alpha}\), and each positive weight must have an attached root lying in its leaf support. The radius condition at \(\sigma\) is \((\text{rel}_Q + 1) 10 c_{h_Q + 5} / L + 2 \varepsilon_Q \leqslant \sigma\).

A cluster together with chosen leaf insertions has \(N\) remaining occurrences: the sum, over its vertices, of the numbers of input occurrences outside those insertions. It is marked if at least one remaining occurrence comes from \(E\). Thus \(N \geqslant 1\) for a marked cluster, but the other remaining occurrences need not be marked. The insertion count is the total number of leaves, counted with multiplicity. These are the two counts used below.

Lemma 4.10 (quotation and acceptance). Let \(t, u\) be stage profiles, \(C\) a library of order \(\text{ord} (u)\), \(r' \in \mathbb{N}\) and \(h > 0\). There are \(E \geqslant 1\) and \(k\) such that:

Sketch: the quotation theorem of III.10 gives an \(L\)-independent \(E\). Then \(E / L \to 0\) and \(L \sigma_t \to \infty\). The return-fee estimate gives the factor \(L^{- 5}\). Summing over the \(L^4\) fine sites of a block leaves \(E / L\), by the anchored-sum estimate. Lean: inner step of YM.RemainderComparison.Chron.sails; YM.PhysicalNext.JointLoad.Heir.Release.quoting.

Lemma 4.11 (radius cost). If \(b > 0\) and \(b + 2 \varepsilon_Q \leqslant v\), then \((\text{rel}_Q + 1) 10 \hspace{0.17em} c_{h_Q + 5} / L + 2 \varepsilon_Q \leqslant v\) for all large \(L\). In III.15.5, take \(b = \varepsilon_Q\): the target condition gives \(3 \varepsilon_Q < 4 \varepsilon_Q < \sigma_j\).

Sketch: multiply the desired inequality by \(L > 0\) and choose \(L\) so large that \((\text{rel}_Q + 1) 10 c_{h_Q + 5} \leqslant bL\). Lean: YM.RemainderComparison.Lyric.bidLift.

Lemma 4.12 (comparison functions). Fix a target \(Q\), a patch, stages \(E, E'\), a kernel choice, an order datum at \(W\), a songbook, a scrollwork, \(\mu > 0\), and rays satisfying the heart condition for \((E', \text{e}_Q)\). There is a poster \(D\) such that \(d (D) > 0\), its paint-supply condition holds, and its radius, charge and four comparison functions are reserves. Eventually in \(x\), it satisfies the conditional comparison statement, the chart-radius estimates and the axis-chart existence statement required by the poster condition.

Sketch: obtain the radius and chart estimates from the chart construction, and choose the paint constant. The comparison-function theorem applies when the chart parameter is positive; otherwise the chart hypotheses are inconsistent. It requires positive comparison parameters \(a, d\), a subpower bound on the volume function, reserves for the radius, charge and derivative control, paint supply, and orders satisfying \(j + (r + 1) + r + 2 \leqslant n\) and \(n + N \leqslant k\). The ray heart condition supplies these order inequalities. It produces four reserve functions, uniformly over the subsequent step and chart choices. Its conclusion is conditional on local derivative bounds, the chart estimates and coefficient matching: derivatives through order \(j\) of the differences of the expansion coefficients through degree \(r\) have the prescribed bound. The proof combines finite-order exponential bounds, analytic expansion estimates and the assumed coefficient match. Lean: YM.RemainderComparison.Cadenza.Poster.quorum, YM.RemainderComparison.Herbal.compile, YM.RemainderComparison.Herbal.Airstrip, YM.RemainderComparison.Portal.JMatch (proof read; proofs of the analytic expansion estimates not expanded).

Lemma 4.13 (connected-activity structures). Fix an input specification and target \(Q\). There is \(l\) such that, for every \(L \geqslant l\), branching patch, order \(j\), auxiliary choice \(\chi\), \(W, \mu > 0\) and order datum at \(W\), one can choose constants and functions before \(x\) as follows: \(d, v\) have gear \(- \tfrac{1}{2}\); \(B, r, T'\) have rate at most \(0\); and \(p\) is a reserve, with \(T', p \geqslant 0\). Eventually in \(x\), every admissible step record admits a connected-activity structure with the heavy, derivative and marked-input estimates specified by its three accompanying conditions.

Sketch: combine the connected-activity existence theorem with the derivative estimates for its local factors and the marked-input estimate. The growth-class rules keep \(d, v\) at gear \(- \tfrac{1}{2}\) and the remaining stated functions at rate at most \(0\). The structure is chosen separately for each step record; the bounding functions are common to all those records. Lean: YM.RemainderComparison.Halo.seeds (proof read; analytic inputs from III.10).

Lemma 4.14 (remaining-occurrence bound). There is a block-side threshold depending only on the input specification and \(Q\) such that, for every \(L\) above it and every branching patch, the following holds. Fix the remaining data of Lemma 4.13 and \(a \geqslant 0\), \(\varepsilon > 0\) with \(a + 2 \varepsilon \leqslant \text{e}_Q\). One can choose bounding functions such that, for every fixed pair of orders \(I, J\), reserve \(Y\) and nonnegative integer-valued function \(n\) whose real-valued cast is a reserve, there are a reserve \(V\) and a function \(S'\) of gear \(q < 0\) with the following property. Eventually in \(x\), every admissible step record admits a connected-activity structure for which the following holds. For every finite leaf family satisfying the leaf-scale condition \((n (x), \sigma, Y (x))\) and the radius condition at \(\sigma\), every marked input with \(\delta \leqslant \beta_F^{- 11 / 10}\), and every \(m \in \mathbb{N}\), the bills restricted to marked clusters with \(N \geqslant 1 + m\) remaining occurrences and insertion count at most \(I\) satisfy

\(\displaystyle \text{Hit}_{\mathcal{B} (x)} (\text{bill} ; a) \leqslant V (x) S' (x)^m \delta .\)

The derivative order is \(j\) and the support-polynomial order in the bill is \(J\). The bill is formed from the local majorant supplied by the chosen structure.

Sketch: increase the weights of the remaining occurrences by a factor whose inverse has negative gear. On the indicated clusters the inflated product contains at least one marked factor and \(m\) further factors. Apply the weighted cluster bound and divide by those factors. The leaf-scale and radius conditions control the inserted leaves; the insertion cap \(I\) controls the accompanying polynomial losses. Lean: YM.RemainderComparison.Halo.ramp (proof read; weighted-cluster estimates used as inputs).

Lemma 4.15 (restriction to a cluster predicate). Fix an admissible step record, a connected-activity structure, a nonnegative local majorant satisfying its derivative condition, nonnegative leaf coefficients and nonnegative vertex weights \(\gamma\). Let \(a \geqslant 0\), \(e_1, \delta > 0\) and \(q' < 1\). Suppose the polymer majorant has hit bound \(e_1\) at exponent \(a + 2 \delta\), and its degree price with slack \(\delta\) is at most \(q'\). If a cluster predicate \(V\) and \(v \geqslant 0\) satisfy \(1 \leqslant v \prod \gamma\) on \(V\), then the restricted bills have hit bound at exponent \(a\) at most

\(\displaystyle vA_{\delta} (x ; j, m) e_1 (1 - q')^{- 1}, \qquad A_{\delta} (x ; j, m) = [4 (2\mathcal{B}(x) + 1)]^{mj} (mj) ! \hspace{0.17em} \delta^{- mj} e^{\delta} .\)

The bill uses derivative order \(j\) and support-polynomial order \(m\).

Sketch: the logarithmic cluster-tail estimate gives the geometric sum \(e_1 / (1 - q')\). Absorb \((1 + N)^{mj}\) into \(e^{\delta N}\), using \(N^{mj} e^{- \delta N} \leqslant (mj) ! \delta^{- mj}\) with the corresponding shift by \(1\). The spatial factor is \([4 (2\mathcal{B}(x) + 1)]^{mj}\). Finally insert \(v \prod \gamma \geqslant 1\) on the retained clusters. Lean: YM.RemainderComparison.Lyric.gathers, YM.RemainderComparison.Lyric.run.

Lemma 4.16 (anchored bound for marked outputs). There is a block-side threshold depending only on the input specification and \(Q\) such that the following holds for every \(L\) above it and every branching patch. Fix the remaining data of Lemma 4.13 and \(a \geqslant 0\), \(\varepsilon > 0\) with \(a + 3 \varepsilon \leqslant \text{e}_Q\). The connected-activity functions can be chosen as follows. Fix orders \(J, r, I, n, P_0\) with \(2 \leqslant n \leqslant j\), assume \(G\) simple, and fix an auxiliary choice, a reserve \(Y\) and a nonnegative integer-valued function \(i\) whose cast is a reserve, a record with parameter at most \(\tfrac{1}{4}\), and a library of order \(n\). There are a reserve \(V\) and a function \(V'\) of some rate \(q' < 0\) such that, eventually in \(x\), every admissible step record has:

The anchored bound includes regularity and all left derivatives through the output order on the small-field supports. The proof gives \(q' = \max (q, - \tfrac{1}{2})\), where \(q < 0\) is the gear exponent in Lemma 4.14.

Sketch: separate clusters with a single remaining occurrence from those with at least two, and separate supports whose covering number exceeds \(\mathcal{B} (x)\). The single-occurrence contribution uses the quotation bound and the sum over \(L^4\) sites. Lemma 4.14 bounds the other contributions by \(VS'\) and \(e^{- \varepsilon \mathcal{B}} V\). A further local comparison error has rate at most \(- \tfrac{1}{2}\). Their sum defines \(V'\). Lean: YM.RemainderComparison.Solo.atlas (proof read; local singleton estimate used as an input).

Lemma 4.17 (tail bounds). Fix \(L\), \(\mu > 0\), \(a \geqslant 0\), \(b > 0\) with \(a + 2 b \leqslant \text{e}_Q\), and \(\tfrac{3}{8} + \rho_Q < 0\). Fix orders \(j, n, k, s, J\), functions \(B, p_0\) of rate at most \(0\), and a nonnegative integer-valued function \(m\) whose cast has rate at most \(0\). Put \(G_{\ast} (x) = \beta_F (x, L)^{3 / 8}\) and \(\tau (x) = G_{\ast} (x)^5\). Let \(I (x)\) be the additional root-activity bound formed from \(m, p_0\), and let \(\Sigma (x)\) be the resulting tree-sum majorant with derivative factor \(1 + 2^j B (x)\). Eventually in \(x\):

Sketch: the additional root term has rate at most \(- \tfrac{3}{2}\). Thus \(\Sigma\) has rate at most \(\tfrac{3}{8} + \rho_Q < 0\), and the polynomial spatial factors have rate at most \(0\). These facts give the two degree-price inequalities. In the first displayed tail bound the factors \(\tau^k\) and \(G_{\ast}^{- 5 k}\) cancel; \(G_{\ast}^{- 2 s}\) supplies \(\beta_F^{- 3 s / 4}\), sufficient for \(g (\beta)^s\) uniformly on the band. The large marking exponent absorbs the remaining powers in the second bound. Lean: YM.RemainderComparison.Lyric.epochs, YM.RemainderComparison.Lyric.Premium.

Lemma 4.18 (simultaneous derivative and tail estimates). Suppose \(\tfrac{3}{8} + \rho_Q < 0\). There is \(\ell\) such that, for every \(L \geqslant \ell\), branching patch, \(W, \mu > 0\), order datum, auxiliary choice, orders \(j, J, k, s\), and \(a \geqslant 0\), \(\varepsilon, \Delta > 0\) with \(a + 2 \varepsilon \leqslant \text{e}_Q\), the following holds. Fix a reserve \(Y\), a nonnegative integer-valued function \(n\) whose cast is a reserve, and a function \(p_0\) of any fixed finite rate. There are reserves \(A, B, C\) and a function \(E\) of rate \(q < 0\) such that, eventually in \(x\), each admissible step record admits three connected-activity structures with these properties:

The full and marked majorants also satisfy their local derivative conditions. Here \(\beta_H\) is the coupling of the step record; the last bounds are for each fixed \(s\).

Sketch: use separate connected-activity structures for the mass bound, the full bill and the marked bill. Combine the full-bill estimate, Lemma 4.14, Lemma 4.17 and the decay of \(\pi_{\Delta}\) against every function of finite rate. The three structures need not coincide. Lean: YM.RemainderComparison.Muse.generation, YM.RemainderComparison.Muse.Roles (proof read; connected-activity and full-bill estimates used as inputs).

Lemma 4.19 (extending the comparison functions). Suppose \(G\) is simple and \(\tfrac{3}{8} + \rho_Q < 0\). There is \(\ell\) such that, for every branching patch of side at least \(\ell\), \(W, \mu > 0\), order datum, songbook, scrollwork, auxiliary choice, mark number \(r\), stage \(E'\), rays with the heart property, library of order \(\text{ord} (E')\), record with parameter at most \(\tfrac{1}{4}\), and financed poster \(D\), there is a quarry \(F\) extending \(D\), chosen before \(x\), such that:

Sketch: take the new reserve functions and the finite-rate tail function from Lemma 4.18. The tree-sum bound is twice the polynomial spatial factor times the connected-activity majorant, whose rate is at most \(\rho_Q\). Take \(h = V'\) from Lemma 4.16 and apply that lemma with an empty leaf family. The additional tail function is a field of the quarry but carries no separate growth assertion in its financing condition. Lean: YM.RemainderComparison.Cadenza.rollBefore, YM.RemainderComparison.Cadenza.Instructions, YM.RemainderComparison.Cadenza.Quarry.Staked, YM.RemainderComparison.Cadenza.Quarry.Bequest.

Lemma 4.20 (III.15.6). Under the hypotheses of III.15.6, the quay condition holds for all sufficiently large block sides.

Sketch: take \(n\) from 4.19. For given data, 4.12 gives a poster, and 4.19 extends it to a quarry. The remaining step conditions hold eventually in \(x\) by their local analytic estimates and the scrollwork growth condition. Take \(P_1\) beyond all of these thresholds. Lean: YM.RemainderComparison.Cadenza.buoys (proof read; individual local analytic estimates not expanded).

Lemma 4.21 (III.15.5). Under the hypotheses of III.15.5, the launch data exist.

Sketch: for each \((j, i)\), take \(k_{ji}\) (4.10), \(g_{ji}\) (4.20) and \(n_{ji}\) (4.11). Set

\(\displaystyle f_j = \max_{i \in \{j, j - 1\}} g_{ji} + \max_{i \in \{j, j - 1\}} k_{ji} + \max_{i \in \{j, j - 1\}} n_{ji}\)

and take \(C'_{ji} = E_{ji}\) from 4.10. Lean: YM.RemainderComparison.Chron.sails.

Lemma 4.22 (III.15.7). Under the hypotheses of III.15.7, the quarries and a common enlargement of the delay data exist.

Sketch:

  1. For each stage pair and slot, apply the pledge at \(L = L_j\) (allowed since \(k_j \leqslant L_j\)) to the slot's data. The chosen rays have the heart property because \(\sigma_i + 3 < \text{e}_{R_{ji}}\). This gives a quarry \(V_{jig}\) and a threshold. The slot's extra condition holds eventually.

  2. Set \(\text{shells}_j = \max (\text{shells}_j (T_0), \max_{i \in \{j, j - 1\}, g} (4 \ell_g + 50))\) and \(\text{growth}_j = \max (\text{growth}_j (T_0), 1)\). The inner maximum is \(0\) when there are no request slots. Tiling follows from the scrollwork growth conditions.

  3. Since there are finitely many slots and two stage pairs per \(j\), choose \(\beta^{\ast}_j\) beyond all thresholds.

Lean: YM.RemainderComparison.Chron.grows.

4.6 Records and other fragments (Part D)

The construction-run record collects local estimates, growth of the copy count, bounds for the selected representations, and the conditions required for later OPE and comparison arguments. Its fields are established when the run is assembled. The additional-expense records collect the hypotheses needed on the same selected run. The readout record extends three primitive conditions and adds a growth condition, a bound on block sizes by an iterated logarithm of the coupling, and cross-stage comparison inequalities.

The unit also contains numerical definitions and lemmas for the RG05 readout, the scale functions, and the instrument and postage records. These are not all mere projections: some prove asymptotic and transport estimates. The readout formulas and the remaining RG12 and R2I fragments are outside the detailed statements above; see §7.

Lean: YM.PhysicalNext.Repeat.Legato.R2I.Funded, YM.PhysicalNext.Repeat.Legato.R2I.Extras, YM.Integration.RG05Preconstruction.PrimitiveExtras, YM.Integration.RG05Preconstruction.ReadoutPurchase.

5. Where the difficulty lies

The active outputs III.15.1–4 require uniform estimates in the coupling band and the volume. In III.15.1, the threshold must work for every \(\beta\) in the band and every \(B \leqslant \mathcal{B} (y)\). In III.15.3–4, the constants depend on derivative order and path length but not on \(t\) or the torus side. The single-word representation and unitarity give that independence.

Part C adds the conditional comparison bounds to the selected run, but those bounds are discarded in the final construction-run theorem. Its main estimates concern an inherited marked family: the anchored bound \((C' / L + o (1)) \delta\) and the geometric gain per additional remaining occurrence. Their application requires the leaf-scale, radius, quotation and local analytic conditions. The gain counts all remaining occurrences, with at least one marked occurrence.

The exponent \(\tfrac{3}{8}\) is the tree-weight exponent inherited from III.10. Requiring \(\rho_Q < - \tfrac{3}{8}\) makes the relevant tree-sum majorant decay; the run's choice \(\rho_Q < - \tfrac{7}{16}\) leaves a margin greater than \(\tfrac{1}{16}\). The large-side threshold is independent of the later auxiliary data. The comparison functions and entry-coupling threshold may depend on those data, and the estimates then hold for all larger \(x\).

6. Notation

Written proof Lean (glossary) Meaning
\(g (\beta)\) YM.Next.Scheduling.Clock.gap, gStep \(\beta^{- 1 / 2}\)
\(p (x)\) YM.Next.Scheduling.Instrument.P (plain), YM.Next.Scheduling.Clock.watch \(2\) \(e^{(\log \log x)^2}\)
\(t (x)\) YM.Pressure.temp, YM.Next.Scheduling.Instrument.t small-field threshold \(g (x) p (x)\)
\(\mathcal{B} (x)\) YM.Pressure.radiusB, YM.Next.Scheduling.Clock.cover cluster radius \(\lceil (\log x)^2 \rceil\)
\(\beta_F (x, L)\) YM.Pressure.betaF \(x + b_G \log L\)
band of \(y\) YM.Next.Scheduling.inBand \([y / 4, 4 y]\)
\(\text{Rate}_L (a)\) YM.ConnectedActivityE6.Rate \(\lvert w \rvert \leqslant \beta_F^v\) eventually, for every \(v > a\)
reserve; \(M (x)\) YM.RemainderComparison.Reserve, YM.Push.AbsoluteSums.Delay.fineMonitor \(\lvert w \rvert \leqslant M^k\) with \(M = p (\beta_F)\)
gear \(a\) YM.RemainderComparison.Gear \(\beta_F^{- a} w\) is a reserve
\(\text{Hit}_M (f ; a) \leqslant \gamma\) YM.Ac.Hit weighted per-site polymer bound
\(\text{quote} (\kappa, \gamma)\) YM.Bid.quote \(e^{- \kappa} (e^{\gamma} - 1)\)
rate conditions \((B, w, a, b, \kappa)\) YM.Progress.DirectedRecipe.Payments.Rates the five inequalities of III.15.1
mild, strong, \(\kappa\) YM.Progress.DirectedRecipe.Payments.Pairing (mild, strong, kGoal) power-decaying and Gaussian pair-step costs
hard and soft family YM.Progress.DirectedRecipe.Payments.hardCost, YM.Progress.DirectedRecipe.Payments.softCost forced activities and local exponential corrections
Ingredients YM.Progress.DirectedRecipe.Ingredients input to the fusion of III.10
slot \(s\), atom \(a\) Slot, Atom (III.1) transported curvature; \(k\)-leg monomial
small-field on \(X\) YM.RG.Healthy plaquettes touching \(X\) within chord \(t\) of \(1\)
admissible direction YM.RG.BudgetPoint.dirBound \(\lVert A_e \rVert \leqslant t (1 + \text{dist} (e, o))^P\)
\(\text{slotCost}\), \(\text{margin}\), \(\text{price}\) YM.Next.Scheduling.Wages.slotCost, YM.Next.Scheduling.Wages.margin, YM.Next.Scheduling.Wages.price derivative constants of III.15.3–4
target \(Q\); \(\rho_Q\), \(\text{e}_Q\), \(\varepsilon_Q\) YM.ConnectedActivityE6.Target connected-activity target (rate, exponent, …)
\(\beta_F^{3 / 8}\) YM.PhysicalNext.Repeat.Height.grow per-vertex tree weight (III.10)
pledge YM.RemainderComparison.Chron.Pledge launch conditions (1)–(2) of III.15.5
quay YM.RemainderComparison.Cadenza.Quay all step conditions available at side \(L\)
quarry, financed YM.RemainderComparison.Cadenza.Quarry, YM.RemainderComparison.Cadenza.Quarry.Financed bounding functions of \(x\) with reserve/rate bounds
Pillar YM.RemainderComparison.Chron.Pillar pledge plus per-slot allotments and tilings
radius cost YM.RemainderComparison.Lyric.radiusCost \((\text{rel}_Q + 1) 10 c_{h + 5} / L + 2 \varepsilon_Q \leqslant v\)
comparison estimate YM.RemainderComparison.Herbal.Airstrip, YM.RemainderComparison.Portal.JMatch interacting vs. model, with jets matched to order \(r\)
heart condition YM.RemainderComparison.Cadenza.Rays.Heart support and order inequalities stated before III.15.6
\(B_P, t_P\) YM.RG.BudgetPoint cluster radius and threshold of a parameter point
support enlargement YM.PhysicalNext.JointLoad.Heir.Walled \(Y\) lies within distance \(r\mathcal{B} (x)\) of the coarse image of \(X\)
local analytic smallness YM.PhysicalNext.JointLoad.Heir.Lute.Plented numerical hypothesis on the return fee
library compatibility YM.PhysicalNext.JointLoad.Heir.Plays registered local estimates for the library
marked input YM.RemainderComparison.Halo.Presents derivative bounds on an inherited regular subfamily
leaf-scale condition YM.RemainderComparison.Lyric.Scale nonnegative weights, attached roots, rooted bound and occupancy
\(N\); marked cluster YM.RemainderComparison.Halo.gross remaining occurrences after removing leaf insertions
insertion count YM.RemainderComparison.Lyric.notes number of inserted leaves, with multiplicity
\(A_b (x ; j, J)\) YM.ConnectedActivityE6.Blaze.March.collars polynomial spatial factor in Lemma 4.15
\(\pi_{\Delta} (x)\) YM.RemainderComparison.Sleet.pigment \(e^{- \Delta \lfloor \mathcal{B}(x) / 100000 \rfloor}\)
tempered point YM.RemainderComparison.Cadenza.Temper agreement of scale, threshold and stage parameters
comparison structure YM.RemainderComparison.Portal.Pan analytic expansion data and coefficient match
\(\iota_G\); \(\mathcal{P}_G\) YM.Gauge.colorMat, YM.Gauge.projectColor colour-to-matrix map; normalized colour projection
\(I (x)\); \(\Sigma (x)\) YM.RemainderComparison.Lyric.ink, YM.RemainderComparison.Lyric.salaries additional root term; tree-sum majorant in Lemma 4.17
\(\text{pledge} (x)\) YM.PhysicalNext.Repeat.Daisy.pledgeQ tail coefficient in Lemma 4.17
marked cluster YM.RemainderComparison.Halo.dyed a remaining occurrence belongs to the inherited family

7. What remains unexplained

  1. Scope of Part C. The selected-run theorem retains its comparison data as an additional conjunct; the final construction-run theorem discards that conjunct. A written proof using only the final run properties can omit these comparison conclusions. An all-order expansion using them would also have to supply the coefficient-matching hypotheses; existence of the comparison functions alone does not supply that match.

  2. Local analytic conditions. The quotation bound and Lemmas 4.12, 4.16 and 4.19 retain the source's support-enlargement, library-compatibility and analytic-smallness conditions. Their full numerical definitions, and the local analytic, readiness, compatibility, resonance and tolerance conditions in III.15.6, remain to be written out. In particular, the local analytic condition attached to a funded step has not been translated into an independent mathematical statement.

  3. Provider proofs. The assembly proofs in §4 have been read. The deeper proofs of the local singleton estimate, weighted-cluster bounds, full-bill estimates and analytic expansion estimates have not all been checked here. The contraction and occurrence-count statements are consequences of the cited conditional estimates, not unconditional bounds for arbitrary local terms.

  4. Historical interpretation. The estimate \(L^{- 5}\) per fine site and its conversion to \(L^{- 1}\) per coarse block are explicit. Identifying it with a particular dimension-five operator is not justified by those inequalities alone. The reason for the choice \(\tfrac{3}{8}\) belongs to III.10's tree estimates.

  5. Other fragments. The construction-run, additional-expense and readout record statements have been read. The RG05 readout price formulas and their proofs, and the remaining RG12 and R2I fragments, are not covered by the detailed verification. The thermodynamic fragment also includes eventual numerical estimates and a delay-enlargement lemma; it is not solely a collection of definitions.

← III.14 The construction run: flat representations and the ultraviolet rate (notes)Part III·Unit outlineIII.16 Analytic toolkit (notes) →