Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← II.1 Field labels and their lattice representatives (notes)Part II·Unit outlineIII.1 The block-spin step and the symmetric gauge fixing (notes) →

II.2. Marker algebra, polymer combinatorics and Gaussian estimates — detailed notes

Contents

1. What this unit proves 2

A. Marker algebra 2

B. Polymer combinatorics 4

C. Switching 7

D. Gaussian polynomial calculus 8

E. Numbers 10

2. What it uses 13

3. Strategy 14

4. Steps 15

4.1 Marker algebra 15

4.2 Components and the tree bound 16

4.3 Two kinds of overlap 18

4.4 Switching 18

4.5 Gaussian calculus 19

4.6 Numbers 21

5. Where the difficulty lies 22

6. Notation 23

7. What remains unexplained 24

The full account of unit II.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: II, Data of the construction. Lean: YM/Marker/, YM/Ac/, YM/Ovens/Coffee.lean, YM/Further/SHELL_BIRTH_49/Fusing/Coal.lean, YM/Extra/MULTISOURCE_TRAJECTORIES/, YM/Push/GRID_APPROXIMATION/Nil.lean, YM/MergeProof/, YM/Next/RANK/, YM/Vac/Treasury.lean. Size: 3,691 lines in 793 declarations used by the main theorem.

This unit supplies the algebraic, combinatorial and numerical estimates used to multiply and sum polymer activities in Part III, especially in the Gaussian comparison of III.11. The activity format is defined in III.1; the Wilson family and construction record in II.1; reflection-positive cells in IV.1.

The results fall into five groups: marker algebra (II.2.1–II.2.4), polymer combinatorics and forced-activity fusion (II.2.5–II.2.8), switching (II.2.9), Gaussian polynomial calculus (II.2.10–II.2.11), and numerical scale comparisons (II.2.12–II.2.13). They are used in III.8–III.13, III.15, VII.2, VII.4 and VII.6; the vacuum-energy estimate also enters V.2.

1. What this unit proves

Conventions.

A. Marker algebra

Proposition II.2.1 (marker algebra). Let \(V\) be a finite set and \(R\) a census on \(V\): a finite family of finite subsets of \(V\) that contains \(\emptyset\) and all singletons and is closed under taking subsets. Let \(\mathcal{A}_R\) be the space of functions \(a : R \to \mathbb{C}\), written \(a = \sum_{x \in R} a (x) \delta_x\), with product

\(\displaystyle (ab) (z) = \sum_{x, y \in R : x \cap y = \emptyset, x \cup y = z} a (x) \hspace{0.17em} b (y) \qquad (z \in R) .\)

Then:

  1. \(\mathcal{A}_R\) is a commutative unital \(\mathbb{C}\)-algebra with unit \(\delta_{\emptyset}\).

  2. \(\delta_x \delta_y = \delta_{x \cup y}\) if \(x \cap y = \emptyset\) and \(x \cup y \in R\), and \(\delta_x \delta_y = 0\) otherwise. So every marker \(\delta_{\{v\}}\) squares to zero, and products that leave \(R\) vanish.

  3. \((ab) (\emptyset) = a (\emptyset) \hspace{0.17em} b (\emptyset)\).

  4. If \(a (\emptyset) = 0\), then \(a^k (x) = 0\) whenever \(|x| < k\); in particular, \(a^k = 0\) for \(k > |V|\).

Status: theorem. Lean: Marker.Census, Poly, Poly.prod, ring structure, Poly.quiet_mul, Poly.high, Poly.stops.

Proposition II.2.2 (weighted \(\ell^1\) norm). For \(w : V \to (0, \infty)\) put \(w^x = \prod_{v \in x} w_v\) and \(\|a\|_w = \sum_{x \in R} w^x |a (x) |\). Then \(\|1\|_w = 1\), \(\|c \hspace{0.17em} \delta_x \|_w = w^x |c|\), and

\(\displaystyle \|ab\|_w \leqslant \|a\|_w \|b\|_w, \qquad | \prod_{i \in T} a_i |_w \leqslant \prod_{i \in T} \|a_i \|_w, \qquad \|a^k \|_w \leqslant \|a\|_w^k .\)

Set \(\text{Exp} (a) = \sum_{k = 0}^{|V|} a^k / k!\).

The multiplicative and exponential bounds have constant \(1\), independently of \(R\) and \(|V|\). The norm-comparison constant is used to establish convergence.

Status: theorem. Lean: Poly.toll, Poly.price, multiplication, multiple, powers, Poly.pass, pass_budget, budgeted, share, equivalent_norm.

Proposition II.2.3 (exponential and connected polynomial). Use the marker algebra and exponential of II.2.1–II.2.2.

(a) If \(a (\emptyset) = b (\emptyset) = 0\), then \(\text{Exp} (a + b) = \text{Exp} (a) \hspace{0.17em} \text{Exp} (b)\) and \(\text{Exp} (- a) \hspace{0.17em} \text{Exp} (a) = 1\). More generally, \(\text{Exp} (\sum_{i \in s} a_i) = \prod_{i \in s} \text{Exp} (a_i)\) for a finite family with all \(a_i (\emptyset) = 0\). The zero-constant-term hypotheses are necessary for these identities in general.

(b) If \(x \neq \emptyset\), then \(\text{Exp} (c \hspace{0.17em} \delta_x) = 1 + c \hspace{0.17em} \delta_x\). Hence, for a finite family of nonempty \(x_i \in R\) (not necessarily distinct),

\(\displaystyle \text{Exp} \left( \sum_{i \in s} c_i \delta_{x_i} \right) = \prod_{i \in s} (1 + c_i \delta_{x_i}) .\)

(c) If \(F (\emptyset) = 1\), there is exactly one \(C \in \mathcal{A}_R\) with \(C (\emptyset) = 0\) and \(\text{Exp} (C) = F\): the connected polynomial of \(F\). It is obtained by iteration:

(d) If \(C (\emptyset) = 0\) and \(\text{Exp} (C) = F\), then \(F \hspace{0.17em} \text{Exp} (- C) \hspace{0.17em} P = P\) for every \(P\).

Status: theorem. Lean: Exponential.pass_add, pass_neg, pass_sum, Trajectories.pass_send, Trajectories.pass_sum, Expands, roll, rolls, roll_cont, Expands.uniq, connected_spec, correct.

Proposition II.2.4 (tagged products; repacking). Use positive weights \(w\) as in II.2.2.

(a) Let \(\tau : \iota \to R\) and let \(s \subseteq \iota\) be finite. Say that \(s\) fits if the sets \(\tau (i)\), \(i \in s\), are pairwise disjoint and their union lies in \(R\).

(b) Let:

For finite \(s \subseteq \iota\) put \(\text{val} (s) = \prod_{i \in s} F_i\) if \(\sigma\) is injective on \(s\) and \(\sigma (s)\) is admissible, and \(\text{val} (s) = 0\) otherwise. Then \(\text{val}\) is summable over finite subsets of \(\iota\), and

\(\displaystyle \sum_s \text{val} (s) = \sum_{S \subseteq \kappa \text{ finite, admissible}} \prod_{k \in S} \sum_{i : \hspace{0.17em} \sigma (i) = k} F_i .\)

