1. What this unit proves 2
2. What it uses 5
3. Strategy 5
4. Steps 6
5. Where the difficulty lies 6
6. Notation 6
7. What remains unexplained 7
Code dependencies 7
Lean source 7
Additional source locations 9
Key statements 12
Part III — Ultraviolet construction (renormalization group).
Explains an alternative ultraviolet construction that puts all field labels into one Wilson family.
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.12 · Next: III.14 →
Results · Inputs · Strategy · Proof steps · Notation · What remains unexplained · Code dependencies · Lean source · Key statements
Reading scope. This is the alternative construction for habitat. The Wilson family used by YangMills.constructed comes from the run in III.14; see VIII.1 for its assembly. The two families are not identified here.
Part: III, Ultraviolet construction (renormalization
group). Lean: YM/SharpGram/Common.lean,
YM/SharpGram/Measured.lean, YM/SharpGram/Assembly/, YM/UVExtension/.
Size: about 22,100 lines in the unit inventory.
Source inventory and conventions
Throughout, \(G\) is a compact matrix group with simple nonabelian real Lie algebra and \(b > 0\) is the Gaussian block-spin penalty. Levels run from the coarsest, \(0\), to the cutoff, \(N\); \(p\) indexes periods. Notation is collected in §6.
Proposition III.13.1 (one ultraviolet and logarithmic family). There exists a Wilson family \(C\), with penalty \(b\), satisfying all the following.
It is calibrated: one full choice of constants and a directed history generate its history, with the per-step estimates of III.9–III.12.
It is consistent: the trajectory is selected, local sections are sound, and, for every degree \(d\), \(d + 3 \leqslant J (\text{ref} (d))\), \(d + 1 \leqslant \text{order}_m\) and \(d \leqslant \text{power}_m\) for \(m \geqslant \text{ref} (d)\). Every degree-\(d\) stencil point satisfies \(20 (|x_i | + 1) \leqslant \text{side} (N, p)\) in each coordinate whenever \(N \geqslant \text{ref} (d)\). Placed basis sections are regular on their footprints, with the prescribed derivative bounds of size \(\text{columns}_N \theta_N^q\) for factor degree \(q\); transfer is calibrated from \(\text{ref} (d)\) onwards.
For every \(d\) and \(R, \varepsilon > 0\), there is \(A \geqslant 0\) such that, for every \(m \geqslant \text{ref} (d)\) and all sufficiently large \(N\), every \(p\) and every \(v \in \mathcal{L}_d\) with \(\|v\| \leqslant R\), the observable at every site is supported in its centred level-\(m\) reflection cell and its chessboard root is at most \(Aa_m^{- d - \varepsilon}\). Here \(N \geqslant \text{ref} (d)\) is required.
It is the centre of the analytic shooting family of III.13.7.
The OPE entrance conditions hold: for every \(d, D, h\) with \(D + h = d + 4\), there exist \(t > 1\) and \(j (i) \to \infty\) with \(\sigma_{j (i)} / \sigma_i \to t\) for which the III.11 shell bounds hold for every choice of labels and extraction order; cover sizes satisfy \(\text{cs}_{i + 1}^2 \leqslant 2 \text{cs}_i^2\) and for every \(\varepsilon > 0\), \((L_i \text{cs}_i^2)^4 (\text{vacuum cost}) \leqslant \varepsilon \sigma_{i + 1}\) eventually; positive radii satisfy \(\log \rho_i / \sigma_i \to - 1\).
There exist coefficient-map bounds \(W\), allowances \(r : \mathbb{N} \to \mathbb{N}\) and transfer data giving the logarithmic OPE package: III.11 transfer/remainder estimates, triangular label steps, auxiliary comparisons, separation bounds, product sup bounds and VII.4 arity bounds. Also \(L_m, \text{columns}_m, \text{columns}_{m + 1} \leqslant \hat{\beta}_m\), \(r \to \infty\), and the support exponent is \(100\).
For these data and every \(d, N, p, m\) with \(\text{ref} (d) \leqslant m < N\), there is a linear isomorphism \(T\) with
On a basis vector of engineering grade \(e\) and factor degree \(q\), the only output of grade \(\leqslant e\) is that vector times \((\theta_m / \theta_{m + 1})^q\); no lower factor degree occurs. The map preserves the unit, commutes with core projection and lattice symmetries, and \(\|T\|_1, \|T^{- 1} \|_1 \leqslant K (J (m + 1))\), where \(K\) comes from \(W\).
Coverage holds: some \(g (k) \to \infty\), \(g (k) \leqslant k\), satisfies \(a_{g (k)} \leqslant \hat{\beta}_k a_k\) eventually, with three depth-\(d\) probe panels poised at level \(g (k)\) for every \(d\) and all large \(k\).
Along every extraction order satisfying IV.1's cell hypotheses, grid approximation holds at arbitrarily fine fixed levels for bounded degrees and III.11's allowed reflection pairs. Along each such order, complete weak comparison systems exist for every finite demand and degree horizon, positive radius bound and real-spin structure on the smooth free comparison table.
Every extraction order \(f\) has a refinement \(g\), extraction base tables \(A, (L_k), T\), a bin and derivative plan along \(f \circ g\), and a seed for \((C, f \circ g, T)\) with Maxwell ranks for \(T\).
Status: theorem. Lean: uv_log.
Proposition III.13.2 (coordinated family). There exists one \(C\) of penalty \(b\), consistent, calibrated and floral, with the chessboard bound above, III.13.5's fixed-volume limits, the logarithmic package, calibrated label steps, coverage and complete weak comparison systems along every extraction order satisfying the cell hypotheses. For every extraction order \(F\), there exist a refinement \(g\) and table \(T\) giving the ordered limit along the full mesh sequence and the periods of \(F \circ g\), VII.4's OPE services, and a II.2 construction record for \((C, F \circ g, T)\).
Status: theorem; \(C\) precedes \(F\). Lean: coordination.
Proposition III.13.3 (all phases). For every extraction order \(f\), there exist \(C\), a refinement \(g\), a table \(T\), a construction record \(F\) for \((C, f \circ g, T)\), and a V.3 reconstruction record \(\mathcal{A}\) for every phase of \(F\), satisfying III.13.2 and completed reconstruction: Wightman realization, surjective comparison maps onto the Osterwalder–Schrader Hilbert spaces, unique vacuum, phase-uniform light-cone and heat-kernel bounds, trivial commutant, continued stress tensor, continuous phase dependence of boundary correlations, and barycentre identities. The derivative sector has a prescription \(P\) satisfying VII.4's estimates for every fixed finite cluster tree and separated spectators, with arbitrary positive power loss.
Status: theorem; \(C\) follows \(f\) in the statement, but the proof uses III.13.2's common choice. Lean: common.
Proposition III.13.4 (moving-frame Gram limits). For every extraction order \(f\), there exist \(C, g, T, F, \mathcal{A}, P\) satisfying III.13.3, with coverage at the cutoff of \(F\). For every ultrafilter \(\mathcal{U}\) finer than the filter of \(f \circ g\) (period large, then mesh large) and every depth \(D\):
Depth-\(D\) portfolios exist: levels \(k' (k) \to \infty\), \(k' \leqslant k\), eventually satisfy \(a_k \leqslant a_{k'} \leqslant \hat{\beta}_k a_k\), with three poised panels for all sufficiently large \(k\), and label-matrix limits along \(\mathcal{U}\) for every sufficiently large \(k\).
For every portfolio \(X\), there are isomorphisms \(Y_k (d)\) from the free Maxwell degree-\(d\) field space onto that of \(T\), for all \(d \leqslant D\) and \(k\). Eventually they respect grading through \(D\); for each \(d \leqslant D\), their Gram forms are bounded and coercive uniformly for all sufficiently large \(k\).
For each \(d \leqslant D\), some \(q_d \in \mathbb{N}\) gives, for every sufficiently large \(k\) and every field \(x\), representatives \(v_{N, p} \to v\) along \(\mathcal{U}\), projecting to \(x\), with eventual source cost at most \(\hat{\beta}_k^{q_d} a_k^d \|Y_k (d)^{- 1} x\|\). Conversely, some \(K_d \geqslant 0\) gives \(\|Y_k (d)^{- 1} x\| \leqslant K_d a_k^{- d} z\) for every convergent representative family of cost at most \(z\) along any nontrivial filter finer than \(\mathcal{U}\), for all sufficiently large \(k\).
For each \(d \leqslant D\), the Gram form of \(X\) in basis \(Y_k (d)\) converges, as \(k \to \infty\), to the free Maxwell Gram form.
Status: theorem. Lean: habitat.
Proposition III.13.5 (fixed-volume derivative limits). For \(C\) as in III.13.1 and every \(d, k \in \mathbb{N}\), all sufficiently large \(p\) (depending on \(d, k\)), every \(n\) and labels \(v_i\) of degrees \(\leqslant d\), there exists \(g : (\mathbb{R}^4)^n \to \mathbb{C}\), continuous on \(\Omega_p^n\), such that the following hold along the whole sequence \(N \to \infty\).
Periodic correlations, extended as step functions by coordinatewise ceiling projection, converge to \(g\) uniformly on separated compact sets.
Normalized forward differences of every coordinate word \(u\) of length \(\leqslant k\) converge there to \(\partial_u g\). Multilinear interpolation gives the same limits for fixed words of length \(\leqslant k\) of normalized differences with positive integer steps and fixed integer stencil offsets, including backward and centred differences.
\(\partial_a \partial_u g = \partial_{(a, u)} g\) for \(|u| < k\) on \(\Omega_p^n\).
For every admissible test \(t\), \(tg\) is integrable and
summing over centred torus representatives.
Status: theorem. Lean: Poppy.blossoms, Poppy.Margins.
Proposition III.13.6 (separated lattice points). Fix \(p\) and a member \(C^{\mathbf{s}}\) of III.13.7 whose shifts satisfy \(s_{N, p} \to s\), \(|s| < r_{\ast}\). Assume its chessboard bound, slow growth, label-transfer and remainder bounds. For every \(J\), every finite label list \(u_i\) with \(\text{ref} (\deg u_i) \leqslant J\), and pairwise distinct level-\(J\) torus sites \(o_i\), the correlations \(\langle \prod_i O_{u_i}^{N, p} (o_i) \rangle_{N, p}\) converge as \(N \to \infty\). III.13.7 supplies these bounds for every shift assignment; the centre has zero shifts.
Status: theorem. Lean: Hearth.food.
Proposition III.13.7 (analytic shooting family). For \(C\) of III.13.1 there exist a full choice of per-step constants, a shooting structure with an arc, a label-transfer bundle and reference levels such that:
Some \(r_{\ast} > 0\), depending only on those constants, works for every \(N, p\): each real \(|s| < r_{\ast}\) determines exactly one Wilson coupling whose fixed-recursion trajectory stays in the prescribed scalar bands and reaches \(\bar{\beta} + s\) at level \(0\). Assignments \(|s_{N, p} | < r_{\ast}\) define \(C^{\mathbf{s}}\) with the bundle's labels, sections and reference levels, and \(C = C^{\boldsymbol{0}}\).
For \(m \leqslant N\), \(\beta_m (N, p ; s)\) and normalized activity readings extend holomorphically to \(|s| < r_{\ast}\), bounded by \(3 \hat{\beta}_m\) and \(\text{soft} = \text{rim} / 8\), respectively. For fixed \(m, p\), they converge locally uniformly with every shift derivative as \(N \to \infty\).
The centre has the calibration package with constant allowance, priced sup bounds and extraction base data. Every \(C^{\mathbf{s}}\) has label-transfer, remainder and chessboard bounds.
Some common disc \(|z| < a\) lies in the shooting domain and carries holomorphic coefficient and transfer data, including inverse terminal label maps, for all \(d, N, p\) with \(\text{ref} (d) \leqslant N\).
Fix \(d, m\). For all large \(p\), every \(n\) and labels of degree \(\leqslant d\), there exist \(b' > 0\), holomorphic lattice correlations \(W_N (z, x)\) on \(|z| < b'\) and limits \(f (z, x)\). At real \(s\), \(W_N\) equals the correlation whenever \(s_{N, p} = s\) and all reference levels fit. For every complex \(z\), \(f (z, \cdot)\) has continuous iterated coordinate derivatives through order \(m\) on \(\Omega_p^n\); step differences and interpolated differences converge to them with every \(z\) derivative, uniformly on products of separated spatial compacts and disc compacts. Real-shift limits agree with constant-shift fixed-volume limits. For admissible \(t\), \(\int tf (z, \cdot)\) is holomorphic and smeared lattice correlations converge to it locally uniformly with every \(z\) derivative.
Status: theorem, included in III.13.1. Lean: Oasis.Floral.
I.1; II.1–II.2: Wilson measures, labels, observables, extraction orders and construction records.
III.1–III.2; III.4–III.12: kernels, order of constants, chessboard and per-step estimates, selected trajectories and histories; III.7 supplies the one-loop annulus coefficient.
III.15–III.16: label costs and analytic tools; IV.1: extraction, cell hypotheses and Arzelà–Ascoli.
V.3; VII.1, VII.3–VII.4; VIII.1: phase reconstruction, coverage, Gram comparison, OPE services and construction records.
Balaban block-spin renormalization; Banach contraction; Vitali–Porter and the identity principle; Arzelà–Ascoli; dominated convergence; reflection-positive chessboard estimates; ultrafilters.
Choose constants in their required order, raising thresholds while preserving earlier estimates. Increasing Taylor orders and powers accommodate each label degree from its reference level onwards. Shooting gives trajectories with prescribed coarse coupling; uniform contraction and decay of dependence on remote ultraviolet levels give full-sequence limits at each fixed level. Uniform holomorphic bounds then permit Vitali's theorem.
Approximate each renormalized observable by a conditional average of a coarse observable with convergent coefficients. Exponential improvement beats subexponential coefficient costs, and chessboard estimates control products. Dense-grid convergence and large-period slicing yield derivative limits. Extraction, OPE and reconstruction results then apply to the same family.
Choose constants. For simple \(G\), combine the per-step estimates, then raise thresholds for shooting, label transfer, logarithmic OPE and weak comparison. Instantiate first stage \(4\), Taylor order \(6 + i\), power \(2 + i\), support exponent \(100\), allowances \(1\) and \(j + 1\), and target rate \(- 7 / 16\); the final wait also supplies coverage. uv_log.
Take fixed-level limits. For the constructed arc, contraction has rate \(1 / 2\) uniformly in cutoff; continuity and kinematic convergence give convergence of each iterate. Dependence on levels above \(m + v\) decays as \(\text{soft}^v\), giving real-shift limits, then Vitali gives every complex-shift derivative. Camp.artistry, Camp.viva (proofs read; contraction and decay estimates used as stated).
Pass to correlations. For convergent real shifts and the bundle bounds, effective densities converge uniformly and partition integrals stay positively bounded below. The RG identity and coarse approximation reduce separated products to convergent effective expectations; chessboard errors tend to zero, proving the Cauchy property. Hearth.food.
Obtain derivatives and analyticity. Large-period slicing bounds lattice differences through one extra order; dense-grid convergence and Arzelà–Ascoli give spatial derivatives and smearing. Holomorphic transfer bounds and Vitali give the analytic correlation limits. Poppy.blossoms, Beach.sparksP (proofs read through stated transfer estimates).
Assemble common outputs. Uniqueness identifies full-mesh smeared limits with extracted limits. Apply OPE services, every-phase reconstruction and Gram comparison; coverage supplies portfolios along every finer ultrafilter. coordination, common, habitat (report proofs read).
Uniform control over arbitrarily many ultraviolet levels and the balance between coarse-approximation gains and coefficient costs are the main analytic difficulties. Derivative limits require large periods; plain smeared limits hold at every fixed period. The coupling/activity disc is uniform in cutoff and period, whereas the correlation disc may depend on labels and period.
\(\mathcal{L}_d\) is the degree-\(d\) label space; \(\text{ref} (d)\) its reference level. \(a_0 = 1\), \(a_{m + 1} = a_m / L_m\), \(\sigma_m = \log (1 / a_m)\); \(\ell_p\) is the torus side. \(\Omega_p^n \subset (\mathbb{R}^4)^n\) consists of configurations distinct modulo \(\ell_p \mathbb{Z}^4\); admissible tests are complex-valued, smooth, compactly supported on distinct configurations, with closed support inside \((- \ell_p / 2, \ell_p / 2)^{4 n}\). \(O_v^{N, p}\) denotes the renormalized observable and brackets Wilson expectation. \(\bar{\beta}\) is the central coarse coupling, \(\hat{\beta}_m\) the reference coupling, \(\theta_m\) the threshold, \(J (m)\) the stage. \(x_m\) are coefficient maps; \(V_L\) multiplies grade \(e\) by \(L^{d - e}\). \(f \circ g\) denotes refinement of an extraction order. A chessboard root is the absolute reflected-product expectation to the reciprocal number of cells.
Quantitative transfer, remainder, shell and comparison contracts remain those of III.7, III.11 and VII.4. Internal proofs of several constant choices, contraction/remote-level decay, one-step label estimates and auxiliary estimates were used as stated; moving-frame proofs belong to VII.1/VII.3. The penalty's normalization relative to Balaban's parameter remains unverified. The main theorem uses III.14's separate construction: equality of its family with this one, or transfer of III.13.5 to it, is not established.
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: III.1, III.10, I.1, VIII.1, II.1, III.9, III.16, III.7, III.5, III.2, IV.1, III.11, II.2, III.3, III.15, III.8, III.6, V.2, VII.1, VII.4, III.4.
Referenced by: none above the threshold.
Source allocation: 22,100 attributed lines; 3,224 line-counted declarations; 4,212 assigned declaration names. Of the assigned names, 4,113 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 multitude — 3,983 lines.
proof of uv_log and the results it chains to — 3,662 lines.
proof of multitude_foot — 2,722 lines.
work package YM/UVExtension/Lamppost/, with YM/UVExtension/Concert/, YM/UVExtension/Wick/, YM/UVExtension/Payroll/ — 1,219 lines.
work package YM/UVExtension/Wren/ — 1,058 lines.
work package YM/UVExtension/Lacing/ — 961 lines.
work package YM/UVExtension/Wet/ — 820 lines.
work package YM/UVExtension/Span/ — 819 lines.
work package YM/UVExtension/Fallow/ — 619 lines.
work package YM/UVExtension/Steady/ — 578 lines.
work package YM/UVExtension/Rainfall/ — 530 lines.
work package YM/UVExtension/Camp/, with YM/UVExtension/Spire/ — 500 lines.
work package YM/UVExtension/Eyelet/ — 387 lines.
work package YM/UVExtension/Strata/ — 365 lines.
work package YM/UVExtension/Hearth/ — 340 lines.
work package YM/UVExtension/Guild/ — 327 lines.
work package YM/UVExtension/Poppy/ — 324 lines.
work package YM/UVExtension/Mast/ — 259 lines.
work package YM/UVExtension/Bud/ — 257 lines.
work package YM/UVExtension/Whirl/ — 234 lines.
work package YM/UVExtension/Oriel/ — 233 lines.
work package YM/UVExtension/Yard/ — 207 lines.
work package YM/UVExtension/Dales/ — 202 lines.
work package YM/UVExtension/Tabernacle/ — 199 lines.
work package YM/UVExtension/Copse/ — 172 lines.
work package YM/UVExtension/Crown/ — 167 lines.
work package YM/UVExtension/Harvest/ — 117 lines.
work package YM/UVExtension/Forest/ — 114 lines.
work package YM/UVExtension/Orchard/ — 103 lines.
work package YM/UVExtension/Linden/ — 100 lines.
proof of habitat and the results it chains to — 97 lines.
work package YM/UVExtension/Rafter/ — 91 lines.
work package YM/UVExtension/Case/ — 77 lines.
proof of coordination — 51 lines.
work package YM/UVExtension/Gale/ — 49 lines.
work package YM/UVExtension/Oasis/ — 33 lines.
work package YM/UVExtension/Free/ — 30 lines.
work package YM/UVExtension/Upland/ — 30 lines.
work package YM/UVExtension/Above/ — 29 lines.
work package YM/UVExtension/Beach/ — 17 lines.
work package YM/UVExtension/Willow/ — 7 lines.
work package YM/UVExtension/Cloud/ — 6 lines.
work package YM/UVExtension/Reports/ — 5 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.13.1 forge (numbered result) — Prescribed jets given by bump-type data can be realized by a germ holomorphic in the parameter and smooth in the variable, matching the given jets.
K-III.13.2 tangled (key result) — The full Ursell sum over clusters with union cover satisfies a budget b/(1-q).
K-III.13.3 common (key result) — For simple G and any penalty b>0, one Wilson family simultaneously carries calibration, UV, OPE-margin, log, coverage, reconstruction and completed-phase properties.
K-III.13.4 sailsV (main result) — For a simple gauge and branching kernel choices, there exists a sheet with the given kernel and cost/parameter choices such that for all tariffs and scopes, a sequence of scale parameters makes all required purchased estimates hold.
K-III.13.5 habitat (main result) — On one Wilson family, with OPE, reconstruction and complete phases, the moving-frame Gram estimates hold and every ultrafilter limit of portfolios converges to the model.
K-III.13.6 uv_log (main result) — For any positive penalty b there is a family with that kernel penalty that is calibrated, satisfies UV and log OPE packages, dense coverage, and extraction base data with Maxwell ranks.
K-III.13.7 havens_log (key result) — Under support exponent at least 100, there is a sheet, price map and threshold with kernel K and stage v satisfying the log-purchase conclusion.
K-III.13.8 multitude_foot (numbered result) — Existence of a sheet and price map with kernel K satisfying the simultaneous UV/log assembly property.
K-III.13.9 survives (key result) — The floral property survives for the cellar yard built from the rose data at all sides L, for the fixed-volume coarse reference.
K-III.13.10 snow (numbered result) — There exists a sequence of integers making a steepness condition hold for the given sheet and kernel data.
K-III.13.11 lives (key result) — For a connected-activity target with an expense bound, there is a threshold M such that for all sides L⩾M and admissible parameters, the target worth estimate holds eventually as x→∞.
K-III.13.12 sheaf (key result) — There is a radius a>0 within the analytic domain such that circuits exist for all indices d,N,n with t d ⩽ N.
K-III.13.13 ticket (main result) — Under paid-weight and local-ratio hypotheses, there exist a kinematic path structure with full paths realizing the given endpoint data.
K-III.13.14 pocketbook (numbered result) — Under scale and cost hypotheses, there is a family of banner functions forming a rotor consistent with the tide values and growth conditions.
K-III.13.15 profiles (key result) — For a kernel choice there exist price and rate data such that every compatible sheet admits horizons satisfying rack, retention, sufficiency and report conditions.
K-III.13.16 sparksP (key result) — There exist a radius b and data W, f forming a shoal of order m on the ball.
K-III.13.17 turning (key result) — There is a path structure with full paths and approximants that converge to a limiting coin sequence satisfying the one-step conditions.
K-III.13.18 inlet (key result) — There is a radius b such that turn families are uniformly bounded on a ball for large N, along with bounds on derivatives on compacts.
K-III.13.19 uv_commerce (key result) — The UV extension theorem: an existence statement for programs, targets and registers with alloys satisfying budget and sheltered conditions at all large levels.
K-III.13.20 office (key result) — Parameters can be chosen before learning the data L so that, after L is revealed, only waiting is required and the target mint estimates hold.
K-III.13.21 food (key result) — Under the main-convergence hypothesis, multi-point correlators evaluated at injectively placed lattice locations converge as N tends to infinity.
K-III.13.22 compose (key result) — Compatible single-scale step data compose into a global multi-scale history with prescribed top-level voice satisfying all step estimates.
K-III.13.23 ceilings (key result) — For a simple gauge and given tolerances, there exist constants such that every horizontal calculation admits choices of rates and cost parameters satisfying the required inequalities.
K-III.13.24 repriseQ (key result) — A single shared linear column-family step: one scale of the RG recursion maps a voice and column data to a lower-scale one with format, cost and remainder bounds.
K-III.13.25 forestation (key result) — Under a rate hypothesis with room below a negative exponent, there exist a constant and a rate-zero function bounding quantities for all configurations in the Bower class, uniformly over tubes and steps.
K-III.13.26 antilles (key result) — Given a coefficient X at level m with format and remainder bounds, there is a family of solutions down through levels with explicit coefficient and density relations to the played tones.
K-III.13.27 colorReady (key result) — For a simple gauge, there exist constants such that, along a sequence of scales tending to infinity, the colored recorded data lift to path data with controlled leading terms and estimates.
K-III.13.28 roomR (key result) — Denominator observables are uniformly bounded and their integrals are uniformly bounded below by a positive constant for large N.
K-III.13.29 basisE (key result) — For a connected-activity target, for large side lengths there is a rate function such that smoothness and a estimate exist for all budget points, uniformly in the data.
K-III.13.30 rootwards (key result) — If snapshots converge and every extraction admits a further refinement with projected structure, then the slicing condition at order d holds for all large base scales p.
K-III.13.31 acclaim (key result) — A renormalization-group step: given a coefficient configuration at level i+1 satisfying the guard conditions, there exists one at level i compatible with it, with the response and accord estimates.