Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.13 Alternative construction: one Wilson family for all labelsPart III·Detailed notesIII.15 Cost accounting for observables and the remainder comparison →

III.14. The construction run: flat representations and the ultraviolet rate

Contents

1. What this unit proves 2

2. What it uses 4

3. Strategy 4

4. Steps 4

5. Where the difficulty lies 5

6. Notation 5

7. What remains unexplained 5

Code dependencies 5

Lean source 6

Additional source locations 7

Key statements 10

Part III — Ultraviolet construction (renormalization group).

Selects the construction run used by the main theorem and describes its additional Gaussian-limit data.

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.13 · Next: III.15 →

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

Reading scope. The final assembly uses the run, its penalty, pillars and funded bounds; it discards the attached-recipe conjunct. The Gaussian limit is an additional property of the selected run. See VIII.1; this does not establish that its construction can be omitted.

Source inventory and conventions

Part: III, Ultraviolet construction (renormalization group). Lean: ConstructionRun, NativeComponentRecipe, Flat. Size: 14,290 lines (2,509 declarations) in the source allocation.

1. What this unit proves

Throughout, \(G\) is a compact matrix gauge group; “simple” means its real Lie algebra is simple and nonabelian. Level systems and full horizon sufficiency are those of III.1. A sheet fixes the kernel, stage profile and floors before block factors are chosen. Notation and norms are specified in §6.

Proposition III.14.1 (construction run). For simple \(G\) and \(b > 0\), there exist a run \(R\), a campaign \(T\) and pillars \(W\) for \((R, T)\), with penalty \(b\), satisfying the full thirteen-clause funded condition of III.15 relative to \(\Delta_{10}\), and carrying an attached native component recipe. The selection uses \(Q (i) = i + 2\) and support exponent \(100\) at every stage.

Attachment means that there exist a sheet \(s\), price map \(q\), recipe \(C\) of III.14.2 and floors \(n \geqslant \max (n_s, E_C)\) such that \(R\) uses \(s\) with floors raised to \(n\) and primary price map \(P_{s, q}\); the recipe is realized on its own levels and horizon. Here \(n_s\) is the sheet's floor, \(E_C\) combines the three component floors and two numerical floors, and \(B_C\) is the maximum of the two post-length bills. Set \(U_C (r, j) = \rho_C (r, j)^{- 1}\) for the positive recipe widths \(\rho_C\), and \(V_C (\ell, r, j) = B_C (\ell, j)\). For both request families \(F (r, j) = U_C (r, j)\) and \(F (r, j) = V_C (\ell, r, j)\), every fixed \(r\) admits \(m_0\) such that \(|F (r, j) | \leqslant 1 + \log \log \hat{\beta}_m\) for \(m \geqslant m_0\), \(j \leqslant J_{m + 1}\); also \(B_C (\ell, J_{m + 1}) \leqslant \hat{\beta}_m\) for every \(m\). Realization includes III.14.3 with \(e = 0\).

Status: theorem. Lean: constructionRun, Funded, Attached.

Proposition III.14.2 (recipe). For simple \(G\) and every sheet \(s\), there exist a secondary price map \(X\) and floors \(E^{\flat}, E^{\text{sw}}, E^{\text{du}} : \mathbb{N} \to \mathbb{N}\). For every level system with the kernel and profile of \(s\):

Status: theorem. Lean: Choice, available.

Proposition III.14.3 (Gaussian ultraviolet rate). For simple \(G\) and every sheet \(s\), there exist a price map \(X\) and \(E : \mathbb{N} \to \mathbb{N}\) with this property: for every level system with the kernel and profile of \(s\) satisfying \(L_i \geqslant E (J_{i + 1})\) for all \(i\), and every \(e \in \mathbb{N}\) satisfying \(\Omega^X_{J_i} \leqslant \log \hat{\beta}_i\) for \(i \geqslant e\), there are link kernels \(F_i\) (\(i \geqslant e\)) and constants \(A, B \geqslant 0\) with the following properties. For every horizon \(H\) of that system sufficient for some price map, every \(k \in \mathbb{N}\), \(i \geqslant e\), \(N \geqslant i\) and links \(u, v\),

