Tensor Network Theory: A formalization blueprint

44 The two-dimensional area law from a global gap

This chapter follows the later sections of  [ 286 ] , September 24, 2026: the norm comparisons, the collar scan and its low-energy point, the safe-box and collar bounds, the amplification of collar information, and the deduction of the area law from two ordered families of separated regions. The positive quasi-local constraints of Section 4 are in Chapter 43.

44.1 Upper and lower norm comparisons from an auxiliary pair

The norm comparisons of [ 286 , Proposition 8.1 ] are stated for a finite product of finite-dimensional local spaces. One common label sequence serves every finite family of nested status partitions, every weight and every mean tree, and each remainder is uniform in the tree, its terminal probabilities and the symmetric vector.

Let \(\mathcal H_{\rm phys}\) be the tensor product of finite-dimensional local spaces over a finite set of sites. Let \(\widetilde H\ge 0\) have the unit ground vector \(\widetilde\Omega \) with ground energy \(\widetilde E_0\) and gap \(\widetilde g{\gt}0\), that is, \(\widetilde H\widetilde\Omega =\widetilde E_0\widetilde\Omega \) and \(\widetilde H-\widetilde E_0\ge \widetilde g(1-|\widetilde\Omega \rangle \langle \widetilde\Omega |)\). Fix a set of sites \(X\). A typical Schmidt set is a nonempty set \(E\) of indices of positive eigenvalues \(p_i\) of the reduced density of \(X\) such that, for some \(w\ge 0\), \(e^{-S_X-w}\le p_i\le e^{-S_X+w}\) for \(i\in E\) and \(z=\sum _{i\in E}p_i{\gt}0\). Put \(d_*=|E|\), \(p_i'=p_i/z\) and \(S'=-\sum _{i\in E}p_i'\log p_i'\).

Append systems \(C,R\) of dimension \(d_*\), put \(\mathrm{Bell}_{CR}=d_*^{-1/2}\sum _i|i\rangle _C|i\rangle _R\), \(\mathcal V=\mathcal H_{\rm phys}\otimes \mathcal H_C\otimes \mathcal H_R\) and \(\mathcal S_k=\operatorname {Sym}^k\mathcal V\). For a label \(\lambda \) of the symmetric group \(S_k\) let \(\pi ^\lambda _R\) and \(\pi ^\lambda _C\) be the label projections on the \(R\) and \(C\) copies, and put

\begin{align} \mathrm{pre}_k=\pi _R^{\lambda _k} (\widetilde\Omega \otimes \mathrm{Bell}_{CR})^{\otimes k}, \qquad \overline{\widetilde H}=\frac1k\sum _{i=1}^k\widetilde H^{(i)}.\notag \end{align}

A status family is a finite set of statuses \(j\), each consisting of \(K\) partitions of the sites into disjoint sets \(X,U_{j,g},Y_{j,g},V_{j,g}\), \(1\le g\le K\), such that \(XU_{j,g}Y_{j,g}\subseteq XU_{j',g'}\) for all statuses \(j,j'\) and all \(g{\lt}g'\). For a weight \(a{\gt}0\) put \(t=a/2\), \(s=1/4\) and \(W=aK\). With the common-dimension Schur metrics \(W_Q\) at parameter \(t\), put

\begin{align} A_{j,g}=(W_{CXU_{j,g}}^{-1}W_{RV_{j,g}}^{-1}W_{Y_{j,g}})^2, \qquad A_j=\prod _{g=1}^KA_{j,g},\notag \end{align}

and let \(\mathcal M\) be the root, on \(\mathcal S_k\), of a finite binary mean tree whose leaves carry statuses \(j\) with leaf operators \(A_j\) and terminal probabilities \(w_j\). Write \(\langle f\rangle _{\rm av}=K^{-1}\sum _g\sum _jw_jf_{j,g}\). For a vector \(\xi \in \mathcal S_k\) put \(N=\| \mathcal M^{-s}\xi \| \), \(v=\mathcal M^{-s}\xi /N\) and \(E_{\rm def}=(\langle v,\overline{\widetilde H}v\rangle -\widetilde E_0) /\widetilde g\). Put

\begin{align} g^{\rm pre}_{j,g} & =S(XU_{j,g})+S(V_{j,g})-S(Y_{j,g}),\notag \\ g^{\rm post}_{j,g} & =S(U_{j,g})+S(U_{j,g}Y_{j,g})-S(Y_{j,g}), \notag \end{align}

and let \(g_{\max }\) be the largest of \(0\) and the values \(g^{\rm pre}_{j,g}\) over the bands and the statuses at the leaves of the tree.

Prefix data consist of a finite nested collection \(\mathcal R\) of sets of sites disjoint from \(X\) and numbers \(B_{\rm sh},B_{\rm exc}\) with \(S(B)\le B_{\rm sh}\) for \(B\in \mathcal R\), such that each \(Q=U_{j,g}\) and \(Q=U_{j,g}Y_{j,g}\) has a member \(B\in \mathcal R\) containing it or contained in it with \(1+\log \dim \mathcal H_{B\triangle Q}\le B_{\rm exc}\). Moment data with constants \(C_0,c_0\) consist of \(\mathcal B\ge 1\) such that every \(Q\in \{ XU_{j,g},V_{j,g},Y_{j,g},U_{j,g},U_{j,g}Y_{j,g}\} \) obeys

\begin{align} \log \operatorname{Tr}\rho _Q^{1-u}\le uS(Q)+C_0\mathcal Bu^2, \qquad |u|\le c_0/\sqrt{\mathcal B},\notag \end{align}

with only positive eigenvalues of the marginal \(\rho _Q\) in the trace.

The statement of the norm comparisons asserts that there are an absolute constant \(a_0{\gt}0\) and a universal constant \(C{\gt}0\), and for all \(C_0,c_0{\gt}0\) constants \(c,C'{\gt}0\), with the following property. For every such Hamiltonian, set \(X\) and typical Schmidt set there is one sequence of labels \(\lambda _k\) such that, for every \(k{\gt}0\), \(\mathrm{pre}_k\) is nonzero, lies in \(\mathcal S_k\), has norm at most one, satisfies \(\overline{\widetilde H}\, \mathrm{pre}_k=\widetilde E_0\, \mathrm{pre}_k\) and is fixed by \(\pi _C^{\lambda _k}\) and \(\pi _R^{\lambda _k}\). For every partition of the sites into disjoint sets \(X,U,Y,V\),

\begin{align} 2S_X+g^{\rm pre}-g^{\rm post}=I(X:V)+I(X:YV). \label{eq:al_comparators_source_identity} \end{align}

For every status family, \(g^{\rm pre}_{j,g}\ge 0\), and for every \(0{\lt}a\le a_0\) the following hold, where each \(o_k(1)\) is one sequence tending to zero that does not depend on the tree, its terminal probabilities, the isometric coordinates of \(\mathcal S_k\) or the vector \(\xi \). For prefix data and all sufficiently large \(k\), with \(\xi =\mathrm{pre}_k\),

\begin{align} -\frac{\log N^2}{k}\le 2\log d_*-\log z +2sW\Bigl(\frac{2B_{\rm sh}}z+2B_{\rm exc}\Bigr)+o_k(1). \label{eq:al_comparators_source_rough_upper} \end{align}

For every \(k{\gt}0\), every \(\xi \in \mathcal S_k\) with \(0{\lt}\| \xi \| \le 1\) fixed by \(\pi _C^{\lambda _k}\) and \(\pi _R^{\lambda _k}\), and every \(0{\lt}\tau {\lt}1/2\),

\begin{align} -\frac{\log N^2}{k}\ge 2sW\Bigl[2S’ -C\Bigl(\tau \log d_*+\frac{h(\tau )}a\Bigr) -C\frac{E_{\rm def}}{\tau }S’\Bigr]-o_k(1), \label{eq:al_comparators_source_rough_lower} \end{align}

where \(h\) is the binary entropy. For moment data with \(a\le c/\sqrt{\mathcal B}\), for all sufficiently large \(k\) and \(\xi =\mathrm{pre}_k\),

\begin{align} -\frac{\log N^2}{k}\le 2\log d_*-\log z +2sW\Bigl[\langle g^{\rm post}\rangle _{\rm av} +C’\Bigl(a\mathcal B+\frac{|\log z|}a\Bigr)\Bigr]+o_k(1), \label{eq:al_comparators_source_sharp_upper} \end{align}

and, for every \(k{\gt}0\), every such \(\xi \) and every \(0{\lt}\tau {\lt}1/2\),

\begin{align} -\frac{\log N^2}{k}\ge 2sW\Bigl[2S’+(1-\tau ) \langle g^{\rm pre}\rangle _{\rm av} -C’\Bigl(\tau \log d_*+\frac{h(\tau )}a+a\mathcal B\Bigr) -C’\frac{E_{\rm def}}\tau (S’+g_{\max })\Bigr]-o_k(1). \label{eq:al_comparators_source_sharp_lower} \end{align}

In each comparison \(N{\gt}0\).

Theorem 44.1.2 Upper and lower norm comparisons
✓

In [ 286 , Proposition 8.1 ] , the statement of the norm comparisons holds with \(a_0=1/10\), \(C=4\), \(C'=4+25C_0\) and \(c=c_0/10\), where the label sequence is chosen before the status family and the weight, and the two lower comparisons hold for every vector of norm at most one in \(\mathcal S_k\) carrying the label \(\lambda _k\) on both auxiliary systems, in particular for \(\mathrm{pre}_k\).

Proof ▶

The normalized typical Schmidt vector chooses the labels, by the construction of the common auxiliary label in physical coordinates carried out for arbitrary local dimensions, and its auxiliary marginal has entropy \(S'\). The label dimensions therefore satisfy \(\log \dim \lambda _k=kS'+o(k)\), and the label mass is at least inverse polynomial in \(k\). Each \(A_{j,g}\) preserves \(\mathcal S_k\) and, after compression, the bands commute, so \(\mathcal M=\prod _g\mathcal M_g\) with \(\mathcal M_g\) the root of the same tree with leaves \(A_{j,g}\).

With these identifications the four comparisons are the regional comparisons of [ 286 , Section 8 ] at \(t=a/2\) and \(s=1/4\). The rough upper bound uses the prefix data, and the sharp upper bound uses the moment data on \(U_{j,g},U_{j,g}Y_{j,g},Y_{j,g}\) with \(6a\le c_0/\sqrt{\mathcal B}\). The two lower bounds use the gap of \(\widetilde H\) and the label bound \(2kS'-\epsilon _k\le 2\log \dim \lambda _k\) with \(\epsilon _k=2|\log \dim \lambda _k-kS'|=o(k)\); the sharp lower bound also uses the moment data on \(XU_{j,g},Y_{j,g},V_{j,g}\) with \(10a\le c_0/\sqrt{\mathcal B}\). For the sharp lower bound the tree is read on the statuses at its leaves, so that \(g_{\max }\) runs over them.

The explicit finite-\(k\) bounds have error terms of order \(\log k+a\epsilon _k\), so after division by \(k\) they tend to zero. The constants are absorbed as follows, using \(a\le 1\), \(S'\ge 0\), \(g_{\max }\ge 0\) and \(E_{\rm def}\ge 0\): \(2\tau \log d_*+(3+1/a)h(\tau )\le 4(\tau \log d_*+h(\tau )/a)\), \(25C_0\mathcal Ba\le C'a\mathcal B\), \((E_{\rm def}/\tau )(2S'+g_{\max })\le C'(E_{\rm def}/\tau )(S'+g_{\max })\), \(6KC_0\mathcal Ba^2\le 2sWC'a\mathcal B\) and \(-(K/2)\log z\le 2sWC'|\log z|/a\). The identity (1) follows from purity of \(\widetilde\Omega \), and \(g^{\rm pre}_{j,g}=I(XU_{j,g}:V_{j,g})\ge 0\) by subadditivity.

44.2 The scanner estimate with four norm comparisons

The scanner estimate of [ 286 , Proposition 9.2 ] selects one charge round and one interpolation parameter at which both the density and energy bounds and all four norm comparisons hold. The coefficients in the output shell and density bounds may be enlarged after the input entropy coefficient is fixed, as recorded in  [ 75 ] .

Fix exponents \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), \(0{\lt}e{\lt}1\) with \(\kappa \le e\), and \(\nu {\gt}0\); an interaction range \(R\), a term bound \(J\), a gap \(\Delta \) and a target-size coefficient \(C_T\). Put \(g=\Delta /\max \{ 1,J(\| f_{1,\Delta /2}\| _1+1)\} \). At scale \(n\), put

\begin{align} L & =\lfloor n^{1-\ell }\rfloor , & m & =\lfloor n^\mu \rfloor , & K & =\lfloor L/(8m)\rfloor ,\notag \\ D & =\lceil n^\kappa \rceil , & \epsilon & =n^{-\nu }, & a & =W/K.\notag \end{align}

The source hypotheses at scale \(n\) specify a local Hamiltonian on \(\Lambda \) with range \(R\), term bound \(J\), gap \(\Delta \), and unit ground vector \(\Omega \). Using the induced lattice graph, the scan measures depth by the ambient sup-norm distance to \(T\), and every designated support contains its anchor. The collar scan has \(n\) slots per depth row, the displayed scales, truncation radius \(r_0=\lceil C_{\rm tr}(\log n)^2\rceil \), and charge-list constant \(C_1\). Its finite target \(T\) satisfies \(|T|\le C_Tn^2\) and \(|T_j\setminus T_{j-1}|\le n\) for \(1\le j\le L\), while every endpoint of a boundary edge of \(A\) lies at ambient distance greater than \(2L+10r_0\) from \(T\). The target intersection \(X=A\cap T\) is nonempty, and for every integer \(0\le j\le L\) the shells \(Q_j=A\cap (T_j\setminus T)\) satisfy

\begin{align} S_\Omega (X) & \le C_en^{1+e},\notag \\ S_\Omega (Q_j) & \le C_e(nL^e+n).\notag \end{align}

The scanner statement asserts that there exists \(C_{\rm tr}{\gt}0\) such that, for every integer \(q\ge 2\) and every real \(C_e\), there exist constants \(C_1{\gt}0\), \(c_a{\gt}0\), \(C{\gt}0\), \(C_\delta {\gt}0\), \(C_b,C_{l,b},C_l,C_{l,\delta }\) and a size threshold with the following property. For every larger \(n\) and every finite physical system satisfying the source hypotheses, the truncated Hamiltonian admits a unit ground vector \(\widetilde\Omega \) of energy \(0\le e_t\le n^{-1000}\) and gap \(g/2\) whose trace distance \(D_{\rm tr}(\rho ,\sigma )=\frac12\| \rho -\sigma \| _1\) from \(\Omega \) obeys

\begin{align} D_{\rm tr}(\widetilde\Omega \widetilde\Omega ^*,\Omega \Omega ^*) & \le \sqrt{2\min \{ n^{-1000},g/4\} /g}. \label{eq:al_scanner_source_trace_distance} \end{align}

For this truncated ground vector \(\widetilde\Omega \), the target typical set \(E\) at width \(n^{3/5}\) is nonempty of cardinality \(d_*=|E|\), and its mass \(z\) satisfies \(0{\lt}1-n^{-100}\le z\le 1\). A single label sequence \(\lambda _k\) defines nonzero replica vectors \(\mathrm{pre}_k=\pi _R^{\lambda _k} (\widetilde\Omega \otimes \mathrm{Bell}_{CR})^{\otimes k}\) of Euclidean norm at most one for all \(k{\gt}0\), with both auxiliary dimensions equal to \(d_*\). All of these choices precede the total weight \(W\).

For every \(W\ge 1\) with \(ar_0^2\le c_a\), comparator parameters

\begin{align} B_{\rm sh} & \le C_b(nL^e+n),\notag \\ B_{\rm exc} & \le C_bnD,\notag \\ 1\le \mathcal B & \le C_bnD(\log n)^{C_{l,b}}\notag \end{align}

bound the labelled cut parameters of every completed and pre-charge status cut by \(\mathcal B\), while the marginal moment estimate for \(\widetilde\Omega \) at each physical region uses that region’s own labelled cut bound. For all sufficiently large replica counts \(k\), the final charge at interpolation parameter \(1\) satisfies

\begin{align} -\frac{\log N_{\rm end,k}^2}{k} & \le 2\log d_*-\log z +W(B_{\rm sh}/z+B_{\rm exc})+\rho _{\rm end,k},\notag \end{align}

where \(\rho _{\rm end,k}\to 0\).

Setting

\begin{align} \delta _n & =C_\delta \epsilon ^{-1} \left(n^{e-\mu }+a^{1/4}(\log n)^{C_{l,\delta }}\right),\notag \end{align}

there exists \(\rho _k\to 0\) such that, for every sufficiently large \(k\), one charge round and one parameter \(p_k\in [\epsilon /2,\epsilon ]\) satisfy

\begin{align} \frac{\mathcal Q_k(p_k)}{KnD} & \le \delta _n+\rho _k,\notag \\ E_{{\rm def},k} & \le Cn^\ell D^2W^2(\log n)^{C_l} \left(\delta _n^{1/8}+\epsilon +n^{-100}\right) +Cn^{-1000}+\rho _k, \label{eq:al_scanner_source_energy} \end{align}

where \(v_k\) is the normalized filtered vector at the selected charge and parameter, the filtered norm is positive, and \(E_{{\rm def},k}=(\langle v_k,\overline{\widetilde H}_k v_k\rangle -e_t)/(g/2)\ge 0\).

With the normalized Schmidt truncation \(\psi \), its auxiliary entropy \(S^\prime \), and the terminal-region functions and charge-tree weights of Theorem 44.8.7 for these same physical data, the selected point satisfies the rough upper comparison

\begin{align} -\frac{\log N_k^2}{k} & \le 2\log d_*-\log z +W(B_{\rm sh}/z+B_{\rm exc})+R_k^{\rm RU},\notag \end{align}

and the rough lower comparison (63) for every \(0{\lt}\tau \le 1/2\). When \(a\sqrt{\mathcal B}\le \min \{ c_0,1\} /10\) for \(C_0=512\mathrm e(2/g)\) and \(c_0=[32\sqrt{1+2/g}]^{-1}\), the same state, typical set, labels, charge, and interpolation parameter also satisfy both sharp comparisons (64), with norm remainders that tend to zero uniformly in the selected charge and parameter for fixed finite system and \(W\).

Throughout these bounds, the input coefficient \(C_e\) remains unchanged, whereas the output shell coefficient may exceed \(\max \{ C_e,1\} +1\) and the density coefficient \(C_\delta \) may be positive even when \(C_e=0\); see  [ 75 ] .

The scanner statement in Definition 44.2.1 holds for \(J\ge 0\), \(\Delta {\gt}0\) and \(C_T\ge 0\), establishing [ 286 , Proposition 9.2 ] with all four norm comparisons under the coefficient convention in  [ 75 ] .

Proof ▶

Choose the truncation coefficient from Theorem 44.8.6 before fixing \(q\). Because the anchor of a support of range \(R\) has multiplicity at most \(\mu _*=2^{1+2R(R+1)-1}\), we set \(C_1=3\mu _*+1\) and apply that theorem with entropy coefficient \(\max \{ C_e,1\} \). This produces a truncated ground vector \(\widetilde\Omega \), a typical set \(E\), and a label sequence \(\lambda _k\), together with a selected charge and parameter for each admissible \(W\) satisfying the density, energy, and rough upper bounds. For this same vector and typical set, we retain the trace-distance bound (08-scanner.tex, lines 400–403) and the typical-window mass bound \(0{\lt}1-n^{-100}\le z\le 1\) (08-scanner.tex, lines 411–414), while the augmented-to-global norm identity transfers \(\| \mathrm{pre}_k\| \le 1\) for all \(k{\gt}0\) (07-comparators.tex, lines 130–140).

Applying Theorem 44.8.7 to these same data yields a rough lower bound that is uniform over charge rounds and parameters. Combining the common cut coefficient \(C_{B,\rm cut}\) and norm coefficient \(C_{B,\rm norm}\), we set

\begin{align} C_b & =\max \{ C_{B,\rm cut},C_{B,\rm norm}, \max \{ C_e,1\} +1,1+3\log q\} ,\notag \\ \mathcal B & =C_bnD(\log n)^{12},\notag \end{align}

since enlarging the marginal parameter preserves both sharp comparisons and strengthens their smallness hypothesis.

Finally, entropy continuity on each whole-row positive-depth prefix yields \(B_{\rm sh}=\max \{ C_e,1\} (nL^e+n)+n^{-247}\), and we set \(B_{\rm exc}=1+3nD\log q\), both of which obey the stated bounds because \(n\ge 2\) and \(D\ge 1\). The uniform rough upper estimate at the final charge gives the terminal-round bound with its own vanishing remainder, and intersecting the eventual selected-point and sharp-comparison bounds at the point chosen by the energy theorem completes the proof after summing the nonnegative density and energy remainders.

44.3 The rough upper comparison for a given label sequence

Theorem 44.3.1 The physical upper comparison with a vanishing remainder
✓

Let \(V\) be a finite set of physical sites of local dimension \(q\), let \(\Omega \) be a unit vector, and fix \(X\subseteq V\). Select a spectral set \(E\) of the reduced density on \(X\) with mass \(z{\gt}0\), and put \(d=|E|\). Let \(\psi \) be its normalized selected Schmidt vector. Suppose that a label sequence \(\lambda _k\) satisfies

\begin{align} \| (I\otimes P_{\lambda _k})\psi ^{\otimes k}\| ^2 & \geq \frac{1}{2(k+1)^{d^2}} \end{align}

for every sufficiently large \(k\). Form the original physical prevector \(\xi _k\) from \(\Omega \) and these labels, as in Theorem 43.1.3.

Fix a finite index set \(J\), a finite nested list \(\mathcal R\) of physical regions disjoint from \(X\), and \(K\geq 8\). Following the label-sequence application of the rough upper comparison in [ 286 , Section 8, lines 130–169 and 332–381 ] , there is a constant \(c\geq 0\) for which the following holds eventually in \(k\), with \(c\) and the eventual threshold chosen before \(Z,U,Y,T,B_{\mathrm{sh}}\) and \(B_{\mathrm{exc}}\). Choose \(Z\) with \(Z^*Z=I\) and \(ZZ^*=P_{\mathrm{sym}}\), physical regions \(U_{jg},Y_{jg}\) for \(j\in J\) and \(0\leq g{\lt}K\), and an iterated weighted geometric mean \(T\). Assume

\begin{align} U_{jg}\cap Y_{jg} & =\varnothing , \\ X\cap (U_{jg}\cup Y_{jg}) & =\varnothing . \end{align}

For \(g{\lt}h\), also assume \(U_{jg}\cup Y_{jg}\subseteq U_{j'h}\). Suppose that \(S_\Omega (D)\leq B_{\mathrm{sh}}\) for every \(D\in \mathcal R\). For each \(Q=U_{jg}\) or \(Q=U_{jg}\cup Y_{jg}\), suppose that some \(D\in \mathcal R\) is nested with \(Q\) and satisfies

\begin{align} 1+\log \dim \mathcal H_{D\mathbin {\triangle } Q} & \leq B_{\mathrm{exc}}. \end{align}

At parameter \(t=2/K\), use the full physical and auxiliary dimension in the replica metric \(W\). With auxiliary sites \(C\) and \(R\), put

\begin{align} L_{jg} & =X\cup U_{jg}\cup \{ C\} , \\ F_{jg} & =(X\cup U_{jg}\cup Y_{jg})^c\cup \{ R\} , \\ A_{jg} & =(W_{L_{jg}}^{-1}W_{F_{jg}}^{-1}W_{Y_{jg}})^2, \\ M_k & =\prod _{g=0}^{K-1}T(Z^*A_{\cdot g}Z), \\ w_k & =M_k^{-1/4}Z^*\xi _k. \end{align}

Complements are taken in \(V\). Then \(\| w_k\| ^2{\gt}0\) and

\begin{align} -\frac{\log \| w_k\| ^2}{k} & \leq 2\log d-\log z +4\left(\frac{B_{\mathrm{sh}}}{z}+B_{\mathrm{exc}}\right) +R_{d,c,K}(k), \\ R_{d,c,K}(k) & =\frac{\log 4+(d^2+cK)\log (k+2)}{k}\longrightarrow 0. \end{align}
Proof ▶

Expressing the auxiliary mass in physical-site coordinates and applying the rough upper estimate for the original prevector with \(t=2/K\) and inverse-power exponent \(1/4\) gives the bound. Because the disjointness assumptions imply \(Y_{jg}\setminus X=Y_{jg}\), the ordered product equals \(M_k\) with coefficient \(8(1/4)(2/K)K=4\), while the remaining logarithmic terms in \(k\) vanish upon division by \(k\).

44.4 The sharp upper comparison

Fix finite sets \(\Lambda ,T\subseteq \mathbb Z^2\) with \(T\ne \varnothing \), a positive local dimension \(q\), and a unit vector \(\Omega _t\) on \(\Lambda \). Let the collar scanner have \(K\) ordered bands, initial near region \(A\subseteq \Lambda \), offset scale \(m{\gt}0\), and charge capacity \(M{\gt}0\). Its depth is the ambient distance \(d_T(x)=\min _{t\in T}\| x-t\| _\infty \), and its target is \(X=A\cap T\). Fix an integer \(L\) with \(8Km\leq L\) and use the horizon \(nm\). Fix a positive-mass spectral set \(E\) of the reduced density on \(X\), with \(d=|E|\) and mass \(z{\gt}0\). Let \(\lambda _k\) be one label sequence whose selected Schmidt vector satisfies the eventual mass bound \(\| (I\otimes P_{\lambda _k})\psi ^{\otimes k}\| ^2 \geq [2(k+1)^{d^2}]^{-1}\). Let \(a{\gt}0\), \(6a\leq r\), and \(6a\leq 1\). Suppose that, for every completed or pre-charge status through the scan horizon, each of its five physical marginals satisfies

\begin{align} \log \mathbb E\exp (u Z_Q) & \leq uS_{\Omega _t}(Q)+K_{\mathrm{mom}}u^2, & |u| & \leq r. \label{eq:al_actual_sharp_moments} \end{align}

Here \(Z_Q\) is the surprisal of the reduced density on \(Q\). All statuses retain their completed or pre-charge physical partitions. For each terminal \(j\) and band \(g\), put

\begin{align} G_{jg} & =S_{\Omega _t}(U_{jg})+S_{\Omega _t}(U_{jg}\cup Y_{jg}) -S_{\Omega _t}(Y_{jg}), \label{eq:al_actual_sharp_terminal_entropy} \end{align}

where \(U_{jg}\) is the positive-depth near region and \(Y_{jg}\) is the middle region. At every fill or charge interpolation, let \(T_p\) be its original weighted mean tree, indexed by these terminals, and let \(N_{k,p}\) be the squared filtered norm of the original prevector, with metric parameter \(a/2\). There is \(c\geq 0\) such that, eventually in \(k\), simultaneously at all scan times and all real interpolation parameters,

\begin{align} N_{k,p} & {\gt}0,\nonumber \\ -\frac{\log N_{k,p}}{k} & \leq 2\log d-\log z +\frac a2\sum _g\sum _jT_p(j)G_{jg} +6K K_{\mathrm{mom}}a^2-\frac K2\log z +R_{d,c,K}(k), \label{eq:al_actual_sharp_rate} \\ R_{d,c,K}(k) & \longrightarrow 0. \label{eq:al_actual_sharp_remainder} \end{align}

The constant and replica threshold are chosen before the scan time, interpolation parameter, and mean tree. The interpolation parameter is projected onto \([0,1]\), as in the collar scanner.

Proof ▶

Collecting every completed and pre-charge partition up to the horizon into a single finite family, the terminal maps preserve the physical partitions and the weights of both kinds of mean tree, while cross-status nesting gives the common band order. Applying the sharp upper comparison of [ 286 , Section 8, lines 383–418 ] to this family and the given labels, expressing the original prevector in symmetric coordinates, and specializing the inverse-power exponent to \(1/4\) yields the three coefficients \(2(1/4)a=a/2\), \(24(1/4)K K_{\mathrm{mom}}a^2=6K K_{\mathrm{mom}}a^2\), and \(2(1/4)K=K/2\).

In Theorem 44.4.1, suppose additionally that \(\Omega _t\) is an exact eigenvector of a given physical Hamiltonian with eigenvalue \(e\). One can choose a single label sequence whose original prevector has the exact mean-replica energy \(e\), full copy symmetry, and the prescribed label on both original auxiliary registers. Its selected mass satisfies the stated polynomial lower bound, and \(\log \dim \lambda _k-kS(\psi _C)=o(k)\). The same sequence and physical prevector satisfy (21) at every fill and charge root.

Proof ▶

Choosing the labels once from the selected Schmidt vector via Theorem 43.1.3 and applying Theorem 44.4.1 to that same sequence yields the result.

Fix \(q\geq 1\), an interaction range \(R\in \mathbb N\), a term norm bound \(J\geq 0\), a gap \(\Delta {\gt}0\), and a target-size coefficient \(C_T\geq 0\). There are positive truncation, target-bound and common-status-bound coefficients \(C_{\mathrm{tr}},C_{\mathrm{target}},C_B\), chosen before the exponent family and physical instance. Fix exponents \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), \(\nu {\gt}0\), and \(0{\lt}e{\lt}1\) with \(\kappa \leq e\), and a real \(\omega \) satisfying the explicit margin

\begin{align} \omega +\frac{1+\kappa }{2} & {\lt}1-\ell -\mu . \label{eq:al_source_target_sharp_margin} \end{align}

There is \(N\geq 2\), depending on this exponent family and margin, such that the following holds for \(n\geq N\). Let \(\Lambda \subseteq \mathbb Z^2\) be finite, let \(T\subseteq \mathbb Z^2\) be finite and nonempty, and let \(H=\sum _i h_i\) have interaction range \(R\) and term norm bound \(J\) on \(\Lambda \). Suppose \(\| \Omega \| =1\), \(H\Omega =E_0\Omega \), and \(H-E_0I\succeq \Delta (I-|\Omega \rangle \langle \Omega |)\). Use a collar scanner with the induced lattice graph, anchors in their labelled interaction supports, \(M{\gt}0\), depth \(d_T(x)=\min _{t\in T}\| x-t\| _\infty \), and target \(X=A\cap T\). The scales are

\begin{align} L & =\lfloor n^{1-\ell }\rfloor , & m & =\lfloor n^\mu \rfloor , & D & =\lceil n^\kappa \rceil , \\ K & =\lfloor L/(8m)\rfloor , & r_0 & =\lceil C_{\mathrm{tr}}(\log n)^2\rceil . \end{align}

Assume \(|T|\leq C_Tn^2\), each ambient dilation layer \(T_d\setminus T_{d-1}\) has at most \(n\) sites for \(1\leq d\leq L\), and every endpoint of a cut edge of \(A\) has ambient distance greater than \(2L+10r_0\) from every point of \(T\). One truncated unit ground vector \(\Omega _t\) satisfies the energy, phase, trace-distance, all-cut tail and target-window estimates of Theorem 43.3.77. In particular \(m,K\geq 1\). The same vector has the common status bound and moment constants

\begin{align} B & =C_B nD(\log n)^{12}, & 1 & \leq B,\nonumber \\ g & =\frac{\Delta }{c_+}, & C_0 & =512e\frac2g, & c_0 & =\frac{1}{32\sqrt{1+2/g}}. \label{eq:al_source_target_sharp_budget} \end{align}

For \(0{\lt}W\leq n^\omega \), put \(a=W/K\). Then \(6a\leq c_0/\sqrt B\) and \(6a\leq 1\). Every label sequence satisfying the selected mass condition for this same target spectral set satisfies (21), with \(K_{\mathrm{mom}}=C_0B\). The coefficients are uniform in the physical instance; the replica-copy threshold and remainder constant may depend on the fixed finite-domain instance and its label sequence. With (23) explicit, this gives the target-instance consequence rather than the complete comparison assertion of Proposition 9.6 in [ 286 ] .

Proof ▶

Choosing the truncated target vector and window once allows every completed and pre-charge status bound to be evaluated on that same vector. Because the strict power margin dominates the common factor \(\sqrt{nD}(\log n)^6\) through the growth of \(K/W\), applying the marginal moment estimate with the common bound and then Theorem 44.4.1 at \(K_{\mathrm{mom}}=C_0B\) establishes the rate without any independent truncated-vector choice.

44.4.1 Sharp lower bounds for the scanner roots

The sharp lower comparison evaluates the physical spectral gap in the normalized inverse-root vector of each fill or charge while preserving the history tree and its conditional choices. Its terminal partitions consist of the completed histories through a fixed horizon together with the pre-charge histories before that horizon; writing \(Q_{jg}\) and \(Y_{jg}\) for the near and middle regions of terminal \(j\) in band \(g\) gives the far region \((Q_{jg}\cup Y_{jg})^c\).

Fix a finite lattice domain \(\Lambda \), interaction range \(R\), term norm bound \(J\), positive physical and auxiliary dimensions \(q,d\), and \(a{\gt}0\). There are \(c,C_f\geq 0\), chosen before the scanner, finite horizon, physical states, moment parameters, copy number, labels and interpolation parameter, with the following property. Let the scanner be indexed by the ordered admissible interaction supports at range \(R\), with offset scale \(m{\gt}0\) and charge capacity \(M{\gt}0\). Let \(\widetilde H\) be the sum of the truncated energy terms, formed from a fixed reference state, and suppose that a unit vector \(\widetilde\Omega \) satisfies

\begin{align} \widetilde H-e_0 I \succeq \gamma \bigl(I-|\widetilde\Omega \rangle \langle \widetilde\Omega |\bigr), \qquad \gamma {\gt}0. \end{align}

For every terminal and band, assume the original marginal moment estimate

\begin{align} \log \mathbb E\exp (vZ_U) \leq vS(U)+K_{\rm mom}v^2 \qquad (|v|\leq r_{\rm mom}) \end{align}

for \(U=Q_{jg},Y_{jg},(Q_{jg}\cup Y_{jg})^c\), where \(K_{\rm mom}\geq 0\), \(10a\leq r_{\rm mom}\) and \(10a\leq 1\). Here \(Z_U\) is the surprisal under the spectral probability distribution, with zero weights contributing zero. Entropies and moments refer to the same original state \(\widetilde\Omega \). Fix \(k{\gt}0\) and a nonzero prevector of norm at most one, fixed by simultaneous copy symmetry and both auxiliary label projectors \(\ell _C,\ell _R\), and assume

\begin{align} 2kS’-\varepsilon \leq \log \dim \ell _C+\log \dim \ell _R. \end{align}

Define

\begin{align} g_{jg} & =S(Q_{jg})+S((Q_{jg}\cup Y_{jg})^c)-S(Y_{jg}), \\ g_{\max } & =\max \bigl(\{ 0\} \cup \{ g_{jg}\} _{j,g}\bigr), \\ r_k & =\log (k+1)+c\log (k+2)+a\varepsilon , & b_k & =\tfrac 12(k+2)^{-C_f}. \end{align}

At every fill or charge interpolation before the horizon, let \(N_k\) be its squared filtered norm, \(\mu _k\) its mean energy, and \(w_j\) its terminal weights under the inclusion into the common terminal family. Its filtered vector has norm one, \(N_k{\gt}0\), and \(\delta _k=(\mu _k-e_0)/\gamma \geq 0\). For every \(0{\lt}\tau \leq \tfrac 12\), put

\begin{align} L_g=2S’+(1-\tau )\sum _jw_jg_{jg} -2\tau \log d-(3+a^{-1})h(\tau )-25K_{\rm mom}a. \end{align}

Then

\begin{align} \frac12\sum _g\left[ ak\left(L_g-\frac{\delta _k}{\tau } \max \{ 0,2S’+g_{\max }\} \right) -2|r_k|-|\log b_k|-\log 2-\log (3/2) \right] \leq -\log N_k. \end{align}

The same prevector, labels, gap and moment data serve all these interpolations, including a scanner with zero bands.

Proof ▶

Because the physical terminal partitions have disjoint near and middle regions that nest across bands, the regional sharp lower norm theorem in original coordinates applies at metric parameter \(t=a/2\) and inverse exponent \(s=1/4\), where the conditions \(20t\leq r_{\rm mom},1\) become \(10a\leq r_{\rm mom},1\). Passing an isometric coordinate matrix \(Z\) for the simultaneous symmetric subspace through the augmented-site coordinate bijection, the root compression identity expresses the ordered product \(M_k\) of compressed band means, its inverse-quarter-power norm and its normalized filtered vector as

\begin{align} w_k & =M_k^{-1/4}Z^*\mathrm{pre}_k, & N_k & =\| w_k\| ^2, & v_k & =Z\frac{w_k}{\| w_k\| }. \end{align}

Consequently, the fill and charge energy identities equate the regional defect in \(v_k\) to \((\mu _k-e_0)/\gamma \) with \(\mu _k=\operatorname {Re}\langle v_k,\widetilde H_kv_k\rangle \), while embedding the history tree into the common terminal family preserves the weighted entropy sum \(\sum _jw_jg_{jg}\); substituting \(2t=a\) and \(2s=1/2\) then gives the finite-copy lower bound of [ 286 , Section 8, lower-pin and tree-log-lower estimates ] .

Definition 44.4.1.2 Lower label defect and replica remainder
✓

For a label sequence \(\ell _k\) and a real entropy parameter \(S'\), and for fixed \(a{\gt}0\) and \(c,C_f\in \mathbb R\), define \(\varepsilon _k\) (\(k\in \mathbb N\)) and \(R_k^-\) (\(k{\gt}0\)) by

\begin{align} \varepsilon _k & =2\bigl|\log \dim \ell _k-kS’\bigr|, \\ R_k^- & =\frac{ 2|\log (k+1)+c\log (k+2)+a\varepsilon _k| +|\log (\tfrac 12(k+2)^{-C_f})| +\log 2+\log (3/2)}{ak}. \end{align}
Theorem 44.4.1.3 Lower label-defect inequality
✓

For every label sequence \(\ell _k\) and every \(k\), \(\varepsilon _k\geq 0\) and

\begin{align} 2kS’-\varepsilon _k\leq 2\log \dim \ell _k. \end{align}
Proof ▶

Apply \(kS'-\log \dim \ell _k\leq |\log \dim \ell _k-kS'|\) and multiply by two.

Fix \(a{\gt}0\) and \(c,C_f\in \mathbb R\). If a label sequence \(\ell _k\) satisfies \(\log \dim \ell _k-kS'=o(k)\), then \(R_k^-\to 0\) as \(k\to \infty \) through positive integers; in the physical application, this asymptotic holds for the Schmidt–Bell label sequence.

Proof ▶

Because \(\log \dim \ell _k-kS'=o(k)\), we have \(\varepsilon _k/k\to 0\). Since \(\log (k+1)/k\) and \(\log (k+2)/k\) also tend to zero and \(\log (\tfrac 12(k+2)^{-C_f})=-C_f\log (k+2)-\log 2\), dividing the numerator of \(R_k^-\) by \(k\) and by the fixed \(a{\gt}0\) gives \(R_k^-\to 0\).

Under the scanner and gap conditions of Theorem 44.4.1.1, use the horizon \(nm\), fix \(K_{\rm mom}\geq 0\), \(a{\gt}0\), \(10a\leq r_{\rm mom}\) and \(10a\leq 1\), and take the augmented replica prevector of a label sequence \(\ell _k\) whose original-coordinate vectors are nonzero and have norm at most one for every \(k{\gt}0\), with \(\log \dim \ell _k-kS'=o(k)\) (as holds for the physical Schmidt–Bell prevector). Assume the marginal moment estimate of that theorem for all five regions of Definition 43.3.1.2 at every completed status through \(nm\) and every pre-charge status before \(nm\); these five bounds imply all the near, middle and far marginal bounds. Then there exist \(c,C_f\geq 0\), fixed before \(k\), scan time and interpolation parameter, such that \(R_k^-\to 0\) and every fill or charge obeys

\begin{align} \frac a2\sum _g\left[ L_g-\frac{\delta _k}{\tau }\max \{ 0,2S’+g_{\max }\} -R_k^- \right] \leq \frac{-\log N_k}{k} \qquad (0{\lt}\tau \leq \tfrac 12). \end{align}

Here \(N_k{\gt}0\), \(\delta _k\geq 0\), \(L_g\), the unit filtered vector and the terminal weights are those of the same interpolation in the previous theorem.

Proof ▶

Because the augmented coordinate bijection preserves nonvanishing and the Euclidean norm while the replica prevector is invariant under simultaneous copy permutations and carries the label \(\ell _k\) on both auxiliary factors (giving the two auxiliary singleton projections), Theorem 44.4.1.1 applies with \(\varepsilon _k=2|\log \dim \ell _k-kS'|\). Dividing its conclusion by \(k{\gt}0\) and factoring \(ak\) out of the per-band error term yields the displayed lower bound with remainder \(R_k^-\), and Theorem 44.4.1.4 gives \(R_k^-\to 0\) without requiring \(\delta _k\) to be small.

44.5 One target window for the two sharp moment conditions

The upper and lower comparisons require two fixed multiples of the same per-band weight to lie in the same physical marginal-moment interval. The larger multiple suffices for both. This assertion uses a positive exponent margin beyond the ordinary scanner inequalities; the threshold may depend on that margin, while the geometric constants do not.

Theorem 44.5.1 Common moments at the target scales
✓

Fix a local dimension \(q\geq 1\), an interaction radius \(R\in \mathbb N\), an interaction bound \(J\geq 0\), a gap \(\Delta {\gt}0\) and a coefficient \(C_T\geq 0\) for the target-size bound. There are positive constants \(C_{\rm tr},C_{\rm target},C_B\) with the following property. For fixed scanner exponents and a real weight exponent \(\omega \) satisfying

\begin{align} \omega +\frac{1+\kappa }{2} & {\lt}1-\ell -\mu , \label{eq:arealaw-target-sharp-moment-margin} \end{align}

there is an integer threshold \(N\geq 2\) before every physical instance. Let \(\Omega \) be an original unit ground state, of energy \(E_0\) and gap \(\Delta {\gt}0\), for the finite-domain local Hamiltonian. The scanner graph is the induced domain graph, its depth is the target’s ambient depth, and each anchor belongs to its original admissible support. Suppose \(n\geq N\), the target is nonempty with size at most \(C_Tn^2\), its ambient layers have size at most \(n\), and the target clearance is greater than \(2L+10r_0\). Retain the explicit scales

\begin{align} L & =\lfloor n^{1-\ell }\rfloor , & m & =\lfloor n^\mu \rfloor , & D & =\lceil n^\kappa \rceil ,\nonumber \\ K & =\left\lfloor \frac{L}{8m}\right\rfloor , & r_0 & =\lceil C_{\rm tr}(\log n)^2\rceil , & B & =C_BnD(\log n)^{12}. \label{eq:arealaw-target-sharp-moment-scales} \end{align}

Then \(K\geq 1\), \(m{\gt}0\), \(8Km\leq L\) and \(B\geq 1\).

Put \(g=\Delta /\nu \), where \(\nu \) is the positive physical normalization, and \(\varepsilon =\min \{ n^{-1000},g/4\} \). One unit truncated ground state \(\widetilde\Omega \) has energy \(e\) and gap \(g/2\), with

\begin{align} 0 & \leq e\leq \varepsilon , & \| \widetilde\Omega -e^{i\theta }\Omega \| & \leq 2\sqrt{\varepsilon /g}\quad \text{for some }\theta \in \mathbb R, \nonumber \\ \operatorname {dist}_{\rm tr} (|\widetilde\Omega \rangle \langle \widetilde\Omega |, |\Omega \rangle \langle \Omega |) & \leq \sqrt{2\varepsilon /g}. \label{eq:arealaw-target-sharp-truncation} \end{align}

This same state has a target typical set of width \(w=n^{3/5}\) and mass \(z\) satisfying

\begin{align} 0 & {\lt}1-n^{-100}\leq z\leq 1. \label{eq:arealaw-target-sharp-moment-mass} \end{align}

The target cut weight is at most \(C_{\rm target}n(\log n)^{12}\), and every eigenvalue in this set lies between \(\exp (-S(\widetilde\Omega _X)-w)\) and \(\exp (-S(\widetilde\Omega _X)+w)\). Put

\begin{align} C_0 & =512\exp (1)\frac2g, & c_0 & =\frac1{32\sqrt{1+2/g}}, & r_{\rm mom} & =\frac{c_0}{\sqrt B}, & K_{\rm mom} & =C_0B. \label{eq:arealaw-target-sharp-common-moments} \end{align}

For every completed or pre-charge history within the physical horizon and every one of its five marginal regions \(Q\), the same state satisfies

\begin{align} \log \operatorname {tr}(\widetilde\rho _Q^{\, 1-u}) & \leq uS(\widetilde\rho _Q)+K_{\rm mom}u^2 & & \text{for }|u|\leq r_{\rm mom}. \label{eq:arealaw-target-sharp-common-moment-bound} \end{align}

Finally, for every \(0{\lt}W\leq n^\omega \), with \(a=W/K\),

\begin{align} 0 & {\lt}a, & 10a & \leq r_{\rm mom}, & 10a & \leq 1, & 6a & \leq r_{\rm mom}, & 6a & \leq 1. \label{eq:arealaw-target-sharp-smallness} \end{align}

The physical state and target set are chosen before \(W\) and before any auxiliary label sequence.

Proof ▶

With the truncation and target-cut constants fixed by the quantitative target window and the common status-cut constant fixed thereafter, the rounded scale separation and the positive margin in (40) give a common threshold with

\begin{align} 10a\sqrt B & \leq \min \{ c_0,1\} . \label{eq:arealaw-target-sharp-product-smallness} \end{align}

Since \(B\geq 1\), division by \(\sqrt B\) gives both factor-ten bounds, and positivity of \(a\) gives the factor-six bounds. In the target-window construction, each of the five physical status cuts has geometric cut weight at most \(B\), so the marginal-moment estimate for this same truncated state applies on \(|u|\leq c_0/\sqrt B\) while leaving the target mass, eigenvalue window, and quantitative truncation estimates unchanged.

The conclusion provides common physical data for a single given label sequence in both sharp comparisons. It does not choose that sequence, select a charge point, estimate its defect, or perform the entropy telescope and final absorption. The stronger margin is recorded explicitly; at the source’s final parameter choice its positive value is \(499879/2000000\).

44.6 Endpoint norm loss and selected density

Write \(H=nm\) for the physical scan horizon, \(a{\gt}0\) for its per-band weight and \(W=aK\). Fix a unit truncated physical vector, a target spectral set of cardinality \(d\) and positive mass \(z\), and a Schmidt–Bell label sequence whose replica prevectors have norm at most one and satisfy the polynomial mass lower bound; all root and filtered norms below use this sequence.

Definition 44.6.1 The endpoint replica remainder
✓

Let \(R_k^{\rm Bell}(d,c,K)\) be the rough Bell-overlap remainder. Put

\begin{align} R_k^{\rm end}(d,c,K,C) & =R_k^{\rm Bell}(d,c,K)+C\frac{\log (k+2)}k. \label{eq:arealaw-rough-endpoint-remainder} \end{align}
Theorem 44.6.2 Vanishing endpoint remainder
✓

For fixed \(d,c,K,C\), the remainder in (48) tends to zero as \(k\to \infty \).

Proof ▶

Both \(R_k^{\rm Bell}(d,c,K)\) and \(\log (k+2)/k\) tend to zero as \(k\to \infty \).

Theorem 44.6.3 Initial-to-final physical endpoint loss
✓

Suppose the ambient target is nonempty, the scanner graph is the induced domain graph, its depth is the target’s ambient depth, \(n,m,M{\gt}0\), \(r_0\leq D\), \(D\geq 1\), \(4D\leq m\) and \(8Km\leq L\). Assume every ambient target layer up to \(L\) has size at most \(n\) and every whole-row positive-depth prefix of the truncated state has entropy at most \(B_{\rm sh}\). There are nonnegative constants \(c,C_i\), before the replica count, such that eventually the final squared filtered norm is positive and

\begin{align} \frac{\log N_k^{\rm initial}-\log N_k^{\rm final}}k & \leq B_{\rm rough}+R_k^{\rm end}(d,c,K,C_i),\nonumber \\ B_{\rm rough} & =2\log d-\log z+ W\left(\frac{B_{\rm sh}}z+1+3nD\log q\right). \label{eq:arealaw-physical-endpoint-loss} \end{align}

Here \(N_k^{\rm initial}\) and \(N_k^{\rm final}\) are the squared filtered norms at the fill endpoints \((0,0)\) and \((H,0)\).

Proof ▶

Because the coordinate isometry preserves the norm of the replica prevector, the initial log-norm floor bounds \(\log N_k^{\rm initial}\) by \(C_i\log (k+2)\). Since \(H{\gt}0\), the final fill root at \((H,0)\) coincides with the last charge root at \((H-1,1)\), which lies within the horizon of the rough upper estimate; combining that upper estimate with the initial log-norm bound gives the endpoint loss inequality.

Fix \(q\geq 1\), a positive normalized gap \(g\) and a volume coefficient \(C_{\rm vol}\). For all sufficiently large \(n\) (above a threshold depending only on \(q\), \(g\) and \(C_{\rm vol}\)), suppose the original and truncated vectors are unit, the compact collar has at most \(C_{\rm vol}n^2\) sites, and the trace distance between the two states is at most \(\sqrt{2\min \{ n^{-1000},g/4\} /g}\). If every original-state positive-depth prefix up to \(L\) has entropy at most \(C_e(nL^e+n)\), then the endpoint bound (49) holds with

\begin{align} B_{\rm sh} & =C_e(nL^e+n)+n^{-247}. \label{eq:arealaw-source-endpoint-shell} \end{align}

All geometric and same-sequence premises of the preceding theorem are retained.

Proof ▶

Entropy continuity bounds the entropy of the truncated state on every positive-depth prefix up to \(L\) by \(B_{\rm sh}\), and the preceding theorem applied to the same truncated state, target spectral set and label sequence then yields the endpoint loss bound.

Theorem 44.6.5 The accumulated selection numerator
✓

Let \(k{\gt}0\), \(A_k=\log N_k^{\rm initial}-\log N_k^{\rm final}\), and \(\beta _k\leq C_\beta \log (k+2)\). Assume the endpoint inequality (49). For any real rate \(T\),

\begin{align} \frac{A_k+2H(kT+\beta _k)}k & \leq B_{\rm rough}+2HT+ R_k^{\rm end}(d,c,K,C_i+2HC_\beta ). \label{eq:arealaw-rough-selection-numerator} \end{align}

In the scanner entropy bound, \(T=C_{\rm ent}aK\, a^{1/4}\ell ^{e_{\rm ent}}\).

Proof ▶

Divide the endpoint and logarithmic error bounds by \(k\) and expand.

Theorem 44.6.6 Density at the same selected point
✓

Let \(k,n,m,D,K\) be positive integers and \(a,C_1,b\) positive real numbers, set \(H=nm\) and \(\rho =ka/(2(C_1+1)nD)\). If a selected point satisfies \(Q\leq B/(\rho H b)\) and \(B/k\leq R\), then at that point

\begin{align} \frac{Q}{KnD} & \leq \frac{2(C_1+1)}{aKHb}R. \label{eq:arealaw-selected-density-normalization} \end{align}

Here \(b=p_1-p_0\) for the selected parameter interval.

Proof ▶

Dividing \(Q\leq B/(\rho H b)\) by \(KnD{\gt}0\) and substituting \(\rho =ka/(2(C_1+1)nD)\) gives \(Q/(KnD)\leq \frac{2(C_1+1)}{aKHb}(B/k)\), which combines with \(B/k\leq R\) (without any sign assumption on \(B\)) to yield the stated density bound.

Together, these estimates bound the normalized charge density \(Q/(KnD)\) in terms of the spectral mass \(z\), target dimension \(d\), prefix entropy bound \(B_{\rm sh}\) and replica remainder \(R_k^{\rm end}\).

44.7 Sharp subtraction at the selected charge

All terminal sums in this section retain the weights of the mapped charge mean tree. Fix its physical state, spectral set and common auxiliary label sequence. For the near and middle regions \(Q_{jg},Y_{jg}\) of a terminal partition, write \(U_{jg}\) for the positive-depth part of \(Q_{jg}\) and put

\begin{align} g^{\rm pre}_{jg} & =S(Q_{jg})+S((Q_{jg}\cup Y_{jg})^c)-S(Y_{jg}),\nonumber \\ g^{\rm post}_{jg} & =S(U_{jg})+S(U_{jg}\cup Y_{jg})-S(Y_{jg}),\nonumber \\ G_{\rm pre} & =\frac1K\sum _g\sum _jw_jg^{\rm pre}_{jg}, & G_{\rm post} & =\frac1K\sum _g\sum _jw_jg^{\rm post}_{jg}. \label{eq:arealaw-selected-terminal-averages} \end{align}

The maximum \(g_{\max }\) is over zero and every pre-gap in the full finite terminal family. Set \(M=\max \{ 0,2S'+g_{\max }\} \), where \(S'\) is the entropy of the selected auxiliary marginal.

Theorem 44.7.1 Quarter-power subtraction
✓

Let \(a,W,\tau {\gt}0\). Suppose the same scalar rate \(R\) satisfies

\begin{align} \frac W2\left[2S’+(1-\tau )G_{\rm pre}-2\tau D -(3+1/a)h(\tau )-25K_{\rm mom}a-\frac\delta \tau M\right]-r_- & \le R,\nonumber \\ R & \le 2D-Z+\frac W2G_{\rm post} +6WK_{\rm mom}a-\frac W{2a}Z+r_+. \label{eq:arealaw-sharp-scalar-premises} \end{align}

Then

\begin{align} 2S’+G_{\rm pre}-G_{\rm post} \le {} & \frac{2(2D-Z)}W+\tau G_{\rm pre}+2\tau D +(3+1/a)h(\tau )+37K_{\rm mom}a-\frac Za\nonumber \\ & +\frac\delta \tau M+\frac{2(r_++r_-)}W. \label{eq:arealaw-sharp-scalar-subtraction} \end{align}
Proof ▶

Subtracting the two rates and dividing by \(W/2{\gt}0\) turns the upper quadratic contribution into \(12K_{\rm mom}a\), giving \(25+12=37\).

Theorem 44.7.2 Uniform same-prevector charge comparison
✓

Fix a unit physical truncated ground vector with energy \(e\) and positive gap \(\gamma \), the original reference state defining its truncated terms, and a target set \(E\) of positive spectral mass \(z\). Let \(d=|E|{\gt}0\), \(K{\gt}0\), \(W=aK\) and \(a{\gt}0\). Suppose the collar scanner has the target depth, positive window and charge-slot counts, and \(8Km\le L\). Every completed and pre-charge status marginal of this same vector satisfies the common moment estimate with parameters \(K_{\rm mom}\ge 0,r\), and \(10a\le r,1\).

The given physical label sequence has nonzero initial vectors of norm at most one, the polynomial selected-state projection mass, and \(\log \dim \lambda _k-kS'=o(k)\). Then nonnegative constants for the upper and lower replica remainders can be chosen before all charge stages and parameters. Eventually in \(k\), at every charge stage and every real interpolation parameter, the filtered norm is positive, \(\delta =(\mu -e)/\gamma \ge 0\), and for every \(0{\lt}\tau \le 1/2\),

\begin{align} 2S’+G_{\rm pre}-G_{\rm post} \le {} & \frac{2(2\log d-\log z)}W+\tau G_{\rm pre}+2\tau \log d +(3+1/a)h(\tau )+37K_{\rm mom}a-\frac{\log z}a\nonumber \\ & +\frac\delta \tau M+\frac{2R_+(k)}W+R_-(k), \label{eq:arealaw-actual-sharp-comparison} \end{align}

where both \(R_+(k)\) and \(R_-(k)\) tend to zero at fixed physical data and weight. The same exact terminal tree appears on both sides.

Proof ▶

The factor-ten assumptions imply the upper factor-six assumptions, so the upper and lower theorems apply to the same prevector; summing over the \(K\) bands with \(W=aK\) and applying Theorem 44.7.1 with \(r_+=R_+(k)\) and \(r_-=WR_-(k)/2\) yields the comparison.

Theorem 44.7.3 Energy at the selected charge
✓

Under the selector’s physical graph, anchor, layer, multiplicity, clearance, separation and round-step smallness hypotheses, one common error sequence \(r_k\ge 0\), \(r_k\to 0\), works before all symmetric nonzero initial vectors and all intervals \([p_0,p_1]\) with \(0{\lt}p_0{\lt}p_1{\lt}1\). If the same initial vector is an eigenvector of the augmented truncated copy mean with energy \(e\), the selected point also satisfies

\begin{align} \delta _k=\frac{\mu _k-e}{g/2} & \le \frac{e+C_{\rm en}a^2\ell _{\dim }^{e_{\rm en}} \operatorname {error}_k+r_k}{g/2}, & g & =\frac\Delta {\operatorname {positiveNormalization}(1,\Delta /2,J)}. \label{eq:arealaw-selected-actual-energy} \end{align}

Its selected charge-defect bound is unchanged.

Proof ▶

Because the selected charge is the odd round \(2s+1\) in the finite-family round-step theorem, its energy clause gives \(\mu _k\le 2e+\)error; subtracting one copy of \(e\) and dividing by the positive gap \(g/2\) bounds \(\delta _k\).

Suppose the selector–energy conclusion, the accepted coefficient conclusion and the uniform sharp comparison hold for the same physical data. Define

\begin{align} \operatorname {cap}_k =CW^2n^{1/100000}D^2(\log n)^{C_\ell } \left[(1-p_k)\left(\frac{\mathcal Q_k}{KnD}\right)^{1/8} +(1-p_k)n^{-P}+p_k\right]. \label{eq:arealaw-selected-sharp-density-cap} \end{align}

Then the same selected point obeys \(\delta _k\le (e+\operatorname {cap}_k+r_k)/(g/2)\). This upper bound can replace \(\delta \) in (56).

Proof ▶

Since the energy error is nonnegative, replacing \(C_{\rm en}\) by \(|C_{\rm en}|\) only increases its contribution; applying the coefficient bound at the unchanged point and using \(M/\tau \ge 0\) completes the estimate.

The last theorem is a conditional composition. The following source consumer instantiates all three inputs from one physical configuration. The final-scale entropy and power estimates remain explicit obligations.

44.8 Charge selection with an arbitrary fixed weight

The construction below is an auxiliary step in the proof of [ 286 , Proposition 9.2 ] . It retains the physical state and label sequence while allowing any positive total weight and any fixed interpolation interval contained in \((0,1)\).

Theorem 44.8.1 Nonvanishing and the eigen-equation in augmented coordinates
✓

Let \(V\) be finite, let \(q,d,k\in \mathbb N\), let \(\Omega \) be a complex vector on the physical configurations, and let \(\lambda \) be a label of the symmetric group on \(k\) copies. Let \(v\) be the corresponding physical Schmidt–Bell prevector in the global coordinates, and let \(\mathrm{pre}=Uv\) be its expression in the augmented site coordinates, where \(U\) is the coordinate isometry. For a physical matrix \(H\), write \(H_{\rm glob}\) and \(H_{\rm aug}\) for its replica mean, with identities on the two auxiliary registers, in these two coordinate systems. If \(v\ne 0\) and \(H_{\rm glob}v=e v\) for a real \(e\), then

\begin{align} \mathrm{pre} & \ne 0,\notag \\ \mathrm{pre} & \in \mathcal H_{\rm sym},\notag \\ H_{\rm aug}\mathrm{pre} & =e\, \mathrm{pre}.\notag \end{align}

Here \(\mathcal H_{\rm sym}\) is the subspace invariant under simultaneous permutation of the copies. This coordinate statement is used in [ 286 , Section 8, lines 130–153 and 421–438 ] .

Proof ▶

The coordinate bijection preserves nonvanishing. The augmented prevector is fixed by the simultaneous symmetry projection, so it lies in its range. The coordinate identity \(H_{\rm aug}=UH_{\rm glob}U^{-1}\) gives \(H_{\rm aug}\mathrm{pre}=UH_{\rm glob}v=e\, \mathrm{pre}\).

Theorem 44.8.2 Selected density from the rough norm difference
✓

Let \(k,n,m,D,K\) be positive integers, let \(d\in \mathbb N\), and let \(a,C_1,w{\gt}0\). Put \(W=aK\) and \(\rho =ka/(2(C_1+1)nD)\). For real \(A,B,T,b,c,C_i,C_b,\mathcal Q\), suppose

\begin{align} \frac Ak & \leq B+R_k^{\rm end}(d,c,K,C_i),\notag \\ b & \leq C_b\log (k+2),\notag \\ \mathcal Q & \leq \frac{A+2nm(kT+b)}{\rho nmw}.\notag \end{align}

Then

\begin{align} \frac{\mathcal Q}{KnD} & \leq \frac{2(C_1+1)}{Wnmw} \left[B+2nmT+R_k^{\rm end}(d,c,K,C_i+2nmC_b)\right].\notag \end{align}

This is the scalar normalization of the selected charge in [ 286 , Section 9, lines 457–490 ] .

Proof ▶

The rough norm difference and logarithmic error bounds give \((A+2nm(kT+b))/k\leq B+2nmT+R_k^{\rm end}(d,c,K,C_i+2nmC_b)\). Normalize the selected inequality by \(KnD\), cancel the positive factors in \(\rho \), and use \(aK=W\).

Fix an interaction range \(R\in \mathbb N\), \(J\geq 0\), \(\Delta {\gt}0\) and \(C_T\geq 0\). There is \(C_{\rm tr}{\gt}0\) such that, for every integer \(q\geq 1\), every \(C_1{\gt}0\), every integer anchor-multiplicity bound \(m_*\geq 0\) with \(3m_*\leq C_1\), and every real exponent \(P\), there are \(C_{\rm target},c_t{\gt}0\) and real \(C_{\rm ent},e_{\rm ent}\) with the following property. For every scanner exponent tuple, there are \(C\geq 1\), \(C_l\geq 0\) and \(N\geq 2\) before all the physical data and entropy inputs below. Thus \(C_{\rm tr}\) is independent of \(q\), \(C_1\), \(m_*\) and \(P\). This is the stronger uniform choice of Theorem 43.3.78, derived from the uniform marginal-tail theorem. The printed truncation proposition permits dependence on \(q\); the scanner uses its radius without asserting dimension uniformity [ 286 , Proposition 4.5 and Section 9, lines 49–59 ] .

Let \(\Lambda ,T\subset \mathbb Z^2\) be finite, with \(T\ne \varnothing \), and let \(H\) be a range-\(R\) Hamiltonian of interaction bound \(J\), with unit ground vector \(\Omega \) and projector gap \(\Delta \). Use the induced lattice graph, anchors belonging to their interaction supports, and depth \(d(x)=\operatorname {dist}_\infty (x,T)\). For the scan on \(A\subseteq \Lambda \), assume \(n\geq N\) and the scales

\begin{align} r_0 & =\lceil C_{\rm tr}(\log n)^2\rceil ,\notag \\ L & =\lfloor n^{1-\ell }\rfloor ,\notag \\ m & =\lfloor n^\mu \rfloor ,\notag \\ D & =\lceil n^\kappa \rceil ,\notag \\ K & =\left\lfloor \frac{L}{8m}\right\rfloor .\notag \end{align}

The exponent conditions are \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), \(\nu {\gt}0\) and \(0{\lt}e_{\rm in}{\lt}1\) with \(\kappa \leq e_{\rm in}\). The charge constant is \(C_1\). Put \(M=\lceil C_1nD\rceil \). Suppose \(|T|\leq C_Tn^2\), every ambient dilation layer through depth \(L\) has at most \(n\) sites, and at most \(m_*\) interaction supports have any given anchor. Every point of \(T\) is at distance greater than \(2L+10r_0\) from every endpoint of a cut edge between \(A\) and its complement. Also suppose \(2r_0\leq D\), \(1\leq D\) and \(4D\leq m\). For arbitrary real \(C_e,\eta \), assume \(S_\Omega (\{ x\in A:0{\lt}d(x)\leq j\} )\leq C_e(nL^\eta +n)\) for every integer \(0\leq j\leq L\).

Put \(X=A\cap T\) and \(S_0=A\cap T_L\), where \(T_L\) is the ambient dilation of \(T\). Let \(g{\gt}0\) be the normalized amplified gap in Theorem 43.3.77, and set

\begin{align} \varepsilon _t & =\min \{ n^{-1000},g/4\} ,\notag \\ w & =n^{3/5},\notag \\ \delta _t & =n^{-100}.\notag \end{align}

Then \(m,M{\gt}0\), \(K\geq 8\), \(8Km\leq L\), \(|S_0|\leq (C_T+1)n^2\) and \(X\subseteq S_0\). There is a unit ground vector \(\widetilde\Omega \) of the truncated Hamiltonian \(\widetilde H\), with energy \(e_t\) and projector gap \(g/2\), such that

\begin{align} 0\leq e_t & \leq \varepsilon _t,\notag \\ \operatorname {dist}_{\rm tr} (|\widetilde\Omega \rangle \langle \widetilde\Omega |, |\Omega \rangle \langle \Omega |) & \leq \sqrt{2\varepsilon _t/g},\notag \\ \mathcal B_X & \leq C_{\rm target}n(\log n)^{12}.\notag \end{align}

Write \(p_i\) for the target-marginal eigenvalues and \(S_X=S_{\widetilde\Omega }(X)\). Their surprisal tail outside width \(w\) has mass at most \(\delta _t\). The typical set \(E=\{ i:p_i{\gt}0,\ |{-\log p_i}-S_X|\leq w\} \) has cardinality \(d{\gt}0\) and mass \(z\) with \(0{\lt}1-\delta _t\leq z\leq 1\); every \(i\in E\) obeys \(\exp (-S_X-w)\leq p_i\leq \exp (-S_X+w)\).

Let \(\psi \) be the normalized Schmidt vector restricted to \(E\), and let \(S'\) be its auxiliary entropy. One sequence \(\lambda _k\) and its physical Schmidt–Bell prevectors \(\mathrm{pre}_k\) satisfy \(\mathrm{pre}_k\ne 0\) and \(\| \mathrm{pre}_k\| \leq 1\) for all \(k{\gt}0\), and \(\log \dim \lambda _k-kS'=o(k)\). For all sufficiently large \(k\),

\begin{align} \| (I\otimes P_{\lambda _k})\psi ^{\otimes k}\| ^2 & \geq \frac1{2(k+1)^{d^2}}.\notag \end{align}

The state \(\widetilde\Omega \), the set \(E\), the compressed vector \(\psi \) and the sequences \((\lambda _k)\) and \((\mathrm{pre}_k)\) are fixed before \(W\). For any \(W{\gt}0\), put \(a=W/K\) and \(\ell _{\dim }=1+(2r_0+1)^2\log q\), and suppose \(a\ell _{\dim }\leq c_t\). Define

\begin{align} B_{\rm sh} & =C_e(nL^\eta +n)+n^{-247},\notag \\ B_{\rm rough} & =2\log d-\log z+ W\left(\frac{B_{\rm sh}}z+1+3nD\log q\right),\notag \\ T_{\rm ent} & =C_{\rm ent}aK\, a^{1/4}\ell _{\dim }^{e_{\rm ent}}. \label{eq:arealaw-charge-budgets} \end{align}

There are nonnegative \(C_b,c_U,c_R,C_i\), a sequence \(0\leq b_k\leq C_b\log (k+2)\), and \(r_k\geq 0\) tending to zero. Write

\begin{align} R_k^{\rm Bell}(d,c,K) & =\frac{\log 4+(d^2+cK)\log (k+2)}k,\notag \\ R_k^{\rm end} & =R_k^{\rm Bell}(d,c_R,K) +(C_i+2nmC_b)\frac{\log (k+2)}k.\notag \end{align}

The remainders \(R_k^{\rm Bell}\) and \(R_k^{\rm end}\) tend to zero. For every fixed \(0{\lt}p_0{\lt}p_1{\lt}1\) and all sufficiently large \(k\), there is a charge round \(s_k{\lt}nm\) and \(p_k\in [p_0,p_1]\) with the following properties. Let \(\mathcal Q_k\) be the entropy defect at this charge, and let \(\mathcal M_k\) be its root metric at \(p_k\). Define

\begin{align} N_k^2 & =\| \mathcal M_k^{-1/4}\mathrm{pre}_k\| ^2,\notag \\ v_k & =\mathcal M_k^{-1/4}\mathrm{pre}_k/N_k,\notag \\ \mu _k & =\operatorname {Re}\langle v_k, \overline{\widetilde H}_k v_k\rangle .\notag \end{align}

Here \(N_k\) is the positive square root of \(N_k^2\), whose positivity is part of the conclusion, and \(\overline{\widetilde H}_k\) is the mean truncated physical Hamiltonian on the replicas, extended by the identity on both auxiliary registers. Put

\begin{align} \operatorname {cap}_k & =CW^2n^\ell D^2(\log n)^{C_l} \left[(1-p_k)\left(\frac{\mathcal Q_k}{KnD}\right)^{1/8} +(1-p_k)n^{-P}+p_k\right].\notag \end{align}

At this single point,

\begin{align} \frac{\mathcal Q_k}{KnD} & \leq \frac{2(C_1+1)}{Wnm(p_1-p_0)} \left(B_{\rm rough}+2nmT_{\rm ent}+R_k^{\rm end}\right),\notag \\ \frac{\mu _k-e_t}{g/2} & \leq \frac{e_t+\operatorname {cap}_k+r_k}{g/2},\notag \\ N_k^2 & {\gt}0,\notag \\ -\frac{\log N_k^2}{k} & \leq B_{\rm rough}+R_k^{\rm Bell}(d,c_U,K). \label{eq:arealaw-charge-selection} \end{align}

The remainder sequences and their coefficients are chosen before the interpolation interval. They may depend on the fixed physical instance and weight; the selected round and parameter may depend on \(k\).

Proof ▶

Choose \(C_{\rm tr}\) from the truncation estimate before fixing \(q\). After \(q,C_1,m_*,P\) are fixed, choose the target-cut constant \(C_{\rm target}\) and the step-weight and entropy constants \(c_t,C_{\rm ent},e_{\rm ent}\), and then choose the energy coefficients \(C,C_l\) and size threshold \(N\) for the given scanner exponents. At scale \(n\geq N\), the target-window theorem gives \(\widetilde\Omega ,E,z\), the common-label theorem gives \(\lambda _k\) together with its projected-mass bound and dimension asymptotic, and entropy continuity transfers each original prefix bound to \(\widetilde\Omega \) up to the additive error \(n^{-247}\).

Applying the rough upper estimate and the initial-to-final norm estimate to this sequence and intersecting their eventual replica ranges with \(k{\gt}0\) controls the scan norms for the fixed physical instance, weight, and interval. Because the coordinate isometry preserves the nonzero symmetric prevector and its mean-energy eigen-equation, the charge-selection theorem produces one point \((s_k,p_k)\) satisfying both the entropy-defect and normalized energy bounds. Combining that entropy-defect bound with the accumulated logarithmic step-error bound in Theorem 44.8.2 gives the first inequality of (60), while the coefficient estimate bounds the step-error term in the normalized energy inequality by \(\operatorname {cap}_k\) and the rough upper estimate gives \(N_k^2{\gt}0\) and the final norm bound at \((s_k,p_k)\).

Theorem 44.8.4 Moment radii from marginal smallness
✓

Let \(B,a,c_0\in \mathbb R\). If \(B\geq 1\) and \(a\sqrt B\leq \min \{ c_0,1\} /10\), then \(10a\leq c_0/\sqrt B\) and \(10a\leq 1\). This is the elementary smallness implication used in [ 286 , Proposition 9.2, sharp-comparison clause ] .

Proof ▶

Since \(\sqrt B\geq 1\), it is positive. Multiplication of the smallness inequality by \(10\) gives \(10a\sqrt B\leq \min \{ c_0,1\} \). Division by \(\sqrt B\) yields the first bound and \(10a\leq 1/\sqrt B\leq 1\).

Fix \(R\in \mathbb N\), \(J\geq 0\), \(\Delta {\gt}0\) and \(C_T\geq 0\). There is \(C_{\rm tr}{\gt}0\) such that, for every integer \(q\geq 1\), every \(C_1{\gt}0\), every anchor-multiplicity bound \(m_*\in \mathbb N\) with \(3m_*\leq C_1\), and every real exponent \(P\), there are \(C_{\rm target}{\gt}0\) and \(0{\lt}c\leq 1/2\), chosen before the scanner exponents and entropy coefficient. The truncation constant is the one chosen independently of \(q\) in Theorem 44.8.3. For every admissible exponent tuple \((\ell ,\mu ,\kappa ,\nu ,e_{\rm in})\), there are \(C\geq 1\) and \(C_l\geq 0\). For every \(C_e\geq 0\), there are \(C_\delta {\gt}0\), \(C_{l,\delta }\geq 0\) and \(N\geq 2\), all chosen before the finite physical instance and \(W\).

Use the original gapped Hamiltonian, nonempty target, ambient distance function, anchor multiplicity, layer-cardinality bound, cut clearance, and rounded scales of Theorem 44.8.3. Suppose \(n\geq N\), and put \(X=A\cap T\). For every integer \(0\leq j\leq L\), assume

\begin{align} S_\Omega (X) & \leq C_en^{1+e_{\rm in}},\notag \\ S_\Omega (\{ x\in A:0{\lt}d(x)\leq j\} ) & \leq C_e(nL^{e_{\rm in}}+n).\notag \end{align}

Then \(2r_0\leq D\), \(1\leq D\), and \(4D\leq m\). There is one truncated vector \(\widetilde\Omega \), typical set \(E\), positive selected mass \(z\), and sequence of labels and physical Schmidt–Bell prevectors satisfying all the state, projected-mass and dimension conclusions of Theorem 44.8.3, before \(W\) is chosen.

For any \(W\geq 1\), set \(a=W/K\), \(\varepsilon =n^{-\nu }\), and assume \(ar_0^2\leq c\). With the same \(B_{\rm rough}\) and \(T_{\rm ent}\) as in (59), with \(\eta =e_{\rm in}\), one has

\begin{align} B_{\rm rough} & \leq (6C_e+13+6\log q)Wn^{1+e_{\rm in}},\notag \\ \delta _n & :=C_\delta \varepsilon ^{-1} \left(n^{e_{\rm in}-\mu }+a^{1/4}(\log n)^{C_{l,\delta }}\right). \label{eq:arealaw-source-density} \end{align}

There is a nonnegative sequence \(\rho _k\to 0\) such that, for all sufficiently large \(k\), the same selected charge \(s_k{\lt}nm\) and parameter \(p_k\in [\varepsilon /2,\varepsilon ]\) satisfy

\begin{align} \frac{\mathcal Q_k}{KnD} & \leq \delta _n+\rho _k.\notag \end{align}

At this same point all four conclusions of (60) hold, with \(p_0=\varepsilon /2\) and \(p_1=\varepsilon \). In particular, the energy cap retains its unexpanded density and truncation terms, and the filtered prevector has positive norm. Every remainder tends to zero with the finite instance and \(W\) fixed. The exponent conditions do not require \(\delta _n\to 0\). The case \(C_e=0\) is included. This is the density consequence used in [ 286 , Proposition 9.2, lines 475–490 ] .

Proof ▶

Retaining \(C_{\rm tr}\) from before \(q\), enlarge the size threshold so that the rounded scales are admissible, \(r_0\geq 1\), \(\log n\geq 1\), and truncation changes each relevant regional entropy by at most \(n^{-247}\). From \(ar_0^2\leq c\) we obtain the step-weight smallness condition \(a\ell _{\dim }\leq c_t\) needed for the common state and label sequence, and from \(\kappa \leq e_{\rm in}\) the ceiling estimate gives \(D\leq 2n^{e_{\rm in}}\). Together with the target entropy, selected-mass, and logarithmic dimension bounds, this inequality yields the stated upper bound on \(B_{\rm rough}\).

Next set \(G=C_{\rm ent}\ell _{\dim }^{e_{\rm ent}}\) and choose uniform constants \(C_t\geq 1\) and \(C_{l,\delta }\geq 0\) with \(G\leq C_t(\log n)^{C_{l,\delta }}\). With \(C_s\geq 1\) denoting the rounded-scale constant, define

\begin{align} C_\delta & =4(C_1+1)(6C_e+13+6\log q+2C_t)C_s,\notag \\ \gamma & =\frac{2(C_1+1)}{Wnm(\varepsilon /2)},\notag \\ \rho _k & =|\gamma R_k^{\rm end}|.\notag \end{align}

Since \(aK=W\), we have \(T_{\rm ent}=GW a^{1/4}\), so applying the scalar density estimate to \(B_{\rm rough}\) at the point selected by Theorem 44.8.3 bounds the principal part by \(\delta _n\) and the remainder by \(\gamma R_k^{\rm end}\leq \rho _k\). Because \(\gamma \) is fixed before \(k\to \infty \), \(R_k^{\rm end}\to 0\) implies \(\rho _k\to 0\), while the energy and norm bounds at the selected point remain unchanged.

Fix \(R\in \mathbb N\), \(J\geq 0\), \(\Delta {\gt}0\) and \(C_T\geq 0\). There is \(C_{\rm tr}{\gt}0\), chosen before the integer \(q\geq 1\), the charge constant \(C_1{\gt}0\) and the anchor-multiplicity bound \(m_*\). With this same truncation constant, under the hypotheses of Theorem 44.8.5 and with the error exponent fixed at \(P=100\), there are common coefficients \(C_\delta {\gt}0\) and \(C_{l,\delta }\geq 0\) for the density and energy bounds. They and the size threshold are chosen after the scanner exponents and \(C_e\geq 0\), but before the finite physical system and the total weight. The constants \(C\geq 1\) and \(C_l\geq 0\) in the original energy bound are retained separately.

The same truncated state \(\widetilde\Omega \), typical set, selected mass, label sequence and physical prevector sequence satisfy all conclusions of that theorem before \(W\) is chosen. For \(W\geq 1\), let \(a=W/K\) and assume \(ar_0^2\leq c\). Put \(\varepsilon =n^{-\nu }\) and

\begin{align} \delta _n & :=C_\delta \varepsilon ^{-1} \left(n^{e_{\rm in}-\mu }+a^{1/4}(\log n)^{C_{l,\delta }}\right).\notag \end{align}

If \(e\) is the truncated ground energy and \(g/2\) its guaranteed gap, then

\begin{align} \frac{e}{g/2} & \leq C_\delta n^{-1000}.\notag \end{align}

There are nonnegative sequences \(\rho _k,\rho _{E,k}\to 0\) such that, for every sufficiently large \(k\), one charge round and one common parameter \(p_k\in [\varepsilon /2,\varepsilon ]\) satisfy

\begin{align} \frac{\mathcal Q_k}{KnD} & \leq \delta _n+\rho _k,\notag \\ E_{{\rm def},k} & \leq C_\delta W^2n^\ell D^2(\log n)^{C_{l,\delta }} \left(\delta _n^{1/8}+\varepsilon +n^{-100}\right) +C_\delta n^{-1000}+\rho _{E,k}. \label{eq:arealaw-source-energy} \end{align}

Here the defect is the normalized mean energy minus \(e\), divided by \(g/2\). At the same point, the original density bound, original energy bound, positive filtered norm and rough upper norm estimate remain valid. Every replica remainder is uniform in the selected round and parameter with the finite instance and \(W\) fixed. The coefficient \(C_\delta \) may be positive when \(C_e=0\). This is the density-to-energy consequence used in [ 286 , Proposition 9.2, lines 368–381 and 492–533 ] .

Proof ▶

Retain the truncation constant from Theorem 44.8.5, chosen before fixing \(q\). Write \(C_{\delta ,0},C_{l,\delta ,0}\) for the density coefficients and \(g_*=g/2\). Choose

\begin{align} C_\delta & =\max \{ C_{\delta ,0},(C+1)/g_*\} ,\notag \\ C_{l,\delta } & =\max \{ C_{l,\delta ,0},C_l\} .\notag \end{align}

Increase the size threshold so that \(\log n\geq 1\). These enlargements preserve the density estimate. Since \(0\leq e\leq n^{-1000}\) and \(C_\delta \geq 1/g_*\), they also give the displayed ground-energy bound.

With the finite physical system and \(W\) fixed, put

\begin{align} A & =CW^2n^\ell D^2(\log n)^{C_l},\notag \\ \rho _{E,k} & =\frac{A|\rho _k|^{1/8}+r_k}{g_*},\notag \end{align}

where \(r_k\geq 0\) is the original additive energy remainder. Thus \(\rho _{E,k}\geq 0\) and \(\rho _{E,k}\to 0\). At the previously selected point, the scalar energy estimate gives

\begin{align} E_{{\rm def},k} & \leq \frac A{g_*} \left(\delta _n^{1/8}+\varepsilon +n^{-100}\right) +\frac e{g_*}+\rho _{E,k}.\notag \end{align}

Enlarge \(A/g_*\) using the common coefficient and logarithmic power, and apply the ground-energy bound to obtain (62). Neither the selected point nor any physical state or label is changed.

Fix \(q\geq 1\), an interaction range \(R\in \mathbb N\), and \(C_r{\gt}0\). There exists \(C_B{\gt}0\), depending only on these parameters, with the following property. Assume the geometric hypotheses of Theorem 43.3.1.3, with \(K,m,M{\gt}0\) and \(r_0=\lceil C_r(\log n)^2\rceil \). Put \(\mathcal B=C_BnD(\log n)^{12}\); then \(\mathcal B\geq 1\). Let \(H\) be a local Hamiltonian of range \(R\), let \(\Omega \) be a unit vector, and let \(\Delta {\gt}0\). For the associated truncated Hamiltonian, prescribe a ground vector \(\widetilde\Omega \) of energy \(e_t\) and projector gap \(g/2\), where \(g\) is the normalized gap used in the truncation. Set

\begin{align} C_0 & =512\mathrm e\, (2/g),\notag \\ c_0 & =\frac{1}{32\sqrt{1+2/g}}.\notag \end{align}

At \(X=A\cap T\), prescribe a spectral set \(E\) of cardinality \(d{\gt}0\) and mass \(z{\gt}0\). Let \(\psi \) be its normalized Schmidt truncation, with the retained factor relabelled by \(\mathbb C^d\), and let \(S'\) be the entropy of that factor. Prescribe labels \(\lambda _k\) and \(\mathrm{pre}_k=\pi _R^{\lambda _k} (\widetilde\Omega \otimes \mathrm{Bell}_{CR})^{\otimes k}\). Assume \(\mathrm{pre}_k\ne 0\) and \(\| \mathrm{pre}_k\| \leq 1\) for \(k{\gt}0\), the eventual projected-mass bound \(\| (I\otimes \pi _R^{\lambda _k})\psi ^{\otimes k}\| ^2 \geq [2(k+1)^{d^2}]^{-1}\), and \(\log \dim \lambda _k-kS'=o(k)\).

Fix \(W\geq 1\), put \(a=W/K\), and assume \(ar_0^2\leq 1/2\). At each charge round \(s{\lt}nm\) and real parameter \(p\), let \(\mathcal M_k\) be its root metric with band exponent \(a/2\), using \(p\) projected onto \([0,1]\). Write

\begin{align} N_k^2 & =\| \mathcal M_k^{-1/4}\mathrm{pre}_k\| ^2,\notag \\ v_k & =\mathcal M_k^{-1/4}\mathrm{pre}_k/N_k,\notag \\ D_k & =\frac{\operatorname {Re}\langle v_k, \overline{\widetilde H}_k v_k\rangle -e_t}{g/2}.\notag \end{align}

The mean physical Hamiltonian is extended by the identity on the auxiliary factors. There are \(c_R,C_{f,R}\geq 0\), fixed before \(k,s,p\), such that the remainder \(R_k^{(a)}\) in (141) tends to zero and, for every \(k{\gt}0\), one has \(N_k^2{\gt}0\), \(\| v_k\| =1\) and \(D_k\geq 0\). For every \(0{\lt}\tau \leq 1/2\),

\begin{align} \frac W4\left[4S’ -6\left(\tau \log d+\frac{h(\tau )}a\right) -3\frac{D_k}{\tau }\max \{ 0,2S’\} \right]-R_k^{(a)} & \leq -\frac{\log N_k^2}{k}. \label{eq:arealaw-supplied-rough-lower} \end{align}

Here \(h\) is binary entropy.

Suppose in addition that \(a\sqrt{\mathcal B}\leq \min \{ c_0,1\} /10\). For each terminal \(j\) of the fixed family, including terminals of weight zero, and each band \(b\), let \(Q_{jb}\) be its physical receiving region, \(Y_{jb}\) its middle region, and \(U_{jb}\) its positive-depth near region. Define

\begin{align} G^-_{jb} & =S_{\widetilde\Omega }(Q_{jb}) +S_{\widetilde\Omega }((Q_{jb}\cup Y_{jb})^c) -S_{\widetilde\Omega }(Y_{jb}),\notag \\ G^+_{jb} & =S_{\widetilde\Omega }(U_{jb}) +S_{\widetilde\Omega }(U_{jb}\cup Y_{jb}) -S_{\widetilde\Omega }(Y_{jb}),\notag \\ G_* & =\max \bigl(\{ 0\} \cup \{ G^-_{jb}:j,b\} \bigr).\notag \end{align}

Let \(w_j\) be the weights of the charge tree at \((s,p)\). There are \(c_U,c_L,C_{f,L}\geq 0\), fixed before \(k,s,p,\tau \), such that \(R_k^+=[\log 4+(d^2+c_UK)\log (k+2)]/k\to 0\) and the remainder \(R_k^-\) of Definition 44.4.1.2, with coefficients \(c_L,C_{f,L}\), tends to zero. For all sufficiently large \(k\), simultaneously for every \(s{\lt}nm\), every real \(p\) and every \(0{\lt}\tau \leq 1/2\), set

\begin{align} L_b & =2S’+(1-\tau )\sum _jw_jG^-_{jb} -2\tau \log d-(3+1/a)h(\tau )-25C_0\mathcal B a.\notag \end{align}

Then

\begin{align} -\frac{\log N_k^2}{k} & \leq 2\log d-\log z+\frac a2\sum _b\sum _jw_jG^+_{jb} +6KC_0\mathcal B a^2-\frac K2\log z+R_k^+,\notag \\ \frac a2\sum _b\left[L_b -\frac{D_k}{\tau }\max \{ 0,2S’+G_*\} -R_k^-\right] & \leq -\frac{\log N_k^2}{k}. \label{eq:arealaw-supplied-sharp-bounds} \end{align}

The prescribed state, spectral set, and labels are unchanged in all three estimates. This is the uniform comparison step used in [ 286 , Proposition 9.2, lines 386–395 ] .

Proof ▶

Choose \(C_B\) from the common moment estimate for the prescribed truncated ground vector. Because \(C_r{\gt}0\) and \(n\geq 2\) imply \(r_0\geq 1\), the condition \(ar_0^2\leq 1/2\) forces \(0{\lt}a\leq 1/2\), so the rough lower comparison applies to the prescribed label sequence while the coordinate isometries preserve both the prevector and its physical energy.

Under the additional smallness condition \(a\sqrt{\mathcal B}\leq \min \{ c_0,1\} /10\), Theorem 44.8.4 gives \(10a\leq c_0/\sqrt{\mathcal B}\) and \(10a\leq 1\). With these radii, the common moment estimate yields both sharp comparisons with quadratic coefficient \(C_0\mathcal B\); applying them to the same spectral set and labels and intersecting their eventual replica ranges gives constants and remainders independent of the charge round and interpolation parameter.

44.9 The area law from the two-family decomposition

Theorem 44.9.1 Uniform area law from the two-family decomposition
✓

Suppose that for every integer \(R\ge 0\) there are real constants \(D_0{\gt}2R+10\) and \(C_{\rm tpl}\ge 24\) for which the two-family decomposition of Definition 39.8.44 holds. Then, for every pair of integers \(q\ge 1\), \(R\ge 0\) and every \(J,\Delta {\gt}0\), there is a constant \(C\ge 0\) with the following property. For every finite induced domain \(\Lambda \), every admissible Hamiltonian of range \(R\) and interaction bound \(J\) with a unit ground vector \(\Omega \) and global spectral gap at least \(\Delta \), and every \(A\subseteq \Lambda \),

\begin{align} S_\Omega (A) & \le C|\partial _\Lambda A|.\notag \end{align}

The constant is independent of the domain, Hamiltonian, ground vector, and cut. This is the reduction in the proof of [ 286 , Theorem 1.1, Section 11 ] , with the geometric decomposition as its hypothesis; Theorem 39.8.47 supplies that hypothesis.

Proof ▶

Fix \(q,R,J,\Delta \) and choose \(D_0,C_{\rm tpl}\) from the hypothesis for this range \(R\). Theorem 39.9.9 proves the collar bound at this same pair, since \(D_0{\gt}2R+10\) and \(C_{\rm tpl}\ge 24\). Theorem 42.10.14 then applies to this collar bound and the assumed two-family decomposition, and gives the asserted constant.

44.10 The constant produced by the proof of the area law

The proof of Theorem 1.1 of [ 286 ] produces the constant of the area law from the constants of Propositions 9.6, 10.2 and 11.2. This section records that constant.

Definition 44.10.1 The constant in the two-dimensional area-law proof
✓

For an integer \(q\ge 1\) and real numbers \(C_2,C_3\) put \(c_D=\max \{ C_3,0\} \), \(c_M=\max \{ C_2,0\} \) and

\begin{align} C(q,C_2,C_3) & =c_D\log q+\frac{c_Mc_D}{2}. \end{align}

For integers \(N_1,N_2\) and a real number \(C_2\), let \(N_3\) be the collar radius threshold at the coefficient \(C_2\) and the factor \(1\), and put \(n_*(N_1,N_2,C_2)=\max \{ N_1,N_2,N_3\} \).

Fix \(q\ge 1\), \(R\ge 0\), \(J\), \(\Delta {\gt}0\) and template constants \(D_0,C_{\rm tpl}\). Suppose that the assertions of the sublinear collar bound hold with the constant \(C_1\) for all \(n\ge N_1\); that the assertions of the amplification bound for the input constant \(\max \{ C_1,1\} \) and the order \(M=100\) hold with the constant \(C_2\) for all \(n\ge \max \{ 2,N_2\} \); and that \(C_3\) is a constant of the two-family decomposition at the lower scale \(n_*(N_1,N_2,C_2)\). Then \(C(q,C_2,C_3)\ge 0\), \(n_*(N_1,N_2,C_2)\ge 2\), and for every finite induced domain \(\Lambda \), every admissible Hamiltonian with a gapped ground vector \(\Omega \) and every \(A\subseteq \Lambda \),

\begin{align} S_\Omega (A) & \le C(q,C_2,C_3)\, |\partial _\Lambda A|. \end{align}
Proof ▶

If \(|\partial _\Lambda A|=0\), the entropy vanishes by Theorem 42.12.5. Otherwise apply the two-family decomposition with constant \(C_3\) at the lower scale \(n_*\). The collar radius threshold \(N_3\ge 2\) gives \(L_n+2r{\lt}n^\beta \) for every \(n\ge N_3\) and every \(r\le C_2n^{(1-\varepsilon )/\alpha }\). Each piece \(X_i\) has scale \(n_i\ge n_*\ge \max \{ 2,N_1,N_2,N_3\} \), so the collar bound gives the hypotheses of amplification for \(T_i\) with input constant \(\max \{ C_1,1\} \). Since \(L_{n_i}{\lt}n_i^\beta \), the cut clearance \(\operatorname {dist}_\infty (T_i,Z){\gt}2n_i^\beta \) gives \(N_{2r_i}^\Lambda (S_i)\subseteq A\). A walk of length at most \(2r_i\) from \(S_i\) moves at most \(2r_i\) in sup-norm, so every point of \(N_{2r_i}^\Lambda (S_i)\) lies within \(L_{n_i}+2r_i{\lt}n_i^\beta \) of \(T_i\) and hence outside every earlier piece of the same family. Thus \(J_i=(\Lambda \setminus A)\cup \bigcup _{j{\lt}i,\, f_j=f_i}X_j\) avoids \(N_{2r_i}^\Lambda (S_i)\), and amplification applied to \(X_i\subseteq A\cap T_i\) gives \(I_\Omega (X_i:J_i)\le c_Mn_i^{-100}\). The boundary estimate from partition bounds, with \(|D|\le c_Db\) and \(\sum _ic_Mn_i^{-100}\le c_Mc_Db\), gives the constant \(c_D\log q+c_Mc_D/2\).

The constants of Theorem 44.10.2 depend, through the sublinear collar bound, on truncation and transport constants of the scanner. The next two entries pin these constants: the truncation constants are explicit functions of \(R,J,\Delta \), and the only remaining input is one tuple of transport constants satisfying the finite-family transport bound of Definition 43.3.1.14. That condition involves only the five constants, independent of \(q,R,J,\Delta \) and of every domain, Hamiltonian, state and cut; Theorem 43.3.1.15 specializes it to the rounds of one scanner.

Definition 44.10.3 The constant of the area law from transport constants
✓

Fix \(q\ge 1\), \(R\ge 0\), \(J\) and \(\Delta \), and real numbers \(c_0,C_{\rm ent},e_{\rm ent},C_{\rm en},e_{\rm en}\). Let \(C_{\rm box}\) be the safe-box constant of the bootstrap of Theorem 44.24.13 started from the explicit initial box estimate, with the truncation constant at the factor \(2\) and these transport constants. Let \(C_1\) and \(N_1\) be the constant and the threshold of the sublinear collar bound at \(C_{\rm box}\), the truncation constant at the factor \(10\) and these transport constants. Put \(C_0=\max \{ C_1,1\} \), let \(C_2\) and \(N_2'\) be the constant and the threshold of the amplification bound at \(C_0\) and the order \(M=100\) for the filter-locality constants of the positive constraints, and let \(N_2=\max \{ N_2',N_3\} \) with \(N_3\) the collar radius threshold at \(C_2\) and the factor \(1\). With \(n_*=n_*(N_1,N_2,C_2)\) and \(C_3=C_{\rm expl}(2R+11,24,n_*,1/112)\), put

\begin{align} C_{\rm AL}(q,R,J,\Delta ;c_0,C_{\rm ent},e_{\rm ent},C_{\rm en},e_{\rm en}) & =C(q,C_2,C_3). \end{align}

Fix \(q\ge 1\), \(R\ge 0\), \(J\ge 0\) and \(\Delta {\gt}0\). Assume that the constants \(c_0,C_{\rm ent},e_{\rm ent},C_{\rm en},e_{\rm en}\), with \(c_0{\gt}0\), satisfy the finite-family transport bound of Definition 43.3.1.14. Then the constant \(C=C_{\rm AL}(q,R,J,\Delta ;c_0,C_{\rm ent},e_{\rm ent},C_{\rm en},e_{\rm en})\) of Definition 44.10.3 is nonnegative, and for every finite induced domain \(\Lambda \), every admissible Hamiltonian with a gapped ground vector \(\Omega \) and every \(A\subseteq \Lambda \),

\begin{align} S_\Omega (A) & \le C\, |\partial _\Lambda A|. \end{align}
Proof ▶

The transport constants and the explicit initial box estimate give the safe-box bound with the constant \(C_{\rm box}\) at safety parameter \(2R+11\), and then the sublinear collar bound with the constant \(C_1\) from the threshold \(N_1\) on, at \(D_0=2R+11{\gt}2R+10\) and \(C_{\rm tpl}=24\). The filter-locality constants of the positive constraints give the amplification bound at the input constant \(C_0\) and the order \(100\) with the constant \(C_2\) from the threshold \(N_2\) on. Since \(1/112\) is a birth-separation constant, \(C_3\) is a constant of the two-family decomposition at \(n_*\). Theorem 44.10.2 then gives the bound.

Theorem 44.10.5 The transport bound at explicit constants
✓

The finite-family transport bound of Definition 43.3.1.14 holds for

\begin{align} c_0 & =\tfrac 18, \\ C_{\rm ent} & =200000, \\ e_{\rm ent} & =2, \\ C_{\rm en} & =3\bigl(18\pi ^2+6144\, e^{\pi ^2+1}\bigr), \\ e_{\rm en} & =4. \end{align}
Proof ▶

The finite-family transport estimate of [ 286 , Proposition 7.4 ] holds with the threshold \(\tfrac 18\), the entropy constant \(200000\) and exponent \(2\), and the energy constant \(3\bigl(18\pi ^2+6144\, e^{\pi ^2+1}\bigr)\) and exponent \(4\). Its conclusion is the finite-family transport bound at these constants.

Definition 44.10.6 The explicit constant of the area law
✓

For \(q\ge 1\), \(R\ge 0\), \(J\) and \(\Delta \), put

\begin{align} C_{\rm AL}(q,R,J,\Delta ) & =C_{\rm AL}\bigl(q,R,J,\Delta ;\tfrac 18,200000,2, 3\bigl(18\pi ^2+6144\, e^{\pi ^2+1}\bigr),4\bigr), \end{align}

the constant of Definition 44.10.3 at the transport constants of Theorem 44.10.5.

Fix \(q\ge 1\), \(R\ge 0\), \(J\ge 0\) and \(\Delta {\gt}0\). Then \(C=C_{\rm AL}(q,R,J,\Delta )\) is nonnegative, and for every finite induced domain \(\Lambda \), every admissible Hamiltonian with a gapped ground vector \(\Omega \) and every \(A\subseteq \Lambda \),

\begin{align} S_\Omega (A) & \le C\, |\partial _\Lambda A|. \end{align}
Proof ▶

Apply Theorem 44.10.4 with the transport constants of Theorem 44.10.5, for which \(c_0=\tfrac 18{\gt}0\).

The safe-box constant \(C_{\rm box}\) of Definition 44.10.3 is the value of a finite recursion with one step per bootstrap round. The next entries bound that recursion by an expression without iteration, and restate the area law at every upper bound for \(C_{\rm box}\).

Let \(V\ge 0\) and \(C_0\ge 0\), let \(G\) be a real function with \(G(C)\ge 0\) for \(C\ge 0\), let \(N\) take natural values, and put

\begin{align} C_{j+1} & =G(C_j)+V\, N(C_j)^2. \end{align}
  1. If \(F\) is nondecreasing on \([0,\infty )\), \(x\le F(x)\) for \(x\ge 0\), and \(G(C)+V\, N(C)^2\le F(C)\) for \(C\ge 0\), then \(C_j\le F^{M}(C_0)\) for all \(j\le M\).

  2. If \(A\ge 0\), \(K\ge 1\) is an integer and \(f(y)=A(1+y)^K\), then \(1+f^{j}(x)\le \bigl((A+1)(1+x)\bigr)^{(2K)^j}\) for every \(x\ge 0\) and every \(j\).

  3. If \(A\ge 1\), \(K\ge 1\) and \(G(C)+V\, N(C)^2\le A(1+C)^K\) for \(C\ge 0\), then \(C_j\le \bigl((A+1)(1+C_0)\bigr)^{(2K)^M}\) for all \(j\le M\).

Proof ▶

For the first assertion, induction gives \(C_0\le F^k(C_0)\), so \(F^k(C_0)\) is nondecreasing in \(k\), and \(C_{k+1}\le F(C_k)\le F(F^k(C_0))\). For the second, put \(b=(A+1)(1+x)\ge 1\) and \(u_j=1+f^j(x)\ge 1\). Then \(u_0\le b\) and

\begin{align} u_{j+1} & =1+Au_j^K\le (A+1)u_j^K\le b\, b^{K(2K)^j}\le b^{(2K)^{j+1}}, \end{align}

since \(1+Km\le 2Km\) for \(m\ge 1\). The third assertion is the first for \(F(x)=A(1+x)^K\), which is nondecreasing on \([0,\infty )\) with \(x\le F(x)\), followed by the second.

Fix \(q\ge 1\), \(R\ge 0\), \(J\), \(\Delta \), \(0{\lt}e_0{\lt}1\) and truncation and transport constants, let \(\nu =(1-e_0)/2000\) be the error exponent of the bootstrap parameters, and put \(k=\lceil 1/\nu \rceil \). For a safe-box constant \(C\), one round of Theorem 44.24.12 gives the constant \(G(C)=576\, C_{\rm out}(C)+N(C)^2\log q+1\), where \(C_{\rm out}(C)\) is the restored rough-budget coefficient and \(N(C)\) is the threshold of the round. Let \(C_\delta (C)\) be the principal density coefficient at \(C\), at the charge constant \(3\cdot 2^{2R(R+1)}\) and at the transport logarithmic coefficient. Put

\begin{align} \alpha & =128+2C_\delta (1), \\ A & =576\, C_{\rm out}(1)+\bigl(N(0)+2\bigr)^2\alpha ^{2k}\log q +1+\log q. \end{align}
Proof ▶

The coefficient \(C_{\rm out}(C)\) is affine in \(C\) with nonnegative coefficients, so \(C_{\rm out}(C)\le C_{\rm out}(1)(1+C)\). Of the entries of the maximum defining \(N(C)\), only the principal energy entry \(\bigl\lceil \max \bigl\{ 1,\max \{ 128,2C_\delta (C)\} ^{1/\nu }\bigr\} \bigr\rceil \) depends on \(C\), and \(C_\delta \) is affine in \(C\), so \(\max \{ 128,2C_\delta (C)\} \le \alpha (1+C)\). Hence

\begin{align} N(C) & \le N(0)+\bigl(\alpha (1+C)\bigr)^k+1 \le \bigl(N(0)+2\bigr)\bigl(\alpha (1+C)\bigr)^k, \end{align}

and the bound follows from \(1\le 1+C\le (1+C)^{2k}\).

Fix \(q\ge 1\), \(R\ge 0\), \(J\), \(\Delta \), \(0{\lt}e_0{\lt}1\), truncation and transport constants and an initial constant \(C_0\ge 0\), and let \(m\) be the number of bootstrap rounds from \(e_0\) to \(e_*=2\cdot 10^{-6}\). For every integer \(M\ge m\), the safe-box constant \(C_{\rm box}\) of Theorem 44.24.13 obtained from \(C_0\) satisfies

\begin{align} C_{\rm box} & \le \bigl((A+1)(1+C_0)\bigr)^{(4k)^M}. \end{align}

In particular, for \(J\ge 0\) and \(\Delta {\gt}0\) this holds for the safe-box constant of Definition 44.10.3, with \(e_0\) and \(C_0\) the exponent and the constant of the explicit initial box estimate and with the truncation constant at the factor \(2\).

Proof ▶

The safe-box constant is \(C_m\) for the recursion \(C_{j+1}=G(C_j)+\log q\) started at \(C_0\). By Theorem 44.10.10 each step is at most \(A(1+C)^{2k}\) with \(A\ge 1\), and the third assertion of Theorem 44.10.8 with \(K=2k\) gives the bound.

Definition 44.10.12 The constant of the area law at a bound for the safe-box constant
✓

For a real number \(B\), let \(C_{\rm AL}(q,R,J,\Delta ;B;c_0,C_{\rm ent},e_{\rm ent},C_{\rm en},e_{\rm en})\) be the constant of Definition 44.10.3 with \(C_{\rm box}\) replaced by \(B\), and let \(C_{\rm AL}^B(q,R,J,\Delta )\) be its value at the transport constants of Theorem 44.10.5. Let \(C_{\rm box}(q,R,J,\Delta )\) be the safe-box constant of Definition 44.10.3 at these transport constants.

Theorem 44.10.13 The closed constant at the safe-box constant
✓

For all \(q\), \(R\), \(J\) and \(\Delta \), \(C_{\rm AL}(q,R,J,\Delta )=C_{\rm AL}^{C_{\rm box}(q,R,J,\Delta )}(q,R,J,\Delta )\).

Proof ▶

Both sides are the constant of Definition 44.10.3 at the safe-box constant and the transport constants of Theorem 44.10.5.

Fix \(q\ge 1\), \(R\ge 0\), \(J\ge 0\) and \(\Delta {\gt}0\).

  1. Under the hypotheses of Theorem 44.10.4, let \(B\) be at least the safe-box constant \(C_{\rm box}\) of Definition 44.10.3. Then \(C=C_{\rm AL}(q,R,J,\Delta ;B;c_0,C_{\rm ent},e_{\rm ent},C_{\rm en},e_{\rm en})\) is nonnegative, and for every finite induced domain \(\Lambda \), every admissible Hamiltonian with a gapped ground vector \(\Omega \) and every \(A\subseteq \Lambda \), \(S_\Omega (A)\le C\, |\partial _\Lambda A|\).

  2. For every \(B\ge C_{\rm box}(q,R,J,\Delta )\), the same holds with \(C=C_{\rm AL}^B(q,R,J,\Delta )\).

Proof ▶

Since \(r^{1+e_*}\ge 0\), the safe-box bound with the constant \(C_{\rm box}\) gives the safe-box bound with the constant \(B\), and the proof of Theorem 44.10.4 goes through unchanged with \(B\) in place of \(C_{\rm box}\). The second assertion is the first at the transport constants of Theorem 44.10.5, for which \(c_0=\tfrac 18{\gt}0\).

Fix \(q\), \(R\), \(J\) and \(\Delta \). Let \(e_0\) and \(C_0\) be the exponent and the constant of the explicit initial box estimate, let \(A\) and \(k\) be the constants of Definition 44.10.9 at \(e_0\), at the truncation constant at the factor \(2\) and at the transport constants of Theorem 44.10.5, and let \(M_*\) be the round budget of Definition 42.19.2. Put

\begin{align} B_*(q,R,J,\Delta ) & =\bigl((A+1)(1+C_0)\bigr)^{(4k)^{M_*}}, \end{align}

and let \(C_{\rm AL}^*(q,R,J,\Delta )=C_{\rm AL}^{B_*}(q,R,J,\Delta )\) in the notation of Definition 44.10.12.

Fix \(q\ge 1\), \(R\ge 0\), \(J\ge 0\) and \(\Delta {\gt}0\). Then \(C_{\rm box}(q,R,J,\Delta )\le B_*(q,R,J,\Delta )\). Consequently \(C=C_{\rm AL}^*(q,R,J,\Delta )\) is nonnegative, and for every finite induced domain \(\Lambda \), every admissible Hamiltonian with a gapped ground vector \(\Omega \) and every \(A\subseteq \Lambda \), \(S_\Omega (A)\le C\, |\partial _\Lambda A|\).

Proof ▶

By Theorem 42.19.3, the number of bootstrap rounds from \(e_0\) is at most \(M_*\), so Theorem 44.10.11 with \(M=M_*\) gives \(C_{\rm box}(q,R,J,\Delta )\le B_*(q,R,J,\Delta )\). The second assertion of Theorem 44.10.14 with \(B=B_*\) gives the area law.

Definition 44.10.17 Ground states of range-\(R\) Hamiltonians on the square
✓

Fix natural numbers \(q\) and \(R\) and reals \(J\) and \(\Delta \). The ground states at range \(R\) form the family of vectors \(\Omega \) on the grid of side \(L\), identified with vectors on the integer square \(\Lambda =\{ 0,\ldots ,L-1\} ^2\), for which some Hamiltonian on \(\Lambda \) whose terms are supported on sets of diameter at most \(R\) and have norm at most \(J\), together with some real \(E_0\), satisfies \(\| \Omega \| =1\), \(H\Omega =E_0\Omega \) and \(H-E_0I\ge \Delta (I-|\Omega \rangle \langle \Omega |)\).

Every ground state at range \(R\) is a unit vector, and every ground state of the model at \(J\) and \(\Delta \) is a ground state at range one.

Proof ▶

The first claim is the normalization in Definition 44.10.17, since the identification of the grid with \(\Lambda \) preserves norms. For the second, place the Hermitian parts of the site and edge terms of the Hamiltonian on their supports in \(\Lambda \), which have diameter at most one, and the zero operator on every other support. The terms keep the norm bound \(J\), their sum is the original Hamiltonian, and the ground vector and the gap are carried along the identification.

Fix natural numbers \(q\) and \(R\) and reals \(J\), \(\Delta \) and \(C\ge 0\). Suppose that \(S_\Omega (A)\le C\, |\partial _\Lambda A|\) for every finite induced domain \(\Lambda \), every Hamiltonian on \(\Lambda \) whose terms are supported on sets of diameter at most \(R\) and have norm at most \(J\), every gapped ground vector \(\Omega \) of it with gap at least \(\Delta \) and every \(A\subseteq \Lambda \). Then the square-grid entropy area law of Definition 39.8.31 holds for the ground states at range \(R\) of Definition 44.10.17 with the constant \(C\).

Proof ▶

Apply the hypothesis on the integer square \(\Lambda \). Relabelling the sites along the identification of the grid with \(\Lambda \) preserves the entropy of every region, and it maps the edges of the grid crossing a cut bijectively onto the edges of \(\Lambda \) crossing the image of the cut.

Fix \(q\ge 1\), \(R\ge 0\), \(J\ge 0\) and \(\Delta {\gt}0\). Then the square-grid entropy area law of Definition 39.8.31 holds for the ground states at range \(R\) of Definition 44.10.17 with the constant \(C_{\rm AL}(q,R,J,\Delta )\) of Definition 44.10.6, and also with the constant \(C_{\rm AL}^*(q,R,J,\Delta )\) of Definition 44.10.15.

Proof ▶

Let \(C\) be either constant. By Theorem 44.10.7 or Theorem 44.10.16, \(C\ge 0\) and \(C\) bounds the entropy of every cut of every finite induced domain by \(C\) times the number of cut edges, for every gapped ground vector of every Hamiltonian of range \(R\). Theorem 44.10.19 then gives the square-grid law with the constant \(C\).

Fix \(q\ge 1\), \(J\ge 0\) and \(\Delta {\gt}0\). Then the square-grid entropy area law of Definition 39.8.31 holds for the ground states of the model at \(J\) and \(\Delta \) with the constant \(C_{\rm AL}(q,1,J,\Delta )\) of Definition 44.10.6.

Proof ▶

Every ground state of the model at \(J\) and \(\Delta \) is a ground state at range one by Theorem 44.10.18, and the law passes to smaller families by Theorem 39.8.32, so this is the case \(R=1\) of Theorem 44.10.20 with the constant \(C_{\rm AL}(q,1,J,\Delta )\).

Definition 44.10.22 Polynomial PEPS approximation at range \(R\)
✓

The polynomial PEPS approximation at range \(R\) is the following assertion. For every integer \(q\ge 2\), every integer \(R\ge 1\) and all reals \(J,\Delta {\gt}0\) there are \(C,c{\gt}0\) such that, for every \(L\ge 2\), every ground state at range \(R\) (Definition 44.10.17) on the grid of side \(L\) has a nonzero PEPS on the original open grid with \(D_e\le CL^c\) for every edge \(e\) and (77) for some \(\theta \in \mathbb R\). This extends Theorem 1.1 of [ 287 ] , which treats only site and nearest-neighbour terms, to terms supported on sets of diameter at most \(R\).

Theorem 44.10.23 The nearest-neighbour approximation from range one
✓

If the polynomial PEPS approximation at range \(R\) of Definition 44.10.22 holds, then for every integer \(q\ge 2\) and all reals \(J,\Delta {\gt}0\) there are \(C,c{\gt}0\) such that, for every \(L\ge 2\), every unit gapped ground vector, with gap \(\Delta \), of a Hamiltonian in the model of Definition 39.8.10 with term bound \(J\) has a PEPS approximation with these constants.

Proof ▶

Take the constants of the case \(R=1\). Theorem 44.10.18 makes every gapped ground vector of the model a ground state at range one.

Fix integers \(q\) and \(R\) and reals \(J,\Delta \), and let \(a_0=1/5000\). Let \(C_A=C_{\rm AL}(q,R,J,\Delta )\) be the area-law constant of Definition 44.10.6. Let \(D=D_R(J,\Delta ,a_0/2,60)\) and \(L_{\rm ang}=L_R(q,J,\Delta ,a_0/2,1,4,60)\) be the angular slope and the angular size threshold of Definition 39.5.1.5, and let \(c_R\) be the patch exponent of Definition 45.11.1.1 at \(B_0=20D\), \(p=60\) and \(C_A\). With \(L_0\), \(C_{\rm large}\) and the bond exponent \(c_{\rm PEPS}(c)\) of Definition 39.10.2 at \(q\), \(D\) and \(L_{\rm ang}\), put

\begin{align} c_{{\rm PEPS},R} & =c_{\rm PEPS}(c_R), & C_{{\rm PEPS},R} & =\max \bigl\{ C_{\rm large},\, q^{L_0^2}\bigr\} . \end{align}

Then \(D\ge 1\), and both constants are positive. At \(R=1\) they are not the constants of Definition 39.10.5, since the angular slope, its threshold and the patch exponent at range \(R\) are different closed forms.

Fix integers \(q\ge 2\) and \(R\ge 1\) and reals \(J,\Delta {\gt}0\), and let \(C_{{\rm PEPS},R}\) and \(c_{{\rm PEPS},R}\) be the constants of Definition 44.10.24. For every \(L\ge 2\), every ground state \(\Omega \) at range \(R\) on the grid of side \(L\) has a nonzero PEPS \(\Phi \) on the \(L\times L\) grid with \(D_e\le C_{{\rm PEPS},R}L^{c_{{\rm PEPS},R}}\) for every edge \(e\) and

\begin{align} \min _{\theta \in \mathbb R} \left\| \frac{\Phi }{\| \Phi \| }-e^{i\theta }\Omega \right\| & \le L^{-1}. \end{align}

In particular the polynomial PEPS approximation at range \(R\) of Definition 44.10.22 holds.

Proof ▶

By Theorem 44.10.20 the square-grid entropy area law holds for the ground states at range \(R\) with the constant \(C_A\). By Theorem 39.5.1.6 at \(a=a_0/2\), \(A_0=1\), \(m_0=4\) and \(p=60\), the numbers \(D\) and \(L_{\rm ang}\) are a slope and a threshold at accuracy \(L^{-60}\). By Theorem 45.11.1.2 at \(B_0=20D\) and \(p=60\) every such state has adaptive patches with exponent \(c_R\), and moving them to the cell-center sites keeps the constants. These states are unit vectors by Theorem 44.10.18, so Theorem 39.10.3 gives the approximation with the prefactor \(C_{\rm large}\) for \(L\ge L_0\), and Lemma 45.63.2 extends it to every \(L\ge 2\) with the prefactor \(C_{{\rm PEPS},R}\).

44.11 Common truncated ground vector for the selected sharp comparison

The source consumer now joins the moment, prevector, endpoint, selector, energy and comparison constructions without another physical-state or label choice. It retains an explicit selected-density expression rather than a final negative power of the system size.

Fix the local dimension \(q\ge 1\), range, interaction bound \(J\ge 0\), physical gap \(\Delta {\gt}0\), target-size coefficient \(C_T\ge 0\), anchor multiplicity \(\mathfrak m\), charge coefficient \(C_1{\gt}0\) with \(3\mathfrak m\le C_1\), and a real decay parameter \(P\). There are positive \(C_{\rm tr},C_{\rm target},C_B,c_t\), real propagation coefficients and exponents, coefficient constants \(C\ge 1\), \(C_\ell \ge 0\), and a threshold \(N\ge 2\) preceding every finite physical instance, as follows.

Let \(\Omega \) be an original gapped ground vector on the finite domain. The scanner uses the induced domain graph, its depth is the ambient depth of a nonempty target \(T\), and its anchors lie in their original supports with multiplicity at most \(\mathfrak m\). Assume \(n\ge N\), \(|T|\le C_Tn^2\), and retain the explicit scales

\begin{align} L & =\lfloor n^{1-1/100000}\rfloor , & m & =\lfloor n^{1/4}\rfloor , & D & =\lceil n^{1/1000000}\rceil ,\nonumber \\ K & =L\mathbin {\mathrm{div}}(8m), & r_0 & =\lceil C_{\rm tr}\log ^2n\rceil , & S.C_1 & =C_1. \label{eq:arealaw-source-selected-scales} \end{align}

The target’s ambient layers through \(L\) have size at most \(n\), and its clearance exceeds \(2L+10r_0\). Assume explicitly that \(2r_0\le D\), \(1\le D\) and \(4D\le m\). For real \(C_e,\eta \), suppose every original-state positive-depth prefix through \(L\) has entropy at most \(C_e(nL^\eta +n)\).

Put

\begin{align} g & =\Delta /\operatorname {positiveNormalization}(1,\Delta /2,J), & \varepsilon & =\min \{ n^{-1000},g/4\} ,\nonumber \\ B & =C_BnD(\log n)^{12}, & C_0 & =512\exp (1)(2/g),\nonumber \\ w & =n^{3/5}, & B_{\rm sh} & =C_e(nL^\eta +n)+n^{-247}. \label{eq:arealaw-source-selected-budgets} \end{align}

One unit truncated ground vector \(\Omega _t\), with energy \(0\le e\le \varepsilon \) and gap \(g/2\), has the stated quantitative trace distance from \(\Omega \). Its target typical set \(E\) has mass \(0{\lt}1-n^{-100}\le z\le 1\) and the complete eigenvalue window \([\exp (-S_X-w),\exp (-S_X+w)]\). Its target cut weight is at most \(C_{\rm target}n(\log n)^{12}\). In particular \(d=|E|{\gt}0\).

One label sequence \(\lambda _k\) for this same physical vector is chosen before \(W\). Its initial vectors are nonzero and have norm at most one for positive replica counts, and \(\log \dim \lambda _k-kS'=o(k)\) for the entropy \(S'\) of the compressed typical auxiliary state. For every \(0{\lt}W\le n^{1/20000}\), set \(a=W/K\) and let \(\ell _{\dim }\) be the physical propagation logarithmic dimension bound. Assume explicitly \(a\ell _{\dim }\le c_t\).

Replica-remainder constants and nonnegative sequences can then be chosen before every \([p_0,p_1]\) with \(0{\lt}p_0{\lt}p_1{\lt}1\) and every selected charge point. Eventually in \(k\), there are a charge stage \(s_k\) and \(p_k\in [p_0,p_1]\) such that

\begin{align} \frac{\mathcal Q_k}{KnD} & \le \frac{2(C_1+1)}{Wnm(p_1-p_0)} \left[B_{\rm rough} +2nm\, C_{\rm ent}aK a^{1/4}\ell _{\dim }^{e_{\rm ent}} +R_{\rm end}(k)\right],\nonumber \\ B_{\rm rough} & =2\log d-\log z+W\left(\frac{B_{\rm sh}}z+1+3nD\log q\right),\nonumber \\ R_{\rm end}(k) & =R_{\rm Bell}(k)+(C_i+2nmC_b)\frac{\log (k+2)}k \longrightarrow 0. \label{eq:arealaw-source-selected-density} \end{align}

At this same point,

\begin{align} 0\le \delta _k=\frac{\mu _k-e}{g/2} & \le \frac{e+\operatorname {cap}_k+r_k}{g/2}, & r_k & \longrightarrow 0, \label{eq:arealaw-source-selected-energy} \end{align}

with the density cap from (58). For every \(0{\lt}\tau \le 1/2\), the exact terminal-weight comparison (56) holds with \(K_{\rm mom}=C_0B\) and \(\delta \) replaced by the right side of (89). All replica remainder limits fix the physical system and weight first.

Proof ▶

Choosing the source and coefficient constants and combining their size thresholds with the continuity threshold for volume coefficient \(C_T+1\) precedes the physical data and \(C_e,\eta \). Invoking the common target-window moment construction once and then the physical Schmidt–Bell selection once gives a single vector that satisfies both factor-ten smallness bounds, hence also the factor-six bounds.

Transferring its exact eigen-equation across the augmented copy-mean coordinate identity, applying the selector and finite-family propagation theorem to that same initial vector, transferring the source prefix entropy to the same truncated vector, applying the rough endpoint comparison using its unchanged selected-state projection mass, accumulating the \(2nm\) logarithmic propagation costs, and normalizing the selector’s numerator gives (88).

Applying the coefficient theorem and the uniform sharp comparison at the unchanged stage and parameter then completes the proof: the energy error and \(M/\tau \) are nonnegative, so the same cap can be substituted, while the lower and upper replica errors retain their factors \(R_-\) and \(2R_+/W\).

No selected-point, endpoint, coefficient or sharp-comparison conclusion is assumed by this theorem. It still retains the explicit separation and propagation smallness premises, the source entropy input, the finite-size density expression and the pre-gap and maximum. A final prescribed density power, safe-box entropy bounds and the six-error absorption are further obligations.

44.12 Principal density at the rounded scanner scales

The principal entropy-defect density of [ 286 , Section 9, lines 380–384 ] is a fixed multiple of \(\varepsilon ^{-1}(n^{e-\mu }+a^{1/4}(\log n)^{C_\ell })\). The rounded expression before the estimate of the window scale has \(n^e/m\) in place of \(n^{e-\mu }\). Both terms have a strict power margin at the final scanner exponents.

Fix scanner exponents satisfying \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), \(\nu {\gt}0\), \(0{\lt}e{\lt}1\) and \(\kappa \leq e\). Fix \(C\geq 0\) and \(C_\ell ,\omega ,r\in \mathbb R\), and suppose

\begin{align} e-\mu +\nu & {\lt}-r, & \frac{\omega -(1-\ell -\mu )}4+\nu & {\lt}-r. \label{eq:density_scale_margins} \end{align}

There is an integer \(N\geq 2\), depending only on these fixed quantities, with the following property. For every integer \(n\geq N\), retain the scales

\begin{align} L & =\lfloor n^{1-\ell }\rfloor , & m & =\lfloor n^\mu \rfloor , & K & =\left\lfloor \frac{L}{8m}\right\rfloor , & \varepsilon & =n^{-\nu }. \label{eq:density_scale_scales} \end{align}

Then \(K\geq 1\), and every \(1\leq W\leq n^\omega \), with \(a=W/K\), satisfies

\begin{align} \frac C\varepsilon \left(\frac{n^e}{m}+a^{1/4}(\log n)^{C_\ell }\right) & \leq n^{-r}. \label{eq:density_scale_bound} \end{align}
Proof ▶

The rounded scale estimates give fixed constants \(C_m,C_K\geq 1\) such that, for all sufficiently large \(n\),

\begin{align} \frac{n^e}{m} & \leq C_m n^{e-\mu }, & n^{1-\ell -\mu } & \leq C_KK. \label{eq:density_scale_rounded} \end{align}

The weight bound and \(K{\gt}0\) imply \(a\leq C_Kn^{\omega -(1-\ell -\mu )}\), hence \(a^{1/4}\leq C_K^{1/4}n^{(\omega -(1-\ell -\mu ))/4}\). Every fixed logarithmic power is smaller than any positive power: for \(A\geq 0\) and \(p{\lt}q\), eventually \(A n^p(\log n)^{C_\ell }\leq \tfrac 12 n^q\). Applying this bound with \(q=-r-\nu \) to the two terms bounded in (93), with coefficients \(CC_m\) and \(CC_K^{1/4}\) and logarithmic powers \(0\) and \(C_\ell \), where the strict inequalities in (90) provide the required gaps, adding the two half-bounds, and dividing by \(\varepsilon =n^{-\nu }{\gt}0\) gives (92).

Theorem 44.12.2 Exact final density margins
✓

For the source’s final parameters \(e=2/1000000\), \(\mu =1/4\), \(\nu =1/1000\), \(\ell =1/100000\) and \(\omega =1/20000\), the two gaps at \(r=\nu \) are

\begin{align} -\nu -(e-\mu +\nu ) & =\frac{123999}{500000}, & -\nu -\left(\frac{\omega -(1-\ell -\mu )}4+\nu \right) & =\frac{37097}{200000}. \label{eq:density_scale_final_gaps} \end{align}
Proof ▶

Substituting the displayed rational values and simplifying yields both identities.

Theorem 44.12.3 Final rounded principal density
✓

Fix \(C\geq 0\) and \(C_\ell \in \mathbb R\). At the final scanner parameters there is an integer threshold \(N\geq 2\) such that, for every \(n\geq N\) and every \(1\leq W\leq n^{1/20000}\), the rounded scales in (91) satisfy \(K\geq 1\) and

\begin{align} \frac{C}{n^{-1/1000}} \left(\frac{n^{2/1000000}}{m} +\left(\frac WK\right)^{1/4}(\log n)^{C_\ell }\right) & \leq n^{-1/1000}. \label{eq:density_scale_final_bound} \end{align}
Proof ▶

Exact rational arithmetic verifies (90) with \(r=\nu \), as quantified in (94), so Theorem 44.12.1 with \(\kappa =1/1000000\) gives the bound.

The estimate concerns only the displayed principal density. To control a selected entropy defect, its comparison with this density and the decay of any additional terms must also be established.

44.13 The physical rough bound and its principal density terms

Theorem 44.13.1 Target entropy transfer
✓

Fix a local dimension \(q\geq 1\), a normalized gap \(g{\gt}0\) and a volume coefficient \(C_{\rm vol}\). For all sufficiently large \(n\), uniformly over the finite lattice, two unit vectors \(\Omega \) and \(\widetilde\Omega \), and a region \(X\) of size at most \(C_{\rm vol}n^2\), the trace-distance bound

\begin{align} \operatorname {dist}_{\rm tr} (|\widetilde\Omega \rangle \langle \widetilde\Omega |, |\Omega \rangle \langle \Omega |) & \leq \sqrt{2\min \{ n^{-1000},g/4\} /g} \end{align}

implies

\begin{align} |S(\widetilde\Omega _X)-S(\Omega _X)| & \leq n^{-247}. \label{eq:arealaw-target-entropy-transfer} \end{align}
Proof ▶

The trace distance is at most \(\sqrt{2/g}\, n^{-500}\). At trace distance \(t\), regional entropy continuity bounds the entropy difference by \(4\sqrt t(1+|X|\log q)\), and for large \(n\) the one-power margin between \(n^{-250}n^2\) and \(n^{-247}\) absorbs the fixed coefficient and the quadratic volume bound \(|X|\leq C_{\rm vol}n^2\).

Theorem 44.13.2 The rough bound has the source entropy power
✓

Let \(n\geq 2\), \(q\geq 1\), \(L\leq n\), \(D\geq 1\), \(e,C_e\geq 0\), \(W\geq 1\), and \(D\leq 2n^e\). Suppose the positive selected mass and target estimates satisfy

\begin{align} 1-n^{-100} & \leq z, & S_t & \leq C_en^{1+e}+n^{-247},\nonumber \\ |\log d-S_t| & \leq n^{3/5}-\log z, & B_{\rm sh} & \leq C_e(nL^e+n)+n^{-247}. \end{align}

Then the rough expression obeys

\begin{align} 2\log d-\log z+ W\left(\frac{B_{\rm sh}}z+1+3nD\log q\right) & \leq (6C_e+13+6\log q)Wn^{1+e}. \label{eq:arealaw-source-rough-budget-power} \end{align}
Proof ▶

Since \(n\geq 2\), the mass bound \(1-n^{-100}\leq z\) gives \(z\geq 1/2\) and \(-\log z\leq 1\). With \(N=n^{1+e}\), these estimates bound the target term \(2\log d-\log z\) by \((2C_e+7)N\), the shell term \(B_{\rm sh}/z\) by \(4(C_e+1)N\), and the mismatch term \(1+3nD\log q\) by \(2(1+3\log q)N\); multiplying the target bound by \(W\geq 1\) and summing yields the stated inequality.

Theorem 44.13.3 Principal terms of the selected-density bound
✓

Let \(n,m\) be positive integers, \(W,\varepsilon ,C_1{\gt}0\), \(a,C_r,C_t\geq 0\), and let \(e,C_l,B,G,R\) be real. If \(B\leq C_rWn^{1+e}\) and \(G\leq C_t(\log n)^{C_l}\), then

\begin{align} \frac{2(C_1+1)}{Wnm\varepsilon } \bigl(B+2nm\, GW a^{1/4}+R\bigr) & \leq C\frac{n^e/m+a^{1/4}(\log n)^{C_l}}{\varepsilon } +\frac{2(C_1+1)}{Wnm\varepsilon }R,\nonumber \\ C & =2(C_1+1)(C_r+2C_t). \label{eq:arealaw-selected-density-principal} \end{align}

No sign restriction on \(B,G,R\) is required.

Proof ▶

Substituting the upper bounds on \(B\) and \(G\) and cancelling the positive factors \(W\) and \(n\) bounds the first two terms by \(2(C_1+1)C_rn^e/(m\varepsilon )\) and \(4(C_1+1)C_ta^{1/4}(\log n)^{C_l}/\varepsilon \). Because both quotients are nonnegative, replacing their individual coefficients by their sum \(C\) while leaving the remainder term unchanged gives the result.

Theorem 44.13.4 Selected density at arbitrary scanner exponents
✓

Adopt the exponents and rounded scales of Lemma 43.9.1, and suppose its estimates hold with constant \(C_s\geq 1\). Let \(W,C_1{\gt}0\), put \(a=W/K\), and suppose \(C_r,C_t\geq 0\) and

\begin{align} B & \leq C_rWn^{1+e}, \\ G & \leq C_t(\log n)^{C_l}. \end{align}

Set

\begin{align} c & =\frac{2(C_1+1)}{Wnm(\epsilon /2)}, \\ C_\delta & =4(C_1+1)(C_r+2C_t)C_s. \end{align}

Then, for every real \(R\),

\begin{align} c\bigl(B+2nm\, GW a^{1/4}+R\bigr) & \leq C_\delta \epsilon ^{-1} \bigl(n^{e-\mu }+a^{1/4}(\log n)^{C_l}\bigr)+cR. \end{align}
Proof ▶

Applying Theorem 44.13.3 with interpolation length \(\epsilon /2\) bounds the left-hand side in terms of \(n^e/m\) and \(a^{1/4}(\log n)^{C_l}\). The scale estimate \(n^e/m\leq C_sn^{e-\mu }\) and the inequality \(C_s\geq 1\) on the nonnegative second term then absorb \(C_s\) into \(C_\delta \), while the remainder term \(cR\) is unchanged.

Theorem 44.13.5 Energy from the selected density
✓

Let \(d,\delta ,\rho ,A,t\geq 0\), let \(g{\gt}0\), and suppose \(d\leq \delta +\rho \) and \(0\leq p\leq \epsilon \). If

\begin{align} E & \leq \frac{e+A((1-p)d^{1/8}+(1-p)t+p)+r}{g}, \end{align}

then

\begin{align} E & \leq \frac Ag(\delta ^{1/8}+\epsilon +t) +\frac eg+\frac{A\rho ^{1/8}+r}{g}. \end{align}

No sign assumption is made on \(e,r\) or \(E\).

Proof ▶

Since \(d\leq \delta +\rho \), subadditivity of the eighth root gives \(d^{1/8}\leq \delta ^{1/8}+\rho ^{1/8}\). Using \(1-p\leq 1\) on the nonnegative terms \((1-p)d^{1/8}\) and \((1-p)t\), bounding \(p\) by \(\epsilon \), and separating the \(\rho ^{1/8}\) contribution after multiplying by \(A/g\) yields the stated inequality.

Theorem 44.13.6 Vanishing selected-energy remainder
✓

Fix \(A,g\in \mathbb R\), with division by zero assigned the value zero for this scalar extension. If \(\rho _k\to 0\) and \(r_k\to 0\) along any fixed filter on their index set, then

\begin{align} \frac{A|\rho _k|^{1/8}+r_k}{g} & \longrightarrow 0. \end{align}

The coefficients are fixed before this limit is taken. In the physical application \(g{\gt}0\), so this is the ordinary quotient by the spectral gap.

Proof ▶

Because the absolute value and eighth root are continuous at zero, \(|\rho _k|^{1/8}\to 0\), and linearity gives \(A|\rho _k|^{1/8}+r_k\to 0\). When \(g\ne 0\), multiplying by \(1/g\) preserves this limit; when \(g=0\), the extended quotient vanishes identically.

Theorem 44.13.7 Ordered-limit closure at the selected point
✓

Fix \(q\geq 1\), \(C_e,C_t\geq 0\), \(C_1{\gt}0\) and a real logarithmic exponent \(C_l\). There is a size threshold \(N\geq 2\) before all physical scalar inputs, remainders and selected points. For \(n\geq N\) use the final rounded scales

\begin{align} L & =\lfloor n^{1-\ell }\rfloor , & m & =\lfloor n^\mu \rfloor , & K & =L\mathbin {\mathrm{div}}(8m), & D & =\lceil n^\kappa \rceil ,\nonumber \\ a & =W/K, & \varepsilon & =n^{-\nu }, & 1 & \leq W\leq n^\omega . \end{align}

Assume the displayed target-mass, entropy, selected-dimension and shell bounds, with \(e\) equal to the source box-error exponent, and \(G\leq C_t(\log n)^{C_l}\). Let \(R_k\to 0\) for this fixed instance. Suppose that eventually in \(k\) there is a point \((x,p)\), with \(p\in [p_0,p_1]\), for which a quantity \(d_k(x,p)\) satisfies

\begin{align} d_k(x,p) & \leq \frac{2(C_1+1)}{Wnm\varepsilon } \bigl(B_{\rm rough}+2nm\, GW a^{1/4}+R_k\bigr), \end{align}

together with any attached proposition \(\mathcal P_k(x,p)\). Then eventually the same selected point satisfies \(d_k(x,p)\leq \varepsilon \) and \(\mathcal P_k(x,p)\).

Proof ▶

These rounded scales give \(K\geq 1\), \(m{\gt}0\), \(L\leq n\) and \(D\leq 2n^e\). Combining the two preceding scalar bounds with the numerical strict-margin theorem at coefficient \(2C\) bounds the principal part by \(\varepsilon /2\). With \(n,W\) and the physical inputs fixed, the scaled remainder term \(2(C_1+1)R_k/(Wnm\varepsilon )\) is also eventually at most \(\varepsilon /2\), so adding the two bounds at the same point \((x,p)\) gives \(d_k(x,p)\leq \varepsilon \) without interchanging the large-scale and replica limits.

In the physical application, one target window and one label sequence remain fixed throughout. For that window, the original target entropy bound and the target-window spectral estimate yield the displayed target hypotheses, while the unnormalized selection inequality enters as an explicit premise. The scanner theorem then discharges this premise and preserves the energy and sharp-comparison conclusions at the same charge point, without yet asserting final energy absorption, the entropy telescope, or the area law.

44.14 Source-power density at the same charge point

Theorem 44.14.1 A source-small density and the unchanged sharp comparison
✓

Fix the local dimension, interaction radius, interaction and positive spectral-gap bounds, a nonnegative target-volume coefficient, a positive scanner coefficient \(C_1\), and the anchor multiplicity controlled by \(C_1/3\). Fix also the energy-tail exponent \(P\). There are positive source constants \(C_{\rm tr},C_{\rm target},C_B,c_t\), real round-energy coefficients and exponents, and cap constants \(C\geq 1\), \(C_l\geq 0\), chosen before every entropy coefficient \(C_e\geq 0\). For each such \(C_e\) there is a size threshold before the finite physical data.

Let \(\Omega \) be the original unit gapped ground state of the given finite-domain local Hamiltonian. The scanner uses the domain graph, anchors in their original interaction supports and ambient depth from the nonempty target set \(T\). Impose the source quadratic target size, whole-row layer counts, anchor multiplicity, collar clearance and rounded scales. Retain the geometric premises \(2r_0\leq D\) and \(4D\leq m\). Write \(X=A\cap T\), \(L=\lfloor n^{1-\ell }\rfloor \), and let \(e_{\mathrm{box}}\) be the final source box-error exponent. Assume the original entropy bounds

\begin{align} S(\Omega _X) & \leq C_en^{1+e_{\mathrm{box}}},\nonumber \\ S(\Omega _{\{ 0{\lt}\mathrm{depth}\leq j\} \cap A}) & \leq C_e(nL^{e_{\mathrm{box}}}+n)\qquad (0\leq j\leq L). \end{align}

Then there is one truncated ground state \(\widetilde\Omega \), one target spectral window \(E\) of mass \(z\), and one physical Schmidt–Bell label sequence before every weight \(1\leq W\leq n^\omega \). They retain the source gap, energy, trace, cut-tail and window bounds.

Set \(a=W/K\) and retain the round-step smallness premise \(a\, \mathrm{transportLogDimBound}(q,r_0)\leq c_t\). For each such fixed weight, eventually in replica number \(k\) there is a charge point \((s,p)\) with

\begin{align} p & \in [n^{-\nu },2n^{-\nu }], & \frac{Q_k(s,p)}{KnD} & \leq n^{-\nu }. \label{eq:arealaw-source-selected-density-power} \end{align}

Here \(Q_k\) is the charge entropy defect of the same prevector. At this unchanged point all the previous energy and sharp-comparison conclusions hold. In particular, writing \(e_0\) for the truncated ground energy and \(g/2\) for its physical gap,

\begin{align} 0\leq \delta _k(s,p) & :=\frac{\mu _k(s,p)-e_0}{g/2} \leq \frac{e_0+\mathrm{cap}_k(s,p)+\mathrm{rem}_k}{g/2},\nonumber \\ \mathrm{cap}_k(s,p) & :=CW^2n^\ell D^2(\log n)^{C_l} \left((1-p)\left(\frac{Q_k(s,p)}{KnD}\right)^{1/8} +(1-p)n^{-P}+p\right). \end{align}

The full sharp inequality keeps the same mapped terminal weights, label entropy, physical gap, loss \(37K_{\rm mom}a\), mass term and both replica remainders. Its auxiliary parameter remains universally quantified over \(0{\lt}\tau \leq 1/2\) at this same point.

Proof ▶

The source selected-comparison theorem provides the truncated ground state, spectral window, and label sequence. The retained containment \(X\subseteq \mathrm{truncationSet}(L)\) and its quadratic volume bound allow target entropy transfer at the given trace distance. The original target bound therefore gives \(S(\widetilde\Omega _X)\leq C_en^{1+e_{\mathrm{box}}}+n^{-247}\). The full same-\(E\) eigenvalue window gives \(|\log |E|-S(\widetilde\Omega _X)|\leq n^{3/5}-\log z\). The original prefix bound has already given the endpoint rough bound for these same labels.

With the rounded logarithmic radius bounding the fixed round-energy coefficient by \(C_t(\log n)^{C_l'}\), enlarging the size threshold accommodates this cap, the target transfer, and the numerical density bound. Because \(n^\nu \geq 4\) places the displayed interval of width \(n^{-\nu }\) strictly inside the interior and \(aK=W\), the initial selected-density bound furnishes the input to the ordered-limit closure, which retains the energy and all sharp comparisons as propositions attached to the original point.

The entropy coefficient and all fixed cap coefficients precede the enlarged size threshold. The state, spectral set and label sequence precede the weight; each replica threshold is chosen only after the physical system and weight are fixed. No limit interchange or new point selection is used. Round-step smallness, the source geometric hypotheses, final energy absorption, the entropy telescope and the final area law remain separate.

44.15 Power decay of the selected charge energy

Fix the final scanner exponents \(\omega =1/20000\), \(\ell =1/100000\), \(\kappa =1/1000000\) and \(\nu =1/1000\) of [ 286 ] . The charge-energy expression in Section 9, lines 492–511, contains the eighth root of a normalized entropy defect. Thus a density bound at rate \(8\nu \) suffices to put that term at rate \(\nu \).

Definition 44.15.1 Final-scale charge energy bound
✓

For \(C,C_\ell ,P,W,x,p\in \mathbb R\) and an integer \(n\geq 1\), set \(D=\lceil n^\kappa \rceil \) and

\begin{align} E_n(W,x,p) & =CW^2n^\ell D^2(\log n)^{C_\ell } \left((1-p)x^{1/8}+(1-p)n^{-P}+p\right). \label{eq:selected_energy_cap} \end{align}

Here \(x\) denotes the normalized entropy defect.

Theorem 44.15.2 Exact energy exponents
✓

At the final scanner exponents,

\begin{align} 2\omega +\ell +2\kappa & =\frac{14}{125000}, & 2\omega +\ell +2\kappa -\nu & =-\frac{111}{125000}, & -\frac1{2000}-(2\omega +\ell +2\kappa -\nu ) & =\frac{97}{250000}. \label{eq:selected_energy_margins} \end{align}
Proof ▶

Substituting the displayed rational values and simplifying gives the three identities.

Theorem 44.15.3 Pointwise charge energy bound
✓

Fix \(C\geq 0\), \(C_\ell \in \mathbb R\) and \(P\geq \nu \). For every integer \(n\geq 1\), every \(1\leq W\leq n^\omega \), every \(0\leq x\leq n^{-8\nu }\) and every \(p\in [n^{-\nu },2n^{-\nu }]\), the expression in (114) satisfies

\begin{align} E_n(W,x,p) & \leq 16C n^{-111/125000}(\log n)^{C_\ell }. \label{eq:selected_energy_pointwise} \end{align}
Proof ▶

The density bound gives \(x^{1/8}\leq n^{-\nu }\), and \(P\geq \nu \) gives \(n^{-P}\leq n^{-\nu }\). Since \(p\geq 0\), multiplication by \(1-p\) cannot increase either nonnegative term. Consequently

\begin{align} (1-p)x^{1/8}+(1-p)n^{-P}+p & \leq 4n^{-\nu }. \label{eq:selected_energy_bracket} \end{align}

Also \(D\leq n^\kappa +1\leq 2n^\kappa \) and \(W^2\leq n^{2\omega }\). Substituting these inequalities into (114) and adding the exponents gives (116).

Fix \(C\geq 0\), \(C_\ell \in \mathbb R\), \(g{\gt}0\) and \(P\geq \nu \). There exists an integer \(N\geq 2\) such that, for every \(n\geq N\), every \(1\leq W\leq n^\omega \), every \(0\leq x\leq n^{-8\nu }\), every \(p\in [n^{-\nu },2n^{-\nu }]\) and every \(e\leq n^{-1000}\),

\begin{align} \frac{e+E_n(W,x,p)}{g/2} & \leq n^{-1/2000}. \label{eq:selected_energy_decay} \end{align}

The threshold is chosen before \(n,W,x,p,e\).

Proof ▶

The strict gap \(97/250000{\gt}0\) in (115) absorbs every fixed coefficient and logarithmic power. Thus, eventually,

\begin{align} 16C n^{-111/125000}(\log n)^{C_\ell } & \leq \frac g4 n^{-1/2000}, & n^{-1000} & \leq \frac g4 n^{-1/2000}. \label{eq:selected_energy_absorption} \end{align}

Both estimates depend only on the fixed data; applying (116), adding the inequalities in (119), and dividing by \(g/2{\gt}0\) gives the bound.

Under the hypotheses of Theorem 44.15.4, the same threshold works for every additional real remainder \(r\):

\begin{align} \frac{e+E_n(W,x,p)+r}{g/2} & \leq n^{-1/2000}+\frac r{g/2}. \label{eq:selected_energy_remainder} \end{align}
Proof ▶

Expanding the quotient of the sum and adding \(r/(g/2)\) to (118) gives the bound.

These conclusions are numerical. Applying them to a physical scanner requires the normalized density and energy comparison at the same selected charge point. If \(r=r_k\) tends to zero as the replica count \(k\) tends to infinity, (120) keeps that limit separate from the power estimate in \(n\).

44.16 Stronger density and the paper energy rate at one charge point

Theorem 44.16.1 Eight-nu density margins
✓

At the final source exponents, the exact slacks for density rate \(8\nu =1/125\), with interval exponent still equal to \(\nu \), are

\begin{align} -8\nu -(e-\mu +\nu ) & =\frac{120499}{500000},\nonumber \\ -8\nu -\left(\frac{\omega -(1-\ell -\mu )}4+\nu \right) & =\frac{35697}{200000}. \end{align}
Proof ▶

Direct substitution of the exact rational final exponents gives both displayed values.

Theorem 44.16.2 Principal density at the stronger rate
✓

For every fixed \(C\geq 0\) and real \(C_l\), there is a threshold before \(n\) and \(W\) such that the floor and natural-division scales obey \(K\geq 1\) and, uniformly over \(1\leq W\leq n^\omega \),

\begin{align} C\frac{n^e/m+(W/K)^{1/4}(\log n)^{C_l}}{n^{-\nu }} & \leq n^{-8\nu }. \end{align}
Proof ▶

With no scanner, entropy, or selection input needed for this numerical statement, the arbitrary-rate rounded-scale theorem at rate \(8\nu \) and the two strict margins above yield the displayed bound.

Theorem 44.16.3 Unchanged interval and stronger selected density
✓

Under the same explicit target-mass, target-entropy, selected-dimension, shell-entropy and logarithmic-cap hypotheses as the modular selected density theorem, retain its initial selected bound and interval denominator \(\varepsilon =n^{-\nu }\). With all fixed coefficients before the size threshold, eventually in replica number the unchanged selected point satisfies density at most \(\eta =n^{-8\nu }\) and every proposition already attached to that point.

Proof ▶

Evaluating the preceding numerical bound at twice the required coefficient bounds the principal term by \(\eta /2\), while for each fixed physical system and weight the scaled replica remainder is eventually at most \(\eta /2\); keeping the same selected point and attached propositions without replacing the interval width by \(\eta \) therefore bounds the total density by \(\eta =n^{-8\nu }\).

Use the same original gapped-ground-state, graph, anchor, depth, whole-row geometry, target-volume, clearance and scale premises as the concrete source-density theorem. Fix \(C_1{\gt}0\) and its anchor multiplicity before all thresholds. Fix \(P\geq \nu \). The positive source constants, real round-energy coefficients and exponents, and cap constants \(C\geq 1\), \(C_l\geq 0\) precede the nonnegative entropy coefficient \(C_e\), which precedes the enlarged size threshold. The original target and prefix bounds are

\begin{align} S(\Omega _X) & \leq C_en^{1+e_{\mathrm{box}}}, & S(\Omega _{\{ 0{\lt}\mathrm{depth}\leq j\} \cap A}) & \leq C_e(nL^{e_{\mathrm{box}}}+n)\quad (0\leq j\leq L). \end{align}

Then one truncated state, one target window and one physical label sequence precede every weight \(1\leq W\leq n^\omega \). Retain \(2r_0\leq D\), \(4D\leq m\) and \(a\, \mathrm{transportLogDimBound}(q,r_0)\leq c_t\) for \(a=W/K\). For each fixed admissible instance and weight, eventually there is a charge point \((s,p)\) for the same prevector with

\begin{align} p & \in [n^{-\nu },2n^{-\nu }], & 0\leq \frac{Q_k(s,p)}{KnD} & \leq n^{-8\nu },\nonumber \\ 0\leq \delta _k(s,p) & :=\frac{\mu _k(s,p)-e_0}{g/2} \leq n^{-1/2000}+\frac{\mathrm{rem}_k}{g/2}. \label{eq:arealaw-source-selected-energy-power} \end{align}

The original cap-based energy inequality is also retained. In the full sharp comparison, the factor multiplying \(\max \{ 0,2S'+g_{\max }\} /\tau \) is replaced by this derived energy upper bound, for every \(0{\lt}\tau \leq 1/2\) at the same point. All other entropy, mass, moment and replica-remainder terms remain unchanged, including the loss \(37K_{\mathrm{mom}}a\).

Proof ▶

Transferring the original target entropy to the truncated state from the initial source selected-comparison theorem and combining it with the selected-dimension estimate on the same spectral window allows the eight-nu density closure to act directly on the initial endpoint and selection bound while preserving its chosen interval and selected point.

The charge-defect nonnegativity theorem gives \(Q_k\geq 0\). Its eighth root is at most \(n^{-\nu }\). Since \(P\geq \nu \) and \(p\leq 2n^{-\nu }\), the energy bracket is at most \(4n^{-\nu }\). The ceiling bound gives \(D\leq 2n^\kappa \), while \(W\leq n^\omega \). The cap is therefore at most \(16C n^{-111/125000}(\log n)^{C_l}\). The positive margin \(97/250000\) absorbs these fixed coefficients and logarithms, as well as the fixed gap normalization. The same source ground energy obeys \(e_0\leq n^{-1000}\) and is absorbed separately. The replica remainder remains divided by the same gap, with no size-dependent rate claimed. Monotonicity in the nonnegative sharp-comparison factor proves its stated strengthening.

The manuscript writes its averaging interval as \([\epsilon /2,\epsilon ]\) and finally takes \(\epsilon =n^{-\nu }\). This theorem uses the valid alternative \([n^{-\nu },2n^{-\nu }]\), corresponding to rescaling that averaging parameter by two. The factor \(p\leq 2n^{-\nu }\) is retained explicitly in the cap, and the threshold ensures \(2n^{-\nu }{\lt}1\). The geometric and entropy hypotheses and selected interval are unchanged. The energy corollary fixes \(P\geq \nu \) and uses a stronger consequence of the existing strict density margins. The replica threshold still follows the physical instance and weight. The entropy bounds needed to close the remaining comparison, safe-box telescope and final area law are not asserted here.

44.17 Physical information in the sharp comparison

This section identifies the entropy expression in the terminal-tree sharp comparison with physical collar mutual information and derives the uniform pre-comparison entropy bounds from the genuine positive-prefix input (A two-dimensional area law from a global spectral gap, 08-scanner.tex, lines 868–877, 900–911 and 936–941, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a), without choosing any new truncated vector, spectral set, auxiliary label, selected stage, parameter, or terminal probability law.

Theorem 44.17.1 The collar partition
✓

Let the scanner depth be the ambient depth of the nonempty target template \(T\), and let \(8Km\leq L\). At every completed or pre-charge terminal and every original band, put

\[ X=A\cap T,\quad U=\text{positive near},\quad Y=\text{middle},\quad V=\text{far}. \]

These four regions are pairwise disjoint and cover the physical sites. The near region is \(X\cup U\), the positive near-middle region is \(U\cup Y\), and the complement of the same truncation set is contained in \(V\).

Proof ▶

Independently of the terminal horizon and without any entropy premise, the accepted receiving-region identities and positive-depth invariant for the status evaluator give the disjoint cover and region unions, while taking complements in its far-complement containment in the truncation set yields the outside containment in \(V\).

Theorem 44.17.2 The exact terminal identity and weighted information bound
✓

For the same physical vector, let

\[ g_{\rm pre}=S(XU)+S(V)-S(Y),\qquad g_{\rm post}=S(U)+S(UY)-S(Y). \]

Every terminal satisfies

\[ 2S(X)+g_{\rm pre}-g_{\rm post}=I(X:V)+I(X:YV). \]

If \(K{\gt}0\), any given terminal mean tree, with its unchanged weights \(w_j\), gives

\[ 2I(X:S_0^c)\leq 2S(X)+G_{\rm pre}-G_{\rm post},\qquad G_\bullet =\frac1K\sum _g\sum _jw_jg_\bullet (j,g), \]

where \(S_0\) is the same truncation set.

Proof ▶

Without requiring any normalization hypothesis, the accepted pure-state collar identity gives the terminal equality, and its weighted mutual-information monotonicity theorem with \(S_0^c\subseteq V\) at every terminal shows that both far-side informations dominate \(I(X:S_0^c)\), so summing over the original bands and dividing by \(K{\gt}0\) yields the displayed factor of two.

Theorem 44.17.3 The same selected spectrum and original vector
✓

Under the preceding collar hypotheses, with \(m,M,K{\gt}0\), let \(\Omega _t\) be unit, and retain its positive-mass spectral window \(E\), of width \(w\), with mass \(z{\gt}0\). Let \(S'\) be the selected auxiliary entropy, and define \(G_{\rm pre},G_{\rm post}\) from the mapped charge tree at the same charge stage and parameter. Then

\[ 2I_{\Omega _t}(X:S_0^c) \leq 2S'+G_{\rm pre}-G_{\rm post}+2(w-\log z). \]

For any unit original vector \(\Omega \), the same right-hand side bounds \(2I_\Omega (X:S_0^c)\) after adding

\[ 16\sqrt{d_{\rm tr}(\Omega _t,\Omega )}\, \log \bigl(e\dim \mathcal H_X\bigr). \]
Proof ▶

The accepted selected-spectrum estimate gives \(|S'-S_{\Omega _t}(X)|\leq w-\log z\). Its lower side costs exactly \(2(w-\log z)\). The accepted mutual-information continuity estimate has coefficient eight; multiplying by two gives sixteen. Only the target dimension occurs, regardless of the far-region size.

Assume the induced domain graph, ambient target depth, \(n{\gt}0\), \(r_0\leq D\), \(1\leq D\), \(4D\leq m\), \(8Km\leq L\), and the layer-cardinality bound \(n\) through depth \(L\). Suppose the same unit vector obeys \(S(\text{positive prefix }i)\leq B_{\rm sh}\) for every \(0\leq i\leq L\). Put

\[ B=2S(X)+2B_{\rm sh}+6nD\log q. \]

Every terminal through horizon \(nm\) satisfies

\[ S(U),S(UY)\leq B_{\rm sh}+3nD\log q, \qquad 0\leq g_{\rm pre}\leq B. \]

For \(K{\gt}0\), every terminal-tree average satisfies \(0\leq G_{\rm pre}\leq B\), and the maximum over all terminal/band pairs, with zero inserted, satisfies \(0\leq g_{\max }\leq \max (0,B)\).

Proof ▶

The history prefix approximation gives nested matched prefixes with at most \(3nD\) changed sites. The accepted disjoint-union entropy cost and regional dimension bound yield the two entropy estimates. Subadditivity on \(X,U\) and \(X,UY\), purity on \(V\), and \(S(Y)\geq 0\) give the upper pre-entropy bound. Subadditivity on the disjoint near and far regions gives its lower bound. Nonnegative tree weights summing to one and division by \(K{\gt}0\) preserve the bound.

Theorem 44.17.5 The original source prefix input
✓

Fix \(q\geq 1\), a positive gap parameter \(g\), and a compact volume coefficient \(C_{\rm vol}\). At sufficiently large \(n\), uniformly before choosing the scanner, vectors, source entropy coefficient \(C_e\), or exponent \(\eta \), the preceding bounds hold with

\[ B_{\rm sh}=C_e(nL^\eta +n)+n^{-247} \]

whenever the original unit vector obeys \(S_\Omega (\text{positive prefix }i)\leq C_e(nL^\eta +n)\) for all \(0\leq i\leq L\), the compact prefix has volume at most \(C_{\rm vol}n^2\), and the unit vector \(\Omega _t\) obeys

\[ d_{\rm tr}(\Omega _t,\Omega ) \leq \sqrt{2\min (n^{-1000},g/4)/g}. \]
Proof ▶

Applying the accepted uniform positive-prefix entropy continuity theorem to the given vectors and every fixed prefix, followed by the terminal entropy bounds, establishes the inequalities without re-selecting any vector or terminal point.

The original positive-prefix input remains explicit; the source safe-box geometry must provide it. This section does not construct that geometric input or prove the final sublinear power estimate.

44.18 Physical collar information from the selected source point

The preceding source-selected comparison now bounds physical mutual information for the original state. The terminal entropy estimates eliminate its selected-point-dependent terms before taking the replica limit. The source target and positive-prefix entropy hypotheses, scanner geometry and round-step smallness remain explicit. The source is A two-dimensional area law from a global spectral gap, 08-scanner.tex, lines 868–911 and 936–941, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a.

Theorem 44.18.1 The scalar information expression
✓

For scalar data define

\[ F(S,c,B_{\rm pre},\log z,W,\tau ,\delta ,A,C) :=\frac{4S+4c-2\log z}{W} +\left(\tau +\frac{\delta }{\tau }\right) \bigl(2(S+c)+B_{\rm pre}\bigr)+A+2c+C. \]

Assume \(W,\tau {\gt}0\), \(\delta ,S,c,B_{\rm pre}\geq 0\), and

\[ \log d,S'\leq S+c,\qquad G_{\rm pre},g_{\max }\leq B_{\rm pre}. \]

If the sharp comparison is

\[ 2S'+G_{\rm pre}-G_{\rm post} \leq \frac{2(2\log d-\log z)}{W} +\tau G_{\rm pre}+2\tau \log d+A +\frac{\delta }{\tau }\max (0,2S'+g_{\max })+r \]

and the information bridge gives \(2I\leq 2S'+G_{\rm pre}-G_{\rm post}+2c+C\), then \(2I\leq F+r\).

Proof ▶

Monotonicity gives \(\max (0,2S'+g_{\max })\leq 2(S+c)+B_{\rm pre}\). Substituting the displayed estimates into the first, smoothing, and defect terms combines the two smoothing terms into \(\tau \bigl(2(S+c)+B_{\rm pre}\bigr)\), and adding the unchanged information correction gives \(2I\leq F+r\).

Theorem 44.18.2 The fixed-instance replica limit
✓

Keep all the physical and scalar data fixed. If \(r_k,u_k,l_k\to 0\) and eventually

\[ 2I\leq F\left(S,c,B_{\rm pre},\log z,W,\tau , \delta +\frac{r_k}{g/2},A,C\right) +\frac{2u_k}{W}+l_k, \]

then \(2I\leq F(S,c,B_{\rm pre},\log z,W,\tau ,\delta ,A,C)\).

Proof ▶

The right-hand side converges by continuity of addition, multiplication, and division by the fixed scalars, so passing the eventual real inequality to the limit gives the bound. No convergence of selected stages or parameters is needed, since the scalar right-hand side no longer depends on them. This is only the replica limit, with the physical size and weight already fixed.

Under the complete hypotheses of the stronger source-selected sharp energy theorem, enlarge its size threshold to include the uniform positive-prefix continuity threshold. Retain its same truncated vector \(\Omega _t\), typical spectral set \(E\), mass \(z\), selected dimension \(d\) and physical label sequence. Put

\begin{align*} S_t & =S_{\Omega _t}(X), & c & =n^{3/5}-\log z, \\ B_{\rm sh} & =C_e(nL^{e_{\rm box}}+n)+n^{-247}, & B_{\rm pre} & =2S_t+2B_{\rm sh}+6nD\log q, \\ C_{\rm MI} & =16\sqrt{d_{\rm tr}(\Omega _t,\Omega )} \log (e\dim \mathcal H_X). \end{align*}

For every \(1\leq W\leq n^\omega \) satisfying the original round-step smallness with \(a=W/K\), and every \(0{\lt}\tau \leq 1/2\), define

\[ A=(3+1/a)h(\tau )+37(C_0B)a-\frac{\log z}{a}. \]

Then the original-state collar information satisfies

\[ 2I_\Omega (X:S_0^c) \leq F(S_t,c,B_{\rm pre},\log z,W,\tau ,n^{-1/2000},A,C_{\rm MI}). \]

The fixed physical and round-step constants precede \(C_e\); \(C_e\) precedes the size threshold and the finite physical system. The state, spectral set and labels precede \(W\).

Proof ▶

Invoking the stronger source energy theorem once and transferring the original positive-prefix entropy input to its same vector, the scanner geometry gives \(0\leq G_{\rm pre}\leq B_{\rm pre}\) and \(g_{\max }\leq B_{\rm pre}\) from \(B_{\rm pre}\geq 0\), while the same selected spectrum gives \(\log d,S'\leq S_t+c\) and \(c\geq 0\).

For each sufficiently large replica count, using the very same selected stage and parameter that satisfy the sharp and stronger energy bounds keeps the parameter in the source consumer’s interval \([n^{-\nu },2n^{-\nu }]\), where it is never selected again. Applying the information bridge and the scalar substitution with defect bound \(n^{-1/2000}+r_k/(g/2)\) leaves precisely the same upper and lower sharp remainders, and sending all three remainders to zero with the physical system, \(W\), and \(\tau \) fixed gives the bound.

The final size-power estimate and its geometric application are separate. In particular, the source target and positive-prefix inputs are still hypotheses; no safe-box entropy theorem, Proposition 9.6 or full area law is claimed by this result.

44.19 Final sharp error absorption at the source parameters

The final collar calculation uses the fixed values in [ 286 ] , 08-scanner.tex, lines 839–942:

\begin{align} e_* & =\frac{2}{1000000}, & \mu & =\frac14, & \ell & =\frac1{100000}, & \omega & =\frac1{20000}, & \kappa & =\frac1{1000000}. \label{eq:final_scalar_parameters} \end{align}

The source target and prefix entropy estimates at exponent \(e_*\) are antecedents throughout this section. This calculation does not construct the preceding safe-box estimate.

Retain the scales

\begin{align} L & =\lfloor n^{1-\ell }\rfloor , & m & =\lfloor n^\mu \rfloor , & K & =\left\lfloor \frac{L}{8m}\right\rfloor , & W & =n^\omega , & a & =\frac WK, & \tau & =n^{-1/4000}. \label{eq:final_scalar_scales} \end{align}

There are fixed \(C_a\geq 1\) and \(N\geq 2\) such that, for all integers \(n\geq N\), one has \(K\geq 1\), \(a{\gt}0\), \(0{\lt}\tau \leq 1/2\), and

\begin{align} a & \leq C_a n^{-0.74994}, & a^{-1} & \leq n^{0.74994}. \label{eq:final_scalar_a} \end{align}

For \(n\geq 2\) and \(1-n^{-100}\leq z\leq 1\), \(z{\gt}0\), the mass estimate below holds. The binary estimate additionally assumes \(a{\gt}0\) and \(a^{-1}\leq n^{0.74994}\), as established above.

\begin{align} 0\leq -\log z & \leq 2n^{-100}, & (3+a^{-1})h(\tau ) & \leq 4n^{0.74969}(1+\log n/4000). \label{eq:final_scalar_mass_binary} \end{align}

The binary estimate uses \(h(t)\leq t(1-\log t)\) for \(0{\lt}t{\lt}1\).

Proof ▶

The existing lower bound for the rounded band count gives the first inequality in (127). For the second, \(n^\mu /2\leq m\) and \(8Km\leq L\leq n^{1-\ell }\) give \(K\leq n^{1-\ell -\mu }\). The negative logarithm is bounded by \(z^{-1}-1\leq 2n^{-100}\). Applying the same logarithmic inequality to \(1-t\) gives \(h(t)\leq t(1-\log t)\). Substitute \(\tau =n^{-1/4000}\) and (127).

Definition 44.19.2 Complete post-replica scalar error
✓

Set \(D=\lceil n^\kappa \rceil \), \(w=n^{3/5}\), \(c=w-\log z\), and

\begin{align} H & =4S_t+2c+2B_{\rm sh}+6nD\log q. \label{eq:final_scalar_H} \end{align}

With the final choices of \(W\) and \(\tau \), define

\begin{align} \mathcal E_n & =\frac{4S_t+4c-2\log z}{W} +(\tau +n^{-1/2000}/\tau )H +(3+a^{-1})h(\tau ) \notag \\ & \quad +37C_0\mathcal B a -\frac{\log z}{a}+2c+16\sqrt t\, d_X. \label{eq:final_scalar_error} \end{align}

Here \(t\) is the original-to-truncated trace distance and \(d_X=\log (e\dim \mathcal H_X)\). No far-region dimension occurs.

Fix nonnegative \(C_e,C_0,C_B,C_a,C_{\rm tr},C_{\dim }\) and \(\log q\). In addition to (127) and the selected-mass bounds, assume

\begin{align} S_t & \leq C_e n^{1+e_*}+n^{-247}, & B_{\rm sh} & \leq C_e(nL^{e_*}+n)+n^{-247}, \notag \\ \mathcal B & \leq C_B nD(\log n)^{12}, & t & \leq C_{\rm tr}n^{-500}, & d_X & \leq 1+C_{\dim }n^2. \label{eq:final_scalar_inputs} \end{align}

The complete error is at most

\begin{align} \mathcal E_n & \leq (4C_e+20)n^{0.999952} +2(8C_e+14+12\log q)n^{0.999752} \notag \\ & \quad +4n^{0.74969}(1+\log n/4000) +74C_aC_0C_B n^{0.250061}(\log n)^{12} \notag \\ & \quad +2n^{-99.25006}+6n^{0.6} +16\sqrt{C_{\rm tr}}(1+C_{\dim })n^{-248}. \label{eq:final_scalar_envelope} \end{align}

The decimal powers in this display denote exact terminating rationals, not numerical approximations.

Proof ▶

The source entropy inputs give \(S_t\leq (C_e+1)n^{1+e_*}\) and \(B_{\rm sh}\leq 2(C_e+1)n^{1+e_*}\). Also \(nD\leq 2n^{1+e_*}\) since \(\kappa \leq e_*\), and \(c\leq 3n^{3/5}\). These give the first two terms. The third is (128). The marginal bound and \(a\) upper bound give the fourth. The quantitative mass loss gives the fifth, while \(2c\) gives the sixth. Finally \(\sqrt t\leq \sqrt{C_{\rm tr}}n^{-250}\) and \(d_X\leq (1+C_{\dim })n^2\) give the trace correction.

For the fixed coefficients in (131), one threshold works for every remaining scalar datum at the rounded scales. With

\begin{align} C & =20C_e+62+24\log q +16\sqrt{C_{\rm tr}}(1+C_{\dim }), \label{eq:final_scalar_coefficient} \end{align}

it gives

\begin{align} \mathcal E_n & \leq Cn^{62497/62500} \leq Cn^{1-1/100000}. \label{eq:final_scalar_output} \end{align}

The exact maximal power is \(62497/62500=0.999952\). Its margin to \(1-1/100000\) is \(19/500000{\gt}0\).

Proof ▶

The binary logarithmic term and the marginal logarithmic term each become at most \(n^{62497/62500}\) after fixing their coefficients and enlarging the threshold. Every remaining exponent is at most \(62497/62500\). Adding their coefficients gives (133).

For fixed \(q\geq 1\), \(g{\gt}0\) and \(C_{\rm vol}\geq 0\), the source estimate

\begin{align} t & \leq \sqrt{2\min (n^{-1000},g/4)/g} \leq \sqrt{2/g}\, n^{-500} \label{eq:final_scalar_trace} \end{align}

is covered by \(C_{\rm tr}=\sqrt{2/g}\) in the preceding theorem. If \(|X|\leq C_{\rm vol}n^2\), its first-region dimension bound is covered by \(C_{\dim }=C_{\rm vol}\log q\). In addition, for fixed \(C_r\geq 0\) and \(c_t{\gt}0\), a uniform threshold gives

\begin{align} a\, \ell _q(\lceil C_r\log ^2n\rceil ) & \leq c_t. \label{eq:final_scalar_transport} \end{align}
Proof ▶

The first estimate follows by the monotonicity and product rules for the square root. The logarithmic-dimension estimate is \(\ell _q(\lceil C_r\log ^2n\rceil )\leq C_d\log ^4n\). Multiply it by \(a\leq C_an^{-0.74994}\) and absorb the fixed logarithmic factor into any strictly smaller negative power.

These are scalar implications. Applying them to the sharp comparison requires its same-point finite-copy inequalities and the entropy-to-information bridge. All replica remainders must first tend to zero with \(n,W,a,\tau \) and the physical instance fixed. The chosen round and interpolation parameter may vary with the replica count. No uniform replica rate in the system size is asserted. The earlier bootstrap recurrence and the safe-box source entropy antecedent remain separate obligations.

44.20 Original-state scanner entropy from safe boxes

Following A two-dimensional area law from a global spectral gap (08-scanner.tex, lines 353–357, 574–590, 641–667, and 828–844, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a), the entropy coverings of Lemma 9.4 now give the scanner’s original-state target and prefix inputs for a separated template. The safe-box estimate is needed only at the single exponent in use, without yet deriving the improved exponent of Proposition 9.5.

Fix \(q\geq 1\), an exponent \(e{\gt}0\) and a safe-box coefficient \(C_{\rm box}\geq 0\). There is \(C_e\geq 0\), chosen before every finite domain, unit vector, cut, safety parameter, template and collar scale, with the following property. Let \(T\) be a template with \(C_{\rm tpl}\geq 24\), separated from the cut at safety parameter \(D_0\geq 1\), and suppose

\[ S_\Omega (A\cap Q)\leq C_{\rm box}|Q|_{\rm side}^{1+e} \]

for every safe integer rectangle \(Q\). Then

\[ S_\Omega (A\cap T)\leq C_e n^{1+e},\qquad S_\Omega (Q_j)\leq C_e(nL^e+n) \quad (0\leq j\leq L\leq s_0,\ L\geq 1). \]

The same shell bound holds after replacing a complete prefix by all preceding depth rows and an arbitrary subset of the final row.

Proof ▶

The template scale and nonempty piece family imply \(s_0\leq n\). The safe dyadic coverings give core and shell coefficients

\[ C_{\rm core}=C_{\rm box}(18+4/(2^e-1)),\qquad C_{\rm shell}=C_{\rm box}(2+14/(2^e-1)). \]

With \(C_e=\max (0,C_{\rm core},C_{\rm shell},\log q)\) fixed before any instance and the vector held fixed throughout, the core bound \(C_{\rm core}ns_0^e\) is at most \(C_e n^{1+e}\), the shell estimate applies to the exact scanner region because the ambient-depth positive prefix equals \(A\cap (T_j\setminus T)\) (including \(j=0\)), and a partial last row contributes at most \(n\log q\leq C_en\).

Theorem 44.20.2 Physical entropy inputs conditional on the improved safe-box bound
✓

Fix \(q\geq 1\), \(D_0\geq 1\) and \(C_{\rm box}\geq 0\). Suppose the uniform safe-box function at fixed \(q,R,J,\Delta ,D_0\) satisfies \(F_{\rm box}(r)\leq C_{\rm box}r^{1+e_*}\) for all \(r\geq 1\), where \(e_*=2\cdot 10^{-6}\). One coefficient \(C_e\geq 0\), chosen before the finite physical system, gives the two displayed entropy inputs for every original gapped ground vector and every separated template target of a scanner whose depth is the ambient target distance. In particular one may use \(L=\lfloor n^{1-10^{-5}}\rfloor \) whenever \(1\leq L\leq s_0\).

Proof ▶

Without introducing a new ground vector, truncated-vector entropy, or replica or interpolation parameter, each safe-rectangle entropy is bounded by the supremum defining \(F_{\rm box}\) at its maximal side length, so the preceding theorem at \(e=e_*\) and the exact depth identification yield both displayed entropy bounds.

The improved safe-box bound remains an input. Its physical one-step bootstrap, the numerical scanner and geometric prerequisites not stated here, and the full Proposition 9.6 remain separate obligations.

44.21 Conditional final-scale physical information

Following A two-dimensional area law from a global spectral gap (08-scanner.tex, lines 353–357, 399–533 and 839–941, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a), the same-source physical information inequality and the final numerical absorption now compose. The resulting bound is conditional on the complete physical scanner hypotheses and the original target and positive-prefix entropy inputs; it neither constructs those inputs nor claims the full area law.

Theorem 44.21.1 The target dimension
✓

For a finite physical region \(X\) with local dimension \(q\geq 1\), if \(|X|\leq C_{\rm vol}n^2\), then

\[ \log (e\dim \mathcal H_X) \leq 1+(C_{\rm vol}\log q)n^2. \]
Proof ▶

Because the configuration dimension is \(q^{|X|}\), taking its logarithm and using \(\log q\geq 0\) together with the cardinality estimate yields the bound without any dependence on the dimension of the far region.

Fix \(q\geq 1\), an interaction radius \(R\), a norm bound \(J\geq 0\), a spectral gap \(\Delta {\gt}0\), a nonnegative quadratic target-volume coefficient \(C_T\), a positive scanner coefficient \(C_1\), an anchor-multiplicity bound \(m_{\rm anc}\) with \(3m_{\rm anc}\leq C_1\), and a tail power \(P\geq \nu \). There is a positive radius coefficient \(C_{\rm tr}\) such that, for every fixed nonnegative source entropy coefficient \(C_e\), there are constants \(C{\gt}0\) and \(N\geq 2\), chosen before the finite physical system, with the following property.

Let the original vector \(\Omega \) be a gapped ground state and let the given physical scanner have a nonempty ambient target and obey all the source graph, support-anchor, template-volume, ambient-depth, layer-cardinality, anchor-multiplicity and boundary-clearance hypotheses. Retain the scales

\[ r_0=\lceil C_{\rm tr}(\log n)^2\rceil ,\quad m=\lfloor n^\mu \rfloor ,\quad D=\lceil n^\kappa \rceil ,\quad L=\lfloor n^{1-\ell }\rfloor ,\quad K=L/(8m), \]

where the final division is natural-number division, together with \(n\geq N\), \(2r_0\leq D\), \(1\leq D\) and \(4D\leq m\). Put \(X=A\cap T\) and let \(S_0\) be the truncation set at depth \(L\). Assume the genuine original-state source entropy inputs

\[ S_\Omega (X)\leq C_e n^{1+e_{\rm box}},\qquad S_\Omega (\text{positive prefix }j) \leq C_e(nL^{e_{\rm box}}+n)\quad (0\leq j\leq L). \]

Then

\[ 2I_\Omega (X:S_0^c)\leq Cn^{62497/62500},\qquad 2I_\Omega (X:S_0^c)\leq Cn^{1-1/100000}. \]

In particular, the exact maximum exponent is \(0.999952\) and the displayed paper exponent is \(0.99999\).

Proof ▶

Invoking the same-source information theorem once provides \(X\subseteq S_0\), \(|S_0|\leq (C_T+1)n^2\), and the trace-distance bound, so the preceding dimension lemma applies with \(C_{\rm vol}=C_T+1\). Quantitative regional entropy continuity then gives

\[ S_{\Omega _t}(X)\leq C_e n^{1+e_{\rm box}}+n^{-247} \]

for the same truncated vector, while the original prefix input gives the already-derived shell bound with its unchanged \(n^{-247}\) error.

Setting \(W=n^\omega \) and \(\tau =n^{-1/4000}\), the uniform numerical scale theorem yields \(0{\lt}\tau \leq 1/2\) and the rounded per-band weight, which the round-step smallness theorem places in the required interval. Identifying the scalar right-hand side with the complete final error expression—including the selected mass, window, marginal bound, and original-state continuity correction—and applying the final source error bound at these data gives the exponents.

The same-source theorem has already taken the replica limit at fixed physical size, weight and smoothing parameter. This proof only applies the subsequent uniform size estimate; the two limits are not exchanged. The state, spectral window, label sequence and selected points are never reselected.

The scanner, geometric antecedents and source target/prefix entropy hypotheses have not been constructed here. Their safe-box application, the remaining geometric information telescope and the full area law stay outside the scope of this conditional final-scale bound.

44.22 Automatic rounded-scale admissibility

The physical final-scale theorem has a further specialization removing its three numerical separation hypotheses. The rounded definitions imply those inequalities uniformly at large size. This specialization retains every source geometry and target/prefix entropy hypothesis.

Theorem 44.22.1 The final scanner scales are admissible
✓

Fix \(C_r\geq 0\) and the final exponents \(\mu =1/4\), \(\kappa =1/1000000\) and \(\ell =1/100000\). There is one \(N\geq 2\) such that every integer \(n\geq N\), with

\[ r_0=\lceil C_r(\log n)^2\rceil ,\quad L=\lfloor n^{1-\ell }\rfloor ,\quad m=\lfloor n^\mu \rfloor ,\quad D=\lceil n^\kappa \rceil ,\quad K=L/(8m), \]

satisfies

\[ 2r_0\leq D,\qquad 1\leq D,\qquad 4D\leq m,\qquad 1\leq K,\qquad 8Km\leq L. \]

The division defining \(K\) is natural-number division.

Proof ▶

The accepted logarithmic-radius estimate gives \(2r_0\leq n^\kappa \) eventually, so the ceiling bound yields \(2r_0\leq D\), while the accepted rounded-scale separation and positive band-count estimates give the remaining inequalities on a common threshold because \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \).

The conditional final-scale physical information theorem holds without separately assuming \(2r_0\leq D\), \(1\leq D\) or \(4D\leq m\). Retain its original gapped ground state, floor and ceiling scales, scanner graph and support anchors, template-volume bound, ambient depth and layer bounds, anchor multiplicity, cut clearance, and source target/prefix entropy bounds. Then one constant \(C{\gt}0\) and one uniform threshold give

\[ 2I_\Omega (X:S_0^c)\leq Cn^{62497/62500},\qquad 2I_\Omega (X:S_0^c)\leq Cn^{1-1/100000}. \]

The radius coefficient is selected before the entropy coefficient; the final constant and size threshold precede every physical instance.

Proof ▶

With the radius coefficient and information constant of the conditional final-scale theorem and the maximum of its size threshold with the preceding numerical threshold, substituting the exact rounded-scale equalities into the original theorem for the same physical state and scanner yields the bound. No state, label or selected point is changed, and no limit is interchanged.

The source is A two-dimensional area law from a global spectral gap, 08-scanner.tex, lines 32–58 and 808–941, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a. The geometric and entropy inputs are still conditional; this is not Proposition 9.6 without additional hypotheses or the full area law.

44.23 Original-template information from a uniform safe-box bound

The physical scanner can now be constructed directly from the finite domain, cut and separated template. All scanner geometry and entropy antecedents are derived from accepted geometric results and one uniform safe-box estimate at the fixed improved exponent. The improved safe-box estimate itself remains a genuine analytic hypothesis.

Definition 44.23.1 The final template scanner
✓

For a finite domain \(\Lambda \), a cut \(A\), a nonempty ambient target \(T\), and fixed coefficients \(C_r,C_1\), use the history scanner with graph equal to the induced domain graph, depth equal to ambient sup-norm distance from \(T\), and each original interaction anchored at a chosen member of its nonempty admissible support. At size \(n\), use

\[ r_0=\lceil C_r(\log n)^2\rceil ,\quad m=\lfloor n^{1/4}\rfloor ,\quad D=\lceil n^{1/1000000}\rceil ,\quad L=\lfloor n^{1-1/100000}\rfloor ,\quad K=L/(8m), \]

with natural-number division in \(K\). No entropy, probability or geometric estimate is included as a field of this construction.

Theorem 44.23.2 The original template collar is the truncation set
✓

For every nonnegative integer \(L\), the truncation set of the constructed scanner is exactly

\[ S_0=A\cap T_L. \]

This identity requires no separation, scale or entropy estimate.

Proof ▶

The truncation set contains the sites of \(A\) at ambient depth at most \(L\). The ambient-depth sublevel theorem identifies these sites with the radius-\(L\) dilation of \(T\).

Fix the physical parameters \(q\geq 1\), \(R\), \(J\geq 0\), \(\Delta {\gt}0\), an integer safe-box clearance \(D_0\geq 1\), and \(C_{\rm tpl}\geq 24\). Suppose one fixed \(C_{\rm box}\geq 0\) satisfies the genuine uniform original-state safe-box estimate

\[ F_{\rm box}(r)\leq C_{\rm box}r^{1+e_*} \quad (r\geq 1),\qquad e_*=2\cdot 10^{-6}. \]

Then there are \(C{\gt}0\) and \(N\geq 2\), preceding every physical instance, such that the following holds. Let \(\Omega \) be an original gapped ground state on any finite induced domain \(\Lambda \), let \(A\) be any cut, and let \(T\) be a separated template with parameters \((n,s_0)\), \(n\geq N\) and \(L=\lfloor n^{1-1/100000}\rfloor \leq s_0\). For the regions \(X=A\cap T\) and \(S_0=A\cap T_L\),

\[ 2I_\Omega (X:S_0^c)\leq Cn^{62497/62500},\qquad 2I_\Omega (X:S_0^c)\leq Cn^{1-1/100000}. \]

No scanner, support-anchor choice, row count, multiplicity estimate, target/prefix entropy bound or auxiliary replica datum is assumed in this theorem.

Proof ▶

With the original interaction multiplicity \(\mu _R=2^{(1+2R(R+1))-1}\) and \(C_1=3\mu _R\) fixed independently of all entropy coefficients and physical instances, the anchor-fiber bound applies to the support-member anchors of the constructed scanner. For the radius coefficient from the physical source theorem, the uniform safe-box-to-template entropy theorem gives a single \(C_e\) before the domain, Hamiltonian, ground vector, cut, target, and collar.

The template scale inequality gives \(s_0\leq n\), and its cardinality bound gives \(|T|\leq 9ns_0\leq 9n^2\). The template layer bound gives at most \(n\) sites in every positive layer through \(L\). The final rounded-scale theorem gives \(2r_0\leq D\), \(4D\leq m\), \(K\geq 1\) and \(8Km\leq L\). Therefore \(8m\leq L\) and \(5r_0\leq L\), so

\[ 2L+10r_0\leq 4L\leq 4s_0\leq 4D_0s_0. \]

The strict template separation consequently yields the scanner’s strict cut-clearance condition. One maximum threshold precedes all physical instances.

Applying the conditional physical information theorem to this scanner and the two entropy estimates derived from the single safe-box input retains its state and all intermediate objects, and the exact region identity above converts the conclusion to the original template collar. The fixed-instance replica limit was taken in the preceding physical theorem; no new limit is introduced or exchanged.

The source is A two-dimensional area law from a global spectral gap, 08-scanner.tex, lines 32–58, 571–590 and 808–944, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a. The accepted cut and compact-volume packaging is unchanged. Proving the small safe-box exponent from the original physical hypotheses is still required before this can yield the unconditional source proposition.

44.23.1 Rough lower bounds for the scanner roots

The rough comparison of [ 286 ] uses a fixed per-band weight \(0{\lt}a\leq 1/2\), total weight \(W=aK\), and inverse exponent \(s=1/4\), retaining the same physical vector, auxiliary labels and energy across every fill and charge interpolation. Its terminal family consists of the completed histories through a fixed horizon together with the pre-charge histories before that horizon; writing \(Q_{jg}\) and \(Y_{jg}\) for the near and middle regions of terminal \(j\) in band \(g\) gives the far region \((Q_{jg}\cup Y_{jg})^c\).

Theorem 44.23.1.1 Scanner-root rough lower estimate at arbitrary weight
✓

Fix a finite physical domain, positive local and auxiliary dimensions \(q,d\), an interaction range and bound, a band count \(K\in \mathbb N\), and \(0{\lt}a\leq 1/2\). Put \(W=aK\). There are \(c,C_f\geq 0\) before the scanner, horizon, physical vectors, copy number, auxiliary label and interpolation parameter with the following property. Consider any collar scanner with \(K\) bands and \(m,M{\gt}0\). Let \(\widetilde H\) be the sum of its truncated energy terms, formed from the reference vector. Suppose \(\| \widetilde\Omega \| =1\), \(\gamma {\gt}0\), and

\begin{align} \widetilde H-e_0I & \succeq \gamma (I-|\widetilde\Omega \rangle \langle \widetilde\Omega |). \label{eq:actual_rough_weight_gap} \end{align}

Fix \(k{\gt}0\) and a nonzero prevector of norm at most one, invariant under simultaneous permutation of the copies and fixed by the same label \(\lambda \) on both auxiliary factors. For real \(S',\varepsilon \), assume \(2kS'-\varepsilon \leq 2\log \dim \lambda \) and set

\begin{align} r_k & =\log (k+1)+c\log (k+2)+a\varepsilon ,\notag \\ R_k & =\frac{K}{2k} \left(2|r_k|+C_f\log (k+2)+2\log 2+\log (3/2)\right). \label{eq:actual_rough_weight_remainder} \end{align}

At every fill or charge round before the chosen finite horizon and every real interpolation parameter, write \(\mathcal N_k\) for the squared filtered norm and \(\mu _k\) for the mean energy. The normalized filtered vector has norm one, \(\mathcal N_k{\gt}0\), and \(\delta _k=(\mu _k-e_0)/\gamma \geq 0\). For every \(0{\lt}\tau \leq 1/2\),

\begin{align} \frac W4\left[ 4S’-6\left(\tau \log d+\frac{h(\tau )}a\right) -3\frac{\delta _k}{\tau }\max \{ 0,2S’\} \right]-R_k & \leq -\frac{\log \mathcal N_k}{k}. \label{eq:actual_rough_weight_rate} \end{align}

Here \(h\) is the binary entropy; this is the augmented-coordinate form of the rough lower comparison in [ 286 , Section 8, lines 97–169 and 585–651 ] .

Proof ▶

The near and middle regions \(Q_{jg}\) and \(Y_{jg}\) are disjoint and satisfy \(Q_{jg}\cup Y_{jg}\subseteq Q_{j'h}\) whenever \(g{\lt}h\). Compressing to the simultaneous symmetric subspace via the symmetry isometry \(Z\) and forming the ordered band product \(M_k\) for the replica metric at parameter \(t=a/2\) gives the augmented-coordinate vectors

\begin{align} w_k & =M_k^{-1/4}Z^*\mathrm{pre}_k, & \mathcal N_k & =\| w_k\| ^2, & v_k & =Z\frac{w_k}{\| w_k\| }, \label{eq:actual_rough_lower_coordinates} \end{align}

whose mean energy under the physical replica mean Hamiltonian \(\widetilde H_k\) is \(\mu _k=\operatorname {Re}\langle v_k,\widetilde H_kv_k\rangle \), with the history tree and its conditional choices preserved inside the common terminal family.

Since \(a\leq 1/2\), we have \(4t=2a\leq 1\), so the rough lower comparison of Section 8 divided by \(k\) yields \(\mathcal N_k{\gt}0\), \(\| v_k\| =1\), the label loss \(a\varepsilon \) in (138), and the bracket in (139) with overall prefactor \(aK/4=W/4\), while (137) implies \(\delta _k\geq 0\).

Theorem 44.23.1.2 Vanishing remainder at a fixed band weight
✓

Fix \(K\in \mathbb N\) and real \(a,c,C_f,S'\). For a label sequence \(\lambda _k\), put \(\varepsilon _k=2|\log \dim \lambda _k-kS'|\) and, for \(k{\gt}0\), define

\begin{align} R_k^{(a)} & =\frac{K}{2k}\left( 2|\log (k+1)+c\log (k+2)+a\varepsilon _k| +C_f\log (k+2)+2\log 2+\log (3/2)\right). \label{eq:actual_rough_weight_label_remainder} \end{align}

If \(\log \dim \lambda _k-kS'=o(k)\), then \(R_k^{(a)}\to 0\). All coefficients and the label sequence are fixed in this limit.

Proof ▶

Because \(\log \dim \lambda _k-kS'=o(k)\), we have \(\varepsilon _k/k\to 0\) as \(k\to \infty \). Since \(\log (k+1)/k\), \(\log (k+2)/k\), and the constant terms divided by \(k\) also tend to zero, multiplying their combination by \(K/2\) gives \(R_k^{(a)}\to 0\).

Under the physical and gap hypotheses of Theorem 44.23.1.1, take the physical Schmidt–Bell prevector associated with a label sequence \(\lambda _k\) whose original-coordinate vectors are nonzero and have norm at most one for every \(k{\gt}0\), and assume \(\log \dim \lambda _k-kS'=o(k)\). The constants \(c,C_f\geq 0\) may be chosen before the scanner, reference and truncated vectors, label sequence and \(S'\), with the finite domain, dimensions, \(K\) and \(a\) already fixed.

Every fill and charge round before the full horizon \(nm\), at every real interpolation parameter and every \(k{\gt}0\), obeys (139) with remainder \(R_k^{(a)}\) from (141), with positive squared filtered norm, a unit normalized filtered vector, and nonnegative energy defect \(\delta _k\). For this label sequence, \(R_k^{(a)}\to 0\) uniformly over all rounds and interpolation parameters, so a single replica threshold suffices for any positive error tolerance.

Proof ▶

Because the coordinate isometry preserves nonvanishing and the Euclidean norm while the Schmidt–Bell construction provides simultaneous copy symmetry and the two auxiliary label projections, Theorem 44.23.1.1 applies with \(\varepsilon _k=2|\log \dim \lambda _k-kS'|\). Theorem 44.23.1.2 then gives \(R_k^{(a)}\to 0\), and because \(R_k^{(a)}\) is independent of the round and interpolation parameter, its convergence threshold is uniform across all of them.

The weight-four statements below are the specializations \(a=4/K\) and \(W=4\). Their hypothesis \(K\geq 8\) gives \(0{\lt}a\leq 1/2\).

Theorem 44.23.1.4 Scanner-root rough lower estimate
✓

Fix a finite physical site space, positive local and auxiliary dimensions \(q,d\), and a band count \(K\geq 8\). Put \(a=4/K\). There are \(c,C_f\geq 0\), chosen before the scanner, horizon, physical vectors, copy number, label and interpolation parameter, with the following property for every scanner with \(K\) bands and positive parameters \(m,M\). Let \(\widetilde H\) be the sum of its truncated energy terms, formed from the reference vector. Suppose the unit physical vector \(\widetilde\Omega \) satisfies

\begin{align} \widetilde H-e_0 I & \succeq \gamma \bigl(I-|\widetilde\Omega \rangle \langle \widetilde\Omega |\bigr), & \gamma & {\gt}0. \label{eq:actual_rough_lower_gap} \end{align}

Fix \(k{\gt}0\) and a nonzero prevector of norm at most one, fixed by simultaneous copy symmetry and the same auxiliary label \(\ell \) on both auxiliary factors. For real \(S'\) and \(\varepsilon \), assume \(2kS'-\varepsilon \leq 2\log \dim \ell \) and put

\begin{align} r_k & =\log (k+1)+c\log (k+2)+a\varepsilon ,\nonumber \\ R_k & =\frac{K}{2k} \left(2|r_k|+C_f\log (k+2)+2\log 2+\log (3/2)\right). \label{eq:actual_rough_lower_finite_remainder} \end{align}

At any fill or charge interpolation before the horizon, let \(\mathcal N_k\) be its squared filtered norm and \(\mu _k\) its mean energy. Its filtered vector has norm one, \(\mathcal N_k{\gt}0\), and \(\delta _k=(\mu _k-e_0)/\gamma \geq 0\). For every \(0{\lt}\tau \leq 1/2\),

\begin{align} 4S’-6\left(\tau \log d+\frac{h(\tau )}a\right) -3\frac{\delta _k}{\tau }\max \{ 0,2S’\} -R_k & \leq -\frac1k\log \mathcal N_k. \label{eq:actual_rough_lower_rate} \end{align}

No marginal-moment estimate or bound \(\delta _k\leq \tau \) is assumed.

Proof ▶

Since \(K\geq 8\), the weight \(a=4/K\) satisfies \(0{\lt}a\leq 1/2\). Applying Theorem 44.23.1.1 with \(W=aK=4\) sets the prefactor \(W/4\) to \(1\) and matches the remainder in (143).

Definition 44.23.1.5 The same-label rough lower remainder
✓

For a label sequence \(\ell _k\) and a real \(S'\), put \(\varepsilon _k=2|\log \dim \ell _k-kS'|\) and use this \(\varepsilon _k\) in (143).

Theorem 44.23.1.6 Label-defect entropy inequality
✓

For every \(k\), \(\varepsilon _k\geq 0\) and \(2kS'-\varepsilon _k\leq 2\log \dim \ell _k\).

Proof ▶

Use \(kS'-\log \dim \ell _k\leq |\log \dim \ell _k-kS'|\).

Theorem 44.23.1.7 Vanishing rough remainder and a common threshold
✓

If \(\log \dim \ell _k-kS'=o(k)\), then \(R_k\to 0\) for each fixed \(K,c,C_f\). For every \(\epsilon _{\rm rep}{\gt}0\), there is a threshold \(k_0\) such that \(R_k{\lt}\epsilon _{\rm rep}\) whenever \(k\geq k_0\). This threshold is independent of the round and its interpolation parameter.

Proof ▶

Setting \(a=4/K\) in Theorem 44.23.1.2 gives \(R_k\to 0\), which yields a common threshold \(k_0\) for every \(\epsilon _{\rm rep}{\gt}0\).

Theorem 44.23.1.8 Rough lower rate for the physical label sequence
✓

Under the scanner and gap hypotheses of Theorem 44.23.1.4, take the augmented physical replica prevector associated with a label sequence \(\ell _k\) whose original-coordinate vectors are nonzero and have norm at most one for every \(k{\gt}0\), and assume \(\log \dim \ell _k-kS'=o(k)\). The constants \(c,C_f\) can be fixed before the scanner and physical vector, with the finite dimensions and band count already fixed. Every fill and charge before the full horizon obeys (144) with this sequence and \(R_k\to 0\), where the normalized filtered vector and nonnegative energy defect are those in Theorem 44.23.1.4.

Proof ▶

Since \(K\geq 8\), the specialization \(a=4/K\) satisfies \(0{\lt}a\leq 1/2\) and \(aK/4=1\), so Theorem 44.23.1.3 yields the rate bound and \(R_k\to 0\) for the same label sequence and physical vectors.

In the physical application, the spectral index set \(E\) and the normalized Schmidt auxiliary vector \(\psi \) are chosen together with \(\widetilde\Omega \), and \(S'=S(\operatorname {Tr}_{\rm left} |\psi \rangle \langle \psi |)\); stating the estimate for arbitrary \(S'\) allows this entropy and the label-dimension asymptotic to be substituted without altering the physical data.

44.23.2 Fixed bootstrap scales and smallness of the step weight

The bootstrap in [ 286 ] fixes its geometric exponents once, before improving the current entropy exponent. The total metric weight is four. All collars, windows, separations and band counts below retain their original floor, ceiling and integer-division operations.

Definition 44.23.2.1 The fixed bootstrap scanner exponents
✓

Fix \(0{\lt}e_0{\lt}1\) and put

\begin{align} g_0 & =\frac{1-e_0}{2}, & \mu & =1-g_0, & \nu & =\frac{g_0}{1000},\nonumber \\ \ell & =\frac{\nu }{100}, & \kappa & =\min \{ \ell ,e_*/4\} , & W & =4. \label{eq:bootstrap_scanner_exponents} \end{align}

These are scanner exponents: \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), and \(\nu {\gt}0\). The auxiliary entropy exponent in this numerical datum is \(\mu \); the changing entropy exponent of the bootstrap is kept separate.

Proof ▶

Since \(0{\lt}g_0{\lt}1/2\) and \(0{\lt}\kappa \leq \ell =g_0/100000{\lt}g_0\), one has \(0{\lt}\kappa {\lt}\mu =1-g_0{\lt}1-\ell {\lt}1\). Positivity of \(\nu \) is immediate. Thus \(\mu \) also satisfies the auxiliary entropy-exponent conditions.

For any scanner exponent tuple, write

\begin{align} L_n & =\lfloor n^{1-\ell }\rfloor , & m_n & =\lfloor n^\mu \rfloor , & D_n & =\lceil n^\kappa \rceil ,\nonumber \\ K_n & =\left\lfloor \frac{L_n}{8m_n}\right\rfloor , & a_n & =\frac4{K_n}, & r_n & =\lceil C_r\log ^2 n\rceil . \label{eq:bootstrap_scanner_rounded_scales} \end{align}

The integer quotient defining \(K_n\) is used even at small sizes; the conclusions below only concern the sufficiently large regime where its denominator is positive. Let \(\ell _q(r)\) be the physical logarithmic-dimension bound.

Theorem 44.23.2.2 Fixed weight satisfies the smallness condition
✓

Fix any scanner exponent tuple, an integer \(q\geq 1\), a coefficient \(C_r\geq 0\) and a threshold \(c_t{\gt}0\). There is \(N\geq 2\), chosen before the system size or any finite physical data, such that every \(n\geq N\) satisfies \(K_n\geq 8\), \(a_n{\gt}0\) and

\begin{align} a_n\ell _q(r_n) & \leq c_t. \label{eq:fixed_weight_four_transport_smallness} \end{align}

No sharp-comparison exponent margin is assumed.

Proof ▶

The scanner inequalities give \(\alpha =1-\ell -\mu {\gt}0\). The rounded band count and physical dimension estimates yield fixed \(C_K,C_d{\gt}0\) with \(n^\alpha \leq C_KK_n\) and \(\ell _q(r_n)\leq C_d\log ^4n\) for large \(n\). Therefore

\begin{align} a_n\ell _q(r_n) & \leq 4C_KC_d\frac{\log ^4n}{n^\alpha } \longrightarrow 0. \label{eq:fixed_weight_four_transport_decay} \end{align}

The band count tends beyond every fixed integer, so one common threshold also ensures \(K_n\geq 8\), and convergence at the given positive \(c_t\) completes the proof.

Theorem 44.23.2.3 Generic rounded scanner admissibility
✓

Fix any scanner exponent tuple and \(C_r\geq 0\). There is \(N\geq 2\), before all finite physical data, such that every \(n\geq N\) satisfies

\begin{align} 2r_n & \leq D_n, & 1 & \leq D_n, & 4D_n & \leq m_n,\nonumber \\ 8 & \leq K_n, & 8K_nm_n & \leq L_n. \label{eq:scanner_rounded_admissibility} \end{align}
Proof ▶

The rounded logarithmic radius obeys \(2r_n=o(n^\kappa )\). Since \(0{\lt}\kappa {\lt}\mu \), the rounded power scales eventually satisfy \(1\leq D_n\) and \(4D_n\leq m_n\). Since \(\mu {\lt}1-\ell \), the rounded band count eventually exceeds seven. Finally, integer division gives \(8K_nm_n\leq L_n\) at every size, and taking a common threshold combines these estimates.

Specializing these two theorems to (145) yields the rough bootstrap’s numerical scale and scanner prerequisites. The physical state, entropy comparison, terminal-point selection and final bootstrap entropy absorption remain separate mathematical inputs.

44.23.3 Scanner geometry for weakly safe rectangles

Let \(Q\) be a nonempty integer rectangle, with maximal side length \(s\), measured in numbers of lattice sites. The geometric argument includes one-site-wide rectangles and singleton rectangles. For a cut \(A\) in an arbitrary finite induced domain, the physical target is \(A\cap Q\); it may be empty even though the ambient rectangle is not.

Definition 44.23.3.1 The rectangle scanner
✓

Fix scanner exponents and real coefficients \(C_r,C_1\). Put \(T=Q\cap \mathbb Z^2\) and \(n=\lceil 24s\rceil =24s\). Use the induced domain graph, the given cut \(A\), and ambient integer sup-norm depth from \(T\). Anchor each interaction support at one chosen member of that same nonempty support. Assign the original rounded scales

\begin{align} m & =\lfloor n^\mu \rfloor , & K & =\left\lfloor \frac{\lfloor n^{1-\ell }\rfloor }{8m}\right\rfloor , & D & =\lceil n^\kappa \rceil , & r_0 & =\lceil C_r\log ^2n\rceil _+. \label{eq:rectangle_bootstrap_scales} \end{align}

These are the data of the original finite-history collar scanner.

Theorem 44.23.3.2 Weak-rectangle scanner geometry
✓

Fix scanner exponents and \(C_r\geq 0\). There is a threshold \(N\geq 1\) before the finite domain, cut, rectangle, interaction range, charge coefficient and safety parameter, with the following property. Let \(s\geq N\) and \(D_0\geq 1\), and suppose the rectangle has strict clearance greater than \(D_0s\) from every endpoint of an edge crossing \(A\). For the scanner above and \(L=\lfloor n^{1-\ell }\rfloor \),

\begin{align} |T| & \leq n^2, & 1 & \leq L\leq s, & D_0L+L & \leq D_0s,\nonumber \\ |T_r\setminus T_{r-1}| & \leq n & & (1\leq r\leq L), & 2L+10r_0 & {\lt}\operatorname {dist}_\infty (t,z). \label{eq:rectangle_bootstrap_geometry} \end{align}

The last inequality holds for every \(t\in T\) and every cut endpoint \(z\). Every chosen anchor lies in its original support, and at most \(2^{(1+2R(R+1))-1}\) labels have a given anchor. The target is exactly \(A\cap Q\), the positive-depth prefix at every nonnegative integer \(j\) is exactly \(A\cap (Q^{+j}\setminus Q)\), and the truncation set at every \(L'\) is exactly \(A\cap Q^{+L'}\).

Proof ▶

The lower-left corner belongs to \(T\), and the product cardinality gives \(|T|\leq s^2\leq n^2\) independently of aspect ratio. For \(1\leq r\leq L\leq s\), the native rectangle layer bound gives \(|T_r\setminus T_{r-1}|\leq 4(s+2r)\leq 12s\leq n\). The rounded-clearance theorem gives \(1\leq L\leq s\), \(D_0L+L\leq D_0s\), and \(2L+10r_0\leq D_0s\) at one threshold uniform in \(D_0\), and combining its last inequality with the assumed weak safety gives the strict clearance. Unpacking an ambient cut endpoint gives its crossing edge and physical endpoint; the natural sup-norm distance equals the integer sup-norm distance after casting. The existing support count bounds the fibers of the chosen anchors. Finally, ambient depth sublevel sets are exactly ambient dilations, and the dilation of the native rectangle is exactly \(Q^{+j}\). These equalities give all three physical-region identities.

No template with stronger clearance is used. The same original physical entropy and dyadic shell estimates can now be applied to these exact regions. The entropy improvement, uniform current-exponent coefficient and box supremum are separate steps in the proof of [ 286 , Proposition 9.5 ] .

44.24 The physical rough safe-box bootstrap

The following construction uses the fixed bootstrap scales of the September 24 manuscript. Its input is a uniform safe-box estimate at the current exponent, and its conclusion is an improved exponent in the original state. The finite-dimensional replica limit is taken before changing the physical size. No sharp marginal-moment estimate is used.

Theorem 44.24.1 Generic physical charge-energy coefficient
✓

Fix a local dimension \(q\geq 1\), a scanner exponent tuple, a positive squared-logarithmic radius coefficient, a positive charge constant, a nonnegative target-volume coefficient, an anchor-multiplicity bound, a polynomial tail exponent, and the two round-energy coefficients. There are \(C\geq 1\), \(C_l\geq 0\) and \(N\) before every finite physical system, auxiliary dimension, replica vector, round and interpolation. Under the rounded scales and the domain, row, anchor and clearance hypotheses, for \(W\geq 0\) and a nonzero symmetric replica vector, the energy-error term is bounded by

\begin{align} C W^2 n^\ell D^2(\log n)^{C_l} \left((1-p)\left(\frac{Q}{KnD}\right)^{1/8} +(1-p)n^{-P}+p\right), \qquad 0{\lt}p{\lt}1. \label{eq:arealaw-generic-charge-cap} \end{align}

The bound uses the absolute value of the given round-energy coefficient. The existing all-time and old-prefix history estimates give the physical energy bound at these generic exponents.

Proof ▶

The physical history estimate bounds the energy error by a sum of a density term and a tail term. The logarithmic dimension estimate bounds both round-energy coefficients by \(C_d(\log n)^{C_l}\). The rounded-scale bound \(nD^2/(mK)\leq C_s n^\ell D^2\) and \(a=W/K\) then give (152) with \(C=C_sC_d\). All factors used in these comparisons are nonnegative.

Theorem 44.24.2 The same selected charge energy
✓

For positive physical and auxiliary dimensions, \(\Delta {\gt}0\) and total weight \(W\geq 0\), at any selected charge point the round-energy conclusion and the preceding coefficient cap imply \(E_{\rm def}\leq (e+\mathrm{cap}+r_k)/(g/2)\). The truncated eigenvalue \(e\), physical prevector, selected point and mean energy are unchanged. Nonnegativity of the energy-error integral justifies replacing its signed coefficient by its absolute value.

Proof ▶

The energy-error integral is nonnegative, so replacing the round-energy coefficient by its absolute value can only increase the numerator. Substituting the given coefficient cap and dividing by the positive normalized gap \(g/2\) gives the bound, with the point and its prevector remaining fixed.

Fix \(q\geq 1\), range \(R\), \(J\geq 0\), \(\Delta {\gt}0\), the nonnegative target-volume coefficient and positive charge constant with its anchor-multiplicity bound, and a real tail exponent. The truncation and round-energy constants are chosen before a scanner exponent tuple; the physical energy coefficients and size threshold are then chosen before every finite instance and current entropy input. Assume a nonempty ambient target and the graph, depth, rounded scales, rows, anchors and weak scanner clearance, and the original-state positive-prefix bound \(C_e(nL^\eta +n)\). The numerical radius and separation conditions are explicit here. For total weight four, \(K\geq 8\), and the round-step smallness condition, one truncated vector, typical spectral set and Schmidt–Bell label sequence yield a selected point in every fixed interval \(0{\lt}p_0{\lt}p_1{\lt}1\) for all large replica counts. That same point satisfies the endpoint density bound, the normalized-energy cap, and both rough norm comparisons. The upper, lower, endpoint and energy remainders vanish for the fixed physical instance. No improved entropy or low-energy point is claimed here.

Proof ▶

Constructing the truncated ground vector and its typical spectral window once and choosing one global Schmidt–Bell label sequence carries the original positive-prefix entropy bounds to this vector, so its rough upper estimate, endpoint estimate and rough lower estimate hold with remainders tending to zero. The charge selection theorem on \([p_0,p_1]\) together with the endpoint estimate bounds its density, and at this same selected point the generic coefficient bound combines with the round-energy inequality while restricting the two rough comparisons to this point without choosing a second vector, label sequence or interpolation parameter.

Theorem 44.24.4 Principal density at the selected point
✓

Fix the scanner tuple, \(q\geq 1\), \(C_e,C_t\geq 0\), \(C_1{\gt}0\) and a logarithmic exponent. One \(C_\delta {\gt}0\) and threshold precede every current \(e\geq \kappa \) and finite scalar instance. The current target, shell, selected-dimension and mass bounds, together with the rough endpoint numerator and logarithmic round-energy cap, give eventually

\begin{align} \frac{Q}{KnD} & \leq \delta , & \delta & =C_\delta \epsilon ^{-1} \left(n^{e-\mu }+a^{1/4}(\log n)^{C_{l,\delta }}\right), & a & =4/K, & \epsilon & =n^{-\nu }. \label{eq:arealaw-rough-principal-density} \end{align}

The replica remainder is absorbed only after the instance is fixed. Every proposition attached to the original selected point survives.

Proof ▶

The source rough-estimate bound and \(D\leq 2n^e\) bound the selected numerator by a constant times \(n^{1+e}\) plus its logarithmic term. Since \(m\geq n^\mu /2\), the non-remainder contribution is at most \(\delta /2\) after choosing \(C_\delta \). At the fixed physical instance, the remaining coefficient times the replica error tends to zero and is eventually at most \(\delta /2\). Keep the given selected point and all its other conclusions.

Theorem 44.24.5 Normalized selected energy at bootstrap scales
✓

Fix \(0{\lt}e_0{\lt}1\), nonnegative cap and density coefficients, real logarithmic exponents and a positive physical gap \(\gamma \). One threshold works for all \(e\leq e_0\). At the bootstrap scales, if \(0\leq \rho \leq \delta \), \(p\in [\epsilon ,2\epsilon ]\), \(p\leq 1\), and the truncated eigenvalue is at most \(n^{-1000}\), then the normalized selected cap is at most \((1+\gamma ^{-1})n^{-\nu /2}\). The physical application uses \(\gamma =g/2\) and retains \(r_k/\gamma \).

Proof ▶

From \(0\leq \rho \leq \delta \) and \(\epsilon \leq p\leq 2\epsilon \), the expression in parentheses in the cap is at most \(2(\delta ^{1/8}+\epsilon +n^{-100})\), so the principal energy estimate applies with coefficient \(2C/\gamma \). The eigenvalue term is at most \(\gamma ^{-1}n^{-\nu /2}\) because \(n^{-1000}\leq n^{-\nu /2}\) for \(n\geq 2\), and adding the two bounds gives the stated coefficient \(1+\gamma ^{-1}\).

Theorem 44.24.6 Restored additive entropy bound
✓

For \(e_*{\lt}e_0{\lt}1\), \(q\geq 1\) and \(C_e\geq 0\), one positive coefficient and size threshold work for every \(e_*{\lt}e\leq e_0\). They bound the exact typical-mass, whole-prefix, mismatch, binary-entropy and original-state continuity error by \(C n^{1+(1-\ell )e}\). The hypotheses include \(z{\gt}0\), \(z\geq 1-n^{-100}\) and \(0\leq \tau \leq 1\); the displayed sum keeps \(7(w-\log z)-\log z\) and the additional \(n^{-247}\) continuity error.

Proof ▶

For \(n\geq 2\), the mass estimate gives \(z\geq 1/2\), \(z^{-1}\leq 2\) and \(-\log z\leq 1\). The continuity errors are at most one. With \(C_b=8C_e+12\log q+30\), the complete sum is at most \(C_b(nL^e+nD+n^{3/5}+h(\tau )/a+1)\). The bootstrap comparison-sum estimate bounds this sum by \((5+\log 2/4)n^{1+(1-\ell )e}\) uniformly over the current exponent.

Fix \(e_*{\lt}e_0{\lt}1\), \(C_e\geq 0\) and the physical and geometric constants of the rough source theorem. There are positive \(C_r,C_{\rm out}\) and \(N\geq 2\) before every current \(e_*{\lt}e\leq e_0\) and finite system. Use the fixed bootstrap exponents, the rounded scales and the graph, target, depth, anchors, rows and clearance. If the original target entropy is at most \(C_e n^{1+e}\) and every original positive-depth prefix entropy is at most \(C_e(nL^e+n)\), then the same original target satisfies

\begin{align} S_\Omega (X) & \leq C_{\rm out}n^{1+(1-\ell (e_0))e}. \label{eq:arealaw-source-bootstrap-improvement} \end{align}
Proof ▶

With the round-step and rounded admissibility conditions verified, the physical rough source applies once, and the principal-density and energy estimates hold at its unchanged selected points. At fixed \(n\), setting \(\tau =n^{-\nu /4}\) and applying the two rough comparisons with the coefficient-three lower bound gives a relative loss of \(6(\tau +E_{\rm def}/\tau )\) with vanishing replica remainders. Substituting the typical auxiliary entropy after this limit and using continuity in the reverse direction to restore \(\Omega \), the restored additive bound gives the stated improved power.

Fix \(b{\gt}0\) and \(C_{\rm box}\geq 0\). One nonnegative \(C_e\) precedes every integer safety parameter \(D_0\geq 0\), finite state, weakly safe rectangle, row scale \(n\geq s\), collar \(1\leq L\leq s\), and current exponent \(e\geq b\). If \((D_0+1)L\leq D_0s\) and the same unit vector obeys the pointwise safe-box bound at this one exponent, then its target and all positive-depth prefixes obey the source bounds above. One may take \(C_e=C_{\rm box}(25+64/(2^b-1))\). This uses the weak-rectangle dyadic shell cover, including thin rectangles; it does not invoke template separation.

Proof ▶

The safe-box estimate bounds the target by \(C_{\rm box}s^{1+e}\). The weak-rectangle dyadic shell estimate bounds each positive prefix by \(C_{\rm box}(24+64/(2^e-1))sL^e\). Since \(e\geq b{\gt}0\), its coefficient is at most \(C_{\rm box}(24+64/(2^b-1))\). Since \(s\leq n\), enlarging this coefficient by \(C_{\rm box}\) gives the common target and prefix coefficient.

Theorem 44.24.9 Physical powers and the box supremum
✓

For \(q\geq 1\), a positive-scale uniform box bound at exponent \(1+e{\gt}0\) gives the corresponding entropy estimate for every original physical safe rectangle, including a possible zero-size case by its cardinal bound.

Proof ▶

If the rectangle size is positive, its entropy is one member of the family defining the box supremum at that size, so the assumed power bound applies there. At size zero the rectangle contains no sites, so its entropy is zero, as is its positive power.

Theorem 44.24.10 Bounded rectangle sizes
✓

Let \(q\geq 1\), \(C,p\geq 0\) and \(N\in \mathbb N\). If every safe original physical rectangle of size \(s\geq N\) has entropy at most \(Cs^p\), then for every \(r\geq 1\) the box supremum is at most \((C+N^2\log q+1)r^p\).

Proof ▶

At sizes at least \(N\), the assumed estimate and \(s^p\leq r^p\) for \(s\leq r\) bound the entropy by \(Cr^p\), while at smaller sizes the volume bound gives entropy at most \(N^2\log q\). Since \(r^p\geq 1\) for \(r\geq 1\) and \(p\geq 0\), both bounds are at most \((C+N^2\log q+1)r^p\), and taking the supremum over the same physical family completes the proof.

Fix \(q,R\in \mathbb N\) with \(q\geq 1\) and \(J,\Delta \in \mathbb R\). Write \(F_{\mathrm{box},D}\) for the safe-box entropy at safety parameter \(D\), with the same fixed physical parameters \(q,R,J,\Delta \). Let \(D\in \mathbb N\) satisfy \(D\geq 3\), and let \(C,p\geq 0\). Suppose that \(F_{\mathrm{box},D+1}(r)\leq Cr^p\) for every integer \(r\geq 1\). Then, for every integer \(r\geq 1\),

\begin{align} F_{\mathrm{box},D}(r) & \leq (4C+4\log q+1)r^p. \end{align}
Proof ▶

Fix a physical instance and a \(D\)-safe rectangle \(Q\) of size \(s\geq 2\), and put \(r=\lceil s/2\rceil \). Theorem 42.17.4, with \(M=2\), partitions \(Q\) into at most four disjoint child rectangles \(Q_i\) of size at most \(r\). Since \(D\geq 3\) and \(s\geq 2\), one has \((D+1)r\leq Ds\). Each child lies in \(Q\), so its points have distance greater than \(Ds\geq (D+1)\operatorname {size}(Q_i)\) from every cut endpoint. Thus each child is \((D+1)\)-safe.

The physical regions \(A\cap Q_i\) partition \(A\cap Q\). For the same normalized ground vector \(\Omega \) on the original domain, subadditivity and the assumed bound give

\begin{align} S_\Omega (A\cap Q) & \leq \sum _i S_\Omega (A\cap Q_i) \leq \sum _i Cs^p \leq 4Cs^p. \end{align}

Theorem 44.24.10 with coefficient \(4C\), exponent \(p\), and cutoff \(N=2\) incorporates the volume correction \(N^2\log q=4\log q\) for smaller sizes, and taking the supremum over the same physical family gives the asserted coefficient \(4C+4\log q+1\) at every positive integer scale.

Fix \(q\geq 1\), \(R\), \(J\geq 0\), \(\Delta {\gt}0\), \(e_*{\lt}e_0{\lt}1\) and \(C_{\rm box}\geq 0\). There is \(C{\gt}0\) before every \(e_*{\lt}e\leq e_0\) and every integer \(D_0\geq 1\) such that

\begin{align} F_{\rm box}(r) & \leq C_{\rm box}r^{1+e}\quad (r\geq 1) \quad \Longrightarrow \quad F_{\rm box}(r)\leq Cr^{1+(1-\ell (e_0))e}\quad (r\geq 1). \label{eq:arealaw-physical-box-step} \end{align}
Proof ▶

Applying the source improvement to the rectangle scanner with \(n=\lceil 24s\rceil =24s\), target-volume coefficient one and the derived anchor multiplicity, rounded sublinear growth gives the weak clearance \(2L+10r_0\leq D_0s\) and the shell safety bound, with the preceding shell coefficient fixed using \(b=e_*\). Since the improved exponent is between zero and two, conversion from \(n\) to \(s\) costs at most \(24^2\) uniformly in the current exponent, and extending over bounded sizes by the volume entropy estimate before taking the supremum yields the original-state bound.

Theorem 44.24.13 Physical safe-box bound at the fixed exponent
✓

For \(q\geq 1\), \(R\in \mathbb N\), \(J\geq 0\) and \(\Delta {\gt}0\), there is \(C{\gt}0\) before every integer \(D_0{\gt}2R+10\) and every positive integer \(r\) such that

\begin{align} F_{\rm box}(r) & \leq Cr^{1+e_*}, & e_* & =2\cdot 10^{-6}. \label{eq:arealaw-physical-box-fixed-exponent} \end{align}
Proof ▶

Once the genuine initial exponent \(0{\lt}e_0{\lt}1\) is obtained uniformly in the safety parameter, the established finite exponent iteration applies to the family indexed by integers \(D_0{\gt}2R+10\), using the quadratic volume estimate and the preceding physical one-step theorem. The latter is invoked only when a current exponent above \(e_*\) occurs. No fixed-exponent box estimate is an input of this argument.

For a real safety parameter \(D_0{\gt}2R+10\), write \(F_{\mathrm{box},D_0}(r)\) for the supremum in [ 286 , Section 3, before Proposition 3.3 ] , with this fixed safety parameter. The estimate in [ 286 , Proposition 9.5 ] is \(F_{\mathrm{box},D_0}(r)\leq Cr^{1+e_*}\) for every integer \(r\geq 1\), where \(e_*=2\cdot 10^{-6}\) and \(C\) depends only on \(q,R,J,\Delta \). The following gives its pointwise formulation, uniformly over all such real safety parameters.

Fix integers \(q\geq 1\) and \(R\geq 0\), a term norm bound \(J\geq 0\), and a gap \(\Delta {\gt}0\). There is \(C{\gt}0\), depending only on \(q,R,J,\Delta \), such that the following holds simultaneously for every real \(D_0{\gt}2R+10\).

Let \(\Lambda \subseteq \mathbb Z^2\) be any finite domain, let \(H\) be an interaction Hamiltonian of range \(R\) with term norms at most \(J\), and let \(\Omega \) be a normalized eigenvector of energy \(E_0\) satisfying the full-system projector-gap inequality with gap \(\Delta \). Let \(A\subseteq \Lambda \), and let \(Z\) be the endpoints of the edges of the induced lattice graph crossing \(A\). If \(Q\) is a product of two finite nonempty integer intervals and every \(t\in Q\) and \(z\in Z\) satisfy \(D_0\operatorname {size}(Q){\lt}\| t-z\| _\infty \), then

\begin{align} S_\Omega (A\cap Q) & \leq C\operatorname {size}(Q)^{1+e_*}, & e_* & =2\cdot 10^{-6}. \label{eq:arealaw-physical-real-box} \end{align}

Here size counts sites along the longer axis, and \(A\cap Q\) contains only physical sites of \(\Lambda \). Empty domains, empty cuts, empty physical intersections, disconnected domains, and domains with holes are permitted. If \(Z\) is empty, the safety condition is vacuous, agreeing with distance to the empty set being infinite.

Proof ▶

Put \(d=2R+10\). The integer safe-box estimate gives \(C_b{\gt}0\), depending only on \(q,R,J,\Delta \), such that \(F_{\mathrm{box},d+1}(r)\leq C_b r^{1+e_*}\) for every integer \(r\geq 1\). Since \(d\geq 3\), the safety comparison gives

\begin{align} F_{\mathrm{box},d}(r) & \leq C r^{1+e_*}, & C & =4C_b+4\log q+1{\gt}0. \label{eq:arealaw-physical-real-box-constant} \end{align}

This constant is chosen before \(D_0\) and every finite physical instance. A rectangle safe at real parameter \(D_0{\gt}d\) is also \(d\)-safe: for every \(t\in Q\) and \(z\in Z\), \(d\operatorname {size}(Q)\leq D_0\operatorname {size}(Q) {\lt}\| t-z\| _\infty \). For \(s=\operatorname {size}(Q)\geq 1\), the bound by the safe-box supremum for the same \(H,\Omega ,A,Q\) and (160) give \(S_\Omega (A\cap Q)\leq F_{\mathrm{box},d}(s) \leq Cs^{1+e_*}\).

To recover the supremum formulation, fix a real \(D_0{\gt}2R+10\) and an integer \(r\geq 1\). Every entropy in its defining family is bounded by \(Cs^{1+e_*}\leq Cr^{1+e_*}\), where \(s=\operatorname {size}(Q)\leq r\); here \(C{\gt}0\) and \(1+e_*{\gt}0\). Taking the supremum gives \(F_{\mathrm{box},D_0}(r)\leq Cr^{1+e_*}\), with the same constant uniformly in \(D_0\). Conversely, the supremum estimate at \(r=\operatorname {size}(Q)\geq 1\) bounds each admissible rectangle entropy and gives (159). Thus the two formulations have exactly the same uniformity and hypotheses.

Since \(e_*=2\cdot 10^{-6}\in (0,1)\), the same bound also proves [ 286 , Proposition 3.3 ] with \(e_0=e_*\). Its constant is chosen before every real \(D_0{\gt}2R+10\) and every finite physical instance. This recovers the full real-clearance conclusion of that proposition, without extending the integer-clearance recurrence.

The immutable source is Proposition 9.5 and its proof, lines 681–805. The collar bound is Theorem 39.9.9.

44.25 Original-template information from the physical bootstrap

The physical safe-box bootstrap discharges the sole fixed-exponent safe-box premise of the previously constructed template information theorem. This step adds no new scanner, entropy certificate or limiting argument. The physical source chain remains subject to validation and integration, and the existing cut and compact-volume packaging is unchanged.

Theorem 44.25.1 Physical original-template information
✓

Fix \(q,R,D_0\in \mathbb N\) and \(J,\Delta ,C_{\rm tpl}\in \mathbb R\) with

\[ q\geq 1,\qquad J\geq 0,\qquad \Delta {\gt}0,\qquad D_0{\gt}2R+10,\qquad C_{\rm tpl}\geq 24. \]

There are \(C{\gt}0\) and \(N\geq 2\), chosen before every finite instance, such that the following holds. For all natural \(n,s_0\) with \(n\geq N\), every finite induced domain \(\Lambda \), every local Hamiltonian with parameters \((q,R,J)\), every original gapped ground vector \(\Omega \) with gap \(\Delta \), every cut \(A\), and every template \(T\) with parameters \((C_{\rm tpl},n,s_0)\), assume the source conditions

\[ \operatorname {dist}_\infty (T,\partial A){\gt}4D_0s_0, \qquad L=\lfloor n^{1-1/100000}\rfloor \leq s_0. \]

Here the cut set is the ambient set of endpoints of edges crossing \(A\) in the induced domain. Set \(X=A\cap T\) and \(S_0=A\cap T_L\). Then

\[ 2I_\Omega (X:\Lambda \setminus S_0)\leq Cn^{62497/62500},\qquad 2I_\Omega (X:\Lambda \setminus S_0)\leq Cn^{1-1/100000}. \]

The same \(C,N\) apply to all the displayed finite data. The theorem does not assert that they are independent of the fixed \(D_0\) or \(C_{\rm tpl}\). No nonempty physical-core hypothesis is required.

Proof ▶

The physical safe-box theorem gives \(C_{\rm box}{\gt}0\), depending only on \(q,R,J,\Delta \), before every integer \(D_0{\gt}2R+10\) and every integer \(r\geq 1\), with

\[ \operatorname {boxEntropy}(q,R,J,\Delta ,D_0,r) \leq C_{\rm box}r^{1+e_*},\qquad e_*=2\cdot 10^{-6}. \]

Specialize this uniform bound to the fixed \(D_0\). The strict safety threshold implies \(D_0\geq 1\), and positivity gives \(C_{\rm box}\geq 0\). These are exactly the hypotheses needed by the conditional template information theorem.

Apply that theorem with the unchanged physical parameters and fixed template constant. It gives \(C,N\) before all finite data and returns both information powers on the original state and the template core and collar. No state replacement, exchange of limits, extra analytic premise or change to the rounded scales occurs here.

The source is A two-dimensional area law from a global spectral gap, 08-scanner.tex, Proposition 9.5, lines 681–805, and the information conclusion of Proposition 9.6, lines 808–944, at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a. This additive composition does not replace the existing Proposition 9.6 cut/volume packaging. It does not establish the repair-tree construction of Proposition 11.2 or the final area-law integration.

44.26 Local root channels and physical shell oscillations

Throughout this section, \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\) denotes the physical space, \(\mathcal K=\mathbb {C}^J\) the finite spectator space, and \(\mathcal A_K\) the site algebras of Section 28.11, with \(q{\gt}0\); the dimension of \(\mathcal K\) may be zero. Let \(k\) be a positive contraction on \(\mathcal H\), so \(0\le k\le \mathbb 1\). For a physical operator \(A\), write \(\widehat A=A\otimes \mathbb 1_{\mathcal K}\), and equip arbitrary complex operators \(B,C\) on \(\mathcal H\otimes \mathcal K\) with the Euclidean operator norm. For \(K\subseteq I\), the conditional expectation \(E_K\) retains the sites in \(K\) and averages those in \(I\setminus K\).

44.26.1 Localized square-root channels

Set \(k_K=E_K(k)\), and define the positive square roots

\begin{align} G & =(\mathbb 1-k)^{1/2}, & R & =k^{1/2}, \label{eq:al_shell_full_roots} \end{align}
\begin{align} G_K & =(\mathbb 1-k_K)^{1/2}, & R_K & =k_K^{1/2}. \label{eq:al_shell_local_roots} \end{align}

Extending the localized channels of [ 286 , Section 10 ] by the identity on the spectator, the full and localized channels are

\begin{align} \mathcal E(B) & =\widehat G B\widehat G+\widehat R B\widehat R, \label{eq:al_shell_full_channel} \end{align}
\begin{align} \mathcal E_K(B) & =\widehat G_K B\widehat G_K +\widehat R_K B\widehat R_K. \label{eq:al_shell_local_channel} \end{align}

By distributivity, \(\mathcal E(B-C)=\mathcal E(B)-\mathcal E(C)\) and \(\mathcal E_K(B-C)=\mathcal E_K(B)-\mathcal E_K(C)\).

The full and localized channels satisfy

\begin{align} \| \mathcal E(B)\| & \le \| B\| , \label{eq:al_shell_full_contraction} \end{align}
\begin{align} \| \mathcal E_K(B)\| & \le \| B\| , \label{eq:al_shell_local_contraction} \end{align}
\begin{align} \| \mathcal E_K(B)-B\| & \le 2\| B\| . \label{eq:al_shell_identity_bound} \end{align}
Proof ▶

Because the conditional expectation preserves the operator interval \([0,\mathbb 1]\), the square roots are self-adjoint and satisfy \(G^2+R^2=\mathbb 1=G_K^2+R_K^2\). The map \(V\psi =\widehat G\psi \oplus \widehat R\psi \) is therefore an isometry with \(\mathcal E(B)=V^\dagger (B\oplus B)V\), which yields (165). The same factorization for \(G_K\) and \(R_K\) gives (166), and the triangle inequality \(\| \mathcal E_K(B)-B\| \le \| \mathcal E_K(B)\| +\| B\| \) gives the third bound.

Suppose \(\| k-E_K(k)\| \le \varepsilon _K\) for a real number \(\varepsilon _K\). Then

\begin{align} \| \mathcal E(B)-\mathcal E_K(B)\| & \le 4\sqrt{\varepsilon _K}\, \| B\| . \label{eq:al_shell_localization_error} \end{align}

If also \(\| k-E_L(k)\| \le \varepsilon _L\), then

\begin{align} \| \mathcal E_K(B)-\mathcal E_L(B)\| & \le 4\bigl(\sqrt{\varepsilon _K}+\sqrt{\varepsilon _L}\bigr)\| B\| . \label{eq:al_shell_two_region_error} \end{align}

The sets \(K,L\) need not be nested. Both bounds are uniform over all finite spectator spaces.

Proof ▶

All four roots in (161) and (162) have norm at most one, and the square-root Hölder inequality gives \(\| G-G_K\| \le \sqrt{\varepsilon _K}\) and \(\| R-R_K\| \le \sqrt{\varepsilon _K}\). For any physical operators \(A,A'\), the algebraic decomposition

\begin{align} \widehat A B\widehat A-\widehat A’B\widehat A’ & =(\widehat A-\widehat A’)B\widehat A +\widehat A’B(\widehat A-\widehat A’) \label{eq:al_shell_root_difference} \end{align}

yields the norm estimate

\begin{align} \| \widehat A B\widehat A-\widehat A’B\widehat A’\| & \le (\| A\| +\| A’\| )\| A-A’\| \, \| B\| . \label{eq:al_shell_root_bound} \end{align}

Specializing (171) to the pairs \((G,G_K)\) and \((R,R_K)\) establishes (168), and the triangle inequality through \(\mathcal E(B)\) then gives (169), with \(\varepsilon _K,\varepsilon _L\ge 0\) by nonnegativity of the norm.

If \(B\) commutes with every \(\widehat C\) for \(C\in \mathcal A_K\), then \(\mathcal E_K(B)=B\). If an operator \(A\) on \(\mathcal H\otimes \mathcal K\) commutes with every such \(\widehat C\), then

\begin{align} [A,\mathcal E_K(B)] & =\mathcal E_K([A,B]). \label{eq:al_shell_commutator} \end{align}

In particular, every physical \(U\in \mathcal A_{I\setminus K}\) satisfies \([\widehat U,\mathcal E_K(B)] =\mathcal E_K([\widehat U,B])\).

Proof ▶

The operator \(k_K\) belongs to \(\mathcal A_K\). Functional calculus preserves commutation with the complementary algebra, so both \(G_K,R_K\) belong to \(\mathcal A_K\) as well. Under the first hypothesis,

\begin{align} \mathcal E_K(B) & =B(\widehat G_K^{\, 2}+\widehat R_K^{\, 2})=B. \label{eq:al_shell_commutant_fixed} \end{align}

Under the second hypothesis, commuting \(A\) past each root yields

\begin{align} [A,\widehat G_K B\widehat G_K] & =\widehat G_K[A,B]\widehat G_K. \notag \end{align}

The same identity holds for \(R_K\), and summing the two relations proves (172). Because operators supported on disjoint physical regions commute, the final assertion follows.

If \(y\notin K\), then \(d_y(\mathcal E_K(B))\le d_y(B)\).

Proof ▶

For every unitary \(U\in \mathcal A_{\{ y\} }\),

\begin{align} \| [\widehat U,\mathcal E_K(B)]\| & =\| \mathcal E_K([\widehat U,B])\| \le \| [\widehat U,B]\| \le d_y(B). \label{eq:al_shell_outside_commutator} \end{align}

Taking the supremum over \(U\), as in [ 286 , Section 10 ] , yields \(d_y(\mathcal E_K(B))\le d_y(B)\).

44.26.2 Differences of successive local channels

Definition 44.26.2.1 Local channel shells
✓

Following [ 286 , Section 10 ] , for any sequence of physical regions \((K_l)_{l\ge 0}\) with \(\mathcal E_l=\mathcal E_{K_l}\), define the local channel shells by

\begin{align} \Delta _0(B) & =\mathcal E_0(B)-B, \label{eq:al_shell_zero} \end{align}
\begin{align} \Delta _{l+1}(B) & =\mathcal E_{l+1}(B)-\mathcal E_l(B). \label{eq:al_shell_successor} \end{align}

Equivalently, \(\Delta _l=\mathcal E_l-\mathcal E_{l-1}\) with \(\mathcal E_{-1}=\mathrm{id}\), and distributivity gives \(\Delta _l(B-C)=\Delta _l(B)-\Delta _l(C)\).

For every sequence of regions, \(\| \Delta _0(B)\| \le 2\| B\| \). Fix \(l\ge 0\) and real numbers \(\varepsilon _{\rm next}, \varepsilon _{\rm prev}\) such that

\begin{align} \| k-E_{K_{l+1}}(k)\| & \le \varepsilon _{\rm next}, \label{eq:al_shell_next_error} \end{align}
\begin{align} \| k-E_{K_l}(k)\| & \le \varepsilon _{\rm prev}. \label{eq:al_shell_previous_error} \end{align}

Then

\begin{align} \| \Delta _{l+1}(B)\| & \le 4\bigl(\sqrt{\varepsilon _{\rm next}} +\sqrt{\varepsilon _{\rm prev}}\bigr)\| B\| . \label{eq:al_shell_successor_bound} \end{align}
Proof ▶

Evaluating (167) at \(K_0\) bounds the zeroth shell, while specializing (169) to the pair \((K_{l+1},K_l)\) bounds the successor shell.

Theorem 44.26.2.3 Shells vanish on the physical regional commutant
✓

Suppose the regions are increasing: \(K_l\subseteq K_m\) whenever \(l\le m\). If \(B\) commutes with \(\widehat A\) for every \(A\in \mathcal A_{K_l}\), then \(\Delta _l(B)=0\).

Proof ▶

For \(l=0\), the commutant-fixing identity gives \(\Delta _0(B)=B-B=0\). For \(l=m+1\), the inclusion \(\mathcal A_{K_m}\subseteq \mathcal A_{K_{m+1}}\) implies that both \(\mathcal E_m\) and \(\mathcal E_{m+1}\) fix \(B\), so their difference vanishes.

Suppose \((K_l)_{l\ge 0}\) is increasing. Then

\begin{align} \| \Delta _0(B)\| & \le 2\sum _{y\in K_0}d_y(B). \label{eq:al_shell_zero_oscillation} \end{align}

Fix \(l\ge 0\) and real numbers \(\varepsilon _{\rm next}, \varepsilon _{\rm prev}\) satisfying (177) and (178). Then

\begin{align} \| \Delta _{l+1}(B)\| & \le 4\bigl(\sqrt{\varepsilon _{\rm next}} +\sqrt{\varepsilon _{\rm prev}}\bigr) \sum _{y\in K_{l+1}}d_y(B). \label{eq:al_shell_successor_oscillation} \end{align}

These bounds hold for every finite spectator and every complex operator \(B\), without a Hermiticity assumption.

Proof ▶

Following the commutant-averaging argument of [ 286 , Section 10 ] , let \(m\) be a shell index and let \(\eta \ge 0\) be a coefficient from Theorem 44.26.2.2 satisfying \(\| \Delta _m(C)\| \le \eta \| C\| \) for every \(C\). Averaging the physical sites in \(K_m\) while leaving the spectator untouched produces \(\overline B=E_{I\setminus K_m}^{\mathcal K}(B)\), for which Theorems 28.11.2.3 and 28.11.2.9 give, for every \(A\in \mathcal A_{K_m}\),

\begin{align} [\overline B,\widehat A] & =0, \label{eq:al_shell_averaged_commutant} \end{align}
\begin{align} \| B-\overline B\| & \le \sum _{y\in K_m}d_y(B). \label{eq:al_shell_averaging_error} \end{align}

Hence \(\Delta _m(\overline B)=0\), and linearity of \(\Delta _m\) yields

\begin{align} \| \Delta _m(B)\| & =\| \Delta _m(B-\overline B)\| \le \eta \| B-\overline B\| \le \eta \sum _{y\in K_m}d_y(B). \label{eq:al_shell_oscillation_bound} \end{align}

Setting \(\eta =2\) for \(m=0\) and the nonnegative value \(\eta =4(\sqrt{\varepsilon _{\rm next}} +\sqrt{\varepsilon _{\rm prev}})\) for \(m=l+1\) yields both bounds.

44.27 Component support and full-channel oscillation

Let \(G\) be a graph on a finite set \(I\), with extended graph distance \(d_G:I\times I\to \mathbb {N}\cup \{ \infty \} \). Fix an anchor \(a\in I\) and write \(C(a)=\{ x\in I:d_G(a,x){\lt}\infty \} \) and \(N_l(a)=\{ x\in I:d_G(a,x)\le l\} \). Let \(R_a\) be the maximum distance from \(a\) to a vertex in \(C(a)\), or equivalently the maximum over all vertices after assigning zero to the distance from \(a\) to an unreachable vertex. All distances are measured in \(G\) itself; when \(G\) is an induced-domain graph, no ambient distance is substituted.

The balls \(N_l(a)\) increase with \(l\). Every \(n\ge R_a\) satisfies \(N_n(a)=C(a)\). If \(d_G(a,y)=\infty \), then \(y\notin N_n(a)\) for every finite \(n\).

Proof ▶

The implication \(d_G(a,x)\le m\le n\Rightarrow d_G(a,x)\le n\) gives monotonicity of \(N_l(a)\). Membership in a finite ball implies finite distance and hence reachability from \(a\); conversely, every reachable vertex \(x\in C(a)\) satisfies \(d_G(a,x)\le R_a\le n\), whereas an infinite distance cannot be bounded by any natural number.

Let \(q{\gt}0\), \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\), and let \(\mathcal K=\mathbb {C}^J\) for a finite set \(J\). For a physical operator \(A\), put \(\widehat A=A\otimes \mathbb 1_{\mathcal K}\). Write \(E_X\) for the normalized partial-trace expectation onto \(X\subseteq I\), as in Definition 28.9.15. For a positive contraction \(k\) on \(\mathcal H\), define its root channel by

\begin{align} \mathcal E_k(B) & =\widehat{\sqrt{1-k}}\, B\, \widehat{\sqrt{1-k}} +\widehat{\sqrt{k}}\, B\, \widehat{\sqrt{k}}. \label{eq:qc_component_root_channel} \end{align}

The local channels are \(\mathcal E_{k,l}=\mathcal E_{E_{N_l(a)}(k)}\). Their shells are \(\Delta _0=\mathcal E_{k,0}-\mathrm{id}\) and \(\Delta _{l+1}=\mathcal E_{k,l+1}-\mathcal E_{k,l}\).

Every physical operator \(A\) supported on \(C(a)\) satisfies \(E_{N_n(a)}(A)=A\) and \(\| A-E_{N_n(a)}(A)\| =0\) for \(n\ge R_a\). In particular, if \(k\) is a positive contraction supported on \(C(a)\), then \(\mathcal E_{k,n}(B)=\mathcal E_k(B)\) and \(\Delta _{n+1}(B)=0\) for all \(n\ge R_a\) and all \(B\). The same radius works for every observable.

Proof ▶

For \(n\ge R_a\), the ball \(N_n(a)\) equals \(C(a)\), so \(E_{N_n(a)}\) fixes every operator supported on \(C(a)\). Substituting \(E_{N_n(a)}(k)=k\) into (185) identifies \(\mathcal E_{k,n}\) with \(\mathcal E_k\), which makes both terms in \(\Delta _{n+1}(B)\) equal to \(\mathcal E_k(B)\).

For a real sequence \(\varepsilon _l\), put \(b_0=2\) and \(b_{l+1}=4(\sqrt{\varepsilon _{l+1}}+\sqrt{\varepsilon _l})\). Write \(d_y(B)\) for the physical-site oscillation of Definition 28.11.1.1.

As the finite-radius consequence of component support in [ 286 ] before choosing a decaying error bound, suppose \(0\le k\le 1\), \(k\) is supported on \(C(a)\), and \(n\ge R_a\). If \(\| k-E_{N_l(a)}(k)\| \le \varepsilon _l\) for every \(l\le n\), then

\begin{align} \label{eq:qc_component_increment} d_y(\mathcal E_k(B)) & \le d_y(B)+2\sum _{0\le l\le n,\ d_G(a,y)\le l} b_l\sum _{z\in N_l(a)}d_z(B). \end{align}
Proof ▶

Applying Theorem 44.28.2.4 to the increasing regions \(N_l(a)\) bounds \(d_y(\mathcal E_{k,n}(B))\) by the right-hand side of (186). Component localization then identifies \(\mathcal E_{k,n}\) with \(\mathcal E_k\), while the condition \(y\in N_l(a)\) is \(d_G(a,y)\le l\).

If \(0\le k\le 1\), \(k\) is supported on \(C(a)\), and \(d_G(a,y)=\infty \), then \(d_y(\mathcal E_k(B))\le d_y(B)\).

Proof ▶

At radius \(R_a\), the local channel \(\mathcal E_{k,R_a}\) equals the full channel \(\mathcal E_k\) and \(y\notin N_{R_a}(a)\). By Theorem 44.26.1.5, \(\mathcal E_{k,R_a}\) commutes with on-site unitary conjugation at \(y\), and its contractivity bounds each resulting commutator by its original norm, so taking the supremum over unitaries at \(y\) gives \(d_y(\mathcal E_k(B))\le d_y(B)\).

44.28 Finite channel oscillation bounds

Throughout this section, \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\) (with \(q{\gt}0\)) denotes the physical space and \(\mathcal K=\mathbb {C}^J\) the arbitrary finite spectator space of Section 44.26; the dimension of \(\mathcal K\) may be zero. Fix a positive contraction \(0\le k\le \mathbb 1\) on \(\mathcal H\) and increasing regions \((K_l)_{l\ge 0}\), so \(K_l\subseteq K_m\) whenever \(l\le m\). Write \(\mathcal E_l=\mathcal E_{K_l}\) for the localized root channel of Definition 44.26.1.1, \(\Delta _l\) for its shells from Definition 44.26.2.1, and \(d_y\) for the site oscillation of Definition 28.11.1.1 at \(y\in I\). Every operator \(B\) on \(\mathcal H\otimes \mathcal K\) is an arbitrary complex matrix, without a Hermiticity assumption, equipped with the Euclidean operator norm.

44.28.1 Initial oscillation from physical support

For a physical region \(S\subseteq I\), write \(\mathcal A_S\) for the physical operators supported on \(S\). Let \(E_S^{\mathcal K}\) be the expectation of Definition 28.11.2.1, which retains \(S\) and leaves both spectator indices unchanged. For \(a,b\in J\), write \(B_{ab}\) for the physical matrix with entries \((B_{ab})_{\sigma ,\tau }=B_{(\sigma ,a),(\tau ,b)}\).

Theorem 44.28.1.1 Physical support and spectator expectation
✓

For every region \(S\subseteq I\),

\begin{align} E_S^{\mathcal K}(B)=B & \quad \Longleftrightarrow \quad \forall a,b\in J,\ B_{ab}\in \mathcal A_S. \label{eq:al_propagation_support_fixed} \end{align}

This equivalence remains valid for matrices with an arbitrary spectator index set \(J\).

Proof ▶

By (27), the fixed-point condition is equivalent to \(E_S(B_{ab})=B_{ab}\) for every \(a,b\in J\). Each \(E_S(B_{ab})\) belongs to \(\mathcal A_S\), proving the forward implication. Conversely, \(E_S\) fixes every matrix in \(\mathcal A_S\), so equality holds in every matrix entry.

Suppose \(B_{ab}\in \mathcal A_S\) for every \(a,b\in J\). If \(y\notin S\), then \(d_y(B)=0\).

Proof ▶

Theorem 44.28.1.1 gives \(E_S^{\mathcal K}(B)=B\). Every \(U\in \mathcal A_{\{ y\} }\) belongs to \(\mathcal A_{I\setminus S}\), hence \([B,\widehat U]=[E_S^{\mathcal K}(B),\widehat U]=0\) by Theorem 28.11.2.3. Theorem 28.11.1.4 now gives \(d_y(B)=0\).

Theorem 44.28.1.3 Initial oscillation bounded by the support indicator
✓

As the initial support estimate of [ 286 , Section 10 ] for arbitrary finite spectators and arbitrary complex \(B\), suppose \(B_{ab}\in \mathcal A_S\) for every \(a,b\in J\). For every \(y\in I\),

\begin{align} d_y(B) & \le 2\| B\| \mathbf1_S(y), \label{eq:al_propagation_support_indicator} \end{align}

where \(\mathbf1_S(y)\) is one on \(S\) and zero outside \(S\).

Proof ▶

When \(y\in S\), Theorem 28.11.1.2 gives \(d_y(B)\le 2\| B\| \); when \(y\notin S\), both sides of (188) vanish by Theorem 44.28.1.2.

44.28.2 Coefficients from the localization errors

Definition 44.28.2.1 Shell coefficients from localization errors
✓

For a real sequence \((\varepsilon _l)_{l\ge 0}\), define

\begin{align} \eta _0 & =2, \label{eq:al_propagation_coefficient_zero} \end{align}
\begin{align} \eta _{l+1} & =4\bigl(\sqrt{\varepsilon _{l+1}} +\sqrt{\varepsilon _l}\bigr). \label{eq:al_propagation_coefficient_successor} \end{align}

Here the square root of a negative real number is interpreted as zero. Every localization-error inequality below forces its error bound to be nonnegative at the radius in question.

Theorem 44.28.2.2 Nonnegativity of the shell coefficients
✓

For every real sequence \((\varepsilon _l)\) and every \(l\ge 0\), the coefficient \(\eta _l\) is nonnegative.

Proof ▶

The zeroth coefficient is two, and each successor coefficient is four times a sum of nonnegative square roots.

Fix \(l\in \mathbb {N}\) and a real sequence \((\varepsilon _j)\). Suppose that, for every integer \(j\) with \(0\le j\le l\),

\begin{align} \| k-E_{K_j}(k)\| & \le \varepsilon _j. \label{eq:al_propagation_finite_error} \end{align}

Then

\begin{align} \| \Delta _l(B)\| & \le \eta _l\sum _{z\in K_l}d_z(B). \label{eq:al_propagation_finite_shell} \end{align}

In particular, if \(\| k-E_{K_j}(k)\| =0\) for every \(0\le j\le L\), then \(\Delta _j(B)=0\) for \(1\le j\le L\). The zeroth shell still has coefficient \(\eta _0=2\).

Proof ▶

For \(l=0\), the bound follows directly from (180), with \(\eta _0\) defined independently of the errors. For \(l=m+1\), combining the error inequalities at \(m+1\) and \(m\) in (181) yields the bound with coefficient (190); when both errors vanish, this coefficient is zero and the shell has norm zero.

As the finite-radius one-event estimate underlying [ 286 , Section 10 ] , fix \(n\in \mathbb {N}\), \(y\in I\), and a real sequence \((\varepsilon _l)\). Suppose that \(\| k-E_{K_l}(k)\| \le \varepsilon _l\) for every integer \(l\) with \(0\le l\le n\). Then

\begin{align} \label{eq:al_propagation_finite_increment} d_y(\mathcal E_n(B)) & \le d_y(B)+2\sum _{0\le l\le n,\ y\in K_l} \eta _l\sum _{z\in K_l}d_z(B), \end{align}

where every regional sum is evaluated on the original operator \(B\).

Proof ▶

Set \(a_l=\eta _l\sum _{z\in K_l}d_z(B)\ge 0\) and proceed by induction on \(n\). If \(y\notin K_n\), then \(d_y(\mathcal E_n(B))\le d_y(B)\) by Theorem 44.26.1.5, and the nonnegative sum in (193) preserves this inequality. At \(n=0\) with \(y\in K_0\), decomposing \(\mathcal E_0(B)=B+\Delta _0(B)\) yields

\begin{align} d_y(\mathcal E_0(B)) & \le d_y(B)+d_y(\Delta _0(B))\le d_y(B)+2a_0. \label{eq:al_propagation_increment_zero} \end{align}

For the successor step with \(y\in K_{n+1}\), the decomposition \(\mathcal E_{n+1}(B)=\mathcal E_n(B)+\Delta _{n+1}(B)\) gives

\begin{align} d_y(\mathcal E_{n+1}(B)) & \le d_y(\mathcal E_n(B))+2\| \Delta _{n+1}(B)\| \le d_y(\mathcal E_n(B))+2a_{n+1}. \label{eq:al_propagation_increment_step} \end{align}

Restricting the error assumptions to radii at most \(n\) and applying the induction hypothesis to the first term in (195) adds the contribution of \(n+1\) to the filtered sum.

44.28.3 Stretched-exponential localization errors

Theorem 44.28.3.1 Explicit stretched-exponential shell coefficients
✓

Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\). Set \(\varepsilon _l=C\exp (-cl^\alpha )\) and

\begin{align} A & =2+8\sqrt C\exp (c/2), & b & =c/2. \label{eq:al_propagation_exp_constants} \end{align}

For every \(l\in \mathbb {N}\),

\begin{align} \eta _l & \le A\exp (-bl^\alpha ). \label{eq:al_propagation_exp_coefficient} \end{align}
Proof ▶

The identity \(\sqrt{C\exp (-cl^\alpha )} =\sqrt C\exp (-bl^\alpha )\) rewrites each successor coefficient. Since \(0{\lt}\alpha \le 1\), one has \((l+1)^\alpha \le l^\alpha +1\), and therefore

\begin{align} \exp (-bl^\alpha ) & \le \exp (b)\exp (-b(l+1)^\alpha ). \label{eq:al_propagation_exp_previous} \end{align}

Combining \(1\le \exp (b)\) and (198) for the two square roots in (190) gives

\begin{align} \eta _{l+1} & \le 8\sqrt C\exp (b)\exp (-b(l+1)^\alpha ) \le A\exp (-b(l+1)^\alpha ). \label{eq:al_propagation_exp_successor} \end{align}

At radius zero, \(0^\alpha =0\) and \(\eta _0=2\le A\), proving (197) there as well.

Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\), and take \(A,b\) from (196). Fix \(l\in \mathbb {N}\). Suppose that, for every integer \(j\) with \(0\le j\le l\),

\begin{align} \| k-E_{K_j}(k)\| & \le C\exp (-cj^\alpha ). \label{eq:al_propagation_exp_error} \end{align}

Then

\begin{align} \| \Delta _l(B)\| & \le A\exp (-bl^\alpha )\sum _{z\in K_l}d_z(B). \label{eq:al_propagation_exp_shell} \end{align}
Proof ▶

Specializing (192) to \(\varepsilon _j=C\exp (-cj^\alpha )\) and bounding its coefficient by (197) using \(\sum _{z\in K_l}d_z(B)\ge 0\) yields the estimate.

Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\), and take \(A,b\) from (196). Fix \(n\in \mathbb {N}\) and \(y\in I\). Suppose that \(\| k-E_{K_l}(k)\| \le C\exp (-cl^\alpha )\) for every integer \(l\) with \(0\le l\le n\). Then

\begin{align} \label{eq:al_propagation_exp_increment} d_y(\mathcal E_n(B)) & \le d_y(B)+2\sum _{0\le l\le n,\ y\in K_l} A\exp (-bl^\alpha )\sum _{z\in K_l}d_z(B). \end{align}

The estimate holds uniformly over all finite spectators and all complex operators \(B\) under the stated finite set of error bounds.

Proof ▶

Specializing (193) to \(\varepsilon _l=C\exp (-cl^\alpha )\) and multiplying (197) by the nonnegative sum \(\sum _{z\in K_l}d_z(B)\) at each radius with \(0\le l\le n\) and \(y\in K_l\) yields the bound.

44.28.4 The full channel on an anchor component

With the graph notation of Section 44.27, \(G\) is a simple graph on \(I\), \(a\in I\) is an anchor, \(d_G\) is the extended graph distance, \(C(a)\) is the connected component of \(a\), and \(N_l(a)=\{ z\in I:d_G(a,z)\le l\} \). Write \(R_a\) for the maximum distance from \(a\) to a vertex in \(C(a)\) (or equivalently the maximum over all vertices after assigning zero distance to unreachable vertices), and let \(\mathcal E_k\) be the full root channel in (185).

Suppose \(0\le k\le \mathbb 1\) and \(k\in \mathcal A_{C(a)}\). Let \(C\ge 0\), \(c{\gt}0\), \(0{\lt}\alpha \le 1\), and take \(A,b\) from (196). Fix an integer \(n\ge R_a\). Suppose that \(\| k-E_{N_l(a)}(k)\| \le C\exp (-cl^\alpha )\) for every integer \(l\) with \(0\le l\le n\). Then, for every \(y\in I\),

\begin{align} \label{eq:al_propagation_graph_increment} d_y(\mathcal E_k(B)) & \le d_y(B)+2\sum _{0\le l\le n,\ d_G(a,y)\le l} A\exp (-bl^\alpha )\sum _{z\in N_l(a)}d_z(B). \end{align}

All regional sums use the original operator \(B\).

Proof ▶

Applying Theorem 44.28.3.3 to the increasing regions \(K_l=N_l(a)\) and using exact component localization \(\mathcal E_{N_n(a)}(B)=\mathcal E_k(B)\) from Theorem 44.27.2 (valid since \(n\ge R_a\) and \(k\in \mathcal A_{C(a)}\)) yields (202) with \(\mathcal E_k(B)\) on the left, and rewriting \(y\in N_l(a)\) as \(d_G(a,y)\le l\) gives the stated bound.

44.28.5 Finite families of channel events

Let \(F\) be a finite set of event labels, with an anchor \(a_i\in I\) for each \(i\in F\). The anchors need not be distinct. For \(l\in \mathbb {N}\) and \(y,z\in I\), set

\begin{align} \label{eq:al_propagation_ball_count} m_l(y,z) & =\bigl|\{ i\in F:y,z\in N_l(a_i)\} \bigr|. \end{align}

This counts labels, so distinct labels at the same anchor contribute separately.

Theorem 44.28.5.1 Finite shell sums as counts of labels
✓

Let \((w_l)_{l\ge 0}\) be any real sequence and let \((v_z)_{z\in I}\) be any family of real numbers. For every \(n\in \mathbb {N}\) and \(y\in I\),

\begin{align} \label{eq:al_propagation_shell_count} \sum _{i\in F}\sum _{0\le l\le n,\ d_G(a_i,y)\le l} w_l\sum _{z\in N_l(a_i)}v_z & =\sum _{l=0}^{n}w_l\sum _{z\in I}m_l(y,z)v_z. \end{align}

Both the weights \(w_l\) and the site values \(v_z\) may have either sign.

Proof ▶

Replacing the radius filter by the indicator of \(y\in N_l(a_i)\) and interchanging the finite sums over \(i\) and \(l\), and then over labels and sites at each fixed radius, gives

\begin{align} \label{eq:al_propagation_count_reorder} \sum _{i\in F}\mathbf1_{N_l(a_i)}(y) \sum _{z\in N_l(a_i)}v_z & =\sum _{z\in I}\left(\sum _{i\in F} \mathbf1_{N_l(a_i)}(y)\mathbf1_{N_l(a_i)}(z)\right)v_z. \end{align}

By (204), the inner sum on the right of (206) equals \(m_l(y,z)\), so multiplying by \(w_l\) and summing over \(0\le l\le n\) yields (205).

Following the finite event-label sum of [ 286 , Section 10 ] , for each \(i\in F\) let \(k_i\) be a positive contraction supported on \(C(a_i)\), and let \(\mathcal E_i=\mathcal E_{k_i}\) be its full root channel. Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\), and use \(A,b\) from (196). Fix a common cutoff \(n\in \mathbb {N}\) satisfying \(n\ge R_{a_i}\) for every \(i\in F\). Suppose that, for every \(i\in F\) and every integer \(l\) with \(0\le l\le n\),

\begin{align} \label{eq:al_propagation_family_error} \| k_i-E_{N_l(a_i)}(k_i)\| & \le C\exp (-cl^\alpha ). \end{align}

Then, for every \(y\in I\),

\begin{align} \label{eq:al_propagation_family_increment} \sum _{i\in F}\bigl(d_y(\mathcal E_i(B))-d_y(B)\bigr) & \le 2A\sum _{l=0}^{n}\exp (-bl^\alpha ) \sum _{z\in I}m_l(y,z)d_z(B). \end{align}

Each channel and every site oscillation on the right act on the same original operator \(B\), and the estimate holds for arbitrary finite spectators and arbitrary complex \(B\).

Proof ▶

Applying Theorem 44.28.4.1 to each \(k_i\) at the common cutoff \(n\), subtracting \(d_y(B)\), and summing over \(i\in F\) gives

\begin{align} \label{eq:al_propagation_family_shells} \sum _{i\in F}\bigl(d_y(\mathcal E_i(B))-d_y(B)\bigr) & \le 2\sum _{i\in F}\sum _{0\le l\le n,\ d_G(a_i,y)\le l} A\exp (-bl^\alpha )\sum _{z\in N_l(a_i)}d_z(B). \end{align}

Specializing (205) to \(w_l=A\exp (-bl^\alpha )\) and \(v_z=d_z(B)\) in (209) and factoring out \(A\) completes the proof.

44.28.6 Uniform weighted rows of the finite event kernel

Continue to count event labels by \(m_l(y,z)\) from (204). Write \(d_G^0(y,z)\) for the graph distance when \(y,z\) are connected and for zero when they are disconnected. The balls \(N_l(x)\) continue to use the extended distance \(d_G\), so an unreachable vertex belongs to no finite ball about \(x\).

Definition 44.28.6.1 Finite graph-channel event kernel
✓
#

For real parameters \(D,b,\alpha \) and a cutoff \(N\in \mathbb {N}\), define

\begin{align} \label{eq:al_propagation_event_kernel} \mathsf A^{(N)}_{yz} & =D\sum _{l=0}^{N}\exp (-bl^\alpha )m_l(y,z). \end{align}

For arbitrary real exponents, use \(0^0=1\) and \(0^\alpha =0\) when \(\alpha \ne 0\). With \(D=2A\) and \(N=n\), the right side of (208) is \(\sum _{z\in I}\mathsf A^{(n)}_{yz}d_z(B)\).

Theorem 44.28.6.2 Vanishing kernel between distinct components
✓

If \(y,z\) are in different connected components of \(G\), then \(\mathsf A^{(N)}_{yz}=0\) for every cutoff \(N\) and every choice of real \(D,b,\alpha \).

Proof ▶

If \(y,z\in N_l(a_i)\) for some label \(i\), the triangle inequality gives \(d_G(y,z)\le d_G(y,a_i)+d_G(a_i,z)\le 2l\). This would place \(y,z\) in the same component. Thus \(m_l(y,z)=0\) for every radius \(l\), and (210) vanishes.

Theorem 44.28.6.3 Finite weighted row bound from ball growth
✓

Let \(D,K,\mu \ge 0\) and \(b,\alpha {\gt}0\), and set

\begin{align} \label{eq:al_propagation_row_weight} \theta & =\frac{b}{2\, 2^\alpha }. \end{align}

Suppose that every site \(x\in I\) and radius \(l\in \mathbb {N}\) satisfy

\begin{align} \label{eq:al_propagation_ball_growth} |N_l(x)| & \le K(l+1)^2, \end{align}

and that every site \(x\in I\) satisfies

\begin{align} \label{eq:al_propagation_anchor_fiber} |\{ i\in F:a_i=x\} | & \le \mu . \end{align}

Then, for every cutoff \(N\in \mathbb {N}\) and site \(y\in I\),

\begin{align} \label{eq:al_propagation_finite_row} \sum _{z\in I}\mathsf A^{(N)}_{yz} \exp \bigl(\theta (d_G^0(y,z))^\alpha \bigr) & \le D\mu K^2\sum _{l=0}^{N}(l+1)^4\exp \bigl(-(b/2)l^\alpha \bigr). \end{align}
Proof ▶

Fix \(y\), and put \(\Lambda _l(y)=\{ i\in F:y\in N_l(a_i)\} \). Symmetry of graph distance and counting each anchor fiber give

\begin{align} \label{eq:al_propagation_anchor_count} |\Lambda _l(y)| & =\sum _{x\in N_l(y)}|\{ i\in F:a_i=x\} | \le \mu K(l+1)^2. \end{align}

If \(i\in \Lambda _l(y)\) and \(z\in N_l(a_i)\), then \(d_G^0(y,z)\le 2l\). Since \(\alpha {\gt}0\), \(\theta (d_G^0(y,z))^\alpha \le (b/2)l^\alpha \), whence

\begin{align} \label{eq:al_propagation_weighted_term} \exp (-bl^\alpha )\exp \bigl(\theta (d_G^0(y,z))^\alpha \bigr) & \le \exp \bigl(-(b/2)l^\alpha \bigr). \end{align}

Summing (216) over \(N_l(a_i)\) and using (212) bounds the contribution of this label by \(K(l+1)^2\exp (-(b/2)l^\alpha )\). Rewriting the row via (205) as a finite sum over labels and radii and applying the single-label bound gives

\begin{align} \label{eq:al_propagation_row_count} \sum _{z\in I}\mathsf A^{(N)}_{yz} \exp \bigl(\theta (d_G^0(y,z))^\alpha \bigr) & \le D\sum _{l=0}^{N}K(l+1)^2 \exp \bigl(-(b/2)l^\alpha \bigr)|\Lambda _l(y)|. \end{align}

Substituting (215) into (217) and collecting factors yields the estimate, where the two quadratic factors count sites in a ball and labels whose balls contain \(y\).

As the finite-kernel weighted row estimate of [ 286 , Section 10 ] , for every choice of real constants \(D,K,\mu \ge 0\) and \(b,\alpha {\gt}0\), there exists \(V\ge 0\) with the following property. For every finite site set \(I\), every finite label set \(F\), every simple graph \(G\) on \(I\), and every anchor family \((a_i)_{i\in F}\), assume that (212) holds for all sites and radii and (213) holds for all sites. Then, for every \(N\in \mathbb {N}\) and \(y\in I\),

\begin{align} \label{eq:al_propagation_uniform_row} \sum _{z\in I}\mathsf A^{(N)}_{yz} \exp \left(\frac{b}{2\, 2^\alpha }(d_G^0(y,z))^\alpha \right) & \le V. \end{align}

Thus \(V\) depends only on \(D,K,\mu ,b,\alpha \), and is chosen before the site set, label set, graph, anchors, cutoff, and site \(y\).

Proof ▶

The polynomial and finite-shell estimates used in Lemma 43.1.1, with exponent coefficient \(b/4\), give constants \(M,S\ge 0\) depending only on \(b,\alpha \). For every \(u\ge 0\) and every \(N\in \mathbb {N}\), they satisfy

\begin{align} \label{eq:al_propagation_polynomial_bound} (u+1)^2\exp \bigl(-(b/4)u^\alpha \bigr) & \le M, \end{align}
\begin{align} \label{eq:al_propagation_series_bound} \sum _{l=0}^{N}(l+1)^2 \exp \bigl(-(b/4)\lfloor l/2\rfloor ^\alpha \bigr) & \le S, \end{align}

where (220) uses truncation radius zero and a finite range of length \(N+1\). Splitting the exponent \(-(b/2)l^\alpha \) into two equal parts, applying (219) to one factor, and using \(\lfloor l/2\rfloor \le l\) on the other gives

\begin{align} \label{eq:al_propagation_fourth_power} (l+1)^4\exp \bigl(-(b/2)l^\alpha \bigr) & \le M(l+1)^2\exp \bigl(-(b/4)\lfloor l/2\rfloor ^\alpha \bigr). \end{align}

Summing (221) through \(N\) and applying (220) bounds the sum by \(MS\). Setting \(V=D\mu K^2MS\) before fixing any finite sets, graph, or anchors, Theorem 44.28.6.3 then yields (218) for every subsequent choice satisfying the ball and anchor-fiber bounds.

44.28.7 Kernel bounds for root-channel families

For every \(i\in F\), let \(k_i\) be a positive contraction supported on \(C(a_i)\) and put \(\mathcal E_i=\mathcal E_{k_i}\). Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\). Take \(A=2+8\sqrt C\exp (c/2)\) and use the kernel (210) with \(D=2A\) and \(b=c/2\). Fix \(N\in \mathbb {N}\) with \(N\ge R_{a_i}\) for every \(i\in F\). Suppose that \(\| k_i-E_{N_l(a_i)}(k_i)\| \le C\exp (-cl^\alpha )\) for every \(i\in F\) and every integer \(l\) with \(0\le l\le N\). Then, for every \(y\in I\) and every operator \(B\),

\begin{align} \label{eq:al_propagation_actual_domination} \sum _{i\in F}\bigl(d_y(\mathcal E_i(B))-d_y(B)\bigr) & \le \sum _{z\in I}\mathsf A^{(N)}_{yz}d_z(B). \end{align}

The spectator is any finite-dimensional space, and \(B\) is any complex operator on the physical space together with that spectator.

Proof ▶

Applying Theorem 44.28.5.2 with cutoff \(n=N\) and interchanging the two finite sums in (210) gives

\begin{align} \label{eq:al_propagation_actual_reorder} \sum _{z\in I}\mathsf A^{(N)}_{yz}d_z(B) & =2A\sum _{l=0}^{N}\exp \bigl(-(c/2)l^\alpha \bigr) \sum _{z\in I}m_l(y,z)d_z(B). \end{align}

Substituting (223) into (208) yields the bound.

For every choice of real constants \(C,K,\mu \ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\), there is a number \(R\ge 0\) with the following property. Choose any finite site set \(I\), finite label set \(F\), finite spectator index set \(J\), and local dimension \(q\in \mathbb {N}\) with \(q{\gt}0\). Let \(G\) be any simple graph on \(I\) and \((a_i)_{i\in F}\) any anchor family. For each \(i\in F\), let \(k_i\) be a positive contraction on \((\mathbb {C}^q)^{\otimes I}\) supported on \(C(a_i)\), and put \(\mathcal E_i=\mathcal E_{k_i}\). Assume the ball bound (212) for every site and radius, and the anchor-fiber bound (213) for every site. Set \(A=2+8\sqrt C\exp (c/2)\), and use (210) with \(D=2A\) and \(b=c/2\).

For every cutoff \(N\in \mathbb {N}\) satisfying \(N\ge R_{a_i}\) for all \(i\in F\), assume that \(\| k_i-E_{N_l(a_i)}(k_i)\| \le C\exp (-cl^\alpha )\) for all \(i\in F\) and all integers \(l\) with \(0\le l\le N\). Then the following two conclusions hold. Every \(y\in I\) satisfies

\begin{align} \label{eq:al_propagation_actual_row} \sum _{z\in I}\mathsf A^{(N)}_{yz} \exp \left(\frac{c}{4\, 2^\alpha }(d_G^0(y,z))^\alpha \right) & \le R. \end{align}

For every \(y\in I\) and every complex operator \(B\) on \((\mathbb {C}^q)^{\otimes I}\otimes \mathbb {C}^J\),

\begin{align} \label{eq:al_propagation_actual_increment} \sum _{i\in F}\bigl(d_y(\mathcal E_i(B))-d_y(B)\bigr) & \le \sum _{z\in I}\mathsf A^{(N)}_{yz}d_z(B). \end{align}

The constant \(R\) depends only on \(C,K,\mu ,c,\alpha \). It is chosen before \(I,F,J,q,G\), the anchors, the effects \(k_i\), the cutoff, and the input operator.

Proof ▶

With \(D=2(2+8\sqrt C\exp (c/2))\ge 0\) and \(b=c/2{\gt}0\), Theorem 44.28.6.4 provides a constant \(R\) chosen before any finite sets, graph, or channels. For each subsequent admissible choice, its row bound gives (224) since \((c/2)/(2\, 2^\alpha )=c/(4\, 2^\alpha )\), while Theorem 44.28.7.1 yields (225) for every \(y\) and \(B\) under the stated support, cutoff, and localization hypotheses.

44.28.8 Positive constraints on a finite lattice domain

Theorem 44.28.8.1 Anchor fibers after retaining labels
✓

Let \(F\) be a finite label set, let \(V\) be any set, and let \(a:F\to V\) assign an anchor to every label. For a predicate \(P\) on \(F\), put \(F_P=\{ i\in F:P(i)\} \). For every \(x\in V\),

\begin{align} \label{eq:al_propagation_retained_fiber} |\{ i\in F_P:a_i=x\} | & \le |\{ i\in F:a_i=x\} |. \end{align}

Distinct retained labels at the same anchor remain distinct.

Proof ▶

The inclusion \(F_P\hookrightarrow F\) restricts to an injection from the retained anchor fiber into the original anchor fiber. Taking cardinalities gives (226).

Combining [ 286 , Proposition 4.3 ] with the finite channel estimate of [ 286 , Section 10 ] , fix integers \(p\ge 1\) and \(R\ge 0\), and real constants \(J\ge 0\) and \(\Delta {\gt}0\), and put \(\alpha =p/(p+1)\). There exist \(C\ge 0\), \(c{\gt}0\), and \(v\ge 0\), depending only on \(p,R,J,\Delta \), with the following property.

Let \(q\in \mathbb {N}\) with \(q{\gt}0\) be any local dimension and \(\Lambda \subseteq \mathbb {Z}^2\) any finite domain, with its induced nearest-neighbour graph \(G_\Lambda \). Let \(\mathcal F_{\Lambda ,R}\) consist of all nonempty supports \(X\subseteq \Lambda \) of diameter at most \(R\) in this graph. For each \(X\in \mathcal F_{\Lambda ,R}\), let \(h_X\) be Hermitian, supported on \(X\), and satisfy \(\| h_X\| \le J\). Put \(H=\sum _{X\in \mathcal F_{\Lambda ,R}}h_X\) and choose an anchor \(a_X\in X\) for every support. Let \(E_0\in \mathbb {R}\) and let \(\Omega \) be a unit vector such that \(H\Omega =E_0\Omega \) and \(H-E_0\mathbb 1\ge \Delta (\mathbb 1-|\Omega \rangle \langle \Omega |)\).

With the spectral-filter time kernel \(f=f_{p,\Delta /2}\) and the positive constraints of Theorem 43.2.2,

\begin{align} \label{eq:al_propagation_lattice_filter} M_X & =\int _{\mathbb {R}}f(t)e^{itH}h_Xe^{-itH}\, dt -\langle \Omega ,h_X\Omega \rangle \mathbb 1, \end{align}

set \(c_*=\max \{ 1,J(\| f\| _1+1)\} \) and \(k_X=c_*^{-1}|M_X|\), and write \(\mathcal E_X=\mathcal E_{k_X}\) for the full root channel.

For any predicate \(P\) on \(\mathcal F_{\Lambda ,R}\) and \(F_P=\{ X\in \mathcal F_{\Lambda ,R}:P(X)\} \), every retained \(k_X\) uses the original full Hamiltonian \(H\) and ground vector \(\Omega \) in (227). Let \(\mathsf A^{(N,P)}\) denote the kernel (210) on \(G_\Lambda \), with label set \(F_P\), the restricted anchors, \(D=2(2+8\sqrt C\exp (c/2))\), and \(b=c/2\); its incidence counts are

\begin{align} \label{eq:al_propagation_retained_count} m_l^P(y,z) & =|\{ X\in F_P:y,z\in N_l(a_X)\} |. \end{align}

For any finite spectator index set \(T\) and any cutoff \(N\in \mathbb {N}\) such that \(N\ge R_{a_X}\) for every \(X\in F_P\), where \(R_{a_X}\) is the maximum distance from \(a_X\) inside its component in \(G_\Lambda \), every \(y\in \Lambda \) satisfies

\begin{align} \label{eq:al_propagation_lattice_row} \sum _{z\in \Lambda }\mathsf A^{(N,P)}_{yz} \exp \left(\frac{c}{4\, 2^\alpha } (d_{G_\Lambda }^0(y,z))^\alpha \right) & \le v. \end{align}

For every \(y\in \Lambda \) and every complex operator \(B\) on \((\mathbb {C}^q)^{\otimes \Lambda }\otimes \mathbb {C}^T\),

\begin{align} \label{eq:al_propagation_lattice_increment} \sum _{X\in F_P} \bigl(d_y(\mathcal E_X(B))-d_y(B)\bigr) & \le \sum _{z\in \Lambda }\mathsf A^{(N,P)}_{yz}d_z(B). \end{align}

The constants \(C,c,v\) are chosen before \(q\), the domain, Hamiltonian, anchors, ground vector, retained predicate, spectator, and cutoff, and the gap assumption concerns the original full Hamiltonian \(H\).

Proof ▶

Theorem 43.2.2 provides constants \(C,c\) such that for every admissible lattice instance, \(0\le k_X\le \mathbb 1\), \(k_X\) is supported in the component of \(a_X\), and every radius \(l\in \mathbb {N}\) satisfies

\begin{align} \label{eq:al_propagation_lattice_tail} \| k_X-E_{N_l(a_X)}(k_X)\| & \le C\exp (-cl^\alpha ). \end{align}

These are the localization constants for the positive constraints \(k_X\) themselves. Setting \(v_R=1+2R(R+1)\) and \(\mu _R=2^{v_R-1}\), Theorem 43.2.1 gives, for every site \(x\) and radius \(l\),

\begin{align} \label{eq:al_propagation_lattice_ball} |N_l(x)| & \le 2(l+1)^2, \end{align}
\begin{align} \label{eq:al_propagation_lattice_fiber} |\{ X\in \mathcal F_{\Lambda ,R}:a_X=x\} | & \le \mu _R. \end{align}

Since \(0{\lt}\alpha \le 1\), Theorem 44.28.7.2 applied with \(K=2\) and \(\mu =\mu _R\) provides \(v\) before any lattice data or retained predicate is fixed. Once such data and \(P\) are fixed, combining (232) and Theorem 44.28.8.1 with (233) yields the retained anchor-fiber bound

\begin{align} \label{eq:al_propagation_lattice_retained_fiber} |\{ X\in F_P:a_X=x\} | & \le \mu _R. \end{align}

Restricting positivity, component support, and (231) to \(X\in F_P\) and \(l\le N\), the cutoff condition for the retained anchors yields (229) and (230).

For the predicate \(P_{\rm all}(X)=\mathrm{true}\), the inclusion \(F_{P_{\rm all}}\hookrightarrow \mathcal F_{\Lambda ,R}\) is a bijection. Hence \(\mathsf A^{(N,P_{\rm all})}_{yz}=\mathsf A^{(N)}_{yz}\), and \(\sum _{X\in F_{P_{\rm all}}}u_X =\sum _{X\in \mathcal F_{\Lambda ,R}}u_X\) for every family of real numbers \(u_X\). The full-family weighted row and channel-increment bounds therefore follow with the same constants \(C,c,v\). For the identically false predicate, the kernel and increment sum are zero and the cutoff condition is vacuous.

44.28.9 Extended graph distance and kernel support

Definition 44.28.9.1 Canonical extended graph pseudometric
✓

Let \(V\) be any set and let \(G\) be a simple graph on \(V\). The graph distance \(d_G(x,y)\) is the length of a shortest path when one exists, and is \(\infty \) otherwise. Let \(\iota :\mathbb {N}\cup \{ \infty \} \to [0,\infty ]\) be the canonical inclusion, sending each natural number to the same real number and \(\infty \) to \(\infty \). Define

\begin{align} \label{eq:al_propagation_extended_distance} \rho _G(x,y) & =\iota (d_G(x,y)). \end{align}

This is an extended pseudometric on \(V\): it satisfies \(\rho _G(x,x)=0\), \(\rho _G(x,y)=\rho _G(y,x)\), and \(\rho _G(x,z)\le \rho _G(x,y)+\rho _G(y,z)\).

Proof ▶

The graph distance is zero on the diagonal and symmetric. The inclusion \(\iota \) preserves zero, addition, and order, so the graph triangle inequality gives

\begin{align} \label{eq:al_propagation_extended_triangle} \rho _G(x,z) & \le \iota (d_G(x,y)+d_G(y,z)) =\rho _G(x,y)+\rho _G(y,z). \end{align}

For every \(x,y\in V\), one has \(\rho _G(x,y)\ne \infty \) if and only if a path in \(G\) connects \(x\) to \(y\). Equivalently, \(\rho _G(x,y)=\infty \) if and only if \(y\) is unreachable from \(x\).

Proof ▶

The inclusion \(\iota \) sends only \(\infty \) to \(\infty \). A finite graph distance is the length of a path, so it is finite precisely for reachable pairs. Negating this equivalence gives the characterization of infinite distance.

For \(r\in [0,\infty ]\), denote its real value by \(r_{\mathbb {R}}\): this equals \(r\) when \(r\) is finite, and \(\infty _{\mathbb {R}}=0\).

Theorem 44.28.9.3 Real value of the extended graph distance
✓

For every \(x,y\in V\),

\begin{align} \label{eq:al_propagation_extended_real_value} (\rho _G(x,y))_{\mathbb {R}} & =d_G^0(x,y), \end{align}

where \(d_G^0(x,y)\) is the ordinary graph distance for reachable pairs and zero for unreachable pairs.

Proof ▶

If \(d_G(x,y)=n\in \mathbb {N}\), both sides of (237) equal \(n\). If \(d_G(x,y)=\infty \), both sides equal zero by their defining conventions.

Theorem 44.28.9.4 Nonnegativity of the finite event kernel
✓

For the finite graph and label family in Definition 44.28.6.1, suppose \(D\ge 0\). Then \(\mathsf A^{(N)}_{yz}\ge 0\) for every real \(b,\alpha \), every cutoff \(N\in \mathbb {N}\), and all sites \(y,z\).

Proof ▶

Each count \(m_l(y,z)\) is nonnegative and every exponential is positive. Their finite weighted sum in (210) is therefore nonnegative when multiplied by \(D\ge 0\).

The real-value convention sends infinite distance to zero. In the weighted-row estimates, the component restriction is retained by Theorems 44.28.9.2 and 44.28.6.2: \(\rho _G(y,z)=\infty \) implies \(\mathsf A^{(N)}_{yz}=0\). Consequently disconnected pairs contribute zero to every weighted row, and (237) replaces \(d_G^0(y,z)\) there by \((\rho _G(y,z))_{\mathbb {R}}\).

44.29 Chronological finite channel words

Let \(I,J\) be finite sets, let \(q\in \mathbb {N}\), and put \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\) and \(\mathcal K=\mathbb {C}^J\). Let \(F\) be a set of event labels, and write \(\mathcal E_i\) for the full spectator root map associated with the physical matrix \(k_i\), as in Definition 44.26.1.1. All input operators are complex matrices on \(\mathcal H\otimes \mathcal K\), with the Euclidean operator norm. Write \(wi\) for the word obtained by appending a single label \(i\) to the right of a finite word \(w\).

Definition 44.29.1 Observable after a chronological word
✓

For a nonempty word \(w=(i_0,\ldots ,i_{m-1})\), define

\begin{align} \label{eq:al_word_composition} \mathcal E_w(B) & =(\mathcal E_{i_{m-1}}\circ \cdots \circ \mathcal E_{i_0})(B). \end{align}

For the empty word \(\varnothing \), take \(\mathcal E_{\varnothing }=\mathrm{id}\). Thus the first event acts first. Given an initial operator \(B_0\), write \(B_w=\mathcal E_w(B_0)\).

For every operator \(B\), every finite word \(w\), and every label \(i\),

\begin{align} \label{eq:al_word_empty} \mathcal E_{\varnothing }(B) & =B, \end{align}
\begin{align} \label{eq:al_word_append} \mathcal E_{wi}(B) & =\mathcal E_i(\mathcal E_w(B)). \end{align}

In particular, \(B_{\varnothing }=B_0\) and \(B_{wi}=\mathcal E_i(B_w)\).

Proof ▶

The empty composition is the identity. In the composition for \(wi\), the last map is \(\mathcal E_i\), after every map indexed by \(w\), which gives (240).

Theorem 44.29.3 Relabelling chronological words
✓

Let \(E\) be any label set and let \(f:E\to F\) be any map. Define \(\widetilde k_j=k_{f(j)}\) and \(\widetilde{\mathcal E}_j=\mathcal E_{f(j)}\) for \(j\in E\). For a word \(w\) over \(E\), let \(f(w)\) be the word obtained by applying \(f\) to each label. Then, for every operator \(B\),

\begin{align} \label{eq:al_word_relabel} \mathcal E_{f(w)}(B) & =\widetilde{\mathcal E}_w(B). \end{align}
Proof ▶

At every position in the chronological composition, both sides of (241) apply the same map \(\mathcal E_{f(j)}\). They start from the same input \(B\) and apply these maps in the same order.

Following [ 286 , Section 10 ] , suppose \(0\le k_i\le \mathbb 1\) and \(k_i\Omega =0\) for every \(i\in F\), where \(\Omega \in \mathcal H\). Put \(G_i=(\mathbb 1-k_i)^{1/2}\), and, for a chronological word \(w=(i_0,\ldots ,i_{m-1})\), put \(R_w=G_{i_{m-1}}\cdots G_{i_0}\), with \(R_{\varnothing }=\mathbb 1\). For every \(\xi \in \mathcal K\) and every operator \(B\) on \(\mathcal H\otimes \mathcal K\), one has

\begin{align} \label{eq:al_word_ground_vector} \mathcal E_w(B)(\Omega \otimes \xi ) & =(R_w\otimes \mathbb 1)B(\Omega \otimes \xi ). \end{align}
Proof ▶

Functional calculus gives \(G_i\Omega =\Omega \) and \(k_i^{1/2}\Omega =0\). Consequently

\begin{align} \label{eq:al_single_ground_vector} \mathcal E_i(B)(\Omega \otimes \xi ) & =(G_i\otimes \mathbb 1)B(\Omega \otimes \xi ). \end{align}

Proceeding by induction on the word length by appending a final event, the empty word acts as the identity, while for \(wi\) applying (243) to \(\mathcal E_w(B)\) and then invoking the induction hypothesis produces the left factor \(G_iR_w=R_{wi}\).

Theorem 44.29.5 Vector difference bounded by channel difference
✓

As the pointwise conversion used in [ 286 , 09-amplification.tex, lines 218–224 ] , under the hypotheses and notation of Theorem 44.29.4, let \(u,w\) be any two finite words. Then

\begin{align} \label{eq:al_word_vector_difference} \bigl\| (R_u\otimes \mathbb 1)B(\Omega \otimes \xi ) -(R_w\otimes \mathbb 1)B(\Omega \otimes \xi )\bigr\| & \le \| \mathcal E_u(B)-\mathcal E_w(B)\| \| \Omega \otimes \xi \| , \end{align}

where vector norms are Euclidean and the matrix norm is the induced operator norm.

Proof ▶

By (242), the vector inside the norm equals \((\mathcal E_u(B)-\mathcal E_w(B))(\Omega \otimes \xi )\), so the defining operator-norm inequality yields the bound.

Theorem 44.29.6 Norm contraction along a finite word
✓

Suppose \(0\le k_i\le \mathbb 1\) for every \(i\in F\). Then \(\| \mathcal E_w(B)\| \le \| B\| \) for every finite word \(w\) and every operator \(B\).

Proof ▶

We proceed by induction on the word \(w\) for an arbitrary input operator \(B\). The empty word gives equality. If the first label is \(i\) and the remaining word is \(u\), then

\begin{align} \label{eq:al_word_norm_step} \| \mathcal E_{iu}(B)\| & =\| \mathcal E_u(\mathcal E_i(B))\| \le \| \mathcal E_i(B)\| \le \| B\| . \end{align}

Here the first inequality is the induction hypothesis at input \(\mathcal E_i(B)\) and the second is Theorem 44.26.1.2.

Suppose \(0\le k_i\le \mathbb 1\) for every \(i\in F\). For every finite word \(w\), site \(y\in I\), and initial operator \(B_0\), one has \(0\le d_y(B_w)\le 2\| B_0\| \).

Proof ▶

The oscillation is nonnegative, and \(d_y(B_w)\le 2\| B_w\| \le 2\| B_0\| \) by Theorems 28.11.1.2 and 44.29.6.

At the empty word, the initial support bound is Theorem 44.28.1.3. If \(q{\gt}0\) and every physical matrix block of \(B_0\) is supported on \(S\subseteq I\), then (239) gives

\begin{align} \label{eq:al_word_initial_support} d_y(B_{\varnothing }) & =d_y(B_0)\le 2\| B_0\| \mathbf1_S(y). \end{align}

Suppose \(q{\gt}0\) and \(F\) is finite. Let \(G\) be a simple graph on \(I\), and choose anchors \(a_i\in I\) for \(i\in F\). Assume \(0\le k_i\le \mathbb 1\) and that \(k_i\) is supported on the connected component of \(a_i\) for every \(i\). Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\). Fix a cutoff \(N\in \mathbb {N}\) with \(N\ge R_{a_i}\) for every \(i\), where \(R_{a_i}\) is the maximum distance from \(a_i\) within its component. Suppose that, for every \(i\in F\) and every integer \(l\) with \(0\le l\le N\),

\begin{align} \label{eq:al_word_localization_error} \| k_i-E_{N_l(a_i)}(k_i)\| & \le C\exp (-cl^\alpha ). \end{align}

For the kernel (210) with \(D=2(2+8\sqrt C\exp (c/2))\) and \(b=c/2\), every finite word \(w\), every \(y\in I\), and every initial operator \(B_0\) satisfy

\begin{align} \label{eq:al_word_kernel_increment} \sum _{i\in F}\bigl(d_y(B_{wi})-d_y(B_w)\bigr) & \le \sum _{z\in I}\mathsf A^{(N)}_{yz}d_z(B_w). \end{align}

Every oscillation on the right is evaluated at the same current observable \(B_w\). Labels with the same anchor remain distinct summands.

Proof ▶

Applying Theorem 44.28.7.1 to the operator \(B_w\) and rewriting \(\mathcal E_i(B_w)\) as \(B_{wi}\) for each event \(i\) via (240) yields (248).

For a finite retained family \(F_P=\{ i\in F:P(i)\} \), let \(j:F_P\hookrightarrow F\) be the inclusion and let \(\mathcal E_w^P\) denote composition using the restricted effects \(k\circ j\). Theorem 44.29.3 identifies the observable \(\mathcal E_w^P(B_0)\) with \(B_{j(w)}=\mathcal E_{j(w)}(B_0)\) in the original family. Under the hypotheses of Theorem 44.29.8 for this restricted family, (248) gives

\begin{align} \label{eq:al_word_retained_increment} \sum _{i\in F_P}\bigl(d_y(B_{j(wi)})-d_y(B_{j(w)})\bigr) & \le \sum _{z\in I}\mathsf A^{(N,P)}_{yz}d_z(B_{j(w)}), \end{align}

where \(\mathsf A^{(N,P)}\) counts the retained labels and the cutoff need only cover their anchors. For the lattice constraints of Theorem 44.28.8.2, one may instead apply (230) directly to \(\mathcal E_w^{\, P}(B_0)\) and use (241) and (240). Thus the same \(C,c,v\), chosen before \(P\), give both the lattice weighted row bound and (249) for every retained word. Every effect in this composition is still constructed from the original full Hamiltonian and its gapped ground vector.

44.30 Expected spatial oscillation of channel words

Suppose \(F\) is finite. For \(t\ge 0\), give each chronological word \(w=(i_0,\ldots ,i_{m-1})\) the probability

\begin{align} \label{eq:al_poisson_word_mass} \nu _t(\{ w\} ) & =e^{-|F|t}\frac{t^m}{m!}. \end{align}

These masses sum to one. The empty alphabet has only the empty word, whose mass is one. In this section, \(B_w\) denotes the composition (238), and expectations are taken with respect to \(\nu _t\).

With the extended graph distance \(\rho _G\) from Definition 44.28.9.1 and \(d_G(y,S)=\inf _{z\in S}\rho _G(y,z)\), define the distance profile for \(\beta \ge 0\) and \(0{\lt}\alpha \le 1\) by

\begin{align} \label{eq:al_poisson_distance_profile} H_S(y) & = \left\{ \begin{array}{ll} \exp (-\beta d_G(y,S)^\alpha ), & d_G(y,S){\lt}\infty , \\ 0, & d_G(y,S)=\infty . \end{array}\right. \end{align}

In particular, \(H_{\varnothing }=0\).

Suppose \(q{\gt}0\), let \(G\) be a simple graph on the finite physical site set \(I\), and let \(A_{yz}\ge 0\) be a real kernel. Assume that, for every operator \(W\) and every \(y\in I\),

\begin{align} \label{eq:al_poisson_physical_increment} \sum _{i\in F}\bigl(d_y(\mathcal E_iW)-d_y(W)\bigr) & \le \sum _{z\in I}A_{yz}d_z(W). \end{align}

Suppose \(A_{yz}=0\) when \(\rho _G(y,z)=\infty \), and suppose \(\beta \ge 0\), \(0{\lt}\alpha \le 1\), and \(v\ge 0\) satisfy

\begin{align} \label{eq:al_poisson_weighted_rows} \sum _{z\in I}A_{yz} \exp \bigl(\beta (\rho _G(y,z)_{\mathbb {R}})^\alpha \bigr) & \le v \end{align}

for every \(y\in I\). Let \(S\subseteq I\), and suppose every physical matrix block of \(B\) is supported on \(S\). Then \(w\mapsto d_y(B_w)\) is integrable for every \(t\ge 0\) and every \(y\in I\), with

\begin{align} \label{eq:al_poisson_physical_decay} \mathbb E_{\nu _t}d_y(B_w) & \le e^{vt}\, 2\| B\| \, H_S(y). \end{align}

If \(d_G(y,S)=\infty \), then \(d_y(B_w)=0\) for every word \(w\).

Proof ▶

Following the finite-word form of the argument in [ 286 , 09-amplification.tex, lines 161–188 ] , put \(f(w,y)=d_y(B_w)\ge 0\). The empty word gives \(f(\varnothing ,y)\le 2\| B\| \mathbf1_S(y)\) by Theorem 44.28.1.3. The chronological identity \(B_{wi}=\mathcal E_i(B_w)\) turns (252) into

\begin{align} \label{eq:al_poisson_append_increment} \sum _{i\in F}\bigl(f(wi,y)-f(w,y)\bigr) & \le \sum _{z\in I}A_{yz}f(w,z). \end{align}

The extended triangle inequality and subadditivity of \(r\mapsto r^\alpha \) give \(AH_S\le vH_S\) from (253). Applying the spatial growth theorem for the atomic Poisson-word law to \(f\) gives integrability and (254), and its zero-profile conclusion gives \(f(w,y)=0\) at infinite distance for every word.

Under the effect, component support, tail and cutoff hypotheses of Theorem 44.29.8, put \(\beta =c/(4\cdot 2^\alpha )\) and use the kernel \(\mathsf A^{(N)}\) with \(D=2(2+8\sqrt C e^{c/2})\) and \(b=c/2\). Suppose its weighted rows satisfy (253) for some \(v\ge 0\). For every initial operator \(B\) whose physical blocks are supported on \(S\), all conclusions of Theorem 44.30.1 hold.

Proof ▶

Theorem 44.28.7.1 establishes (252) for the kernel \(\mathsf A^{(N)}\), which is nonnegative and vanishes between distinct components; Theorem 44.30.1 then yields all claimed conclusions.

Fix \(p\ge 1\), interaction radius \(R\in \mathbb {N}\), interaction bound \(J\ge 0\), and gap \(\Delta {\gt}0\). There are \(c{\gt}0\) and \(v\ge 0\) depending only on \(p,R,J,\Delta \) with the following property. Let \(q{\gt}0\) be any local dimension, let \(\Lambda \) be a finite lattice domain with a Hamiltonian, anchors, and a gapped ground vector satisfying the hypotheses of Theorem 44.28.8.2, and let \(F_P\) be any retained subfamily of its event labels with positive constraints \(k_i\) formed from the original Hamiltonian. With \(\alpha =p/(p+1)\) and \(\beta =c/(4\cdot 2^\alpha )\), for every finite spectator, support \(S\subseteq \Lambda \), operator \(B\) whose physical blocks are supported on \(S\), and time \(t\ge 0\), the retained chronological word satisfies

\begin{align} \label{eq:al_poisson_lattice_decay} \mathbb E_{\nu _t^{F_P}}d_y(B_w) & \le e^{vt}\, 2\| B\| \, H_S(y). \end{align}

The oscillation is integrable and vanishes at every word when the component of \(y\) does not meet \(S\). The same \(c,v\) work for all domains, local dimensions, retained families, spectators, and initial operators.

Proof ▶

Choosing the constants from Theorem 44.28.8.2 before all lattice and operator data, let \(N\) be the maximum component radius of the anchors of a fixed retained family (with maximum zero for the empty family). That theorem establishes both (252) and (253) for the finite event kernel, and because the kernel is nonnegative and vanishes between components, Theorem 44.30.1 gives (256) and the remaining conclusions.

Theorem 44.30.4 Chronological restriction of a full word
✓

Let \(P\) be a predicate on the event alphabet \(F\), and let \(F_P=\{ i\in F:P(i)\} \). For a word \(w\) over \(F\), let \(\pi _P(w)\) be the word over \(F_P\) obtained by retaining exactly the letters satisfying \(P\), in their original order and with their original multiplicities. Write \(w|_P\) for the same list regarded as a word over \(F\). Then

\begin{align} \label{eq:al_channel_word_filter} \mathcal E_{w|_P}(B_0) & =\mathcal E^P_{\pi _P(w)}(B_0). \end{align}
Proof ▶

Because the inclusion \(j:F_P\hookrightarrow F\) sends \(\pi _P(w)\) to the ordered list \(w|_P\), applying Theorem 44.29.3 to \(j\) gives the identity.

Let \(F\) be finite and \(t\geq 0\). Let \(\nu _{F,t}\) be the probability measure on finite words over \(F\) assigning to each word \(w\) of length \(m\) the mass

\begin{align} \nu _{F,t}(\{ w\} ) & =e^{-|F|t}\frac{t^m}{m!}. \end{align}

Let \(P\) be a predicate on \(F\), and let \(\Phi \) be a function from operators on \(\mathcal H\otimes \mathcal K\) to a normed real vector space. The function \(w\mapsto \Phi (\mathcal E_{w|_P}(B_0))\) is integrable under \(\nu _{F,t}\) if and only if \(u\mapsto \Phi (\mathcal E^P_u(B_0))\) is integrable under \(\nu _{F_P,t}\), and their Bochner integrals satisfy

\begin{align} \label{eq:al_channel_word_filter_expectation} \int \Phi (\mathcal E_{w|_P}(B_0))\, d\nu _{F,t}(w) & =\int \Phi (\mathcal E^P_u(B_0))\, d\nu _{F_P,t}(u). \end{align}

In particular, \(\Phi \) may be the identity on matrices equipped with the Euclidean operator norm, or the site oscillation \(B\mapsto d_y(B)\).

Proof ▶

The ordered Poisson-word marginal identity gives \((\pi _P)_*\nu _{F,t}=\nu _{F_P,t}\). Both word spaces are countable and have the discrete sigma-algebra, so every observation of a word is strongly measurable. Identifying the two physical evaluations via (257) and changing variables along \(\pi _P\) yields the integrability equivalence and the equality of Bochner integrals.

Theorem 44.30.6 Retained oscillation bounds under the full word law
✓

Fix \(y\in I\) and \(R\in \mathbb {R}\). If \(u\mapsto d_y(\mathcal E^P_u(B_0))\) is integrable under \(\nu _{F_P,t}\) and its integral is at most \(R\), then \(w\mapsto d_y(\mathcal E_{w|_P}(B_0))\) is integrable under \(\nu _{F,t}\) and

\begin{align} \int d_y(\mathcal E_{w|_P}(B_0))\, d\nu _{F,t}(w) & \leq R. \end{align}
Proof ▶

Specializing the integrability equivalence and (259) to \(\Phi (B)=d_y(B)\) yields the result.

Under the hypotheses of Theorem 44.30.3, sample a word \(w\) from the full event alphabet \(F\), and retain only the events satisfying \(P\). Then \(w\mapsto d_y(\mathcal E_{w|_P}(B))\) is integrable under \(\nu _{F,t}\), and the same constants \(c{\gt}0\), \(v\ge 0\) satisfy

\begin{align} \label{eq:al_poisson_lattice_filtered_decay} \mathbb E_{\nu _{F,t}}d_y(\mathcal E_{w|_P}(B)) & \le e^{vt}\, 2\| B\| \, H_S(y). \end{align}

Here \(\alpha =p/(p+1)\), \(\beta =c/(4\cdot 2^\alpha )\), and \(H_S\) is (251). If the component of \(y\) does not meet \(S\), the filtered observable has zero oscillation at \(y\) for every full word. The constants precede the choice of domain, local dimension, Hamiltonian, retained predicate, spectator and supported operator \(B\).

Proof ▶

With \(c,v\) chosen from Theorem 44.30.3, applying Theorem 44.30.6 to its retained-law integrability and expectation bound yields (261). The pointwise identity (257) transfers the zero-oscillation conclusion from each retained word \(\pi _P(w)\) to the corresponding filtered full word.

44.31 Excited-state decay for the exact constraints

Theorem 44.31.1 Physical excited-component decay
✓

Let \(\Lambda \) be a finite induced lattice domain with local dimension \(q\ge 1\), and let \(H\) be a range-\(R\) interaction of strength \(J\ge 0\). Suppose that \(\Omega \) is a unit ground vector of energy \(E_0\) with full-system gap \(\Delta {\gt}0\). Fix an integer \(p\ge 1\), and let \(k_i=|M_i|/c_*\) be the positive constraints from Theorem 43.2.2. Put \(g=\Delta /c_*\), \(P_\Omega =|\Omega \rangle \langle \Omega |\), and \(G_i=(I-k_i)^{1/2}\).

For \(t\ge 0\), let \(\mu _t\) be the law of a word \(w\) obtained by drawing independent Poisson\((\, t\, )\) multiplicities for the interaction labels and ordering the resulting multiset uniformly at random. For a word \(w=(i_0,\ldots ,i_{m-1})\), set \(D_w=G_{i_{m-1}}\cdots G_{i_0}\) and \(D_{\varnothing }=I\). For every finite-dimensional spectator space \(\mathcal K\) and every \(\zeta \in \mathcal H_\Lambda \otimes \mathcal K\), put \(\xi =((I-P_\Omega )\otimes I)\zeta \). Then \(\| (D_w\otimes I)\xi \| ^2\) is integrable and satisfies

\begin{align*} \int \| (D_w\otimes I)\xi \| ^2\, d\mu _t(w) \le e^{-gt}\| \xi \| ^2. \end{align*}

This is the fixed-time excited-state decay estimate in [ 286 , Section 10 ] .

Proof ▶

The positive constraints satisfy \(0\le k_i\le I\), \(k_i\Omega =0\), and \(\sum _i k_i\ge g(I-P_\Omega )\). Each operator \(G_i\otimes I\) fixes \(\Omega \otimes \mathcal K\) and preserves its orthogonal complement. On that complement, \(\| \xi \| ^2-\| (G_i\otimes I)\xi \| ^2=\langle \xi ,(k_i\otimes I)\xi \rangle \). Let \(N\) be the number of interaction labels. Summing over all \(N\) labels gives \(\sum _i\| (G_i\otimes I)\xi \| ^2\le (N-g)\| \xi \| ^2\). If \(g{\gt}N\), the inequalities \(\sum _i k_i\le NI\) and \(\sum _i k_i\ge g(I-P_\Omega )\) force \(I-P_\Omega =0\), so \(\xi =0\) and the bound holds trivially. Otherwise \(N-g\ge 0\), and induction on the word length \(m\) gives \(\sum _{|w|=m}\| (D_w\otimes I)\xi \| ^2\le (N-g)^m\| \xi \| ^2\). Multiplying by the Poisson-word probability \(e^{-Nt}t^m/m!\) and summing over \(m\ge 0\) yields \(e^{-Nt}e^{(N-g)t}\| \xi \| ^2=e^{-gt}\| \xi \| ^2\).

44.32 Truncating the retained constraint product

The local constraint products lemma of [ 286 , Section 10 ] has two estimates. This section proves the first one: replacing every retained factor by its radius-\(r\) local version costs little in expectation. The second estimate, which removes distant events, is treated in Section 44.33, where the two are combined.

Theorem 44.32.1 Products of roots are contractions and telescope
✓

Let \(k_i\) and \(k_i'\) be positive operators on a finite-dimensional space, indexed by a common alphabet. For a word \(w=(i_0,\ldots ,i_{m-1})\) put \(D_w=(I-k_{i_{m-1}})^{1/2}\cdots (I-k_{i_0})^{1/2}\), and define \(D_w'\) in the same way from the \(k_i'\). Then \(\| D_w\| \le 1\). If \(\| (I-k_i)^{1/2}-(I-k_i')^{1/2}\| \le \varepsilon \) for every label \(i\), then \(\| D_w-D_w'\| \le m\varepsilon \).

Proof ▶

Each root \((I-k_i)^{1/2}\) is a positive contraction, so \(D_w\) is a contraction. For the second claim, factoring \(D_w=GX\) and \(D_w'=G'X'\) with last factors \(G,G'\) gives \(GX-G'X'=G(X-X')+(G-G')X'\), and induction on \(m\) yields the bound.

In the setting of Theorem 44.32.1, let the alphabet be finite and let \(\mu _t\) be the Poisson-word law at time \(t\ge 0\). Fix a set \(P\) of retained labels, and for a full word \(w\) let \(w_P\) be its subword of retained letters, in their original order. Let \(k_i,k_i'\) be given for \(i\in P\), with roots within \(\varepsilon \) of each other. Then \(w\mapsto \| D_{w_P}-D_{w_P}'\| \) is integrable and

\begin{align*} \int \| D_{w_P}-D_{w_P}’\| \, d\mu _t(w)\le \varepsilon \, |P|\, t. \end{align*}
Proof ▶

The integrand is at most \(2\), hence integrable. By Theorem 44.32.1 it is at most \(\varepsilon \) times the length of \(w_P\). The retained subword has the Poisson-word law of the alphabet \(P\), whose expected length is \(|P|\, t\).

Let \(\Lambda \) be a finite induced lattice domain, and let finitely many labels carry anchors \(a_i\in \Lambda \), with at most \(\mu \ge 0\) labels per site. For every \(S\subseteq \Lambda \) and \(r\ge 0\), if \(d_\Lambda (a_i,S)\le r\) then \(N_r(a_i)\subseteq N_{2r}(S)\), and at most \(2\mu |S|(1+r)^2\) labels satisfy \(d_\Lambda (a_i,S)\le r\). In particular this holds with \(\mu =\mu _R\), the anchor multiplicity bound of Theorem 43.2.1, for anchors \(a_i\in X_i\) of the admissible supports of range \(R\).

Proof ▶

The inclusion is the triangle inequality. A retained anchor lies in a ball \(N_r(s)\) with \(s\in S\), which has at most \(2(1+r)^2\) sites, and at most \(\mu \) labels share each anchor.

Theorem 44.32.4 Support of the truncated products
✓

In the setting of Theorem 44.32.3, let \(k_i\le I\) be given for the labels with \(d_\Lambda (a_i,S)\le r\), and let \(E_{i,r}\) be the conditional expectation onto \(N_r(a_i)\). Every product of the roots \((I-E_{i,r}k_i)^{1/2}\) over such labels is supported on \(N_{2r}(S)\).

Proof ▶

Each root is a function of an operator supported on \(N_r(a_i)\subseteq N_{2r}(S)\), and products of operators supported on a set stay supported on it.

Theorem 44.32.5 Truncation of the retained product for general constraints
✓

Let \(C,\mu \ge 0\), \(c{\gt}0\) and \(\alpha \in \mathbb {R}\). There are \(A\ge 0\) and \(\gamma {\gt}0\) with the following property. Let \(0\le k_i\le I\) be finitely many operators on a finite induced lattice domain \(\Lambda \) with local dimension \(q\ge 1\), anchored at \(a_i\) with at most \(\mu \) labels per site, and with \(\| k_i-E_{i,l}k_i\| \le Ce^{-cl^\alpha }\) for every \(l\ge 0\), where \(E_{i,l}\) is the conditional expectation onto \(N_l(a_i)\). Fix \(S\subseteq \Lambda \), an integer \(r\ge 0\) and \(t\ge 0\), and retain the labels with \(d_\Lambda (a_i,S)\le r\). For a full Poisson word \(w\), let \(D_{\rm ret}(w)\) be the chronological product of the roots \((I-k_i)^{1/2}\) over its retained events, and let \(L(w)\) be the same product of \((I-E_{i,r}k_i)^{1/2}\). Then \(\| D_{\rm ret}-L\| \) is integrable for the Poisson-word law \(\mu _t\),

\begin{align*} \int \| D_{\rm ret}(w)-L(w)\| \, d\mu _t(w) \le At\, |S|\, (1+r)^2e^{-\gamma r^\alpha }, \end{align*}

and every \(L(w)\) is a contraction supported on \(N_{2r}(S)\). The constants depend only on \(C,c,\alpha ,\mu \).

Proof ▶

Operator monotonicity of the square root gives \(\| (I-k_i)^{1/2}-(I-E_{i,r}k_i)^{1/2}\| \le \| k_i-E_{i,r}k_i\| ^{1/2} \le C^{1/2}e^{-cr^\alpha /2}\). Applying Theorem 44.32.2 and bounding the number of retained labels by Theorem 44.32.3 yields the integral estimate with \(A=2\mu C^{1/2}\) and \(\gamma =c/2\), while Theorem 44.32.4 gives the support.

Fix an integer \(p\ge 1\), a range \(R\), a strength \(J\ge 0\) and a gap \(\Delta {\gt}0\), and put \(\alpha =p/(p+1)\). Specializing the first estimate of [ 286 , Lemma 10.1 ] (stated for general constraints in Theorem 44.32.5) to the exact positive constraints without requiring \(S\) to be nonempty or \(r\ge 1\) gives constants \(C\ge 0\) and \(c{\gt}0\), depending only on \(p,R,J,\Delta \), with the following property. Let \(\Lambda \) be a finite induced lattice domain with local dimension \(q\ge 1\), let \(H\) be a range-\(R\) interaction of strength \(J\), and let \(\Omega \) be a ground vector with full-system gap \(\Delta \). Let \(k_i\) be the exact positive constraints of Theorem 43.2.2, anchored at \(a_i\in X_i\), and let \(E_{i,r}\) be the conditional expectation onto \(N_r(a_i)\). Fix \(S\subseteq \Lambda \), an integer \(r\ge 0\) and \(t\ge 0\), and retain the labels with \(d_\Lambda (a_i,S)\le r\). For a full Poisson word \(w\), let \(D_{\rm ret}(w)\) be the chronological product of the roots \((I-k_i)^{1/2}\) over its retained events, and let \(L(w)\) be the same product of \((I-E_{i,r}k_i)^{1/2}\). Then \(\| D_{\rm ret}-L\| \) is integrable for the Poisson-word law \(\mu _t\),

\begin{align*} \int \| D_{\rm ret}(w)-L(w)\| \, d\mu _t(w) \le Ct\, |S|\, (1+r)^2e^{-cr^\alpha }, \end{align*}

and every \(L(w)\) is a contraction supported on \(N_{2r}(S)\).

Proof ▶

By Theorem 43.2.3 each retained root changes by at most \(Ce^{-cr^\alpha }\) under the radius-\(r\) approximation. Theorem 44.32.2 bounds the expectation by this error times \(t\) times the number of retained labels, and Theorem 44.32.3 bounds that number by \(2\mu _R|S|(1+r)^2\). Each local root \((I-E_{i,r}k_i)^{1/2}\) is a positive contraction acting on \(N_r(a_i)\subseteq N_{2r}(S)\), and so is each product of them.

44.33 Omitting distant events from the constraint product

The local constraint products lemma of [ 286 , Section 10 ] has two estimates. This section proves the second one: removing the events whose anchors are far from the support of the observable costs little in expectation, on the same realization of the clocks. As in the source, the argument runs through the unital channels \(\mathcal E_i(B)=G_iBG_i+K_iBK_i\), with \(G_i=(\mathbb 1-k_i)^{1/2}\) and \(K_i=k_i^{1/2}\), and passes to the products of the \(G_i\) only at the end.

Throughout, \(I\) and \(J\) are finite sets, \(q{\gt}0\), the physical space is \((\mathbb {C}^q)^{\otimes I}\) and the spectator space \(\mathbb {C}^J\) may have dimension zero. For a word \(w=(i_0,\ldots ,i_{m-1})\) over a label set \(F\), write \(\mathcal E_w=\mathcal E_{i_{m-1}}\circ \cdots \circ \mathcal E_{i_0}\), as in Definition 44.29.1. For a predicate \(P\) on \(F\), let \(w|_P\) be the subword of letters satisfying \(P\), in their original order and with their multiplicities. All norms are operator norms.

44.33.1 Telescoping the omitted events

Definition 44.33.1.1 Omission defect
✓

For an operator \(B\) and a word \(w\), put \(D_P(w;B)=\| \mathcal E_w(B)-\mathcal E_{w|_P}(B)\| \).

Suppose \(0\le k_i\le \mathbb 1\) for every label. Every \(\mathcal E_w\) is linear and contractive on differences, and \(0\le D_P(w;B)\le 2\| B\| \). Appending a label \(i\) to \(w\) does not increase the defect when \(P(i)\) holds, and increases it by at most \(\| (\mathcal E_i-\mathrm{id})(\mathcal E_{w|_P}(B))\| \) otherwise.

Proof ▶

Linearity holds letter by letter, and contractivity follows from Theorem 44.29.6 applied to a difference. With \(A=\mathcal E_w(B)\) and \(R=\mathcal E_{w|_P}(B)\), a retained letter acts on both, so the new defect is \(\| \mathcal E_i(A-R)\| \le \| A-R\| \). An omitted letter acts only on \(A\), and \(\| \mathcal E_i(A)-R\| \le \| \mathcal E_i(A-R)\| +\| \mathcal E_i(R)-R\| \).

Theorem 44.33.1.3 Finite prefix increments
✓
#

Let \(f\) be a real function on finite words over any alphabet. For a word \(w=(i_0,\ldots ,i_{m-1})\), let \(w_{{\lt}j}\) be its first \(j\) letters. Then

\begin{align*} \sum _{j=0}^{m-1}\bigl(f(w_{{\lt}j}i_j)-f(w_{{\lt}j})\bigr) =f(w)-f(\varnothing ). \end{align*}
Proof ▶

Since \(w_{{\lt}j}i_j=w_{{\lt}j+1}\), the successive differences telescope between the empty word and \(w\).

Suppose \(0\le k_i\le \mathbb 1\) for every label. With \(w_{{\lt}j}\) the prefix of length \(j\),

\begin{align*} D_P(w;B)\le \sum _{0\le j{\lt}m,\ \neg P(i_j)} \| (\mathcal E_{i_j}-\mathrm{id})(\mathcal E_{w_{{\lt}j}|_P}(B))\| . \end{align*}
Proof ▶

Since the defect of the empty word vanishes, applying Theorem 44.33.1.3 to the defect and bounding each increment by Theorem 44.33.1.2 gives the inequality.

For a finite alphabet \(A\) and \(t\ge 0\), let \(\nu _{A,t}\) be the law of the word recorded by independent rate-one clocks on \([0,t]\), one for each label.

Theorem 44.33.1.5 Occupation at omitted letters
✓

Let \(F\) be finite, let \(P\) be a predicate on \(F\), and put \(F_P=\{ i\in F:P(i)\} \). Suppose a real function \(H(u,i)\), for words \(u\) over \(F_P\) and \(i\in F\), satisfies \(0\le H(u,i)\le M\) for a real constant \(M\). For \(t\ge 0\), the sum over omitted positions is integrable under \(\nu _{F,t}\) and

\begin{align*} \int \sum _{0\le j{\lt}|w|,\ \neg P(i_j)}H(w_{{\lt}j}|_P,i_j)\, d\nu _{F,t}(w) =\int _0^t\sum _{i\in F,\ \neg P(i)}\int H(u,i)\, d\nu _{F_P,s}(u)\, ds. \end{align*}
Proof ▶

Following [ 253 , “Real occupation at omitted labels” ] , setting the kernel to zero on retained labels and applying the retained-prefix identity gives the integral formula, while bounding the sum by \(M|w|\) and using the finite expectation of the Poisson word length gives integrability.

Suppose \(0\le k_i\le \mathbb 1\) for every label of a finite set \(F\), and put \(F_P=\{ i\in F:P(i)\} \). Then \(w\mapsto D_P(w;B)\) is integrable under \(\nu _{F,t}\), and its integral is at most

\begin{align*} \int _0^t\sum _{i\in F,\ \neg P(i)}\int \| (\mathcal E_i-\mathrm{id})(\mathcal E_u(B))\| \, d\nu _{F_P,s}(u)\, ds. \end{align*}
Proof ▶

The defect is bounded and hence integrable. Integrating the telescope of Theorem 44.33.1.4, identifying the filtered word with its word over \(F_P\) via Theorem 44.30.4, and applying Theorem 44.33.1.5 to \(H(u,i)=\| (\mathcal E_i-\mathrm{id})(\mathcal E_u(B))\| \in [0,2\| B\| ]\) yields the bound.

44.33.2 One omitted event

Let \(0\le k\le \mathbb 1\), let \((K_l)_{l\ge 0}\) be increasing sets of sites, let \(C\ge 0\), \(c{\gt}0\) and \(0{\lt}\alpha \le 1\), and suppose \(\| k-E_{K_l}k\| \le Ce^{-cl^\alpha }\) for \(0\le l\le n\). With \(A=2+8\sqrt Ce^{c/2}\), every \(B\) satisfies

\begin{align*} \| \mathcal E_{K_n}(B)-B\| \le \sum _{l=0}^nAe^{-cl^\alpha /2} \sum _{z\in K_l}d_z(B). \end{align*}

For graph balls \(K_l=N_l(a)\), if \(k\) acts on the component of \(a\) and \(n\) is at least the largest distance from \(a\) in that component, the left side is \(\| \mathcal E(B)-B\| \) for the full channel of \(k\).

Proof ▶

Summing the shell bounds of Theorem 44.28.3.2 over \(0\le l\le n\) gives the inequality, and for the second claim the radius-\(n\) local channel equals the full channel.

Theorem 44.33.2.2 Component support from the tails
✓

If \(\| k-E_{N_l(a)}k\| \le Ce^{-cl^\alpha }\) for every \(l\), with \(c,\alpha {\gt}0\), then \(k\) acts on the component of \(a\).

Proof ▶

Beyond the largest distance from \(a\) in its component, the balls equal the component, while the right side tends to zero.

Theorem 44.33.2.3 Anchors whose balls contain a site
✓

Let labels on a graph be anchored at \(a_i\) with at most \(\mu \) labels per site. For every site \(y\) and every \(l\ge 0\), at most \(\mu |N_l(y)|\) labels satisfy \(y\in N_l(a_i)\).

Proof ▶

The relation \(y\in N_l(a_i)\) is symmetric, so such an anchor lies in \(N_l(y)\), and each of these sites carries at most \(\mu \) labels.

Let \(K,\mu \ge 0\), \(b,\beta {\gt}0\) and \(0{\lt}\alpha \le 1\). There is \(L\ge 0\) with the following property, with \(\gamma =\min (b,\beta )/2\). Let \(G\) be a graph on a finite set whose balls satisfy \(|N_l(x)|\le K(l+1)^2\), and let labels be anchored at \(a_i\) with at most \(\mu \) labels per site. Put \(p(z)=e^{-\beta d(z,S)^\alpha }\), and \(p(z)=0\) when \(z\) is not connected to \(S\). If every label in a set \(E\) is at distance more than \(r\ge 0\) from \(S\), then for every \(N\),

\begin{align*} \sum _{i\in E}\sum _{l=0}^Ne^{-bl^\alpha }\sum _{z\in N_l(a_i)}p(z) \le L|S|e^{-\gamma r^\alpha }. \end{align*}
Proof ▶

For \(z\in N_l(a_i)\) the triangle inequality and \(\alpha \le 1\) give \(r^\alpha \le l^\alpha +d(z,S)^\alpha \), so half of each decay rate pays for \(e^{-\gamma r^\alpha }\). What remains is bounded by summing over all labels: at most \(\mu K(l+1)^2\) balls of radius \(l\) contain a given site, and \(\sum _zp(z)\le |S|K\sum _n(1+n)^2e^{-\beta n^\alpha /2}\). Both series converge.

44.33.3 The coupled omission estimates

Let \(C,K,\mu \ge 0\), \(c{\gt}0\) and \(0{\lt}\alpha \le 1\). There are \(D\ge 0\) and \(v,\gamma {\gt}0\) with the following property. Let \(G\) be a graph on a finite set with \(|N_l(x)|\le K(l+1)^2\), and let \(0\le k_i\le \mathbb 1\) be anchored at \(a_i\) with at most \(\mu \) labels per site, acting on the component of \(a_i\), with \(\| k_i-E_{N_l(a_i)}k_i\| \le Ce^{-cl^\alpha }\) for \(l\) up to a cutoff beyond all component distances. Let \(B\) act on \(S\) and a spectator, and let every label outside \(P\) be at distance more than \(r\ge 0\) from \(S\). Then

\begin{align*} \int D_P(w;B)\, d\nu _{F,t}(w)\le Dt|S|\| B\| e^{vt-\gamma r^\alpha }. \end{align*}
Proof ▶

The retained labels satisfy the same hypotheses. By Theorem 44.30.2, the expected oscillation of the retained process at time \(s\) and site \(z\) is at most \(2\| B\| e^{vs}p(z)\), with \(\beta =c/(4\cdot 2^\alpha )\). Integrating the one-event bound of Theorem 44.33.2.1 against this gives, for each omitted label, a bound by the inner sum of Theorem 44.33.2.4. Summing over the omitted labels and integrating over \(s\in (0,t]\) in Theorem 44.33.1.6 completes the estimate.

On a finite domain \(\Lambda \subseteq \mathbb {Z}^2\) with its induced graph, the balls satisfy \(|N_l(x)|\le 2(l+1)^2\) by Theorem 43.2.1.

Let \(C,\mu \ge 0\), \(c{\gt}0\) and \(0{\lt}\alpha \le 1\). There are \(A\ge 0\) and \(v,\gamma {\gt}0\) with the following property. Let \(0\le k_i\le \mathbb 1\) on a finite domain \(\Lambda \), anchored at \(a_i\) with at most \(\mu \) labels per site, satisfy \(\| k_i-E_{N_l(a_i)}k_i\| \le Ce^{-cl^\alpha }\) for all \(l\ge 0\). Let \(B\) act on \(S\) and a finite spectator, and let every label outside \(P\) be at distance more than \(r\ge 0\) from \(S\). Then, as in the coupled channel estimate in the proof of the local constraint products lemma, \(w\mapsto D_P(w;B)\) is integrable and

\begin{align*} \mathbb E\| \mathcal E_{\rm full}(B)-\mathcal E_{\rm ret}(B)\| \le At|S|\| B\| e^{vt-\gamma r^\alpha }. \end{align*}
Proof ▶

Theorem 44.33.2.2 gives the component support and the largest distance in the domain serves as a common cutoff, so Theorem 44.33.3.1 with \(K=2\) yields the bound.

Theorem 44.33.3.3 Omission of distant events from the constraint product
✓

Under the hypotheses of Theorem 44.33.3.2, with the same constants, suppose also \(k_i\Omega =0\) for a unit vector \(\Omega \). Fix an integer \(r\ge 0\) and retain the labels with \(d_\Lambda (a_i,S)\le r\). On each realization, let \(D\) be the product of all \(G_i\) in occurrence order, later factors on the left, and let \(D_{\rm ret}\) be the product over the retained events. For every unit spectator vector \(\xi \),

\begin{align*} \mathbb E\| (D-D_{\rm ret})B(\Omega \otimes \xi )\| \le At|S|\| B\| e^{vt-\gamma r^\alpha }. \end{align*}

This is the omission estimate of the local constraint products lemma; the paper assumes \(S\ne \varnothing \) and \(r\ge 1\), neither of which is needed here.

Proof ▶

A label outside the retained set is at distance more than \(r\) from every site of \(S\). On the vector \(\Omega \otimes \xi \), every channel word acts as the product of its roots \(G_i\), so the vector difference is at most \(D_P(w;B)\) pointwise (Theorem 44.29.5). Integrating and applying Theorem 44.33.3.2 gives the stated bound.

Let \(p\ge 1\), \(R\), \(J\ge 0\) and \(\Delta {\gt}0\), and put \(\alpha =p/(p+1)\). There are \(A\ge 0\) and \(v,\gamma {\gt}0\) such that the conclusion of Theorem 44.33.3.3 holds for the exact positive constraints of every gapped lattice Hamiltonian with ground state \(\Omega \), with any anchoring \(a_i\in X_i\).

Proof ▶

Theorem 43.2.2 gives the positivity, the zero vector \(\Omega \) and the tails, and Theorem 43.2.1 bounds the anchor multiplicity.

44.33.4 The local constraint products lemma

Theorem 44.33.4.1 Local constraint products
✓

Let \(C,\mu \ge 0\), \(c{\gt}0\) and \(0{\lt}\alpha \le 1\). There are \(A\ge 0\) and \(\gamma ,v{\gt}0\) with the following property. Let \(0\le k_i\le \mathbb 1\) be finitely many operators on a finite domain \(\Lambda \subseteq \mathbb {Z}^2\) with its induced graph, anchored at \(a_i\) with at most \(\mu \) labels per site, and with \(\| k_i-E_{i,l}k_i\| \le Ce^{-cl^\alpha }\) for every \(l\ge 0\), where \(E_{i,l}\) is the conditional expectation onto \(N_l(a_i)\). Put \(G_i=(\mathbb 1-k_i)^{1/2}\) and \(G_{i,r}=(\mathbb 1-E_{i,r}k_i)^{1/2}\). Fix \(S\subseteq \Lambda \), an integer \(r\ge 0\) and \(t\ge 0\). At each label run an independent rate-one Poisson clock on \([0,t]\). On each realization, in occurrence order with later factors on the left, let \(D\) be the product of all \(G_i\), let \(D_{\rm ret}\) retain only the events with \(d_\Lambda (a_i,S)\le r\), and let \(L\) be the same retained product with each \(G_i\) replaced by \(G_{i,r}\). Then

\begin{align*} \mathbb E\| D_{\rm ret}-L\| \le At|S|(1+r)^2e^{-\gamma r^\alpha }, \end{align*}

and every \(L\) is a contraction supported on \(N_{2r}(S)\). If in addition \(k_i\Omega =0\) for a unit vector \(\Omega \) and \(B\) acts on \(S\) and a finite spectator system, then for every unit spectator vector \(\xi \),

\begin{align*} \mathbb E\| (D-D_{\rm ret})B(\Omega \otimes \xi )\| \le At|S|\| B\| e^{vt-\gamma r^\alpha }. \end{align*}

All three products are read off the same clock realization, and the constants depend only on \(C,c,\alpha ,\mu \), giving [ 286 , Lemma 10.1 ] without the assumptions that \(S\) is nonempty and \(r\ge 1\).

Proof ▶

The retained product over the retained events of a full word is the product over the retained letters of that word, in the same order. The first estimate and the support clause follow from Theorem 44.32.5, and the second follows from Theorem 44.33.3.3, taking the larger of the two prefactors and the smaller of the two decay rates.

44.34 Typical projectors for the amplification

The proof of the amplification proposition in [ 286 , Section 10 ] begins with three spectral projections on the cuts \(X\), \(Y\), and \(S_0\). We construct these projections from the marginal tail bound and bound the failure probability of each.

Definition 44.34.1 Typical projection of a cut
✓

Let \(\Omega \) be a vector on a finite induced lattice domain \(\Lambda \), let \(A\subseteq \Lambda \), and let \(w\in \mathbb R\). Write \(\rho _A=\sum _jp_j|e_j\rangle \langle e_j|\) for an eigendecomposition of the reduced state \(\rho _A\) of \(\Omega \) on \(A\). The typical projection of \(A\) at width \(w\) is

\begin{align*} P_A^w=\sum _{j:\, p_j{\gt}0,\ |-\log p_j-S_\Omega (A)|\le w} |e_j\rangle \langle e_j|. \end{align*}
Theorem 44.34.2 Typical projection of one cut
✓

Let \(\Omega \) be a unit vector, \(A\subseteq \Lambda \), and \(w\in \mathbb R\). Then \(P_A^w\) is an orthogonal projection commuting with \(\rho _A\). Every retained eigenvalue satisfies \(p_j{\gt}0\) and \(\mathrm e^{-S_\Omega (A)-w}\le p_j\le \mathrm e^{-S_\Omega (A)+w}\). With \(K\) as in Theorem 42.13.2,

\begin{align*} 1-\operatorname {tr}(\rho _AP_A^w)\le \Pr \{ |K-S_\Omega (A)|{\gt}w\} . \end{align*}
Proof ▶

Since \(P_A^w\) is diagonal in the eigenbasis of \(\rho _A\), the trace \(\operatorname {tr}(\rho _AP_A^w)\) is the sum of the retained eigenvalues. Because \(\operatorname {tr}\rho _A=1\) and an eigenvalue contributes to \(1-\operatorname {tr}(\rho _AP_A^w)\) only when \(p_j{\gt}0\) and \(|-\log p_j-S_\Omega (A)|{\gt}w\), the stated tail bound holds.

Fix \(q\ge 1\), a range \(R\), a strength \(J\ge 0\), a gap \(\Delta {\gt}0\), and \(C_0\ge 0\). There exist constants \(C,c{\gt}0\) with the following property. Let \(n\ge 1\), let \(H\) be a range-\(R\) interaction of strength \(J\) on a finite induced lattice domain \(\Lambda \), and let \(\Omega \) be a unit ground vector with full-system gap \(\Delta \). Then every cut \(A\subseteq \Lambda \) with \(|\partial _\Lambda A|\le C_0n\) satisfies

\begin{align*} 1-\operatorname {tr}\bigl(\rho _AP_A^{n^{3/5}}\bigr) \le C\exp (-cn^{1/10}). \end{align*}
Proof ▶

Let \(C_1\) be the constant of Theorem 42.13.6 and set \(\vartheta =J/\Delta \). Then \(\mathcal B_A\le C_1(1+C_0n)\le C_1(1+C_0)n\). By Theorem 44.34.2 and (5) at \(w=n^{3/5}\), the failure probability is at most \(2\mathrm e^{\mathrm e/2}\exp (-n^{3/5}/(32\sqrt{(1+\vartheta )\mathcal B_A}))\). Since \(n^{3/5}/\sqrt{n}=n^{1/10}\), this bound is at most \(2\mathrm e^{\mathrm e/2}\exp (-cn^{1/10})\) with \(c=1/(32\sqrt{(1+\vartheta )C_1(1+C_0)})\).

Fix \(q\), \(R\), \(J\), \(\Delta \), and \(C_0\) as in Theorem 44.34.3, and an integer \(K\ge 0\). There exists a threshold \(N\), depending only on these parameters, such that for every \(n\ge N\), every such \(\Lambda \), \(H\), and \(\Omega \), and every three cuts \(X\), \(Y\), \(S_0\) with at most \(C_0n\) crossing edges each, the projections \(P_X=P_X^w\), \(T_Y=P_Y^w\), and \(Q_{S_0}=P_{S_0}^w\) at width \(w=n^{3/5}\) are orthogonal projections commuting with their respective reduced states, retain only positive eigenvalues in \([\mathrm e^{-S_\Omega (A)-w},\mathrm e^{-S_\Omega (A)+w}]\) for each cut \(A\in \{ X,Y,S_0\} \), and each satisfy a failure bound of at most

\begin{align*} \delta =n^{-2K}. \end{align*}

This is the projector construction in [ 286 , Section 10 ] preceding the Schmidt expansion of \(\Omega \).

Proof ▶

Since \(x^{20K}\mathrm e^{-cx}\to 0\) as \(x\to \infty \), setting \(x=n^{1/10}\) shows that the bound \(C\exp (-cn^{1/10})\) of Theorem 44.34.3 is at most \(n^{-2K}\) for all sufficiently large \(n\). Applying Theorem 44.34.2 to each of the three cuts gives the result.

44.35 The restoring operator of the amplification

In [ 286 , Section 10 ] , the proof of the amplification proposition constructs a restoring operator from the typical projections and establishes three estimates before introducing the constraint products. This section proves those three estimates for the ground state.

Throughout, \(\Omega \) is a unit vector on a finite induced lattice domain \(\Lambda \) with \(q\) levels per site, \(X,Y\subseteq \Lambda \) are disjoint, \(S_0=X\cup Y\), and \(Z'=\Lambda \setminus S_0\). For a width \(w\), write \(P_X=P_X^w\), \(T_Y=P_Y^w\), and \(Q=P_{S_0}^w\) for the typical projections of Definition 44.34.1. Write \(\rho _X=\sum _xp_x|x\rangle \langle x|\) in a full orthonormal eigenbasis \(\{ |x\rangle \} \), and call \(x\) selected when \(|x\rangle \) lies in the range of \(P_X\). Append two auxiliary systems \(s',e'\), each a copy of the state space on \(X\) with a fixed unit reference vector \(|0\rangle \). Define the restoring operator \(R_0\) on \(s',X,Y\) and the column operator \(B_0\) on \(s',e',X,Y\) by

\begin{align*} R_0 & =\sum _{x\ \mathrm{selected}}p_x^{-1/2} |x\rangle \langle 0|_{s'}\otimes Q\bigl(|x\rangle \langle 0|_X\otimes T_Y\bigr), \\ B_0 & =\sum _{x\ \mathrm{selected}}\ \sum _{y}p_x^{-1/2} |x\rangle \langle 0|_{s'}\otimes |y\rangle \langle 0|_{e'}\otimes Q\bigl(|x\rangle \langle y|_X\otimes T_Y\bigr), \end{align*}

where \(y\) runs over the full eigenbasis. Let \(\phi \) be \(\Omega \) with \(X\) relabelled as \(e'\) and \(|0\rangle \) tensored on \(X\) and \(s'\), and let \(\eta =\Omega \otimes \sum _x\sqrt{p_x}|x\rangle _{s'}|x\rangle _{e'}\).

Definition 44.35.1 Coordinates of the restoring operator
✓

Decompose the configuration space of \(\Lambda \) as the product of the configuration spaces of \(X\), \(Y\), and \(Z'\), and express the factor on \(X\) in the eigenbasis \(\{ |x\rangle \} \) of \(\rho _X\). In these coordinates, \(\Omega \) and \(Q\) determine \(R_0\), \(B_0\), \(\phi \), and \(\eta \).

Theorem 44.35.2 Mutual information of the collar
✓

For every unit vector \(\Omega \) and disjoint subsets \(X,Y\subseteq \Lambda \),

\begin{align*} I_\Omega (X:Z’)=S_\Omega (X)+S_\Omega (S_0)-S_\Omega (Y). \end{align*}
Proof ▶

Complementary regions of a pure state have equal entropy, so \(S_\Omega (Z')=S_\Omega (S_0)\) and \(S_\Omega (X\cup Z')=S_\Omega (Y)\).

The projection \(Q\) commutes with \(\rho _{S_0}\), and

\begin{align*} Q\le \mathrm e^{S_\Omega (S_0)+w}\rho _{S_0},\qquad T_Y\rho _YT_Y\le \mathrm e^{-S_\Omega (Y)+w}T_Y. \end{align*}
Proof ▶

Both \(Q\) and \(T_Y\) are spectral projections of the corresponding reduced states. Every eigenvalue selected by \(Q\) is at least \(\mathrm e^{-S_\Omega (S_0)-w}\), and every eigenvalue selected by \(T_Y\) is at most \(\mathrm e^{-S_\Omega (Y)+w}\). Both operator inequalities hold eigenvalue by eigenvalue in a common eigenbasis.

If \(1-\operatorname {tr}(\rho _AP_A^w)\le \delta \) for \(A=X,Y,S_0\), then each of \(P_X\), \(T_Y\), and \(Q\) moves \(\Omega \) by at most \(\sqrt\delta \) in norm.

Proof ▶

For any orthogonal projection \(P\) acting on a subsystem \(A\), \(\| P\Omega -\Omega \| ^2=1-\operatorname {tr}(\rho _AP)\).

Suppose \(1-\operatorname {tr}(\rho _AP_A^w)\le \delta \) for \(A=X,Y,S_0\), and set \(\mathcal I=I_\Omega (X:Z')\) and \(M_0=\exp \bigl((\mathcal I+3w)/2\bigr)\). Then

\begin{align*} \| R_0\| ,\ \| B_0\| & \le M_0, \\ \| P_\Omega R_0\phi \| & \le 1, \\ \| R_0^\dagger (L’)^\dagger \eta -\phi \| & \le 3\sqrt\delta +\| (L’)^\dagger \Omega -\Omega \| , \end{align*}

where the third inequality holds for every physical operator \(L'\).

Proof ▶

Selected eigenvalues satisfy \(p_x^{-1}\le \mathrm e^{S_\Omega (X)+w}\). By Theorem 44.35.3, the Gram operators of \(R_0\) and \(B_0\) are bounded above by \(\mathrm e^{S_\Omega (X)+S_\Omega (S_0)-S_\Omega (Y)+3w}=M_0^2\), where the equality uses Theorem 44.35.2. To bound \(\| P_\Omega R_0\phi \| \), set \(M_X=\operatorname {tr}_Y[(I_X\otimes T_Y)\rho _{S_0}Q]\); since \(Q\) commutes with \(\rho _{S_0}\), we have \(0\le M_X\le \rho _X\), and \(\rho _X\) is diagonal in the basis \(\{ |x\rangle \} \). The adjoint error bound follows by inserting \(P_X\), \(T_Y\), and \(Q\) in turn on \(\Omega \) and applying Theorem 44.35.4.

Theorem 44.35.6 The restoring operator at large scales
✓

Fix \(q\ge 1\), a range \(R\), a strength \(J\ge 0\), a gap \(\Delta {\gt}0\), \(C_0\ge 0\), and an integer \(K\ge 0\). There exists a threshold \(N\), depending only on these parameters, such that for every \(n\ge N\), every range-\(R\) interaction of strength \(J\) on a finite induced lattice domain with a unit ground vector \(\Omega \) of full-system gap \(\Delta \), and every pair of disjoint subsets \(X,Y\) such that \(X\), \(Y\), and \(S_0\) each have at most \(C_0n\) crossing edges, the estimates of Theorem 44.35.5 hold at width \(w=n^{3/5}\) with \(3\sqrt\delta =3n^{-K}\).

Proof ▶

Theorem 44.34.4 bounds the three tail weights \(1-\operatorname {tr}(\rho _AP_A^w)\) by \(\delta =n^{-2K}\), and \(\sqrt{n^{-2K}}=n^{-K}\).