Status: theorem. Lean: Trajectories.Fits, tagged_prod, fits_of_tagged_prod, toll_union, Packets.summable_value, Packets.repack.

B. Polymer combinatorics

Proposition II.2.5 (connected components). Let \(X : \iota \to \{ \text{supports} \}\) and let \(s \subseteq \iota\) be finite.

Then:

  1. The parts of \(s\) are sparks, pairwise disjoint, with union \(s\) and with pairwise disjoint supports \(X (p)\).

  2. If \(S\) is a finite set of sparks with pairwise disjoint supports, then \(\text{Parts} (\bigcup S) = S\).

  3. If \(s\) is a spark and \(i \in s\), every label of \(s \setminus \{i\}\) is chained in \(s \setminus \{i\}\) to a label whose support meets \(X_i\).

  4. If every label of \(s\) is chained in \(s\) to a label meeting a support \(Y\) (call \(s\) a pack for \(Y\)), then every part of \(s\) contains a label meeting \(Y\).

The same component statements hold when the supports are finite subsets of any set.

Status: theorem. Lean: Ac.Spark, Parts, reconstruct, separate, separates, excise, packHits, Collide.uncluttered.

Proposition II.2.6 (tree bound in cover-number weights). Let:

Assume the hit condition with exponent \(a + 1\): for every site \(x\) the family \(\left( \boldsymbol{1}[x \in X_i] \hspace{0.17em} f_i \hspace{0.17em} e^{(a + 1) \text{cov}_M (X_i)} \right)_i\) is summable, with sum at most \(\gamma\). Then for every site \(x\),

\(\displaystyle \sum_{s \text{spark}, x \in X (s)} e^{a \hspace{0.17em} \text{cov}_M (X (s))} \prod_{i \in s} f_i \leqslant e^{\gamma} - 1.\)

The sum runs over finite sets of labels, so each label is used at most once, and the family is summable.

Status: theorem. Used by III.9–III.13, VII.2 and VII.6. Lean: Ac.Hit, Ac.roots, Ac.forest.

Proposition II.2.7 (unique recovery for two kinds of overlap). A kiln on a set \(I\) of labels consists of:

For finite \(s \subseteq I\):

Then:

  1. Every slab \(p\) of \(s\) is a mole, and the fuel of its labels computed in \(p\) equals the fuel computed in \(s\). Distinct slabs have disjoint mention-unions. Distinct slabs that contain a dirty label have disjoint wall-unions. (In a mole, containing a dirty label is equivalent to all labels being hot.)

  2. Conversely, let \(S\) be a finite set of moles with pairwise disjoint mention-unions, and with pairwise disjoint wall-unions among the members that contain a dirty label. Then the slabs of \(\bigcup S\) are exactly the members of \(S\).

  3. By 1 and 2, \(s \mapsto \text{slabs} (s)\) and \(S \mapsto \bigcup S\) are inverse bijections between finite sets of labels and such finite sets of moles.

  4. Suppose the walls are supports and, inside a mole \(s\), overlapping mentions imply overlapping walls. Then \(s\) is a spark for the walls. Thus a family of moles can be estimated by II.2.6 whenever its wall supports and weights satisfy that proposition’s hypotheses.

Status: theorem. Used by III.11 and VII.4. Lean: Kiln, Kiln.Hot, fuel, Mole, good, fuel_comp, clubs_away, walls_away, takes_mole, Kiln.undo, Kiln.attends.

Proposition II.2.8 (fused gas of forced activities: definitions). Fix a gauge group \(G\) and a periodic lattice \(\Lambda\).

Data.

Fused activities. Fix a activity parameter point \(P\) and a bijective enumeration \(F\) of the pellets. Eligibility is always tested at the threshold of \(P\). The fused activities keep the regular part \((\text{reg}_i, E_i)\). Their forced part is indexed by pellets:

\(\displaystyle \text{solid}_i (U) =\boldsymbol{1} [\text{the address of } F (i) \text{ is eligible at } U] \prod_{j \in F (i)} \text{reach}_j (U) .\)

The unit also defines the hypotheses under which the fused gas is used. Below, \(B\) is the cover size of \(P\).

Status: definitions, plus one theorem (an enumeration exists). The properties of the fused gas are the work items H01–H04, stated in YM/Bid/Kitchen.lean and proved in III.10:

At startup in III.9, the digest and fusion bounds follow from clip compatibility, threshold and coupling bounds, and the packet estimates in the cited results (Start.digests, Loan.buys). Lean: Ovens.Pipes, Tap, reach, contains, addr, solid, fused, Digests, Buys, invariantJet, little, retakes, encoding; the obligations Bid.H01–H04, proved by Work.H01.answer, H02.answer, H03.answer, H04.answer (III.10).

C. Switching

Proposition II.2.9 (switching). Let \(\iota\) be finite. For \(x \in \mathbb{R}\) and \(g : 2^{\iota} \to \mathbb{R}\) put \(\text{val}_x (g) (r) = \sum_{i \subseteq r} x^{|i|} g (i)\). This is the value at \(x\boldsymbol{1}_r \in \{0, x\}^{\iota}\) of the multilinear polynomial \(\sum_i g (i) \prod_{v \in i} X_v\).

(a) For \(x > 0\), \(\text{val}_x\) is a linear bijection of \(\mathbb{R}^{2^{\iota}}\).

(b) Let \((f_x)_{x \in [0, 1]}\) be functions on \(2^{\iota}\). Say \((g_x)\) models \(f\) if \(\text{val}_x (g_x) = f_x\) for \(x \in [0, 1]\) and \(g_x \to g_0\) as \(x \downarrow 0\). In that case \(\text{jet} (f) := \lim_{x \downarrow 0} \text{val}_x^{- 1} (f_x)\) exists and equals \(g_0\).

(c) A family \((f^u)_u\) is paid at cost \(c\) if there is \(b \geqslant 0\) on \(2^{\iota}\) with \(\sum_i b (i) \leqslant c\) such that, for each \(u\), some model \(g^u\) of \(f^u\) satisfies \(|g^u_x (i) | \leqslant b (i)\) for all \(x \in [0, 1]\). Then:

(d) If \(f\) has a model and \(f_x (r) = f_x (r \setminus \{v\})\) for every \(r\) and \(x \in [0, 1]\), then \(\text{jet} (f) (i) = 0\) whenever \(v \in i\). For a paid family on a measurable parameter space, if \(u \mapsto f^u_x (r)\) is measurable for each fixed \(x \in [0, 1]\) and \(r\), then \(u \mapsto \text{jet} (f^u) (i)\) is measurable for every \(i\).

(e) For \(\rho : \iota \to \mathcal{A}_R\) put \(\text{snd}_{\rho} (f) = \sum_{i \subseteq \iota} \text{jet} (f) (i) \prod_{v \in i} \rho_v\).

Status: theorem. For square-zero \(\rho_v\), \(\text{snd}_{\rho}\) is multiplicative on functions with models. For paid families with summable costs, it commutes with sums; for paid \(f\), it sends \(e^f\) to the exponential series of \(\text{snd}_{\rho} (f)\) (mul_sounds, soundSum, soundExp). Lean: Switch.value, entire, jet, Models, Models.exact, Paid, Paid.tasting, Paid.add, Paid.sum, paidClick, comb, Paid.mul, Paid.prod, jet_erase, Paid.jet_meas, mapScores, sound, Accent.crystal, Accent.quality.

