28 Positive quasi-local constraints from a global gap
This chapter follows Section 4 of the two-dimensional area-law manuscript (Propositions 4.3 and 4.5 and Lemma 4.4), first on a general finite graph and then, in Section 28.2, on the induced lattice domains of the source. Let \(G\) be a finite graph and \(H=\sum _i h_i\) a sum of Hermitian terms, where \(h_i\) acts on a support \(X_i\) with anchor \(a_i\in X_i\), every support has graph diameter at most \(R\) and at most \(v_R\) sites, the norms of the terms meeting a site sum to at most \(b_0\), \(\| h_i\| \le J\), and the spheres of \(G\) grow at most polynomially. Suppose that \(H\Omega =E_0\Omega \) for a unit vector \(\Omega \) and that \(H-E_0I\ge \Delta (I-P_\Omega )\) with \(\Delta {\gt}0\), where \(P_\Omega =|\Omega \rangle \langle \Omega |\). Write \(E_{i,l}\) for the normalized partial-trace expectation onto the graph ball \(N_l(a_i)\) (Definition 33.9.12) and \(\alpha =p/(p+1)\) for a fixed integer \(p\ge 1\).
The construction filters each term with a smooth spectral filter of width \(\Delta /2\) whose time kernel \(f\) decays like \(e^{-c|t|^\alpha }\), removes its ground expectation, and takes the absolute value:
The expectation \(E_K\) onto a set of sites \(K\) preserves adjoints and the order, maps \([0,I]\) into \([0,I]\), and fixes every operator commuting with all operators acting outside \(K\); such an operator acts on \(K\). In particular \(E_K\) fixes \(|Y|\) for every Hermitian \(Y\) acting on \(K\), and \(Y^{1/2}\) acts on \(K\) for every \(Y\ge 0\) acting on \(K\).
\(E_K\) is the uniform average of the conjugations by products of on-site Weyl operators outside \(K\), and its values act on \(K\).
There are constants \(C\ge 0\) and \(c{\gt}0\), depending only on \(p,R,v_R,b_0,J,\Delta \) and the growth of the spheres, such that
and for every integer \(l\ge 0\) the operator \(k_{i,l}=E_{i,l}(k_i)\) lies in \([0,I]\) and satisfies \(\| k_i-k_{i,l}\| \le Ce^{-cl^\alpha }\). Each \(k_i\) acts on the connected component of \(a_i\).
The spectral filter multiplies the matrix element of \(h_i\) between energies \(E\) and \(E_0\) by \(\chi (E-E_0)\), which vanishes across the gap and equals \(1\) at \(E=E_0\); hence \(M_i\Omega =0\), \(\sum _iM_i=H-E_0I\) and \(\| M_i\| \le c_*\). Since \(M_i\le |M_i|\) and the kernel of \(M_i\) lies in that of \(|M_i|\), the first display follows. For the tail, the graph-ball localization of the dynamics (Theorem 33.9.16) is integrated against \(|f|\), splitting the time integral at \(|t|\) of order \(l\); the square-root estimate \(\| |A|-|B|\| \le ((\| A\| +\| B\| )\| A-B\| )^{1/2}\) transfers the bound to the absolute value, because \(E_{i,l}\) fixes \(|E_{i,l}M_i|\). Finally the Heisenberg evolution of \(h_i\) commutes with every operator acting outside the component of \(a_i\) (Lemma 33.9.9), hence so do the filtered term, its centering and its absolute value.
Let \(G_i=(I-k_i)^{1/2}\), \(K_i=k_i^{1/2}\), \(G_{i,l}=(I-k_{i,l})^{1/2}\) and \(K_{i,l}=k_{i,l}^{1/2}\). These are positive contractions, \(G_i\Omega =\Omega \), \(K_i\Omega =0\), \(G_{i,l}^2+K_{i,l}^2=I\), and \(\| G_i-G_{i,l}\| +\| K_i-K_{i,l}\| \le 2\| k_i-k_{i,l}\| ^{1/2} \le 2C^{1/2}e^{-(c/2)l^\alpha }\). The maps \(\mathcal E_i(B)=G_iBG_i+K_iBK_i\) and \(\mathcal E_{i,l}(B)=G_{i,l}BG_{i,l}+K_{i,l}BK_{i,l}\) are unital and completely positive, contractive after adjoining any auxiliary system, and \(\| (\mathcal E_i-\mathcal E_{i,l})\otimes \mathrm{id}\| \le 4\| k_i-k_{i,l}\| ^{1/2}\) uniformly in the auxiliary dimension. The map \(\mathcal E_{i,l}\) fixes every operator commuting with all operators acting on \(N_l(a_i)\), and \(\mathcal E_{i,l}\otimes \mathrm{id}\) fixes every operator commuting with \(A\otimes I\) for all operators \(A\) acting on \(N_l(a_i)\) (Theorem 28.10.1.4).
The square-root estimate \(\| U^{1/2}-V^{1/2}\| \le \| U-V\| ^{1/2}\) gives the root tails. The map \(v\mapsto Gv\oplus Kv\) is an isometry, and \(\mathcal E(B)\) is the compression of \(B\oplus B\) by it, also after tensoring with an identity. The difference bound follows from \(ABA-A'BA'=(A-A')BA+A'B(A-A')\). An operator commuting with the ball algebra commutes with \(k_{i,l}\), hence with both local roots. Both local roots commute with every operator acting outside the ball, so they act on the ball; with an auxiliary system, an operator commuting with \(A\otimes I\) for all such \(A\) therefore commutes with both Kraus operators of \(\mathcal E_{i,l}\otimes \mathrm{id}\), whose squares sum to the identity.
28.1 Truncation near a finite set
Fix a set \(S_0\) of sites and an integer \(r_0\ge 0\). For a label whose anchor has finite distance \(d_i^0=d(a_i,S_0)\) from \(S_0\) put \(r_i=\max \{ r_0,\lfloor d_i^0/2\rfloor \} \), \(\widetilde h_i=k_{i,r_i}\) and \(\widetilde X_i=N_{r_i}(a_i)\); if \(d_i^0=\infty \) put \(\widetilde h_i=k_i\) and let \(\widetilde X_i\) be the connected component of \(a_i\). Suppose every graph ball of radius \(d\) has at most \(K_b(d+1)^2\) sites and every site anchors at most \(\mu \) labels.
If \(\| k_i-k_{i,l}\| \le Ce^{-cl^\alpha }\) for all \(l\), then \(\| \sum _i\widetilde h_i-\sum _ik_i\| \le C'|S_0|e^{-(c/2)r_0^\alpha }\) with \(C'\) depending only on \(C,c,\alpha ,K_b,\mu \).
At distance \(d\) from \(S_0\) there are at most \(\mu |S_0|K_b(d+1)^2\) labels, and labels at infinite distance have no error. Since \(\max \{ r_0,u\} ^\alpha \ge (r_0^\alpha +u^\alpha )/2\), the series \(\sum _d(d+1)^2e^{-c\max \{ r_0,\lfloor d/2\rfloor \} ^\alpha }\) is at most \(e^{-(c/2)r_0^\alpha }\sum _d(d+1)^2e^{-(c/2)\lfloor d/2\rfloor ^\alpha }\), and the last series converges because stretched exponentials beat polynomials.
Use Theorem 28.2 with \(p=1\), so \(\alpha =1/2\), and fix \(C_0{\gt}0\). There is \(C_1\) such that for every real \(n\ge 2\) and every set \(S_0\) with \(|S_0|\le C_0n^2\) (the source states this for nonempty \(S_0\); for \(S_0=\varnothing \) every constraint is retained), with \(r_0=\lceil C_1(\log n)^2\rceil \) and \(\epsilon _n=\min \{ n^{-1000},g/4\} \): the truncated terms are positive contractions, \(\| \widetilde H-H_F\| \le \epsilon _n\), the ground energy of \(\widetilde H\) lies in \([0,\epsilon _n]\), its ground vector \(\widetilde\Omega \) is unique, its gap is at least \(g/2\), and after a choice of phase \(\| \widetilde\Omega -\Omega \| \le 2(\epsilon _n/g)^{1/2}\) and \(\frac12\| |\widetilde\Omega \rangle \langle \widetilde\Omega |-P_\Omega \| _1 \le (2\epsilon _n/g)^{1/2}\).
Lemma 28.1.1 bounds the error by \(C'C_0n^2e^{-(c/2)\sqrt{r_0}}\le C'C_0n^{2-(c/2)\sqrt{C_1}}\), and \(C_1\) is chosen once to make this at most \(\epsilon _n\) for all \(n\ge 2\). The remaining claims follow from the stability of a global gap under a perturbation of norm at most a quarter of the gap: a minimizer of the energy is an eigenvector, every vector orthogonal to it has energy at least \(g-\epsilon _n\), and the gap of \(H_F\) at \(\widetilde\Omega \) gives \(g(1-|\langle \Omega ,\widetilde\Omega \rangle |^2)\le 2\epsilon _n\). The ground vector is unique by Theorem 27.37.5 applied to the gap inequality of \(\widetilde H\) at its ground energy \(e_0\): for every \(\psi \) with \(\widetilde H\psi =e_0\psi \),
so \(\psi =\langle \widetilde\Omega ,\psi \rangle \widetilde\Omega \).
Let \(V\) be a finite set of physical sites with local dimension \(q{\gt}0\), and let \(\Omega \) be a unit vector satisfying \(H\Omega =E\Omega \). Fix \(X\subseteq V\). In a spectral basis of the reduced density on \(X\), select a set \(F\) of positive total mass \(z\), and write \(d=|F|\). Let \(\psi \in \mathcal H_{X^c}\otimes \mathbb C^d\) be the normalized selected Schmidt vector, with reduced density \(\rho \) on \(\mathbb C^d\). For each \(k\), the symmetric group \(S_k\) permutes the \(k\) copies of \(\mathbb C^d\); for an irreducible representation \(\lambda \) of \(S_k\), \(P_\lambda \) denotes the central projection of \((\mathbb C^d)^{\otimes k}\) onto its \(\lambda \)-isotypic component and \(\dim \lambda \) the dimension of \(\lambda \) [ 247 , Section 6 ] . Following the prevector and high-label comparators of [ 247 , Section 8 and Section 9, lines 50–59 ] , there is one sequence of irreducible representations \(\lambda _k\) of \(S_k\) such that the following assertions hold. Put
Here all factors are identified with the configurations of the original sites and two additional auxiliary sites. For every \(k{\gt}0\),
The symmetry projection permutes all physical and auxiliary copies simultaneously; the two other projections act on the complete auxiliary copy registers. Eventually in \(k\),
Positive selected mass gives \(\| \psi \| =1\). The common-label selection for the auxiliary marginal \(\rho \) of \(\psi \) gives the polynomial mass bound and the entropy asymptotic. Impose the same labels on the uniform auxiliary pair and the original physical vector: in replica coordinates put \(u_k=(I\otimes I\otimes L_k)(\Omega ^{\otimes k}\otimes \omega _d^{\otimes k})\). Then \(u_k\ne 0\) and \(\| u_k\| \le 1\); the equation \(H\Omega =E\Omega \) gives \((\overline H_k\otimes I)u_k=Eu_k\), and the Bell pair gives \((I\otimes L_k\otimes I)u_k=u_k\), \((I\otimes I\otimes L_k)u_k=u_k\) and invariance of \(u_k\) under the simultaneous permutation of all copies. Let \(U\) be the configuration isometry onto the original sites and the two auxiliary sites, so that \(\xi _k=Uu_k\). Then \(\| \xi _k\| =\| u_k\| \le 1\), \(\xi _k\ne 0\), and for every operator \(K\) and scalar \(c\),
Applying (14) to the four equations for \(u_k\) gives the energy, symmetry and two auxiliary equations for \(\xi _k\); the transported symmetrizer of all copies is \(P_{\mathrm{sym}}\).
In the setting of Theorem 28.1.3, suppose also that \(H-EI\geq \gamma (I-|\Omega \rangle \langle \Omega |)\) for some \(\gamma {\gt}0\). There is one label sequence \(\lambda _k\) satisfying all the conclusions of that theorem. Write \(S'=S(\rho )\) and set
Then \(2kS'-\varepsilon _k=2\log \dim \lambda _k\) for every \(k\), and \(\varepsilon _k/k\to 0\).
Fix \(K\geq 8\) and put \(a=4/K\), \(t=2/K\). There are constants \(c,C_f\geq 0\) before the copy number, symmetric coordinates, regional family and iterated weighted geometric mean are chosen. Let \(Z^*Z=I\) and \(ZZ^*=P_{\mathrm{sym}}\). For a finite family of physical regions \(Q_{jg},Y_{jg}\), with \(0\leq g{\lt}K\), assume
Include the near auxiliary site \(C\) in \(L_{jg}=Q_{jg}\cup \{ C\} \) and the far auxiliary site \(R\) in \(F_{jg}=(Q_{jg}\cup Y_{jg})^c\cup \{ R\} \), where the complement is taken in the physical sites. For the replica metric \(W\) at parameter \(t\), put
Here \(T\) is any iterated weighted geometric mean of the family, and \(\xi _k\) is the same initial vector as in the preceding theorem. Put \(\varphi _k=w_k/\| w_k\| \), \(v_k=Z\varphi _k\), and
The sequence \(R_k\) tends to zero and is independent of the chosen coordinates, regions and geometric mean. For every \(k{\gt}0\), \(w_k\ne 0\), \(\| v_k\| =1\), and \(\delta _k\geq 0\). For \(0{\lt}\tau \leq 1/2\),
This is the lower comparison for the physical initial vector of [ 247 , Section 8 ] . Choosing a scan point and identifying its regions and geometric mean remain separate assertions.
Choose the preceding theorem’s label sequence once and retain its initial vector, mass bound and dimension asymptotic. Positive selected mass gives \(d{\gt}0\). The initial vector’s symmetry and auxiliary equations supply the hypotheses of the rough lower comparison at \(t=2/K\) and inverse-power exponent \(1/4\). Apply the numerical coefficient-three estimate to its same normalized vector and energy defect. The signed definition of \(\varepsilon _k\) gives the exact label equality. The dimension asymptotic gives \(\varepsilon _k/k\to 0\); the remaining logarithmic terms are also sublinear. Hence \(R_k\to 0\).
This combines [ 247 , Section 4 ] with the comparators of [ 247 , Section 8 ] . Under the hypotheses of Theorem 28.1.2, the same constant \(C_1\), truncated Hamiltonian \(\widetilde H\), ground energy \(e\) and unit ground vector \(\widetilde\Omega \) satisfy all of its support, perturbation, gap and distance conclusions. For every region \(X\) and every positive-mass selection of the actual reduced spectrum of \(\widetilde\Omega \), this same vector also supplies the sequence and all the conclusions of Theorem 28.1.3, with \(H=\widetilde H\) and \(E=e\).
For \(X\subseteq S_0\) let \(b_X\) be the number of edges with exactly one endpoint in \(X\), let \(\mathcal C_X\) be the labels whose designated support meets both \(X\) and its complement, and put \(d_i=q^{|\widetilde X_i|}\) and \(\mathcal B_X=1+\sum _{i\in \mathcal C_X}\log ^2(ed_i)\).
Each truncated term \(\widetilde h_i\) acts on its designated support \(\widetilde X_i\). Every support in \(\mathcal C_X\) is a ball of radius exactly \(r_0\), \(|\mathcal C_X|\le 2\mu K_b(r_0+1)^2b_X\), \(\log d_i\le K_b(r_0+1)^2\log q\) for \(i\in \mathcal C_X\), and \(\mathcal B_X\le C(1+b_X)(r_0+1)^6\). If moreover \(r_0=\lceil C_1(\log n)^2\rceil \), \(n\ge 2\), \(D\ge 1\) and \(b_X\le C_2nD\), then \(\mathcal B_X\le C'nD(\log n)^{12}\). If \(S_0\) is empty every constraint is retained and no label crosses a cut contained in \(S_0\); constraints whose anchors cannot reach \(S_0\) are always retained exactly.
A support meeting \(X\subseteq S_0\) has an anchor at finite distance; if \(r_i{\gt}r_0\) then \(r_i=\lfloor d_i^0/2\rfloor {\lt}d_i^0\) and the ball cannot meet \(S_0\). A shortest path from the anchor to a point of the ball on the other side of the cut stays in the ball and contains a cut edge, so the anchor is within \(r_0\) of one of the at most \(2b_X\) endpoints of cut edges. Each such ball has at most \(K_b(r_0+1)^2\) sites and each anchor carries at most \(\mu \) labels.
Let \(V\) be the vertex set of a finite graph, let \(I\) be a finite label set with anchors \(a_i\in V\), and let \(q,r_0\in \mathbb N\) and \(S_0\subseteq V\). Use the designated supports \(\widetilde X_i\) of Theorem 28.1.6. For every cut \(X\subseteq V\), let \(\mathcal C_X\) consist of the original labels whose designated support meets both \(X\) and \(V\setminus X\). Then the geometric budget is exactly the supported-family budget in [ 247 , Lemma 3.1 ] :
Here \(\log 0=0\) when \(q=0\). Also, \(\mathcal C_{V\setminus X}=\mathcal C_X\), \(\mathcal B_{V\setminus X}=\mathcal B_X\ge 1\), and \(\mathcal B_\varnothing =\mathcal B_V=1\). No containment \(X\subseteq S_0\) is required. Repeated designated supports and zero terms keep their original labels.
The crossing conditions on each original label agree, and \(\prod _{v\in \widetilde X_i}q=q^{|\widetilde X_i|}\). Exchanging the two sides of the cut exchanges the two witnesses of crossing. Every summand is a square, and the empty and full cuts have no crossing labels.
28.2 The induced lattice instance
Let \(\Lambda \subset \mathbb {Z}^2\) be a finite domain with its induced nearest-neighbour graph, and let \(H=\sum _ih_i\) be an interaction of range \(R\) and strength \(J\) as in Definition 27.37.2, with one term for every nonempty support of induced-graph diameter at most \(R\). Choose an anchor \(a_i\in X_i\) for every support, and let \(\Omega \) be a unit vector with \(H\Omega =E_0\Omega \) and \(H-E_0I\ge \Delta (I-P_\Omega )\), \(\Delta {\gt}0\). Put \(v_R=1+2R(R+1)\) and \(\mu _R=2^{v_R-1}\). In this setting the counting hypotheses of the previous sections are consequences of the lattice geometry, and the constants depend only on the parameters named below.
Graph balls of radius \(d\) in \(\Lambda \) have at most \(2(d+1)^2\) sites, at most \(\mu _R\) supports contain a given site (Theorem 27.117.6), at most \(\mu _R\) labels share an anchor, and the pairs \((u,v)\) of adjacent sites with \(u\in X\) and \(v\notin X\) number at most \(|\partial _\Lambda X|\). The sphere bound, the diameter and size bounds for supports and the site budget are Lemma 36.7.1.
Adjacent sites are at ambient \(\ell ^1\) distance one, so a graph ball lies in an ambient lattice ball and the exact diamond count applies. Supports and anchors are counted by the interaction budgets of Theorem 36.4.3, and every label anchored at \(x\) has a support containing \(x\). The map \((u,v)\mapsto \{ u,v\} \) is injective on the pairs crossing \(X\).
Fix an integer \(p\ge 1\), put \(\alpha =p/(p+1)\), and fix \(R\ge 0\), \(J\ge 0\) and \(\Delta {\gt}0\). There are \(C\ge 0\) and \(c{\gt}0\), depending only on \(p,R,J,\Delta \), such that for every \(q\ge 1\), every finite domain, interaction, choice of anchors and gapped ground vector as above, the constraints \(k_i=|M_i|/c_*\) satisfy \(c_*{\gt}0\),
so \(H_F=\sum _ik_i\) satisfies \(H_F\ge g(I-P_\Omega )\) with \(g=\Delta /c_*\) and \(H_F\Omega =0\). For every integer \(l\ge 0\) the operator \(k_{i,l}=E_{i,l}(k_i)\) lies in \([0,I]\) and satisfies \(\| k_i-k_{i,l}\| \le Ce^{-cl^\alpha }\). Each \(k_i\) acts on the connected component of \(a_i\). This is Proposition 4.3 of [ 247 ] .
With \(p,R,J,\Delta \) as in Theorem 28.2.2 there are \(C\ge 0\) and \(c{\gt}0\), depending only on \(p,R,J,\Delta \), such that the roots \(G_i\), \(K_i\), \(G_{i,l}\), \(K_{i,l}\) and the channels \(\mathcal E_i\), \(\mathcal E_{i,l}\) of Lemma 28.3, built from the constraints of Theorem 28.2.2, satisfy every conclusion of that lemma with \(\| G_i-G_{i,l}\| +\| K_i-K_{i,l}\| \le Ce^{-cl^\alpha }\) and \(\| (\mathcal E_i-\mathcal E_{i,l})\otimes \mathrm{id}\| \le Ce^{-cl^\alpha }\) for every auxiliary system. This is Lemma 4.4 of [ 247 ] .
Insert the tail \(\| k_i-k_{i,l}\| \le Ce^{-cl^\alpha }\) into Lemma 28.3 and use \((Ce^{-cl^\alpha })^{1/2}=C^{1/2}e^{-(c/2)l^\alpha }\).
Take \(p=1\) in Theorem 28.2.2, so \(\alpha =1/2\), and fix \(C_0\ge 0\). There is \(C_1{\gt}0\), depending only on \(R,J,\Delta ,C_0\), such that for every lattice instance as above, every real \(n\ge 2\) and every set \(S_0\) of sites with \(|S_0|\le C_0n^2\), the truncation with \(r_0=\lceil C_1(\log n)^2\rceil \), \(g=\Delta /c_*\) and \(\epsilon _n=\min \{ n^{-1000},g/4\} \) has all of the following properties at once: each truncated term is a positive contraction acting on its designated support, \(\| \widetilde H-H_F\| \le \epsilon _n\), and \(\widetilde H\) has a unit ground vector \(\widetilde\Omega \) with ground energy \(e_0\in [0,\epsilon _n]\) and gap at least \(g/2\), the eigenspace of \(\widetilde H\) at \(e_0\) is spanned by \(\widetilde\Omega \), and after a choice of phase \(\| \widetilde\Omega -\Omega \| \le 2(\epsilon _n/g)^{1/2}\) and \(\frac12\| |\widetilde\Omega \rangle \langle \widetilde\Omega |-P_\Omega \| _1 \le (2\epsilon _n/g)^{1/2}\). This is the truncation part of Proposition 4.5 of [ 247 ] , which assumes \(S_0\) nonempty and \(C_0{\gt}0\).
The gapped ground vector gives \(H\Omega =E_0\Omega \) and \(H-E_0I\ge \Delta (I-P_\Omega )\). Apply Theorem 28.1.2 with \(v_R\) sites per support, site budget \(\mu _RJ\) and sphere growth \(2(d+1)^2\) from Lemma 36.7.1, and ball growth \(2(d+1)^2\) and at most \(\mu _R\) labels per anchor from Theorem 28.2.1. For every \(\psi \) with \(\widetilde H\psi =e_0\psi \), put \(\varphi =\psi -\langle \widetilde\Omega ,\psi \rangle \widetilde\Omega \); then \(0=\langle \varphi ,(\widetilde H-e_0I)\varphi \rangle \ge \frac g2\| \varphi \| ^2\), so \(\psi \in \operatorname {span}\{ \widetilde\Omega \} \) by Theorem 27.37.5.
For \(q\ge 1\) there is \(C\ge 0\), depending only on \(q\) and \(R\), such that for every finite domain, every choice of anchors, every \(S_0\), every \(r_0\) and every \(X\subseteq S_0\), with \(b_X=|\partial _\Lambda X|\), every designated support meeting both \(X\) and its complement is the ball of radius \(r_0\) about its anchor and
For \(C_1,C_2\ge 0\) there is \(C\), depending only on \(q,R,C_1,C_2\), such that \(r_0=\lceil C_1(\log n)^2\rceil \), \(n\ge 2\), \(D\ge 1\) and \(b_X\le C_2nD\) imply \(\mathcal B_X\le CnD(\log n)^{12}\). This is the crossing count and cut budget of Proposition 4.5 of [ 247 ] .
28.3 Finite collar histories and good-history sampling
Fix a finite domain \(\Lambda \subset \mathbb Z^2\), a color \(A\subset \Lambda \), and a nonempty finite target \(T\subset \mathbb Z^2\). Write \(d(x)=\min _{t\in T}\| x-t\| _\infty \) and \(T_j=T+[-j,j]^2_{\mathbb Z}\). The graph metric is that of the induced nearest-neighbor graph on \(\Lambda \). The following finite construction follows [ 247 , Section 9, moving partitions ] .
A physical partition assigns each site to the near side \(P_0\), the middle \(Y\), or the far side \(V\). For cutoffs \(u{\lt}v\), initially \(P_0=\{ x\in A:d(x)\le u\} \) and \(V=(\Lambda \setminus A)\cup \{ x\in A:d(x){\gt}v\} \). Order each positive-depth row once and pad it to \(n\) slots. Sites outside \(A\) and absent entries are blank. The far side visits rows in decreasing depth, using the same fixed order within each row. Fills alternate near, far, starting near. After \(k\) fills the two consumed slot counts are \(t_P=\lfloor (k+1)/2\rfloor \) and \(t_F=\lfloor k/2\rfloor \); the oriented fronts are \(j_P=u+1+\lfloor t_P/n\rfloor \) and \(j_F=-v+\lfloor t_F/n\rfloor \). A move of a set \(B\) transfers only \(B\cap Y\) to its receiving side. A charge transfers this set only if \(B\) meets both that side and \(Y\).
A blank or already assigned fill slot makes no physical move but increases its receiving side’s consumed count by one. Assignments never change sides, and the middle only decreases. For a selected set \(B\), the removed middle is exactly \(B\cap Y\). If all rows have at most \(n\) sites, a site remaining in the middle after \(k\) fills has oriented depth at least the corresponding nominal front.
If a site’s row is completed, its fixed index is less than \(n\), so it occurs in a consumed slot. A site initially outside the middle never enters it, and consuming its slot removes it from the middle regardless of earlier charges. Near slot \(t\) is consumed at fill \(2t\), far slot \(t\) at fill \(2t+1\).
For each band \(0\le g{\lt}K\), choose an independent uniform offset \(r_g\in \{ 0,\ldots ,m-1\} \) and set \(u_g=8gm+m+r_g\), \(v_g=8gm+5m+r_g\). Each charge chooses, independently in every band, a uniform side and a uniform slot among \(M\) fixed slots. A history after \(k\) fill–charge pairs consists of these \(K\) offsets and \(kK\) side–slot choices. Its classical weight is \(m^{-K}(2M)^{-Kk}\); a new charge has weight \((2M)^{-K}\). Evaluate each history recursively: first perform the next prescribed fill, then the chosen charge at the resulting front. A nonblank labelled slot selects its graph \(r_0\)-ball; a blank slot makes no move.
The picture shows the nominal partitions of \(A\) in two consecutive bands, ordered by depth, with \(X=A\cap T\) and \(U=P_0\setminus X\); arrows show the fill directions at the fronts, and brackets mark the charge intervals of oriented depth \([j-r_0,j+D]\) on the two sides.
For \(m,M{\gt}0\), the history weights are nonnegative and sum to one. Extending a history multiplies its weight by \((2M)^{-K}\). Each band’s offset has marginal probability \(1/m\), even after subsequent charges; each side–slot pair at the next charge has conditional probability \(1/(2M)\). Charges leave the nominal fronts unchanged. At every old charge history, each unassigned site lies on or beyond both oriented nominal fronts, provided its row has at most \(n\) sites.
There are \(m^K(2M)^{Kk}\) histories and \((2M)^K\) possible new charges. Fixing one coordinate divides the corresponding count by \(m\) or \(2M\). Induction on the recorded choices shows that every surviving middle site was initially unassigned and avoids every consumed fill slot. Apply Theorem 28.3.2.
For positive \(d\), the ambient depth row is \(T_d\setminus T_{d-1}\); its physical part has no larger cardinality. Graph distance bounds depth variation: \(|d(x)-d(y)|\le d_\Lambda (x,y)\). Let \(Z\) be the actual endpoints of edges crossing \(A\). If \(\operatorname {dist}_\infty (T,Z){\gt}2L+10r_0\), every graph \(r_0\)-ball meeting \(A\cap T_L\) is wholly contained in \(A\).
Minimize the integer sup-norm distance over \(T\). Each lattice edge changes that minimum by at most one; sum along a shortest graph walk. If a ball meeting \(A\cap T_L\) leaves \(A\), a path of length at most \(2r_0\) within the two radii crosses an edge with an endpoint of depth at most \(L+2r_0\), contradicting the clearance.
Suppose \(n,m\ge 2\), \(D\ge 1\), \(r_0\le D\), \(4D\le m\), \(8Km\le L\), and at most \(nm\) fills are consumed. Assume \(|T_d\setminus T_{d-1}|\le n\) for \(1\le d\le L\), and at most \(\mu \) labels have any fixed anchor. Each charge interval \([j-r_0,j+D]\) visits only unsigned depths in \([1,L]\). Its number of labels is at most \((D+r_0+1)n\mu \le 3\mu nD\). Thus \(C_1\ge 3\mu \) permits padding every list to \(M=\lceil C_1nD\rceil \), with a unique slot for every label, including labels with equal anchors. If \(C_1{\gt}0\), then \(M\le (C_1+1)nD\) and \(1/(2M)\ge [2(C_1+1)]^{-1}/(nD)\).
Sum the row cardinalities, then sum the anchor fibers. Either nominal front advances at most \(m\) rows; the band cutoffs and \(4D\le m\) keep the entire candidate interval in the collar. Ordering distinct labels gives distinct slots. Finally \(\lceil C_1nD\rceil \le C_1nD+1\le (C_1+1)nD\).
Retain the capacity and clearance assumptions, and suppose \(2r_0\le D\). An old charge history is good when every assigned site of \(A\) has oriented depth at most \(j+D/2\) on its receiving side. For every labelled graph \(r_0\)-ball meeting that side and the actual middle, the anchor lies in \([j-r_0,j+D]\). Its labelled slot is unique. Choosing this side and slot has probability exactly \(1/(2M)\), at least \(c/(nD)\) for \(c=1/[2(C_1+1)]{\gt}0\), and the extended physical history removes exactly the ball’s old \(Y\)-part from \(Y\).
An unassigned site has oriented depth at least \(j\), so the anchor has depth at least \(j-r_0\). The ball lies in \(A\) by clearance; an assigned site of the ball therefore has depth at most \(j+D/2\), giving anchor depth at most \(j+D/2+r_0\le j+D\). The unique-slot and classical marginal formulas give the probability. The actual charge transition transfers precisely the selected ball intersected with the old middle.
Set \(S_0=A\cap T_L\) and retain the good-history sampling assumptions. Every truncated designated support meeting a receiving side and the old middle is a graph \(r_0\)-ball. Its labelled side–slot event has probability exactly \(1/(2M)\ge c/(nD)\), and the actual extended history removes exactly the designated support’s old unassigned part.
The actual old middle is contained in \(S_0\). The receiving-side witness lies outside that middle, so the designated support crosses a subset of \(S_0\). Theorem 28.1.6 identifies its truncation radius with \(r_0\), including the potentially variable-radius and disconnected cases. Apply Theorem 28.3.7 to this equal ball.
Under the good-history sampling assumptions, let \(F_{g,s}(B)\ge 0\) be a nonnegative cost of a finite set of physical sites moved toward side \(s\) in band \(g\). Sum \(F_{g,s}(B_i\cap Y_g)\) over every splitting incidence \((g,s,i)\), where \(s\) is the receiving side and \(B_i\) is the labelled charge ball. If \(\Delta _g(c)\) is the actual set removed from \(Y_g\) by the simultaneous charge choice \(c\) and \(s_g(c)\) its selected side, then
For \(C_1{\gt}0\), the left coefficient may be replaced by \(1/[2(C_1+1)nD]\). Labels sharing an anchor retain separate summands.
For each band and realized side–slot pair, at most one labelled incidence is selected. Its cost is the cost of the actual removed middle set. All other event contributions are zero, and the realized cost is nonnegative. Sum this pointwise inequality against the classical choice weights, use the \(1/(2M)\) marginal for each available labelled slot, and interchange the finite sums over choices and bands.
The expected-cost lower bound also holds with the sum restricted to splitting incidences of the truncated designated supports, using their actual old middle parts. The cost may depend on the band and receiving side, and repeated labels remain distinct.
Every splitting designated support equals its charge ball, so its incidence and cost occur in the ball-incidence sum. All costs are nonnegative. Restrict that sum and apply Theorem 28.3.9.
For every finite actual history and every assigned site of \(A\), its oriented depth is at most \(j+D+r_0\), where \(j\) is its side’s current nominal front. This holds both for completed histories and immediately before a charge. Assume the ambient row bound through \(L\), \(8Km\le L\), and the stated clearance of \(T\) from the physical cut endpoints. If a radius-\(r_0\) ball meets a receiving side and the middle, its anchor’s oriented depth \(d_a\) satisfies
No good-history assumption is imposed. The exterior \(\Lambda \setminus A\) is not subject to the assigned-site lead bound.
Induct on the actual evaluator. A fill assigns only its scheduled row; a selected charge anchor is at most \(j+D\), and its ball adds at most \(r_0\). Later fronts do not decrease. An old middle site lies beyond the completed rows, giving the lower split-anchor bound. An assigned site in the ball gives the upper bound. The middle remains in the original compact collar, so cut clearance places the entire ball in \(A\); ambient depth variation follows from induced graph distance. These conclusions hold for all finite history lengths, hence throughout the manuscript’s finite scan horizon.
At fixed band, side and front time, at most \(a+b+1\) offsets place a fixed depth in \([j-a,j+b]\). Every history event contained in that interval event therefore has probability at most \((a+b+1)/m\), regardless of its dependence on later choices. If \(a+b\le m\), the centers’ spacing \(8m\) allows at most one band on each side to reach the fixed depth, even across different offsets. The union over both sides and all bands has probability at most \(2(a+b+1)/m\). Common convex mixtures preserve the bound.
The front is affine with coefficient \(1\) or \(-1\) in its offset. Inject it into the integer interval \([d-b,d+a]\). The exact marginal of an offset set is its cardinality divided by \(m\). Reindexing a new history into its old prefix and last charge gives exactly the leaf weights \(w_hq_c\); this identity holds for every real-valued function of the new history. For a fixed side the possible band is deterministic, because two different band centers cannot both be reached after allowing all offsets. Sum the two side bounds. This uses marginal domination, not independence of a state-dependent splitting event.
A label has a receiving–middle incidence if its designated truncated support meets a receiving side and the actual middle of one band. The terminal split event of [ 247 , Section 7, terminal split rule ] additionally requires exactly one receiving side and containment in a single part of every other band, so it is contained in this incidence event. These are the physical statuses \(P_0,Y,V\) underlying \(P=CP_0,Y,F=RV\). No dilution is asserted for arbitrary entropy cuts such as \(U=P_0\setminus X\), whose fixed inner boundary is not a terminal metric split.
Suppose \(n,m,D{\gt}0\), \(C_1{\gt}0\), \(r_0\le D\), \(4D\le m\), \(8Km\le L\), and the actual ambient row and cut-clearance hypotheses hold. For every label, the total classical weight of designated receiving–middle incidences in any band is at most
This bound holds for the old and new distributions of every fill or charge round, and for every common mixture parameter \(p\in [0,1]\).
The actual middle lies in the compact truncation set. The accepted variable-radius truncation result thus identifies every incident designated support with its radius-\(r_0\) ball. Apply the preceding interval theorem with \(a=r_0\) and \(b=D+2r_0\); their sum is at most \(m\). Apply the finite offset union bound and then convexity. The estimate concerns classical history weights before quantum state transport. It does not construct the remaining scanner data fields or the bad-history probability bound.
Every initial side assignment survives all subsequent fills and charges. For bands \(g{\lt}g'\), and for arbitrary independent histories and times, \(P_{0,g}\cup Y_g\subseteq P_{0,g'}\). The inclusion holds both after a completed fill–charge pair and immediately before a charge, including comparisons between these two kinds of status.
Moves only assign previously unassigned sites. Thus a site in \(P_{0,g}\cup Y_g\) lies in \(A\) and has depth at most \(8gm+5m+r_g\). Since \(r_g{\lt}m\) and \(g{\lt}g'\), this is at most \(8g'm+m+r_{g'}\). The site was therefore initially near in band \(g'\) and remains there. This argument does not require a time horizon or a good history.
Suppose \(n{\gt}0\), \(1\le D\), \(r_0\le D\), \(4D\le m\), and at most \(nm\) fills have occurred. At the offsets of one history, any physical depth belongs to at most one of the band–side intervals \([j-r_0,j+D+2r_0]\), interpreted with the side’s orientation. In comparing opposite sides of the same band, the offsets agree.
Each front advances through at most \(m\) rows. Opposite fronts start \(4m-1\) apart; allowing both advances and both leads still leaves a positive gap because \(2D+4r_0\le 6D{\lt}2m-1\). Distinct bands have centers spaced by \(8m\). Their offsets vary through fewer than \(m\) rows, so their possible front intervals are disjoint.
A support splits band \(g\) on one side when it meets \(Y_g\) and that receiving side, misses the opposite side, and is contained in a single physical part of every other band. This is the physical terminal split rule of [ 247 , Section 7 ] .
Assume the ambient row bound, physical cut clearance, \(8Km\le L\), \(n{\gt}0\), \(1\le D\), \(r_0\le D\), and \(4D\le m\). Every designated receiving–middle incidence is a terminal split with a unique band and side. For a completed history of \(k\) pairs require \(k\le nm\); for its pre-charge status require \(k+1\le nm\).
The actual middle lies in the original compact truncation set. Hence an incident designated support is its radius-\(r_0\) graph ball, and clearance places it wholly in \(A\). Its anchor satisfies the unconditional split interval. Separation makes the splitting band and side unique. A ball meeting the middle of band \(g\) lies within \(2r_0\) in depth of a point between that band’s initial cutoffs. It is therefore wholly in the initial far side of every earlier band and in the initial near side of every later band. Persistence gives containment in one actual part of each other band. No quantum commutation conclusion is asserted here.
Suppose \(n,m\ge 2\), \(1\le D\), \(r_0\le D\), \(4(D+2r_0)\le m\), \(8Km\le L\), and the ambient row and cut-clearance bounds hold. If at most \(\mu \) interaction labels have any fixed anchor, then
This holds for completed histories with \(k\le nm\) and for their pre-charge statuses with \(k+1\le nm\). Distinct labels with the same anchor are counted separately.
Each incident anchor lies in \([j-r_0,j+D+2r_0]\). Its unsigned depth remains between \(1\) and \(L\), by the expanded margin condition. The interval has \(D+3r_0+1\le 5D\) rows, each containing at most \(n\) actual sites and at most \(\mu \) labels per site. Summing over the two sides and \(K\) bands gives the bound. The terminal split count is bounded by the same count, since terminal splitting implies incidence.
Adjoin the fixed factors \(C\) and \(R\) to the physical near and far sides: \(P=C\sqcup P_0\), \(Y=Y_0\), and \(F=R\sqcup V_0\). The target \(X\) remains in \(P_0\); it is not removed from the near region. An enabled charge with selected ball \(B\) transfers exactly \(B\cap Y_0\) to the selected side. A blank slot or a ball not meeting both that side and the middle makes no move. History and conditional-choice mean trees retain their supplied shapes.
The augmented regions partition all physical and auxiliary factors. Every charge transfers a subset of the middle, and its new partition equals the actual partition of the extended physical history. If \(P_0\cup Y_0\subseteq P'_0\), then \(P\cup Y\subseteq P'\).
The auxiliary factors stay on their assigned sides. The actual charge changes precisely the previously unassigned sites of its selected ball.
Suppose every factor has positive dimension, \(t\ge 0\), and \((P,Y,F)\) and \((P',Y',F')\) are partitions satisfying \(P\cup Y\subseteq P'\). For every replica count, their band metrics
commute on the symmetric replica space. Their extensions by the identity on its orthogonal complement commute globally. Consequently, actual scanner bands satisfy cross-band commutation for arbitrary independent histories, times, and completed or pre-charge statuses, including every pair of terminal leaves of a charge round.
Let \(\Pi \) be the symmetric projection. Every regional metric and its inverse commutes with \(\Pi \). Complementary central label functions agree after multiplication by \(\Pi \), so \(W_F^{-1}\Pi =W_{P\cup Y}^{-1}\Pi \). This substitution is valid inside products because each intervening factor preserves the range of \(\Pi \). Each of \(P\), \(Y\), and \(P\cup Y\) is contained in \(P'\) and disjoint from \(Y'\) and \(F'\). Centrality for nested and disjoint regions makes the resulting factors commute with all three factors of \(A'\). Physical cross-band nesting applies to each old/completed status pair. No commutation assertion on the orthogonal complement is required for the original band metrics.
For positive offset and slot capacities, choose a fixed binary uniform tree for the finite initial offsets and a fixed binary uniform tree for one simultaneous charge choice. A tree with \(r+1\) leaves is constructed recursively from a first leaf of weight \(1/(r+1)\) and an \(r\)-leaf subtree of total weight \(r/(r+1)\). At every charge round, substitute the charge tree at each existing history leaf and append that charge to its label. Deterministic fills have a singleton conditional choice tree.
Each charge leaf has weight \((2M)^{-K}\) and each history after \(k\) charges has weight \(m^{-K}(2M)^{-Kk}\). Interpolating a charge at parameter \(p\) gives terminal weights \((1-p)w_h\) and \(pw_hq_c\). For positive definite matrix inputs, the old endpoint is the previous history tree evaluated at the old inputs; the new endpoint is exactly the recursively substituted next tree evaluated at its new inputs.
Induct over the fixed finite uniform tree and then over charge rounds. Write \(\mathcal H_k\) for the history tree after \(k\) charges, \(\mathcal C\) for the charge choice tree, and \(h\cdot c\) for the history obtained by appending charge \(c\) to \(h\). For a matrix family \(A\), write \(\mathcal T[A]\) for its evaluation along the fixed binary tree \(\mathcal T\). Distinct previous histories have disjoint sets of extended labels. The weights and evaluations satisfy
The geometric mean has the asserted positive definite endpoints. No reassociation of matrix means, or identification from equal classical distributions, is used. This statement does not construct the initial quantum vector or identify transported entropy measures.
Let \(\Lambda \subset \mathbb Z^2\) be finite and let \(B,C\subseteq \Lambda \). An unordered pair belongs to \(\partial _\Lambda B\) exactly when its sites are adjacent in the induced graph and exactly one belongs to \(B\). Complements are relative to \(\Lambda \), and
Consequently the boundary cardinalities of \(B\cup C\) and \(B\setminus C\) are at most \(|\partial _\Lambda B|+|\partial _\Lambda C|\). If \(R\subseteq \Lambda \) contains at least one site of each edge of \(\partial _\Lambda B\), then \(|\partial _\Lambda B|\le 4|R|\). In particular,
The last estimate is the changed-site bound in the proof of [ 247 , Lemma 9.1(2) ] .
Check membership of the two sites of each physical edge to obtain the three inclusions and complement equality. Inclusion of the domain into the lattice is injective on unordered pairs. Cover the image of the crossing edges by the at most four incident lattice edges at each site of \(R\), giving \(|\partial _\Lambda B|\le 4|R|\). Taking \(R=B\) gives the first cardinality estimate. Apply the same estimate to \(B\mathbin {\triangle } C\) and count the union in the last inclusion to obtain the changed-site bound.
Let \(\Lambda ,T\subset \mathbb Z^2\) be finite, let \(A\subseteq \Lambda \), and let \(Z\) consist of both sites of every edge of \(\partial _\Lambda A\). Fix integers \(L\ge 1\) and \(n,r_0\ge 0\), and suppose \(\| t-z\| _\infty {\gt}2L+10r_0\) for every \(t\in T\) and \(z\in Z\). Every ambient dilation \(T_j\) with \(0\le j\le L\) is disjoint from \(Z\). Suppose further that \(T\) is nonempty and that \(|T_d\setminus T_{d-1}|\le n\) for each integer \(1\le d\le L\). Set \(\delta (x)=\min _{t\in T}\| x-t\| _\infty \). For every integer \(j\le L\), define \(P_j=\{ x\in A:\delta (x)\le j\} \) and \(Q_j=\{ x\in A:0{\lt}\delta (x)\le j\} \). Then
The set identity holds for every integer-valued function \(\delta \). These are the full-row edge estimates used in [ 247 , Lemma 9.1(2) ] .
A point of \(T_j\cap Z\) would have sup-norm distance at most \(j\le L\) from \(T\), contradicting the clearance. For \(j\ge 0\), comparison with the ambient boundary gives \(|\partial _\Lambda P_j|\le |\partial T_j|\). When \(1\le j\le L\), each edge leaving \(T_j\) has its inside site in \(T_j\setminus T_{j-1}\); at \(j=0\), use its outside site in \(T_1\setminus T\). In either case the relevant row has at most \(n\) sites, so its incident edges give the bound \(4n\). For \(j{\lt}0\), nonnegativity of \(\delta \) makes \(P_j\) empty. Finally \(0{\lt}\delta (x)\) is equivalent to \(\delta (x)\not\le 0\), so \(Q_j=P_j\setminus P_0\). Subadditivity under set difference bounds its boundary by \(4n+4n=8n\).
Let \(T\) be finite and nonempty. Write \(d(x)=\operatorname {dist}_\infty (x,T)\) and set
For a physical status \((P_0,Y,V)\), let \(U=P_0\cap \{ d{\gt}0\} \) and \(UY=(P_0\cup Y)\cap \{ d{\gt}0\} \). These prefixes contain whole rows; the partially consumed nominal row contributes to the error estimate.
Let \(\Lambda ,T\subset \mathbb Z^2\) be finite, with \(T\) nonempty, and let \(A\subseteq \Lambda \). Give the collar scan the ambient depth \(d(x)=\min _{t\in T}\| x-t\| _\infty \), and put \(X=A\cap T\). For any band and any finite history, let \((P_0,Y,V)\) be its physical partition either after the completed fill–charge pairs or after the next prescribed fill and before its charge. With \(U=P_0\cap \{ d{\gt}0\} \) and \(UY=(P_0\cup Y)\cap \{ d{\gt}0\} \), one has
These are the moving-region identities of [ 247 , Section 9 ] .
Since \(d(x)\le 0\) is equivalent to \(x\in T\) and the initial near cutoff is nonnegative, every site of \(X\) is initially near. Every site outside \(A\) is initially far. These assignments persist through every fill and charge. Thus \(X\subseteq P_0\), and every site of \(P_0\cup Y\) with nonpositive depth belongs to \(X\). Separating the positive and nonpositive depths gives the two union identities. The three regions partition \(\Lambda \), so the far-region identity follows by taking the complement.
Let \(h\) be a finite collar history and let \(g\) be one of its bands. Consider either the physical partition after \(h\), or the partition after its next prescribed fill and before the next charge. Write \((P_0,Y_0,V_0)\) for its physical near, middle and far regions. Set \(X=A\cap T\) and \(U=P_0\cap \{ x\in \Lambda :d(x){\gt}0\} \). Let \(\iota \) include the physical sites into the domain obtained by adjoining two distinct auxiliary sites \(C\) and \(R\). The augmented partition is
The construction is that of [ 247 , Section 9, moving partitions ] .
Put \(W=(P_0\cup Y_0)\cap \{ x\in \Lambda :d(x){\gt}0\} \). The physical region identities give \(P_0=X\cup U\), \(P_0\cup Y_0=X\cup W\), and \(V_0=\Lambda \setminus (X\cup W)\). Thus \(X\cup W=(X\cup U)\cup Y_0=X\cup (U\cup Y_0)\). Substituting this into the expression for \(V_0\) gives the physical complement in (41). The auxiliary site \(C\) belongs to the near region and \(R\) to the far region; all physical sites retain their assignments under \(\iota \). This also gives (39) and the asserted middle region.
Let \(T\subset \mathbb Z^2\) be finite and nonempty, and let \(A\) be a finite physical color. For every integer \(j\), the positive-depth prefix satisfies \(Q_j=A\cap (T_{\max \{ j,0\} }\setminus T)\). These are the collars of [ 247 , Section 9 ] .
For \(j\ge 0\), the distance sublevel condition \(d(x)\le j\) is equivalent to \(x\in T_j\), while \(d(x)=0\) is equivalent to \(x\in T\) since \(T_0=T\). Removing the zero-depth points gives \(Q_j=A\cap (T_j\setminus T)\). For \(j{\lt}0\), nonnegativity of \(d\) makes \(Q_j\) empty, and \(T_{\max \{ j,0\} }\setminus T=T_0\setminus T\) is empty as well.
Let \(A\) be finite, let \(d\) be any integer-valued depth function, and let \(L\ge 0\) be an integer. For \(Q_j=\{ x\in A:0{\lt}d(x)\le j\} \) and \(j_+=\max (j,0)\), one has \(Q_j=Q_{j_+}\). Consequently, every integer cutoff \(j\le L\) selects a member of the fixed nested family
This family depends only on \(A,d,L\) and may contain repeated regions.
If \(j{\lt}0\), both \(Q_j\) and \(Q_0\) are empty. If \(j\ge 0\), then \(j_+=j\). For \(j\le L\) one also has \(0\le j_+\le L\), giving the required member of the displayed family. Nestedness follows directly from the cutoff inequalities.
Suppose \(n{\gt}0\) and \(8Km\le L\). Fix \(0\le g{\lt}K\), \(0\le r{\lt}m\) and \(0\le k\le nm\). Let \(j_N,j_F\) be the near and oriented far nominal fronts after \(k\) fills, and put \(v=8gm+5m+r\). Then
The upper endpoint satisfies \(v\le 8(g+1)m\le 8Km\le L\). Put \(u=8gm+m+r\). The near threshold is \(u\) plus the number of completed near advances, which is at most \(m\). Since \(v-u=4m\), this threshold is at most \(v\). The far threshold is \(v\) minus the nonnegative number of completed far advances, so it too is at most \(v\).
Fix the original region \(A\), its depth function \(d\) and the collar depth \(L\). Suppose \(n{\gt}0\) and \(8Km\le L\). The nested family \(Q_0,\ldots ,Q_L\), where \(Q_j=\{ x\in A:0{\lt}d(x)\le j\} \), then contains both \(Q_{j_N-1}\) and \(Q_{-j_F}\) for every band, offset and round within the fill horizon. This one family is fixed before all such choices.
Let \(S_0=\{ x\in A:d(x)\le L\} \) be the original compact truncation set. For every integer threshold \(j\le L\), the positive-depth prefix satisfies \(Q_j\subseteq S_0\).
If \(x\in Q_j\), then \(x\in A\) and \(d(x)\le j\le L\). Thus \(x\in S_0\).
Both \(R_j\) and \(Q_j\) are monotone in the integer cutoff \(j\). Suppose \(n{\gt}0\), \(D\ge 1\), \(r_0\le D\), \(4D\le m\), and \(8Km\le L\). After \(k\le nm\) consumed fills, put \(w=D+r_0\) and let \(j_N,j_F\) be the near and oriented far nominal fronts. Then
The same assertions apply to a pre-charge status using \(k+1\le nm\). All comparison prefixes therefore belong to one nested family, including comparisons from unrelated histories and bands.
Either side consumes at most \(nm\) slots and advances at most \(m\) rows. Substitute the actual band cutoffs \(8gm+m+r\) and \(8gm+5m+r\), with \(0\le r{\lt}m\). The stated scale inequalities separate the two lead intervals and place both uncertainty intervals in the physical rows.
Under the preceding scale conditions, actual row padding bounds and graph-ball depth variation give
These inclusions hold for completed and pre-charge histories within their respective horizons, without a good-history hypothesis.
Initial exterior sites remain far. Every unassigned site is on or beyond each nominal front, because all earlier slots were consumed. Assigned sites of \(A\) have oriented depth at most the relevant front plus \(w\). Separation rules out consumption by the opposite side. No assumption that a partial far row is a prefix in the near-side row order is used.
If \(R_a\subseteq E\subseteq R_b\), every row of depths \(a+1\) through \(b\) has at most \(n\) sites, and \(c\in \{ a,b\} \), then for any fixed site predicate \(Z\),
The preceding sandwiches have \(w+1=D+r_0+1\le 3D\) uncertainty rows. They give the same \(3nD\) estimate before and after removing the target.
For \(c=a\), only sites of \(E\setminus R_a\) can remain in the symmetric difference; for \(c=b\), only sites of \(R_b\setminus E\) can remain. In either case, filtering both sets by \(Z\) preserves the containment
There are \(\max (b-a,0)\) integer depths in this interval. Sum the row cardinalities, each at most \(n\). Apply this bound to the near-side and near-side-with-middle sandwiches, whose intervals each contain \(D+r_0+1\le 3D\) rows, including the partially consumed front row. Taking \(Z\) to be all sites or the positive-depth sites gives the bounds before or after removing the target, respectively.
Let \(T\) be nonempty, use its actual ambient depth and the induced physical lattice graph, and assume each ambient layer \(T_d\setminus T_{d-1}\) has at most \(n\) sites for \(1\le d\le L\). Under the preceding scale and horizon conditions, actual statuses satisfy
Physical depth rows inject into the corresponding ambient layers. Along a physical graph path, ambient depth varies by at most its length, so actual radius-\(r_0\) balls supply the depth-variation bound. Apply the proved actual-history sandwiches and count their uncertainty rows.
If the physical middle has positive depth, then \(Y=UY\setminus U\). For every physical status, \(V=\Lambda \setminus (P_0\cup Y)\).
The three regions \(P_0\), \(Y\), and \(V\) partition \(\Lambda \), so \(V\) is the complement of \(P_0\cup Y\). For the first identity, a site of \(Y\) has positive depth by assumption and is not in \(P_0\), so it lies in \(UY\) but not in \(U\). Conversely, a site of \(UY\) outside \(U\) has positive depth and is not in \(P_0\), so it lies in \(Y\).
In addition to the physical prefix-approximation hypotheses, suppose every endpoint of an actual cut edge of \(A\) has ambient distance greater than \(2L+10r_0\) from \(T\). Count each undirected physical edge once. Every completed status with \(k\le nm\) and every pre-charge status with \(k+1\le nm\) obeys
A full prefix has at most \(4n\) physical boundary edges and a positive-depth prefix has at most \(8n\). Changing at most \(3nD\) sites adds at most \(12nD\) edges, since the physical graph has degree at most four. Use \(D\ge 1\), subadditivity for \(Y=UY\setminus U\), and complement invariance for \(V\).
Let \((P,Y,F)\) partition all tensor factors, let \(x\subseteq Y\), and let \(\theta \) be a pure vector. With regional entropies of its reduced pure-state matrices, a move to \(P\) has entropy
A move to \(F\) has the same formula with \(P\) and \(F\) exchanged. Both empty moves have zero entropy. These balanced identities and inequalities require no normalization of \(\theta \).
The moved set and the two old receiving sides are pairwise disjoint, so regional strong subadditivity gives nonnegativity. Purity identifies the entropy of \(F\cup P\) with that of \(Y\), and the entropy of \(x\cup F\cup P\) with that of \(Y\setminus x\).
Fix an actual old history \(h\) and a pure vector \(\theta \) on the physical and auxiliary factors. For a physical trial set \(B\), band \(g\) and receiving side \(s\), put \(x=B\cap Y_{h,g}\) and define
Only physical sites are moved; the auxiliary factors remain in their respective receiving sides.
Every trial cost is nonnegative. If \(B\subseteq Y_{h,g}\), its moved set is exactly \(B\). Write \(\Delta _g(c)\) for the actual removed middle set and \(s_g(c)\) for the selected side of a simultaneous charge choice. Then
The old partition and the vector \(\theta \) are the same for every choice.
The intersection with the old middle gives a valid move for every trial set. An enabled actual charge removes its selected ball’s old-middle part. A disabled charge stays put; its removed set is empty and both associated entropy expressions are zero. Sum these equalities over bands.
Under the physical good-history sampling hypotheses of Theorem 28.3.10, let \(D_i\) be the actual truncated designated supports and let \(c=1/[2(C_1+1)]{\gt}0\). For every pure vector \(\theta \) on the physical and auxiliary factors,
Distinct interaction labels remain distinct summands even when their anchors coincide. The classical charge weights are \(q_{c'}=(1/(2M))^K\); they sum to one when \(M{\gt}0\). The inequality is pointwise before coherent-state and Fourier integration.
For \(m,M{\gt}0\), place the actual old charge partitions and actual selected-side moves on the recursive physical history tree. At each history use the fixed uniform charge-choice tree already used to construct the next history tree. No matrix mean is reassociated.
If \(m,M{\gt}0\), every history and conditional-choice leaf has positive weight. All old regions partition the physical and auxiliary factors, and every actual move transfers a subset of the old middle.
The recursive history weights are \(m^{-K}(2M)^{-Kk}\) and the conditional weights are \((2M)^{-K}\), both positive. The partition and move assertions follow from Theorem 28.3.21.
Consider an actual completed status after \(q\) fills, or the status after its next fill and before the corresponding charge. The physical near side remains in \(A\cap T_L\) whenever \(8Km\le L\). Suppose depth is ambient sup-norm distance to the nonempty target, supports use the induced graph of the finite domain, and the target has clearance greater than \(2L+10r_0\) from the cut endpoints. If the number of consumed fills is at most \(nm\), \(n{\gt}0\), \(r_0\le D\), \(D\ge 1\), and \(4D\le m\), no designated support meets both physical receiving sides. No depth-row cardinality or good-history condition is needed.
An initially far site remains far, so a current near site belongs to \(A\) and has depth at most \(8gm+5m+r\le L\). A designated support meeting near and far crosses this compact near set, hence is the radius-\(r_0\) ball. Clearance puts the whole ball in \(A\). For near and far witnesses \(x,y\), the assigned-lead bounds give \(d(x)\le j_P+D+r_0\) and \(-d(y)\le j_F+D+r_0\), whereas the ball gives \(d(y)-d(x)\le 2r_0\). Thus \(j_P+j_F+2D+4r_0\ge 0\). Each side consumes at most \(m\) complete rows, so \(j_P+j_F\le 1-2m\) and \(j_P+j_F+2D+4r_0\le 1-2m+6D{\lt}0\), a contradiction.
Under the hypotheses of Theorem 28.3.47 and the ambient row bound \(|T_d\setminus T_{d-1}|\le n\) for \(1\le d\le L\), every designated support in every completed or pre-charge status has one of the following forms at each band: it is contained in one part, or it meets the middle and exactly one receiving side and is contained in one part of every other band.
A support that is not contained in one of three parts meets at least two parts. The receiving-side separation forces one of them to be the middle. The designated middle-side incidence has a unique splitting side and is initially contained in one receiving side of every other band. Initial assignments persist through all subsequent moves.
Under the hypotheses of Theorem 28.3.48, adjoin \(C\) to the near side and \(R\) to the far side, leaving every designated support on physical tensor factors only. At every old and new terminal leaf of an actual charge round, each designated support lies in one part of every band except possibly one; in that band it meets the middle and exactly one receiving side. This holds for any supplied finite history and conditional-choice mean trees.
Inclusion into the physical tensor factors preserves containment, nonempty intersections, and disjointness. The auxiliary factors do not enter a support. Old leaves are pre-charge statuses, and new leaves are the completed statuses of the extended histories.
Suppose the physically embedded designated supports are compatible with the terminal partitions. At each old history and each pure vector, the sum of the receiving-side incidence costs equals the sum of the terminal split entropies over the interaction labels:
Distinct labels are retained even when their supports coincide.
A support contained in one part has no receiving-middle incidence. Otherwise compatibility gives exactly one receiving side and the middle. The conditional mutual information for that side is precisely its split entropy. Sum first over sides, then bands, then interaction labels.
At history \(h\), let \(\rho _{h,\varnothing }(p,u)\) be its old transported state, let \(\beta (u)\) be the Fourier weight, and let \(\mathcal H_\rho \) denote the coherent-state integral with density \(\rho \). Define
The old state in \(J_h\) is fixed while the conditional choice in the entropy symbol varies.
Continuous symbols are integrable. Finite continuous sums and scalar multiplication pass through the same old-state integral. For admissible transport data with positive factor dimensions, nonnegative metric parameter and commuting band metrics, \(f\le g\) implies \(J_h(f)\le J_h(g)\); nonnegative continuous symbols have nonnegative integrals. The conditional entropy symbol \(G_h\) is continuous and nonnegative, and the entropy gain is
If the common prevector is nonzero and symmetric and \(0{\lt}p{\lt}1\), then \(J_h(1)=1/2\). The entropy-gain formula uses the history weight \(w_h\), without the old terminal edge factor \(1-p\).
Positive coherent density preserves pointwise order. Continuity supplies coherent integrability, and the coherent-average trace identity together with transported trace integrability supplies Fourier integrability. Integral linearity gives the finite sums and the entropy-gain identity. For the stated prevector and parameter, the symmetric old state has trace one; its coherent mass is one and the Fourier weight integrates to one half.
For admissible transport data with positive factor dimensions, nonnegative metric parameter and cross-band commutation, fix a continuous real symbol \(F\), a history \(h\), a replica count \(k\ge 0\) and a supplied prevector. The function \(p\mapsto J_h(F)\) is almost everywhere measurable and integrable on both \((0,1)\) and \([0,1]\). Writing \(Q_F=(A_F+A_F^\dagger )/2\) for the Hermitian part of the coherent average \(A_F\), one has \(|J_h(F)|\le \| Q_F\| /2\) in the interior. Fixed finite weighted sums selected by a fixed history predicate retain this regularity, including the actual good-history charge defect. No symmetry or nonzero-prevector hypothesis is needed for these assertions.
For a zero prevector the filtered vector, its rank-one matrix and the trace-adjoint transported state are zero, so \(J_h(F)=0\). Otherwise the Hermitian transported state satisfies \(\operatorname {Re}\operatorname {Tr}(\rho Q_F) =\operatorname {Re}\operatorname {Tr}(\rho A_F)=\mathcal H_\rho (F)\). The parameter measurability and absolute-value estimate for transported Hermitian expectations therefore apply to precisely \(J_h(F)\). The uniform bound on the finite-measure interior gives integrability; the endpoints are null. Finite sums and fixed scalar weights preserve regularity. For the actual charge defect the finite split-entropy symbol is continuous in the coherent vector, and the actual admissibility and commutation statements supply the structural hypotheses.
Fix a collar scan with positive offset, charge-slot and auxiliary counts \(n,m,M\), positive finite factor dimensions, energy terms, a replica count \(k\ge 0\), a supplied prevector, and \(a\ge 0\). For \(0\le s{\lt}nm\), let \(\mathcal Q_s(p)\) be its actual good-history charge defect with metric parameter \(a/2\). Suppose \(0\le p_0{\lt}p_1\le 1\), \(\rho {\gt}0\), and \(B\in \mathbb R\) satisfy
Then some \(0\le s{\lt}nm\) and \(p\in [p_0,p_1]\) satisfy \(\mathcal Q_s(p)\le B/(\rho nm(p_1-p_0))\). This is the finite averaging step in the scanner argument of [ 247 ] , applied to the actual charge defects.
Each \(\mathcal Q_s\) is interval integrable on \([0,1]\), hence on \([p_0,p_1]\). Divide the integrated inequality by \(\rho \) and put \(c=B/(\rho nm(p_1-p_0))\). Finite averaging gives a stage \(s\) with \(\int _{p_0}^{p_1}\mathcal Q_s\le (p_1-p_0)c\). If \(\mathcal Q_s(p){\gt}c\) throughout \([p_0,p_1]\), strict positivity of the integral of \(\mathcal Q_s-c\) on \((p_0,p_1)\) contradicts this bound.
Assume the physical sampling hypotheses of Theorem 28.3.44, positive offset and charge-slot counts, positive physical and auxiliary factor dimensions, and a nonnegative metric parameter. Give each interaction its actual physically embedded designated support. Put
Then, for every good old history and every coherent vector,
and for every common prevector and interpolation parameter,
These inequalities establish entropy sampling for one actual charge round. They do not construct the common prevector or the remaining comparator and scanner estimates.
Actual geometry supplies terminal support compatibility. The pointwise sampling bound and the incidence identity give the first inequality. Integrate it in the same old state, then multiply by the nonnegative history weight and sum. Bad histories can be added because their choice entropy is nonnegative. The exact entropy-gain identity gives the result.
At fill index \(k\), read the scheduled padded row slot in each band. A blank slot makes no move. If the slot contains \(x\), transfer \(\{ x\} \cap Y\) to the scheduled receiving side. Keep the existing recursive history tree and use a singleton conditional choice tree at every history. The old partition is the completed physical status and the new partition is its following pre-charge status.
With positive offset and charge capacities, the actual fill tree has positive history weights and conditional probability one. Every move lies in the old middle, and its application gives exactly the scheduled physical fill. An already assigned singleton transfers the empty set. For positive local dimensions and \(t\geq 0\), terminal band metrics from distinct bands commute on the symmetric replica subspace, across independent histories and either old or new status.
A blank slot is the identity. An occupied slot assigns only the singleton’s unassigned part, so the augmented partition agrees with the physical update. Exact history weights give positivity, and the singleton choice has weight one. The ordered-band inclusions apply to all completed and pre-charge statuses.
Assume positive offset and charge capacities, positive local dimensions, and \(t\geq 0\). The ordered product of band metrics at every completed or pre-charge history is positive definite. The fill root at parameter zero is the existing history tree evaluated at its completed metrics; at parameter one it is the same tree evaluated at its pre-charge metrics. The latter is exactly the following charge root at parameter zero. The charge root at parameter one equals the next fill root at parameter zero, with the recursively substituted history tree.
Products of commuting positive definite band metrics are positive definite. A singleton conditional tree changes only its leaf input. The endpoints of the geometric mean therefore give both fill endpoints and the following charge’s old endpoint. Substituting each fixed charge tree gives the next recursive history tree exactly. No reassociation of matrix means is used.
Write \(T_k\) for the recursive history tree and \(C\) for the fixed charge-choice tree of Definition 28.3.23. Fix positive local dimensions, a replica count, and \(t\ge 0\). Let \(A_h\) be the completed-history metric and \(\widetilde A_h\) its pre-charge metric. Write \(h\frown c\) for the history obtained by appending charge \(c\), and \(T[A]\) for a tree evaluated at its terminal metrics. The endpoint substitutions are
Under the geometric hypotheses of Theorem 28.3.48, with \(k+1\leq nm\), the physical designated supports satisfy the transport compatibility condition at both terminal statuses of a deterministic fill. The history tree may be any supplied finite tree.
Old leaves are completed statuses and new leaves are pre-charge statuses. Their physical support classifications follow from the geometric hypotheses. Embedding in the physical tensor factors preserves containment and the unique two-part split; neither auxiliary factor enters a designated support.
In an arbitrary finite induced lattice domain, a graph ball of radius \(r_0\) has at most \((2r_0+1)^2\) sites. Each actual fill transfers at most one physical site, and each actual charge transfers at most \((2r_0+1)^2\) physical sites. If \(8Km\le L\), a designated support meeting both the middle and a receiving side of an actual completed or pre-charge status has the same bound.
Graph walks bound ambient sup-norm displacement, so each ball injects into an integer square of side \(2r_0+1\). A fill transfers the old middle’s intersection with its scheduled singleton; a charge transfers its intersection with the selected ball. Blank and disabled choices transfer the empty set. A splitting designated support crosses the old middle, which lies in the truncation set, and therefore has radius \(r_0\).
Assume \(8Km\le L\). Every designated support not contained in one physical part of an actual completed or pre-charge status equals its anchor’s radius-\(r_0\) graph ball. No row bound, clearance, goodness, or restriction on the number of consumed fills is required.
Such a support contains a site \(x\) outside the far side and a site \(y\) in a different part, so \(x\ne y\). Initial far assignments persist; hence \(x\in A\) and its depth is at most \(8gm+5m+r\le L\). The support crosses \(\{ x\} \subseteq A\cap T_L\). The crossing-support radius reduction gives the assertion. All witnesses are physical sites; the empty support, a singleton, and an all-far support are contained in one part.
For physical local dimension \(q\ge 1\), set \(\ell _q(r_0)=1+(2r_0+1)^2\log q\).
A physical region \(B\) has dimension \(q^{|B|}\) and \(\log (e\dim B)=1+|B|\log q\). Thus \(\ell _q(r_0)\ge 1\) bounds the logarithmic dimension of every actual charge transfer and, if \(8Km\le L\), every designated support not contained in one actual physical part. A fill has the sharper bound \(1+\log q\). Embedding a physical region among additional factors of arbitrary dimensions does not change its dimension.
Multiply the uniform physical factor dimensions and use the site counts, together with \(\log q\ge 0\). Only physical factors occur in the product.
Fix \(q\ge 1\) and \(C_r\ge 0\). For \(r_0=\lceil C_r\log ^2 n\rceil \) and \(\log n\ge 1\), \(\ell _q(r_0)\le [1+(2C_r+3)^2\log q]\log ^4 n\). Consequently a positive coefficient and a threshold for this bound may be chosen before the finite domain, labels, scanner, or history.
Rounding gives \(r_0\le C_r\log ^2 n+1\), hence \(2r_0+1\le (2C_r+3)\log ^2 n\). Square this inequality and use \(1\le \log ^4 n\) and \(\log q\ge 0\). Finally \(\log n\to \infty \).
Fix \(q\ge 1\), \(C_r\ge 0\), and real numbers \(c_{\mathrm{ent}},e_{\mathrm{ent}},c_{\mathrm{en}},e_{\mathrm{en}}\). There are \(C\ge 1\) and \(C_\ell \ge 0\) such that, for every \(n\) with \(\log n\ge 1\) and every \(1\le \ell \le \ell _q(\lceil C_r\log ^2 n\rceil )\),
Put \(E=\max (0,e_{\mathrm{ent}},e_{\mathrm{en}})\) and \(A=1+(2C_r+3)^2\log q\). Choose \(C_\ell =4E\) and \(C=1+(|c_{\mathrm{ent}}|+|c_{\mathrm{en}}|)A^E\). For either pair \((c,e)\), first use \(\ell \ge 1\) to increase the exponent to \(E\), and then use \(E\ge 0\) to increase the base:
Both constants depend only on the fixed parameters.
If \(q\ge 1\) and \(r\ge 1\), then \(\ell _q(r)\le (1+9\log q)r^2\). Consequently, for \(a\ge 0\) and any real \(c_0\), \(ar^2\le c_0/(1+9\log q)\) implies \(a\ell _q(r)\le c_0\). If \(c_0{\gt}0\), the radius-smallness threshold \(c_0/(1+9\log q)\) is positive and depends only on \(q\) and \(c_0\).
From \(r\ge 1\), obtain \(2r+1\le 3r\) and \(1\le r^2\). Hence \(1+(2r+1)^2\log q\le (1+9\log q)r^2\). Multiply by \(a\ge 0\) and apply the smallness premise. The denominator is positive since \(\log q\ge 0\).
Give every physical factor dimension \(q\ge 1\), with arbitrary sizes for \(C\) and \(R\). In every actual fill or charge round, each moved subsystem has logarithmic dimension at most \(\ell _q(r_0)\). If \(8Km\le L\), the same bound holds for a physical designated support whose split-leaf set is nonempty. No bound is imposed on a support contained in one part at every terminal leaf.
The moved subsystem is the physical old middle minus the physical new middle. Its physical embedding adds neither \(C\) nor \(R\). A split leaf supplies a band in which the physical support is not contained in one part. Apply the preceding cardinality and dimension bounds to the corresponding completed or pre-charge status.
For a local interaction \(H=\sum _i h_i\), a unit vector \(\Omega \), and \(\Delta {\gt}0\), put \(M_i=\mathcal F_{1,\Delta /2}(H,h_i)-\langle \Omega ,h_i\Omega \rangle I\) and \(k_i=|M_i|/c_*\), where \(c_*=\max \{ 1,J(\| f_{1,\Delta /2}\| _1+1)\} \). Truncate \(k_i\) near \(S_0=\{ x\in A:d(x)\le L\} \) at the variable radius of [ 247 , Proposition 4.5 ] , with base radius \(r_0\). Write the resulting term and designated support as \(\widetilde h_i\) and \(\widetilde X_i\). The augmented term is \(\widetilde h_i\otimes I_C\otimes I_R\), with designated support \(\widetilde X_i\) embedded among physical factors. The dimensions of \(C\) and \(R\) are independently specified.
Let \(V\) be a finite set of physical sites, each of dimension \(q\), and let the dimensions of \(C\) and \(R\) both be \(d\). Write \(X=\{ 0,\ldots ,q-1\} ^V\) for the physical configuration space. Identify the physical site \(v\) with \(v\) in \(V\sqcup \{ C,R\} \). The two successive adjoining operations place \(C\) at the first added site and \(R\) at the second. Let \(e\) be this identification of one-copy configurations and \(e_k\) its copywise extension. Let \(g_k\) group the configurations in the order \(X^k,C^k,R^k\), where each auxiliary configuration space has \(d\) elements. These are bijections also for zero dimensions and for \(k=0\).
Let \(H\) be an arbitrary matrix on the physical configuration space. Write \(\overline H_k=k^{-1}\sum _{j=0}^{k-1}H_j\) and define \(\overline H_0=0\). Let \(\widetilde H=H\otimes I_C\otimes I_R\) be expressed on \(V\sqcup \{ C,R\} \). Then
The bijection \(e\) preserves every physical coordinate and sends the first and second auxiliary coordinates to \(C\) and \(R\), respectively. This is the identity extension used in [ 247 , Proposition 7.4 and Section 8 ] .
The one-copy coordinate identities follow from the definition of \(e\). Reindex each term of the replica sum by \(e_k\) and regroup the physical copies and the joint auxiliary copies. This gives \(\overline{H\otimes I}_{k}=\overline H_k\otimes I\) in the regrouped coordinates. Equality of the joint auxiliary configurations is equivalent to equality of both their \(C\) and \(R\) configurations. The identity entries therefore agree under the final regrouping \(g_k\).
Let \(V\) be a finite set of physical sites, of common dimension \(q\), and let both auxiliary factors have dimension \(d\). Let \(H\) be an arbitrary physical matrix. In the successively augmented coordinates, let \(\mathsf H_k\) be the physical replica mean with both auxiliary identities, and in the coordinates \(V\sqcup \{ C,R\} \) let \(\overline{\widetilde H}_k\) be the replica mean of \(\widetilde H=H\otimes I_C\otimes I_R\). For the bijection \(e_k\) of Definition 28.3.69,
Both means are defined to be zero at \(k=0\). The identity includes zero dimensions and empty physical site sets. This is the original energy expectation used in [ 247 , Section 8, defect-mass comparison ] .
Theorem 28.3.70 expresses the scanner mean as the physical mean tensored with both auxiliary identities. The same formula defines \(\mathsf H_k\) in the successive coordinates. Their entries agree under \(e_k\), including the reciprocal convention \(0^{-1}=0\) at zero replicas.
Use the spaces, physical matrix and coordinate bijection of Theorem 28.3.71. For every vector \(w\) in the scanner configuration space, put \(w_O=w\circ e_k\). Then
The equality is complex-valued. It requires neither normalization nor a nonzero vector, and also holds at zero replicas.
Substitute the operator identity of Theorem 28.3.71. Reindex the finite sum defining the quadratic form by the bijection \(e_k\).
Suppose \(q\ge 1\), the scanner graph is the induced domain graph, and each anchor lies in its labelled interaction support. The augmented terms are positive contractions supported on their designated physical sets. Their sum is \((\sum _i\widetilde h_i)\otimes I_C\otimes I_R\), and their replica energy is the copy mean of this sum. The statement includes components disjoint from \(S_0\) and the convention \(S_0=\varnothing \), which retains every constraint.
The centered filter has norm at most \(\| h_i\| (\| f_{1,\Delta /2}\| _1+1)\), so normalization and the absolute value give a positive contraction. Admissibility places each interaction support in one induced-graph component, and filtering preserves support in that component. A ball expectation gives the finite-distance support; a retained component term keeps its component support. Tensoring with both identities preserves the order bounds and physical support. Linearity of identity extension and of the copy mean gives both sum identities.
Let \(q\ge 1\), let \(H=\sum _i h_i\) be a local Hamiltonian of range \(R\) and term norm bound \(J\in \mathbb R\), and take \(\| \Omega \| =1\) and \(\Delta {\gt}0\). Suppose the scanner graph is the induced domain graph and each anchor lies in its labelled interaction support. For any truncation depth \(L\in \mathbb N\), let \(\widetilde h_i\) be the physical terms of Definition 28.3.68, centered using this same \(\Omega \). Put
Assume a real \(e\) and a unit vector \(\widetilde\Omega \) satisfy
For every cut \(X\subseteq \Lambda \), put \(\rho _X=\operatorname {Tr}_{\Lambda \setminus X} |\widetilde\Omega \rangle \langle \widetilde\Omega |\) and \(s_X=S_{\widetilde\Omega }(X)\). Let \(K_X\) take the value \(-\log p_j\) with probability \(p_j\) for the positive eigenvalues \(p_j\) of \(\rho _X\), and let \(\mathcal B_X\) be the exact budget of the designated supports for \(S_0=\{ x\in A:d(x)\le L\} \). For every real \(u\) with \(|u|\le 1/(32\sqrt{(1+\vartheta )\mathcal B_X})\),
For every real \(w\),
The same \(e\) and \(\widetilde\Omega \) are used for every cut.
The physical truncated terms are positive contractions supported on their designated sets, by Theorem 28.3.73. Apply [ 247 , Lemma 3.1 ] to their physical sum, with term norm bound \(1\) and gap \(g/2{\gt}0\) from (75). Its parameter is \(1/(g/2)=2/g\). Theorem 27.117.4 identifies its marginal with \(\rho _X\), and Theorem 28.1.7 identifies its support budget with \(\mathcal B_X\). The original label set includes retained component terms even when the cut is not contained in \(S_0\).
Fix \(R\in \mathbb N\), \(J\ge 0\), \(\Delta {\gt}0\) and \(C_0\ge 0\). There is \(C_{\mathrm{tr}}{\gt}0\), depending only on \(R,J,\Delta ,C_0\), such that the following holds for every \(q\ge 1\), finite induced lattice domain \(\Lambda \), and local Hamiltonian \(H=\sum _i h_i\) of range \(R\) and term norm bound \(J\). Let \(\Omega \) be a unit vector with \(H\Omega =E_0\Omega \) and \(H-E_0I\ge \Delta (I-|\Omega \rangle \langle \Omega |)\). Take any scan at integer scale \(n\ge 2\), with the induced domain graph and every anchor in its labelled interaction support. For any \(L\in \mathbb N\), suppose
Form the physical truncated terms of Definition 28.3.68, centered at \(\Omega \), and put \(\widetilde H=\sum _i\widetilde h_i\) and \(g=\Delta /c_*\) and \(\epsilon _n=\min \{ n^{-1000},g/4\} \). There exist a real \(e\) and a unit vector \(\widetilde\Omega \) satisfying (75), with \(0\le e\le \epsilon _n\). For some real \(\theta \), the same vector satisfies
For this same vector, both marginal inequalities of Theorem 28.3.74 hold for every cut \(X\subseteq \Lambda \), with \(\vartheta =2/g\), the literal designated support budget \(\mathcal B_X\), every real \(w\), and every real \(u\) with \(|u|\le 1/(32\sqrt{(1+2/g)\mathcal B_X})\). The constant \(C_{\mathrm{tr}}\) is chosen independently of the scan’s charge-slot constant \(C_1\), and before \(q\), \(\Lambda \), \(H\), \(\Omega \) and the scan. Empty domains and empty \(S_0\) are permitted.
Choose \(C_{\mathrm{tr}}\) from Theorem 28.2.4 with the fixed \(R,J,\Delta ,C_0\). Apply it using the scan’s anchor map, \(S_0\) and \(n\). The graph, radius and original centering vector agree term by term, so its truncated sum is exactly \(\widetilde H\), with every original label retained. Its unit vector, eigen-equation and projector gap give (75). Retain its energy interval \(0\le e\le \epsilon _n\) and its phase and trace-distance estimates (80). Apply Theorem 28.3.74 to that single pair \((e,\widetilde\Omega )\) for all cuts. Terms in components disjoint from \(S_0\) remain in the physical sum. No auxiliary system is adjoined.
Fix \(q\ge 1\), \(R\in \mathbb N\), \(J\ge 0\), \(\Delta {\gt}0\) and \(C_T\ge 0\). There exist \(C_{\mathrm{tr}}{\gt}0\), \(C_B{\gt}0\) and \(N\ge 2\), chosen before the domain, Hamiltonian, ground vector, cut, scan and source exponents. Consider any instance of Theorem 28.3.75 with \(n\ge N\), except that the compact-volume bound is replaced by the following source geometry. Let \(T\) be a nonempty ambient target, \(d(x)=\operatorname {dist}_\infty (x,T)\), \(0{\lt}\ell _T{\lt}1\), \(L=\lfloor n^{1-\ell _T}\rfloor \), and \(r_0=\lceil C_{\mathrm{tr}}(\log n)^2\rceil \). Suppose \(|T|\le C_Tn^2\), each positive ambient dilation layer through depth \(L\) has at most \(n\) sites, and \(\operatorname {dist}_\infty (T,Z){\gt}2L+10r_0\), where \(Z\) is the set of endpoints of the actual cut edges. Set \(X=A\cap T\) and \(S_0=A\cap T_L\). Then
One pair \((e,\widetilde\Omega )\) satisfies every energy, phase-distance, trace-distance, moment and all-cut tail conclusion of Theorem 28.3.75. For the target marginal of this same vector, write \(p_i\) for its eigenvalues, \(s_X=S_{\widetilde\Omega }(X)\), \(w=n^{3/5}\) and \(\delta =n^{-100}\). Its literal labelled cut budget and canonical typical set satisfy
In particular, \(E\) is nonempty. Every \(i\in E\) obeys \(\mathrm e^{-s_X-w}\le p_i\le \mathrm e^{-s_X+w}\).
The source floor gives \(1\le L\le n\). Summing ambient layers gives \(|S_0|\le |T|+nL\le (C_T+1)n^2\). The zero-depth prefix is \(X\); clearance removes edges to the opposite color, and the prefix bound at depth zero gives \(|\partial _\Lambda X|\le 4n\). Choose \(C_{\mathrm{tr}}\) with \(C_0=C_T+1\) in Theorem 28.3.75. The lattice crossing estimate, retaining all original admissible labels, yields \(\mathcal B_X\le Cn(\log n)^{12}\). Replace \(C\) by \(\max \{ 1,C\} \). Theorem 28.1.7 gives \(\mathcal B_X\ge 1\), so the tail radius is positive. For fixed \(\vartheta =2/g\), the tail expression is bounded by \(C'\exp [-c'n^{1/10}/(\log n)^6]\le n^{-100}\) for \(n\ge N\). Choose this \(N\) before any instance and apply the all-cut tail estimate to the single vector already constructed. The canonical positive spectrum has mass at least \(1-\delta {\gt}0\), and its defining logarithmic window gives the stated exponential bounds. Zero eigenvalues are excluded.
The following assertion holds separately for an actual fill round and for an actual charge round. In each case there exist universal real constants \(c_0,C_{\mathrm{ent}},e_{\mathrm{ent}},C_{\mathrm{en}},e_{\mathrm{en}}\), with \(c_0{\gt}0\), chosen before all the data below.
Let \(\Lambda ,T\subset \mathbb Z^2\) be finite with \(T\ne \varnothing \), let \(q,R_{\mathrm{int}}\in \mathbb N\) with \(q\ge 1\), and let \(J\in \mathbb R\). Take a local Hamiltonian \(H=\sum _i h_i\) of range \(R_{\mathrm{int}}\) and term norm bound \(J\) on \((\mathbb C^q)^{\otimes \Lambda }\), a vector \(\Omega \) with \(\| \Omega \| =1\), and \(\Delta {\gt}0\). The labels \(i\) are the admissible interaction supports, with a fixed linear order. Let the scanner have color \(A\subseteq \Lambda \), parameters \(n,m,K,D,r_0\in \mathbb N\) and \(C_1\in \mathbb R\), the induced nearest-neighbor graph on \(\Lambda \), depth \(d(x)=\min _{t\in T}\| x-t\| _\infty \), and anchors \(x_i\in i\). Fix a stage \(s\in \mathbb N\) and a truncation depth \(L\in \mathbb N\) satisfying
Write \(T_j=T+[-j,j]^2_{\mathbb Z}\) and let \(Z\) consist of both endpoints of every edge crossing \(A\) in \(\Lambda \). For every integer \(1\le j\le L\) assume \(|T_j\setminus T_{j-1}|\le n\), and for every \(t\in T\) and \(z\in Z\) assume \(2L+10r_0{\lt}\| t-z\| _\infty \). Choose arbitrary independent integers \(d_C,d_R\ge 1\) for the auxiliary factors and put
Let \(a{\gt}0\) satisfy \(a\ell \le c_0\).
Use the actual recursive history tree at stage \(s\). For the fill assertion use its scheduled moves and singleton conditional choices; for the charge assertion use its actual pre-charge partitions, selected-side moves, and uniform side–slot choice trees. In both cases set \(t=a/2\) in the band metrics. Let \(\widetilde h_i\) and \(\widetilde X_i\) be exactly the truncated terms and designated supports of Definition 28.3.68 for \(H,\Omega ,\Delta ,L\). The energy terms and their replica sum are
Here the subscript \(b\) means insertion in copy \(b\), and \(\overline H_0=0\).
There exist sequences \(\beta ,\varepsilon :\mathbb N\to \mathbb R\), depending only on the fixed data above, such that \(\beta _r=O(\log (r+1))\) and \(\varepsilon _r\to 0\) as \(r\to \infty \), with the following properties for every \(r\in \mathbb N\) and every supplied nonzero symmetric vector \(\mathrm{pre}\in \operatorname {Sym}^r(\mathcal V)\). Write \(\mathcal M_r(p)\) for the actual interpolating root and set
Here \(N_{r,\mathrm{pre}}(p)\) is the nonnegative square root. Use the history weights \(w_h\), conditional weights \(q_{c\mid h}\), terminal weights \(\pi _j(p)\), transported states \(\sigma _{j,u}(p)\), coherent measures \(\mu _\sigma \), and Fourier weight \(m_{1/4}\) of [ 247 , Proposition 7.4 ] for this actual round and the vector in (91). Let \(C_h=A_h^{-1/2}B_hA_h^{-1/2}\), where \(A_h\) is the old metric and \(B_h\) the conditional choice-tree root. Let \(\mathcal J_i\) be the terminal leaves splitting \(D_i\), and set
Here \(\eta _{h,c,g}\) is the entropy of the actual move and \(\eta _{i,j}\) is the entropy of the designated support’s unique split. Then the following four conclusions hold.
For every \(0{\lt}p{\lt}1\), the function \(-\log N_{r,\mathrm{pre}}(p)^2\) is differentiable at \(p\), with
\begin{align} -\frac{d}{dp}\log N_{r,\mathrm{pre}}(p)^2 & =\mathcal L_{r,\mathrm{pre}}(p). \end{align}For every \(0{\lt}p{\lt}1\),
\begin{align} ra\mathcal G_{r,\mathrm{pre}}(p) -C_{\mathrm{ent}}raK a^{1/4}\ell ^{e_{\mathrm{ent}}} -\beta _r & \le \mathcal L_{r,\mathrm{pre}}(p). \end{align}For every \(0{\lt}p{\lt}1\) and \(E_0\in \mathbb R\) satisfying \(\overline H_r\mathrm{pre}=E_0\mathrm{pre}\),
\begin{align} \operatorname {Re}\langle v_{r,\mathrm{pre}}(p), \overline H_r v_{r,\mathrm{pre}}(p)\rangle & \le 2E_0+C_{\mathrm{en}}a^2\ell ^{e_{\mathrm{en}}} \mathcal E_{r,\mathrm{pre}}(p)+\varepsilon _r. \end{align}For every \(0\le p_0\le p_1\le 1\),
\begin{align} \int _{p_0}^{p_1}\left( ra\mathcal G_{r,\mathrm{pre}}(p) -C_{\mathrm{ent}}raK a^{1/4}\ell ^{e_{\mathrm{ent}}} -\beta _r\right)\, dp & \le \log N_{r,\mathrm{pre}}(p_0)^2 -\log N_{r,\mathrm{pre}}(p_1)^2. \end{align}
The sequences are chosen before \(r,\mathrm{pre},p,p_0,p_1,E_0\). The eigenvector equation is required only in the third conclusion.
Take the universal constants from [ 247 , Proposition 7.4 ] before fixing the physical data. By (85), \(m\ge 4D\ge 4\) and \(M=\lceil C_1nD\rceil {\gt}0\); hence the actual fill and charge trees are admissible. The actual energy terms satisfy \(0\le E_i\le I\) and \(\operatorname {supp}(E_i)\subseteq D_i\). The row, clearance, scale, and stage hypotheses give designated-support compatibility at every actual old and new leaf. Nested bands give cross-band commutation for every replica count at \(t=a/2\ge 0\). The physical dimension estimates give
Neither auxiliary factor belongs to a moved subsystem or a designated support. Apply the entropy and energy transport theorem to these actual trees and terms, with \(a\ell \le c_0\), obtaining \(\beta ,\varepsilon \) before the replica count and supplied vector, including its integral conclusion on closed subintervals of \([0,1]\). Finally, linearity of the copy mean gives
Substitute this identity in the eigenvector hypothesis and energy conclusion; the derivative, entropy, and integral conclusions are unchanged.
This is a one-round consequence of the sampling estimate and [ 247 , Proposition 7.4 ] . Under the joint geometric and Hamiltonian hypotheses of Theorems 28.3.55 and 28.3.77, consider one actual charge round and its literal good-history defect \(\mathcal Q(p)\). There are universal real constants \(c_0,C_{\mathrm{ent}},e_{\mathrm{ent}}\), with \(c_0{\gt}0\), such that for \(a{\gt}0\) and \(a\ell \le c_0\) there is a sequence \(\beta _r=O(\log (r+1))\) satisfying the following assertion. The constants are chosen before the geometry and Hamiltonian; the error sequence is chosen before the replica count and supplied vector. For every \(r\ge 0\), every nonzero symmetric supplied vector, and every \(0\le p_0\le p_1\le 1\), put \(\alpha =1/(2(C_1+1)nD)\). Here \(N\) and \(\ell \) are as in Theorem 28.3.77. Then
Both \(\mathcal Q\) and the entropy gain \(G\) are interval integrable on \([0,1]\). Integrating \(\alpha \mathcal Q(p)\le G(p)\) and multiplying by \(ra\ge 0\) gives \(ra\alpha \int _{p_0}^{p_1}\mathcal Q\le ra\int _{p_0}^{p_1}G\). Apply the integrated entropy estimate and move its two constant error terms to the right. Each contributes its value times \(p_1-p_0\). If \(p_0=p_1\), both sides of the resulting inequality vanish.
Fix one actual fill or charge round, its recursive history and choice trees, dimensions, and a supplied family of replica vectors \(\psi _k\). Let \(\Theta \) be the unit sphere of the one-copy space and set \(t=a/2\). For each terminal leaf \(j\), let \(\mu _{k,p,j}\) be the image on \(\Theta \) of
where \(dU\) is normalized Haar measure and \(\sigma _{k,p,j,u}\) is the transported state of the filtered vector obtained from this same \(\psi _k\). For \(a\ge 0\) the real density is nonnegative, so the maximum leaves it unchanged. The old and new measures are \(\mu _{k,p,(h,\mathrm{old})}\) and \(\mu _{k,p,(h,c,\mathrm{new})}\). History and choice weights are not part of these measures. The round uses the corresponding split entropies, choice entropy, logarithmic root norm and replica-energy expectation.
The assertions for the actual fill and charge rounds need no further hypothesis. For general finite transport data, the identities below are asserted for admissible data with cross-band commutation; the actual partitions and moves satisfy both conditions. Each measure is finite for every fixed real \(p\), every replica count, and every supplied vector. If \(a\ge 0\), every continuous real function \(f\) on the ambient one-copy vector space satisfies
If \(a\ge 0\) and \(\psi _k\) is nonzero and symmetric, each interior leaf has mass \(1/2\). The old leaf has zero measure at \(p=1\), and the new leaf has zero measure at \(p=0\). Under \(a\ge 0\) and the same nonzero symmetric-vector hypothesis, the complementary old and new leaves at \(p=0\) and \(p=1\) have mass \(1/2\). These statements include \(k=0\) for a supplied nonzero scalar vector.
The actual partitions and moves give admissibility and cross-band commutation. Apply the canonical Fourier-weighted coherent measure identity to each old or new terminal state. Its fixed-parameter compact unitary bound gives finiteness. A positive terminal weight gives trace one, so integrating the constant symbol gives \(\int m_{1/4}=1/2\). A zero terminal weight gives zero normalized derivative, state and measure.
The assertions for the actual fill and charge rounds need no further hypothesis. For general finite transport data, the identities below are asserted for admissible data with cross-band commutation; the actual partitions and moves satisfy both conditions. For \(a\ge 0\) and every real \(p\), the choice gain is the transport entropy gain, with history factor \(w_h\), and the charge defect is the actual good-history old-state split-entropy defect. On \(0\le p\le 1\), the round’s energy sum is exactly
with \(\pi _{h,\mathrm{old}}=(1-p)w_h\) and \(\pi _{h,c,\mathrm{new}}=pw_hq_{c\mid h}\). For the actual augmented truncated terms, the mean energy is the expectation of their actual replica Hamiltonian in the same filtered vector.
Apply (106) to the continuous choice entropy, split entropy and one-eighth-power split-entropy symbols. Finite sums pass through the common old-state integral. Unsplit leaves have zero split entropy. Separate each terminal sum into old and new leaves and substitute their weights; the clamp is the identity on \([0,1]\). Linearity of the copy mean identifies the actual replica Hamiltonian.
The finite-leaf estimates below follow the charge-energy argument in [ 247 , proof of Proposition 9.2 ] .
Give every local factor a positive dimension \(n_v\). For a partition \((P,Y,F)\) and a designated support \(B\), let \(x=B\cap Y\). The split entropy is nonnegative. On the unit sphere, either choice of receiving side satisfies
For every finite transport, the split entropy at each leaf is measurable on the unit sphere; for admissible transport it is also nonnegative. If the designated supports are compatible with the leaf partitions and \(\log (\mathrm e\prod _{v\in B_i}n_v)\le \ell \) whenever \(B_i\) has a split leaf, with \(\ell \ge 0\), then \(0\le \eta _{i,j}(\theta )\le 2\ell \) at every leaf. No dimension bound is required for a support with no split leaf.
The two choices are \(I_\theta (x:F\mid P)\) and \(I_\theta (x:P\mid F)\). Strong subadditivity gives their sign, and subadditivity and the entropy triangle inequality bound each by \(2S_\theta (x)\). The reduced state’s rank is at most \(\prod _{v\in B}n_v\), which gives (108). Compatibility leaves only the unique splitting band in the entropy sum; an unsplit support contributes zero. Continuity of the finite entropy sum gives measurability on the unit sphere.
Let \(w_h\ge 0\) and \(q_{c\mid h}\ge 0\) be finite probability weights. Fix finite old and new leaf measures of mass \(1/2\), nonnegative split entropies bounded by \(B\ge 0\), and a measurable old split entropy. Suppose at most \(N\ge 0\) labels split at each leaf and each label’s terminal split weight is at most \(d\ge 0\). For \(0\le p\le 1\), put
The energy sum with terminal weights \((1-p)w_h\) and \(pw_hq_{c\mid h}\) satisfies
The good-old contribution before multiplication by \(1-p\) is at most \(N^{7/8}\mathcal Q^{1/8}\), including when \(N=0\) or the total good weight is zero.
Hölder’s inequality for a leaf measure of mass \(1/2\) gives \(\int \eta ^{1/8}\le (\int \eta )^{1/8}\). Apply finite weighted Hölder to the good-history and split-label pairs. Their total weight is at most \(N\), so their contribution is bounded by \(N^{7/8}\mathcal Q^{1/8}\) without division by either weight. On each bad-old or new leaf, \(\int \eta ^{1/8}\le B^{1/8}/2\). Counting labels and summing probabilities gives respectively \(NB^{1/8}b/2\) and \(NB^{1/8}/2\). Retain the factors \(1-p\) and \(p\), then bound each label’s terminal split weight by \(d\).
Fix a finite physical domain \(\Lambda \), a nonempty target \(T\), physical dimension \(q\ge 1\), and independently chosen positive auxiliary dimensions. Let the scan use the induced domain graph and ambient sup-norm distance to \(T\) as depth. Fix a local Hamiltonian, any supplied vector \(\Omega \) and real \(\Delta \), and form their designated truncated supports and augmented terms by the formulas of Definition 28.3.68. Suppose
Every ambient row \(T_d\setminus T_{d-1}\) with \(1\le d\le L\) has at most \(n\) sites, at most \(\mathfrak m\) interaction labels have any fixed anchor, and every \(t\in T\) and physical cut boundary endpoint \(z\) satisfy \(d_\infty (t,z){\gt}2L+10r_0\). Let \(a\ge 0\), \(k\in \mathbb N\), and \(\psi _k\ne 0\) be a symmetric supplied replica vector. At \(0{\lt}p{\lt}1\), use the actual charge round at stage \(s\) with metric parameter \(a/2\) and this same vector. Set
With \(\mathcal Q\) the actual good-old charge defect and \(\mathcal E\) the literal energy error in (107),
The vector need not have norm one. The natural numbers \(K\), \(\mathfrak m\) and \(k\) may vanish. The constant \(\ell \) is independent of both auxiliary dimensions.
Every terminal split implies a receiving–middle incidence. The labelled incidence count bounds each leaf’s split count by \(A\), and unconditional dilution bounds each label’s total split weight by \(10D/m\). Only physical sites occur in the designated supports; a support having a split leaf has logarithmic dimension at most \(\ell \). Hence its split entropy is at most \(2\ell \), independently of the auxiliary sizes. For the same nonzero symmetric vector, every interior old and new leaf measure has mass \(1/2\). Substitute \(N=A\), \(B=2\ell \) and \(d=10D/m\) in (111), and use the literal scalar identities to identify \(\mathcal Q\), \(b\) and \(\mathcal E\).
Fix admissible finite transport data, a nonnegative metric parameter \(t\), a natural replica count \(k\) with cross-band commutation, and the supplied vector \(\psi _k\). For a fixed good-history predicate and the original history weights, the literal round’s defect \(\mathcal Q_k\) is almost-everywhere measurable on \((0,1)\) and \([0,1]\), and integrable on \([0,1]\). This applies to both actual fill and charge rounds with \(t=a/2\) and \(a\ge 0\), for the same supplied family of vectors. No symmetry, nonzero-vector or positive-copy hypothesis is needed.
The finite split-entropy symbol \(F_h(\theta )=\sum _i\eta _{i,(h,\mathrm{old})}(\theta )\) is continuous in the coherent vector. The exact scalar identity is
An unsplit term is zero by its defining entropy sum. Apply parameter integrability of the old-state integral to the finite weighted sum in (117); pointwise equality transfers the two regularity conclusions. Null endpoints preserve the original endpoint values. Actual admissibility and cross-band commutation provide the hypotheses for each kind of round. For charge rounds, the identity with the actual good-history entropy defect gives the same closed-interval conclusion directly.
28.3.1 A common marginal moment bound for physical statuses
Suppose \(8Km\le L\). If a physical partition preserves every initial far-side assignment of a band, every site outside its far side lies in \(S_0=\{ x\in A:d(x)\le L\} \). In particular, \(V^c\subseteq S_0\) at every completed and pre-charge status, with no time-horizon or row assumption.
A site outside \(A\), or above the initial upper cutoff, is initially far and stays far. Every other site has depth at most \(8gm+5m+r\le 8Km\le L\), since \(g{\lt}K\) and \(r{\lt}m\). Fills and charges preserve all assigned sites.
The physical marginal regions at a status are \(XU,V,Y,U,UY\), where \(XU\) is the near receiving side, \(V\) is the far side, \(Y\) is the middle, and \(U,UY\) are the positive-depth portions of \(XU,XU\cup Y\), respectively. Coincident and empty regions are allowed.
Fix \(q\ge 1\), the interaction range \(R\), and \(C_r\ge 0\). There is \(C_B{\gt}0\), chosen before the finite domain and scanner, with the following property. Use the induced lattice graph and anchors in their original admissible supports. Suppose \(n\ge 2\), \(T\ne \varnothing \), depth is ambient sup-norm distance to \(T\), and
Assume \(|T_d\setminus T_{d-1}|\le n\) for \(1\le d\le L\), and every endpoint of a physical cut edge of \(A\) has ambient distance greater than \(2L+10r_0\) from \(T\). One common number \(\mathcal B=C_B nD(\log n)^{12}\ge 1\) bounds the designated-support budget of every region in Definition 28.3.1.2, at every completed status with \(k\le nm\) and every pre-charge status with \(k+1\le nm\).
The regions \(XU,Y,U,UY\) lie in \(V^c\subseteq S_0\). For \(V\), apply the lattice estimate to \(V^c\) and use complement invariance of both the cut-edge count and the labelled budget. The actual boundary counts are \(16nD\) for \(XU,V\), \(20nD\) for \(U,UY\), and \(40nD\) for \(Y\). The lattice logarithmic estimate with coefficient \(40\) therefore gives one constant \(C\) for every status. Take \(C_B=C+1\). Applying the same estimate to the empty cut, whose budget is one, proves \(\mathcal B\ge 1\) even when there are no bands.
For \(\vartheta \ge 0\) and \(0{\lt}B\le B'\), the radius \([32\sqrt{(1+\vartheta )B}]^{-1}\) decreases when \(B\) is replaced by \(B'\). Under the physical ground-state hypotheses of Theorem 28.3.74, suppose the designated-support budget of a cut \(Q\) is at most \(\mathcal B\). Put \(C_0=512\mathrm e(2/g)\) and \(c_0=[32\sqrt{1+2/g}]^{-1}\). For every real \(u\) with \(|u|\le c_0/\sqrt{\mathcal B}\),
where \(p_j\) are the eigenvalues of the marginal of the same physical ground vector \(\widetilde\Omega \).
Factor \(\sqrt{(1+\vartheta )B}=\sqrt{1+\vartheta }\sqrt B\) and use monotonicity of the square root and its positive reciprocal. The larger budget restricts the interval and increases the nonnegative quadratic term in the existing moment estimate.
Fix \(R\), \(J\ge 0\), \(\Delta {\gt}0\), and \(C_{\mathrm{card}}\ge 0\). There is \(C_{\mathrm{tr}}{\gt}0\) such that, for each \(q\ge 1\), there is \(C_B{\gt}0\), both chosen before the domain, Hamiltonian and scanner. Assume the original Hamiltonian has the ground vector and gap of Theorem 28.3.75, that \(|S_0|\le C_{\mathrm{card}}n^2\), and that the geometric hypotheses of Theorem 28.3.1.3 hold with \(C_r=C_{\mathrm{tr}}\). There are one pair \((e,\widetilde\Omega )\) and one number \(1\le \mathcal B\le C_BnD(\log n)^{12}\) such that the truncated sum has ground vector \(\widetilde\Omega \), energy \(e\) and projector gap \(g/2\). This pair retains
for a real phase \(\theta \). The positive constants \(C_0=512\mathrm e(2/g)\) and \(c_0=[32\sqrt{1+2/g}]^{-1}\) give (119) for all five physical regions, every completed status with \(k\le nm\), every pre-charge status with \(k+1\le nm\), and every real \(u\) in the same interval \(|u|\le c_0/\sqrt{\mathcal B}\).
Choose the truncated ground vector once, before all cut and history indices, retaining its energy and distance bounds. Choose the geometric coefficient with radius coefficient \(C_{\mathrm{tr}}\), and apply the common-interval estimate to every actual status cut. The original \(\Omega \) continues to center every positive constraint.
Fix \(C_r\ge 0\) and real exponents \(0{\lt}\kappa {\lt}\mu \) and \(\ell \). For all sufficiently large integer \(n\), put \(L=\lfloor n^{1-\ell }\rfloor \), \(m=\lfloor n^\mu \rfloor \), \(D=\lceil n^\kappa \rceil \), and \(K=L/(8m)\) with integer division. Then \(n\ge 2\), \(r_0=\lceil C_r(\log n)^2\rceil \le D\), \(D\ge 1\), \(4D\le m\), and \(8Km\le L\). The threshold may depend on the fixed exponents. The last inequality holds for all natural \(L,m\).
The squared logarithm is smaller than \(n^\kappa \) eventually. Also \(n^{\mu -\kappa }\ge 8\) eventually and \(\lceil n^\kappa \rceil \le n^\kappa +1\le 2n^\kappa \) for \(n\ge 2\). Thus \(4\lceil n^\kappa \rceil \le n^\mu \), so the integer left side is at most \(\lfloor n^\mu \rfloor \). Integer division gives \(8Km\le L\).
Let \(T\ne \varnothing \) be a finite ambient target and let \(A\) be any subset of the finite physical domain. Suppose \(n,L\in \mathbb {N}\), \(L\le n\), \(C\in \mathbb {R}\), \(|T|\le Cn^2\), and \(|T_d\setminus T_{d-1}|\le n\) for \(1\le d\le L\). Then \(|A\cap T_L|\le (C+1)n^2\).
The actual physical collar injects into \(T_L\). Summing its ambient layers gives \(|T_L|\le |T|+nL\le Cn^2+n^2=(C+1)n^2\). This also applies when \(L=0\) or \(A=\varnothing \).
Fix real exponents \(0{\lt}\mu {\lt}1-\ell \). For all sufficiently large integer \(n\), the exact integer quotient \(K=\lfloor n^{1-\ell }\rfloor /(8\lfloor n^\mu \rfloor )\) is at least one. The threshold may depend on \(\mu \) and \(1-\ell -\mu \).
Eventually \(n\ge 1\) and \(n^{1-\ell -\mu }\ge 8\). Hence \(m=\lfloor n^\mu \rfloor \ge 1\) and \(8m\le 8n^\mu \le n^{1-\ell }\), so \(8m\le L=\lfloor n^{1-\ell }\rfloor \). Division by the positive integer \(8m\) gives \(K\ge 1\).
Fix \(R\), \(J\ge 0\), \(\Delta {\gt}0\), \(C_T\ge 0\), and \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \). There are \(C_{\mathrm{tr}}{\gt}0\) and \(N\ge 2\), chosen before the local dimension, such that for every \(q\ge 1\) there is \(C_B{\gt}0\) chosen before the physical domain, Hamiltonian and scanner. Use an original gapped ground vector as in Theorem 28.3.1.5, the induced lattice graph, and anchors in their original supports. For \(n\ge N\), use the literal scales \(L=\lfloor n^{1-\ell }\rfloor \), \(m=\lfloor n^\mu \rfloor \), \(D=\lceil n^\kappa \rceil \), \(K=L/(8m)\) with integer division, and \(r_0=\lceil C_{\mathrm{tr}}(\log n)^2\rceil \). Suppose \(T\ne \varnothing \), depth is ambient sup-norm distance to \(T\), \(|T|\le C_Tn^2\), \(|T_d\setminus T_{d-1}|\le n\) for \(1\le d\le L\), and every endpoint of a physical cut edge of \(A\) has ambient distance greater than \(2L+10r_0\) from \(T\).
Then \(K\ge 1\). There are one pair \((e,\widetilde\Omega )\) and one number \(1\le \mathcal B\le C_BnD(\log n)^{12}\) satisfying all the spectral, energy, phase and trace-distance conclusions of Theorem 28.3.1.5. The positive constants \(C_0=512\mathrm e(2/g)\) and \(c_0=[32\sqrt{1+2/g}]^{-1}\) give (119) for every actual region \(XU,V,Y,U,UY\), every completed status with \(k\le nm\), every pre-charge status with \(k+1\le nm\), and every real \(u\) with \(|u|\le c_0/\sqrt{\mathcal B}\), using that same \(\widetilde\Omega \).
Choose the truncation coefficient for the compact-volume coefficient \(C_T+1\). Choose one threshold for the radius coefficient and fixed exponents so that \(r_0\le D\), \(D\ge 1\), \(4D\le m\), and \(K\ge 1\); integer division always gives \(8Km\le L\). Since \(\ell {\gt}0\) and \(n\ge 1\), the floor gives \(L\le n\). Theorem 28.3.1.7 supplies \(|S_0|\le (C_T+1)n^2\). Apply Theorem 28.3.1.5 with these derived inequalities, retaining its single truncated ground vector.
For a fixed scanner with \(m,M{\gt}0\), index its rounds by integers \(0\le j{\lt}2nm\) and put \(s_j=\lfloor j/2\rfloor \). Write \(\mathcal Q=(\{ 0,1\} \times \{ 0,\ldots ,M-1\} )^K\) for the charge choices. The history and conditional-choice sets are
The transport data \(\mathscr D_j\) are the actual fill data at stage \(s_j\) for even \(j\) and the actual charge data at stage \(s_j\) for odd \(j\). Thus round zero is a fill, rounds zero and one both have empty charge history, and rounds two and three both have one completed charge. Every round has exactly \(K\) bands. Empty physical moves remain among these rounds. A property depending on the conditional-choice sets and transport data can be proved separately for the fill and charge cases, identifying their conditional-choice sets with \(\mathcal C_{j,h}\).
Fix an actual fill or charge round, with positive physical and auxiliary dimensions \(q,d\), scan scale \(m{\gt}0\), padded charge capacity \(M{\gt}0\), and interpolation scale \(a/2\). Let \(H=\sum _i\widetilde H_i\) be the sum of its truncated physical terms, formed from the same reference state. For any supplied replica vector \(\mathrm{pre}_k\) and any real interpolation parameter \(p\), let \(\mathcal M\) be its mean at the parameter clamped to \([0,1]\). Put
with the normalized vector interpreted as zero when its numerator is zero. The mean energy of this round satisfies
where \(\mathsf H_k\) is the physical replica mean of \(H\), extended by both auxiliary identities in the successive physical, \(C\), \(R\) coordinates. This is the replica mean in [ 247 , Section 9, scanner energy output ] . The equality includes \(k=0\). It imposes no eigenvalue equation or additional assumption on the supplied vector.
The actual mean energy is the real part of the scanner replica energy in its filtered vector. Apply Theorem 28.3.72 to that same vector and take real parts.
Use an actual charge round with \(m,M{\gt}0\), physical and auxiliary dimensions \(q,d{\gt}0\), and metric parameter \(a/2\) with \(a\ge 0\). For every integer \(k\ge 0\), every nonzero supplied vector \(\mathrm{pre}_k\), and every real \(p\), the filtered vector \(v\) has norm one. Write \(v_O=v\circ e_k\) for the same vector in the successive physical, \(C\), \(R\) coordinates, and retain the physical Hamiltonian \(H=\sum _i\widetilde H_i(\Omega )\) formed from the original reference vector \(\Omega \). Write \(\mathcal E_k(p)\) for the mean energy of this actual charge round.
Let \(\widetilde\Omega \) be a supplied unit vector, separately from \(\Omega \). Suppose \(g{\gt}0\) and
For \(k\ge 1\), suppose that \(v_O\) is invariant under simultaneous copy permutations and lies in the two auxiliary isotypic spaces labelled by \(\lambda _C,\lambda _R\). Let \(\mathsf D_k=\sum _{j=0}^{k-1}(I-|\widetilde\Omega \rangle \langle \widetilde\Omega |)_j\) be the physical-copy defect count. For \(\tau {\gt}0\), let \(\Pi _{k,\tau }\) be the product of its closed spectral projection \(\mathbf1_{(-\infty ,\tau k]}(\mathsf D_k)\), the two auxiliary label projections, and the projection onto simultaneous copy symmetry, all in the coordinates of \(v_O\). Then
This is the gap estimate of [ 247 , Section 8, defect-mass comparison ] , applied to the vector of the actual charge round.
The actual metric root is positive definite. The nonzero initial vector therefore gives \(\langle v,v\rangle =1\), and the coordinate bijection preserves its norm. The gap estimate for the common low-defect projection bounds its loss of mass by the excess replica mean energy divided by \(g\tau \). Substitute the actual energy identity of Theorem 28.3.1.11.
There exist universal real constants \(c_0,C_{\mathrm{ent}},e_{\mathrm{ent}},C_{\mathrm{en}},e_{\mathrm{en}}\), with \(c_0{\gt}0\), chosen before all the following data.
Let \(\Lambda ,T\subset \mathbb Z^2\) be finite with \(T\ne \varnothing \), \(q,R_{\mathrm{int}}\in \mathbb N\) with \(q\ge 1\), and \(J\in \mathbb R\). Let \(H=\sum _i h_i\) be a local Hamiltonian of range \(R_{\mathrm{int}}\) and term norm bound \(J\) on \((\mathbb C^q)^{\otimes \Lambda }\), with its admissible support labels in a fixed linear order. Fix \(\| \Omega \| =1\) and \(\Delta {\gt}0\). Take a scanner of color \(A\subseteq \Lambda \), with parameters \(n,m,K,D,r_0\in \mathbb N\) and \(C_1\in \mathbb R\), the induced nearest-neighbor graph on \(\Lambda \), depth \(d(x)=\min _{t\in T}\| x-t\| _\infty \), and anchors \(x_i\in i\). For a truncation depth \(L\in \mathbb N\), assume
Put \(T_d=T+[-d,d]^2_{\mathbb Z}\) and let \(Z\) contain both endpoints of every edge crossing \(A\) in \(\Lambda \). Assume \(|T_d\setminus T_{d-1}|\le n\) for every integer \(1\le d\le L\), and \(2L+10r_0{\lt}\| t-z\| _\infty \) for every \(t\in T\) and \(z\in Z\). Fix arbitrary auxiliary dimensions \(d_C,d_R\ge 1\) and put
Fix \(a{\gt}0\) with \(a\ell \le c_0\) and use \(t=a/2\) in every band’s metric. Let \(\mathscr D_j\) be the actual round family of Definition 28.3.1.10.
Use one energy family for all rounds: let \(\widetilde h_i\) and \(\widetilde X_i\) be the actual truncated terms and designated supports of Definition 28.3.68 for \(H,\Omega ,\Delta ,L\), retaining every original support label, and set
The subscript \(b\) denotes insertion in copy \(b\).
There exist \(C_\beta \ge 0\) and sequences \(\beta ,\varepsilon :\mathbb N\to \mathbb R\) such that, for every \(k\in \mathbb N\),
These choices precede the round \(j\), replica count \(k\), supplied nonzero symmetric vector \(\mathrm{pre}\in \operatorname {Sym}^k(\mathcal V)\), interpolation parameters, and energy eigenvalue. For every such \(j,k,\mathrm{pre}\), let \(\mathcal M_{j,k}(p)\) be the actual interpolating root and set
For this round, let \(\mathcal L_{j,k,\mathrm{pre}}\), \(\mathcal G_{j,k,\mathrm{pre}}\), and \(\mathcal E_{j,k,\mathrm{pre}}\) be the derivative, entropy-gain, and energy-error expressions in Theorem 28.3.77, with the actual history and conditional-choice trees of \(\mathscr D_j\). In particular, the energy error retains both split probabilities: writing \(\mathcal J_{j,i}\) for the leaves splitting \(\widetilde X_i\), its expression is
Then for every \(0{\lt}p{\lt}1\),
For every \(E_0\in \mathbb R\) satisfying \(\overline H_k\mathrm{pre}=E_0\mathrm{pre}\), the energy conclusion is
For every \(0\le p_0\le p_1\le 1\),
The common errors may depend on the fixed physical data, auxiliary dimensions, \(a\), and finite family, but are independent of \(j,k,\mathrm{pre},p,p_0,p_1,E_0\). This does not assert a uniform limit when the system or auxiliary dimensions grow with \(k\). At \(k=0\), the energy premise and \(\mathrm{pre}\ne 0\) force \(E_0=0\). No physical prevector or identification with a fixed physical ground energy is asserted.
Choose the universal constants once from the finite-family form of [ 247 , Proposition 7.4 ] . For every \(j{\lt}2nm\), \(s_j+1\le nm\), including the final charge at \(s_j=nm-1\). The scale assumptions give \(m{\gt}0\) and \(M=\lceil C_1nD\rceil {\gt}0\). Split according to the parity of \(j\). The actual fill and charge constructions give admissibility, designated-support compatibility, cross-band commutation for every \(k\), and the moved-subsystem and split-support dimension bounds by \(\ell \). Both cases have the same \(K\), dimensions, and positive supported energy terms \(E_i\). Apply the finite-family theorem once to \(\{ \mathscr D_j\} _{j{\lt}2nm}\). It chooses nonnegative common errors and the all-count logarithmic bound before the round and vector. Finally the replica sum of \(E_i\) is exactly (135); substitute this identity only in the energy expression and its eigenvector premise.
Fix a scanner with \(m,M{\gt}0\), positive factor dimensions, \(t\ge 0\), and a replica count \(k\ge 0\). Let \(\mathcal M_{j,k}(p)\) be the actual round roots, and let \(P_{s,k}\) be the root at parameter zero of the fill after \(s\) completed charges. Whenever \(j+1{\lt}2nm\), \(\mathcal M_{j,k}(1)=\mathcal M_{j+1,k}(0)\). If \(nm{\gt}0\), the last charge satisfies \(\mathcal M_{2nm-1,k}(1)=P_{nm,k}\).
For any supplied vector \(\mathrm{pre}\) in the replica space, set \(N_{j,k,\mathrm{pre}}(p)^2 =\| \mathcal M_{j,k}(p)^{-1/4}\mathrm{pre}\| ^2\) and \((N^{\mathrm{fill}}_{s,k,\mathrm{pre}})^2 =\| P_{s,k}^{-1/4}\mathrm{pre}\| ^2\). Then
For the zero vector, use the convention \(\log 0=0\). No symmetry assumption is needed. If \(n=0\), the sum is empty and both remaining roots are \(P_{0,k}\). The assertion also holds at \(k=0\).
For every integer \(r\ge 0\), let \(B_{r,k}\) be the root at parameter zero of the fill at stage \(r/2\) when \(r\) is even, and of the charge at stage \((r-1)/2\) when \(r\) is odd. The exact fill and charge identities give \(\mathcal M_{j,k}(0)=B_{j,k}\) and \(\mathcal M_{j,k}(1)=B_{j+1,k}\). Also \(B_{2s,k}=P_{s,k}\). With \(F(r)=\log \| B_{r,k}^{-1/4}\mathrm{pre}\| ^2\), the sum in (146) is \(\sum _{j{\lt}2nm}(F(j)-F(j+1))=F(0)-F(2nm)\).
There exist universal real constants \(c_0,C_{\mathrm{ent}},e_{\mathrm{ent}}\), with \(c_0{\gt}0\), such that the following holds. Assume the geometric, Hamiltonian, dimension, and smallness hypotheses of Theorem 28.3.1.13, in particular \(n{\gt}0\) and \(a\ell \le c_0\). There exist \(C_\beta \ge 0\) and a sequence \(\beta :\mathbb N\to \mathbb R\), chosen before the replica count and supplied vector, with \(0\le \beta _k\le C_\beta \log (k+2)\). For every \(k\ge 0\) and every nonzero symmetric vector \(\mathrm{pre}\in \operatorname {Sym}^k(\mathcal V)\),
Here \(t=a/2\), and the entropy gains are those of Theorem 28.3.1.13. The fixed physical and auxiliary dimensions precede the choice of \(\beta \). No energy eigenvector equation or initial or final norm comparison is assumed. At zero replicas the left side is zero and the total error term is \(2nm\beta _0\).
Choose the universal constants and common error from Theorem 28.3.1.13 once, before the replica count and vector. Actual band nesting gives cross-band commutation. Together with admissibility and \(\mathrm{pre}\ne 0\), this gives integrability of each entropy gain on \([0,1]\) by the integrated transport argument in [ 247 , Proposition 7.4 ] . Moving the constant error outside each full-round integral gives
Sum over all \(2nm\) rounds, including fills. The logarithmic terms reduce by (146), and the common error occurs exactly \(2nm\) times, giving (148). This is the telescoping step of the scanner argument in [ 247 , proof of Proposition 9.2 ] .
Let \(b_s\) be the classical weight of bad old histories after \(s\) complete fill–charge pairs. For \(s\le H\) and positive charge capacity, \(b_s\) is at most the weight of full histories of length \(H\) having a bad completed prefix.
Fix \(C_r,C_1{\gt}0\), \(C_T\ge 0\), anchor multiplicity bound \(\mathfrak m\in \mathbb N\) and \(P\in \mathbb R\). Use the final scanner exponents \(\ell =10^{-5}\), \(\kappa =10^{-6}\) and \(\mu =1/4\), and set
There is \(N\), depending only on these fixed quantities, such that for all \(n\ge N\) the following holds for every physical scan. Assume \(T\ne \varnothing \), \(|T|\le C_Tn^2\), the induced domain graph, ambient target-distance depth, ambient row sizes at most \(n\) through depth \(L\), anchor multiplicities at most \(\mathfrak m\), and cut clearance greater than \(2L+10r_0\). Then
The first statement holds for every scan with positive charge capacity, without the geometric assumptions above. The margin \(4(D+2r_0)\le m\), together with \(n\ge 2\), \(r_0\le D\), \(1\le D\) and \(8Km\le L\), holds eventually for any real \(\ell \), any \(C_r\ge 0\) and any fixed \(0{\lt}\kappa {\lt}\mu \), with its threshold allowed to depend on these quantities; only the bound on \(b_s\) uses the listed physical assumptions.
The exact prefix marginal writes \(b_s\) as the expectation of its indicator over full histories. Goodness through every completed prefix implies goodness of every old charge state, so the bad-old event is contained in the bad-through event. Apply the all-time inverse-power estimate of [ 247 , Lemma 9.1 ] ; no additional factor counting rounds is introduced. For the counting margin, eventually \(r_0\le D\) and \(n^{\mu -\kappa }\ge 24\). Since \(n^\kappa \ge 1\), \(12\lceil n^\kappa \rceil \le 24n^\kappa \le n^\mu \). Taking the floor gives \(4(D+2r_0)\le 12D\le m\).
With the scales and physical assumptions of Theorem 28.3.1.16, one threshold \(N\) gives the following estimate simultaneously for every charge \(s+1\le nm\), every positive local and auxiliary dimension, every supplied local Hamiltonian and vector \(\Omega \), every \(\Delta \in \mathbb R\), every \(a\ge 0\), replica count \(k\ge 0\), nonzero symmetric supplied vector \(\psi _k\), and common parameter \(0{\lt}p{\lt}1\):
where \(A=10KnD\mathfrak m\) and \(\ell _q=1+(2r_0+1)^2\log q\). The energy and charge defect use the same actual charge data, supplied vector and metric parameter \(a/2\) as in Theorem 28.3.84. Both history capacities are positive as a consequence of the rounded scales. No selected round, physical prevector identity, or norm comparison is part of this statement.
Fix the physical dimension \(q\ge 1\), \(C_r,C_1{\gt}0\), \(C_T\ge 0\), \(\mathfrak m\in \mathbb N\) and \(P,C_{\mathrm{en}},e_{\mathrm{en}}\in \mathbb R\). There exist \(C\ge 1\), \(C_l\ge 0\) and \(N\in \mathbb N\), depending only on these fixed quantities, with the following property. For every \(n\ge N\), use the literal rounded scales (151) and the geometric assumptions of Theorem 28.3.1.16. For every charge \(s+1\le nm\), every pair of positive auxiliary dimensions, supplied local Hamiltonian, vector \(\Omega \) and real \(\Delta \), every \(W\ge 0\), replica count \(k\ge 0\), nonzero symmetric supplied vector \(\psi _k\) and \(0{\lt}p{\lt}1\), put \(a=W/K\). Then both history capacities are positive and
where \(\ell =10^{-5}\) and \(\ell _q=1+(2r_0+1)^2\log q\). Both the energy and defect use the same supplied vector and metric parameter \(a/2\). No round or small defect is selected. The estimate includes zero total weight, zero anchor multiplicity, \(q=1\) and \(k=0\). For every scan with positive history capacities, every supplied vector, \(a\ge 0\) and \(p\), the literal defect \(\mathcal Q_{s,k}(p)\) is nonnegative.
The old-history weights and split entropy symbols are nonnegative, so integration against the actual leaf measures gives \(\mathcal Q_{s,k}(p)\ge 0\). At the rounded scales, eventually \(K\ge 1\) and \(nD^2/(mK)\le C_s n^{\ell }D^2\) for a fixed \(C_s\ge 1\). Substitute \(a=W/K\) in (154). Factoring \(KnD\) from the good contribution leaves, before the two interpolation terms, the exact coefficients
No division by \(\mathfrak m\) is used. Since \(\ell _q\ge 1\), enlarge both real exponents to one common nonnegative exponent before using \(\ell _q\le C_q(\log n)^4\). Thus both coefficients are at most \(C_d(\log n)^{C_l}\), with \(C_d\ge 1\) and \(C_l\ge 0\) fixed before the remaining physical and quantum data. Multiply the scale and dimension estimates and take \(C=C_sC_d\).
Let \(\mathscr D\) be finite admissible transport data with positive factor dimensions and \(t\ge 0\). Suppose its bands commute on the symmetric replica subspace at replica count \(k\ge 0\). For every supplied vector \(\mathrm{pre}\) and every real \(p\), its entropy gain satisfies \(\mathcal G_{\mathscr D,k,\mathrm{pre}}(p)\ge 0\). The vector may vanish, and \(p\) may be either endpoint.
Strong subadditivity gives \(\eta _{h,c,g}(\theta )\ge 0\) for every valid move. With \(J_h\) denoting the old-state Fourier–coherent integral, positivity gives
Assume the geometric and designated-support hypotheses of Theorem 28.3.55, uniformly over the \(nm\) charge stages, with \(m,M{\gt}0\), positive factor dimensions, \(t\ge 0\), a replica count \(k\ge 0\) and a supplied nonzero vector \(\mathrm{pre}\). Put \(\alpha =[2(C_1+1)nD]^{-1}\). Write \(\mathcal Q_{s,k,\mathrm{pre}}\) for the literal good-old-history defect at charge stage \(s\), and \(\mathcal G_{j,k,\mathrm{pre}}\) for the gain of actual round \(j\). For every \(0\le p_0\le p_1\le 1\),
No symmetry hypothesis on the supplied vector is needed.
Both scalar functions are interval integrable. Pointwise charge sampling and nonnegativity of the entropy gain give
The map \(s\mapsto 2s+1\) is injective. Sum (159) and add the nonnegative integrals of the omitted fill gains to obtain (158). Neither scalar is assumed continuous in \(p\).
There are universal real constants \(c_0,C_{\mathrm{ent}},e_{\mathrm{ent}}\), with \(c_0{\gt}0\), for which the following holds. Assume the joint geometric, Hamiltonian and smallness hypotheses of Theorems 28.3.1.20 and 28.3.1.13; in particular, \(n\ge 2\), \(2r_0\le D\), \(C_1{\gt}0\), \(3\mu \le C_1\), \(a{\gt}0\) and \(a\ell \le c_0\), where \(\mu \) bounds the number of labels at each anchor. Use the actual augmented energy terms, set \(t=a/2\), and put \(\alpha =[2(C_1+1)nD]^{-1}\). The physical and auxiliary dimensions are fixed before choosing \(C_\beta \ge 0\) and a sequence \(\beta :\mathbb N\to \mathbb R\) such that \(0\le \beta _k\le C_\beta \log (k+2)\) for every \(k\ge 0\). The same sequence works for every replica count, supplied vector and retained subinterval. For every \(k\ge 0\), every nonzero symmetric supplied vector \(\mathrm{pre}\), and every \(0\le p_0\le p_1\le 1\),
The endpoint norms are those of Theorem 28.3.1.14. The error is paid for every full round; it has no factor \(p_1-p_0\). Zero replicas, zero bands and equal endpoints are included. Identifying the supplied vector with the physical prevector and bounding the initial and final norms are separate obligations.
28.4 Entropy transfer on positive-depth prefixes
The scanner uses one truncated state on an entire family of comparison prefixes. The following consequence of entropy continuity transfers the original prefix bound to that same state. The original entropy estimate and the compact-region volume estimate remain explicit hypotheses.
Fix an integer \(q\ge 1\), a real number \(g{\gt}0\), and a real constant \(C_{\mathrm{vol}}\). For all sufficiently large integers \(n\), the following assertion holds uniformly over the finite domain and all the data below.
Let \(\Omega ,\Omega _t\) be unit vectors on a finite domain \(\Lambda \), with local dimension \(q\). For a subset \(A\subseteq \Lambda \), an integer-valued depth function \(d\), and a natural number \(L\), put
Suppose \(|R_L|\le C_{\mathrm{vol}}n^2\) and, writing \(\Delta \) for the trace distance between the two pure states, suppose
Let \(C_e,e\in \mathbb R\). If the original vector satisfies
for every natural number \(j\le L\), then the same prefixes satisfy
The threshold depends only on \(q,g,C_{\mathrm{vol}}\); in particular, it precedes the choices of both vectors, the depth function, and \(C_e,e\). No sign condition on \(C_e,e\) is needed for this implication.
For \(n\ge 1\), the assumed trace-distance estimate gives \(\Delta \le \sqrt{2/g}\, n^{-500}\). Also \(Q_j\subseteq R_L\) whenever \(j\le L\). Entropy continuity [ 247 , Lemma 2.1 ] , applied in the regional dimension \(q^{|Q_j|}\), therefore bounds the entropy difference by
Set \(C_0=\max \{ 4,C_{\mathrm{vol}}\} \). The volume bound and \(\log q\ge 0\) bound the right-hand side by \(C_0\sqrt{\Delta }(1+C_0n^2\log q)\). The fixed-coefficient continuity estimate makes this at most \(n^{-247}\) for all sufficiently large \(n\), uniformly over all the supplied data. Adding the original prefix entropy bound proves the assertion.
28.5 Replica metrics in augmented site coordinates
Write \(I=V\sqcup \{ C,R\} \) for the sites obtained by adjoining \(C\) and then \(R\), and write \(J=V\sqcup \{ \mathrm{false},\mathrm{true}\} \). Let \(a:I\to J\) fix each physical site and send \(C\) to \(\mathrm{false}\) and \(R\) to \(\mathrm{true}\). The physical coordinates have \(q\) values and both auxiliary coordinates have \(d\) values. Denote their configuration spaces by \(\mathcal X_I\) and \(\mathcal X_J\). The coordinate bijection \(e_0:\mathcal X_I\to \mathcal X_J\) preserves every coordinate value; let \(e_k:\mathcal X_I^k\to \mathcal X_J^k\) apply \(e_0\) to each copy. These are the augmented coordinates used for the physical energy.
Let \(V\) be a set, let \(q,d,k\ge 0\) be integers, and let \(Q\subseteq I\) be finite. For \(\sigma \in S_k\), write \(\rho _Q(\sigma )\) for the permutation that permutes the copies at the sites in \(Q\) and fixes all other coordinates. Then, for every \(x\in \mathcal X_I^k\),
No finiteness assumption on \(V\) is needed.
At the site \(a(i)\) and copy \(j\), both sides have the value of \(x\) at site \(i\) and copy \(\sigma ^{-1}(j)\) if \(i\in Q\), and at copy \(j\) otherwise. The equivalence \(i\in Q\iff a(i)\in a(Q)\) gives the identity at every coordinate.
Suppose now that \(V\) is finite. Put \(N=|\mathcal X_I|=|\mathcal X_J|\), and use the replica weight \(w_{k,N,t}(\lambda )\) for the full one-copy dimension \(N\). For every real \(t\), every \(k\ge 0\) and every \(Q\subseteq I\), the two replica metrics satisfy
The weights on both sides use \(N\), including when a coordinate space is empty. The assertion also includes \(k=0\).
The one-copy bijection gives equality of the full dimensions and hence equality of the label weights. The subsystem identity transports each permutation matrix, and therefore each group-algebra element and label projector. Summing the transported projectors with the same weights proves the displayed metric identity. This is the coordinate identification used in [ 247 , Sections 5–8 ] .
28.6 The transport root in the original site coordinates
Retain the augmented site bijection \(a:I\to J\) and its replica configuration bijection \(e_k:\mathcal X_I^k\to \mathcal X_J^k\). Write \(\mathcal U_k:\mathbb {C}^{\mathcal X_I^k}\to \mathbb {C}^{\mathcal X_J^k}\) for the unitary \((\mathcal U_k f)(x)=f(e_k^{-1}x)\). The physical dimension is \(q\), and both auxiliary dimensions are \(d\). All replica metrics use the dimension of the same full one-copy system.
Suppose \(V\) is finite, \(q,d,k\ge 0\) are integers and \(t\in \mathbb {R}\). For any three regions \(P,Y,F\subseteq J\), put \(P_I=a^{-1}(P)\), \(Y_I=a^{-1}(Y)\) and \(F_I=a^{-1}(F)\). Define
Then \(A_J(P,Y,F)=\mathcal U_k A_I(P_I,Y_I,F_I)\mathcal U_k^*\). The regions need not form a partition. Empty coordinate spaces and zero replicas are included; inverses have the usual total matrix convention.
Transport each of the three replica metrics by the same unitary. Matrix inverses and products are preserved by this conjugation, giving the identity after squaring.
Let \(q,d{\gt}0\), \(t\ge 0\), and let \(D\) be admissible transport data on \(J\) with \(K\) bands. Thus its history and conditional weights are positive, its old regions partition \(J\), and every move transfers a part of the old middle region to one side. Assume cross-band commutation on the symmetric replica space. Fix \(k,N\ge 0\), \(p\in \mathbb {R}\), and a supplied matrix \(Z:\mathbb {C}^N\to \mathbb {C}^{\mathcal X_J^k}\) satisfying
where \(\Pi _k\) is the symmetric projection. Let \(v\in \mathbb {C}^{\mathcal X_J^k}\) satisfy \(\Pi _kv=v\).
Let \(T\) be the original transport tree at the parameter \(p\) clamped to \([0,1]\). For each of its terminal labels \(j\) and bands \(g\), pull back the actual partition \((P_{j,g},Y_{j,g},F_{j,g})\) through \(a\), and let \(A^I_{j,g}\) be its band matrix in the original coordinates. Put \(Z_I=\mathcal U_k^*Z\), \(v_I=\mathcal U_k^*v\), and
The product in (167) has the original band order. Write \(L(p)\) for the actual transport root. Then \(M\) is positive definite, and for every \(r\in \mathbb {R}\),
A zero denominator gives the zero vector. No nonzero-vector premise is needed for these equalities.
The coordinate identity gives \(Z_I^*A^I_{j,g}Z_I=Z^*A^J_{j,g}Z\) and \(Z_I^*v_I=Z^*v\). Apply the compressed-root identity to the same supplied \(Z\) and the same clamped tree. It gives positivity of \(M\) and \(L(p)Z=ZM\). Positivity of the actual terminal inputs also gives positivity of \(L(p)\). Functional calculus therefore yields \(L(p)^rZ=ZM^r\).
Since \(ZZ^*v=\Pi _kv=v\), setting \(r=-1/4\) gives \(L(p)^{-1/4}v=Zw\). The isometry identity \(Z^*Z=I\) preserves the norm. Dividing by that common norm proves the last identity in (168), including the zero case. This is the same filtering normalization as in [ 247 , Section 7 ] .
28.7 Bad-history probability
Keep the actual finite histories and physical graph from the preceding section. Write \(r=r_0\) and \(M=\lceil C_1nD\rceil \). Time below counts completed fill–charge pairs, so the charge at index \(t\) sees the front after \(t+1\) fills. All probabilities in this section are classical finite-history probabilities. The estimates formalize the finite ancestry argument of [ 247 , Section 9, charge ancestry and availability ] ; the asymptotic scale specialization is proved below.
Suppose the target is nonempty, \(8Km\le L\), and the actual cut endpoints have ambient distance greater than \(2L+10r\) from the target. Every assigned site of \(A\) has a chronological selected-charge path rooted at an initially assigned site or a scheduled fill slot. Its charge times are strictly increasing. For a nonempty path, its endpoint lies in its last charge ball, and successive anchors are at graph distance at most \(2r\). Initial assignments persist. A bad endpoint was initially middle and lies in \(A\cap T_L\). A scheduled fill cannot create a bad lead.
Induct on the actual fill–charge evaluation. If the last charge makes a new assignment, choose a same-side predecessor in that ball. The ball meets the old middle, hence the cut clearance places the whole ball inside \(A\). This includes far-side predecessors despite the exterior initially being far. Repeat the argument for an earlier assignment, or stop at the preceding fill. The resulting path family deliberately also permits selected charges that made no move; only containment of actual assignments in this family is used.
The fronts are monotone. For \(n{\gt}0\) and pair times \(a\le b\),
If an assigned endpoint has lead greater than \(D/2\), its ancestry is nonempty. For its length \(s\) and every recorded charge time \(t\),
Each charge changes oriented depth by at most \(2r\). Keep the front at the first charge as the reference front, instead of replacing it by the final front. The exact padded fill counts give the displayed speed estimate with both floor errors included. Combining the two inequalities gives the bounds.
Assume \(M{\gt}0\) and fix all initial offsets. Requiring a specified side and label in one band at each of \(s\) distinct times has probability at most \((2M)^{-s}\). The same upper bound holds after imposing arbitrary additional conditions. For a finite family of such prescriptions covering an event, the event’s probability is at most the sum of these bounds.
Sorted labelled candidate lists contain a label at most once, including when different labels share an anchor. Thus one required hit constrains at most one side–slot coordinate. Factor the finite product of independent choices and then take a union bound. Successful physical moves are not asserted independent; they are contained in the selected-coordinate events.
Let \(B\) bound the number of labels whose anchors lie within graph distance \(2r\) of any site. The number of reversed label paths of length \(s\) from a fixed endpoint is at most \(B^s\). In an induced square-lattice domain with anchor multiplicity at most \(\mu \), one may take
Inductively choose a nearby labelled anchor and continue from it. The finite union has at most \(B\) choices at each step. Fiber counting retains label multiplicity, and an induced graph ball injects into the ambient lattice diamond. Counting labels alone suffices because predecessor witnesses do not enter the selected-coordinate probability.
A terminal window specified by \(k-(t+1)\le W\) and \(0\le t{\lt}k\) contains at most \(W+1\) indices. Choosing \(s\) of its \(v\) indices and a reversed label path from a finite family of size \(b\) gives at most \(\binom vs b\) chronologically labelled paths. Their times are distinct. For \(n,r,s{\gt}0\) and \(W=4n(rs+1)\), one has \(v\le 9nrs\).
Use the subsets of cardinality \(s\), sort them, and pair their times with the label path in chronological order. The image cannot increase cardinality. Keeping the inclusive endpoint produces \(W+1\); positivity absorbs it and the additive rounding terms into \(9nrs\).
For a fixed endpoint and pair time \(k\), all bad ancestries lie in the finite union of the timed spatial path families with \(0\le s\le k\) and \(D{\lt}4rs\). Every path in this family has valid distinct times. For every \(q\ge 0\), its sum of weights \(q^s\) is at most
The reversed labels satisfy the spatial chain relation, and strict time order bounds the path length by \(k\). Insert the actual path into its sorted-time family. Families of different lengths are disjoint, so summing their cardinality bounds gives the displayed estimate.
For \(s{\gt}0\), \(a\ge 0\), and \(v\le Cs\),
Use \(\binom vs\le v^s/s!\) and \(s^s/s!\le e^s\). The factorial cancels the ancestry length in the time-window estimate.
If every positive ambient layer through \(L\) has at most \(n\) sites, then
The zero dilation is \(T\). Add the cardinalities of successive actual dilation differences and inject physical collar sites into the ambient dilation. No volume of \(\Lambda \setminus A\) occurs.
Restricting a full history to its first \(j\) pairs preserves its offsets and earlier charge coordinates. For \(j\le N\) and \(M{\gt}0\), every real-valued function of this prefix has the same expectation under length-\(N\) history weights as under length-\(j\) history weights.
Appending a charge preserves all earlier prefixes. Sum the appended independent choices, whose total weight is one, and induct from \(j\) to \(N\). Empty offset spaces give zero on both sides and require no extra convention.
Fix the offsets, a band, a side, and an endpoint in \(A\). Under the actual cut-clearance hypotheses and \(n,M{\gt}0\), the probability that the endpoint is assigned with lead greater than \(D/2\) is at most
Derive the ancestry from the evaluated physical history, put it in the finite cover, and apply the selected-coordinate probability bound to each path. The graph and ambient depth provide the spatial variation and diamond count.
For \(m{\gt}0\), the total weight of bad completed histories at time \(k\) is at most \(2K|A\cap T_L|R_k\). The same bound holds for old charge histories after their preceding fill.
Every bad endpoint belongs to the compact collar. Union over it, both sides, and all bands, then average the normalized initial offsets. A fill cannot create a bad lead, so old charge states are covered as well.
Under the source ambient layer bound, the probability that some completed prefix of one length-\(N\) actual history is bad is at most
Goodness of these completed prefixes also guarantees goodness after every intervening deterministic fill.
Take the finite union over prefix times and use their exact marginals. Insert the compact collar cardinality bound. All tests concern the same full history, rather than independently sampled histories at different times.
If additionally \(r{\gt}0\), set
The probability of a bad prefix is at most
Apply the binomial cancellation with \(v_s(k)\le 9nrs\). The nonnegative length sum increases with the observation horizon. The label-only count gives a ratio of order \(r^3/D\) when \(M\) has the source scale \(nD\), with uniformly bounded anchor multiplicity and fixed positive \(C_1\); counting predecessor sites as well gives the manuscript’s looser \(r^5/D\). No asymptotic limit or transported quantum measure is used here.
Fix \(C_r\ge 0\) and \(r(n)=\lceil C_r(\log n)^2\rceil \). For every \(\varepsilon {\gt}0\), one has \(r(n)=o(n^\varepsilon )\). Consequently, for every fixed real \(A\), both \(Ar(n)\le n^\varepsilon \) and \(Ar(n)^3\le n^\varepsilon \) hold for sufficiently large \(n\). If \(C_r{\gt}0\), then \(r(n)\ge 1\) for sufficiently large \(n\).
The ceiling differs from the nonnegative squared logarithm by less than one. Every fixed power of the logarithm is negligible relative to every positive power of \(n\). Apply this first with exponent \(\varepsilon \) and then with exponent \(\varepsilon /3\) before cubing.
Write \(b\) for the fixed anchor multiplicity bound. For \(n,D,r{\gt}0\) and \(M\ge C_1nD\), where \(C_1{\gt}0\), the actual ratio satisfies
If \(n\ge 1\), \(a\ge 0\), \(4rJ\le D\), and \(\rho \le n^{-a}\), then
If moreover \(K,L,m\le n\), \(|T|\le C_Tn^2\), \(C_T\ge 0\), and \(N=nm\), then
For \(n\ge 8(C_T+1)\) and \(p+8\le aJ\), this prefactor times \(n^{-aJ}\) is at most \(n^{-p}\).
For \(r\ge 1\) the lattice diamond factor is at most \(13r^2\). Cancel \(n\) against the padded capacity. Every retained length is at least \(J\), and there are at most \(N+1\) lengths. Bound \(N+1\) by \(2n^2\) and absorb the remaining fixed constant into one additional power of \(n\).
Fix \(0{\lt}\ell \), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), \(C_r,C_1{\gt}0\), \(C_T\ge 0\), a finite anchor multiplicity bound \(b\), and a real exponent \(p\). Set
For all sufficiently large \(n\), uniformly over finite lattice domains, nonempty targets with \(|T|\le C_Tn^2\), and actual scanners satisfying the ambient row bound, the cut clearance above, and anchor multiplicity at most \(b\), the probability that any prefix through \(nm\) fill–charge pairs has bad lead on either side in any band is at most \(n^{-p}\). In particular \(p=200\) gives the bad-history exponent in Lemma 9.1.
Choose an integer \(J\) with \(p+8\le \kappa J/2\), before choosing \(n\) or the physical domain. The rounded-radius estimates imply eventually \(\rho \le n^{-\kappa /2}\) and \(4rJ\le D\). The source floors give \(K,L,m\le n\). Apply the fixed-cutoff estimate to the actual finite-history union bound. The same good-prefix event controls the old-charge states, since a scheduled fill cannot create a bad lead.
Identifying transported entropy gains and constructing the remaining scanner inputs are separate mathematical steps. The probability estimate concerns actual classical histories and does not identify their quantum entropy costs.
28.8 The scanner estimate from its inputs
Section 9 of the manuscript scans the collar of a finite target in rounds and selects one charge round and one interpolation parameter at which the transported, symmetrized vector has small defect energy (Proposition 9.2). Fix exponents \(0{\lt}\ell {\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell \), \(0{\lt}e{\lt}1\) with \(\kappa \le e\), \(\nu {\gt}0\), let the total metric weight \(W\ge 1\) of the scan be arbitrary, possibly depending on \(n\), and put \(L=\lfloor n^{1-\ell }\rfloor \), \(D=\lceil n^\kappa \rceil \), \(m=\lfloor n^\mu \rfloor \), \(\epsilon =n^{-\nu }\) and \(\delta _n=C\epsilon ^{-1}(n^{e-\mu }+a^{1/4}(\log n)^{C})\). The statement below takes as hypotheses, for one scan at scale \(n\), the conclusions of the scan histories (Lemma 9.1), of transport (Proposition 7.4), of the comparators (Proposition 8.1), of continuity (Lemma 2.1) and of tails (Lemma 2.3); it is therefore Proposition 9.2 restricted to those conclusions, not the source proposition itself, which remains open until the scan data are constructed. The finite transported measures are required to have mass \(1/2\) only for \(0{\lt}p{\lt}1\), where the source’s terminal weights are positive. The logarithmic norm is continuous on \([0,1]\), and its values at \(0\) and \(1\) retain their matching and comparison properties. No mass equality is required at an inactive terminal leaf. The charge defect is assumed almost everywhere measurable in the interior; its existing nonnegative upper bound then gives integrability on the closed interval.
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 \le e\), and put \(L=\lfloor n^{1-\ell }\rfloor \), \(m=\lfloor n^\mu \rfloor \), \(K=\lfloor L/(8m)\rfloor \), \(D=\lceil n^\kappa \rceil \) and \(\epsilon =n^{-\nu }\), the scales of [ 247 , Section 9 ] . There is a constant \(C_1\ge 1\), depending only on the exponents, such that for all sufficiently large integers \(n\): \(n\ge 2\), \(K\ge 1\), \(m\ge 1\), \(D\ge 1\), \(L\le n\), \(0{\lt}\epsilon {\lt}1\), and
For large \(n\), \(n^\mu \ge 2\), \(n^{1-\ell }\ge 2\) and \(n^{1-\ell -\mu }\ge 48\). Since \(\lfloor x\rfloor \ge x/2\) for \(x\ge 2\), this gives \(m\ge n^\mu /2\) and \(L\ge n^{1-\ell }/2\ge 24m\), hence \(K\ge 1\) and \(mK\ge L/16\ge n^{1-\ell }/32\). The remaining bounds follow from \(\kappa \le e\) and \(\lceil x\rceil \le 2x\) for \(x\ge 1\), with \(C_1=32\).
Fix \(C,\lambda \ge 0\). There is a threshold depending only on these constants such that, for every natural number \(n\) above the threshold and every real \(t\le n^{-500}\),
This is the continuity cost of [ 247 , Lemma 2.1 ] at the trace distances arising in [ 247 , Proposition 9.2, proof ] .
Take \(n\ge 1\) and \(n\ge C(1+C\lambda )\). Then \(\sqrt t\le n^{-250}\) and \(1+Cn^2\lambda \le (1+C\lambda )n^2\), so \(C\sqrt t(1+Cn^2\lambda )\le n^{-250}\cdot C(1+C\lambda )n^2 \le n^{-250}\cdot n^3=n^{-247}\).
Fix \(A,C,\lambda \ge 0\). There is a threshold depending only on these constants such that, for every natural number \(n\) above the threshold and every real \(t\le A n^{-500}\),
Here the real square root is zero on negative arguments. This is the scalar estimate used in the entropy transfer of [ 247 , Proposition 9.2, proof ] .
Put \(B=1+A\) and \(\overline C=C\sqrt B\). For all sufficiently large \(n\) and every \(u\le n^{-500}\), Lemma 28.8.2 with the constants \(\overline C\) and \(\lambda \) gives
If \(t\le An^{-500}\), then \(u=t/B\le n^{-500}\). Since \(B{\gt}0\), the identity \(\sqrt t=\sqrt B\sqrt{t/B}\) holds for every real \(t\), including negative \(t\). Since \(C\le \overline C\) and \(\overline C\sqrt u\) and \(n^2\lambda \) are nonnegative,
Fix scanner exponents satisfying the preceding conditions and put \(K_n=\lfloor \lfloor n^{1-\ell }\rfloor /(8\lfloor n^\mu \rfloor )\rfloor \). For every integer \(B\ge 0\) there is a threshold \(N\), depending only on the exponents and \(B\), such that \(B\le K_n\) whenever \(n\ge N\). These are the rounded scales of [ 247 , Section 9 ] .
Since \(1-\ell -\mu {\gt}0\), eventually \(n^{1-\ell -\mu }\ge 16B\) and \(n^{1-\ell },n^\mu \ge 2\). Thus
The positive integer divisor \(8\lfloor n^\mu \rfloor \) then gives \(B\le K_n\).
There are constants, independent of \(W\) and depending only on the exponents and on the constants of the inputs, such that for all sufficiently large \(n\) and every scan at scale \(n\) satisfying the conclusions of Lemmas 9.1, 2.1, 2.3 and Propositions 7.4, 8.1, the comparator budgets \(B_{\mathrm{sh}}\le C(nL^e+n)\), \(B_{\mathrm{exc}}\le CnD\) and \(\mathcal B\le CnD(\log n)^{C}\) hold, and there is a remainder \(\rho _k\to 0\), uniform over the selected round and parameter, such that for every \(k\ge 1\) some charge round and some \(p_k\in [\epsilon /2,\epsilon ]\) satisfy \(\mathcal Q(p_k)/(KnD)\le \delta _n+\rho _k\) and
Let \(C_e\) be the original entropy-input constant, and write \(\widetilde S_X\) and \(\widetilde S_Q(j)\) for the target and shell entropy values of the truncated state recorded in the same input data. The threshold can also be chosen so that, for every natural shell index \(j\le L\),
Write \(C_{\rm in}\ge 1\) for the fixed distance and continuity coefficient of the input data and \(t\) for their trace distance. Apply Lemma 28.8.3 with \(A=C=C_{\rm in}\) and \(\lambda =\log q\ge 0\) to the assumed bound \(t\le C_{\rm in}n^{-500}\). The assumed continuity differences are therefore at most \(n^{-247}\). Adding the original target and shell entropy bounds gives the two entropy estimates, uniformly in the scan and shell index. Integrate the logarithmic norm derivative over \([0,1]\) in every round, retaining the nonnegative charge contribution on \([\epsilon /2,\epsilon ]\). Interior almost-everywhere measurability and the nonnegative upper bound make the charge defect integrable; the two endpoint values do not change the integral. The integral comparison retains continuity of the logarithmic norm on \([0,1]\), its derivative at every interior point, and the pointwise gain inequality. Matching successive endpoint values give the telescoped entropy budget. Write \(T\) for the charge rounds, so \(|T|=nm\), and let \(\mathcal Q_{r,k}(p)\) be the defect in round \(r\). With \(c_k=KnD(\delta _n+\rho _k)\), the normalized entropy budget gives
Since \(T\ne \varnothing \), finite averaging in (198) gives \(r\in T\) with \(\int _{\epsilon /2}^{\epsilon }\mathcal Q_{r,k}(p)\, dp\le (\epsilon /2)c_k\). If \(\mathcal Q_{r,k}(p){\gt}c_k\) for every \(p\in [\epsilon /2,\epsilon ]\), integrability and \(\epsilon {\gt}0\) imply
a contradiction. Hence some \(p_k\in [\epsilon /2,\epsilon ]\) satisfies \(\mathcal Q_{r,k}(p_k)/(KnD)\le \delta _n+\rho _k\). At that point Hölder’s inequality with exponents \(8/7\) and \(8\) bounds the leaf energies of the old good leaves by \(N(\mathcal Q/N)^{1/8}\), the new and bad leaves contribute at most \(\epsilon \) and \(n^{-200}\) times the total weight, and the gap of the copied Hamiltonian converts the energy into the defect energy. The budgets follow from these entropy estimates and the crossing count, which gives the logarithmic power \(12\) for the marginal parameter.
28.8.1 Rounded weights in the marginal-moment interval
Fix exponents \(0{\lt}\ell _{\rm s}{\lt}1\), \(0{\lt}\kappa {\lt}\mu {\lt}1-\ell _{\rm s}\), \(\nu {\gt}0\), and \(0{\lt}e{\lt}1\) with \(\kappa \le e\). For integer \(n\ge 1\), use the scales of [ 247 , Section 9, lines 32–41 ] :
Set \(\alpha =1-\ell _{\rm s}-\mu {\gt}0\). Only these three exponents enter (202).
There is a constant \(C_K\ge 1\) such that all sufficiently large integers \(n\) satisfy \(n\ge 2\), \(K\ge 1\), and \(n^\alpha \le C_KK\).
The numerical scale estimates give positive \(m,K,D\) and \(nD^2/(mK)\le C_Kn^{\ell _{\rm s}}D^2\). Cancel \(D^2\), multiply by \(mK\), and use \(m\le n^\mu \) to obtain
Dividing by the positive last power gives the assertion.
Let \(n\ge 1\), \(C_B\ge 0\) and \(B\in \mathbb R\) satisfy \(B\le C_BnD(\log n)^{12}\). Then
The real square root is zero on negative arguments.
Since \(n^\kappa \ge 1\), rounding gives \(D\le n^\kappa +1\le 2n^\kappa \). Thus \(B\le 2C_Bn^{1+\kappa }(\log n)^{12}\). The right side is the square of the asserted nonnegative upper bound.
Fix \(\omega \in \mathbb R\), \(C_B,A\ge 0\) and \(c{\gt}0\). Assume the strict margin
There is an integer \(N\ge 2\), chosen before \(n,W,B\), such that every \(n\ge N\) has \(K\ge 1\) and the following property. For every \(0\le W\le n^\omega \) and real \(B\le C_BnD(\log n)^{12}\), put \(a=W/K\). Then \(Aa\sqrt B\le c\). If also \(B\ge 1\), then \(Aa\le c/\sqrt B\).
Choose \(C_K\) before the scale. Theorems 28.8.1.1 and 28.8.1.2 give
Since \(\delta {\gt}0\), the fixed multiple of \((\log n)^6\) is \(o(n^\delta )\). Choose one threshold making the right side of (206) at most \(c\). This choice is independent of \(W\) and \(B\). For \(B\ge 1\), division by \(\sqrt B{\gt}0\) proves the interval bound.
Use the final parameters of [ 247 , Section 9, lines 839–865 ] :
Their exact margin is
Fix \(C_B\ge 0\), \(c{\gt}0\) and \(t\in \mathbb R\). There is \(N\ge 2\) such that, for every \(n\ge N\), the literal rounded scales in (202) have \(K\ge 1\) and, with \(a=n^\omega /K\), every \(1\le B\le C_BnD(\log n)^{12}\) satisfies \(|ta|\le c/\sqrt B\).
Rational arithmetic gives the displayed positive margin and all stated exponent inequalities. Apply Theorem 28.8.1.3 with \(A=|t|\) and \(W=n^\omega \). Since \(a\ge 0\), one has \(|ta|=|t|a\).
28.9 The rough upper comparison for the supplied labels
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 supplied label sequence \(\lambda _k\) satisfies
for every sufficiently large \(k\). Form the original physical prevector \(\xi _k\) from \(\Omega \) and these labels, as in Theorem 28.1.3.
Fix a finite index set \(J\), a finite nested list \(\mathcal R\) of physical regions disjoint from \(X\), and \(K\geq 8\). There is a constant \(c\geq 0\) for which the following holds eventually in \(k\). 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
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
At parameter \(t=2/K\), use the full physical and auxiliary dimension in the replica metric \(W\). With auxiliary sites \(C\) and \(R\), put
Complements are taken in \(V\). Then \(\| w_k\| ^2{\gt}0\) and
The constant and eventual threshold precede all the choices of \(Z,U,Y,T,B_{\mathrm{sh}}\) and \(B_{\mathrm{exc}}\). This is the supplied-label application of the rough upper comparison in [ 247 , Section 8, lines 130–169 and 332–381 ] .
Express the supplied auxiliary mass in physical-site coordinates. Apply the rough upper estimate for the original prevector with \(t=2/K\) and inverse-power exponent \(1/4\). The disjointness assumptions give \(Y_{jg}\setminus X=Y_{jg}\), so its ordered product is precisely \(M_k\). Its coefficient \(8(1/4)(2/K)K\) is \(4\). The remaining terms are logarithmic in \(k\), and division by \(k\) gives the asserted limit.
28.10 Local root channels and physical shell oscillations
Use the physical space \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\), the finite spectator \(\mathcal K=\mathbb {C}^J\), and the algebras \(\mathcal A_K\) of Section 33.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\). Write \(\widehat A=A\otimes \mathbb 1_{\mathcal K}\) for a physical operator \(A\). All operators \(B,C\) on \(\mathcal H\otimes \mathcal K\) are arbitrary complex matrices, with the Euclidean operator norm. For \(K\subseteq I\), the expectation \(E_K\) retains exactly the sites in \(K\) and averages the sites in \(I\setminus K\).
28.10.1 Localized square-root channels
Set \(k_K=E_K(k)\), and define the positive square roots
The full and localized channels are
In particular, \(\mathcal E(B-C)=\mathcal E(B)-\mathcal E(C)\) and \(\mathcal E_K(B-C)=\mathcal E_K(B)-\mathcal E_K(C)\) by distributivity. These are the localized channels of [ 247 , Section 10 ] , extended by the identity on the spectator.
The full and localized channels satisfy
The expectation preserves the interval \([0,\mathbb 1]\). Thus the roots are self-adjoint and \(G^2+R^2=\mathbb 1=G_K^2+R_K^2\). The map \(V\psi =\widehat G\psi \oplus \widehat R\psi \) is an isometry and \(\mathcal E(B)=V^\dagger (B\oplus B)V\), giving (228). The same argument for \(G_K,R_K\) gives (229). Finally, \(\| \mathcal E_K(B)-B\| \le \| \mathcal E_K(B)\| +\| B\| \).
Suppose \(\| k-E_K(k)\| \le \varepsilon _K\) for a real number \(\varepsilon _K\). Then
If also \(\| k-E_L(k)\| \le \varepsilon _L\), then
The sets \(K,L\) need not be nested. Both bounds are uniform over all finite spectator spaces.
All four roots in (224) and (225) have norm at most one. The square-root Hölder inequality gives \(\| G-G_K\| \le \sqrt{\varepsilon _K}\) and \(\| R-R_K\| \le \sqrt{\varepsilon _K}\). For physical operators \(A,A'\), expand
Apply (234) to \((G,G_K)\) and \((R,R_K)\) to obtain (231). The triangle inequality through \(\mathcal E(B)\) gives (232). The hypotheses themselves imply \(\varepsilon _K,\varepsilon _L\ge 0\).
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
In particular, every physical \(U\in \mathcal A_{I\setminus K}\) satisfies \([\widehat U,\mathcal E_K(B)] =\mathcal E_K([\widehat U,B])\).
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,
Under the second hypothesis, move \(A\) past each root to obtain
The same identity holds for \(R_K\); their sum proves (235). Operators supported on disjoint physical regions commute, which gives the final assertion.
If \(y\notin K\), then \(d_y(\mathcal E_K(B))\le d_y(B)\).
For every unitary \(U\in \mathcal A_{\{ y\} }\),
Taking the supremum over \(U\) proves the assertion, as in [ 247 , Section 10 ] .
28.10.2 Differences of successive local channels
Let \((K_l)_{l\ge 0}\) be any sequence of physical regions and put \(\mathcal E_l=\mathcal E_{K_l}\). Define
Equivalently, take \(\mathcal E_{-1}=\mathrm{id}\) and \(\Delta _l=\mathcal E_l-\mathcal E_{l-1}\), as in [ 247 , Section 10 ] . 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
Then
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\).
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\). Their difference therefore vanishes.
Suppose \((K_l)_{l\ge 0}\) is increasing. Then
Fix \(l\ge 0\) and real numbers \(\varepsilon _{\rm next}, \varepsilon _{\rm prev}\) satisfying (240) and (241). Then
These bounds hold for every finite spectator and every complex operator \(B\), without a Hermiticity assumption.
Fix a shell index \(m\) and a nonnegative coefficient \(\eta \) from Theorem 28.10.2.2, so \(\| \Delta _m(C)\| \le \eta \| C\| \) for every \(C\). Average precisely the physical sites in \(K_m\), leaving the spectator untouched, by setting \(\overline B=E_{I\setminus K_m}^{\mathcal K}(B)\). Theorems 33.11.2.3 and 33.11.2.9 give, for every \(A\in \mathcal A_{K_m}\),
Hence \(\Delta _m(\overline B)=0\), and subtraction yields
For \(m=0\) use \(\eta =2\). For \(m=l+1\) use \(\eta =4(\sqrt{\varepsilon _{\rm next}} +\sqrt{\varepsilon _{\rm prev}})\), which is nonnegative. This is the commutant-averaging argument for the channel-shell estimate in [ 247 , Section 10 ] .
28.11 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)\). Equivalently, take 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\).
The implication \(d_G(a,x)\le m\le n\Rightarrow d_G(a,x)\le n\) proves monotonicity. Membership in a finite ball implies finite distance, hence reachability from \(a\). Conversely, a reachable vertex \(x\) has \(d_G(a,x)\le R_a\le n\). Infinite distance cannot be bounded by a natural number.
Let \(q{\gt}0\), \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\), and let \(\mathcal K=\mathbb {C}^J\) for an arbitrary finite set \(J\), possibly empty. 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 33.9.12. For a positive contraction \(k\) on \(\mathcal H\), define its root channel by
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}\). Observables \(B\) on \(\mathcal H\otimes \mathcal K\) need not be Hermitian.
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.
For \(n\ge R_a\), the ball is \(C(a)\) and the expectation fixes every operator supported there. Substitute \(E_{N_n(a)}(k)=k\) into (248) to obtain equality of channels. Both terms in \(\Delta _{n+1}(B)\) are then \(\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})\). Here the real square root is zero on negative inputs. Write \(d_y(B)\) for the physical-site oscillation of Definition 33.11.1.1.
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
The coefficient has no factor depending on \(\dim \mathcal K\). This is the finite-radius consequence of exact component support in [ 247 ] , before choosing a decaying error bound.
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)\).
At radius \(R_a\), the local channel equals the full channel and \(y\notin N_{R_a}(a)\). Apply Theorem 28.10.1.5: the local channel commutes with on-site unitary conjugation at \(y\), and its contractivity bounds each resulting commutator by its original norm. Taking the supremum gives the claim.
28.12 Finite channel oscillation bounds
Use the physical space \(\mathcal H=(\mathbb {C}^q)^{\otimes I}\), with \(q{\gt}0\), and the arbitrary finite spectator \(\mathcal K=\mathbb {C}^J\) from Section 28.10; 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 28.10.1.1, and \(\Delta _l\) for its shells from Definition 28.10.2.1. For every site \(y\in I\), use the oscillation \(d_y\) of Definition 33.11.1.1. Throughout, \(B\) is an arbitrary complex operator on \(\mathcal H\otimes \mathcal K\), without a Hermiticity assumption. All norms are Euclidean operator norms.
28.12.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 33.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)}\).
For every region \(S\subseteq I\),
This equivalence remains valid for matrices with an arbitrary spectator index set \(J\).
By (17), 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\).
Suppose \(B_{ab}\in \mathcal A_S\) for every \(a,b\in J\). For every \(y\in I\),
where \(\mathbf1_S(y)\) is one on \(S\) and zero outside \(S\). This is the initial support estimate in [ 247 , Section 10 ] , for arbitrary finite spectators and arbitrary complex \(B\).
28.12.2 Coefficients from the localization errors
For a real sequence \((\varepsilon _l)_{l\ge 0}\), define
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.
For every real sequence \((\varepsilon _l)\) and every \(l\ge 0\), the coefficient \(\eta _l\) is nonnegative.
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\),
Then
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\).
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
Every regional sum is evaluated on the original operator \(B\). This is the finite-radius one-event estimate underlying [ 247 , Section 10 ] .
Put \(a_l=\eta _l\sum _{z\in K_l}d_z(B)\), which is nonnegative. Induct on \(n\). If \(y\notin K_n\), then \(d_y(\mathcal E_n(B))\le d_y(B)\) by Theorem 28.10.1.5, and the nonnegative sum in (256) preserves this inequality. At \(n=0\) with \(y\in K_0\), write \(\mathcal E_0(B)=B+\Delta _0(B)\) to obtain
For the successor step with \(y\in K_{n+1}\), the identity \(\mathcal E_{n+1}(B)=\mathcal E_n(B)+\Delta _{n+1}(B)\) gives
Restrict the error assumptions to radii at most \(n\) and apply the induction hypothesis to the first term in (258). The new term is exactly the contribution of \(n+1\) to the filtered sum.
28.12.3 Stretched-exponential localization errors
Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\). Set \(\varepsilon _l=C\exp (-cl^\alpha )\) and
For every \(l\in \mathbb {N}\),
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
Also \(1\le \exp (b)\). Apply this inequality and (261) to the two square roots in (253) to obtain
At radius zero, \(0^\alpha =0\) and \(\eta _0=2\le A\), proving (260) there as well.
Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\), and take \(A,b\) from (259). Fix \(l\in \mathbb {N}\). Suppose that, for every integer \(j\) with \(0\le j\le l\),
Then
Let \(C\ge 0\), \(c{\gt}0\), and \(0{\lt}\alpha \le 1\), and take \(A,b\) from (259). 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
The estimate holds uniformly over all finite spectators and all complex operators \(B\) under the stated finite set of error bounds.
28.12.4 The full channel on an anchor component
Use the graph notation from Section 28.11: \(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)\). Equivalently, maximize over all vertices after assigning zero distance to unreachable vertices. Let \(\mathcal E_k\) be the full root channel in (248).
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 (259). 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\),
All regional sums use the original operator \(B\).
Apply Theorem 28.12.3.3 to the increasing regions \(K_l=N_l(a)\). Since \(n\ge R_a\) and \(k\in \mathcal A_{C(a)}\), exact component localization gives \(\mathcal E_{N_n(a)}(B)=\mathcal E_k(B)\) by Theorem 28.11.2. Substitute this identity into (265) and rewrite \(y\in N_l(a)\) as \(d_G(a,y)\le l\).
28.12.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
This counts labels, so distinct labels at the same anchor contribute separately.
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\),
Both the weights \(w_l\) and the site values \(v_z\) may have either sign.
Replace the radius filter by the indicator of \(y\in N_l(a_i)\) and interchange the finite sums over \(i\) and \(l\). For each fixed radius, interchange the finite sums over labels and sites:
The inner sum on the right of (269) is \(m_l(y,z)\) by (267). Multiply by \(w_l\) and sum over \(0\le l\le n\) to obtain (268).
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 (259). 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\),
Then, for every \(y\in I\),
Each channel and every site oscillation on the right act on the same original operator \(B\). The estimate holds for arbitrary finite spectators and arbitrary complex \(B\). This is the finite event-label sum in [ 247 , Section 10 ] .
Apply Theorem 28.12.4.1 to each \(k_i\) with the common cutoff \(n\). Subtract \(d_y(B)\) from each resulting inequality and sum over \(i\in F\):
Use (268) with \(w_l=A\exp (-bl^\alpha )\) and \(v_z=d_z(B)\) in (272), and factor out \(A\).
28.12.6 Uniform weighted rows of the finite event kernel
Continue to count event labels by \(m_l(y,z)\) from (267). 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\).
For real parameters \(D,b,\alpha \) and a cutoff \(N\in \mathbb {N}\), define
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 (271) is \(\sum _{z\in I}\mathsf A^{(n)}_{yz}d_z(B)\).
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 \).
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 (273) vanishes.
Let \(D,K,\mu \ge 0\) and \(b,\alpha {\gt}0\), and set
Suppose that every site \(x\in I\) and radius \(l\in \mathbb {N}\) satisfy
and that every site \(x\in I\) satisfies
Then, for every cutoff \(N\in \mathbb {N}\) and site \(y\in I\),
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
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
Summing (279) over \(N_l(a_i)\) and using (275) bounds the contribution of this label by \(K(l+1)^2\exp (-(b/2)l^\alpha )\). Apply (268) to express the row as a finite sum over labels and radii. The label bound gives
Insert (278) into (280) and collect the factors. The two quadratic factors count sites in a ball and labels whose balls contain \(y\), respectively.
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 (275) holds for all sites and radii and (276) holds for all sites. Then, for every \(N\in \mathbb {N}\) and \(y\in I\),
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\). This is the finite-kernel weighted row estimate of [ 247 , Section 10 ] .
The polynomial and finite-shell estimates used in Lemma 28.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
For (283), use truncation radius zero and a finite range of length \(N+1\). Split the exponent \(-(b/2)l^\alpha \) into two equal parts. Apply (282) to one factor and use \(\lfloor l/2\rfloor \le l\) for the other to obtain
Sum (284) through \(N\) and apply (283); the result is at most \(MS\). Choose \(V=D\mu K^2MS\) before fixing any finite sets, graph, or anchors. For every subsequent choice satisfying the ball and anchor-fiber bounds, Theorem 28.12.6.3 now gives (281).
28.12.7 Kernel bounds for actual 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 (273) 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\),
The spectator is any finite-dimensional space, and \(B\) is any complex operator on the physical space together with that spectator.
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 (275) for every site and radius, and the anchor-fiber bound (276) for every site. Set \(A=2+8\sqrt C\exp (c/2)\), and use (273) 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
For every \(y\in I\) and every complex operator \(B\) on \((\mathbb {C}^q)^{\otimes I}\otimes \mathbb {C}^J\),
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.
Apply Theorem 28.12.6.4 with \(D=2(2+8\sqrt C\exp (c/2))\) and \(b=c/2\). These parameters satisfy \(D\ge 0\) and \(b{\gt}0\), so it supplies a constant \(R\) before any finite sets, graph, or channels are chosen. For each subsequent admissible choice, its row bound gives (287), since \((c/2)/(2\, 2^\alpha )=c/(4\, 2^\alpha )\). Theorem 28.12.7.1 supplies (288) for every \(y,B\) under the stated support, cutoff, and localization hypotheses.
28.12.8 Actual constraints on a finite lattice domain
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\),
Distinct retained labels at the same anchor remain distinct.
The inclusion \(F_P\hookrightarrow F\) restricts to an injection from the retained anchor fiber into the original anchor fiber. Taking cardinalities gives (289).
Fix integers \(p\ge 1\) and \(R\ge 0\), and real constants \(J\ge 0\) and \(\Delta {\gt}0\). 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.
Choose any local dimension \(q\in \mathbb {N}\) with \(q{\gt}0\) and any finite domain \(\Lambda \subseteq \mathbb {Z}^2\), 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 |)\).
Use the spectral-filter time kernel \(f=f_{p,\Delta /2}\) and the positive constraints of Theorem 28.2.2:
with \(c_*=\max \{ 1,J(\| f\| _1+1)\} \) and \(k_X=c_*^{-1}|M_X|\). Write \(\mathcal E_X=\mathcal E_{k_X}\) for the full root channel.
Choose any predicate \(P\) on \(\mathcal F_{\Lambda ,R}\) and put \(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 (290). Take the kernel (273) on \(G_\Lambda \), with label set \(F_P\), the restricted anchors, \(D=2(2+8\sqrt C\exp (c/2))\), and \(b=c/2\). Denote this kernel by \(\mathsf A^{(N,P)}\). Its incidence counts are
Choose 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 \). Then, for every \(y\in \Lambda \),
For every \(y\in \Lambda \) and every complex operator \(B\) on \((\mathbb {C}^q)^{\otimes \Lambda }\otimes \mathbb {C}^T\),
The constants \(C,c,v\) are chosen before \(q\), the domain, Hamiltonian, anchors, ground vector, retained predicate, spectator, and cutoff. The gap assumption concerns the original full Hamiltonian \(H\). This applies [ 247 , Proposition 4.3 ] to the finite channel estimate in [ 247 , Section 10 ] .
Choose \(C,c\) from Theorem 28.2.2. For every admissible lattice instance, it gives \(0\le k_X\le \mathbb 1\), exact support in the component of \(a_X\), and, for every radius \(l\in \mathbb {N}\),
These are the localization constants for the positive constraints \(k_X\) themselves. Set \(v_R=1+2R(R+1)\) and \(\mu _R=2^{v_R-1}\). Theorem 28.2.1 gives, for every site \(x\) and radius \(l\),
Since \(0{\lt}\alpha \le 1\), apply Theorem 28.12.7.2 with \(K=2\) and \(\mu =\mu _R\) to choose \(v\) before fixing any lattice data or retained predicate. After fixing such data and \(P\), use (295) and Theorem 28.12.8.1 together with (296) to obtain
These are the geometric hypotheses for the retained label set. Restrict positivity, component support, and (294) to \(X\in F_P\) and \(l\le N\). The cutoff condition for the retained anchors then gives (292) and (293).
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 identical witnesses \(C,c,v\). For the identically false predicate, the kernel and increment sum are zero and the cutoff condition is vacuous.
28.12.9 Extended graph distance and kernel support
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
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)\).
The graph distance is zero on the diagonal and symmetric. The inclusion \(\iota \) preserves zero, addition, and order, so the graph triangle inequality gives
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\).
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\).
For every \(x,y\in V\),
where \(d_G^0(x,y)\) is the ordinary graph distance for reachable pairs and zero for unreachable pairs.
If \(d_G(x,y)=n\in \mathbb {N}\), both sides of (300) equal \(n\). If \(d_G(x,y)=\infty \), both sides equal zero by their defining conventions.
For the finite graph and label family in Definition 28.12.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\).
Each count \(m_l(y,z)\) is nonnegative and every exponential is positive. Their finite weighted sum in (273) 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 28.12.9.2 and 28.12.6.2: \(\rho _G(y,z)=\infty \) implies \(\mathsf A^{(N)}_{yz}=0\). Consequently disconnected pairs contribute zero to every weighted row, and (300) replaces \(d_G^0(y,z)\) there by \((\rho _G(y,z))_{\mathbb {R}}\).
28.13 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\). The spectator dimension may be zero. 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 28.10.1.1. All input operators are arbitrary 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\).
For a nonempty word \(w=(i_0,\ldots ,i_{m-1})\), define
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\),
In particular, \(B_{\varnothing }=B_0\) and \(B_{wi}=\mathcal E_i(B_w)\).
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 (303).
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\),
The map \(f\) may identify distinct labels.
At every position in the chronological composition, both sides of (304) apply the same map \(\mathcal E_{f(j)}\). They start from the same input \(B\) and apply these maps in the same order.
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
This is the finite composition identity in [ 247 , Section 10 ] . Neither vector need be normalized, and \(B\) need not be Hermitian.
Functional calculus gives \(G_i\Omega =\Omega \) and \(k_i^{1/2}\Omega =0\). Consequently
Induct by appending the final event to a word. The empty word gives the identity. For \(wi\), apply (306) to \(\mathcal E_w(B)\), then the induction hypothesis; the resulting left factor is \(G_iR_w=R_{wi}\).
Under the hypotheses and notation of Theorem 28.13.4, let \(u,w\) be any two finite words. Then
Vector norms are Euclidean and the matrix norm is the induced operator norm. This is the pointwise conversion used in [ 247 , 09-amplification.tex, lines 218–224 ] .
By (305), the vector inside the norm is \((\mathcal E_u(B)-\mathcal E_w(B))(\Omega \otimes \xi )\). Apply the defining operator-norm inequality.
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\).
Induct on the word, allowing an arbitrary input operator. The empty word gives equality. If the first label is \(i\) and the remaining word is \(u\), then
Here the first inequality is the induction hypothesis at input \(\mathcal E_i(B)\) and the second is Theorem 28.10.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\| \).
At the empty word, the initial support bound is Theorem 28.12.1.3. If \(q{\gt}0\) and every physical matrix block of \(B_0\) is supported on \(S\subseteq I\), then (302) gives
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\),
Use the kernel (273) with \(D=2(2+8\sqrt C\exp (c/2))\) and \(b=c/2\). Then, for every finite word \(w\), every \(y\in I\), and every initial operator \(B_0\),
Every oscillation on the right is evaluated at the same current observable \(B_w\). Labels with the same anchor remain distinct summands. The estimate holds for arbitrary finite spectators and arbitrary complex initial operators \(B_0\).
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 28.13.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 28.13.8 for this restricted family, (311) gives
where \(\mathsf A^{(N,P)}\) counts the retained labels and the cutoff need only cover their anchors. For the lattice constraints of Theorem 28.12.8.2, one may instead apply (293) directly to \(\mathcal E_w^{\, P}(B_0)\) and use (304) and (303). Thus the same \(C,c,v\), chosen before \(P\), give both the lattice weighted row bound and (312) for every retained word. Every effect in this composition is still constructed from the original full Hamiltonian and its gapped ground vector.
28.14 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
These masses sum to one. The empty alphabet has only the empty word, whose mass is one. In this section, \(B_w\) always denotes the actual composition (301), and expectations are taken with respect to \(\nu _t\).
Use the extended graph distance \(\rho _G\) from Definition 28.12.9.1, and write
\(d_G(y,S)=\inf _{z\in S}\rho _G(y,z)\). For \(\beta \ge 0\) and \(0{\lt}\alpha \le 1\), define the distance profile by
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\),
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
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
If \(d_G(y,S)=\infty \), then \(d_y(B_w)=0\) for every word \(w\). The input \(B\) may be non-Hermitian and the spectator space may have dimension zero.
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 28.12.1.3. The chronological identity \(B_{wi}=\mathcal E_i(B_w)\) turns (315) into
The extended triangle inequality and subadditivity of \(r\mapsto r^\alpha \) give \(AH_S\le vH_S\) from (316). Applying the spatial growth theorem for the atomic Poisson-word law to \(f\) gives integrability and (317). Its zero-profile conclusion gives \(f(w,y)=0\) at infinite distance for every word. This is the finite-word form of the argument in [ 247 , 09-amplification.tex, lines 161–188 ] .
Under the effect, component support, tail and cutoff hypotheses of Theorem 28.13.8, put \(\beta =c/(4\cdot 2^\alpha )\) and use the actual kernel \(\mathsf A^{(N)}\) with \(D=2(2+8\sqrt C e^{c/2})\) and \(b=c/2\). Suppose its weighted rows satisfy (316) for some \(v\ge 0\). For every initial operator \(B\) whose physical blocks are supported on \(S\), all conclusions of Theorem 28.14.1 hold.
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. Take any local dimension \(q{\gt}0\), finite lattice domain \(\Lambda \), Hamiltonian, anchors and gapped ground vector satisfying the hypotheses of Theorem 28.12.8.2. Retain any subfamily \(F_P\) of its event labels, and use its actual positive constraints \(k_i\), formed from the original Hamiltonian. Put \(\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
The oscillation is integrable. It 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, including empty retained families and empty supports.
Choose the constants from Theorem 28.12.8.2 before all lattice and operator data. For a fixed retained family, take \(N\) to be the maximum component radius of its anchors, with maximum zero for the empty family. That theorem gives both (315) and (316) for the actual finite event kernel. The kernel is nonnegative and zero between components, so Theorem 28.14.1 gives (319) and the remaining conclusions.
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
The inclusion \(j:F_P\hookrightarrow F\) sends \(\pi _P(w)\) to the ordered list \(w|_P\). Apply Theorem 28.13.3 to this inclusion.
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
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
In particular, \(\Phi \) may be the identity on matrices equipped with the Euclidean operator norm, or the site oscillation \(B\mapsto d_y(B)\).
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. Use (320) to identify the two physical evaluations, then apply change of variables under \(\pi _P\) for integrability and the Bochner integral.
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
Apply the integrability equivalence and (322) with \(\Phi (B)=d_y(B)\).
Under the hypotheses of Theorem 28.14.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
Here \(\alpha =p/(p+1)\), \(\beta =c/(4\cdot 2^\alpha )\), and \(H_S\) is (314). 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\).
28.15 Excited-state decay for the exact constraints
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 its exact positive constraints from Theorem 28.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 probability law of independent Poisson counts of mean \(t\) for the interaction labels, followed by a uniformly ordered word with those counts. For a chronological 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 \). The squared norm \(\| (D_w\otimes I)\xi \| ^2\) is integrable and satisfies
This is the fixed-time excited-state estimate in [ 247 , Section 10 ] .
The exact positive replacement gives \(k_i\Omega =0\), \(k_i\le I\) and \(\sum _i k_i\ge g(I-P_\Omega )\). Each \(G_i\) fixes \(\Omega \) and preserves its orthogonal complement. On that complement its squared-norm loss is \(\langle \xi ,k_i\xi \rangle \). Summing over labels gives a loss of at least \(g\| \xi \| ^2\). Let \(N\) be the number of interaction labels. If \(g{\gt}N\), the inequalities \(\sum _i k_i\le NI\) and \(\sum _i k_i\ge g(I-P_\Omega )\) force the orthogonal complement of \(\Omega \) to be zero, so \(\xi =0\) and the conclusion is immediate. Otherwise \(N-g\ge 0\). The sum of the squared norms over all words of length \(m\) is then at most \((N-g)^m\| \xi \| ^2\). Multiplying by the Poisson-word mass \(e^{-Nt}t^m/m!\) and summing over \(m\) gives \(e^{-Nt}e^{(N-g)t}=e^{-gt}\), with the identity on the spectator throughout.
28.16 Truncating the retained constraint product
The local constraint products lemma of [ 247 , 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 not treated here.
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 \).
Each root \((I-k_i)^{1/2}\) is a positive contraction, so \(D_w\) is a contraction. For the second claim, write \(D_w=GX\) and \(D_w'=G'X'\), with \(G,G'\) the last factors. Then \(GX-G'X'=G(X-X')+(G-G')X'\), and induction on \(m\) gives the bound.
In the setting of Theorem 28.16.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
The integrand is at most \(2\), hence integrable. By Theorem 28.16.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, \(R\ge 0\), and let each admissible support \(X_i\) of range \(R\) carry an anchor \(a_i\in X_i\). Let \(\mu _R\) be the anchor multiplicity bound of Theorem 28.2.1. 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 _R|S|(1+r)^2\) labels satisfy \(d_\Lambda (a_i,S)\le r\).
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 _R\) labels share each anchor.
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)\). There are constants \(C\ge 0\) and \(c{\gt}0\) 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 28.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\),
and every \(L(w)\) is a contraction supported on \(N_{2r}(S)\). The constants depend only on \(p,R,J,\Delta \). This is the first estimate of [ 247 , Lemma 10.1 ] , together with its contraction and support clause, without the assumptions that \(S\) is nonempty and \(r\ge 1\).
By Theorem 28.2.3 each retained root changes by at most \(Ce^{-cr^\alpha }\) under the radius-\(r\) approximation. Theorem 28.16.2 bounds the expectation by this error times \(t\) times the number of retained labels, and Theorem 28.16.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.
28.17 Omitting distant events from the constraint product
The local constraint products lemma of [ 247 , 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 28.13.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.
28.17.1 Telescoping the omitted events
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 contracts the norm of differences, and \(0\le D_P(w;B)\le 2\| B\| \). Appending a label \(i\) to \(w\) raises the defect by at most \(0\) when \(P(i)\) holds, and by at most \(\| (\mathcal E_i-\mathrm{id})(\mathcal E_{w|_P}(B))\| \) otherwise.
Linearity holds letter by letter, and contraction follows from Theorem 28.13.6 applied to a difference. Put \(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\| \).
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
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\),
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.
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
This is the real occupation identity at omitted labels in [ 216 , “Real occupation at omitted labels” ] . Set the kernel to zero on retained labels and apply the retained-prefix identity. The sum is bounded by \(M|w|\), and the Poisson word length has finite expectation, which 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
28.17.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
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\).
Sum the shell bounds of Theorem 28.12.3.2 over \(0\le l\le n\). For the second claim the radius-\(n\) local channel equals the full channel.
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\).
Beyond the largest distance from \(a\) in its component, the balls equal the component, while the right side tends to zero.
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)\).
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\),
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.
28.17.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
The retained labels satisfy the same hypotheses. By Theorem 28.14.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 28.17.2.1 against this gives, for each omitted label, a bound by the inner sum of Theorem 28.17.2.4. Sum over the omitted labels, then integrate over \(s\in (0,t]\) in Theorem 28.17.1.6.
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 28.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 \(w\mapsto D_P(w;B)\) is integrable and
This is the coupled channel estimate in the proof of the local constraint products lemma.
Under the hypotheses of Theorem 28.17.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 \),
This is the omission estimate of the local constraint products lemma. The source takes \(S\) nonempty and \(r\ge 1\); neither is needed.
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 28.13.5). Integrate and apply Theorem 28.17.3.2.
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 28.17.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\).
28.18 Typical projectors for the amplification
The proof of the amplification proposition of [ 247 , Section 10 ] begins with three spectral projections, one for each of the cuts \(X\), \(Y\) and \(S_0\). This section constructs them from the marginal tail bound and bounds the probability that each one fails. The rest of that proof is not treated here.
Let \(\Omega \) be a vector on a finite induced lattice domain \(\Lambda \), let \(A\subseteq \Lambda \), and let \(w\) be real. Write \(\rho _A=\sum _jp_j|e_j\rangle \langle e_j|\) for an eigendecomposition of the reduced state. The typical projection of \(A\) at width \(w\) is
Let \(\Omega \) be a unit vector, \(A\subseteq \Lambda \) and \(w\) real. Then \(P_A^w\) is an orthogonal projection commuting with \(\rho _A\). Every selected 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 27.117.3,
The projection is diagonal in the eigenbasis of \(\rho _A\), so \(\operatorname {tr}(\rho _AP_A^w)\) is the sum of the selected eigenvalues. The eigenvalues sum to one, and an eigenvalue is omitted only if it vanishes or its surprisal lies more than \(w\) from \(S_\Omega (A)\).
Fix \(q\ge 1\), a range \(R\), a strength \(J\ge 0\), a gap \(\Delta {\gt}0\) and \(C_0\ge 0\). There are 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
Let \(C_1\) be the constant of Theorem 27.117.7 and put \(\vartheta =J/\Delta \). Then \(\mathcal B_A\le C_1(1+C_0n)\le C_1(1+C_0)n\). By Theorem 28.18.2 and (787) 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 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 28.18.3, and an integer \(K\ge 0\). There is a threshold \(N\), depending only on these data, such that the following holds 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. Put \(w=n^{3/5}\) and \(P_X=P_X^w\), \(T_Y=P_Y^w\), \(Q_{S_0}=P_{S_0}^w\). Each of these is an orthogonal projection commuting with its reduced state, its selected eigenvalues are positive and lie in \([\mathrm e^{-S_\Omega (A)-w},\mathrm e^{-S_\Omega (A)+w}]\) for its cut \(A\), and each fails with probability at most
This is the construction of [ 247 , Section 10 ] preceding the Schmidt expansion of \(\Omega \).
28.19 The restoring operator of the amplification
After the typical projectors, the proof of the amplification proposition of [ 247 , Section 10 ] builds a restoring operator from them and establishes three estimates before any constraint product is used. This section proves these estimates for the original ground state. The constraint products, the choice of a clock realization, the polar correction and the final entropy comparison are separate steps.
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 28.18.1. Let \(\rho _X=\sum _xp_x|x\rangle \langle x|\) with a full orthonormal eigenbasis \(\{ |x\rangle \} \), and call \(x\) selected when \(|x\rangle \) lies in the range of \(P_X\). Append two systems \(s',e'\), each a copy of the space on \(X\), with fixed unit blank vectors \(|0\rangle \). The restoring operator on \(s',X,Y\) and the column operator on \(s',e',X,Y\) are
where \(y\) runs over the full basis. Let \(\phi \) be \(\Omega \) with \(X\) relabelled as \(e'\) and blanks inserted on \(X,s'\), and let \(\eta =\Omega \otimes \sum _x\sqrt{p_x}|x\rangle _{s'}|x\rangle _{e'}\).
The configuration space of \(\Lambda \) is the product of those of \(X\), \(Y\) and \(Z'\). In these coordinates, with the factor \(X\) written in the eigenbasis \(\{ |x\rangle \} \) of \(\rho _X\), the vector \(\Omega \) and the projection \(Q\) are the inputs of \(R_0\), \(B_0\), \(\phi \) and \(\eta \).
For every vector \(\Omega \) and disjoint \(X,Y\),
Complementary regions of a pure state have equal entropy. Thus \(S_\Omega (Z')=S_\Omega (S_0)\), and \(S_\Omega (X\cup Z')=S_\Omega (Y)\) because the complement of \(X\cup Z'\) is \(Y\).
The projection \(Q\) commutes with \(\rho _{S_0}\), and
Both projections 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}\). The 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 \).
For an orthogonal projection \(P\) on a factor \(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 put \(\mathcal I=I_\Omega (X:Z')\) and \(M_0=\exp \bigl((\mathcal I+3w)/2\bigr)\). Then
the last for every physical operator \(L'\).
Selected eigenvalues satisfy \(p_x^{-1}\le \mathrm e^{S_\Omega (X)+w}\). With the inequalities of Theorem 28.19.3, the Gram matrices of \(R_0\) and \(B_0\) are at most \(\mathrm e^{S_\Omega (X)+S_\Omega (S_0)-S_\Omega (Y)+3w}\), which is \(M_0^2\) by Theorem 28.19.2. The ground component is bounded through \(M_X=\operatorname {tr}_Y[(I_X\otimes T_Y)\rho _{S_0}Q]\), which satisfies \(0\le M_X\le \rho _X\) because \(Q\) commutes with \(\rho _{S_0}\); the \(X\)-marginal is diagonal in the chosen eigenbasis. The adjoint error follows by telescoping the three projections on \(\Omega \) with the bounds of Theorem 28.19.4.
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 is a threshold \(N\), depending only on these data, such that the following holds 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 disjoint \(X,Y\) such that \(X\), \(Y\) and \(S_0\) have at most \(C_0n\) crossing edges each. With \(w=n^{3/5}\), the estimates of Theorem 28.19.5 hold with \(3\sqrt\delta =3n^{-K}\).
Theorem 28.18.4 gives failure probabilities at most \(\delta =n^{-2K}\), and \(\sqrt{n^{-2K}}=n^{-K}\).