Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.1 The block-spin step and the symmetric gauge fixing (notes)Part III·Unit outlineIII.3 Free lattice kernels and covariances (notes) →

III.2. Choosing the constants: the order of choice, the level schedule and the shooting argument — detailed notes

Contents

1. What this unit proves 2

2. What it uses 11

3. Strategy 13

4. Steps 13

4.1 Numerical existence lemmas 13

4.2 The level schedule 14

4.3 Shooting 15

4.4 Persistent purchases and their composition 17

4.5 The analytic lemmas 20

5. Where the difficulty lies 20

6. Notation 21

7. What remains unexplained 22

The full account of unit III.2: 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: 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 main-theorem closure:

part lines
proof of the plentiful construction (III.2.5) about 6,250
proof of the joint same-factor purchase (III.2.4) about 4,700
proof of the final run (III.2.7) about 4,000
proof of the sheet and radar purchase about 2,400
the two directories that carry the mathematics of the schedule (YM/Price/, YM/Shoot/) 634

Conventions. These are those of III.9.

The main results concern numerical choices and a conditional shooting construction:

  1. A long list of requirements can be met simultaneously by choosing the constants in one fixed order. Each requirement has the form "this inequality holds once the block factor, the coupling or the lattice is large enough, given the constants chosen before".

  2. There is a level schedule meeting every entrance condition.

  3. Given the one-step construction as a hypothesis, there is a trajectory of effective actions with \(\beta_{N, p, 0} = \bar{\beta}\) (shooting).

The terminology of sheets, prices and purchases records numerical bounds and their order of choice (glossary, family 1). The unit also contains a group of analytic lemmas of the Gaussian step, filed here by the dependency assignment (III.2.9).

1. What this unit proves

Proposition III.2.1 (the constants, in the order in which they are chosen). Let \(G\) be simple. The construction fixes the following data, in this order.

  1. Sheet (data chosen before the block factors). It consists of the following.

    The sequences \(k_j\), \(q_j\), \(a_j\) are nondecreasing.

  2. Stage block factors \(\ell_j\). They are odd, satisfy \(\ell_j \geqslant \max (3, f_j)\), are nondecreasing in \(j\), and for \(j \geqslant j_0\)

    \(\displaystyle \frac{\omega_j}{\log \ell_j} \leqslant \min \left( \frac{\kappa}{4}, \frac{1}{j^2} \right), \qquad \frac{\log \mathcal{C}_j}{\log \ell_j} \leqslant \frac{1}{j^2}, \qquad \mathcal{C}_j := 1 + \varpi_j + w_j^{- 1} + \gamma_j + r_j + a_j .\)
  3. Smallness exponents \(\theta_j > 0\). They are nonincreasing, with \(\theta_j \leqslant 1 / j\) for \(j \geqslant j_0\).

  4. Delays. These are the following.

    Delays are ordered componentwise.

  5. Barrier \(\bar{\beta} > 1\). It satisfies \(\beta^{\text{ent}}_{j_0} \leqslant \bar{\beta}\) and \(x^{- 1 / 2} e^{(\log \log x)^2} \leqslant 1\) for all \(x \geqslant \bar{\beta}\).

  6. Wait. This consists of:

    Waits are ordered componentwise by readiness scales, windows and minimal period.

Items 2, 3 and 5 always exist:

Item 4 has no further conditions. In item 6, only the stated sublinearity is required; the readiness scales are real and \(n_{\min} \in \mathbb{N}\).

Status: items 1–6 are definitions (specifications). There are three existence theorems. The existence of item 2 uses \(\kappa > 0\), hence the simplicity of \(G\). The later existence theorems III.2.4–III.2.7 meet specified requirements in this order. Lean: Sheet, Stage, Large, Rolls, Rolls.exists_rolls, Protection, Protection.exists_margin, Delays, DelayLe, Bar, Bar.exists_above, Wait.

Proposition III.2.2 (a level schedule meeting all entrance conditions). Let \(G\) be simple and let data 1–6 of III.2.1 be given. Then there is a level system with the following data:

It satisfies:

The same construction also ensures that every positive integer divides \(n_p\) for infinitely many \(p\).

Status: theorem. The divisibility variant is filed in III.10 and is the one used in the final assembly (III.2.7). Note that (d) asserts the existence of one level \(k\) per stage. Taking \(\sigma^{\text{rdy}}_j\) large forces \(k\) to be large. Lean: Wait.ready, Paid, Calendar.Fits, Levels, Schedule.Gentle, Calendar.blocks_go; variant Wait.engine, AsDivisors.

Proposition III.2.3 (shooting: a selected history from a recipe). Let \(G\) be simple. Fix a level system with

