Home·The theorem·The proof in one reading·Architecture·Units·Manuscript·Glossary·FAQ·Work items·Data·Method·Provenance·Changes
← III.4 Gaussian integration: change of Gaussian sector, determinants, window lawPart III·Detailed notesIII.6 The stationary branch: background field of the effective action →

III.5. Cluster expansion of the polymer gas

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 6

Lean source 6

Additional source locations 6

Key statements 12

Part III — Ultraviolet construction (renormalization group).

Controls sums of interacting polymer activities by a convergent cluster expansion.

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.4 · Next: III.6 →

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

Source inventory and conventions

Part: III, Ultraviolet construction (renormalization group). Lean: work packages YM/Push/ABSOLUTE_SUMS/ (3,624 lines), YM/AnalyticNext/CONNECTED_ACTIVITY_BOUNDS/ (3,589), YM/Push/SECTOR_MEASURE/ (1,153), YM/SectorNext/VACUUM_NORMALIZATION/ (935), YM/Progress/STATIONARY_SCENES/ (445). Size: 9,746 lines in 1,097 line-counted declarations in the source allocation.

1. What this unit proves

All propositions are theorems under the stated hypotheses. Infinite nonnegative bounds include summability.

Proposition III.5.1. For finite labels, reflexive symmetric incompatibility \(R\) and real \(w\), put \(\ell_m = \sum_{z \in \iota^{m + 1}} \phi_R^T (z) \prod_a w_{z_a} / (m + 1) !\). If \(| \ell_m | \leqslant Cq^m\) for every \(m \geqslant 0\), \(C \geqslant 0\), \(0 < q < 1\), then \(\Xi (w) = \exp (\sum_m \ell_m)\). Gas.exact_polynomial

Proposition III.5.2. On every finite graph with a distinguished vertex, the absolute alternating sum over connected spanning subgraphs is bounded by its number of spanning trees. Graph.pay

Proposition III.5.3. For arbitrary labels, supports \(X_i \subseteq \Lambda_n\), \(B \in \mathbb{N}\), \(w \geqslant 0\), \(a \geqslant 0\), \(R \subseteq\) overlap and \(\text{Ready} (w ; a, \gamma, \delta, q)\), every site \(x\) and \(m \geqslant 0\) satisfy

\(\displaystyle \sum_{k \geqslant m} \sum_{z \in \iota^{k + 1} : x \in X (z)} \frac{| \phi_R^T (z) | \prod_a w_{z_a}}{(k + 1) !} e^{a \text{cov}_B (X (z))} \leqslant \frac{\gamma q^m}{1 - q} .\)

The same bound holds for connected finite sets through \(x\) of at least \(m + 1\) labels, weighted by \(\prod_i w_i e^{a \text{cov}_B (X_i)}\). If \(Q \subseteq \iota\) has total inflated weight \(\sum_{i \in Q} w_i e^{(a + \delta) \text{cov}_B (X_i)} \leqslant b\), the order-\(m\) cluster sum marked by \(Q\), with individual covering weights, is \(\leqslant bq^m\). Ursell.log_hit_tail Ursell.cluster_at

Proposition III.5.4. For the same supports, real \(w\), reflexive symmetric \(R \subseteq\) overlap, \(a \geqslant 0\) and \(\text{Ready} (|w| ; a, \gamma, \delta, q)\), the gas converges absolutely with absolute sum \(\leqslant e^{n^4 \gamma}\); its cluster series converges absolutely to \(\log \Xi (w)\), with absolute sum \(\leqslant n^4 \gamma / (1 - q)\) and order-\(m\) bound \(n^4 \gamma q^m\). In particular \(\Xi (w) > 0\). Gas.price_log

Proposition III.5.5. Under III.5.4, with nonempty supports and overlap incompatibility, deleting all polymers meeting any \(Y \subseteq \Lambda_n\) gives \(\Xi (w^Y) = \Xi (w) e^{- p}\). \(p\) sums clusters meeting \(Y\); their absolute tail from order \(m\) is \(\leqslant |Y| \gamma q^m / (1 - q)\) for every \(m \geqslant 0\). Gas.restores_log

