1. What this unit proves 2
2. What it uses 5
3. Strategy 6
4. Steps 6
5. Where the difficulty lies 6
6. Notation 7
7. What remains unexplained 7
Code dependencies 7
Lean source 7
Additional source locations 8
Key statements 11
Part III — Ultraviolet construction (renormalization group).
Explains the order in which constants and scales are chosen so that the renormalization estimates hold together.
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.1 · Next: III.3 →
Results · Inputs · Strategy · Proof steps · Notation · What remains unexplained · Code dependencies · Lean source · Key statements
Part: III, Ultraviolet construction (renormalization
group). Lean: YM/Price/
(the constants and the level schedule, 406 lines), YM/Shoot/
(shooting, 228 lines), YM/Integration/RG05Preconstruction/,
YM/Integration/NativeSelection/ and other
files of YM/Integration/, YM/RG08/Calendar/, and parts of YM/RG08/,
YM/RG12/, YM/FullVolume/
(in particular Roll/) and YM/TraceExtension/.
Size: 18,156 lines in the source allocation.
Source inventory and conventions
Proposition III.2.1 (order of choice). For simple \(G\), choose:
A sheet: kernel \(K\) with branches on every patch; first stage \(j_0 \geqslant 4\); floors \(f_j \in \mathbb{N}\); stage records with a clip of relaxation \(r_j\), derivative orders \(k_j \geqslant 6\), spatial powers \(q_j \geqslant 2\), support exponents \(a_j > 0\), widths \(w_j > 0\), path counts \(\varpi_j > 0\), drift allowances \(\omega_j \geqslant 0\), column bounds \(\gamma_j \geqslant 1\), \(r_j w_j \geqslant 12\); nondecreasing \(k, q, a\).
Nondecreasing odd \(\ell_j \geqslant \max (3, f_j)\), with, for \(j \geqslant j_0\),
Positive nonincreasing \(\theta_j \leqslant 1 / j\) for \(j \geqslant j_0\).
Unrestricted delays: real entry couplings \(\beta^{\text{ent}}_j\), real barrier-dependent entry scales \(\sigma^{\text{ent}}_j (\bar{\beta})\), natural shells \(S_j\) and exponents \(g_j\).
A barrier \(\bar{\beta} > 1\), with \(\bar{\beta} \geqslant \beta^{\text{ent}}_{j_0}\), with \(x^{- 1 / 2} e^{(\log \log x)^2} \leqslant 1\) for every \(x \geqslant \bar{\beta}\).
A wait: real readiness scales \(\sigma^{\text{rdy}}_j\), windows \(h_j : \mathbb{R} \to \mathbb{N}\) with \(h_j (s) / s \to 0\) as \(s \to \infty\) for each fixed \(j\), and natural \(n_{\min}\).
Delays and waits are ordered componentwise. Factors exist for every sheet; \(\theta\) can lie below any prescribed positive sequence; barriers exist above any prescribed real. Status: definitions and three existence theorems. Lean: Sheet, Rolls.exists_rolls, Protection.exists_margin, Bar.exists_above.
Proposition III.2.2 (schedule). For simple \(G\) and any III.2.1 data, there are \(J_m\), \(L_m = \ell_{J_{m + 1}}\), \(n_p = 4 (M + p + 1)\) with natural \(M\), retaining the prescribed data, such that:
\(J_0 = J_1 = j_0\); \(J\) is nondecreasing, increases by at most one, and diverges; \(k_{J_m}, q_{J_m}, a_{J_m}\) are nondecreasing.
For every \(m\), \(\beta^{\text{ent}}_{J_{m + 1}} \leqslant \hat{\beta}_m\); also \(\sigma^{\text{ent}}_{J_{m + 1}} (\bar{\beta}) \leqslant s_m\) if \(J_{m + 1} > j_0\).
For every \(m, p\), with \(j = J_{m + 1}\): \(n_p \geqslant n_{\min}\), \(S_j (1 + B_m + B_{m + 1})^{g_j} \leqslant n_p e^{s_m}\), \(100 (B_m + 1) \leqslant n_p e^{s_m}\), \(100 (R_m + 1) \leqslant n_p e^{s_{m + 1}}\).
Each \(j \geqslant j_0\) has some \(k\) with \(\sigma^{\text{rdy}}_j \leqslant s_k\), \(h_j (s_k) \leqslant k\), and \(J_i = j\) for \(|i - k| \leqslant h_j (s_k)\).
\(\hat{\beta}_m > 1\), \(t_m \leqslant 1\), \(0 < \theta_{J_m} \leqslant 1 / J_m\); \(\omega_{J_{m + 1}} / \log L_m\) and \(\log \mathcal{C}_{J_{m + 1}} / \log L_m\) are at most \(J_{m + 1}^{- 2}\); \(\log L_m / s_m \to 0\). Kernels are well posed, lattice symmetric and gauge covariant.
Every positive integer divides \(n_p\) infinitely often. Status: theorem; divisibility variant in III.10. Lean: Wait.ready, Wait.engine.
Proposition III.2.3 (shooting). Let \(G\) be simple; fix a level system with \(\omega_{J_{m + 1}} \leqslant (\kappa / 4) \log L_m\) and a recipe prescribing paths \(P^{\mathcal{R}}_{N, m}\) and start, retention and transition tests. Admissibility requires these paths, the level budget point and clip, width \(w_{J_m}\), path count \(\varpi_{J_m}\), loop cap \(2 M_m^{\theta_{J_m}}\), allowances \(\hat{\beta}_m^{- 11 / 10}, e^{- M_m^{1 / 5}}\), and retention. Continuity requires continuous \(\beta, v\), fixed activity address sets, and differences tending to zero in summed budget masses of regular derivative bounds through budget order on the healthy domain and forced uniform bounds on all configurations.
Assume, for every \(N, p\), a continuous admissible Wilson start family on \(\mathfrak{B}_N\) with coupling equal to its parameter, \(v = 0\), density equal to the Wilson weight at that coupling, passing the start test. Assume also that every continuous admissible level-\((m + 1)\) family on any \([l, u]\) with \(l \leqslant u\), \(m < N\), with couplings in \(\mathfrak{B}_{m + 1}\), admits a continuous admissible level-\(m\) family whose density is its block-spin push-forward at the input coupling, passing the transition test, with \(| \beta' - \beta - \kappa \log L_m | \leqslant \omega_{J_{m + 1}}\).
Then for all \(N, p\) a selected history exists: admissible representations in \(\mathfrak{B}_m\), Wilson top with \(v = 0\), these transitions, \(\beta_{N, p, 0} = \bar{\beta}\), paths independent of \(p\). For every \(\varepsilon > 0\), some \(m_0\) gives \(| \beta_{N, p, m} - \hat{\beta}_m | \leqslant \varepsilon s_m\) for all \(N \geqslant m \geqslant m_0\), all \(p\). Status: conditional theorem; hypotheses discharged in III.10. Lean: Recipe.races.
Proposition III.2.4 (joint purchase). Assume simple \(G\), kernel \(K\) branched on every patch, first stage \(\geqslant 4\), nondecreasing \(k_j \geqslant \max (6, j)\), \(q_j \geqslant \max (2, j)\), \(a_j \geqslant 100\), nondecreasing \(Q : \mathbb{N} \to \mathbb{N}\) with \(Q_j \geqslant 1\), records \(\Omega, \Delta\), degree-\(300\) tableau at \(\xi\) and contraction condition sphere at \((\xi, \omega_v, \omega_t)\), with \(\xi \geqslant 2\), \(0 < \omega_v \leqslant 1\), \(\omega_t > 0\), and prediction \(\pi\) prepaid at every sheet and price map.
There exist a sheet \(s\) preserving the prescribed kernel, first stage, derivative orders, powers and support exponents, price map \(T\), real sequence \(Y\), nondecreasing \(K' \geqslant 1\) and floor \(\tau \geqslant f^s\). For every floor \(k \geqslant \tau\), factors exist; for every block-factor sequence \(\ell\) for \(s\) with floors \(k\) there is \(U\); for every wage \(w \geqslant U\), postage rate and exchange datum there are post-\(L\) costs; for every positive \(\theta^0\) there is protection \(\theta \leqslant \theta^0\); for every menu, auxiliary record and delay \(T_0\) there is \(V \geqslant T_0\); for every \(V' \geqslant V\), barrier and wait \(W\) there is \(Z \geqslant W\); for every \(W' \geqslant Z\) and level system meeting III.2.2 with divisible periods there are a directed datum and factor \(X\) recording these choices, satisfying \(\pi (X)\).
Wages, exchanges, menus and auxiliary records equal the prescribed data; postage rates do not exceed the prescribed rates. The same factor satisfies the III.12 conditions Degree, Savvy, Roofing, PaysW, Spire, Wild, Tower.Sav with Canyon, Cadre, AccordV with \(Q\) (III.11), top kinetic data (III.9), amplification (III.1), and a bandage with extras \((\Omega, \Delta, b)\) (III.15). Support exponents are \(\geqslant 100\); \(e^{(a_j + 2) (2 \hspace{0.17em} \text{span}_{ij} + 13)^4} \leqslant \ell_i\) for \(j \leqslant i \leqslant j + 1\). The bandage also supplies the conditional family package Unlatched with a vacuous additional conclusion, under the family hypotheses of III.2.5. Status: theorem. Lean: richFaresWithPrediction.
Proposition III.2.5 (plentiful construction). Under III.2.4 and \(Q_i \geqslant 2\), its conclusion additionally ensures: every compatible trajectory, reference levels with \(d + 3 \leqslant J_{t (d)}\), section transfers and consecutive gauge doors satisfying family consistency, door compatibility and prescribed transfer bounds from level \(t (d)\) whenever \(t (d) \leqslant N\) give, for every extraction order, the complete weak-continuum requirement (III.11) and trace gallery (VII.2). Floors, delays and waits may increase; the prediction persists. Status: theorem. Lean: plentifulWithPrediction, Unlatched.
Proposition III.2.6 (prediction). Let \(\pi\) be a prediction. For simple \(G\), a sheet with the perceived-estimate package of detailed Lemma 4.16 at fixed tariff and scope, and \(\tau > 0\), suppose: for every choice of targets with the canonical chart, expenses with deficit \(- 7 / 16\), programs, initial wages and baton there is a floor \(u\); for every floor \(l \geqslant u\), factors, wages, duration bounds, register, postage, scouts, protection, step records with \(\varepsilon \leqslant 1 / 4\) on transitions with output stage at least the first stage, post-\(L\) costs and delay \(V\), there is \(W \geqslant V\); for every later delay, barrier, wait, pricing record, directed datum and remaining factor data, shelter and step conditions and divisible periods imply \(\pi\) on the assembled factor. Then the complete native purchase of detailed Lemma 4.17 retains \(\pi\) on the emitted factor, on level systems with divisible periods, maximizing its floor with \(u\) and inserting \(W\) before its booth and final delay. Status: theorem; used with vacuous prediction. Lean: company, Prepaid.
Proposition III.2.7 (complete run). Given simple \(G\), penalty \(b > 0\), records \(\Omega, \Delta\), custody request \(\mathcal{H}\), eventually paid \(\Lambda\), and a demand assigning every sheet and price map nonempty choices \(c\), floors \(e_c : \mathbb{N} \to \mathbb{N}\) and real arrays \(F_c (n, i), F'_c [\ell] (n, i)\), there is a run with a campaign, penalty \(b\), preselection \(s, q, c\), and floor \(n \geqslant \max (f^s, e_c)\). It uses \(s\) with floors \(n\) and the price map derived from \(q\); both arrays are paid as in III.2.8(b), using actual \(\ell\), and \(F'_c [\ell] (0, J_{m + 1}) \leqslant \hat{\beta}_m\) for all \(m\). Orders satisfy \(k_j, q_j \geqslant j\); \(\Lambda\), treasury funding, common-period funding, pillars, the funded, news and read-out records, custody and sky hold. Any universally prepaid prediction can persist. Status: theorem. Lean: selectRunWithTreasuryPeriod_preselected_quote_orders_postnumeric.
Proposition III.2.8 (persistent payments).
(a) Eventually paid means: for every sheet, factors, protection and delay \(V\), some \(X \geqslant V\) ensures the property for every delay \(W \geqslant X\), every barrier and wait, and every system meeting their entrance conditions. Conjunction preserves it.
(b) For every real array \(F (n, i)\), eventually paid are \(1 \leqslant 1 + \log \log \hat{\beta}_m\) at all levels and: for every \(n\), eventually in \(m\), \(|F (n, i) | \leqslant 1 + \log \log \hat{\beta}_m\) for all \(i \leqslant J_{m + 1}\). For every real sequence \(F\), \(F (J_{m + 1}) \leqslant \hat{\beta}_m\) at all levels is eventually paid.
(c) Every countably encoded family of requests (stage floors and costs depending on the transition, block geometry and stage record \(X_{J_m}\) at step \(m\)) has a common floor \(\text{pre}\) fixed before factors. If \(\ell_j \geqslant \text{pre} (j)\) at every stage, every delay can be enlarged so every later delay, any barrier and wait, and every admitted system satisfy, for \(\text{code} (\alpha) \leqslant J_n\), \(m \geqslant n\), \(\text{pre}_{\alpha} (J_{m + 1}) \leqslant L_m\) and step cost \(\leqslant 1 + \log (2 + \log \hat{\beta}_m)\).
(d) For simple \(G\) and every kernel, a plan fixes charge names and dictionaries of finite words and spectra for every request before factors. Above its floor, delays can be enlarged persistently to fund requests and the inverse charge from level zero. Status: definition in (a); theorems. Lean: EventuallyPaid, eventuallyPaid, minDelay, buy.
Proposition III.2.9 (analytic estimates). Norms are componentwise exponentially weighted displacement \(\ell^1\) norms, summing colour indices for multilinear kernels; colour spaces are fixed and finite, and constants may depend on them. Crosses map coarse fields to fine fields at block size \(L\). Vanishing orders concern symbols at zero momentum.
For \(\sigma, \tau > 0\), real \(C\), natural \(d\), some \(0 < \eta \leqslant \sigma\), \(K \geqslant 0\) give \(\|A^{\textsf{T}} RB\|_{\tau} \leqslant KML^{2 - d}\) for positive odd \(L\) with \(\tau \leqslant L \eta\), \(\|A\|_{\tau} \leqslant C / L\), \(\| \nabla^s B\|_{\tau} \leqslant C / L^{1 + |s|}\) through order \(d\), \(M \geqslant 0\), \(\|R\|_{\sigma} \leqslant M\), and vanishing order \(d\). For one-form rows, \(d = 3\) gives \(ML^{- 1 / 2}\) for all sufficiently large odd \(L\). pullback_gain, large_contraction.
For natural \(r, d\), \(\sigma, w > 0\), \(C \geqslant 0\), some \(0 < \eta \leqslant \sigma\), \(K \geqslant 0\), fixed before \(L\), give transfer bound \(KBL^4 / L^{r + 1 + d}\) at width \(w\). Assume a real \((r + 1)\)-linear kernel of width \(\sigma\), bound \(B\), supported on tuples with first site zero, vanishing order \(d\) in independent momenta; positive odd \(L\), \((r + 2) w \leqslant L \eta\); crosses with \(\| \nabla^i Q\|_{(r + 2) w} \leqslant C / L^{1 + |i|}\) through order \(d\); transfer through \(r + 1\) copies of \(Q\), followed by symmetrization and recentering. flow_soft.
For finite coordinates \(I\), natural \(n\), \(\sigma > 0\), some \(0 < \eta \leqslant \sigma\), \(K \geqslant 0\) ensure: every real kernel \(f : \mathbb{Z}^I \to \mathbb{R}\) of weighted bound \(A \geqslant 0\), vanishing order \(n\), has real kernels \(g_b\) of bound \(KA\), width \(\eta\), with \(\hat{f} (p) = \sum_b \prod_{a = 1}^n (e^{ip_{b (a)}} - 1) \hat{g}_b (p)\) for all real \(p\), where \(b : \{1, \ldots, n\} \to I\). real_difference_division.
Fix step scenes with input coupling tending to infinity, leaves, cutoff parameter, radii satisfying the logarithm-chart conditions and fluctuations \(z_i\); put \(H_i = \frac{1}{2} \log \beta_i^{\text{out}}\), \(\eta_{\ast, i} = e^{- H_i}\). Assume fluctuation bounds, leaf weights and third-derivative bounds \(D_i\) have upper exponential rate zero relative to \(H_i\); eventually leaves are masked regular logarithmic terms whose threshold-squared expressions have zero first derivative at zero and derivatives through order three bounded by \(D_i\) on the unit ball; \(\pm z_i\) are healthy; both cutoffs equal one near the origin in the two deformation parameters. Here upper rate \(a\) means an eventual bound \(e^{rH_i}\) for every \(r > a\). Writing \(P_i\) for the paved expansion, for every \(\varepsilon > 0\), eventually \(\|D_y^2 (P_i (z_i ; y) + P_i (- z_i ; y)) |_{y = 0} \| \leqslant \eta_{\ast, i}^{2 - \varepsilon}\). mirror_price.
Fix a representation, degree-\(d\) frame and section readable at the origin for the representation’s budget. Two prescribed coefficient presentations with equal section densities, remainder bounds \(a, b\) and the same positive forced parameter satisfy \(\|x_P - x_Q \|_{\text{coeff}} \leqslant K_{F, H} e^{- a_{\ast} m} (a + b)\) for every natural \(m\) with \(10 (m (4 B + 2) + 2 B) < n\). Regular terms have supports containing zero, vanish at identity and have zero local degree-\(d\) projection on nonwrapping supports; nonzero forced supports contain zero and satisfy eligibility, support, gauge-invariance and measurability conditions. unique_part.
Further estimates concern the post-block Hessian (design), cubic and quartic coefficients (tanker), and trace insertion (cloche). Status: theorems under the displayed hypotheses; only statements of these supplementary estimates are included in the notes.
I.1: \(\kappa > 0\); III.1: calendars, histories, branches; III.9: reference quantities and Wilson startup; III.10: one-step construction and divisible periods.
III.11–III.12, III.15, VII.2: purchased conditions; III.14: demand and external records; III.16: strip and Laurent norms and jets. Free-kernel and stationary-branch inputs: III.3 and III.6 (probable).
Intermediate value theorem, compactness, logarithmic asymptotics, countable diagonal enumeration.
The coupling shift with error \(\omega\) is an input to shooting, supplied by III.10 (Graces.winnow). Positivity of \(\kappa\) comes from slopeConstant_pos.
Choose stage data before factors, then costs, protection, delays, barrier and wait. Maxima combine floors; persistent increases combine delays and waits. Long plateaux provide comparison windows; exponential side growth pays volume demands. Shooting narrows continuous Wilson families into successive coupling bands until the level-zero coupling equals \(\bar{\beta}\). The shooting windows are \([\bar{\beta} + (\kappa / 2) s_m, \bar{\beta} + 2 \kappa s_m] \subset \mathfrak{B}_m\).
Exhaustion. Long plateaux meet entry and window thresholds; one period offset pays the finite first plateau. Program.exhaust, Wait.ready.
Narrowing. Endpoint drift inequalities straddle the next window; first and last hitting points give a subinterval mapping entirely into it. Iterate downward. gates, narrow, steps.
Running law. The coupling error is bounded by \(\sum_{k = 1}^m \omega_{J_k} = o (s_m)\) using \(J_k \to \infty\). trajectory.
Diagonal payment. Raise entry couplings above double exponentials of finite partial sums of array entries. Since \(J_m \to \infty\), every fixed row is eventually included. eventuallyPaid.
Composition. Combine sheet and native suppliers, joint and trace purchases and persistent payments by maxima of floors and transitivity of delay and wait bounds. Choose the schedule only after these increases, then assemble the run. sailsW, plentifulWithPrediction, engageWithCustodyFactor.
Analytic gains. Move differences from vanishing kernels onto crosses: their two bounds give \(L^{- 2}\), fine-site summation gives \(L^4\), and \(d\) differences give \(L^{- d}\). Reflection cancels odd terms; local projection leaves exponentially small wrapping contributions. pullback_gain, mirror_price, unique_part.
Factor-dependent costs require later persistent thresholds. Shooting needs full-family continuity and band membership throughout each interval. The \(\kappa / 4\) drift bound separates endpoints; \(j^{- 2}\) controls accumulated error. Each row is paid eventually; the zeroth post-\(L\) row needs separate all-level payment.
\(m = 0\) is coarsest, \(N\) finest; \(p\) indexes volume, \(j\) stages. \(s_m = \sum_{i < m} \log L_i\), \(\kappa = 11 C_G / (24 \pi^2)\), \(\hat{\beta}_m = \bar{\beta} + \kappa s_m\), \(\mathfrak{B}_m = [\hat{\beta}_m / 2, 2 \hat{\beta}_m]\), \(M_m = e^{(\log \log \hat{\beta}_m)^2}\), \(t_m = \hat{\beta}_m^{- 1 / 2} M_m\), \(B_m = \lceil (\log \hat{\beta}_m)^2 \rceil\), \(R_m = (J_{m + 1} + 3) L_m\). In read-out, \(n, B, a_{\ast}\) are side, cover size, support exponent; \(K_{F, H}\) depends on the frame and holonomy tests. \(\text{span}_{ij}\) is transition support; a prediction is a predicate on the factor recording all choices. Stage records, protection and admitted entrance conditions are Stage, Protection and Paid.
Purchased predicates need comparison with their owning units. Underlying analytic suppliers and dictionaries lack independent verification here; drift normalization against III.9 remains unresolved. Odd-cancellation scenes, coefficient and readability interfaces and auxiliary parameters need fuller mathematical accounts. Supplementary Hessian, coefficient-extraction and trace-insertion proofs remain unexplained.
Detailed notes: the full account of this unit, with proof sketches for every step, is on the detailed notes page.
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.10, VII.2, III.12, III.7, VII.1, III.16, III.6, II.1, III.3, III.9, III.11, III.4, III.15, II.2, VIII.1, III.5, VII.6, VII.4, IV.1.
Referenced by: III.12, III.13, III.10, III.9, III.11, VIII.1, III.4, VII.1, III.15, III.6, III.14, III.1, VII.4, III.7, V.2, VII.2, II.1.
Source allocation: 18,156 attributed lines; 2,085 line-counted declarations; 2,536 assigned declaration names. Of the assigned names, 2,491 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.
proof of plentifulWithPrediction — 6,253 lines.
proof of joinExpensesShipWithPrediction — 4,674 lines.
proof of selectRunWithTreasuryPeriod_preselected_quote_orders_postnumeric and the results it chains to — 4,010 lines.
proof of joinRadarsShipWithPrediction — 2,398 lines.
work package YM/Price/ — 406 lines.
work package YM/Shoot/ — 228 lines.
proof of richFaresWithPrediction — 164 lines.
work package YM/Integration/NativeSelection/ — 17 lines.
work package YM/RG17/Clearance/ — 6 lines.
Further pinned locations for the definitions and comparisons discussed in this unit.
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.
K-III.2.1 Sheet (numbered result) — A record of numerical and kernel data fixed before any block ratios are chosen.
K-III.2.2 Large (numbered result) — A predicate stating that numeric largeness conditions hold at a given smoothing stage for a threshold L.
K-III.2.3 Protection (numbered result) — A record freezing a parameter theta that accommodates all contributing requests after L is chosen.
K-III.2.4 Bar (numbered result) — A record giving a smallness barrier independent of the first spacing.
K-III.2.5 enters (numbered result) — For a simple group and stage past the first, waiting long enough in the coarser scale ensures beta, scale, length, and volume-bill conditions hold uniformly.
K-III.2.6 Paid (numbered result) — A record stating that a bundle of entrance-gate and level-0 conditions holds for a schedule of levels.
K-III.2.7 ready (key result) — There exists a level schedule for which all requested estimates (the whole calendar) are paid.
K-III.2.8 races (key result) — For a simple gauge group, if the recipe issues data at every scale and the coupling drifts, there is a trajectory that stays and produces a selected object.
K-III.2.9 sailsW (main result) — For a simple gauge with kernel choices, there exists a sheet with prices and parameters such that for all tariffs and scopes a perceived-estimate package holds along suitable scale sequences.
K-III.2.10 design (numbered result) — A sharp post-block Hessian bound for the isolated step under unscaled derivative bounds.
K-III.2.11 richFaresWithPrediction (key result) — Under a prediction and pricing hypothesis, there is a sheet, price map and eventual threshold giving the joint RG/UV purchase with prediction retained.
K-III.2.12 joinRadarsShipWithPrediction (key result) — There exist a sheet and prices such that the joint same-factor procurement with prediction holds for all later choices of parameters and payments.
K-III.2.13 company (key result) — The complete native purchase can be performed with an additional prediction holding on the same emitted factor.
K-III.2.14 tanker (key result) — Given a gauge and bounds, one can choose atoms and widths such that sequences of lattice observables with jet-bounded records are approximated by an emitted base up to fifth-order remainders.
K-III.2.15 tunes9 (numbered result) — Given small epsilon on steps, there is a later delay schedule beyond which Pads9 holds for all further delays.
K-III.2.16 purchasing (key result) — For r>-1, the Medal property holds eventually in x with the power beta^r as the parameter.
K-III.2.17 wallet (key result) — For large s, every admissible horn function with bounded weight gives a gale function that is smooth to order n at 0 and whose order-2 norm is at most a power of beta.
K-III.2.18 yields (numbered result) — Counter and inspected hypotheses with an amplification condition give the cadre property.
K-III.2.19 handbook' (numbered result) — For a family of admissible horn functions, the order-2 norm of the associated gale function at 0 is controlled in temperature.
K-III.2.20 mirror_price (key result) — The sum of the paved expansions at z and -z is of order η^2 in the order-2 norm, i.e. the odd parts cancel to the right order.
K-III.2.21 mastering (key result) — For simple gauge and kernel choices, there exist scales and constants with fine bases such that, for any tolerances, performance data exist.
K-III.2.22 flux_cap (key result) — For a simple gauge group there exist a price function and constants such that flux-capped bounds hold under horizontal calculation hypotheses, with explicit parameter dependence.
K-III.2.23 pierce (key result) — For simple gauge, there is a price function and constants such that along sequences of steps the limiting path data satisfy uniform bounds and records.
K-III.2.24 companyK (key result) — A complete purchase of targets, expenses, and delays exists producing, after all later delays and payments, directed budgets and a sheltered alloy with the required rate and bounds.
K-III.2.25 evening (key result) — For large x, the derivative at 0 of the display map differs from the main stroke by at most x^{-p} for every p, uniformly over admissible tubes.
K-III.2.26 dissent (key result) — For large x, the difference of the tube's display map vanishes at 0 with derivative at 0 bounded by x^{-p} for every power p.
K-III.2.27 unique_part (key result) — Two coefficient expansions with the same density and remainder bounds have difference in coefficient size exponentially small in the number of steps m.
K-III.2.28 trendH (key result) — For large x, any representative with the tool, merchant and depot properties admits a combat witness at every admissible level and axis.
K-III.2.29 plentifulWithPrediction (key result) — For a fixed calendar and funded prediction there exist a sheet, prices and thresholds yielding the full plentiful construction retaining the prediction.
K-III.2.30 flows (key result) — For a simple gauge group, any delay data can be enlarged so that any paid-up level system over further delays is acclaimed.
K-III.2.31 taxes (key result) — For a simple gauge, the stored quantitative property holds for all sufficiently large scale x.
K-III.2.32 Inspires (main result) — For simple gauge groups, a large-scale representation with sight and age properties is wholesome, with uniform constants, at all heights in range.
K-III.2.33 rocket (key result) — For a simple gauge group, there exist constants D, C such that for large x, any representation and dart satisfying the hypotheses obey a quantitative bound.
K-III.2.34 attain (key result) — Under nest, skill and ordeal hypotheses on a simple graph, the sceptre property holds for the given data.
K-III.2.35 vroom (numbered result) — For any sheet there is a threshold function beyond which a derived sheet satisfies a stated property.
K-III.2.36 creation (key result) — For large x, any made representation with sight at a dart satisfies the craft property with given parameters.
K-III.2.37 embalms (key result) — Given a relay condition, any waiting condition can be strengthened so that every family paid for it satisfies the firing property in every dimension.
K-III.2.38 post_phase (key result) — For sufficiently large patch size, a phase configuration exists for all large scales over any window length, at levels j⩾5 and i⩾4.
K-III.2.39 post_to (key result) — For any gauge, patch, kernel choices and parameters with positive alpha, there exist positive eta and nonnegative D such that the summit property holds.
K-III.2.40 forwardSky (key result) — Given an ask structure and budget/chart data, one can extend a waiting condition so that, along families paid for it, panels with common arc and angle give the required eventual estimates.
K-III.2.41 pack (key result) — For large scale x, a configuration with climate and splendor bounds and no drift satisfies the depot property over all tower heights in range.
K-III.2.42 cloche (key result) — For large x, uniformly in lattice size and configuration, a core observable approximates its midpoint pay value and is smooth with controlled derivative bounds.
K-III.2.43 eventuallyPaid (numbered result) — For any countable family, one admissible numerical delay request satisfies every fixed member eventually.
K-III.2.44 panning (key result) — The starting section built from a sound hologram abates at the fee weight, i.e. has polynomial vanishing below its weight at every rank.
K-III.2.45 real_difference_division (key result) — A real coefficient packet whose n-th differences vanish can be divided by n difference factors, with a representation having smaller width and controlled norm.
K-III.2.46 flow_soft (key result) — Pre-block transfer maps a kernel of width σ and bound B to flow with reduced width w and bound K·B·L^4/L^(r+1+d), uniformly in block size.
K-III.2.47 selectRunWithTreasuryPeriod_preselected_quote_orders_postnumeric (main result) — For any gauge data there exists a run with campaign satisfying the penalty value, preselection, order bounds, funded treasury/period purchase and a sky structure.
K-III.2.48 allFactorWithTreasuryPeriod_preselected_quote_orders_postnumeric_of_prediction (main result) — There exist a sheet, prices, choices, and a fully paid factor satisfying a prediction together with numerical, post-numerical, order and clock requirements simultaneously.
K-III.2.49 pullback_gain (key result) — Pulling back a zero-order-d row along two crosses gains a factor L^(2-d) in strip norm, giving an L^-1 contraction at d=3.
K-III.2.50 large_contraction (key result) — For large odd block length the Hessian difference is a contraction uniformly in gate, giving L^(-1/2) decay after block choice.
K-III.2.51 plan_exists (key result) — For a simple gauge group and any kernel choices, a complete plan (calendar treasury of scales and costs) exists.
K-III.2.52 covariance_moves (numbered result) — If conditional covariances are strip-bounded and the Hessians differ by a strip-bounded amount, the tree covariance and mean vary in a controlled way.
K-III.2.53 buy (key result) — Given a plan with floors met, any delay can be enlarged so that all further delays and payments yield a fully treasury-funded level.
K-III.2.54 names (numbered result) — For simple gauge group and kernel choices, a naming (charges) data package exists.
K-III.2.55 wishes (numbered result) — Given sound admissible data, a dialect (finite-word and spectrum data) for the requested operation exists.