\(\displaystyle \omega_{J_{m + 1}} \leqslant \tfrac{\kappa}{4} \log L_m \qquad \text{for all } m.\)

This holds for every level system of III.2.2, by III.2.1(2).

Recipe. Let a recipe be given: path data \(P^{\mathcal{R}}_{N, m}\) and three predicates (a start test, a retention test at each level, a transition test for consecutive levels).

Admissible representations. A level-\(m\) representation \(\rho\) (III.9: path data, clip, activities, budget point, \(\beta\), \(v\)) is admissible for \((N, p)\) if:

Continuous families. A family \(x \mapsto \rho_x\) on an interval is continuous if:

Hypotheses. Assume that for every \(N\) and \(p\):

Conclusion. There are representations \(\rho_{N, p, m}\), \(0 \leqslant m \leqslant N\), for all \(N, p\), such that:

The resulting history is selected in the sense of III.9.3. In particular it obeys the running law: for every \(\varepsilon > 0\) there is \(m_0\) such that \(| \beta_{N, p, m} - \hat{\beta}_m | \leqslant \varepsilon s_m\) for all \(m \geqslant m_0\), \(N \geqslant m\) and all \(p\).

Status: theorem, conditional on (start) and (advance).

Lean: Recipe.races, Recipe, Lives, Curve, Recipe.Relays, Recipe.Starter, Recipe.Issues, Drifting, History.Selected.

Proposition III.2.4 (the joint purchase on one emitted factor).

Hypotheses. Assume:

Conclusion. There exist:

These are followed by the alternation below:

for every floor sequence \(k \geqslant \tau\) (block factors exist for the sheet \(s_k\), which is \(s\) with floors \(k\)), and every choice of stage block factors \(\ell\) for \(s_k\), there is a wage threshold \(U\) such that for every wage \(w \geqslant U\) and every prescribed postage rate and exchange datum, there are post-\(L\) cost constants \(F\) such that for every positive sequence \(\theta^0\) there is a smallness exponent \(\theta \leqslant \theta^0\) such that for every prescribed menu, auxiliary record and delay \(T_0\) there is a delay \(V \geqslant T_0\) such that for every delay \(V' \geqslant V\), every barrier \(\bar{\beta}\) for \(V'\) and every wait \(W\), there is a wait \(Z \geqslant W\) such that for every wait \(W' \geqslant Z\) and every level system \(a\) that meets the entrance conditions of \(W'\) (III.2.2(a)–(d), with (e)–(f)) and whose periods have the divisibility property, there exist a directed datum \(B\) on \(a\) (kinetic data and a recipe on the level system \(a\)) and an emitted factor \(X\) such that:

The requirements (with the unit that defines each predicate) are:

requirement owner
wages, exchanges, menus and auxiliary records equal the prescribed data; postage rates do not exceed the prescribed rates III.10 (Factor)
Degree, Savvy, Roofing, PaysW, Spire, Wild, tower bound Tower.Sav with Canyon, Cadre III.12
AccordV (with the sequence \(Q\)) III.11
kinetic data at the top level (AtTop) III.9
amplification (Amplify) III.1
support exponents \(\geqslant 100\) at every level this unit
\(\exp ((a_j + 2) (2 \hspace{0.17em} \text{span}_{ij} + 13)^4) \leqslant \ell_i\) for all \(i, j \in \mathbb{N}\) with \(j \leqslant i \leqslant j + 1\) this unit
a bandage \(b\) (Bandage, III.10) with the extras \((\Omega, \Delta, b)\) (Extras) III.15

Here \(\text{span}_{ij} \in \mathbb{N}\) is the factor's transition support parameter; the exponent is given by base and toll.

The bandage also supplies the conditional family package of Unlatched with a vacuous additional conclusion; the family hypotheses are those stated in III.2.5.

Status: theorem. The estimates hold on the same emitted factor, with the displayed order of choice. The hypotheses \(\Omega\), \(\Delta\), \(\theta_1\), \((\xi, \omega_v, \omega_t)\) and \(v\) are constructed in the final assembly III.2.7, or supplied there by III.14. The version without a prediction is richFares. Lean: richFaresWithPrediction, built on joinRadarsShipWithPrediction and joinExpensesShipWithPrediction.