\(\displaystyle \lVert F_i \rVert_{w_{J_i}} \leqslant B \Lambda_{k, i}, \qquad \mathcal{O}^H_{n, i} (u, v) \longrightarrow F_i (u, v), \qquad \lVert \mathcal{O}^H_{N, i} - F_i \rVert_{w_{J_i}} \leqslant A \Lambda_{k, i} (a_N / a_i)^{1 / 4} .\)

Here \(n \to \infty\), \(w_j = \min (1, \alpha^X_j, \alpha^X_{j + 1})\), and \(A, B \geqslant 0\) depend only on \(G\) and the lattice, independently of \(s\), the levels, \(e\) and \(H\).

Status: theorem, order zero. Lean: Flat.entrance_gate.

Proposition III.14.4 (abstract flat representations). Fix a price map \(P\), \(\theta > 0\), positive widths \(w_j\), \(A_0 \geqslant 0\), \(d_0 \in \mathbb{N}\), and a family \((\mathcal{L}_x, H_x, r_x, N_x, n_x, k_x, Z_x)_{x \in X}\) with \(r_x \leqslant N_x \leqslant n_x\), \(k_x \in \mathbb{N}\), \(Z_x \geqslant 0\). Put \(\Lambda_x (i) = 2 + Z_x + |s_i - s_{k_x} |\), using each system's scales. Assume each \(H_x\) is sufficient for \(P\), its plaquette transfers at cutoff \(N_x\) and \(r_x \leqslant i < N_x\) are canonical free kernels, and \(w_j \leqslant \alpha_j\) for all \(j\). On those stage ranges assume

\(\displaystyle w_{J_i} \leqslant \min (1, \alpha_{J_i}, \alpha_{J_{i + 1}}), \quad 2 w_{J_i} \leqslant L_i w_{J_{i + 1}}, \quad q_i (w_{J_{i + 1}}) \leqslant L_i^{- \theta},\)

and assume \(2 |\mathcal{F}| \Omega_{J_{N_x}} \leqslant A_0 \Lambda_x (N_x)^{d_0}\) for every \(x\). Then, simultaneously for all \(x\) and \(r_x \leqslant i \leqslant N_x\), there are flat representatives of \(\mathcal{K}_{n_x, i} -\mathcal{K}_{N_x, i}\) of width \(w_{J_i}\) and cost \(A \Lambda_x (i)^{d_0} (a_{N_x} / a_i)^{\min (1, \theta / 2)}\), where \(A \geqslant 0\) depends only on \(A_0, d_0, \theta\).

Status: theorem. Lean: Flat.World.overlap.

Proposition III.14.5 (Schur identity and flat step). Fix fine/coarse tori with side ratio \(L\), block average \(Q\) and \(b > 0\). The background-field relations are

\(\displaystyle \mathcal{K} (M) W = Q^{\top} \mathcal{K} (M'), \qquad QW = 1 - b^{- 1} \mathcal{K} (M') .\)