Proposition III.5.6. On one lattice, let unforced \((X_i, u_i)\) and forced \((Y_k, d_k)\) have nonempty supports, \(u, d \geqslant 0\), \(R \subseteq\) overlap. Assume \(A \geqslant 0\), \(\delta' > 0\), \(t \geqslant 1\), \(0 \leqslant \sigma < 1\), \(\mu \geqslant 0\), \(\eta > 0\), \(q' < 1\), \(\text{Ready} (u ; A + \delta', \gamma, \delta, q)\), \(\text{Hit}_B (d ; A + \delta', c)\), and

\(\displaystyle \frac{te^{\mu} c + t \gamma / (1 - q)}{1 - \sigma} \leqslant \eta \leqslant \sigma, \qquad 4 \text{ball}_B \eta / \delta' \leqslant q' .\)

Atoms are forced polymers and unforced cluster tuples with absolute cluster weights. For every site \(x\) and \(m \in \mathbb{N}\), connected atom multisets through \(x\), containing a forced atom and total multiplicity \(\geqslant m\), have total weight \(e^{A \text{cov}_B (\cup)} \prod_{\alpha} w_{\alpha}^{n_{\alpha}} / n_{\alpha} !\) at most \(t^{- m} e^{- \mu} \eta / (1 - q')\). OmitClusters.restore

Proposition III.5.7. For a step of block side \(L\), \(l, B \in \mathbb{N}\), connected packets with \(0 \leqslant p_A \leqslant Ce^{(s - g) |A|}\), \(a, C \geqslant 0\), and \(\rho = K_{\text{step}}^2 e^{s - g + a (2 l + 3)^4} \leqslant q < 1\) satisfy, for every coarse site \(x\) and \(m \in \mathbb{N}\),

\(\displaystyle \sum_{A : x \in D (A), \hspace{0.17em} |A| \geqslant m} p_A e^{a \text{cov}_B (D (A))} \leqslant K_{\text{hit}} Cq^{\max (1, m)} / (1 - q) .\)

This includes variants supported within domes whose total packet weight obeys the same envelope. Packets.packet_income Packets.packet_variants_tail

For \(\varepsilon, \delta, \gamma_{\text{root}} > 0\), \(a, C, e_s, \mu_s \geqslant 0\), assume the packet condition at \((a + 2 \varepsilon + \delta, s + 2 \varepsilon e_s + \mu_s)\) with ratio \(q_p < 1\), optional polymers \(w_i, \lambda_i \geqslant 0\) satisfying \(\text{Hit}_B (we^{2 \varepsilon \lambda} ; a + 2 \varepsilon + \delta, \gamma_{\text{opt}})\), and \(K_{\text{hit}} Cq_p / (1 - q_p) + \gamma_{\text{opt}} \leqslant \gamma_{\text{root}}\), \(4 \text{ball}_B \gamma_{\text{root}} / \delta \leqslant q < 1\). Connected mixed sets through \(x\), of size \(\geqslant m + 1\), seed count \(\geqslant r\) and charge \(\text{ch} \geqslant T\), satisfy

\(\displaystyle \sum_s \prod_{\alpha \in s} w_{\alpha} (1 + \text{ch} (s))^k e^{a \text{cov}_B (D (s))} \leqslant k! \varepsilon^{- k} e^{\varepsilon} e^{- \varepsilon T - \mu_s r} \gamma_{\text{root}} q^m / (1 - q)\)

for every \(m, k, r \in \mathbb{N}\), \(T \in \mathbb{R}\). Charge sums individual covering numbers and lengths; packet length is \(e_s |A|\). Disconnected packets have weight zero. Mixed.mixed_hit

Proposition III.5.8. Fix the group, \(L, l\), \(\mu, u > 0\), \(a, D \geqslant 0\), \(d \in \mathbb{N}\), \(z < 2\). Eventually in \(x\), whenever \(s \leqslant F\), \(g \geqslant M\), \(0 \leqslant C \leqslant e^F\), where \(F = D \text{bill}^d P (\beta_F)^z\), \(M = \mu uP (\beta_F)^2\), the packet ratio is \(\leqslant q = e^{- M / 2}\) and \(K_{\text{hit}} Cq^{\max (1, m)} / (1 - q) \leqslant e^{- M \max (1, m) / 4}\) for every \(m\). Every \(\beta \geqslant u \beta_F\) gives \(\beta \mu t^2 \geqslant M\). Delay.fits

For \(\varepsilon, \delta > 0\), \(\beta \geqslant u \beta_F\), \(C, e_s \geqslant 0\), \(C \leqslant e^F\), \(s + 2 \varepsilon e_s \leqslant F\), \(0 \leqslant \gamma_{\text{opt}} \leqslant \delta / (16 \text{ball}_B)\), the mixed numerical conditions eventually hold with \(g = \beta \mu t^2\), \(\mu_s = M / 2\), \(q = 1 / 2\), \(\gamma_{\text{root}} = e^{- M / 8} + \gamma_{\text{opt}}\). Actual weight bounds remain hypotheses. For every estimator, choose \(L\) sufficiently large, then \(W\) sufficiently large: some \(\mu > 0\), chosen before \(l, d, u, a, D, z\), gives the point charge for all sufficiently large \(x\) and funded steps of coarse side \(\geqslant 100 (1 + B)\), uniformly in volume. Buy.quoted Grant.order

Proposition III.5.9. Let \(J\) be finite, \(\emptyset \ne X_i \subseteq J\), \(v \geqslant 0\), \(w \geqslant 1\) submultiplicative on overlapping unions, \(a \geqslant 0\), \(0 \leqslant \delta \leqslant 1 - e^{- a}\), and \(\sum_{i : x \in X_i} w (X_i) v_i e^{a |X_i |} \leqslant \delta\) for every \(x\). For every real \(|u| \leqslant v\), the disjoint-support gas satisfies \(Z_u (B) > 0\), \(Z_u (B) = e^{- \sum_{A \subseteq B} \lambda_u (A)}\), \(| \lambda_u | \leqslant \lambda_{- v}\) and \(\sum_{A \ni x} w (A) \lambda_{- v} (A) \leqslant a\). Deleting any \(Q \subseteq J\) multiplies \(Z_u (J)\) by \(e^l\), \(|l| \leqslant a |Q|\). ReLog.catalog

For countably many local, gauge-invariant Borel \(E_i\) bounded by \(v_i\) on unflagged supports, mask flagged supports. If \(M \in \mathbb{N}\), \(A, a \geqslant 0\), \(v \geqslant 0\), \(a (2 M + 1)^4 \leqslant 1\), \(\delta \leqslant 1 - e^{- a}\) and \(\sum_{i : x \in X_i} e^{(A + 1) \text{cov}_M (X_i)} v_i \leqslant \delta\) at every site, the masked gas has these identities and a field-independent envelope \(| \lambda_P (V) | \leqslant g (P)\), \(\sum_{P \ni x} e^{A \text{cov}_M (P)} g (P) \leqslant a\). Raw coefficients are local, gauge-invariant Borel; masked coefficients vanish on flagged regions. ReLog.intake

Proposition III.5.10. For finite real matrices \(A > 0\), \(C = C^T\), \(S = AC - I\), and \(\sum_j |S_{ij} | \leqslant q < 1\), \(q \geqslant 0\), both \(\det C, \det (I + S) > 0\), and \(\log \det (I + S) = \sum_{k \geqslant 1} (- 1)^{k + 1} \text{tr} (S^k) / k\) absolutely. Round.exact_trace

Proposition III.5.11. Fix a funded step, tube, estimator, threshold \(t\), \(W, \kappa > 0\), adapted lawful representation, coupling \(\beta \geqslant 0\), tree-gauge forest and Borel nonnegative allocation summing to one. Require global cell chords \(\geqslant t / 4\) on listed seeds, \(\leqslant t / 2\) otherwise; wire chords \(\geqslant Wt\) on listed bonds, \(\leqslant 2 Wt\) otherwise; and equality of packet sites with coarse flags wherever allocated weight is nonzero. Assume the point charge \(\mathcal{E}_A \geqslant \kappa t^2 |A|\) on every local sector on every tree-gauge slice; local tests use \(D_{5 B} (A)\) and positive frame mass. Then, for every \(V\), \(\text{push}_{\beta} \rho_R (V) = \sum_A c_A (V)\) and \(|c_A (V) | \leqslant \pi_{\beta} e^{- \beta \kappa t^2 |A|} \ell_A (V)\), with bounded Borel sector outputs and remainders. The point charge comes from III.10 or the committed-scale hypothesis of III.1. Presented.portionCost

Proposition III.5.12. For finite symmetric \(M \geqslant rI > 0\) with lattice positions, weighted row and column sums \(\leqslant C\) at rate \(\eta \geqslant 0\), \(0 \leqslant \theta \leqslant 1\), \(\theta C \leqslant r / 2\), every \(u \geqslant 0\) satisfies

\(\displaystyle e^{\theta \eta d (a_i, a_j)} | (M + uI)^{- 1}_{ij} | \leqslant [\min (1, r / 2) (1 + u)]^{- 1} .\)

Hypotheses persist under principal restriction. Green.inverse

Proposition III.5.13. For finite real symmetric \(A \geqslant rI > 0\), fixed positive weighted row/column bounds at positive rate and counting bound \(\text{card} \{j : d (y, d_j) \leqslant \rho\} \leqslant U (1 + \rho)^4\), windows containing every index within distance \(R\) of their addressed index have, uniformly for large \(R\), inverse residual and inverse difference \(\leqslant Ke^{- cR} < 1\) for some \(K, c > 0\) at a positive rate. Full/windowed inverses are bounded by \(K\) throughout \(tA + (1 - t) I\), \(0 \leqslant t \leqslant 1\). At \(t = 1\), the symmetrized windowed inverse has positive uniform lower bounds, as does its inverse. Win.Promise.receive

Proposition III.5.14. Fix an estimator and patch satisfying branch conditions. For all large \(x\), every funded step with that patch, coarse side \(\geqslant 100 (1 + B)\), forest, packet and field with matching flags has completed precision \(G = D^T D + I_{\text{inactive}} \geqslant rI\), uniform counting constant \(U\), and weighted row/column bound \(K\) at half the upper path-decay rate, for some \(r, U, K > 0\). Endpoint windows of radius \(\lfloor B / 4 \rfloor\) satisfy III.5.13 with error \(K_{\text{win}} e^{- c_{\text{win}} \lfloor B / 4 \rfloor} < 1\). Aff.bedrock Aff.install_promises

2. What it uses

3. Strategy

Component decomposition identifies the finite-gas logarithm. Tree estimates give geometric cluster tails; absolute convergence extends the identity to arbitrary labels. Seed energy dominates packet entropy. Deletion gives another logarithm; exponential conjugation and the spectral gap control windowed inverses.

4. Steps

  1. For gas polynomial \(P\) and cluster series \(L\), splitting the distinguished component gives \(P' = L' P\), hence \(Pe^{- L} = 1\). Coef.recurrence

  2. Penrose intervals cancel free edges; parent factorials cost at most \(4^m m!\), absorbed by the reserve exponent. Graph.pay Trees.trees_afford

  3. Count packets by spanning walks and compare their entropy with \(P (\beta_F)^2\). Packets.stores_count Delay.fits

  4. Deletion induction bounds Möbius logarithm pieces by negative-envelope pieces. ReLog.swept

  5. Sum allocations, then extract the orientation-averaged point charge. Oriented.turn_charge

  6. Poincaré and background comparison give the spectral gap; conjugation gives decay, and window residuals occur beyond \(R\). Aff.surplus Windows.window_price

5. Where the difficulty lies

The bounds retain pins, covering weights and repeated labels. Global seed tests survive orientations. The sector remainder has no volume-uniform bound here.

6. Notation

\(\Lambda_n = (\mathbb{Z}/ n\mathbb{Z})^4\), \(n \geqslant 1\); \(d\) is maximum distance; \(\text{cov}_B\) is connected ball-cover number; \(\text{ball}_B = (2 B + 1)^4\). \(\text{Hit}_B (w ; a, \gamma)\) means every site sum of \(w_i e^{a \text{cov}_B (X_i)}\) is \(\leqslant \gamma\). \(\text{Ready}\) adds \(\gamma, \delta > 0\), \(4 \text{ball}_B \gamma / \delta \leqslant q < 1\), using exponent \(a + \delta\).

\(\Xi\) sums compatible finite sets; \(\phi^T\) is the connected spanning alternating sum on the occurrence graph (edges require mutual \(R\)); singleton coefficient \(1\); \(X (z) = \cup_a X_{z_a}\). Order \(m\) means \(m + 1\) occurrences. Seeds are fine cells, coarse bonds or sites; packets are finite seed sets; \(D_r (A)\) is the radius-\(r\) neighbourhood of seed locations (projected cell vertices, bond endpoints, or site). Skins are individual radius-\(lB\) neighbourhoods; \(D (A)\) is their union, connectedness their overlap connectivity. \(\tau_L = L^4 \text{card} \{ \text{plaquette orientations} \} + 5\), \(K_{\text{hit}} = (2 lB + 3)^4 \tau_L\), \(K_{\text{step}} = (4 lB + 5)^4 \tau_L\).

\(\beta_F = x + b \log L\), \(B = \lceil (\log x)^2 \rceil\), \(P (s) = e^{(\log \log s)^2}\), \(t = \beta_F^{- 1 / 2} P (\beta_F)\), \(\text{bill} = 1 + B + (\log \beta_F)^2\). \(\lambda_u\) denotes Möbius pieces of \(- \log Z_u\). \(\mathcal{E}_A\) assesses energy anchored in \(D_{2 B} (A)\) with truncated walks. \(\pi_{\beta}\) is the inverse product of single-bond normalizations; \(\ell_A\) is the remaining absolute sector integral. \(D\) is the transported flat row matrix, using truncated curl/path rows and linearized block constraints, replica transport and centred path gauges in every orientation. Keep row centres outside \(D_{8 B} (A)\) and nontrunk columns with projected endpoints outside \(D_{10 B} (A)\); normalize by the square root of the orientation count. Its range is \(\lfloor B / 100000 \rfloor + R_{\text{pred}} + 2\). Weighted sums at rate \(\eta\) use factors \(e^{\eta d (a_i, a_j)}\). A windowed inverse uses column \(j\) of the principal inverse on \(P (j)\), extended by zero.

7. What remains unexplained

Imported energy and Poincaré proofs, supporting counts and local Gaussian comparisons remain inputs. Raw logarithm coefficients are local; masked coefficients additionally inspect flags. The transported flat matrix is not identified with the nonlinear derivative.

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: I.1, III.1, III.10, II.2, III.16, III.6.

Referenced by: III.10, III.13, III.4, III.11, III.12, III.2, III.15, VII.1, III.14, III.9.

Lean source

Source allocation: 9,746 attributed lines; 1,097 line-counted declarations; 1,408 assigned declaration names. Of the assigned names, 1,340 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.4 Gaussian integration: change of Gaussian sector, determinants, window lawPart III·Detailed notesIII.6 The stationary branch: background field of the effective action →