D. Gaussian polynomial calculus

Conventions.

Proposition II.2.10 (algebraic Gaussian expectations). Let \(Q\) be a covariance. The operators \(X_v + \partial_{Q_{v \cdot}}\) on \(\mathbb{C} [X]\) commute; define \(\mathcal{G}_Q p = p (X + \partial_Q) \hspace{0.17em} 1\).

(a) \(\mathcal{G}_Q\) satisfies:

(Equivalently \(\mathcal{G}_Q = \exp (\tfrac{1}{2} \sum_{v, w} Q_{vw} \partial_v \partial_w)\), so \(\mathcal{G}_{- M}\) is Wick ordering with respect to \(M\). On each polynomial the derivative sum and exponential series have only finitely many nonzero terms.)

(b) For \(m \in \mathbb{C}^V\) put \(\mathbb{E}_{Q, m} (p) = (\mathcal{G}_Q p) (m)\). This is a linear functional with \(\mathbb{E}_{Q, m} (1) = 1\), and it satisfies, for every finite set \(s\) and choice of variables \(z_j\), the Wick recursion

\(\displaystyle \mathbb{E}_{Q, m} \left( X_v \prod_{j \in s} X_{z_j} \right) = m_v \hspace{0.17em} \mathbb{E}_{Q, m} \left( \prod_{j \in s} X_{z_j} \right) + \sum_{j \in s} Q_{vz_j} \hspace{0.17em} \mathbb{E}_{Q, m} \left( \prod_{k \in s \setminus \{j\}} X_{z_k} \right) .\)

(c) Change of variables. For a matrix \(A = (A_{vz})\) with finitely supported rows, define the linear substitution \(p \mapsto p \circ A\) by \(X_v \mapsto \sum_z A_{vz} X_z\). If \(Q\) is a covariance and \(m\) a mean on the new variables, then:

(d) Identification. Let \(\xi\) be a random vector in \(\mathbb{R}^V\) under a probability measure. Assume all polynomial moments of \(\xi\) are finite and \(\mathbb{E} [\xi_v \hspace{0.17em} q (\xi)] =\mathbb{E} [(\partial_{Q_{v \cdot}} q) (\xi)]\) for every polynomial \(q\) (Gaussian integration by parts). Then \(\mathbb{E} [q (m + \xi)] =\mathbb{E}_{Q, m} (q)\) for every \(m \in \mathbb{R}^V\).

(e) Bounds. Let \(B \geqslant 1\), \(|m_v | \leqslant B\), \(|Q_{vw} | \leqslant B\) and \(\deg p \leqslant d\). Then

\(\displaystyle |\mathbb{E}_{Q, m} (p) | \leqslant \|p\|_1 \hspace{0.17em} \pi (B, d) .\)