Proposition III.2.5 (the plentiful construction). Assume the hypotheses of III.2.4 and \(Q_i \geqslant 2\). Then its conclusion holds with the following additional clause. Consider any trajectory compatible with the emitted factor, any reference levels \(t (d)\) with \(d + 3 \leqslant J_{t (d)}\), any section-transfer data and any gauge-door data between consecutive levels. Assume that the resulting family satisfies the family-consistency conditions, that its gauge doors satisfy the step compatibility conditions, and that its section transfers satisfy the prescribed bounds from level \(t (d)\) whenever \(t (d) \leqslant N\). Then, for every extraction order \(f\), the family satisfies the complete weak-continuum requirement (CompleteWeak, III.11) and the trace gallery (Gallery, VII.2). These are the hypotheses and additional conclusion of Unlatched. The floors, delays and waits may increase, and the prediction is retained. Status: theorem. This is where the requirements of the trace test (Part VII) are bought on the same constants as the ultraviolet estimates. Lean: plentifulWithPrediction, plentiful (vacuous prediction).

Proposition III.2.6 (a prediction on the same factor). Let \(G\) be simple, let \(s\) carry the estimate package of Lemma 4.16 for fixed tariff and scope, and let \(\tau > 0\). Let \(\pi\) be a prediction that is prepaid at the price map of \(s\), in the following sense.

Then the complete native purchase of Lemma 4.17 can be carried out so that, on level systems with divisible periods, \(\pi\) holds on the factor it emits. The original floor is replaced by its maximum with \(u\). The delay \(W\) is chosen before the original booth and final delay. Status: theorem. In the main-theorem closure it is used only with the vacuous prediction (Always): the only caller of III.2.7 passes it. Lean: company, Prepaid, Prediction, AllPrices.

Proposition III.2.7 (the complete run).

Inputs. Let \(G\) be simple and \(b > 0\) (the kernel penalty). Let the following records be given: \(\Omega\), \(\Delta\) and a custody request \(\mathcal{H}\). Let \(\Lambda\) be a property of level systems that is eventually paid (III.2.8(a)). Let a demand be given:

Conclusion. There is a run \(\mathcal{R}\) (the record of the whole construction, III.12) with a campaign such that:

There is also a version in which any prediction prepaid at every sheet and price map holds on the factor of the run; the intermediate factor theorem below supplies it. Status: theorem. Its only caller in the main closure is III.14 (constructionRun), which passes:

Lean: selectRunWithTreasuryPeriod_preselected_quote_orders_postnumeric, PostnumericPreselection, allFactorWithTreasuryPeriod_preselected_quote_orders_postnumeric_of_prediction.

Proposition III.2.8 (purchases that persist under all later choices).

(a) Eventually paid properties. A property \(U\) of level systems is eventually paid if the following holds. For every sheet, block factors, smallness exponent and delay \(V\) there is a delay \(X \geqslant V\) such that every level system meeting the entrance conditions of any delay \(W \geqslant X\) (with any barrier and wait) satisfies \(U\). A conjunction of two eventually paid properties is eventually paid.

(b) Diagonal payment of constants. For every real array \(F (n, i)\), the following property is eventually paid. At every level \(m\), \(1 \leqslant 1 + \log \log \hat{\beta}_m\). For every \(n\) there is \(m_n\) such that

\(\displaystyle |F (n, i) | \leqslant 1 + \log \log \hat{\beta}_m \qquad \text{for all } m \geqslant m_n \text{ and all } i \leqslant J_{m + 1} .\)

Likewise, for every \(F : \mathbb{N} \to \mathbb{R}\), the property "\(F (J_{m + 1}) \leqslant \hat{\beta}_m\) for all \(m\)" is eventually paid.

(c) Countably many step requests. Fix a countable index set with an encoding in \(\mathbb{N}\), and let \((w_{\alpha})\) be a family of requests indexed by it. Each request consists of a floor \(\text{pre}_{\alpha} : \mathbb{N} \to \mathbb{N}\) and a cost function of a stage transition \((j, i)\), its block geometry and a stage record; at step \(m\) the record is \(X_{J_m}\). Then there is a single floor \(\text{pre}\), depending only on the family, with the following property. If \(\ell_j \geqslant \text{pre} (j)\) for all \(j\), then every delay can be raised so that every later level system satisfying the entrance conditions for the enlarged delay, with any barrier and wait, satisfies, for all \(\alpha\) and \(n\) with \(\text{code} (\alpha) \leqslant J_n\) and all \(m \geqslant n\):

(d) The treasury. For simple \(G\) and every kernel choice there is a plan. A plan fixes a naming of charges and, for every request, a dictionary of finite words and spectra. If the block factors exceed the plan's floor, then every delay can be raised so that every later level system satisfying its entrance conditions is treasury funded: it meets the step requests of the plan (as in (c)) and the inverse charge from level 0 on.

Status: theorems. Dictionaries are chosen once, before the block factors, and never reselected. Lean: EventuallyPaid, postnumeric_quote_diagonal_pair_requests, eventuallyPaid, PaidRequests, StagePaid, minDelay, Need, Affords, Plan, plan_exists, buy, TreasuryFunded.