For symmetric positive semidefinite \(M\) and every coarse field \(A'\), they make \(WA'\) a minimizer of \(\langle A, \mathcal{K}(M) A \rangle + b |A' - QA|^2\), with minimum \(\langle A', \mathcal{K}(M') A' \rangle\). If two triples \((W_j ; M_j, M'_j)\) satisfy these relations and \(M_2, M'_2\) are symmetric, then

\(\displaystyle \mathcal{K} (M'_2) -\mathcal{K} (M'_1) = W_2^{\top} (\mathcal{K}(M_2) -\mathcal{K}(M_1)) W_1 .\)

Let \(B\) be a neutral translation-invariant plaquette representative of the fine difference, with \(\lVert B \rVert^{\text{pl}}_{\tau} \leqslant r\), \(\tau > 0\), \(r \geqslant 0\). Suppose \(T, U\) are order-two strip-bounded curvature transports in width \(\omega\), with constants \(q, p \geqslant 0\), scaled covariance \(T (x + Lv, y + v) = T (x, y)\) and likewise for \(U\). Require their periodizations \(C_2, C_1\) to satisfy \(dW_2 = C_2 d\), \(dW_1 = C_1 d\), and \(\sum_z U ((x, \varphi), (z, \psi))\) to be independent of \(x\) for each orientation pair. If \(0 \leqslant \sigma \leqslant \omega\) and \(2 \sigma \leqslant L \tau\), then

\(\displaystyle B' (y, z) = \sum_{x, w} T (x, y) B (x, w) U (w, z), \qquad \lVert B' \rVert^{\text{pl}}_{\sigma} \leqslant \frac{2 |\mathcal{F}|^2 qp}{\tau L} r.\)

It is neutral, translation invariant and represents the coarse difference.

Status: theorem. Lean: Flat.poised, Flat.toward.

Proposition III.14.6 (recursion rate). For each \(x \in X\), fix scales with \(L_i \geqslant 3\), stages \(r_x \leqslant i \leqslant t_x\), reporting scale \(k_x \in \mathbb{N}\), and \(\Lambda_x (i) = 2 + Z_x + |s_i - s_{k_x} |\), \(Z_x \geqslant 0\). Fix uniform \(\theta, c_0 > 0\), \(A_0 \geqslant 0\), \(d_0 \in \mathbb{N}\). If \(f_x, g_x \geqslant 0\) satisfy \(f_x (i) \leqslant L_i^{- \theta} f_x (i + 1) + g_x (i)\) below \(t_x\), \(f_x (t_x) \leqslant g_x (t_x)\), and \(g_x (i) \leqslant A_0 \Lambda_x (i)^{d_0} (a_{t_x} / a_i)^{c_0}\) throughout, then

\(\displaystyle f_x (i) \leqslant A \Lambda_x (i)^{d_0} (a_{t_x} / a_i)^{\mu}, \qquad \mu = \min (c_0, \theta / 2) .\)

One may take \(A = A_0 (K + 1)^{d_0} / (1 - 3^{- \theta' / 2})\), \(\theta' = \theta - \mu\), \(K = 2 (d_0 + 1) / \theta'\).

Status: theorem. Lean: Rate.Stair.fade_solve.

2. What it uses

3. Strategy

Compare cutoffs at their common finest stage, where kinetic normalization makes the metric difference neutral. Transport this difference by the mixed Schur identity; neutrality gains \(L^{- 1}\), floors give contraction \(L^{- 1 / 2}\), and the recursion estimate gives exponent \(1 / 4\). A shadow with altered clip parameters supplies free data; uniqueness transfers its Gaussian forms to every sufficient horizon.

Choose recipe and floors before block factors, then raise coupling thresholds to meet the post-length bill and countable requests. III.2 retains these conditions on the selected funded run. VIII.1 uses its penalty, pillars and funded property, discarding the attached-recipe conjunct.

4. Steps

  1. Initialize and propagate. The metric difference at stage \(N\) has cost \(2 |\mathcal{F}| \Omega_{J_N}\) and zero orientation-wise row sums. The Schur identity transports it without inverting the curvature form; subtracting the transport kernel at the first base point gains \(L^{- 1}\), using half the input exponential weight. Flat.toward.

  2. Obtain the rate. Floors ensure compatible widths and \(q_i (w_{J_{i + 1}}) \leqslant L_i^{- 1 / 2}\); downward induction and III.14.6 absorb age growth. spacing_choice.

  3. Take the limit. Diverging-torus periodizations identify link kernels; composing with \(d^{\top}, d\) gives the pairwise cutoff estimate. Its Cauchy limit preserves the weighted bounds. supplies.

  4. Transfer from the shadow. Downward Schur induction from the bare terminal form proves equality of Gaussian forms for sufficient horizons on systems differing only in clip parameters. This transfers the rate, symmetries and free background identities. same_path.

  5. Realize and select. The combined floor and bill enforce the recipe with \(e = 0\) on the run's own horizon. Apply III.2 with reciprocal-width requests and \(V_C (\ell, r, j) = B_C (\ell, j)\). on_run.

5. Where the difficulty lies

Gauge zero modes obstruct curvature-form inversion. Orientation-wise neutrality supplies the gain, but preserving it requires constant row sums, beyond scaled covariance. Floors precede block factors; bills follow them. The rate concerns only the Gaussian link kernel: it gives no rate for the undetermined part of the plaquette metric, positive-order coefficients or source kernels. The formal recipe does not identify physical marked observables.

6. Notation

\(L_i = \ell_{J_{i + 1}} \geqslant 3\) are odd block factors; \(a_0 = 1\), \(a_{i + 1} = a_i / L_i\), \(s_i = \log (1 / a_i)\); \(J_i \leqslant J_{i + 1} \leqslant J_i + 1\) are smoothing indices. Cutoff \(N\) has spacing \(a_N\). Put \(\hat{\beta}_i = \bar{\beta} + s_G s_i > 1\), \(\Lambda_{k, i} = 5 + \log \hat{\beta}_k + |s_i - s_k |\). A price map is \((\alpha_j, \Omega_j, \eta_j)\): positive widths, upper bounds, positive coercivity bounds. A horizon supplies metric kernels \(M^{\infty}_{N, i}\) and transfer data; \(M^{\mathbb{T}}_{N, i}\) is the periodization. The lattice exterior derivative is \(d\); \(\mathcal{K} (M) = d^{\top} Md\), \(\mathcal{O}= d^{\top} M^{\infty} d\), without a factor \(1 / 2\). The local-estimate package \(\Delta_{10}\) is garment10.

Write \(x (u)\) for a base point. For link kernels, \(\lVert F \rVert_{\sigma} = \sup_u \sup_{\phi} \sum_{y \in \mathbb{Z}^4} |F (u, (y, \phi)) | e^{\sigma |x (u) - y|_1}\), with \(\phi\) a link orientation; for plaquettes, \(\lVert B \rVert^{\text{pl}}_{\sigma} = \sup_u \sum_{v \in \mathbb{Z}^4 \times \mathcal{F}} |B (u, v) | e^{\sigma |x (u) - x (v) |_1}\), summing all target orientations \(\mathcal{F}\). A flat representative is translation invariant, has zero row sums in each target orientation, and on every level-system torus periodizes to the quadratic-form difference after applying \(d^{\top} (\cdot) d\); cost bounds this norm. In III.14.4, \(q_i (u) = 2 |\mathcal{F}|^2 h_i^2 / (uL_i)\), \(h_i = e^4 |\mathcal{F}|^2 \Omega_{J_{i + 1}}^2 \Omega_{J_i}\).

7. What remains unexplained

The scale and extraction choices are constructed in III.2; the meanings and proofs of the full funded clauses belong to III.15 and later units. The free-kernel existence proof and lattice kernel estimates are used without explanation here. The auxiliary curvature-lift, marked-kernel and formal Ward estimates still require their full admissibility conditions and proofs. Removing the recipe demand would not identify the resulting run with this selected run.

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

Code dependencies

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

References to: III.8, I.1, III.1, III.7, III.16, III.6, III.10, III.15, II.1, III.2, III.3, III.9, III.5, III.12, VIII.1.

Referenced by: none above the threshold.

Lean source

Source allocation: 14,290 attributed lines; 2,509 line-counted declarations; 3,229 assigned declaration names. Of the assigned names, 3,099 are in the compiled closure of the seventeen headline results. These quantities have different scopes.

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

Additional source locations

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

Key statements

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

All units · Overview of the proof · Repository

← III.13 Alternative construction: one Wilson family for all labelsPart III·Detailed notesIII.15 Cost accounting for observables and the remainder comparison →