If \((Q', m')\) obeys the same bounds and each corresponding entry of the means and covariances differs by at most \(E \geqslant 0\), then \(|\mathbb{E}_{Q, m} (p) -\mathbb{E}_{Q', m'} (p) | \leqslant \|p\|_1 \hspace{0.17em} E \hspace{0.17em} \pi (B, d)\). In the first bound, and in the second when \(m = m'\), it suffices to assume the hypotheses for entries indexed by the variables of \(p\).

Status: theorem. Used by III.11 and VII.6. Lean: Normal.Symmetric, slit, cream_comm, milk, feeds, skims, froze, warms, blend, spring, prepared, wets, VMeasure, payment, Common.priced, Common.width, Common.differs, Tapes.bound_v, Tapes.differently.

Proposition II.2.11 (estimates for Gaussian polynomial steps). All polynomial degrees below are total degrees.

(a) Weighted coefficient norms. For \(w : V \to \mathbb{N}\) and \(r \geqslant 0\), the quantity \(\|p\|_{w, r} = \sum_{\alpha} r^{w \cdot \alpha} |c_{\alpha} |\) is submultiplicative, and \(\| \cdot \|_1 = \| \cdot \|_{0, 1}\). It is a norm when \(r > 0\) and may be a seminorm at \(r = 0\). For a linear substitution \(X_v \mapsto e_v\) with \(\|e_v \|_{w, r} \leqslant c\) and \(c \geqslant 1\),

\(\displaystyle \|p \circ e\|_{w, r} \leqslant \|p\|_1 \hspace{0.17em} c^{\deg p} .\)

(b) Smoothing near the identity. If \(0 \leqslant e \leqslant 1\), \(|Q_{vw} | \leqslant e\) and \(\deg p \leqslant D\), then \(\|\mathcal{G}_Q p - p\|_1 \leqslant \|p\|_1 \hspace{0.17em} e \hspace{0.17em} (2 (D + 2))^D\) and \(\deg \mathcal{G}_Q p \leqslant D\).

(c) One step. Let \(T_{H, Q} p = (\mathcal{G}_Q p) \circ H\), where \(H = (H_v)\) are linear forms in new variables and \(Q\) is a covariance.

(d) Linearization of a rescaled substitution. Let:

Then

\(\displaystyle | \Phi_t (P) - (\mathcal{G}_K P) \circ f |_1 \leqslant \|P\|_1 \left( n \hspace{0.17em} tB (2 B)^n + \varepsilon (2 (n + 2))^n B^n \right) .\)

(e) Guards and second moments. Call \(g\) an \(\eta\)-guard for \(\mu\) if \(g\) is measurable, \(0 \leqslant g \leqslant 1\), and \(\int (1 - g) \hspace{0.17em} d \mu \leqslant \eta\).

(f) Coefficients from values.

Status: theorem. Used by III.11 and VII.6. Lean: Rise.cents, Rise.funds, Rise.rise, LiftMark.bounds, Normal.pipe, Tapes.Valve, Valve.Fair, crest, crux, bridge, LiftMark.garnish, LiftMark.stock, Guarded, guards_mul, escaped, squareFits, Spindle.molds, Spindle.listen, Spindle.amove.

E. Numbers

Proposition II.2.12 (scale functions). For \(s > e\) put

\(\displaystyle y = \log \log s, \quad \Pi = e^{y^2}, \quad \theta = s^{- 1 / 2} \Pi, \quad h = e^{y^{3 / 2}}, \quad j = h^{1 / 5}, \quad \omega = e^{- \frac{7}{10} j}, \quad M = \lceil (\log s)^2 \rceil, \quad W = M^2,\)

all as functions of \(s\). Here \(\theta\) is the original small-field threshold. Then:

  1. For every \(b \in \mathbb{R}\) and \(p > 0\), eventually \(\Pi (s)^b \leqslant s^p\).

  2. Eventually \(s \theta^2 = \Pi^2\), \(s \theta^3 \leqslant 1\), \(s \theta^4 \leqslant 1\), and \(2 \Pi^v \theta^2 \leqslant 1\) for every \(v \leqslant 1\).

  3. For all \(a > 0\), \(k \in \mathbb{N}\) and \(c \in \mathbb{R}\), eventually:

  4. For every \(c \in \mathbb{R}\) and \(a < b\), \(c \hspace{0.17em} \Pi^a \leqslant \Pi^b\) eventually.

Here \(f \ll g\) means \(f / g \to 0\) as \(s \to \infty\). For every fixed \(a, p > 0\), \(y^2 \ll j \ll h \ll \Pi^a \ll s^p\); also \(W (s) \sim (\log s)^4\).

Status: theorem. Item 2 is used in III.10, III.11 and V.2 (the per-site vacuum-energy bound treasury_stage); item 3 is used in III.11. Lean: Numbers.monitor, Hat, P, theta, cost, uniform_loop, Perch.bill, walls, hot, join, w, logspan, rate_wall, rate_inverse, rate_fire, fire_stretch, Spindle.hotter, Paint.q_power, Glimmer.transports.

Proposition II.2.13 (numerical conditions for the rank comparison). Use the scales of II.2.12, and write \(\Pi = \Pi (s)\), \(y = y (s)\) in formulas involving both \(s\) and \(u\).

(a) Shelf conditions. Fix \(m, Q \in \mathbb{N}\), \(e, U, V \geqslant 0\) and \(a > 0\). Put \(A_Q = (2 Q + 1)^4\) and \(G (u) = e^{- ah (u)^2}\). For all sufficiently large \(s\), the following ten inequalities hold simultaneously for every \(u \in [s / 2, s]\):

\(\displaystyle \begin{aligned} 8 & \leqslant W (u),\\ W (u)^2 + 2 QW (u) & \leqslant M (s)^{10},\\ 64 (mU + 1) y^2 & \leqslant W (u),\\ 64 (mU + 4 \cdot 2^m) y^2 & \leqslant W (u),\\ 2^m \Pi^{- 25 / 32} + \Pi^{- 1} + \Pi^{- 2} & \leqslant \Pi^{- 3 / 4},\\ e^{mUy^2 + 4 \cdot 2^m y^2 + 2 j (u)} G (u) + 2^m \Pi^{- 3} & \leqslant \Pi^{- 1},\\ (2 W (u) + 1)^4 \Pi^{- 1} & \leqslant 1,\\ e^{eA_Q} \Pi^{1 / 8} \Pi^{- 31 / 32} & \leqslant \Pi^{- 25 / 32},\\ e^{(e + 1) A_Q} \Pi^{1 / 8} \Pi^{1 / 4} & \leqslant \Pi,\\ e^{- 2 j (u)} (e^{\Pi^{- 1}} - 1) & \leqslant \Pi^{- 3 / 4} \omega (u) . \end{aligned}\)

The fifth line uses \(e^{mVy^2} \Pi^{- mV - 2} = \Pi^{- 2}\). The seventh is the geometric hypothesis of II.2.6 with cover size \(W (u)\) and hit bound \(\Pi^{- 1}\).

(b) Tally conditions. For the same data, fix \(\alpha \geqslant 1\) and \(L > 1\), and put

\(\displaystyle n (L, s) = \left\lceil \frac{10 \log M (s)}{\log L} \right\rceil .\)

For all sufficiently large \(s\),

\(\displaystyle (\alpha + 1)^{n (L, s)} \Pi (s)^{- 3 / 4} \leqslant \Pi (s)^{- 1 / 2},\)

and (a) holds for every \(u \in [s / 2, s]\). Moreover,

\(\displaystyle G (u) \leqslant \Pi (s)^{- 3 / 4} \omega (v) \qquad (u, v \in [s / 2, s]) .\)

(c) Gaussian prices. For \(k, n \in \mathbb{N}\), set \(\phi = 1 / (4 (nk + k + 1))\). For every fixed \(A \geqslant 1\), eventually in \(s\),

\(\displaystyle n \Pi^{- 2} (A + \Pi^{- 2})^n \pi (\Pi^{\phi}, nk) + A^n \Pi^{- 2} \pi (\Pi^{\phi}, nk) \leqslant \Pi^{- 3 / 2} .\)

Thus the error parameters \(\xi = \Pi^{- 2}\), covariance error \(\Pi^{- 2}\), mean and covariance bound \(\Pi^{\phi}\), and reference norm bound \(A\) satisfy the polynomial comparison condition with error \(\Pi^{- 3 / 2}\).

(d) Iteration parameters. A parameter record consists of an era \((Q, e, U, V, a, \alpha)\) as above, integers \(t, g, H_0 \geqslant 0\), and real numbers \(b, c, f, F, K\) satisfying

\(\displaystyle c \geqslant 1, \quad K \geqslant 1, \quad F \geqslant 0, \quad f + c \leqslant - 8, \quad g \geqslant 6, \quad U = V, \quad f = \tfrac{1}{16} - U, \quad 2 V + 2 \leqslant g - 1.\)

Here \(t\) is the Taylor order, \(g\) the target order, \(H_0\) a support parameter, \(b\) an exponent, \(c\) a coefficient exponent, and \(F\) an error exponent. Write \(C_d = (2 (d + 2) K)^d\). At scale \(s\) and integer height \(H\), the iteration conditions are

\(\displaystyle (\alpha + 2)^H \leqslant \Pi, \qquad C_t^H \leqslant \Pi, \qquad C_{2 t}^H \leqslant \Pi, \qquad \Pi^{2 c + 1} + \Pi^{2 c + 2} \leqslant \Pi^{2 c + 3}, \qquad H \leqslant \Pi .\)

They imply, for every integer \(0 \leqslant r \leqslant H\),

\(\displaystyle (\alpha + 2)^r \Pi^{- g} \leqslant \Pi^{1 - g} \leqslant \Pi^{- 4} .\)

For \(b \geqslant 0\), the block-size conditions

\(\displaystyle L > 1, \qquad \log L \geqslant 2 (b + 2) \log q \quad (q \in \{\alpha + 2, C_t, C_{2 t} \})\)

hold for all sufficiently large \(L\). For any such fixed \(L\), the iteration conditions hold for all sufficiently large \(s\) at height

\(\displaystyle H (L, s) = \left\lceil \frac{(b + 2) y (s)^2}{\log L} \right\rceil\)

(racetrack).

(e) Moment and fusion errors. Define \(R_Q (z) = e^{zA_Q}\) and the following polynomial error function. For \(B, \varepsilon, w \geqslant 0\) and \(D \in \mathbb{N}\), put

\(\displaystyle \begin{array}{rlll} q_0 & = w \pi (B, D), & d_0 & = wDB^D \varepsilon,\\ q_1 & = d_0 + \varepsilon w^2 \pi (B, 2 D) + \varepsilon + w \varepsilon \pi (B, D), & & \\ q_2 & = 2 q_0 d_0 + \varepsilon w^4 \pi (B, 4 D) + 2 \varepsilon + w^2 \varepsilon \pi (B, 2 D), & & \\ \mathcal{Q} (B, \varepsilon, w, D) & = q_1 + q_2 + (q_0 + q_1) q_1 + q_1 q_0 . & & \end{array}\)

For a parameter record in (d), set \(\tau (s) = 3 h (s)\). The remaining numerical conditions are

\(\displaystyle \begin{array}{rlll} 1 \leqslant \tau (s) & \leqslant \Pi - 1, & \pi (\tau (s), 2 t) & \leqslant \Pi,\\ K \pi (\tau (s), 1) & \leqslant \Pi, & K + \Pi^{- F} & \leqslant \Pi,\\ 4 R_Q (e + 2) \Pi^{- 6} & \leqslant \Pi^{- 4}, & & \\ 4 R_Q (e + 2) \mathcal{Q} (\Pi, \Pi^{- F}, \Pi^{2 c + 3}, 2 t) & \leqslant \Pi^{- g} . & & \end{array}\)

For every \(u \in [s / 2, s]\) they also require

\(\displaystyle \begin{array}{rlll} \tau (u) & \leqslant \tau (s), & & \\ G (u) + 2 \Pi^{- 2} R_Q (e + 3) & \leqslant \Pi^{- 1}, & & \\ (2 W (u) + 1)^4 \Pi^{- 1} & \leqslant 1, & e^{\Pi^{- 1}} - 1 & \leqslant 1. \end{array}\)

In the second line, \(G (u) = e^{ah (u)^2} G (u)^2\), as in the source definition. All these conditions hold for sufficiently large \(s\) whenever

\(\displaystyle g + 10 Z + 10 \leqslant F, \qquad Z = 2 c + 8 t + 13\)

(funding).

Status: theorems and numerical definitions. The constants entering the block-size inequalities in (d) are fixed before \(L\). The lower bound on \(s\) may depend on all the fixed parameters and on \(L\). Lean: Perch.Demand, Shelf, mint, Era, Tally, on_time, Glimmer.fuel, collected, shed, Tapes.Purse, Purse.budget, Racer, Racer.pos, Faring, torque, Digits, pulse_ok, Panel, rentQ, load, capZ, defect, grant₁, grant₂, grant, Paint.trib, Station.more, Station.bump.

2. What it uses

3. Strategy

Products of local activities are represented in a finite commutative algebra of square-zero markers. The allowed marker sets determine which products vanish. The exponential converts sums of nonconstant monomials into products, and a triangular correction constructs the unique connected polynomial whose exponential is a given polynomial with constant term \(1\). The weighted \(\ell^1\) norm controls these operations without a loss depending on the number of markers. Switching connects scalar functions of activity parameters to this algebra: for positive switch size \(x\), coefficients are recovered from values at \(0 / x\) configurations. A convergent model supplies their limit as \(x \downarrow 0\), while a uniform majorant controls that limit. The relation \(X_v^2 = xX_v\) then becomes the square-zero relation.

Connected-component decompositions reduce polymer sums to sums over packs attached to a support. A Kotecký–Preiss induction bounds the latter by \(e^{\text{cov}_M (Y)}\). Attaching \(X_i\) costs \(e^{\text{cov}_M (X_i)}\), paid by the extra unit in the hit exponent \(a + 1\). The geometric input is \(|Y| \leqslant (2 M + 1)^4 \text{cov}_M (Y)\). For two interactions, mentions always connect, while walls connect only hot labels. Hotness is unchanged on restriction to a component, so the component decomposition can be recovered uniquely. The forced-activity fusion uses ordinary patch components; its density identity and bounds are proved in III.10.

The Gaussian comparison in III.11 uses algebraic convolution on polynomials with complex symmetric covariances. Wick recursion gives coefficient-norm and moment bounds depending on the degree and entrywise bounds, independently of the number of variables. Gaussian integration by parts identifies this algebraic functional with an actual expectation when a measure is supplied. The numerical inequalities then absorb the errors and iteration losses. There are two iteration lengths: \(n (L, s) = O (y (s) / \log L)\) and \(H (L, s) = O (y (s)^2 / \log L)\) at fixed \(L\). The first gives losses \(\Pi (s)^{o (1)}\); the second requires the explicit lower bounds on \(L\) in II.2.13(d). The constants in those block-size inequalities are chosen before \(L\); all remaining constants must be fixed before the lower bound on \(s\) is chosen.

4. Steps

4.1 Marker algebra

Lemma 4.1 (associativity). \(\mathcal{A}_R\) is a commutative unital ring. Sketch:

  1. On basis elements, \((\delta_a \delta_b) \delta_c \neq 0\) iff \(a, b, c\) are pairwise disjoint and \(a \cup b \cup c \in R\).

  2. This condition is symmetric in \(a, b, c\). Downward closure ensures that both intermediate unions are allowed whenever the total union is allowed.

  3. Extend by bilinearity.

Lean: Console.lean.

Lemma 4.2 (norm). \(\|ab\|_w \leqslant \|a\|_w \|b\|_w\). Sketch: \(\|c \delta_x \cdot c' \delta_y \|_w \leqslant w^x |c| \hspace{0.17em} w^y |c' |\), with equality when the product is nonzero, because \(w^{x \cup y} = w^x w^y\) on disjoint unions. Expand \(a, b\) in the basis and use the triangle inequality. Lean: binary, multiplication.

Lemma 4.3 (nilpotency; norm of \(\text{Exp}\)). If \(a (\emptyset) = 0\), then \(a^k\) vanishes on sets with fewer than \(k\) elements. For arbitrary \(a\), \(\| \text{Exp} (a)\|_w \leqslant \sum_{k \leqslant |V|} \|a\|_w^k / k! \leqslant e^{\|a\|_w}\). Sketch: in \(a^{k + 1} = a^k \cdot a\), each factor \(a\) contributes a nonempty disjoint marker set (induction on \(k\)). The norm bound follows from Lemma 4.2. Summable families are handled by comparing with the sup norm (equivalent norms) for convergence, and by passing the triangle inequality to the limit for the bound. Lean: high, pass_budget, budgeted.

Lemma 4.4 (additivity of \(\text{Exp}\)). II.2.3(a)–(b). Sketch:

  1. Apply the binomial theorem to \((a + b)^n / n!\).

  2. Terms \(a^i b^j\) with \(i + j > |V|\) vanish by Lemma 4.3, so the truncation at \(|V|\) is consistent on both sides.

  3. For (b): \((c \delta_x)^2 = 0\) when \(x \neq \emptyset\), and induction over \(s\).

A second proof, via the exponential of commuting nilpotent elements in Mathlib, is in Trajectories.pass_add. Lean: Exponential.pass_add, Trajectories.pass_sum.

Lemma 4.5 (logarithm by iteration). II.2.3(c)–(d). Sketch: say \(u\) vanishes below order \(m\) if \(u (x) = 0\) for \(|x| < m\).

  1. Key estimate. If \(c (\emptyset) = 0\) and \(u\) vanishes below order \(m \geqslant 1\), then \(\text{Exp} (c + u) - \text{Exp} (c) - u = (\text{Exp} (c) - 1) \hspace{0.17em} u + \text{Exp} (c) \hspace{0.17em} (\text{Exp} (u) - 1 - u)\) vanishes below order \(m + 1\).

  2. Existence. With \(u = F - \text{Exp} (C_k)\), the key estimate gives that \(F - \text{Exp} (C_{k + 1})\) vanishes below order \(k + 2\). After \(|V|\) steps it vanishes identically.

  3. Uniqueness. For two solutions \(C, D\), additivity gives \(\text{Exp} (C - D) = 1\). If \(\text{Exp} (p) = 1\) and \(p (\emptyset) = 0\), then \(\text{Exp} (p)\) agrees with \(1 + p\) one order beyond the vanishing order of \(p\). So \(p\) vanishes to every order, i.e. \(p = 0\).

  4. (d) follows from \(\text{Exp} (- C) \hspace{0.17em} \text{Exp} (C) = 1\).

Lean: roll, rolls, roll_cont, Expands.uniq, correct.

Lemma 4.6 (majorant arrays; first-order coefficients).

\(\displaystyle (\prod_{i \in s} a_i) (\{v\}) = \sum_{i \in s} a_i (\{v\}) \prod_{j \in s \setminus \{i\}} a_j (\emptyset) .\)

Sketch: apply the triangle inequality to each disjoint-union coefficient sum. The weights factor on each surviving product. Splitting coefficients by marker-set size gives the decomposition. A singleton can receive a nonempty marker set from only one factor; powers of order at least two therefore make no singleton contribution to the exponential.

Lean: Nil.combine, merged_price, Accent.ballots, whisper, shockProd.

Lemma 4.7 (repacking). II.2.4(b). Sketch:

  1. Sum \(\text{val}\) fibrewise over the slot set \(S = \sigma (s)\).

  2. For admissible \(S\), the selected sets in the fibre are in bijection with sections \(S \ni k \mapsto i_k \in \sigma^{- 1} (k)\).

  3. The sum over sections of \(\prod_k F_{i_k}\) is the limit over finite truncations of \(\prod_{k \in S} \sum_{i \in \sigma^{- 1} (k)} F_i\).

  4. The majorant \(\prod_{i \in s} \|F_i \|_w\) is summable over finite sets \(s\) because \(\sum_i \|F_i \|_w < \infty\). II.2.2 then gives summability of the algebra-valued terms.

Lean: Packets.repack.

4.2 Components and the tree bound

Lemma 4.8 (components). II.2.5. Sketch: "chained in \(s\)" is the reflexive–transitive closure of "supports meet" restricted to \(s\). Its classes are the parts. A chain cannot leave a member of a family with disjoint supports, which gives item 2. For item 3, follow a chain from \(j\) to \(i\) and stop immediately before the first visit to \(i\). Lean: separates, excise.

Lemma 4.9 (root decomposition). For finite \(D \subseteq \iota\) and a support \(Y\), let \(\text{film} (D, Y) = \sum \prod_{i \in s} f_i\), the sum over packs \(s \subseteq D\) for \(Y\) (including \(s = \emptyset\)). For \(f \geqslant 0\),

\(\displaystyle \text{film} (D, Y) \leqslant \prod_{i \in D, X_i \cap Y \neq \emptyset} \left( 1 + f_i \hspace{0.17em} \text{film} (D \setminus \{i\}, X_i) \right) .\)

Sketch:

  1. Each part of a pack contains a label meeting \(Y\) (II.2.5, item 4). Fix one such label for each part, its root; distinct parts have distinct roots.

  2. Removing the root from its part leaves a pack for \(X_{\text{root}}\) inside \(D \setminus \{ \text{root} \}\) (II.2.5, item 3).

  3. The map \(s \mapsto\) (for each candidate root: nothing, or the remainder of the part it roots) is injective, and the weight factorizes.

  4. The right-hand side sums over all such assignments with nonnegative terms.

No sum over cuts or orderings occurs, and no label is repeated inside a part. Lean: Ac.pouch, film, lookup.

Lemma 4.10 (cover number of a spark). If \(s\) is a spark, then \(\text{cov}_M (X (s)) \leqslant \sum_{i \in s} \text{cov}_M (X_i)\). Sketch: enumerate \(s\) so that each new label meets the union of the previous ones (possible since \(s\) is connected), and use the intersecting-union bound from I.1 at each step. Subadditivity is not claimed for disjoint unions. Lean: Ac.cover.

Lemma 4.11 (Kotecký–Preiss induction). Under the hypotheses of II.2.6, put \(p_i = f_i e^{a \hspace{0.17em} \text{cov}_M (X_i)}\). Then for every finite \(D\) and every support \(Y\),

\(\displaystyle \text{film}_p (D, Y) \leqslant e^{\text{cov}_M (Y)} .\)

Sketch: strong induction on \(D\). By Lemma 4.9 and the induction hypothesis for \(D \setminus \{i\}\),

\(\displaystyle \text{film}_p (D, Y) \leqslant \prod_{i \in D, X_i \cap Y \neq \emptyset} (1 + f_i e^{(a + 1) \text{cov}_M (X_i)}) \leqslant \exp \left( \sum_{i \in D, X_i \cap Y \neq \emptyset} f_i e^{(a + 1) \text{cov}_M (X_i)} \right) \leqslant e^{|Y| \gamma} .\)

The last step sums the hit condition over the sites of \(Y\). Finally \(|Y| \gamma \leqslant (2 M + 1)^4 \gamma \hspace{0.17em} \text{cov}_M (Y) \leqslant \text{cov}_M (Y)\). Lean: demand, Tree.lean (step, all_pack).

Lemma 4.12 (tree bound). II.2.6. Sketch:

  1. Take a finite family of sparks whose supports contain \(x\), and let \(A\) be the union of their labels.

  2. Each such spark is a nonempty pack for \(\{x\}\) inside \(A\).

  3. By Lemma 4.10 and \(a \geqslant 0\), \(e^{a \hspace{0.17em} \text{cov}_M (X (s))} \prod_{i \in s} f_i \leqslant \prod_{i \in s} p_i\).

  4. The bound \(e^{|Y| \gamma}\) in the proof of Lemma 4.11 with \(Y = \{x\}\) (so \(|Y| = 1\)) gives \(\text{film}_p (A, \{x\}) \leqslant e^{\gamma}\).

  5. Subtract the empty pack. Uniform bounds on finite partial sums give summability.

Lean: Ac.forest.

4.3 Two kinds of overlap

Lemma 4.13 (hotness is local).

Sketch: a mention chain is a fuel chain, so it stays inside the slab. A wall link joins only hot labels. Moles are also invariant under label permutations compatible with bijections of mentions and walls that preserve dirtiness (Kilner.molecule). Lean: hot_comp, fuel_comp, takes_mole.

Lemma 4.14 (recovery). II.2.7, items 1–3. Sketch: let \(s = \bigcup S\).

  1. A mention chain in \(s\) cannot leave a member of \(S\), since mention-unions are disjoint. So hotness in \(s\) equals hotness in the member, and fuels agree.

  2. The fuel-unions of distinct members are disjoint: the mention components by hypothesis; the wall components because only members containing a dirty label have hot labels, and their wall-unions are disjoint.

  3. Apply II.2.5, item 2 to the fuel overlap.

  4. For slabs of a given set, use Lemma 4.13 to identify their internal fuels. Disjoint fuel-unions imply disjoint mention-unions; when both slabs contain a dirty label, all their labels are hot, so their wall-unions are disjoint as well.

Lean: Kiln.undo, clubs_away, walls_away.

Lemma 4.15 (moles are wall-sparks). II.2.7, item 4. Sketch: a fuel overlap is either a mention overlap, which implies a wall overlap by hypothesis, or a wall overlap between hot labels. Lean: Kiln.attends, Collide.spark_ac.

Lemma 4.16 (pellets). Pellets are countably infinite. Sketch: every singleton \(\{ \text{left } i\}\) is a pellet, and finite subsets of \(\mathbb{N} \sqcup \mathbb{N}\) form a countable set. Lean: Pipes.encoding.

4.4 Switching

Lemma 4.17 (triangular inversion). For \(x > 0\), \(\text{val}_x\) is injective. Sketch: strong induction on \(r\): \(\text{val}_x (g) (r) = x^{|r|} g (r) + \sum_{i \subsetneq r} x^{|i|} g (i)\) and \(x^{|r|} \neq 0\). This is Möbius inversion on the Boolean lattice, scaled by \(x^{|i|}\). Hence \(\text{val}_x\) is a linear bijection of a finite-dimensional space. Lean: entire, Digits.lean (vane, decodes).

Lemma 4.18 (jets; products).

Lean: Models.exact, Paid.mul; the model product value_comb, Models.mul.

Lemma 4.19 (absent markers; measurability). II.2.9(d). Sketch: \(\text{val}_x (g) (r) - \text{val}_x (g) (r \setminus \{v\}) = \sum_{v \in i \subseteq r} x^{|i|} g (i)\). If \(f\) does not see \(v\), this vanishes for all \(r\), so \(g_x (i) = 0\) for \(v \in i\) by induction, for every \(0 < x \leqslant 1\). Let \(x \downarrow 0\). Measurability: the jet is the pointwise limit of \(\text{val}_x^{- 1} (f_x)\), and \(\text{val}_x^{- 1}\) is a continuous linear map. Lean: jet_erase, Paid.jet_meas.

Lemma 4.20 (transfer bound). II.2.9(e). Sketch:

  1. The coefficient of \(\text{snd}_{\rho} (f^u)\) at \(z\) is bounded by \(\sum_i b (i) \hspace{0.17em} | (\prod_{v \in i} \rho_v) (z) |\), using \(|g_0 (i) | \leqslant b (i)\).

  2. The \(w\)-norm of this majorant array is at most \(\sum_i b (i) \hspace{0.17em} \| \prod_{v \in i} \rho_v \|_w \leqslant \sum_i b (i) \leqslant d\), by II.2.2.

Lean: Accent.crystal.

4.5 Gaussian calculus

Lemma 4.21 (construction of \(\mathcal{G}_Q\)). II.2.10(a)–(b). Sketch:

  1. \([X_v + \partial_{Q_v}, X_w + \partial_{Q_w}] = Q_{vw} - Q_{wv} = 0\) by symmetry, and derivations commute.

  2. The commutative subalgebra they generate receives an algebra map from \(\mathbb{C} [X]\); apply it to \(1\).

  3. The semigroup law and commutation with \(\partial_b\) follow by induction on polynomials from the recursion. Applying evaluation at \(m\) gives the moment functional and its Wick recursion. The terminating series \(e^{\Delta_Q / 2}\) satisfies the same polynomial recursion, giving the equivalent heat-operator formula.

Lean: cream_comm, make, feeds, warms, spring.

Lemma 4.22 (size of moments). II.2.10(e). Sketch:

  1. By linearity it suffices to treat monomials, each written as \(\prod_{j \in s} X_{z_j}\) with \(|s| \leqslant d\). The coefficient sum gives the factor \(\|p\|_1\).

  2. Let \(c_d\) bound the moments of degree \(\leqslant d\). The Wick recursion gives \(c_{d + 1} \leqslant B \hspace{0.17em} c_d + d \hspace{0.17em} B \hspace{0.17em} c_d\), and \(c_d \leqslant (2 B (d + 1))^d\) by induction.

  3. For differences, apply \(|xv - yw| \leqslant |x| |v - w| + |x - y| |w|\) to each term of the recursion.

  4. Localization: restrict \(Q\) and \(m\) to the variables of \(p\) by a change of variables.

Lean: Common.lean, width, differs, Guard.lean (pinned).

Lemma 4.23 (change of variables; factorization). II.2.10(c) and II.2.11(c), last clause. Sketch: both sides of II.2.10(c) satisfy the same recursion in \(X_v\). One uses \(\partial_m (p \circ A) = (\partial_{Am} p) \circ A\) and the fact that \(\mathcal{G}_Q\) applied to \((A \text{-linear form}) \cdot q\) obeys the Wick rule with covariance \(AQA^T\). If \(Q\) vanishes between the variables of \(P\) and \(R\), then \(\partial_{Q_{v \cdot}} \mathcal{G}_Q R = 0\) for every variable \(v\) of \(P\). The Leibniz rule then gives \(\mathcal{G}_Q (PR) = (\mathcal{G}_Q P) (\mathcal{G}_Q R)\); linear substitution preserves this identity. Related results:

Lean: prepared, wets.

Lemma 4.24 (identification with a true expectation). II.2.10(d). Sketch:

  1. Substituting \(X \mapsto X + m\) turns integration by parts into the recursion \(\mathbb{E} [(m + \xi)_v q (m + \xi)] = m_v \mathbb{E} [q (m + \xi)] +\mathbb{E} [(\partial_{Q_v} q) (m + \xi)]\).

  2. Both \(q \mapsto \mathbb{E} [q (m + \xi)]\) and \(\mathbb{E}_{Q, m}\) are linear, equal \(1\) on \(1\), and satisfy the Wick recursion on monomials.

  3. Induction on the degree.

Lean: payment.

Lemma 4.25 (step bounds). II.2.11(a)–(d). Sketch:

Lean: Rise.rise, LiftMark.puff, LiftMark.bounds, crux, LiftMark.message, LiftMark.stock.

Lemma 4.26 (guards; second moment). II.2.11(e). Sketch:

Lean: guards_mul, escaped, squareFits.

Lemma 4.27 (reading coefficients). II.2.11(f). Sketch:

  1. Evaluation at all points of the cube is injective on polynomials of degree \(\leqslant d\), since a polynomial vanishing on a product of infinite sets is zero.

  2. In finite dimension, a finite subfamily of evaluations is already injective: minimize the kernel dimension.

  3. Take a left inverse and bound its \(\ell^1\) operator norm.

The Lipschitz bound follows by telescoping over monomials. A version with explicit dimension dependence and constant \((|V| + 1)^d T_{d, \varepsilon}\) is proved in III.11 (ball_count). For polynomials of degree at most \(n\), an \(o (t^n)\) difference at \(0\) forces equality; for \(C^n\) functions it forces equality of their Taylor polynomials through order \(n\) (Spindle.decipher, trill). Lean: listen, molds, amove.

4.6 Numbers

Lemma 4.28 (loop bounds). II.2.12, items 1–2. Sketch:

  1. \((\log \log s)^2 = o (\log s)\), so \(b \hspace{0.17em} y^2 \leqslant p \log s\) eventually; this is item 1.

  2. Then \(s \theta^2 = \Pi^2\) exactly.

  3. \(s \theta^3 = \Pi^3 s^{- 1 / 2} \leqslant 1\) by item 1 with \(b = 3\), \(p = \tfrac{1}{2}\).

  4. Item 1 with \(b = 1\), \(p = 1 / 2\) gives \(\theta \leqslant 1\) eventually, hence \(s \theta^4 \leqslant s \theta^3\).

  5. \(s \cdot 2 \Pi^v \theta^2 \leqslant 2 \Pi^3 \leqslant 2 \sqrt{s} \leqslant s\) for \(s \geqslant 4\).

Lean: cost, uniform_loop.

Lemma 4.29 (comparison of scales). II.2.12, items 3–4. Sketch:

Lean: rate_wall, rate_inverse, rate_fire, fire_stretch.

Lemma 4.30 (feasibility of the shelf and tally conditions). II.2.13(a)–(b). Sketch:

  1. Use \(y (s)^2 \ll W (s / 2)\) for the two linear lower bounds on \(W (u)\). Since \(W (u) \leqslant W (s) = M (s)^2\), the support-size inequality follows once \(M (s)\) is large compared with \(Q\). Fixed powers of \(W\) are \(o (\Pi)\), giving the geometric condition.

  2. The purely exponential terms reduce to fixed constants times powers of \(\Pi\) with strictly smaller exponents than the target; for example, \(1 / 8 - 31 / 32 = - 27 / 32 < - 25 / 32\). For the sixth shelf inequality, uniformly in \(u \in [s / 2, s]\),

\(\displaystyle (mU + 4 \cdot 2^m + 2) y (s)^2 + 2 j (s) \leqslant ah (u)^2\)

eventually. Hence its first term is at most \(\Pi^{- 2}\). The reserve inequality follows from \(j (s / 2) \gg y (s)^2\) and \(e^{\Pi^{- 1}} - 1 \leqslant \exp (1)\). 3. The ceiling formula gives \(n (L, s) \log (\alpha + 1) = O (y (s)) \leqslant y (s)^2 / 4\) eventually. The same uniform tail estimate, with coefficients \(3 / 4\) and \(7 / 10\), gives \(G (u) \leqslant \Pi^{- 3 / 4} \omega (v)\). 4. Uniformity uses \(W (s / 2) \leqslant W (u) \leqslant W (s)\), \(h (u) \geqslant h (s / 2)\) and \(j (u) \leqslant j (s)\). Intersect the finitely many eventual conditions.

Lean: mint, force, on_time.

Lemma 4.31 (numerical parameter bounds). II.2.13(c)–(e). Sketch:

Lean: pulse_ok, Racer.pos, collected, shed.

5. Where the difficulty lies

The tree estimate must preserve the connected cover weight. Cover numbers are subadditive along intersecting unions, whereas a disconnected union may require an additional connecting region. The induction therefore uses connected components and spends exactly one extra cover exponent on each attachment. It counts finite sets of labels; it does not estimate Mayer coefficients with arbitrary repeated labels.

For two interactions, the graph itself depends on the selected set, through hotness. Unique recovery requires both locality of hotness and the asymmetric separation conditions: all components separate through mentions, while only components containing a dirty label separate through walls.

Switching requires convergence as well as a bound. Bounded coefficients alone need not have a limit as \(x \downarrow 0\). The model supplies convergence, and the common majorant allows sums and coefficient estimates to pass to the limit. The Gaussian bounds allow complex covariances without positivity; their constants grow like \(d^d\) up to exponential factors at fixed entry bounds. The degree is fixed before \(L\) and \(s\).

The numerical conditions establish feasibility for fixed parameters. They do not supply the analytic estimates to which those numbers are applied. The two iteration lengths in §3 must remain distinct.

The source contains duplicate exponential and component constructions. Its second trajectory logarithm and Candle.small are absent from the main theorem’s dependency set. The latter bounds a restarted threshold by \(3 h (\hat{\beta}) \beta^{- 1 / 2}\).

6. Notation

Written proof Lean Meaning
\(R\), census Marker.Census finite downward-closed family of allowed marker sets
\(\mathcal{A}_R\) Marker.Poly marker algebra
\(c \hspace{0.17em} \delta_x\) Poly.send monomial with marker set \(x\)
\(w^x\), \(\lVert a \rVert_w\) toll, price weight of a marker set; weighted \(\ell^1\) norm
\(\text{Exp}\) Poly.pass exponential truncated at order \(\lvert V \rvert\)
connected polynomial \(\text{Log} \hspace{0.17em} F\) Exponential.connected, Expands \(C\) with \(C (\emptyset) = 0\), \(\text{Exp} (C) = F\)
majorant array Nil.Sheet nonnegative coefficient bound
\(\text{cov}_M (X)\) coverNumber connected cover number (I.1)
spark, \(\text{Parts} (s)\) Ac.Spark, Ac.Parts connected label set; components
pack for \(Y\), \(\text{film} (D, Y)\) Ac.Pack, Ac.film label set attached to \(Y\); its weighted count
hit condition Ac.Hit site-wise summability of \(f \hspace{0.17em} e^{a \hspace{0.17em} \text{cov}}\)
kiln, hot, fuel, mole, slab Kiln, Hot, fuel, Mole, slabs two-interaction polymer data and components
pipes, tap, pellet, reach Ovens.Pipes, Tap, contains, reach data and pieces of the fused gas
\(\text{val}_x\), model, jet, paid Switch.value, Models, jet, Paid switching objects
\(\text{snd}_{\rho}\) Switch.sound jets inserted into the marker algebra
\(\lVert p \rVert_1\), \(\lVert p \rVert_{w, r}\) Rise.coin, Rise.cents coefficient norm; weighted coefficient seminorm
\(\mathcal{G}_Q\), \(\mathbb{E}_{Q, m}\) Normal.milk, Normal.blend Gaussian smoothing; algebraic expectation
\(\partial_b\) Normal.slit derivation \(X_v \mapsto b_v\)
\(p \circ A\) Normal.exchange linear substitution
\(T_{H, Q}\) Normal.pipe, Valve.read one Gaussian polynomial step
\(\pi (B, d)\) Common.priced \((2 B (d + 1))^d\)
\(\eta\)-guard Guarded \([0, 1]\)-valued cutoff of small defect
\(\Pi (s)\), \(\Pi (s)^a\) Numbers.P, Perch.bill \(e^{(\log \log s)^2}\) and its powers
\(\theta (s)\) Numbers.theta \(s^{- 1 / 2} \Pi (s)\), small-field threshold
\(h, j, \omega, W\) hot, join, w, walls \(e^{y^{3 / 2}}\), \(h^{1 / 5}\), \(e^{- 0.7 j}\), \(\lceil (\log s)^2 \rceil^2\)
parameter record \((t, g, H_0, b, c, f, F, K)\) Tapes.Purse taylor, goal, horizon, band, credit, f, foil, L
iteration conditions at height \(H\) Racer five inequalities in II.2.13(d)
moment and fusion conditions Faring inequalities in II.2.13(e)

7. What remains unexplained

  1. Restarted thresholds. The original threshold is \(s^{- 1 / 2} \Pi (s)\); the restarted Gaussian comparison uses \(s^{- 1 / 2} h (s)\) and cover size \(W (s)\) (Perch.Candle, III.11). Their ratio \(h (s) / \Pi (s)\) tends to zero. The numerical estimates here do not establish the existence of restarted representations satisfying the required density and trajectory identities. That construction must be explained in III.11.

  2. Analytic inputs to the numerical conditions. The shelf, tally and moment conditions are explicit in II.2.13. Their use still requires the one-step estimates with the stated supports, covariances and constants. The verification of those analytic hypotheses along the actual RG trajectories, including every later application of the digest and fusion bounds, is outside this unit.

  3. Auxiliary declarations. The additional regrouping results in EventBale and the cost estimates in MergeProof/West, North and East are not formulated above, apart from the cited permutation result. Their full role in III.11 remains to be traced.

← II.1 Field labels and their lattice representatives (notes)Part II·Unit outlineIII.1 The block-spin step and the symmetric gauge fixing (notes) →