Proposition III.2.9 (analytic estimates used by the purchases). The row and cross norms are componentwise exponentially weighted \(\ell^1\) bounds on displacement kernels. Multilinear kernels use the corresponding sum over displacements and colour indices. The colour spaces are fixed and finite; constants may depend on them. A cross maps coarse fields to fine fields at block size \(L\). All vanishing orders refer to the Fourier symbol at zero momentum.

Further linked estimates concern a post-block Hessian bound (design), extraction of cubic and quartic local coefficients (tanker), and asymptotic bounds for the trace insertion (cloche). Status: theorems, with the hypotheses above. The detailed scene, coefficient-format and norm interfaces are listed among the open points in section 7.

2. What it uses

From other units.

Standard mathematics.

Imported constants and hypotheses.

3. Strategy

Choose the stage records and floors first, then the block factors \(\ell_j\), post-\(L\) costs and smallness exponents, delays, the barrier \(\bar{\beta}\), and finally the wait. Increasing the appropriate threshold meets each requirement: the block factors dominate the stage constants, entry couplings pay later costs, and the wait provides comparison windows and large tori. Persistent requirements combine by taking maxima of floors and chaining delay and wait increases. This gives common constants for III.2.4–III.2.7.

The stage index \(J_m\) advances by at most one per level. It enters a stage only after its entry thresholds are met and stays there long enough for one prescribed comparison window. At each fixed stage the volume bill is bounded by a polynomial in \(\log s\), hence eventually by \(e^s\). Since \(s_m \geqslant m \log 3\), this pays every later volume demand. One period offset pays the finitely many steps of the first plateau.

For fixed \(N, p\), start with the Wilson family over \([\bar{\beta} + (\kappa / 2) s_N, \bar{\beta} + 2 \kappa s_N] \subset \mathfrak{B}_N\). At each step the drift bound sends the endpoint couplings strictly beyond the endpoints of the next window. A refined intermediate value argument selects a smaller parameter interval on which the new family stays in that window, so the next step applies. At level \(0\) the window is \(\{ \bar{\beta} \}\). Summing the drifts upward from there and using \(\omega_{J_{m + 1}} \leqslant \log L_m / J_{m + 1}^2\) gives the running law uniformly in depth and volume.

4. Steps

4.1 Numerical existence lemmas

In sections 4.1–4.2, \(G\) is simple and the data are those of III.2.1.

Lemma 4.1 (large block factors). For each stage \(i\) there is \(M_i\) such that every odd \(n \geqslant M_i\) satisfies the conditions of III.2.1(2) at stage \(i\). Hence the stage block factors \(\ell_i = 2 \max_{j \leqslant i} M_j + 1\) exist. Sketch: below the first stage only oddness and the size floors are required. At later stages, the remaining conditions have the form \(c / \log n \leqslant \delta\) with \(\delta \in \{\kappa / 4, i^{- 2} \}\) and \(\delta > 0\). Each holds for large \(n\) because \(\log n \to \infty\). The running maximum makes \(\ell\) nondecreasing. Lean: Rolls.eventually_large, Rolls.exists_rolls.

Lemma 4.2 (smallness exponents). For every positive sequence \(\alpha\), the running minimum \(\theta_j = \min_{i \leqslant j} \min ((i + 1)^{- 1}, \alpha_i)\) is positive, nonincreasing, and satisfies \(\theta_j \leqslant \min (\alpha_j, 1 / (j + 1))\). Lean: Protection.exists_margin.

Lemma 4.3 (barrier). For every \(b\), take \(\bar{\beta} = \max (2, x_{\ast}, b, \beta^{\text{ent}}_{j_0})\), where \(x^{- 1 / 2} e^{(\log \log x)^2} \leqslant 1\) for all \(x \geqslant x_{\ast}\). This is a barrier. Sketch: \((\log y)^2 \leqslant \frac{1}{2} y\) for large \(y\), applied with \(y = \log x\). Lean: Bar.exists_above.

Lemma 4.4 (the volume bill). Define

\(\displaystyle \text{bill}_j (s) = S_j (1 + c + c')^{g_j} + 100 (c + 1) + 100 ((j + 3) \ell_j + 1),\)

where \(c = \lceil \log^2 (\bar{\beta} + \kappa s) \rceil\) and \(c' = \lceil \log^2 (\bar{\beta} + \kappa (s + \log \ell_j)) \rceil\). For each fixed \(j\), \(\text{bill}_j (s) \leqslant e^s\) for all sufficiently large \(s\). At \(s = s_m\) with \(j = J_{m + 1}\) we have \(c = B_m\), \(c' = B_{m + 1}\) and \((j + 3) \ell_j = R_m\). So the bill is the sum of the three volume demands of III.2.2(c),(e). Sketch: \(c, c' = O ((\log s)^2)\), so the bill is bounded by a polynomial in \(\log s\). Lean: Bar.bill, Bar.allocated.

Lemma 4.5 (entering a stage). For each \(j > j_0\) there is \(n_j\) with the following property. For every level \(m \geqslant n_j\) and every \(s \geqslant m \log 3\):

Sketch: each condition holds for all large \(s\). Take the largest of the thresholds, and \(n_j\) with \(n_j \log 3\) above it. Lean: Bar.enters.

Lemma 4.6 (windows). For each \(j\) there is \(c_j\) such that, for all \(k \geqslant c_j\) and all \(s\) with \(k \log 3 \leqslant s \leqslant k \log \ell_j\), we have \(\sigma^{\text{rdy}}_j \leqslant s\) and \(h_j (s) \leqslant k / 2\). Sketch: for large \(s\), \(h_j (s) \leqslant s / (2 \log \ell_j)\) by sublinearity, and \(s \leqslant k \log \ell_j\). Lean: Wait.lead.

4.2 The level schedule

Lemma 4.7 (exhaustion). For any \(b, c : \mathbb{N} \to \mathbb{N}\) there is \(J' : \mathbb{N} \to \mathbb{N}\) with the following properties:

Sketch: set \(a_0 = 0\) and \(a_{i + 1} = a_i + b (i + 1) + 2 k_i + 1\), where \(k_i = c (i) + 2 a_i + 1\). Put \(J' = i\) on \([a_i, a_{i + 1})\). Stage \(i + 1\) starts at level \(a_{i + 1} > b (i + 1)\). The window around \(k_i\) lies in \([a_i, a_{i + 1})\) because \(k_i / 2 \geqslant a_i\) and \(\tfrac{3}{2} k_i < a_{i + 1}\). Lean: Program.exhaust.

Lemma 4.8 (the schedule meets all entrance conditions; proof of III.2.2).

Construction.

  1. Apply Lemma 4.7 with \(b (0) = 0\) and \(b (i) = n_{j_0 + i}\) for \(i > 0\) (Lemma 4.5) and \(c (i) = c_{j_0 + i}\) (Lemma 4.6), and set \(J_m = j_0 + J'_m\), \(L_m = \ell_{J_{m + 1}}\) and \(s_m = \sum_{i < m} \log L_i\). Then \(m \log 3 \leqslant s_m \leqslant m \log \ell_{J_m}\), using that \(\ell\) and \(J\) are monotone.

  2. Let \(m_{\ast}\) be such that \(J'_m \geqslant 1\) for \(m \geqslant m_{\ast}\). Put \(M = n_{\min} + \max_{i \leqslant m_{\ast}} \text{bill}_{j_0} (s_i)\) and \(n_p = 4 (M + p + 1)\).

Verification.

Lean: Wait.ready, Program.book, scaled_lower, scaled_upper, Wait.engine.

4.3 Shooting

Lemma 4.9 (running law from the transfer inequality). Consider a history on a level system of III.2.2 with \(\beta_{N, p, 0} = \bar{\beta}\) and \(| \beta_{N, p, i + 1} - \beta_{N, p, i} - \kappa \log L_i | \leqslant \omega_{J_{i + 1}}\) for all \(i < N\). Then it obeys the running law of III.2.3. Sketch:

  1. Since \(\hat{\beta}_{i + 1} - \hat{\beta}_i = \kappa \log L_i\) and \(\beta_{N, p, 0} = \hat{\beta}_0\), induction upward from level 0 gives \(| \beta_{N, p, i} - \hat{\beta}_i | \leqslant D_i := \sum_{k = 1}^i \omega_{J_k}\).

  2. Given \(\varepsilon > 0\), choose \(i_0\) with \(J_{i + 1}^{- 2} \leqslant \varepsilon / 2\) for \(i \geqslant i_0\). Then \(\omega_{J_{i + 1}} \leqslant \frac{\varepsilon}{2} \log L_i\), so \(D_i \leqslant D_{i_0} + \frac{\varepsilon}{2} (s_i - s_{i_0})\).

  3. Finally \(D_{i_0} \leqslant \frac{\varepsilon}{2} s_i\) for large \(i\), because \(s_i \to \infty\).

The bound is uniform in \(N \geqslant i\) and \(p\). Lean: trajectory.

Lemma 4.10 (gates). Put \(\beta^-_m = \bar{\beta} + \frac{\kappa}{2} s_m\) and \(\beta^+_m = \bar{\beta} + 2 \kappa s_m\). Then \([\beta^-_m, \beta^+_m] \subset \mathfrak{B}_m\), because \(\bar{\beta} > 0\). Suppose a level-\(m\) representation \(\rho\) relays a level-\((m + 1)\) representation \(\rho'\), and \(\omega_{J_{m + 1}} \leqslant \frac{\kappa}{4} \log L_m\). Then:

The drift hypothesis follows from the entrance conditions and III.2.1(2), since \(L_m = \ell_{J_{m + 1}}\). Lean: floorBeta, ceilBeta, limits, gates, Drifting.pay.

Lemma 4.11 (narrowing). Let \(x \leqslant y\) and let \(f\) be continuous on \([x, y]\) with \(f (x) \leqslant d \leqslant u \leqslant f (y)\). Then there are \(x \leqslant z \leqslant w \leqslant y\) with \(f (z) = d\), \(f (w) = u\) and \(f ([z, w]) \subset [d, u]\). Sketch: let \(w\) be the least point of \(f^{- 1} (u) \cap [x, y]\) and \(z\) the greatest point of \(f^{- 1} (d) \cap [x, w]\); both sets are nonempty by the intermediate value theorem and compact by continuity. Suppose some \(c \in [z, w]\) has \(f (c) < d\). Then the intermediate value theorem on \([c, w]\) gives a point of \(f^{- 1} (d)\) after \(z\), a contradiction. Suppose instead \(f (c) > u\). Then it gives a point of \(f^{- 1} (u)\) before \(w\), again a contradiction. Lean: narrow.

Lemma 4.12 (nested intervals). Fix \(N, p\) and assume (start), (advance) and the drift bound. One can choose intervals \(I_m = [l_m, u_m]\), \(0 \leqslant m \leqslant N\), with \(I_N = [\beta^-_N, \beta^+_N]\) and \(I_m \subset I_{m + 1}\) for \(m < N\), and partial trajectories \((\rho^x_i)_{m \leqslant i \leqslant N}\) for \(x \in [l_m, u_m]\), such that:

Sketch: downward induction.

The restriction is needed: (advance) applies only to families whose couplings lie in the band at every point. Only the continuity of \(x \mapsto \beta (\rho^x_m)\) enters the intermediate value argument. The other continuity clauses are carried because (advance) requires them at the next step. Lean: steps.

Lemma 4.13 (endpoint and assembly; proof of III.2.3). Since \(s_0 = 0\), we have \(\beta^-_0 = \beta^+_0 = \bar{\beta}\). So \(x = l_0\) gives a trajectory from level \(N\) to level 0 with \(\beta_{N, p, 0} = \bar{\beta}\). Choose one such trajectory for every \((N, p)\). Then:

Hence the history is selected. Lean: successful, Competes, Recipe.races.

4.4 Persistent purchases and their composition

Lemma 4.14 (composition rules). Persistent numerical requirements can be combined in the following forms:

Floors combine by pointwise maximum. Suppliers of forms (ii) and (iii) combine by chaining, because the orders on delays and waits are transitive and the conclusions persist under raising. Lean: postnumeric_quote_diagonal_pair_requests, and the chains in joinExpensesShipWithPrediction.

Lemma 4.15 (diagonal payments; proof of III.2.8).

Lean: eventuallyPaid, minDelay, buy.

Lemma 4.16 (the sheet). Let \(G\) be simple, let \(K\) have branches at every patch, let the order data \(v\) satisfy the order conditions of III.2.4, and fix a sequence \(C_j \geqslant 1\). There are a sheet \(s\) with kernel \(K\) and the prescribed first stage, orders, powers and support exponents; two price maps \(O, T\); real sequences \(\lambda, \gamma\) with \(\gamma_j > 0\); and a nondecreasing sequence \(K'_j \geqslant 1\). For every tariff and scope there is a floor \(f \geqslant f^s\) with the following properties.

The sheet satisfies the stationary-path suitability conditions at stages \(j \geqslant j_0\) and the budget plans for \(C, K'\). For every floor \(n \geqslant f\) and every admissible block-factor sequence \(\ell\), there is a sequence \(\eta\) satisfying the stationary budget-gap condition. For every post-\(L\) cost record \(F\) with \(\eta_F = \eta\), \(\Gamma_F \geqslant 1\) and \(c_F \leqslant \gamma\), every protection, additional tariff, nonnegative lower bound \(z\) and delay \(A\), there are a delay \(D \geqslant A\), a transition-bound array bounded below by \(z\), and two further transition arrays. Every later delay \(E \geqslant D\) satisfies the pricing, ringing and comparison conditions. For every barrier, wait and level system meeting those entrance conditions, the budget and multisource conditions hold, and there are a Gaussian horizon and kinetic data with planned stationary paths, the Wilson top path, the cadre and amplification conditions, and the retained free and stationary data specified by the perceived-estimate package.

Sketch: the free-kernel and stationary suppliers first fix widths and preliminary bounds. The sheet construction fixes clips and the prescribed orders; the startup suppliers enlarge path bounds and floors. The final profile construction raises drift allowances to dominate the stationary supplier's bounds and raises column bounds without changing widths, paths or the prescribed orders. After choosing \(\ell\), the stationary and multisource suppliers raise the delay and construct the kinetic data on each admitted level system. The retained data identify these kinetic paths with the revised stationary paths. Lean: sailsW, Perceived. (proof read at the level of the composition)

Lemma 4.17 (the native purchase and prediction). Let \(G\) be simple, fix the perceived-estimate package of Lemma 4.16 at a floor \(v\), and let \(\tau > 0\). There are a floor \(j \geqslant v\), programs, initial wages, targets, expenses and a baton, chosen before the block factors. The targets have the canonical chart and halo \(500\); the expenses have the prescribed earnings, deficit \(- 7 / 16\) and degree charge \(0\).

For every floor \(l \geqslant j\), admissible block factors exist. For every such choice there is a wage threshold. For every wage above it there are duration bounds, a register and auxiliary size bounds. For every postage cap there are postage rates at most that cap and scouts satisfying the register condition. For every exchange datum and tariff there are reset prices, reset bounds and post-\(L\) costs. For every positive sequence \(\theta^0\) there are protection \(\theta \leqslant \theta^0\) and step records with \(\varepsilon \leqslant 1 / 4\) on transitions whose output stage is at least the first stage. For every menu and initial delay there are booths; for every auxiliary record there is an ordered delay above the initial delay.

Every later delay, barrier, wait and admitted level system satisfies the budget and multisource conditions and carries a directed datum on that same system. Its shelter conditions hold at the two pairs of tolerances \((1 / 16, 1 / 16)\) and \((\tau, \tau)\), with the third tolerance \(1 / 8\) in both cases. It also has the top kinetic data, cadre, amplification, step conditions, origins and rank-covariance data. The offering condition additionally assumes divisible periods.

Sketch: the shelter supplier gives the initial floor and data. A further floor pays the register's length requirement; a delay supplier supplies the step conditions before the booths are chosen. The shelter output then supplies the remaining data. For III.2.6, combine the prediction's floor \(u\) with \(j\) by maximum. Insert its delay before the booth delay; persistence then gives the prediction on the same emitted factor whenever the divisibility condition holds. Lean: companyK (proof read at the level of the composition); company.

Lemma 4.18 (proof of III.2.4 and III.2.5). The proofs proceed in four steps.

  1. joinRadarsShipWithPrediction takes the sheet from Lemma 4.16 and calls joinExpensesShipWithPrediction. That theorem starts from Lemma 4.17 and threads about thirty further suppliers through it:

  2. richFaresWithPrediction adds:

  3. plentifulWithPrediction adds:

    It concludes with Trace.Over.gang.

  4. Floors are combined by maximum and delay and wait bounds by transitivity, as in Lemma 4.14. The final family conclusion uses the hypotheses of III.2.5.

(proof read at the level of the composition; the suppliers were not read)

Lemma 4.19 (the final assembly; proof of III.2.7). allFactor… makes the choices in order:

  1. Pre-\(L\) data.

  2. The plentiful construction. Apply III.2.5. Pick a choice \(c\) of the demand.

  3. Block floor and block factors. The block floor is the maximum of five floors: the plentiful floor, a density floor, the treasury floor, the period-plan floor and \(e_c\). Fix block factors, wages and post-\(L\) costs.

  4. Smallness exponent and delays. Take \(\theta^0 \equiv 1\) and initial data \(\beta^{\text{ent}} = \sigma^{\text{ent}} = 0\), \(S_j = g_j = 1\). Raise delays in this order: halo, step, thermal requests, \(\Lambda\) and both demand arrays together with the all-stage payment of the zeroth post-\(L\) row, treasury, period plan, auxiliary budget, silk, custody, the delay of III.2.5, the quote bounds, and the header bounds.

  5. Barrier. Take \(\bar{\beta} \geqslant 2\) (Lemma 4.3).

  6. Wait. First apply the wait supplier of III.2.5 to a zero-window wait. Separately enlarge a slim wait for density bounds. Choose a common enlargement satisfying both waits and the required coverage bounds.

  7. Level system. Take the level system of the divisibility variant of III.2.2, and the factor from III.2.5.

Finally engageWithCustodyFactor builds the run from the factor. (proof read at the level of the composition)

4.5 The analytic lemmas

Lemma 4.20 (mechanisms behind III.2.9). Under the hypotheses of III.2.9, the estimates follow as follows.

(proofs read at the level of the displayed declarations; the analytic division, transfer and local-projection inputs are not independently audited)

5. Where the difficulty lies

6. Notation

Written proof Lean Meaning
sheet; stage record \(X_j\); first stage \(j_0\); floors \(f_j\) Sheet, Stage data fixed before the block factors
\(k_j, q_j, a_j, w_j, \varpi_j, \omega_j, \gamma_j, r_j\) order, power, supportExponent, width, paths, drift, columns, clip.relaxation fields of the stage record
\(\mathcal{C}_j\) (in Large) \(1 + \varpi_j + w_j^{- 1} + \gamma_j + r_j + a_j\)
\(\ell_j\); \(L_m = \ell_{J_{m + 1}}\) Rolls; Schedule.block stage and step block factors
\(\theta_j\) Protection smallness exponent of the loop cap
\(\beta^{\text{ent}}_j, \sigma^{\text{ent}}_j (\bar{\beta}), S_j, g_j\) Delays entry thresholds, shells, growth
\(\bar{\beta}\) Bar barrier: coupling at level 0
\(\sigma^{\text{rdy}}_j, h_j, n_{\min}\) Wait readiness, windows, minimal period
meets the entrance conditions Paid III.2.2(a)–(d)
\(\text{bill}_j (s)\) Bar.bill required sites per unit length
\(J'\), \(J_m = j_0 + J'_m\) Program stage index
\(n_p = 4 (M + p + 1)\) Program.page level-0 side, with \(M \in \mathbb{N}\)
recipe \(\mathcal{R}\) Recipe path data and three tests
admissible; relays; start Lives, Relays, Starter
continuous family Curve, deviation
(start)+(advance) Recipe.Issues shooting hypotheses
\(\mathfrak{B}_m\); \([\beta^-_m, \beta^+_m]\) band; floorBeta, ceilBeta band; shooting window
eventually paid EventuallyPaid III.2.8(a)
plan; treasury funded Plan, TreasuryFunded III.2.8(d)
emitted factor; prediction Factor, Prediction record of all choices; predicate on it
sheet with floors \(n\) raise, bountyV
order data \(v\) Orders, Draft, WithStage

7. What remains unexplained

  1. Analytic content of the purchased conditions. The common-choice statements III.2.4–III.2.7 and their quantifier order are verified against the displayed Lean interfaces. The predicates in the requirement table, the conditional family package, and the campaign's pillars, funding, news, custody and sky conditions are not fully expanded into mathematical estimates here. Their equivalence to the requirements stated in the owning units remains to be checked.

  2. Underlying suppliers. The proofs composing the sheet, native, joint, plentiful and final-run constructions have been checked at their call sites. The proofs of the underlying analytic suppliers, including those used by the roughly thirty additions in the joint construction, are not independently verified here. The same limitation applies to the plan's dictionaries and inverse-charge supplier, and to the analytic division and projection results used in III.2.9.

  3. Auxiliary parameters. \(K'\) is a nondecreasing sequence bounded below by \(1\); the tableau is a finite interpolation rule of degree \(300\); the sphere condition is a contraction estimate. The detailed analytic roles of \(Y\), \(Q\), wages, postage, exchanges, menus and the remaining auxiliary records still require identification in the step estimates.

  4. Drift normalization. The sheet construction raises the drift allowance to dominate the stationary supplier's sequence. Its identification with the bound \(1 + D\) used in III.9, including the relation between the constants attributed there to III.7 and III.13, remains unverified.

  5. Analytic interfaces. The weighted summability and vanishing-order definitions, the first-site support condition in multilinear transfer, and the rate interpretation of odd-part cancellation have been checked. The full step-scene hypotheses of odd-part cancellation and the coefficient-format and readability conditions of local read-out still need an independent mathematical account. Only the statements of the supplementary Hessian, cubic/quartic extraction and trace-insertion estimates linked after III.2.9 were checked; their proofs remain outside this review.

  6. Scope of the source review. The arithmetic construction, the divisibility argument, and the shooting proof are verified against the source. Other uses of the non-divisible period construction, the allocation of the supplementary analytic estimates to outline units, and the line-count breakdown given at the outset have not been independently checked.

← III.1 The block-spin step and the symmetric gauge fixing (notes)Part III·Unit outlineIII.3 Free lattice kernels and covariances (notes) →