Introduction
The entanglement entropy of a pure quantum state measures how much information is shared by a region and its complement. Its elementary upper bound is proportional to the number of sites in the region. An area law replaces this volume by the number of interactions crossing the region’s boundary. We prove such a bound for the unique gapped ground state of a general finite-range Hamiltonian in two dimensions.
The setting and the theorem
Let Λ ⊂ Z 2 \Lambda\subset\mathbb{Z}^{2} Λ ⊂ Z 2 be finite. Its edges join pairs at Euclidean distance one, so that Λ \Lambda Λ carries the induced square-lattice graph. Write d Λ d_{\Lambda} d Λ for graph distance, with value + ∞ +\infty + ∞ between different components. At each site put a copy of C q \mathbb{C}^{q} C q , and write H Λ = ⨂ x ∈ Λ C q \mathcal{H}_{\Lambda} = \bigotimes_{x \in\Lambda} \mathbb{C}^{q} H Λ = ⨂ x ∈ Λ C q . An operator supported on X ⊆ Λ X \subseteq\Lambda X ⊆ Λ acts as the identity on the other tensor factors. An admissible Hamiltonian has the form
H = ∑ ∅ ≠ X ⊆ Λ diam d Λ X ≤ R h X , h X = h X ∗ , ∥ h X ∥ ≤ J . (1) H = \sum_{\substack{\varnothing\ne X \subseteq\Lambda\\ \operatorname{diam}_{d_{\Lambda}} X \le R}} h_X,\qquad h_X = h_X^{*},\qquad\lVert h_X\rVert\le J. \tag*{(1)} H = ∅ = X ⊆ Λ diam d Λ X ≤ R ∑ h X , h X = h X ∗ , ∥ h X ∥ ≤ J . (1)
There is one summand for each support X X X ; a summand may be zero. Here q ≥ 1 q \ge1 q ≥ 1 and R ≥ 0 R \ge0 R ≥ 0 are fixed integers and J > 0 J > 0 J > 0 is fixed. This indexing convention bounds the sum of interaction norms at every site in terms of R R R , J J J alone.
For A ⊆ Λ A \subseteq\Lambda A ⊆ Λ define the edge boundary
∂ Λ A = { { x , y } : x ∈ A , y ∈ Λ ∖ A , ∣ x − y ∣ 1 = 1 } . \partial_{\Lambda} A = \{\{x,y\}: x \in A,\ y \in\Lambda\setminus A,\ \lvert x-y\rvert_{1}=1\}. ∂ Λ A = {{ x , y } : x ∈ A , y ∈ Λ ∖ A , ∣ x − y ∣ 1 = 1 } .
If Ω ∈ H Λ \Omega\in\mathcal{H}_{\Lambda} Ω ∈ H Λ is a unit vector, write ρ A = Tr Λ ∖ A ∣ Ω ⟩ ⟨ Ω ∣ \rho_A = \operatorname{Tr}_{\Lambda\setminus A} \lvert\Omega\rangle\langle\Omega\rvert ρ A = Tr Λ ∖ A ∣ Ω ⟩ ⟨ Ω ∣ and S Ω ( A ) = − Tr ρ A log ρ A S_{\Omega}(A) = -\operatorname{Tr}\rho_A \log\rho_A S Ω ( A ) = − Tr ρ A log ρ A , with 0 log 0 = 0 0\log0=0 0 log 0 = 0 . All logarithms are natural.
Theorem 1.1 (Area law). For every q , R , J q,R,J q , R , J as above and every Δ > 0 \Delta> 0 Δ > 0 , there is a finite constant C = C ( q , R , J , Δ ) C=C(q,R,J,\Delta) C = C ( q , R , J , Δ ) with the following property. Suppose that Λ \Lambda Λ is a finite induced square-lattice domain and that the Hamiltonian (1.1) has a unique normalized ground vector Ω \Omega Ω , up to phase, with ground energy E 0 E_0 E 0 , and satisfies
H − E 0 id ≥ Δ ( id − ∣ Ω ⟩ ⟨ Ω ∣ ) . H-E_0\operatorname{id} \ge\Delta\left(\operatorname{id}-\lvert\Omega\rangle\langle\Omega\rvert\right). H − E 0 id ≥ Δ ( id − ∣ Ω ⟩ ⟨ Ω ∣ ) .
Then for every A ⊆ Λ A \subseteq\Lambda A ⊆ Λ ,
S Ω ( A ) ≤ C ∣ ∂ Λ A ∣ . (2) S_{\Omega}(A) \le C\lvert\partial_{\Lambda}A\rvert. \tag*{(2)} S Ω ( A ) ≤ C ∣ ∂ Λ A ∣ . (2)
The same constant applies to all such domains, sets, and Hamiltonians.
The distance in (1.1) is the distance within the induced graph. This distinction matters for domains with holes or disconnected components. The spectral assumption concerns the full Hamiltonian; no gap assumption is imposed on Hamiltonians restricted to smaller regions.
For completeness, the theorem also gives the usual vertex-boundary formulations. Define
∂ i n A = { x ∈ A : ∃ y ∉ A , { x , y } ∈ ∂ Λ A } , Z A = ⋃ e ∈ ∂ Λ A e . \partial_{\mathrm{in}} A = \{x \in A : \exists y \notin A,\ \{x,y\} \in\partial_{\Lambda}A\},\qquad Z_A = \bigcup_{e \in\partial_{\Lambda}A} e. ∂ in A = { x ∈ A : ∃ y ∈ / A , { x , y } ∈ ∂ Λ A } , Z A = e ∈ ∂ Λ A ⋃ e .
Corollary 1.2. The conclusion of Theorem 1.1 holds for every subset of a finite rectangular square lattice with bounded on-site and nearest-neighbor interactions and a unique ground state separated by a fixed global gap. For every domain covered by that theorem it also implies
S Ω ( A ) ≤ 4 C ∣ ∂ i n A ∣ , S Ω ( A ) ≤ 2 C ∣ Z A ∣ . S_{\Omega}(A) \le4C\lvert\partial_{\mathrm{in}}A\rvert,\qquad S_{\Omega}(A) \le2C\lvert Z_A\rvert. S Ω ( A ) ≤ 4 C ∣ ∂ in A ∣ , S Ω ( A ) ≤ 2 C ∣ Z A ∣ .
Proof. On-site and nearest-neighbor interactions have graph range at most one. Each inner boundary vertex is incident with between one and four crossing edges, so ∣ ∂ i n A ∣ ≤ ∣ ∂ Λ A ∣ ≤ 4 ∣ ∂ i n A ∣ |\partial_{\mathrm{in}} A| \leq|\partial_{\Lambda} A| \leq4|\partial_{\mathrm{in}} A| ∣ ∂ in A ∣ ≤ ∣ ∂ Λ A ∣ ≤ 4∣ ∂ in A ∣ . Counting both endpoints gives ∣ Z A ∣ ≤ 2 ∣ ∂ Λ A ∣ ≤ 4 ∣ Z A ∣ |Z_A| \leq2|\partial_{\Lambda} A| \leq4|Z_A| ∣ Z A ∣ ≤ 2∣ ∂ Λ A ∣ ≤ 4∣ Z A ∣ . These inequalities include empty boundaries.
History and related work
The relation between entanglement and boundary area arose in quantum-field calculations motivated by black-hole entropy. Bombelli, Koul, Lee, and Sorkin related entropy from tracing inaccessible quantum-field degrees of freedom to black-hole area [11 ] ; Srednicki subsequently found area scaling numerically for a spherical region in the vacuum of a regulated free massless scalar field [36 ] . These calculations motivated the entanglement area-law question through regulated field models. For finite-dimensional lattice spins, the gap-to-area conjecture asks whether a unique ground state has an entropy bound proportional to boundary area when local dimension, interaction range and strength are bounded and the spectral gap has a size-independent positive lower bound [21 , 8 ] . Theorem 1.1 gives an affirmative answer in the stated two-dimensional induced-domain setting.
In one dimension, Hastings proved a length-independent entropy bound for the unique ground state of a finite-range Hamiltonian with uniformly bounded interactions, fixed local dimension, and a positive spectral gap [21 ] . Arad, Landau, and Vazirani improved the dependence on the inverse gap for frustration-free chains using approximate ground-state projectors [8 ] . These are operators that preserve the ground vector while contracting its orthogonal complement, with controlled growth of Schmidt rank. Arad, Kitaev, Landau, and Vazirani extended this approach to general, possibly frustrated chains [7 ] . A complementary result of Brandão and Horodecki derives an area law for pure one-dimensional states from exponential decay of correlations between arbitrary separated regions [13 ] . This region-wise hypothesis is stronger than decay of single-site correlation functions. More generally, the exponential clustering theorem relates a spectral gap to decay of connected correlations of separated observables [30 ] ; an entropy estimate requires control of the reduced state’s full spectrum. Anshu, Harrow, and Soleimanifar obtained boundary-dependent bounds on smooth entanglement spread, which measures the width of the significant part of that spectrum, including square-root boundary scaling on lattices up to logarithmic factors [5 ] . Such a width estimate leaves the location of the spectrum, and hence its entropy, to be controlled.
Strict area-law bounds in higher dimensions are also known for restricted model classes. Cramer, Eisert, Plenio, and Dreißig proved such a bound for arbitrary regions in cubic harmonic lattices with a finite-range positive potential matrix whose condition number is uniformly bounded [18 ] . These Gaussian models have infinite-dimensional oscillator sites and provide a comparison with the finite-dimensional spin setting considered here.
Other higher-dimensional results make additional spectral or thermodynamic assumptions. Masanes obtained bounds with logarithmic corrections from correlation decay and bounds on the number of low-energy states of restricted Hamiltonians [28 ] ; Brandão and Cramer obtained a logarithmically corrected bound for cubic regions under a low-temperature heat-capacity hypothesis [12 ] . Cho proved strict area scaling for balls along boundary-growth families satisfying uniform gaps and an additional compatibility condition on successive reduced ground states [16 ] . These conditions supply information beyond the gap of the single full Hamiltonian considered here.
For two-dimensional spin systems, Anshu, Arad, and Gosset proved a subvolume bound for rectangular regions in a rectangular lattice with plaquette projector interactions, a unique frustration-free ground state, and a uniform local gap [3 ] . At fixed local dimension and local gap, the bound is O ( b 5 / 3 log 7 / 3 ( 2 + b ) ) O(b^{5/3}\log^{7/3}(2+b)) O ( b 5/3 log 7/3 ( 2 + b )) , where b b b is the rectangle’s boundary size. Their subsequent result gives
S ≤ n 1 + O ( ( log n ) − 1 / 5 ) S \leq n^{1+O((\log n)^{-1/5})} S ≤ n 1 + O (( l o g n ) − 1/5 )
across a vertical cut of length n n n , again for locally gapped, frustration-free plaquette projector models with a unique ground state [2 ] . The local-gap assumption concerns restrictions of the Hamiltonian; it is stronger than a gap for the full system alone. The latter entropy bound is near-linear, and its theorem concerns vertical cuts. The setting considered here allows frustrated interactions, assumes a gap only for the full Hamiltonian, and includes arbitrary regions in arbitrary finite induced square-lattice domains. Arad, Firanko, and Jain extend approximate-projector methods to maximally mixed ground states and bound their mutual information, with a two-dimensional application under frustration-free and local-gap assumptions [6 ] .
The proof below combines locality estimates with ways of expressing entropy through operator norms. For locality, we use the Lieb–Robinson framework [26 , 29 ] and Kitaev’s centered spectral filter [23 ] , Appendix D.1.2. Swingle and McGreevy discuss positive constraints obtained by squaring filtered terms, for which retaining a gap is a separate issue [37 ] , Section 8.4. Here taking absolute values gives the operator domination that retains the full-system gap. Later, products of positive contractions derived from these constraints preserve the ground state and suppress excitations, as projection products do in detectability-lemma arguments [4 ] . Their localization uses propagation estimates for unital channels, related to dissipative Lieb–Robinson bounds [9 ] ; the coupled random-product estimate needed here is proved in Section 10.
For the entropy comparison, bounds on local entanglement production are a precedent for controlling logarithmic commutators independently of spectator dimensions [39 ] . Section 3 proves the quadratic real-part estimate needed for our marginal tails. Strong subadditivity and conditional-entropy continuity supply the entropy inequalities used throughout [27 , 1 , 41 ] . We encode marginal spectra on symmetric tensor powers using Schur–Weyl duality [19 ] , whose connection with spectrum estimation is developed by Keyl and Werner [22 ] . The passage back to one-copy vectors uses finite quantum de Finetti measures [17 , 25 ] and the product calculus of symmetrized finite observables [35 ] . Weighted operator geometric means [34 , 24 ] combine the changing partitions, while the modular comparison starts from the resolvent-compression identity of Carlen and Vershynina [14 ] , Lemma 2.1. The detailed construction uses these ingredients to compare entropy gain and excitation energy in the same family of states; the next overview explains how that comparison leads to the area bound.
A tensor-network consequence
A projected entangled-pair state (PEPS) is specified by one tensor at each lattice site, with a physical index for that site’s state and one virtual index for each incident edge. Contracting the paired virtual indices gives a many-body vector. The dimension of an edge index is its bond dimension. The approximation problem asks how large these dimensions must be to approximate the ground vector on the original lattice.
The companion [32 ] , Theorem 1.1 proves a polynomial bound for the original open L × L L \times L L × L square grid, L ≥ 2 L \ge2 L ≥ 2 , with on-site and nearest-neighbor interactions. For fixed local dimension q ≥ 2 q \ge2 q ≥ 2 , term-norm bound J > 0 J > 0 J > 0 , and global gap Δ > 0 \Delta> 0 Δ > 0 , every unique ground vector in this class has a PEPS approximation with maximum bond dimension at most C L c C L^{c} C L c and global vector error at most L − 1 L^{-1} L − 1 after normalization and phase choice. The constants depend only on q , J , Δ q,J,\Delta q , J , Δ . This is an existence result; it does not assert an efficient tensor construction or contraction algorithm.
The approximation uses more than the entropy inequality. This paper also provides positive operators that annihilate the ground vector and have rapidly decaying spatial tails (Proposition 4.3), quantitative information bounds across collars (Propositions 9.6 and 10.2), and two families of geometrically separated regions (Proposition 11.2), with the region shapes and clearances specified in those results. The companion combines these estimates and the geometric ordering with additional compression and routing arguments; its PEPS result is a consequence of that further analysis.
How the proof is organized
Fix the set A A A whose entropy is to be bounded, and let Z A Z_A Z A be its crossing-edge endpoints. For disjoint physical regions B , C B,C B , C , write
I Ω ( B : C ) = S Ω ( B ) + S Ω ( C ) − S Ω ( B ∪ C ) I_{\Omega}(B:C)=S_{\Omega}(B)+S_{\Omega}(C)-S_{\Omega}(B\cup C) I Ω ( B : C ) = S Ω ( B ) + S Ω ( C ) − S Ω ( B ∪ C )
for their mutual information. Our analytic goal is to make this quantity small when B B B lies inside A A A and C C C is beyond a suitable collar, even when C C C includes all of Λ ∖ A \Lambda\setminus A Λ ∖ A . Here is why this suffices. Suppose that, after removing a set D D D of O ( ∣ ∂ Λ A ∣ ) O(\lvert\partial_{\Lambda}A\rvert) O (∣ ∂ Λ A ∣) sites, we can partition A A A into two ordered families of regions. If each region shares little information with the complement of A A A together with the earlier regions of its own family, two applications of the entropy chain rule cancel all individual region entropies. Purity then bounds S Ω ( A ) S_{\Omega}(A) S Ω ( A ) by ∣ D ∣ log q \lvert D\rvert\log q ∣ D ∣ log q and the sum of the information errors. Section 11 constructs regions with the required ordering and separation.
The analytic estimates concern intersections of A A A with ambient boxes or finite unions of rectangles and triangles. Their clearance is from Z A Z_A Z A ; they may meet holes or the edge of the physical domain. Hamiltonian locality and propagation always use neighborhoods in the induced graph. The argument has five stages.
Obtain a first exponent below volume. Section 3 uses the global gap to bound fluctuations of the negative logarithms of positive marginal eigenvalues. It then optimizes products of positive operators on nested rectangles. Two bounds on the optimized norm, one using the energy estimate and global gap, give a conditional-entropy discount, and hence
S Ω ( A ∩ Q ) ≤ C r 1 + e 0 , e 0 < 1 , S_{\Omega}(A\cap Q)\le Cr^{1+e_0},\qquad e_0<1, S Ω ( A ∩ Q ) ≤ C r 1 + e 0 , e 0 < 1 ,
for a box Q Q Q of side at most r r r sufficiently far from Z A Z_A Z A .
Control information and energy in the same interpolation. Section 4 replaces the Hamiltonian by a sum of positive operators that annihilate Ω \Omega Ω separately, retain a global gap, and have rapidly decaying graph-local tails. Sections 5–7 associate positive operators to partitions of the full system and interpolate between them as a small subsystem changes parts. These operators act on symmetric tensor powers, whose vectors are fixed by every permutation of the copies. Applying an inverse power of the interpolating operator to a vector built from ground-state copies and an auxiliary entangled pair defines the filtered vector whose norm we study. As the copy number grows, logarithmic norms per copy can be compared with combinations of marginal entropies. The decrease of a suitable logarithmic squared norm is bounded below by averaged conditional mutual information, up to a small error. The same transported states bound the energy cost. This common control permits a comparison of information gained with excitation energy spent.
Compare the norms and scan a collar. Section 8 gives two bounds on the negative logarithm of the filtered vector’s norm. Auxiliary dimensions are chosen from a high-probability part of the target’s Schmidt spectrum. Projecting the target and an auxiliary system onto an entangled pair gives the upper bound. The lower bound uses the global gap: low physical energy forces most copies into the ground state. Section 9 moves the partitions through a collar according to a finite randomized schedule. Each interaction is rarely split by a moving boundary, and the schedule supplies an interpolation with sufficiently low energy. The two norm bounds first improve the box exponent repeatedly; their sharper form then gives
I Ω ( A ∩ T : Λ ∖ ( A ∩ T L ) ) ≤ C n 1 − ε . I_{\Omega}(A\cap T:\Lambda\setminus(A\cap T_L))\le Cn^{1-\varepsilon}. I Ω ( A ∩ T : Λ ∖ ( A ∩ T L )) ≤ C n 1 − ε .
Here T T T is one of the finite unions of controlled rectangles and triangles specified in Definition 9.3, ε > 0 \varepsilon> 0 ε > 0 is fixed, and T L T_L T L is the ambient sup-norm enlargement by L = ⌊ n − ε ⌋ L = \lfloor n^{-\varepsilon}\rfloor L = ⌊ n − ε ⌋ . These targets and their allowed enlargements have O ( n ) O(n) O ( n ) boundary edges. The entire finite physical and auxiliary system and schedule are fixed before the copy number tends to infinity.
Amplify the information bound. Section 10 uses typical spectral subspaces to construct a candidate operator for restoring a target moved to an auxiliary reference. Its norm is controlled by the collar information. A localized product of contractions derived from the positive constraints suppresses the excited component, and polar decomposition yields a unitary comparison near the target. This unitary leaves both the reference and the remote physical system untouched; comparison with a state in which they are independent bounds their original mutual information. Enlarging the collar by a sublinear radius makes the bound smaller than any prescribed inverse power of n n n .
Arrange the regions for entropy cancellation. Section 11 builds the two ordered families described above. The collar around each region avoids the complement of A A A and all earlier regions of its own family. Narrow strips and recursive repairs at point contacts produce these separations for arbitrary cuts while leaving only O ( ∣ ∂ Λ A ∣ ) O(|\partial\Lambda_A|) O ( ∣ ∂ Λ A ∣ ) sites uncovered. The information errors are summable over the regions, so the two entropy chains prove (1.2).
Entropy and induced-graph locality
We record the finite-dimensional conventions and elementary uniform bounds used throughout the proof. Unless specified otherwise, entropies refer to the original ground vector Ω \Omega Ω . A changed state is shown by a subscript. Juxtaposition of disjoint systems denotes their tensor product or their union.
Entropy identities and continuity
For a density matrix ρ \rho ρ on systems D D D , E E E , F F F , define
S ( D ∣ E ) ρ = S ( D E ) ρ − S ( E ) ρ , I ( D : E ) ρ = S ( D ) ρ + S ( E ) ρ − S ( D E ) ρ . S(D|E)_\rho= S(DE)_\rho- S(E)_\rho,\qquad I(D:E)_\rho= S(D)_\rho+ S(E)_\rho- S(DE)_\rho. S ( D ∣ E ) ρ = S ( D E ) ρ − S ( E ) ρ , I ( D : E ) ρ = S ( D ) ρ + S ( E ) ρ − S ( D E ) ρ .
and
I ( D : F ∣ E ) ρ = S ( D E ) ρ + S ( E F ) ρ − S ( E ) ρ − S ( D E F ) ρ . I(D:F|E)_\rho= S(DE)_\rho+ S(EF)_\rho- S(E)_\rho- S(DEF)_\rho. I ( D : F ∣ E ) ρ = S ( D E ) ρ + S ( E F ) ρ − S ( E ) ρ − S ( D E F ) ρ .
We use strong subadditivity, I ( D : F ∣ E ) ρ ≥ 0 I(D:F|E)_\rho\ge0 I ( D : F ∣ E ) ρ ≥ 0 , for normalized finite-dimensional density operators [27 ] . It implies that conditioning decreases conditional entropy and that discarding systems cannot increase mutual information. Subadditivity and purification give ∣ S ( D ∣ E ) ∣ ≤ log dim D |S(D|E)| \le\log\dim D ∣ S ( D ∣ E ) ∣ ≤ log dim D . For a pure state the entropies of complementary systems coincide. These facts also hold with empty regions, whose Hilbert spaces are the one-dimensional empty tensor product.
Write h ( u ) = − u log u − ( 1 − u ) log ( 1 − u ) h(u) = -u\log u - (1-u)\log(1-u) h ( u ) = − u log u − ( 1 − u ) log ( 1 − u ) for binary entropy. The trace distance of two states is half the trace norm of their difference. The continuity estimate below uses the dimension-independent conditional entropy method of Alicki and Fannes [1 ] , in Winter’s sharpened form [41 ] .
Lemma 2.1 (Continuity with a fixed controlled system ). Let ρ , σ \rho,\sigma ρ , σ be density operators on finite-dimensional D ⊗ E D \otimes E D ⊗ E , and put δ = 1 2 ∥ ρ − σ ∥ ≤ 1 \delta= \frac{1}{2}\lVert\rho-\sigma\rVert\le1 δ = 2 1 ∥ ρ − σ ∥ ≤ 1 and d D = dim D d_D = \dim D d D = dim D . Then
∣ S ( D ∣ E ) ρ − S ( D ∣ E ) σ ∣ ≤ 2 δ log d D + ( 1 + δ ) h ( δ 1 + δ ) ≤ C δ log ( e d D ) . (3) \left|S(D|E)_\rho- S(D|E)_\sigma\right| \le2\delta\log d_D + (1+\delta)h\left(\frac{\delta}{1+\delta}\right) \le C\sqrt{\delta}\log(e d_D). \tag*{(3)} ∣ S ( D ∣ E ) ρ − S ( D ∣ E ) σ ∣ ≤ 2 δ log d D + ( 1 + δ ) h ( 1 + δ δ ) ≤ C δ log ( e d D ) . (3)
The same estimates hold for S ( D ) S(D) S ( D ) by making E E E trivial. Summing the bounds for S ( D ) S(D) S ( D ) and S ( D ∣ E ) S(D|E) S ( D ∣ E ) therefore bounds the continuity cost for I ( D : E ) I(D:E) I ( D : E ) in terms of d D d_D d D , independently of dim E \dim E dim E .
Proof. We include the mixture argument for the bound in [41 ] Lemma 2. If τ = ∑ j p j τ j \tau=\sum_j p_j\tau_j τ = ∑ j p j τ j , adding a classical register that records j j j shows
0 ≤ S ( D ∣ E ) τ − ∑ j p j S ( D ∣ E ) τ j ≤ H ( p ) . 0\le S(D|E)_\tau-\sum_j p_jS(D|E)_{\tau_j}\le H(p). 0 ≤ S ( D ∣ E ) τ − j ∑ p j S ( D ∣ E ) τ j ≤ H ( p ) .
For the lower bound, condition on that register and use strong subadditivity. For the upper bound, use the ordinary mixing upper bound on S ( D E ) S(DE) S ( D E ) and concavity of S ( E ) S(E) S ( E ) . The ordinary bound follows by recording a duplicate of the classical register: its conditional entropy given D E DE D E is nonnegative after this further conditioning.
If δ > 0 \delta>0 δ > 0 , write the Jordan decomposition ρ − σ = δ ( τ + − τ − ) \rho-\sigma=\delta(\tau_+-\tau_-) ρ − σ = δ ( τ + − τ − ) , where τ ± \tau_\pm τ ± are states. Then
ρ + δ τ − 1 + δ = σ + δ τ + 1 + δ . \frac{\rho+\delta\tau_-}{1+\delta}=\frac{\sigma+\delta\tau_+}{1+\delta}. 1 + δ ρ + δ τ − = 1 + δ σ + δ τ + .
Apply the mixture bounds to both expressions and use ∣ S ( D ∣ E ) τ + − S ( D ∣ E ) τ − ∣ ≤ 2 log d D \lvert S(D|E)_{\tau_+}-S(D|E)_{\tau_-}\rvert\le2\log d_D ∣ S ( D ∣ E ) τ + − S ( D ∣ E ) τ − ∣ ≤ 2 log d D . This proves the first inequality. The second follows from the elementary bound h ( u ) ≤ C u h(u)\le C\sqrt{u} h ( u ) ≤ C u . The case δ = 0 \delta=0 δ = 0 is immediate. Finally, I ( D : E ) = S ( D ) − S ( D ∣ E ) I(D:E)=S(D)-S(D|E) I ( D : E ) = S ( D ) − S ( D ∣ E ) , so the two displayed entropy bounds apply.
The trace distance between pure states represented by unit vectors ξ , η \xi,\eta ξ , η is at most ∥ ξ − η ∥ \lVert\xi-\eta\rVert ∥ ξ − η ∥ . We will use Lemma 2.1 on regions with a controlled number of sites, or with the controlled region as the first argument of a conditional entropy. In this way estimates never acquire the dimension of an uncontrolled complement.
Local counting and degenerate cases
For a site x x x let B Λ ( x , r ) = { y : d Λ ( x , y ) ≤ r } B_\Lambda(x,r)=\{y:d_\Lambda(x,y)\le r\} B Λ ( x , r ) = { y : d Λ ( x , y ) ≤ r } . A path of length r r r has ambient ℓ 1 \ell^1 ℓ 1 displacement at most r r r ; hence, for an integer r ≥ 0 r\ge0 r ≥ 0 ,
∣ B Λ ( x , r ) ∣ ≤ v r : = 1 + 2 r ( r + 1 ) . |B_\Lambda(x,r)|\le v_r:=1+2r(r+1). ∣ B Λ ( x , r ) ∣ ≤ v r := 1 + 2 r ( r + 1 ) .
For a physical set D D D put N Λ r ( D ) = { x : d Λ ( x , D ) ≤ r } N_\Lambda^r(D)=\{x:d_\Lambda(x,D)\le r\} N Λ r ( D ) = { x : d Λ ( x , D ) ≤ r } . We reserve graph neighborhoods for support and propagation estimates. An ambient dilation of a finite set T ⊂ Z 2 T\subset\mathbb{Z}^2 T ⊂ Z 2 is instead T j = T + ( [ − j , j ] 2 ∩ Z 2 ) T_j=T+([-j,j]^2\cap\mathbb{Z}^2) T j = T + ([ − j , j ] 2 ∩ Z 2 ) for integer j ≥ 0 j\ge0 j ≥ 0 .
Assign each nonzero interaction in (1.1) an anchor in its support. The number of terms containing any prescribed site is at most
μ R : = 2 v R − 1 , \mu_R:=2^{v_R-1}, μ R := 2 v R − 1 ,
because each such support is a subset of its radius-R R R graph ball containing that site. In particular, the number of anchored terms at a site is at most μ R \mu_R μ R , and the sum of norms of terms containing that site is at most J μ R J\mu_R J μ R . Terms with scalar identity factors still obey these bounds with their assigned supports.
Call an assigned support split by a set D D D when it meets both D D D and Λ ∖ D \Lambda\setminus D Λ ∖ D . For a split support, a graph path of length at most R R R from its anchor to a point of the opposite side crosses ∂ Λ D \partial_\Lambda D ∂ Λ D . The anchor is therefore within graph distance R R R of a crossing-edge endpoint. Consequently,
# { terms split by D } ≤ 2 v R μ R ∣ ∂ Λ D ∣ . \#\{\text{terms split by }D\}\le2v_R\mu_R|\partial_\Lambda D|. # { terms split by D } ≤ 2 v R μ R ∣ ∂ Λ D ∣.
Across any bipartition, a term can be decomposed by matrix units on its finite support into a bounded number of product operators, with bounded factors. For the original interactions the bounds depend only on q , R , J q,R,J q , R , J .
If q = 1 q = 1 q = 1 or Λ = ∅ \Lambda= \varnothing Λ = ∅ , all entropies vanish. When R = 0 R = 0 R = 0 , the Hamiltonian is a sum of on-site operators. Uniqueness of its ground state then makes that state a tensor product, so the theorem also follows. We may henceforth assume q ≥ 2 q \ge2 q ≥ 2 , R ≥ 1 R \ge1 R ≥ 1 , and a nonempty domain.
Lemma 2.2 (A cut with no crossing edge). Under the hypotheses of Theorem 1.1, if ∂ Λ A = ∅ \partial_\Lambda A = \varnothing ∂ Λ A = ∅ , then S Ω ( A ) = 0 S_\Omega(A) = 0 S Ω ( A ) = 0 .
Proof. Such a set A A A is a union of graph components. Every support of finite graph diameter lies in one component, so H H H is the tensor sum of component Hamiltonians. Its ground eigenspace is the tensor product of their ground eigenspaces. If the former is one-dimensional, so is each latter space. The ground vector factors over the components and therefore over the cut.
All constants denoted by C , c > 0 C, c > 0 C , c > 0 below may change at different occurrences. Unless a lemma specifies additional fixed data, they depend only on q , R , J , Δ q, R, J, \Delta q , R , J , Δ . They never depend on the domain, the cut, or the particular Hamiltonian. Additional numerical exponents and sufficiently large thresholds will be fixed in the order stated in the proof.
Marginal tails and an initial box estimate
This section supplies two inputs to the proof: a moment bound for marginal spectra and an entropy bound strictly below the volume of a rectangle that stays away from the prescribed cut. The spectral gap first controls the fluctuations of the negative logarithms of marginal eigenvalues. To bound the entropy itself, we then optimize a product of positive operators on nested rectangles. An energy estimate and a trial using a Schmidt vector give opposite bounds on the norm of the filtered ground vector. Comparing them discounts the conditional entropy of the innermost rectangle. Averaging the entropy chain rule over orders of small rectangles turns this discount into a subvolume bound.
A marginal spectral estimate
Boundary-dependent concentration of entanglement spectra was established by Anshu, Harrow, and Soleimanifar through smooth entanglement spread, with square-root boundary scaling on lattices up to logarithmic factors [5 ] . The estimate below instead controls the moment-generating function of the marginal surprisal centered at its entropy. We prove it directly by tilting the ground vector and comparing its excitation energy with the global gap.
The following lemma does not require a lattice. Its dependence on the logarithm of each interaction’s supporting dimension will also allow us to apply it to the truncated interactions constructed in Section 4. A related precedent is the bound on local entanglement production whose constant is independent of spectator dimensions [39 ] . Here the required estimate is a quadratic bound on the real part of the change under conjugation; we prove it below.
Lemma 3.1 (Marginal moment and tail bounds). Let H = ⨂ v ∈ V H v \mathcal{H} = \bigotimes_{v \in V} \mathcal{H}_v H = ⨂ v ∈ V H v be a finite tensor product of finite-dimensional Hilbert spaces. Let H = ∑ i ∈ I h i H = \sum_{i \in\mathcal{I}} h_i H = ∑ i ∈ I h i , where I \mathcal{I} I is finite, each h i h_i h i is self-adjoint, ∥ h i ∥ ≤ c 0 \lVert h_i \rVert\le c_0 ∥ h i ∥ ≤ c 0 for a fixed c 0 ≥ 0 c_0 \ge0 c 0 ≥ 0 , and h i h_i h i has a designated support D i ⊆ V D_i \subseteq V D i ⊆ V . Suppose that H H H has a one-dimensional ground space spanned by a normalized vector Ψ \Psi Ψ , ground energy E 0 E_0 E 0 , and gap at least g 0 > 0 g_0 > 0 g 0 > 0 . Fix a bipartition B ∪ ˙ B c = V B \mathbin{\dot\cup} B^c = V B ∪ ˙ B c = V . Let I × \mathcal{I}_\times I × be the indices whose designated support meets both sides, and put
ρ = Tr B c ∣ Ψ ⟩ ⟨ Ψ ∣ , d i = ∏ v ∈ D i dim H v , B = 1 + ∑ i ∈ I × log 2 ( e d i ) . \rho= \operatorname{Tr}_{B^c} \lvert\Psi\rangle\langle\Psi\rvert, \qquad d_i = \prod_{v \in D_i} \dim\mathcal{H}_v, \qquad\mathcal{B} = 1 + \sum_{i \in\mathcal{I}_\times} \log^2(e d_i). ρ = Tr B c ∣ Ψ ⟩ ⟨ Ψ ∣ , d i = v ∈ D i ∏ dim H v , B = 1 + i ∈ I × ∑ log 2 ( e d i ) .
Let p j p_j p j be the positive eigenvalues of ρ \rho ρ , let K K K take the value − log p j -\log p_j − log p j with probability p j p_j p j , and write S = S ( ρ ) S=S(\rho) S = S ( ρ ) and ϑ = c 0 / g 0 \vartheta=c_0/g_0 ϑ = c 0 / g 0 . Then
log E e u K ≤ u S + 512 e ϑ B u 2 , ∣ u ∣ ≤ 1 32 ( 1 + ϑ ) B . (4) \log\mathbb{E}e^{uK}\leq uS+512e^{\vartheta}Bu^2,\qquad|u|\leq\frac{1}{32\sqrt{(1+\vartheta)B}}. \tag*{(4)} log E e u K ≤ u S + 512 e ϑ B u 2 , ∣ u ∣ ≤ 32 ( 1 + ϑ ) B 1 . (4)
Consequently, for every w ≥ 0 w\geq0 w ≥ 0 ,
Pr { ∣ K − S ∣ > w } ≤ min { 1 , 2 e e / 2 exp ( − w 32 ( 1 + ϑ ) B ) } . (5) \Pr\{|K-S|>w\}\leq\min\left\{1,2e^{e/2}\exp\left(-\frac{w}{32\sqrt{(1+\vartheta)B}}\right)\right\}. \tag*{(5)} Pr { ∣ K − S ∣ > w } ≤ min { 1 , 2 e e /2 exp ( − 32 ( 1 + ϑ ) B w ) } . (5)
Proof. Put M ( u ) = ∑ j p j 1 − u M(u)=\sum_jp_j^{1-u} M ( u ) = ∑ j p j 1 − u and L ( u ) = log M ( u ) L(u)=\log M(u) L ( u ) = log M ( u ) . Let P P P be the support projection of ρ \rho ρ . On P H B P\mathcal{H}_B P H B define F = ρ − u / 2 F=\rho^{-u/2} F = ρ − u /2 , and extend F F F by the identity on the kernel of ρ \rho ρ . The normalized tilted vector and its marginal are
Θ = F Ψ M ( u ) , σ = Tr B c ∣ Θ ⟩ ⟨ Θ ∣ = ρ 1 − u M ( u ) , \Theta=\frac{F\Psi}{\sqrt{M(u)}},\qquad\sigma=\operatorname{Tr}_{B^c}|\Theta\rangle\langle\Theta|=\frac{\rho^{1-u}}{M(u)}, Θ = M ( u ) F Ψ , σ = Tr B c ∣Θ ⟩ ⟨ Θ∣ = M ( u ) ρ 1 − u ,
where the last power is zero on the kernel. Since F F F is invertible on the whole space,
F H F − 1 Θ = E 0 Θ . (6) FHF^{-1}\Theta=E_0\Theta. \tag*{(6)} F H F − 1 Θ = E 0 Θ. (6)
An interaction supported in B c B^c B c is unchanged by this conjugation. An interaction supported in B B B has unchanged expectation, because
Tr σ F h i F − 1 = Tr σ h i \operatorname{Tr}\sigma Fh_iF^{-1}=\operatorname{Tr}\sigma h_i Tr σ F h i F − 1 = Tr σ h i
by [ F , σ ] = 0 [F,\sigma]=0 [ F , σ ] = 0 and cyclicity. Thus only crossing interactions contribute to the excitation energy of Θ \Theta Θ . Fix such an interaction. For every complex z z z , use the support convention
σ z = P exp ( z log ( σ ∣ P H B ) ) P , f i ( z ) = ⟨ Θ , σ z h i σ − z Θ ⟩ . \sigma^z=P\exp\left(z\log(\sigma|_{P\mathcal{H}_B})\right)P,\qquad f_i(z)=\langle\Theta,\sigma^zh_i\sigma^{-z}\Theta\rangle. σ z = P exp ( z log ( σ ∣ P H B ) ) P , f i ( z ) = ⟨ Θ , σ z h i σ − z Θ ⟩ .
This is an entire scalar function. Although σ 0 = P \sigma^0=P σ 0 = P , the vector Θ \Theta Θ lies in its support, so f i ( 0 ) = ⟨ Θ , h i Θ ⟩ f_i(0)=\langle\Theta,h_i\Theta\rangle f i ( 0 ) = ⟨ Θ , h i Θ ⟩ . At
z u = − u 2 ( 1 − u ) z_u=-\frac{u}{2(1-u)} z u = − 2 ( 1 − u ) u
the two scalar normalization factors cancel, giving
f i ( z u ) = ⟨ Θ , F h i F − 1 Θ ⟩ . f_i(z_u)=\langle\Theta,Fh_iF^{-1}\Theta\rangle. f i ( z u ) = ⟨ Θ , F h i F − 1 Θ ⟩ .
Indeed, on the support, σ z u = M ( u ) − z u F \sigma^{z_u}=M(u)^{-z_u}F σ z u = M ( u ) − z u F and σ − z u = M ( u ) z u F − 1 \sigma^{-z_u}=M(u)^{z_u}F^{-1} σ − z u = M ( u ) z u F − 1 . The endpoint support projections in the expectation remove any matrix elements entering the kernel.
On the imaginary axis the powers are unitary on the support, and hence ∣ f i ( i y ) ∣ ≤ c 0 |f_i(iy)|\leq c_0 ∣ f i ( i y ) ∣ ≤ c 0 . Decompose h i h_i h i across the cut by matrix units on its portion in B B B :
h i = ∑ α = 1 N i c α ⊗ d α , N i ≤ d i 2 , ∥ c α ∥ ∥ d α ∥ ≤ c 0 . h_i=\sum_{\alpha=1}^{N_i}c_\alpha\otimes d_\alpha,\qquad N_i\leq d_i^2,\qquad\|c_\alpha\|\|d_\alpha\|\leq c_0. h i = α = 1 ∑ N i c α ⊗ d α , N i ≤ d i 2 , ∥ c α ∥∥ d α ∥ ≤ c 0 .
Here each factor acts as the identity outside the appropriate portion of D i D_i D i . If s j s_j s j are the positive Schmidt probabilities of Θ \Theta Θ , a product contributes terms with scalar coefficient s j 1 / 2 + z s k 1 / 2 − z s_j^{1/2+z}s_k^{1/2-z} s j 1/2 + z s k 1/2 − z . For ∣ ℜ z ∣ ≤ 1 / 4 |\Re z|\leq1/4 ∣ℜ z ∣ ≤ 1/4 ,
∣ s j 1 / 2 + z s k 1 / 2 − z ∣ ≤ s j + s k . \left|s_j^{1/2+z}s_k^{1/2-z}\right|\leq s_j+s_k. s j 1/2 + z s k 1/2 − z ≤ s j + s k .
Moreover, in the two Schmidt bases, Cauchy–Schwarz bounds every row and column sum of ∣ ( c α ) j k ( d α ) j k ∣ \lvert(c_\alpha)_{jk}(d_\alpha)_{jk}\rvert ∣( c α ) j k ( d α ) j k ∣ by ∥ c α ∥ ∥ d α ∥ \lVert c_\alpha\rVert\lVert d_\alpha\rVert ∥ c α ∥ ∥ d α ∥ . Compression to the Schmidt supports does not increase either norm. Summing first over a row or a column therefore gives
∣ f i ( z ) ∣ ≤ 2 c 0 d i 2 ( ∣ ℜ z ∣ ≤ 1 / 4 ) . \lvert f_i(z)\rvert\le2c_0d_i^2 \qquad(\lvert\Re z\rvert\le1/4). ∣ f i ( z )∣ ≤ 2 c 0 d i 2 (∣ ℜ z ∣ ≤ 1/4 ) .
These bounds are uniform in ℑ z \Im z ℑ z . Apply the three-lines theorem on each of the two strips between real parts 0 0 0 and ± 1 / 4 \pm1/4 ± 1/4 . Writing ℓ i = log ( e d i ) \ell_i=\log(ed_i) ℓ i = log ( e d i ) , we obtain
∣ f i ( z ) ∣ ≤ e c 0 ( ∣ ℜ z ∣ ≤ δ i : = 1 8 ℓ i ) . (7) \lvert f_i(z)\rvert\le ec_0 \qquad\left(\lvert\Re z\rvert\le\delta_i:=\frac{1}{8\ell_i}\right). \tag*{(7)} ∣ f i ( z )∣ ≤ e c 0 ( ∣ ℜ z ∣ ≤ δ i := 8 ℓ i 1 ) . (7)
because log ( 2 d i 2 ) ≤ 2 ℓ i \log(2d_i^2)\le2\ell_i log ( 2 d i 2 ) ≤ 2 ℓ i . The case c 0 = 0 c_0=0 c 0 = 0 is immediate; otherwise this application may be made to f i / c 0 f_i/c_0 f i / c 0 .
Hermiticity gives f i ( − z ‾ ) = f i ( z ) ‾ f_i(-\overline{z})=\overline{f_i(z)} f i ( − z ) = f i ( z ) . The even Taylor coefficients at zero are therefore real, and the odd coefficients are purely imaginary. Cauchy’s coefficient estimate on the disk of radius δ i \delta_i δ i , followed by summation of the even terms, yields, for real ∣ x ∣ ≤ δ i / 2 \lvert x\rvert\le\delta_i/2 ∣ x ∣ ≤ δ i /2 ,
∣ ℜ ( f i ( x ) − f i ( 0 ) ) ∣ ≤ 2 e c 0 x 2 δ i − 2 = 128 e c 0 ℓ i 2 x 2 . (8) \lvert\Re(f_i(x)-f_i(0))\rvert\le2ec_0x^2\delta_i^{-2}=128ec_0\ell_i^2x^2. \tag*{(8)} ∣ ℜ ( f i ( x ) − f i ( 0 ))∣ ≤ 2 e c 0 x 2 δ i − 2 = 128 e c 0 ℓ i 2 x 2 . (8)
In particular, it is the real linear term that vanishes; we do not assert that f i ′ ( 0 ) = 0 f_i'(0)=0 f i ′ ( 0 ) = 0 .
For u u u in the interval of the lemma, ∣ u ∣ ≤ 1 / 32 \lvert u\rvert\le1/32 ∣ u ∣ ≤ 1/32 and ∣ z u ∣ ≤ ∣ u ∣ \lvert z_u\rvert\le\lvert u\rvert ∣ z u ∣ ≤ ∣ u ∣ . Since ℓ i ≤ B \ell_i\le\sqrt{B} ℓ i ≤ B , the estimate (8) applies to every crossing interaction. Using (6) and (3.4) , we conclude that
0 ≤ ⟨ Θ , ( H − E 0 ) Θ ⟩ ≤ 128 e c 0 B u 2 . (9) 0\le\langle\Theta,(H-E_0)\Theta\rangle\le128ec_0Bu^2. \tag*{(9)} 0 ≤ ⟨ Θ , ( H − E 0 ) Θ ⟩ ≤ 128 e c 0 B u 2 . (9)
The full-system gap inequality H − E 0 ≥ g 0 ( id − ∣ Ψ ⟩ ⟨ Ψ ∣ ) H-E_0\ge g_0(\operatorname{id}-\lvert\Psi\rangle\langle\Psi\rvert) H − E 0 ≥ g 0 ( id − ∣ Ψ ⟩ ⟨ Ψ ∣) now gives
M ( u / 2 ) 2 M ( u ) = ∣ ⟨ Ψ , Θ ⟩ ∣ 2 ≥ 1 − 128 e ϑ B u 2 . \frac{M(u/2)^2}{M(u)}=\lvert\langle\Psi,\Theta\rangle\rvert^2\ge1-128e^{\vartheta}Bu^2. M ( u ) M ( u /2 ) 2 = ∣⟨ Ψ , Θ ⟩ ∣ 2 ≥ 1 − 128 e ϑ B u 2 .
The last subtracted quantity is at most e ϑ / [ 8 ( 1 + ϑ ) ] < 1 / 2 e^{\vartheta}/[8(1+\vartheta)]<1/2 e ϑ / [ 8 ( 1 + ϑ )] < 1/2 . Taking logarithms and using − log ( 1 − v ) ≤ 2 v -\log(1-v)\le2v − log ( 1 − v ) ≤ 2 v for 0 ≤ v ≤ 1 / 2 0\le v\le1/2 0 ≤ v ≤ 1/2 gives
L ( u ) ≤ 2 L ( u / 2 ) + 256 e ϑ B u 2 . L(u)\le2L(u/2)+256e^{\vartheta}Bu^2. L ( u ) ≤ 2 L ( u /2 ) + 256 e ϑ B u 2 .
Iterate this inequality. Every successive halving remains in the permitted interval, for either sign of u u u , and 2 j L ( u / 2 j ) → u S 2^jL(u/2^j)\to uS 2 j L ( u / 2 j ) → u S because L ( 0 ) = 0 L(0)=0 L ( 0 ) = 0 and L ′ ( 0 ) = S L'(0)=S L ′ ( 0 ) = S . The sum of the remaining geometric series is at most two, proving (4) . Finally apply the exponential Markov inequality with u = ± [ 32 ( 1 + ϑ ) B ] − 1 u=\pm[32\sqrt{(1+\vartheta)B}]^{-1} u = ± [ 32 ( 1 + ϑ ) B ] − 1 . The quadratic term in (4) is at most e / 2 e/2 e /2 . Adding the two one-sided estimates proves (5) .
For the finite-range lattice Hamiltonians of this paper, the interaction budget and support-size bounds of Section 2 imply
B ≤ C ( 1 + ∣ ∂ Λ B ∣ ) . (10) \mathcal{B}\le C(1+\lvert\partial_\Lambda B\rvert). \tag*{(10)} B ≤ C ( 1 + ∣ ∂ Λ B ∣) . (10)
Thus, for every n ≥ 1 n\ge1 n ≥ 1 and fixed M > 0 M>0 M > 0 , the negative logarithms of the positive eigenvalues of a marginal at a cut with b ′ b' b ′ edges lie within C M 1 + b ′ log ( n + 2 ) C_M\sqrt{1+b'}\log(n+2) C M 1 + b ′ log ( n + 2 ) of its entropy except for probability at most ( n + 2 ) − M (n+2)^{-M} ( n + 2 ) − M . All constants in this specialization depend only on q q q , R R R , J J J , Δ \Delta Δ and, for C M C_M C M , on M M M .
This concentration estimate controls fluctuations around the entropy, but does not yet bound that center. The next argument compares two estimates for the same norm to obtain a conditional-entropy discount, from which the rectangle bound will follow.
An entropy discount from a buffer
Fix the set A ⊆ Λ A \subseteq\Lambda A ⊆ Λ whose entropy will ultimately be bounded, and let Z Z Z be the set of endpoints of its crossing edges. For an integer rectangle Q Q Q —a product of two finite nonempty integer intervals—its size is the larger number of sites along an axis. Fix D 0 > 2 R + 10 D_0 > 2R + 10 D 0 > 2 R + 10 . We call Q Q Q safe if
dist ∞ ( Q , Z ) > D 0 size ( Q ) , \operatorname{dist}_{\infty}(Q,Z) > D_0\operatorname{size}(Q), dist ∞ ( Q , Z ) > D 0 size ( Q ) ,
with distance to the empty set taken to be infinite. For an integer d ≥ 0 d \ge0 d ≥ 0 write
Q + d = Q + ( [ − d , d ] 2 ∩ Z 2 ) . Q^{+d} = Q + \left([-d,d]^2 \cap\mathbb{Z}^2\right). Q + d = Q + ( [ − d , d ] 2 ∩ Z 2 ) .
These are ambient rectangles; all physical regions below are their intersections with A A A . In particular, their use does not change the graph-distance locality of the Hamiltonian. For a unit vector ξ \xi ξ , we write ρ ξ , D \rho_{\xi,D} ρ ξ , D for its marginal on D D D and S ξ ( D ) S_{\xi}(D) S ξ ( D ) for that marginal’s entropy.
Lemma 3.2 (Conditional entropy in a buffered rectangle). There are integers C p a d ≥ 1 C_{\mathrm{pad}} \ge1 C pad ≥ 1 and a constant C b u f C_{\mathrm{buf}} C buf , depending only on q q q , R R R , J J J , Δ \Delta Δ , with the following property. Let Q Q Q be safe, let r ≥ 1 r \ge1 r ≥ 1 be an integer, and let Q 0 Q_0 Q 0 be an integer rectangle of size at most r r r such that Q 0 + C p a d r ⊆ Q Q_0^{+C_{\mathrm{pad}}r} \subseteq Q Q 0 + C pad r ⊆ Q . Set
X = A ∩ Q 0 , T = ( A ∩ Q 0 + C p a d r ) ∖ X . X = A \cap Q_0,\qquad T = \left(A \cap Q_0^{+C_{\mathrm{pad}}r}\right) \setminus X. X = A ∩ Q 0 , T = ( A ∩ Q 0 + C pad r ) ∖ X .
Then, in the original ground state Ω \Omega Ω ,
S ( X ∣ T ) ≤ 1 2 S ( X ) + C b u f r . (11) S(X\mid T) \le\frac{1}{2}S(X) + C_{\mathrm{buf}}r. \tag*{(11)} S ( X ∣ T ) ≤ 2 1 S ( X ) + C buf r . (11)
Proof. If X X X is empty, the conclusion is immediate. Suppose henceforth that X ≠ ∅ X \ne\varnothing X = ∅ . We will compare two estimates for the largest norm obtained by applying positive filters on nested regions around X X X . The filters need not commute. Stationarity and the gap give a comparison involving the entropies of those regions. For the opposite comparison, we pin a Schmidt vector of X X X and then average over its index. This removes X X X from each region and contributes a single entropy cost S ( X ) S(X) S ( X ) . The difference of the two comparisons will therefore control a weighted sum of conditional entropies of X X X .
Choose an integer D > 2 R + 2 D > 2R + 2 D > 2 R + 2 . Temporarily leave the integer C p a d > D + 1 C_{\mathrm{pad}} > D + 1 C pad > D + 1 variable, and put
m = ⌊ ( C p a d − 1 ) r D ⌋ , d j = r + j D , X j = A ∩ Q 0 + d j ( 1 ≤ j ≤ m ) , X 0 = X . m = \left\lfloor\frac{(C_{\mathrm{pad}}-1)r}{D} \right\rfloor,\qquad d_j = r + jD,\qquad X_j = A \cap Q_0^{+d_j}\quad(1 \le j \le m),\qquad X_0 = X. m = ⌊ D ( C pad − 1 ) r ⌋ , d j = r + j D , X j = A ∩ Q 0 + d j ( 1 ≤ j ≤ m ) , X 0 = X .
All these rectangles lie in the safe parent Q Q Q . Any interaction meeting an X j X_j X j lies wholly in A A A : otherwise a graph path of length at most R R R from a support site in X j X_j X j to a support site of the opposite color would contain a point of Z Z Z within ambient distance R R R of Q Q Q . This contradicts safety. The same observation rules out any nearest-neighbor color-crossing edge incident with X j X_j X j . Consequently the edge boundary of X j X_j X j has at most 4 ( r + 2 d j ) 4(r+2d_j) 4 ( r + 2 d j ) edges, all crossing the ambient rectangle’s perimeter. Missing sites in Λ \Lambda Λ only reduce this count.
Every designated interaction support splits at most one of the cuts X j ∣ X j c X_j \mid X_j^c X j ∣ X j c . More precisely, a support split by X j X_j X j is disjoint from every X i X_i X i with i < j i<j i < j and contained in every X i X_i X i with i > j i>j i > j . Indeed, successive rectangles have an ambient margin D > R D>R D > R , whereas the ambient diameter of the support is at most its graph diameter R R R . A term that does not split a contour is either contained in it or disjoint from it. The support budget and (10) therefore give, with constants independent of C p a d C_{\mathrm{pad}} C pad ,
# { interactions split by X j } ≤ C ( r + d j ) , B j ≤ C ( r + d j ) , (12) \#\{\text{interactions split by }X_j\} \le C(r+d_j),\qquad B_j \le C(r+d_j), \tag*{(12)} # { interactions split by X j } ≤ C ( r + d j ) , B j ≤ C ( r + d j ) , (12)
where B j B_j B j is the parameter in Lemma 3.1 for the marginal on X j X_j X j .
Assign a positive weight a j a_j a j to each contour. The energy estimate below charges contour j j j by a constant times ( r + d j ) a j 2 (r+d_j)a_j^2 ( r + d j ) a j 2 . We choose weights of total mass two: in the eventual conditional-entropy comparison this will give the factor two needed for (11) . At this fixed mass, Cauchy–Schwarz gives
4 = ( ∑ j a j ) 2 ≤ ( ∑ j ( r + d j ) a j 2 ) ( ∑ j 1 r + d j ) . 4=\left(\sum_j a_j\right)^2\leq\left(\sum_j(r+d_j)a_j^2\right)\left(\sum_j\frac{1}{r+d_j}\right). 4 = ( j ∑ a j ) 2 ≤ ( j ∑ ( r + d j ) a j 2 ) ( j ∑ r + d j 1 ) .
Equality holds for weights proportional to 1 / ( r + d j ) 1/(r+d_j) 1/ ( r + d j ) . Accordingly, put
Z r = ∑ j = 1 m 1 r + d j , a j = 2 Z r ( r + d j ) , E = ∑ j = 1 m ( r + d j ) a j 2 = 4 Z r . (13) Z_r=\sum_{j=1}^{m}\frac{1}{r+d_j},\qquad a_j=\frac{2}{Z_r(r+d_j)},\qquad\mathcal{E}=\sum_{j=1}^{m}(r+d_j)a_j^2=\frac{4}{Z_r}. \tag*{(13)} Z r = j = 1 ∑ m r + d j 1 , a j = Z r ( r + d j ) 2 , E = j = 1 ∑ m ( r + d j ) a j 2 = Z r 4 . (13)
Their sum is two, and their quadratic cost attains this lower bound. Integral comparison gives the uniform lower bound
Z r ≥ 1 D log C p a d + 1 2 + D . (14) Z_r\geq\frac{1}{D}\log\frac{C_{\mathrm{pad}}+1}{2+D}. \tag*{(14)} Z r ≥ D 1 log 2 + D C pad + 1 . (14)
For example, compare the sum with the integral of ( 2 r + D x ) − 1 (2r+Dx)^{-1} ( 2 r + D x ) − 1 over 1 ≤ x ≤ m + 1 1\leq x\leq m+1 1 ≤ x ≤ m + 1 , use 2 r + D ( m + 1 ) > ( C p a d + 1 ) r 2r+D(m+1)>(C_{\mathrm{pad}}+1)r 2 r + D ( m + 1 ) > ( C pad + 1 ) r , and use r ≥ 1 r\geq1 r ≥ 1 in the denominator. Thus we may make E \mathcal{E} E as small as needed, uniformly in r r r . We take C p a d C_{\mathrm{pad}} C pad large enough that a j ≤ 1 / 2 a_j\leq1/2 a j ≤ 1/2 for all j j j . We shall increase it once more after the energy estimate below; all constants up to that choice are independent of C p a d C_{\mathrm{pad}} C pad .
Stationarity of the optimized filters. Fix a sufficiently small ϵ > 0 \epsilon>0 ϵ > 0 , and maximize
N = ∥ L m ⋯ L 1 Ω ∥ N=\lVert L_m\cdots L_1\Omega\rVert N = ∥ L m ⋯ L 1 Ω ∥
over positive operators L j L_j L j on X j X_j X j satisfying
L j ≥ ϵ i d , Tr L j 2 / a j = 1. (15) L_j\geq\epsilon\,\mathrm{id},\qquad\operatorname{Tr}L_j^{2/a_j}=1. \tag*{(15)} L j ≥ ϵ id , Tr L j 2/ a j = 1. (15)
The trace is over H X j \mathcal{H}_{X_j} H X j . Choose ϵ \epsilon ϵ so small that ( dim H X j ) ϵ 2 / a j < 1 (\dim\mathcal{H}_{X_j})\epsilon^{2/a_j}<1 ( dim H X j ) ϵ 2/ a j < 1 for every j j j . The feasible sets are nonempty and compact. A maximum exists and is positive, since every feasible product is invertible. At an optimum write
K = L m ⋯ L 1 , ϕ = K Ω / N . K=L_m\cdots L_1,\qquad\phi=K\Omega/N. K = L m ⋯ L 1 , ϕ = K Ω/ N .
We claim that
[ L j , ρ ϕ , X j ] = 0 ( 1 ≤ j ≤ m ) . (16) [L_j,\rho_{\phi,X_j}]=0\qquad(1\leq j\leq m). \tag*{(16)} [ L j , ρ ϕ , X j ] = 0 ( 1 ≤ j ≤ m ) . (16)
Prove this in descending order. For an anti-Hermitian operator B B B on X j X_j X j , vary L j L_j L j to e t B L j e − t B e^{tB}L_je^{-tB} e tB L j e − tB . This preserves both constraints in (15) . With K > j = L m ⋯ L j + 1 K_{>j}=L_m\cdots L_{j+1} K > j = L m ⋯ L j + 1 , the derivative of the logarithmic norm is
ℜ ⟨ ϕ , K > j ( B − L j B L j − 1 ) K > j − 1 ϕ ⟩ . \Re\langle\phi,K_{>j}(B-L_jBL_j^{-1})K_{>j}^{-1}\phi\rangle. ℜ ⟨ ϕ , K > j ( B − L j B L j − 1 ) K > j − 1 ϕ ⟩ .
Assume that (16) is already known for indices greater than j j j . In this expectation the outer factor L m L_m L m can be removed by cyclicity of the trace on X m X_m X m , because its marginal commutes with L m L_m L m and the operator inside is supported on X m X_m X m . Repeat this argument down to L j + 1 L_{j+1} L j + 1 . Stationarity, together with the fact that the expectation of B B B is purely imaginary, gives
ℜ Tr ( L j − 1 ρ ϕ , X j L j B ) = 0 \Re\operatorname{Tr}(L_j^{-1}\rho_{\phi,X_j}L_jB)=0 ℜ Tr ( L j − 1 ρ ϕ , X j L j B ) = 0
for every anti-Hermitian $B. The matrix L j − 1 ρ ϕ , X j L j L_j^{-1}\rho_{\phi,X_j}L_j L j − 1 ρ ϕ , X j L j is therefore Hermitian. The equality to its adjoint, multiplied on both sides by L j L_j L j , shows that ρ ϕ , X j \rho_{\phi,X_j} ρ ϕ , X j commutes with L j 2 L_j^2 L j 2 , hence with L j L_j L j . This proves the induction. Only expectations have been simplified; no commutation between distinct filters is asserted.
In a common eigenbasis let l i l_i l i be the eigenvalues of L j L_j L j , let p i p_i p i be those of ρ ϕ , X j \rho_{\phi,X_j} ρ ϕ , X j , and set x i = l i 2 / a j x_i=l_i^{2/a_j} x i = l i 2/ a j . A diagonal variation and the same descending trace argument give
d log N = a j 2 ∑ i p i d x i x i , ∑ i x i = 1 , x i ≥ ε 2 / a j . d\log N=\frac{a_j}{2}\sum_i p_i\frac{dx_i}{x_i},\qquad\sum_i x_i=1,\qquad x_i\geq\varepsilon^{2/a_j}. d log N = 2 a j i ∑ p i x i d x i , i ∑ x i = 1 , x i ≥ ε 2/ a j .
The ratios p i / x i p_i/x_i p i / x i are equal to a common value λ \lambda λ on free coordinates and are at most λ \lambda λ on coordinates at the floor. There is a free coordinate by strict dimensional slack. Moreover λ > 0 \lambda>0 λ > 0 : if all free coordinates had zero probability, transfer from one of them to a positive-probability floored coordinate would increase the norm. Consequently
x i = max { ε 2 / a j , p i / λ } , ∣ log l i l k ∣ ≤ a j 2 ∣ log p i p k ∣ ( p i , p k > 0 ) . (17) x_i=\max\{\varepsilon^{2/a_j},p_i/\lambda\},\qquad\left|\log\frac{l_i}{l_k}\right|\leq\frac{a_j}{2}\left|\log\frac{p_i}{p_k}\right|\qquad(p_i,p_k>0). \tag*{(17)} x i = max { ε 2/ a j , p i / λ } , log l k l i ≤ 2 a j log p k p i ( p i , p k > 0 ) . (17)
The last inequality follows because taking a maximum with a common positive floor contracts differences of logarithms.
The optimized vector has small excitation energy. We have the exact identity K H K − 1 ϕ = E 0 ϕ KHK^{-1}\phi=E_0\phi K H K − 1 ϕ = E 0 ϕ for the original full Hamiltonian. Consider one interaction in its expectation. All outer filters on regions containing its support can be removed by (16) and cyclicity, as above. All remaining inner filters whose regions are disjoint from its support commute with the interaction. The single-split property leaves at most one conjugation L j h i L j − 1 L_jh_iL_j^{-1} L j h i L j − 1 .
In Schmidt bases for X j ∣ X j c X_j\mid X_j^c X j ∣ X j c , Hermitian pairing replaces the real part of this conjugation by coefficients involving
p i p k ( cosh ( log l i l k ) − 1 ) . \sqrt{p_ip_k}\left(\cosh\left(\log\frac{l_i}{l_k}\right)-1\right). p i p k ( cosh ( log l k l i ) − 1 ) .
For positive p i , p k p_i,p_k p i , p k , (17) and a j ≤ 1 / 2 a_j\leq1/2 a j ≤ 1/2 bound this expression by C a j 2 ( p i + p k ) Ca_j^2(p_i+p_k) C a j 2 ( p i + p k ) . To verify the uniform constant, put z = 1 2 log ( p i / p k ) z=\frac{1}{2}\log(p_i/p_k) z = 2 1 log ( p i / p k ) and use
cosh ( a j z ) − 1 ≤ 1 2 a j 2 z 2 cosh ( a j z ) , sup z ∈ R z 2 cosh ( z / 2 ) cosh z < ∞ . \cosh(a_jz)-1\leq\frac{1}{2}a_j^2z^2\cosh(a_jz),\qquad\sup_{z\in\mathbb{R}}\frac{z^2\cosh(z/2)}{\cosh z}<\infty. cosh ( a j z ) − 1 ≤ 2 1 a j 2 z 2 cosh ( a j z ) , z ∈ R sup cosh z z 2 cosh ( z /2 ) < ∞.
Pairs containing a zero probability have zero coefficient. A finite-range interaction has a product decomposition across this cut with a uniformly bounded sum of norm products. The row and column Cauchy–Schwarz estimate used in Lemma 3.1 now bounds its contribution by C a j 2 Ca_j^2 C a j 2 . Summing (12) gives
0 ≤ ⟨ ϕ , ( H − E 0 ) ϕ ⟩ ≤ C ε . (18) 0\leq\langle\phi,(H-E_0)\phi\rangle\leq C\varepsilon. \tag*{(18)} 0 ≤ ⟨ ϕ , ( H − E 0 ) ϕ ⟩ ≤ C ε . (18)
The constant depends only on q q q , R R R , J J J , not on the number of filters or their supports’ dimensions.
The full-system gap converts (18) into 1 − ∣ ⟨ Ω , ϕ ⟩ ∣ 2 ≤ C ε / Δ 1-|\langle\Omega,\phi\rangle|^2\leq C\varepsilon/\Delta 1 − ∣ ⟨ Ω , ϕ ⟩ ∣ 2 ≤ C ε /Δ . Choose C p a d C_{\mathrm{pad}} C pad large enough that this is at most 1 / 4 1/4 1/4 . At the same time arrange that
a j 1 − a j ≤ 1 32 ( 1 + J / Δ ) B j for every j . (19) \frac{a_j}{1-a_j}\leq\frac{1}{32\sqrt{(1+J/\Delta)B_j}}\qquad\text{for every }j. \tag*{(19)} 1 − a j a j ≤ 32 ( 1 + J /Δ ) B j 1 for every j . (19)
Both choices are uniform in r r r : by (12) , the right side is bounded below by a parameter-dependent constant times ( r + d j ) − 1 / 2 (r+d_j)^{-1/2} ( r + d j ) − 1/2 , whereas the left side is at most 4 / [ Z r ( r + d j ) ] 4/[Z_r(r+d_j)] 4/ [ Z r ( r + d j )] . Equation (14) completes the choice of C p a d C_{\mathrm{pad}} C pad , which is now fixed.
The first norm comparison. Let N j N_j N j be the optimum for the prefix of filters 1 , … , j 1,\ldots,j 1 , … , j at the same floor, and set N 0 = 1 N_0=1 N 0 = 1 . The preceding stationarity and energy arguments apply separately to each prefix: its summed cost is at most E \mathcal{E} E . Thus, for a parameter-dependent constant C C C , its normalized output has overlap at least 1 − C E \sqrt{1-C\mathcal{E}} 1 − C E with Ω \Omega Ω , where C E ≤ 1 / 4 C\mathcal{E}\leq1/4 C E ≤ 1/4 . For an optimizing prefix, put K < j = L j − 1 ⋯ L 1 K_{<j}=L_{j-1}\cdots L_1 K < j = L j − 1 ⋯ L 1 . Cauchy–Schwarz gives
1 − C E N j ≤ ∣ ⟨ Ω , L j K < j Ω ⟩ ∣ = ∣ ⟨ L j Ω , K < j Ω ⟩ ∣ ≤ ∥ L j Ω ∥ N j − 1 . \sqrt{1-C\mathcal{E}}\,N_j\leq\lvert\langle\Omega,L_jK_{<j}\Omega\rangle\rvert=\lvert\langle L_j\Omega,K_{<j}\Omega\rangle\rvert
\leq\lVert L_j\Omega\rVert N_{j-1}. 1 − C E N j ≤ ∣⟨ Ω , L j K < j Ω ⟩∣ = ∣⟨ L j Ω , K < j Ω ⟩∣ ≤ ∥ L j Ω ∥ N j − 1 .
For any feasible L j L_j L j , Schatten Hölder gives
∥ L j Ω ∥ 2 = Tr ρ Ω , X j L j 2 ≤ ( Tr ρ Ω , X j 1 / ( 1 − a j ) ) 1 − a j . \lVert L_j\Omega\rVert^2=\operatorname{Tr}\rho_{\Omega,X_j}L_j^2\leq\left(\operatorname{Tr}\rho_{\Omega,X_j}^{1/(1-a_j)}\right)^{1-a_j}. ∥ L j Ω ∥ 2 = Tr ρ Ω , X j L j 2 ≤ ( Tr ρ Ω , X j 1/ ( 1 − a j ) ) 1 − a j .
Apply Lemma 3.1 with u = − a j / ( 1 − a j ) u=-a_j/(1-a_j) u = − a j / ( 1 − a j ) , permitted by (19) . We obtain
log ∥ L j Ω ∥ 2 ≤ − a j S ( X j ) + C ( r + d j ) a j 2 . \log\lVert L_j\Omega\rVert^2\leq-a_jS(X_j)+C(r+d_j)a_j^2. log ∥ L j Ω ∥ 2 ≤ − a j S ( X j ) + C ( r + d j ) a j 2 .
After summing logarithms over the prefixes and using log ( 1 − C E ) ≥ − C ′ E \log(1-C\mathcal{E})\geq-C'\mathcal{E} log ( 1 − C E ) ≥ − C ′ E , this gives
− 2 log N ≥ ∑ j = 1 m a j S ( X j ) − C ( m + 1 ) E . (20) -2\log N\geq\sum_{j=1}^{m}a_jS(X_j)-C(m+1)\mathcal{E}. \tag*{(20)} − 2 log N ≥ j = 1 ∑ m a j S ( X j ) − C ( m + 1 ) E . (20)
The constants in this estimate are independent of the floor.
The opposite comparison by Schmidt pinning. Let the floor decrease to zero at this fixed finite instance. The optima converge to the optimum over nonnegative filters with the same trace constraints. Indeed, these latter feasible sets are compact, and every feasible nonnegative operator is a limit of strictly positive, trace-normalized operators. Taking their minimal eigenvalues as admissible floors proves the assertion. We continue to denote the limiting optimum by N N N ; (20) remains valid.
Write the Schmidt decomposition at X X X as
Ω = ∑ i p i u i ⊗ w i , p i > 0. \Omega=\sum_i\sqrt{p_i}\,u_i\otimes w_i,\qquad p_i>0. Ω = i ∑ p i u i ⊗ w i , p i > 0.
and let T j = X j ∖ X T_j=X_j\setminus X T j = X j ∖ X . For a fixed index i i i use trial filters
L j = ∣ u i ⟩ ⟨ u i ∣ ⊗ M j , M j ≥ 0 on T j , Tr M j 2 / a j = 1. L_j=\lvert u_i\rangle\langle u_i\rvert\otimes M_j,\qquad M_j\geq0\text{ on }T_j,\qquad\operatorname{Tr}M_j^{2/a_j}=1. L j = ∣ u i ⟩ ⟨ u i ∣ ⊗ M j , M j ≥ 0 on T j , Tr M j 2/ a j = 1.
They are feasible in the zero-floor limit and give N ≥ p i N i N\geq\sqrt{p_i}\,N_i N ≥ p i N i , where
N i = sup ∥ M m ⋯ M 1 w i ∥ N_i=\sup\lVert M_m\cdots M_1w_i\rVert N i = sup ∥ M m ⋯ M 1 w i ∥
under the displayed constraints. We claim that
log N i ≥ − 1 2 ∑ j a j S w i ( T j ) . (21) \log N_i\geq-\frac{1}{2}\sum_j a_jS_{w_i}(T_j). \tag*{(21)} log N i ≥ − 2 1 j ∑ a j S w i ( T j ) . (21)
For fixed invertible choices M j M_j M j , consider F i ( z ) = M m z ⋯ M 1 z w i F_i(z)=M_m^z\cdots M_1^zw_i F i ( z ) = M m z ⋯ M 1 z w i on 0 ≤ ℜ z ≤ 1 0\leq\Re z\leq1 0 ≤ ℜ z ≤ 1 . It is bounded and analytic there. Its norm on the imaginary axis is one. On the other boundary, put U j = M j i y U_j=M_j^{iy} U j = M j i y and V j = U j ⋯ U 1 V_j=U_j\cdots U_1 V j = U j ⋯ U 1 , with V 0 = id V_0=\operatorname{id} V 0 = id . Moving these unitaries to the left gives the exact identity
M m 1 + i y ⋯ M 1 1 + i y = ( U m ⋯ U 1 ) ( V m − 1 ∗ M m V m − 1 ) ⋯ ( V 0 ∗ M 1 V 0 ) . M_m^{1+iy}\cdots M_1^{1+iy}=(U_m\cdots U_1)(V_{m-1}^{*}M_mV_{m-1})\cdots(V_0^{*}M_1V_0). M m 1 + i y ⋯ M 1 1 + i y = ( U m ⋯ U 1 ) ( V m − 1 ∗ M m V m − 1 ) ⋯ ( V 0 ∗ M 1 V 0 ) .
Each positive factor is conjugated only by unitaries supported on smaller nested regions. The remaining factors are therefore still positive, supported on their respective T j T_j T j , and have the same trace-power normalizations. The leftmost product of unitaries does not change the norm, so ∥ F i ( 1 + i y ) ∥ ≤ N i \lVert F_i(1+iy)\rVert\le N_i ∥ F i ( 1 + i y )∥ ≤ N i . The vector form of the three-lines theorem, obtained by testing against unit vectors and applying the scalar lemma [38 ] , gives log ∥ F i ( x ) ∥ ≤ x log N i \log\lVert F_i(x)\rVert\le x\log N_i log ∥ F i ( x )∥ ≤ x log N i for 0 ≤ x ≤ 1 0\le x\le1 0 ≤ x ≤ 1 . Differentiating from the right at zero yields
∑ j ⟨ w i , log M j w i ⟩ ≤ log N i . \sum_j \langle w_i,\log M_j w_i\rangle\le\log N_i. j ∑ ⟨ w i , log M j w i ⟩ ≤ log N i .
For 0 < δ < 1 0<\delta<1 0 < δ < 1 , take
M j = ( ( 1 − δ ) ρ w i , T j + δ dim H T j id ) a j / 2 . M_j=\left((1-\delta)\rho_{w_i,T_j}+\frac{\delta}{\dim\mathcal{H}_{T_j}}\operatorname{id}\right)^{a_j/2}. M j = ( ( 1 − δ ) ρ w i , T j + dim H T j δ id ) a j /2 .
These are strictly positive and satisfy Tr M j 2 / a j = 1 \operatorname{Tr}M_j^{2/a_j}=1 Tr M j 2/ a j = 1 . As δ ↓ 0 \delta\downarrow0 δ ↓ 0 , their expectations of log M j \log M_j log M j tend to − a j S w i ( T j ) / 2 -a_jS_{w_i}(T_j)/2 − a j S w i ( T j ) /2 , since the marginal gives zero weight to its kernel. This proves (21) .
For each Schmidt index the trial norm now gives
− 2 log N ≤ − log p i + ∑ j a j S w i ( T j ) . -2\log N\le-\log p_i+\sum_j a_jS_{w_i}(T_j). − 2 log N ≤ − log p i + j ∑ a j S w i ( T j ) .
Average with probabilities p i p_i p i and use concavity of each T j T_j T j entropy. Their averaged states are the original marginals, so
− 2 log N ≤ S ( X ) + ∑ j a j S ( T j ) . -2\log N\le S(X)+\sum_j a_jS(T_j). − 2 log N ≤ S ( X ) + j ∑ a j S ( T j ) .
The two norm estimates have now served their purpose. Combining (20) and (3.20) gives
∑ j a j S ( X ∣ T j ) ≤ S ( X ) + C ( m + 1 ) ε . \sum_j a_jS(X\mid T_j)\le S(X)+C(m+1)\varepsilon. j ∑ a j S ( X ∣ T j ) ≤ S ( X ) + C ( m + 1 ) ε .
Since the T j T_j T j are nested and ∑ j a j = 2 \sum_j a_j=2 ∑ j a j = 2 , strong subadditivity bounds the left side below by 2 S ( X ∣ T m ) 2S(X\mid T_m) 2 S ( X ∣ T m ) . Finally T m ⊆ T T_m\subseteq T T m ⊆ T , so conditioning further decreases the conditional entropy. Because m ≤ C p a d r / D m\le C_{\mathrm{pad}}r/D m ≤ C pad r / D and all parameters have now been fixed, the resulting error is at most C b u f r C_{\mathrm{buf}}r C buf r . This proves (11) . □
The first subvolume exponent
For an integer r ≥ 1 r\ge1 r ≥ 1 , let F b o x ( r ) F_{\mathrm{box}}(r) F box ( r ) be the supremum of S Ω ( A ∩ Q ) S_{\Omega}(A\cap Q) S Ω ( A ∩ Q ) over all admissible Hamiltonians and cuts with fixed q q q , R R R , J J J , Δ \Delta Δ , and all safe integer rectangles Q Q Q of size at most r r r . This is a finite, nondecreasing function, since F b o x ( r ) ≤ r 2 log q F_{\mathrm{box}}(r)\le r^2\log q F box ( r ) ≤ r 2 log q .
Proposition 3.3 (Initial safe-box estimate). There are constants C < ∞ C<\infty C < ∞ and e 0 ∈ ( 0 , 1 ) e_0\in(0,1) e 0 ∈ ( 0 , 1 ) , depending only on q q q , R R R , J J J , Δ \Delta Δ , such that
F b o x ( r ) ≤ C r 1 + e 0 ( r ≥ 1 ) . F_{\mathrm{box}}(r)\le Cr^{1+e_0}\qquad(r\ge1). F box ( r ) ≤ C r 1 + e 0 ( r ≥ 1 ) .
Proof. Choose an integer M M M below, and consider a safe parent rectangle of size at most M r Mr M r . If its size is at most r r r , its entropy is already bounded by F b o x ( r ) F_{\mathrm{box}}(r) F box ( r ) . Otherwise partition each axis into chunks of r r r sites and, if needed, one final shorter chunk. Their Cartesian products give at most M 2 M^2 M 2 children Q i Q_i Q i , each safe and of size at most r r r . Put X i = A ∩ Q i X_i=A\cap Q_i X i = A ∩ Q i .
Call a child interior if its C p a d r C_{\mathrm{pad}}r C pad r padding lies in the parent. There are at most
B M = 4 ( C p a d + 2 ) M B_M=4(C_{\mathrm{pad}}+2)M B M = 4 ( C pad + 2 ) M
noninterior children: in either coordinate only the first or last C p a d + 2 C_{\mathrm{pad}} + 2 C pad + 2 chunk positions can violate this containment. This estimate remains valid when the parent is thin and all of its children are noninterior.
For an interior child its padded rectangle meets at most ( 2 C p a d + 5 ) 2 − 1 (2C_{\mathrm{pad}} + 5)^2 - 1 ( 2 C pad + 5 ) 2 − 1 other children. Order all children by a uniform random permutation. The probability that this child comes after every one of those other children is at least
p 0 = ( 2 C p a d + 5 ) − 2 > 0. p_0 = (2C_{\mathrm{pad}} + 5)^{-2} > 0. p 0 = ( 2 C pad + 5 ) − 2 > 0.
On that event, its preceding physical sites contain the entire buffer in Lemma 3.2. The corresponding term of the entropy chain rule is therefore at most S ( X i ) / 2 + C b u f r S(X_i)/2 + C_{\mathrm{buf}}r S ( X i ) /2 + C buf r . In all other cases it is at most S ( X i ) S(X_i) S ( X i ) . The latter bound also holds for noninterior children. Taking the expected entropy chain rule consequently gives
F b o x ( M r ) ≤ [ ( 1 − p 0 / 2 ) M 2 + ( p 0 / 2 ) B M ] F b o x ( r ) + C M 2 r . (22) F_{\mathrm{box}}(Mr) \le\left[(1-p_0/2)M^2 + (p_0/2)B_M\right] F_{\mathrm{box}}(r) + CM^2r. \tag*{(22)} F box ( M r ) ≤ [ ( 1 − p 0 /2 ) M 2 + ( p 0 /2 ) B M ] F box ( r ) + C M 2 r . (22)
For completeness, the probability of the buffer event may vary among children. Its lower bound p 0 p_0 p 0 controls the negative term − p 0 S ( X i ) / 2 -p_0S(X_i)/2 − p 0 S ( X i ) /2 , since S ( X i ) ≥ 0 S(X_i) \ge0 S ( X i ) ≥ 0 ; its positive error can always be bounded by C b u f r C_{\mathrm{buf}}r C buf r . Thus the displayed common bound holds without assuming equal event probabilities. Parents of size at most r r r satisfy the same inequality once its coefficient is at least one.
Choose M ≥ 16 ( C p a d + 2 ) M \ge16(C_{\mathrm{pad}} + 2) M ≥ 16 ( C pad + 2 ) and M ≥ 2 M \ge2 M ≥ 2 . Then the coefficient in (22) is at most
λ = ( 1 − p 0 / 4 ) M 2 , M < λ < M 2 . \lambda= (1-p_0/4)M^2,\qquad M < \lambda< M^2. λ = ( 1 − p 0 /4 ) M 2 , M < λ < M 2 .
Iterate the recursion at r = 1 , M , M 2 , … r = 1, M, M^2, \ldots r = 1 , M , M 2 , … The inhomogeneous terms are bounded by a geometric series with ratio M / λ < 1 M/\lambda< 1 M / λ < 1 , yielding F b o x ( M j ) ≤ C λ j F_{\mathrm{box}}(M^j) \le C\lambda^j F box ( M j ) ≤ C λ j for all j ≥ 0 j \ge0 j ≥ 0 . Set
1 + e 0 = log M λ = 2 + log ( 1 − p 0 / 4 ) log M ∈ ( 1 , 2 ) . 1 + e_0 = \log_M \lambda= 2 + \frac{\log(1-p_0/4)}{\log M} \in(1,2). 1 + e 0 = log M λ = 2 + log M log ( 1 − p 0 /4 ) ∈ ( 1 , 2 ) .
For a general r ≥ 1 r \ge1 r ≥ 1 , comparison with the next power of M M M and monotonicity of F b o x F_{\mathrm{box}} F box prove (3.21) after a fixed change of constant.
The estimate just proved is uniform over induced domains, including those with holes or disconnected components. Its only energy comparison was with the original full Hamiltonian. In particular, we have not required a gap for any Hamiltonian obtained by restricting to a rectangle. The following sections will improve the exponent e 0 e_0 e 0 and then replace the box estimate by a bound on mutual information across a collar.
Positive constraints and truncation near a finite set
The global gap of H H H will be used through positive operators that annihilate its ground vector separately, retain a gap when summed, and have rapidly decaying graph-local tails. These exact constraints supply the contraction products in Section 10. For the transport and scanner arguments in Sections 7 and 9, we also truncate near a prescribed finite set S 0 S_0 S 0 . The terms crossing cuts inside S 0 S_0 S 0 then have controlled graph-ball supports, while the total truncation error depends on ∣ S 0 ∣ |S_0| ∣ S 0 ∣ rather than the surrounding volume. Both constructions use only the gap of the full Hamiltonian.
Write H = ∑ i ∈ Λ h i H = \sum_{i\in\Lambda} h_i H = ∑ i ∈ Λ h i , where i i i indexes the distinct nonempty designated supports X i X_i X i from Section 2, and choose an anchor a i ∈ X i a_i \in X_i a i ∈ X i . Thus diam d Λ X i ≤ R \operatorname{diam}_{d_\Lambda} X_i \le R diam d Λ X i ≤ R and ∥ h i ∥ ≤ J \lVert h_i\rVert\le J ∥ h i ∥ ≤ J . We use $N_l(a) = {x \in \Lambda : d Λ ( a , x ) ≤ l d_{\Lambda}(a,x)\le l d Λ ( a , x ) ≤ l for the graph ball, with integer l ≥ 0 l\ge0 l ≥ 0 . The normalized conditional expectation onto this ball is the map
E i , l ( B ) = q − ∣ Λ ∖ N l ( a i ) ∣ Tr Λ ∖ N l ( a i ) ( B ) ⊗ I Λ ∖ N l ( a i ) . (23) E_{i,l}(B)=q^{-|\Lambda\setminus N_l(a_i)|}\operatorname{Tr}_{\Lambda\setminus N_l(a_i)}(B)\otimes I_{\Lambda\setminus N_l(a_i)}. \tag*{(23)} E i , l ( B ) = q − ∣Λ ∖ N l ( a i ) ∣ Tr Λ ∖ N l ( a i ) ( B ) ⊗ I Λ ∖ N l ( a i ) . (23)
Tensor factors in this formula are placed at their original sites. Equivalently, E i , l E_{i,l} E i , l averages conjugation by independent on-site unitaries outside the ball. It is positive, unital, contractive in operator norm, and fixes every operator supported in the ball.
The counting bounds from Section 2 give at most v R v_R v R sites in each original support, at most μ R \mu_R μ R supports containing a specified site, and at most μ R \mu_R μ R labels with any specified anchor. In particular,
sup x ∈ Λ ∑ i : x ∈ X i ∥ h i ∥ ≤ b 0 : = J μ R , ∣ X i ∣ ≤ v R . \sup_{x\in\Lambda}\sum_{i:x\in X_i}\|h_i\|\le b_0:=J\mu_R,\qquad|X_i|\le v_R. x ∈ Λ sup i : x ∈ X i ∑ ∥ h i ∥ ≤ b 0 := J μ R , ∣ X i ∣ ≤ v R .
All constants in this section are independent of Λ \Lambda Λ ; they may depend on q q q , R R R , J J J , Δ \Delta Δ , and on explicitly fixed exponents or size bounds.
Propagation in graph distance and a smooth spectral filter
We first record the dynamical estimate needed to localize a spectral filter. This also makes clear why holes and separate connected components cause no change in the constants. Starting from the Lieb–Robinson propagation framework [26 ] , we use the finite-volume argument of Nachtergaele, Ogata, and Sims [29 ] , giving the commutator iteration here in the graph metric of Λ \Lambda Λ .
Lemma 4.1 (Graph-distance propagation). Let τ t ( B ) = e i t H B e − i t H \tau_t(B)=e^{itH}Be^{-itH} τ t ( B ) = e i t H B e − i t H . There are positive constants C C C , v v v , c c c such that, for every original support X i X_i X i , every operator A A A supported in X i X_i X i , every site y y y , and every on-site operator B y B_y B y ,
∥ [ τ t ( A ) , B y ] ∥ ≤ C ∥ A ∥ ∥ B y ∥ e v ∣ t ∣ − c d Λ ( a i , y ) . (24) \|[\tau_t(A),B_y]\|\le C\|A\|\|B_y\|e^{v|t|-cd_{\Lambda}(a_i,y)}. \tag*{(24)} ∥ [ τ t ( A ) , B y ] ∥ ≤ C ∥ A ∥∥ B y ∥ e v ∣ t ∣ − c d Λ ( a i , y ) . (24)
The commutator is zero when d Λ ( a i , y ) = ∞ d_{\Lambda}(a_i,y)=\infty d Λ ( a i , y ) = ∞ . Moreover,
∥ τ t ( A ) − E i , l ( τ t ( A ) ) ∥ ≤ ∥ A ∥ min { 2 , C e v ∣ t ∣ − c l } . \|\tau_t(A)-E_{i,l}(\tau_t(A))\|\le\|A\|\min\{2,Ce^{v|t|-cl}\}. ∥ τ t ( A ) − E i , l ( τ t ( A )) ∥ ≤ ∥ A ∥ min { 2 , C e v ∣ t ∣ − c l } .
Proof. Fix B y B_y B y and define
F ( X , t ) = sup supp A ⊆ X ∥ A ∥ ≤ 1 ∥ [ τ t ( A ) , B y ] ∥ . F(X,t)=\sup_{\substack{\operatorname{supp} A\subseteq X\\ \|A\|\le1}}\|[\tau_t(A),B_y]\|. F ( X , t ) = supp A ⊆ X ∥ A ∥ ≤ 1 sup ∥ [ τ t ( A ) , B y ] ∥.
For t ≥ 0 t\ge0 t ≥ 0 , fix one such A A A , put f ( t ) = [ τ t ( A ) , B y ] f(t)=[\tau_t(A),B_y] f ( t ) = [ τ t ( A ) , B y ] , and let Q X ( t ) = ∑ j : X j ∩ X ≠ ∅ τ t ( h j ) Q_X(t)=\sum_{j:X_j\cap X\ne\varnothing}\tau_t(h_j) Q X ( t ) = ∑ j : X j ∩ X = ∅ τ t ( h j ) . Since the terms disjoint from X X X commute with A A A , differentiating and using the Jacobi identity gives the exact equation
f ′ ( t ) = i [ Q X ( t ) , f ( t ) ] − i ∑ j : X j ∩ X ≠ ∅ [ τ t ( A ) , [ τ t ( h j ) , B y ] ] . f'(t)=i[Q_X(t),f(t)]-i\sum_{j:X_j\cap X\ne\varnothing}[\tau_t(A),[\tau_t(h_j),B_y]]. f ′ ( t ) = i [ Q X ( t ) , f ( t )] − i j : X j ∩ X = ∅ ∑ [ τ t ( A ) , [ τ t ( h j ) , B y ]] .
The propagator of the homogeneous equation is unitary conjugation. Variation of constants, followed by the supremum over A A A , consequently gives
F ( X , t ) ≤ 2 ∥ B y ∥ 1 { y ∈ X } + 2 ∑ j : X j ∩ X ≠ ∅ ∥ h j ∥ ∫ 0 t F ( X j , u ) d u . (25) F(X,t)\le2\|B_y\|\mathbf{1}_{\{y\in X\}}+2\sum_{j:X_j\cap X\ne\varnothing}\|h_j\|\int_0^t F(X_j,u)\,du. \tag*{(25)} F ( X , t ) ≤ 2∥ B y ∥ 1 { y ∈ X } + 2 j : X j ∩ X = ∅ ∑ ∥ h j ∥ ∫ 0 t F ( X j , u ) d u . (25)
The same argument with − H -H − H handles negative times.
Starting from X = X i X=X_i X = X i , iterate (4.5). At each step the sum of the available interaction norms is at most κ : = v R b 0 \kappa:=v_Rb_0 κ := v R b 0 , by (4.2). A chain X i , X j 1 , … , X j m X_i,X_{j_1},\ldots,X_{j_m} X i , X j 1 , … , X j m with consecutive intersections and with y ∈ X j m y \in X_{jm} y ∈ X j m has d Λ ( a i , y ) ≤ ( m + 1 ) R d_{\Lambda}(a_i,y) \leq(m+1)R d Λ ( a i , y ) ≤ ( m + 1 ) R . The remainder after M M M iterations is at most 2 ∥ B y ∥ ( 2 κ t ) M / M ! 2\lVert B_y\rVert(2\kappa t)^M/M! 2 ∥ B y ∥ ( 2 κ t ) M / M ! , since F ( X , u ) ≤ 2 ∥ B y ∥ F(X,u) \leq2\lVert B_y\rVert F ( X , u ) ≤ 2 ∥ B y ∥ ; it tends to zero. For every μ > 0 \mu> 0 μ > 0 , the resulting chain sum satisfies
F ( X i , t ) ≤ 2 ∥ B y ∥ ∑ m ≥ 0 ( 2 κ t ) m m ! 1 { d Λ ( a i , y ) ≤ ( m + 1 ) R } ≤ 2 ∥ B y ∥ e μ R − μ d Λ ( a i , y ) exp ( 2 κ e μ R t ) . F(X_i,t) \leq2\lVert B_y\rVert\sum_{m\geq0} \frac{(2\kappa t)^m}{m!}1_{\{d_{\Lambda}(a_i,y)\leq(m+1)R\}}
\leq2\lVert B_y\rVert e^{\mu R-\mu d_{\Lambda}(a_i,y)}\exp(2\kappa e^{\mu R}t). F ( X i , t ) ≤ 2 ∥ B y ∥ m ≥ 0 ∑ m ! ( 2 κ t ) m 1 { d Λ ( a i , y ) ≤ ( m + 1 ) R } ≤ 2 ∥ B y ∥ e μ R − μ d Λ ( a i , y ) exp ( 2 κ e μ R t ) .
This proves (24) . If the distance is infinite, no finite chain contributes and the vanishing remainder proves exact zero.
For completeness, write the expectation in (23) as a product of on-site twirls T y T_y T y . These are commuting contractions, and telescoping that product shows, for any B B B ,
∥ B − E i , l ( B ) ∥ ≤ ∑ y ∉ N l ( a i ) ∥ B − T y ( B ) ∥ ≤ ∑ y ∉ N l ( a i ) sup U y ∥ [ B , U y ] ∥ . \lVert B-E_{i,l}(B)\rVert\leq\sum_{y\notin N_l(a_i)}\lVert B-T_y(B)\rVert\leq\sum_{y\notin N_l(a_i)}\sup_{U_y}\lVert[B,U_y]\rVert. ∥ B − E i , l ( B )∥ ≤ y ∈ / N l ( a i ) ∑ ∥ B − T y ( B )∥ ≤ y ∈ / N l ( a i ) ∑ U y sup ∥[ B , U y ]∥ .
where U y U_y U y ranges over on-site unitaries. Sites in another component contribute zero. The number of sites at graph distance d d d is at most C ( d + 1 ) 2 C(d+1)^2 C ( d + 1 ) 2 , because the graph ball lies in an ambient lattice ball. Applying (24) and summing ∑ d > l ( d + 1 ) 2 e − c d ≤ C ′ e − c ′ l \sum_{d>l}(d+1)^2e^{-cd}\leq C'e^{-c'l} ∑ d > l ( d + 1 ) 2 e − c d ≤ C ′ e − c ′ l proves the exponential bound in (4.4) . Contractivity gives its other bound. □
The filter must remove ground-to-excited matrix elements exactly, while its time kernel must decay fast enough to combine with Lemma (23) . The following elementary construction gives every stretched exponential exponent p / ( p + 1 ) p/(p+1) p / ( p + 1 ) .
Lemma 4.2 (A compactly supported spectral filter). Fix an integer p ≥ 1 p\geq1 p ≥ 1 , put α = p / ( p + 1 ) \alpha=p/(p+1) α = p / ( p + 1 ) , and let δ > 0 \delta>0 δ > 0 . Define the real even function
χ ( ω ) = { e exp [ − ( 1 − ( ω / δ ) 2 ) − p ] , ∣ ω ∣ < δ , 0 , ∣ ω ∣ ≥ δ . \chi(\omega)=
\begin{cases}
e\exp[-(1-(\omega/\delta)^2)^{-p}], & |\omega|<\delta,\\
0, & |\omega|\geq\delta.
\end{cases} χ ( ω ) = { e exp [ − ( 1 − ( ω / δ ) 2 ) − p ] , 0 , ∣ ω ∣ < δ , ∣ ω ∣ ≥ δ .
Then χ ∈ C ∞ ( R ) \chi\in C^\infty(\mathbb{R}) χ ∈ C ∞ ( R ) , χ ( 0 ) = 1 \chi(0)=1 χ ( 0 ) = 1 , and the real even function
f ( t ) = 1 2 π ∫ R χ ( ω ) e − i t ω d ω f(t)=\frac{1}{2\pi}\int_{\mathbb{R}}\chi(\omega)e^{-it\omega}\,d\omega f ( t ) = 2 π 1 ∫ R χ ( ω ) e − i t ω d ω
satisfies
χ ( ω ) = ∫ R f ( t ) e i t ω d t , ∣ f ( t ) ∣ ≤ C e − c ∣ t ∣ α . (26) \chi(\omega)=\int_{\mathbb{R}}f(t)e^{it\omega}\,dt,\qquad|f(t)|\leq Ce^{-c|t|^\alpha}. \tag*{(26)} χ ( ω ) = ∫ R f ( t ) e i t ω d t , ∣ f ( t ) ∣ ≤ C e − c ∣ t ∣ α . (26)
Here C , c > 0 C,c>0 C , c > 0 depend only on p , δ p,\delta p , δ .
Proof. We give the derivative estimate responsible for the exponent. For real u ∈ ( − 1 , 1 ) u\in(-1,1) u ∈ ( − 1 , 1 ) set w = 1 − u 2 w=1-u^2 w = 1 − u 2 . Choose η p > 0 \eta_p>0 η p > 0 sufficiently small. On the complex disk ∣ z − u ∣ ≤ η p w |z-u|\leq\eta_p w ∣ z − u ∣ ≤ η p w one has
1 − z 2 = w ( 1 + ζ ) , ∣ ζ ∣ ≤ 3 η p , Re ( 1 + ζ ) − p ≥ c p > 0. 1-z^2=w(1+\zeta),\qquad|\zeta|\leq3\eta_p,\qquad\operatorname{Re}(1+\zeta)^{-p}\geq c_p>0. 1 − z 2 = w ( 1 + ζ ) , ∣ ζ ∣ ≤ 3 η p , Re ( 1 + ζ ) − p ≥ c p > 0.
The last inequality follows by continuity at ζ = 0 \zeta=0 ζ = 0 , with p p p fixed. The function e exp [ − ( 1 − z 2 ) − p ] e\exp[-(1-z^2)^{-p}] e exp [ − ( 1 − z 2 ) − p ] is analytic on the disk, and Cauchy’s estimate gives
∣ d m d u m ( e exp [ − ( 1 − u 2 ) − p ] ) ∣ ≤ C m ! η p − m w − m e − c p w − p . \left|\frac{d^m}{du^m}\left(e\exp[-(1-u^2)^{-p}]\right)\right|
\leq Cm!\eta_p^{-m}w^{-m}e^{-c_pw^{-p}}. d u m d m ( e exp [ − ( 1 − u 2 ) − p ] ) ≤ C m ! η p − m w − m e − c p w − p .
For each fixed m m m this tends to zero at both endpoints. Extension by zero is therefore smooth. To make the estimate uniform in u u u , substitute s = w − p s=w^{-p} s = w − p and maximize s m / p e − c p s s^{m/p}e^{-c_ps} s m / p e − c p s . Its maximum is bounded by C m + 1 ( m ! ) 1 / p C^{m+1}(m!)^{1/p} C m + 1 ( m ! ) 1/ p , using m ! ≥ ( m / e ) m m! \ge(m/e)^m m ! ≥ ( m / e ) m ; the case m = 0 m=0 m = 0 is absorbed in C C C . Scaling from u u u to ω \omega ω yields
∥ χ ( m ) ∥ ∞ ≤ C 1 m ( m ! ) 1 + 1 / p . (27) \lVert\chi^{(m)} \rVert_{\infty} \le C_1^m (m!)^{1+1/p}. \tag*{(27)} ∥ χ ( m ) ∥ ∞ ≤ C 1 m ( m ! ) 1 + 1/ p . (27)
Integration by parts m m m times has no boundary terms. Consequently, for t ≠ 0 t \ne0 t = 0 ,
∣ f ( t ) ∣ ≤ C C 1 m ( m ! ) 1 + 1 / p ∣ t ∣ m ≤ C ( C 1 m 1 + 1 / p ∣ t ∣ ) m . |f(t)| \le C \frac{C_1^m(m!)^{1+1/p}}{|t|^m} \le C \left(\frac{C_1m^{1+1/p}}{|t|}\right)^m. ∣ f ( t ) ∣ ≤ C ∣ t ∣ m C 1 m ( m ! ) 1 + 1/ p ≤ C ( ∣ t ∣ C 1 m 1 + 1/ p ) m .
For sufficiently large ∣ t ∣ |t| ∣ t ∣ , choose m = ⌊ η ∣ t ∣ p / ( p + 1 ) ⌋ m=\lfloor\eta|t|^{p/(p+1)}\rfloor m = ⌊ η ∣ t ∣ p / ( p + 1 ) ⌋ with a fixed, sufficiently small η > 0 \eta>0 η > 0 . The expression in parentheses is at most 1 / 2 1/2 1/2 , proving the decay in (26) ; bounded t t t is covered by increasing C C C . In particular f ∈ L 1 ( R ) f \in L^1(\mathbb{R}) f ∈ L 1 ( R ) . Fourier inversion gives the first identity in (26) . It can also be obtained directly by inserting e − ε t 2 e^{-\varepsilon t^2} e − ε t 2 , interchanging the two integrals, and letting the resulting Gaussian approximate identity converge to the continuous function χ \chi χ . Reality and evenness follow from those properties of χ \chi χ .
Exact positive constraints and their local square roots
We begin with Kitaev’s centered spectral-filter construction of Hermitian quasi-local constraints that annihilate the ground state [23 ] , Appendix D.1.2, Proposition D.1. Its terms sum to the original Hamiltonian minus its ground energy. Taking their absolute values gives the positive replacement used here: the new sum dominates the original shifted Hamiltonian and therefore retains a global gap. The locality estimates below also quantify the effect of this functional calculus. The distinction between filtered constraints and a positive sum with a gap is discussed by Swingle and McGreevy [37 ] , Section 8.4.
We now combine the spectral and spatial estimates. In the next statement, the normalization c ∗ c_* c ∗ and the gap lower bound g g g may depend on the chosen p p p . Once p p p is fixed, both are independent of the system size.
Proposition 4.3 (Positive replacement of the Hamiltonian). Suppose H Ω = E 0 Ω H\Omega=E_0\Omega H Ω = E 0 Ω , ∥ Ω ∥ = 1 \lVert\Omega\rVert=1 ∥ Ω ∥ = 1 , and
H − E 0 I ≥ Δ ( I − P Ω ) , P Ω = ∣ Ω ⟩ ⟨ Ω ∣ . H-E_0I \ge\Delta(I-P_\Omega), \qquad P_\Omega=|\Omega\rangle\langle\Omega|. H − E 0 I ≥ Δ ( I − P Ω ) , P Ω = ∣Ω ⟩ ⟨ Ω∣.
For each integer p ≥ 1 p\ge1 p ≥ 1 and α = p / ( p + 1 ) \alpha=p/(p+1) α = p / ( p + 1 ) , there are operators k i k_i k i , indexed by the original supports and retaining their anchors, and a constant c ∗ > 0 c_*>0 c ∗ > 0 such that
0 ≤ k i ≤ I , k i Ω = 0 , H F : = ∑ i ∈ I k i ≥ c ∗ − 1 ( H − E 0 I ) ≥ g ( I − P Ω ) , g : = Δ / c ∗ . (28) 0 \le k_i \le I, \qquad k_i\Omega=0, \qquad H_F:=\sum_{i\in\mathcal{I}} k_i \ge c_*^{-1}(H-E_0I) \ge g(I-P_\Omega), \qquad g:=\Delta/c_*. \tag*{(28)} 0 ≤ k i ≤ I , k i Ω = 0 , H F := i ∈ I ∑ k i ≥ c ∗ − 1 ( H − E 0 I ) ≥ g ( I − P Ω ) , g := Δ/ c ∗ . (28)
Thus H F H_F H F has the unique ground vector Ω \Omega Ω , ground energy zero, and gap at least g g g . Furthermore,
k i , l : = E i , l ( k i ) ∈ [ 0 , I ] , ∥ k i − k i , l ∥ ≤ C e − c l α ( l ∈ Z ≥ 0 ) . (29) k_{i,l}:=E_{i,l}(k_i)\in[0,I], \qquad\lVert k_i-k_{i,l}\rVert\le Ce^{-cl^\alpha} \qquad(l\in\mathbb{Z}_{\ge0}). \tag*{(29)} k i , l := E i , l ( k i ) ∈ [ 0 , I ] , ∥ k i − k i , l ∥ ≤ C e − c l α ( l ∈ Z ≥ 0 ) . (29)
Each k i k_i k i is supported in the connected component containing a i a_i a i .
Proof. Use Lemma (4.2) with δ = Δ / 2 \delta=\Delta/2 δ = Δ/2 , and define
M i = ∫ R f ( t ) τ t ( h i ) d t − ⟨ Ω , h i Ω ⟩ I . (30) M_i=\int_{\mathbb{R}} f(t)\tau_t(h_i)\,\mathrm{d}t-\langle\Omega,h_i\Omega\rangle I. \tag*{(30)} M i = ∫ R f ( t ) τ t ( h i ) d t − ⟨ Ω , h i Ω ⟩ I . (30)
The integral converges in norm and M i M_i M i is Hermitian. In an eigenbasis of H H H , its uncentered ground-to-energy-E E E matrix element equals the corresponding matrix element of h i h_i h i multiplied by χ ( E − E 0 ) \chi(E-E_0) χ ( E − E 0 ) . All excited energies satisfy E − E 0 ≥ Δ E-E_0 \ge\Delta E − E 0 ≥ Δ , where χ \chi χ vanishes. The ground component is unchanged because χ ( 0 ) = 1 \chi(0)=1 χ ( 0 ) = 1 , and the scalar in (30) removes it. Hence M i Ω = 0 M_i\Omega=0 M i Ω = 0 . Also, since τ t ( H ) = H \tau_t(H)=H τ t ( H ) = H and ∫ f = 1 \int f=1 ∫ f = 1 ,
∑ i M i = H − E 0 I , ∥ M i ∥ ≤ J ( ∥ f ∥ 1 + 1 ) . (31) \sum_i M_i = H-E_0I,\qquad\lVert M_i\rVert\le J(\lVert f\rVert_1+1). \tag*{(31)} i ∑ M i = H − E 0 I , ∥ M i ∥ ≤ J (∥ f ∥ 1 + 1 ) . (31)
Choose c ∗ : = max { 1 , J ( ∥ f ∥ 1 + 1 ) } c_*:=\max\{1,J(\lVert f\rVert_1+1)\} c ∗ := max { 1 , J (∥ f ∥ 1 + 1 )} and set k i = ∣ M i ∣ / c ∗ k_i=|M_i|/c_* k i = ∣ M i ∣/ c ∗ . For a Hermitian operator, ∣ M i ∣ ≥ M i |M_i|\ge M_i ∣ M i ∣ ≥ M i and ker ∣ M i ∣ = ker M i \ker|M_i|=\ker M_i ker ∣ M i ∣ = ker M i . These observations and (31) prove (28) .
It remains to check locality after taking the absolute value. The scalar in (30) is fixed by E i , l E_{i,l} E i , l . For ∣ t ∣ ≤ ε l |t|\le\varepsilon l ∣ t ∣ ≤ εl , choose ε > 0 \varepsilon>0 ε > 0 small enough that (4.4) is at most C e − c ′ l Ce^{-c'l} C e − c ′ l for A = h i A=h_i A = h i . For the remaining times use its bound 2 J 2J 2 J . Thus
∥ M i − E i , l ( M i ) ∥ ≤ C e − c ′ l ∥ f ∥ 1 + 2 J ∫ ∣ t ∣ > ε l ∣ f ( t ) ∣ d t ≤ C ′ ′ e − c ′ l α . (32) \lVert M_i-E_{i,l}(M_i)\rVert\le Ce^{-c'l}\lVert f\rVert_1+2J\int_{|t|>\varepsilon l}|f(t)|\,dt\le C''e^{-c'l^\alpha}. \tag*{(32)} ∥ M i − E i , l ( M i )∥ ≤ C e − c ′ l ∥ f ∥ 1 + 2 J ∫ ∣ t ∣ > εl ∣ f ( t ) ∣ d t ≤ C ′′ e − c ′ l α . (32)
The last tail estimate follows by substituting u = ∣ t ∣ α u=|t|^\alpha u = ∣ t ∣ α and absorbing the resulting fixed power of u u u into the exponential. The case l = 0 l=0 l = 0 follows from the uniform norm bound.
We use the dimension-independent inequality
∥ U 1 / 2 − V 1 / 2 ∥ ≤ ∥ U − V ∥ 1 / 2 ( U , V ≥ 0 ) . (33) \lVert U^{1/2}-V^{1/2}\rVert\le\lVert U-V\rVert^{1/2}\qquad(U,V\ge0). \tag*{(33)} ∥ U 1/2 − V 1/2 ∥ ≤ ∥ U − V ∥ 1/2 ( U , V ≥ 0 ) . (33)
Here is an order proof. The integral formula
T 1 / 2 = 1 π ∫ 0 ∞ T ( T + s I ) − 1 s − 1 / 2 d s ( T ≥ 0 ) T^{1/2}=\frac{1}{\pi}\int_0^\infty T(T+sI)^{-1}s^{-1/2}\,ds\qquad(T\ge0) T 1/2 = π 1 ∫ 0 ∞ T ( T + s I ) − 1 s − 1/2 d s ( T ≥ 0 )
follows from scalar integration and the spectral theorem. It shows that the square root is operator monotone: inversion reverses the order of positive invertible operators, and T ( T + s I ) − 1 = I − s ( T + s I ) − 1 T(T+sI)^{-1}=I-s(T+sI)^{-1} T ( T + s I ) − 1 = I − s ( T + s I ) − 1 . With ϵ = ∥ U − V ∥ \epsilon=\lVert U-V\rVert ϵ = ∥ U − V ∥ , monotonicity and scalar functional calculus give U 1 / 2 ≤ ( V + ϵ I ) 1 / 2 ≤ V 1 / 2 + ϵ I U^{1/2}\le(V+\epsilon I)^{1/2}\le V^{1/2}+\sqrt{\epsilon}I U 1/2 ≤ ( V + ϵ I ) 1/2 ≤ V 1/2 + ϵ I . Interchanging U , V U,V U , V proves (33) .
Apply this with U = M i 2 U=M_i^2 U = M i 2 and V = ( E i , l M i ) 2 V=(E_{i,l}M_i)^2 V = ( E i , l M i ) 2 . Both factors in the latter square are Hermitian, and their norms are at most c ∗ c_* c ∗ . Therefore
∥ ∣ M i ∣ − ∣ E i , l M i ∣ ∥ ≤ ( 2 c ∗ ∥ M i − E i , l M i ∥ ) 1 / 2 ≤ C e − c l α . \lVert|M_i|-|E_{i,l}M_i|\rVert\le(2c_*\lVert M_i-E_{i,l}M_i\rVert)^{1/2}\le Ce^{-cl^\alpha}. ∥ ∣ M i ∣ − ∣ E i , l M i ∣ ∥ ≤ ( 2 c ∗ ∥ M i − E i , l M i ∥ ) 1/2 ≤ C e − c l α .
The operator ∣ E i , l M i ∣ |E_{i,l}M_i| ∣ E i , l M i ∣ is supported in N l ( a i ) N_l(a_i) N l ( a i ) . Since E i , l E_{i,l} E i , l fixes it and is contractive,
∥ ∣ M i ∣ − E i , l ( ∣ M i ∣ ) ∥ ≤ 2 ∥ ∣ M i ∣ − ∣ E i , l M i ∣ ∥ . \lVert|M_i|-E_{i,l}(|M_i|)\rVert\le2\lVert|M_i|-|E_{i,l}M_i|\rVert. ∥ ∣ M i ∣ − E i , l ( ∣ M i ∣ )∥ ≤ 2 ∥ ∣ M i ∣ − ∣ E i , l M i ∣ ∥ .
After division by c ∗ c_* c ∗ this proves (29) ; its order bounds follow from positivity and unitality of E i , l E_{i,l} E i , l .
Finally, every original support lies in one component. The Hamiltonian is a tensor sum over components, so τ t ( h i ) \tau_t(h_i) τ t ( h i ) is supported in the component of a i a_i a i . The integral, scalar centering, and functional calculus in the above construction all stay in that component’s operator algebra. This proves the exact component assertion.
The same construction supplies local approximants to the square roots of the positive constraints. We include the associated channels because their unitality will allow spatial localization of products in Section 10.
Lemma 4.4 (Square roots and local channels). For the constraints of Proposition 4.3, define
G i = ( I − k i ) 1 / 2 , K i = k i 1 / 2 , G i , l = ( I − k i , l ) 1 / 2 , K i , l = k i , l 1 / 2 . G_i=(I-k_i)^{1/2},\qquad K_i=k_i^{1/2},\qquad G_{i,l}=(I-k_{i,l})^{1/2},\qquad K_{i,l}=k_{i,l}^{1/2}. G i = ( I − k i ) 1/2 , K i = k i 1/2 , G i , l = ( I − k i , l ) 1/2 , K i , l = k i , l 1/2 .
These are positive contractions, G i Ω = Ω G_i\Omega=\Omega G i Ω = Ω , K i Ω = 0 K_i\Omega=0 K i Ω = 0 , and
∥ G i − G i , l ∥ + ∥ K i − K i , l ∥ ≤ C e − c l α , G i , l 2 + K i , l 2 = I . (34) \lVert G_i-G_{i,l}\rVert+\lVert K_i-K_{i,l}\rVert\le Ce^{-cl^\alpha},\qquad G_{i,l}^{2}+K_{i,l}^{2}=I. \tag*{(34)} ∥ G i − G i , l ∥ + ∥ K i − K i , l ∥ ≤ C e − c l α , G i , l 2 + K i , l 2 = I . (34)
Define maps on the full operator algebra by
E i ( B ) = G i B G i + K i B K i , E i , l ( B ) = G i , l B G i , l + K i , l B K i , l . \mathcal{E}_i(B)=G_iBG_i+K_iBK_i,\qquad\mathcal{E}_{i,l}(B)=G_{i,l}BG_{i,l}+K_{i,l}BK_{i,l}. E i ( B ) = G i B G i + K i B K i , E i , l ( B ) = G i , l B G i , l + K i , l B K i , l .
Both maps are unital and completely positive, and are contractions in operator norm, also after tensoring with the identity map on any auxiliary matrix algebra. The completely bounded norm, denoted by ∥ ⋅ ∥ c b \lVert\cdot\rVert_{\mathrm{cb}} ∥ ⋅ ∥ cb , is the supremum of the operator norms on all such auxiliary extensions. In this norm,
∥ E i − E i , l ∥ c b ≤ C e − c l α . (35) \lVert\mathcal{E}_i-\mathcal{E}_{i,l}\rVert_{\mathrm{cb}}\le Ce^{-cl^\alpha}. \tag*{(35)} ∥ E i − E i , l ∥ cb ≤ C e − c l α . (35)
The map E i , l \mathcal{E}_{i,l} E i , l fixes every operator commuting with the full algebra on N l ( a i ) N_l(a_i) N l ( a i ) , including operators supported outside that ball. All these conclusions allow arbitrary spectator auxiliary systems.
Proof. Apply (33) to k i k_i k i , k i , l k_{i,l} k i , l and to I − k i I-k_i I − k i , I − k i , l I-k_{i,l} I − k i , l , using (29) . The order and ground-vector assertions follow from functional calculus. Each displayed channel is a sum of two maps of the form B ↦ A ∗ B A B\mapsto A^*BA B ↦ A ∗ B A ; this proves complete positivity, while the sum of the squared Kraus operators is I I I . More explicitly, the map v ↦ G i v ⊕ K i v v\mapsto G_iv\oplus K_iv v ↦ G i v ⊕ K i v is an isometry and E i ( B ) \mathcal{E}_i(B) E i ( B ) is the compression of B ⊕ B B\oplus B B ⊕ B by that isometry. This proves contractivity, and the same proof works for the local maps and after adjoining an identity tensor factor. Finally,
∥ A B A − A ′ B A ′ ∥ ≤ ( ∥ A ∥ + ∥ A ′ ∥ ) ∥ A − A ′ ∥ ∥ B ∥ , \lVert ABA-A'BA'\rVert\le(\lVert A\rVert+\lVert A'\rVert)\lVert A-A'\rVert\lVert B\rVert, ∥ A B A − A ′ B A ′ ∥ ≤ (∥ A ∥ + ∥ A ′ ∥) ∥ A − A ′ ∥ ∥ B ∥ ,
also on every auxiliary extension. Applying this to both summands proves (35) , where the completely bounded norm is the supremum of these extended operator norms. An operator commuting with the ball algebra commutes with both local square roots, so its image is itself times G i , l 2 + K i , l 2 = I G_{i,l}^{2}+K_{i,l}^{2}=I G i , l 2 + K i , l 2 = I .
Truncation with an error independent of the total volume
We next make the positive constraints strictly local near a testing set. Conditional expectation preserves positivity but need not preserve k i Ω = 0 k_i\Omega=0 k i Ω = 0 . We therefore bound the norm of the total perturbation and work with the truncated Hamiltonian’s exact ground vector. Farther constraints receive larger truncation radii, so that summing all errors does not charge the entire volume. Graph balls will also let us count the terms crossing a cut by the number of edges of that cut. The choice p = 1 p=1 p = 1 suffices here: tails of the form e − c l e^{-c\sqrt{l}} e − c l give radii of order ( log n ) 2 (\log n)^2 ( log n ) 2 for inverse-power accuracy at scale n n n .
Proposition 4.5 (Truncation near a finite set). Use Proposition 4.3 with p = 1 p=1 p = 1 , so α = 1 / 2 \alpha=1/2 α = 1/2 . Fix C 0 > 0 C_0>0 C 0 > 0 . There is a constant C 1 C_1 C 1 , depending only on q q q , R R R , J J J , Δ \Delta Δ , C 0 C_0 C 0 , with the following property for every real n ≥ 2 n\ge2 n ≥ 2 and every nonempty S 0 ⊆ Λ S_0\subseteq\Lambda S 0 ⊆ Λ with ∣ S 0 ∣ ≤ C 0 n 2 |S_0|\le C_0n^2 ∣ S 0 ∣ ≤ C 0 n 2 . Put r 0 = ⌈ C 1 ( log n ) 2 ⌉ r_0=\lceil C_1(\log n)^2\rceil r 0 = ⌈ C 1 ( log n ) 2 ⌉ . If d i 0 : = d Λ ( a i , S 0 ) < ∞ d_i^0:=d_\Lambda(a_i,S_0)<\infty d i 0 := d Λ ( a i , S 0 ) < ∞ , define
r i = max { r 0 , ⌈ d i 0 / 2 ⌉ } , h ~ i = k i , r i , X ~ i = N r i ( a i ) . (36) r_i=\max\{r_0,\lceil d_i^0/2\rceil\},\qquad\widetilde{h}_i=k_{i,r_i},\qquad\widetilde{X}_i=N_{r_i}(a_i). \tag*{(36)} r i = max { r 0 , ⌈ d i 0 /2 ⌉} , h i = k i , r i , X i = N r i ( a i ) . (36)
If d i 0 = ∞ d_i^0=\infty d i 0 = ∞ , set h ~ i = k i \widetilde{h}_i=k_i h i = k i and designate its anchor’s entire component as X ~ i \widetilde{X}_i X i . Then H ~ = ∑ i h ~ i \widetilde{H}=\sum_i\widetilde{h}_i H = ∑ i h i is a sum of positive contractions and
∥ H ~ − H F ∥ ≤ ϵ n , ϵ n : = min { n − 1000 , g / 4 } . (37) \lVert\widetilde{H}-H_F\rVert\le\epsilon_n,\qquad\epsilon_n:=\min\{n^{-1000},g/4\}. \tag*{(37)} ∥ H − H F ∥ ≤ ϵ n , ϵ n := min { n − 1000 , g /4 } . (37)
Its ground energy E ~ 0 \widetilde{E}_0 E 0 lies in [ 0 , ϵ n ] [0,\epsilon_n] [ 0 , ϵ n ] , its ground vector Ω ~ \widetilde{\Omega} Ω is unique, and its gap is at least g / 2 g/2 g /2 . After a choice of phase,
∥ Ω ~ − Ω ∥ ≤ 2 ϵ n / g , 1 2 ∥ ∣ Ω ~ ⟩ ⟨ Ω ~ ∣ − P Ω ∥ 1 ≤ 2 ϵ n / g . (38) \lVert\widetilde{\Omega}-\Omega\rVert\le2\sqrt{\epsilon_n/g}, \qquad\frac{1}{2}\lVert|\widetilde{\Omega}\rangle\langle\widetilde{\Omega}|-P_{\Omega}\rVert_1 \le\sqrt{2\epsilon_n/g}. \tag*{(38)} ∥ Ω − Ω ∥ ≤ 2 ϵ n / g , 2 1 ∥ ∣ Ω ⟩ ⟨ Ω ∣ − P Ω ∥ 1 ≤ 2 ϵ n / g . (38)
For a set X ⊆ S 0 X\subseteq S_0 X ⊆ S 0 , let b X = ∣ ∂ Λ X ∣ b_X=|\partial_{\Lambda}X| b X = ∣ ∂ Λ X ∣ and let C X C_X C X be the labels whose designated supports X ~ i \widetilde{X}_i X i meet both X X X and Λ ∖ X \Lambda\setminus X Λ ∖ X . Every such support has radius exactly r 0 r_0 r 0 , and
∣ C X ∣ ≤ C b X ( r 0 + 1 ) 2 , log d i ≤ C ( r 0 + 1 ) 2 ( i ∈ C X ) , d i : = q ∣ X ~ i ∣ . (39) |C_X|\le Cb_X(r_0+1)^2,\qquad\log d_i\le C(r_0+1)^2\quad(i\in C_X),\qquad d_i:=q^{|\widetilde{X}_i|}. \tag*{(39)} ∣ C X ∣ ≤ C b X ( r 0 + 1 ) 2 , log d i ≤ C ( r 0 + 1 ) 2 ( i ∈ C X ) , d i := q ∣ X i ∣ . (39)
Consequently the cut parameter
B X : = 1 + ∑ i ∈ C X log 2 ( e d i ) ≤ C ( 1 + b X ) ( r 0 + 1 ) 6 . (40) B_X:=1+\sum_{i\in C_X}\log^2(ed_i)\le C(1+b_X)(r_0+1)^6. \tag*{(40)} B X := 1 + i ∈ C X ∑ log 2 ( e d i ) ≤ C ( 1 + b X ) ( r 0 + 1 ) 6 . (40)
In particular, b X ≤ C 2 n D b_X\le C_2nD b X ≤ C 2 n D and D ≥ 1 D\ge1 D ≥ 1 imply B X ≤ C n D ( log n ) 12 B_X\le CnD(\log n)^{12} B X ≤ C n D ( log n ) 12 , with the constant also depending on C 2 C_2 C 2 .
Proof. We first prove the summation estimate for any fixed α ∈ ( 0 , 1 ) \alpha\in(0,1) α ∈ ( 0 , 1 ) for which (4.9) holds, and any integer r 0 ≥ 1 r_0\ge1 r 0 ≥ 1 . At each finite distance d d d from S 0 S_0 S 0 there are at most C μ R ∣ S 0 ∣ ( d + 1 ) 2 C\mu_R|S_0|(d+1)^2 C μ R ∣ S 0 ∣ ( d + 1 ) 2 labels: every anchor at that distance belongs to N d ( x ) N_d(x) N d ( x ) for some x ∈ S 0 x\in S_0 x ∈ S 0 , and anchor multiplicity is bounded by μ R \mu_R μ R . Labels at infinite distance have no error by definition. The triangle inequality therefore gives
∥ H ~ − H F ∥ ≤ C ∣ S 0 ∣ ∑ d ≥ 0 ( d + 1 ) 2 exp ( − c max { r 0 , ⌊ d / 2 ⌋ } α ) ≤ C ′ ∣ S 0 ∣ e − c ′ r 0 α . (41) \lVert\widetilde{H}-H_F\rVert\le C|S_0|\sum_{d\ge0}(d+1)^2\exp\left(-c\max\{r_0,\lfloor d/2\rfloor\}^{\alpha}\right)\le C'|S_0|e^{-c'r_0^\alpha}. \tag*{(41)} ∥ H − H F ∥ ≤ C ∣ S 0 ∣ d ≥ 0 ∑ ( d + 1 ) 2 exp ( − c max { r 0 , ⌊ d /2 ⌋ } α ) ≤ C ′ ∣ S 0 ∣ e − c ′ r 0 α . (41)
To justify the final inequality, the terms d ≤ 2 r 0 + 2 d\le2r_0+2 d ≤ 2 r 0 + 2 have sum at most C ( r 0 + 1 ) 3 e − c r 0 α C(r_0+1)^3e^{-cr_0^\alpha} C ( r 0 + 1 ) 3 e − c r 0 α . For d > 2 r 0 + 2 d>2r_0+2 d > 2 r 0 + 2 use ⌊ d / 2 ⌋ ≥ d / 3 \lfloor d/2\rfloor\ge d/3 ⌊ d /2 ⌋ ≥ d /3 ; comparison with the integral of ( x + 1 ) 2 e − c ( x / 3 ) α (x+1)^2e^{-c(x/3)^\alpha} ( x + 1 ) 2 e − c ( x /3 ) α , followed by u = x α u=x^\alpha u = x α , bounds the remaining tail by a fixed power of r 0 + 1 r_0+1 r 0 + 1 times e − c ′ ′ r 0 α e^{-c''r_0^\alpha} e − c ′′ r 0 α . All such powers are absorbed by decreasing the positive exponential constant. Thus (4.21) has no factor involving ∣ Λ ∣ |\Lambda| ∣Λ∣ .
Now take α = 1 / 2 \alpha=1/2 α = 1/2 , ∣ S 0 ∣ ≤ C 0 n 2 |S_0|\le C_0n^2 ∣ S 0 ∣ ≤ C 0 n 2 , and r 0 = ⌈ C 1 ( log n ) 2 ⌉ r_0=\lceil C_1(\log n)^2\rceil r 0 = ⌈ C 1 ( log n ) 2 ⌉ . The right-hand side of (4.21) is at most C ′ C 0 n 2 − c ′ C 1 C'C_0n^{2-c'\sqrt{C_1}} C ′ C 0 n 2 − c ′ C 1 . Taking C 1 C_1 C 1 sufficiently large proves (4.17), including its g / 4 g/4 g /4 bound for all n ≥ 2 n\ge2 n ≥ 2 .
Positivity gives E ~ 0 ≥ 0 \widetilde{E}_0\ge0 E 0 ≥ 0 , and testing H ~ \widetilde{H} H on Ω \Omega Ω gives E ~ 0 ≤ ϵ n \widetilde{E}_0\le\epsilon_n E 0 ≤ ϵ n . The min–max principle and (4.17) put the second eigenvalue of H ~ \widetilde{H} H at least g − ϵ n g-\epsilon_n g − ϵ n . The difference between its first two eigenvalues is consequently at least g − 2 ϵ n ≥ g / 2 g-2\epsilon_n\ge g/2 g − 2 ϵ n ≥ g /2 , which also proves uniqueness. Moreover,
g ( 1 − ∣ ⟨ Ω , Ω ~ ⟩ ∣ 2 ) ≤ ⟨ Ω ~ , H F Ω ~ ⟩ ≤ E ~ 0 + ϵ n ≤ 2 ϵ n . g(1-|\langle\Omega,\widetilde{\Omega}\rangle|^2)\le\langle\widetilde{\Omega},H_F\widetilde{\Omega}\rangle\le\widetilde{E}_0+\epsilon_n\le2\epsilon_n. g ( 1 − ∣ ⟨ Ω , Ω ⟩ ∣ 2 ) ≤ ⟨ Ω , H F Ω ⟩ ≤ E 0 + ϵ n ≤ 2 ϵ n .
The trace distance of two pure states equals the square root of one minus their squared overlap, giving the second estimate in (38) . Choose the overlap real and nonnegative, and use 1 − s ≤ 1 − s 2 1-s\le1-s^2 1 − s ≤ 1 − s 2 for 0 ≤ s ≤ 1 0\le s\le1 0 ≤ s ≤ 1 to obtain the first estimate.
Finally, if a designated support meets X ⊆ S 0 X\subseteq S_0 X ⊆ S 0 , then its anchor has finite distance from S 0 S_0 S 0 . If r i > r 0 r_i>r_0 r i > r 0 , formula (36) gives r i = ⌊ d i 0 / 2 ⌋ < d i 0 r_i=\lfloor d_i^0/2\rfloor<d_i^0 r i = ⌊ d i 0 /2 ⌋ < d i 0 , so that its ball cannot meet S 0 S_0 S 0 . Hence every label in C X C_X C X has r i = r 0 r_i=r_0 r i = r 0 . If its anchor lies in X X X , take a shortest path from the anchor to a point of the ball outside X X X ; otherwise take one to a point inside X X X . This path stays in the ball and contains an edge of ∂ Λ X \partial_{\Lambda}X ∂ Λ X . Thus the anchor is within r 0 r_0 r 0 of an endpoint of a crossing edge. There are at most 2 b X 2b_X 2 b X endpoints, at most C ( r 0 + 1 ) 2 C(r_0+1)^2 C ( r 0 + 1 ) 2 sites in each such ball, and at most μ R \mu_R μ R labels per anchor. This proves the first bound in (39) . The ball volume bound also gives log d i = ∣ X ~ i ∣ log q ≤ C ( r 0 + 1 ) 2 \log d_i=|\widetilde{X}_i|\log q\le C(r_0+1)^2 log d i = ∣ X i ∣ log q ≤ C ( r 0 + 1 ) 2 . Summing its squared version proves (40) . Since r 0 + 1 ≤ C ( log n ) 2 r_0+1\le C(\log n)^2 r 0 + 1 ≤ C ( log n ) 2 for n ≥ 2 n\ge2 n ≥ 2 , its stated consequence follows. ▫
In the geometric applications of Section 9, a finite T ⊂ Z 2 T \subset\mathbb{Z}^2 T ⊂ Z 2 and an integer L ≥ 0 L \ge0 L ≥ 0 will be specified. With T L = T + ( [ − L , L ] 2 ∩ Z 2 ) T_L = T + ([-L,L]^2 \cap\mathbb{Z}^2) T L = T + ([ − L , L ] 2 ∩ Z 2 ) , we take S 0 = A ∩ T L S_0 = A \cap T_L S 0 = A ∩ T L . Only the bound ∣ S 0 ∣ ≤ C n 2 |S_0| \le Cn^2 ∣ S 0 ∣ ≤ C n 2 is needed in Proposition 4.5; the geometric estimates will provide b X = O ( n D ) b_X = O(nD) b X = O ( n D ) for the cuts that arise there. If S 0 S_0 S 0 is empty we retain all constraints exactly, and every cut X ⊆ S 0 X \subseteq S_0 X ⊆ S 0 has no crossing label. More generally, components that do not meet S 0 S_0 S 0 are retained exactly throughout the construction. The exponent 1000 in the approximation error can be replaced by any fixed positive exponent by increasing C 1 C_1 C 1 ; the powers of log n \log n log n in the support and cut bounds do not change.
Two conditional operator estimates
The two estimates used in the next section concern an arbitrary finite-dimensional pure state. Their constants depend on the dimension of a moved subsystem or of the support of a local operator, rather than on the dimensions of the remaining systems. The first bounds the norm of two overlapping density-matrix powers. The second controls how far a local operator expectation departs from the nonnegative real axis after conjugation by marginal powers. Later these estimates will measure, respectively, the entropy gained and the energy spent when a small subsystem changes sides in a partition.
For a density matrix ρ \rho ρ , write
ρ [ z ] = ∑ p > 0 p z Π p , ρ ^ = ρ + Π ker ρ . \rho^{[z]} = \sum_{p>0} p^z \Pi_p,\qquad\widehat{\rho} = \rho+ \Pi_{\ker\rho}. ρ [ z ] = p > 0 ∑ p z Π p , ρ = ρ + Π k e r ρ .
Here Π p \Pi_p Π p is its spectral projection at p p p . Thus ρ [ z ] \rho^{[z]} ρ [ z ] is zero on the kernel for every complex z z z , including z = 0 z = 0 z = 0 , whereas ρ ^ i u \widehat{\rho}^{iu} ρ i u is unitary. We omit the brackets on positive real powers. On a purification of ρ \rho ρ , either convention for an innermost power gives the same vector. Tensoring an operator with the identity on unmentioned factors is understood. We use the Schatten norms ∥ T ∥ p = ( Tr ∣ T ∣ p ) 1 / p \|T\|_p = (\operatorname{Tr}|T|^p)^{1/p} ∥ T ∥ p = ( Tr ∣ T ∣ p ) 1/ p for 1 ≤ p < ∞ 1 \le p < \infty 1 ≤ p < ∞ and ∥ T ∥ ∞ = ∥ T ∥ \|T\|_\infty= \|T\| ∥ T ∥ ∞ = ∥ T ∥ ; in particular ∥ T ∥ 2 \|T\|_2 ∥ T ∥ 2 is the Hilbert–Schmidt norm. A density matrix is called faithful if it is positive definite.
A relative logarithmic moment bound
We first record the dimension estimate used in both proofs. Let ρ \rho ρ be a density matrix on x U xU xU , let d = dim x d = \dim x d = dim x , and put Q = I x ⊗ ρ ^ U Q = I_x \otimes\widehat{\rho}_U Q = I x ⊗ ρ U . If p i > 0 p_i > 0 p i > 0 and q j > 0 q_j > 0 q j > 0 are eigenvalues of ρ \rho ρ and Q Q Q , respectively, choose eigenbases, with the Q Q Q basis respecting x ⊗ supp ρ U x \otimes\operatorname{supp}\rho_U x ⊗ supp ρ U , and give ( i , j ) (i,j) ( i , j ) probability p i ∣ ⟨ i , j ⟩ ∣ 2 p_i|\langle i,j\rangle|^2 p i ∣ ⟨ i , j ⟩ ∣ 2 . This defines a real random variable
L = log p i − log q j . L = \log p_i - \log q_j. L = log p i − log q j .
The support inclusion supp ρ ⊆ x ⊗ supp ρ U \operatorname{supp}\rho\subseteq x \otimes\operatorname{supp}\rho_U supp ρ ⊆ x ⊗ supp ρ U shows that only eigenvectors of Q Q Q in this latter space contribute. After restricting Q Q Q to this space and normalizing it by d d d , this is the two-eigenbasis construction of Nussbaum and Szkoła [31 ] [sic, Section 3, equation (11)]: the normalized log ratio is L + log d L + \log d L + log d . We prove the dimension bounds needed here directly. They are
E L = − S ( x ∣ U ) ρ , E e L ≤ d , E e − L ≤ d . (42) \mathbb{E}L = -S(x|U)_\rho,\qquad\mathbb{E}e^L \le d,\qquad\mathbb{E}e^{-L} \le d. \tag*{(42)} E L = − S ( x ∣ U ) ρ , E e L ≤ d , E e − L ≤ d . (42)
For completeness, positivity of the blocks of ρ \rho ρ in an x x x -basis gives, for v = ∑ b = 1 d ∣ b ⟩ v b v = \sum_{b=1}^{d} |b\rangle v_b v = ∑ b = 1 d ∣ b ⟩ v b ,
⟨ v , ρ v ⟩ ≤ ( ∑ b ⟨ v b , ρ b b v b ⟩ 1 / 2 ) 2 ≤ d ∑ b ⟨ v b , ρ U v b ⟩ . \langle v,\rho v\rangle\le\left(\sum_b \langle v_b,\rho_{bb}v_b\rangle^{1/2}\right)^2 \le d\sum_b \langle v_b,\rho_Uv_b\rangle. ⟨ v , ρ v ⟩ ≤ ( b ∑ ⟨ v b , ρ bb v b ⟩ 1/2 ) 2 ≤ d b ∑ ⟨ v b , ρ U v b ⟩ .
Thus ρ ≤ d ( I x ⊗ ρ U ) ≤ d Q \rho\le d(I_x \otimes\rho_U) \le dQ ρ ≤ d ( I x ⊗ ρ U ) ≤ d Q . It follows that ρ 1 / 2 Q − 1 ρ 1 / 2 ≤ d I \rho^{1/2}Q^{-1}\rho^{1/2} \le dI ρ 1/2 Q − 1 ρ 1/2 ≤ d I , and hence E e L = Tr ρ 2 Q − 1 ≤ d \mathbb{E}e^L = \operatorname{Tr}\rho^2Q^{-1} \le d E e L = Tr ρ 2 Q − 1 ≤ d . The other exponential moment equals Tr ( Π supp ρ Q ) ≤ d \operatorname{Tr}(\Pi_{\operatorname{supp}\rho}Q) \le d Tr ( Π supp ρ Q ) ≤ d . The formula for the mean follows by taking the two marginal traces.
Put ℓ = log ( e d ) \ell= \log(ed) ℓ = log ( e d ) . Markov’s inequality in (42) gives Pr ( ∣ L ∣ > v ) ≤ 2 d e − v \Pr(|L| > v) \le2de^{-v} Pr ( ∣ L ∣ > v ) ≤ 2 d e − v . Splitting at 2 ℓ 2\ell 2 ℓ and integrating this tail proves, with universal constants,
E [ L 2 e ∣ b L ∣ ] ≤ C ℓ 2 if ∣ b ∣ ℓ ≤ c . \mathbb{E}[L^2e^{|bL|}] \le C\ell^2 \quad\text{if } |b|\ell\le c. E [ L 2 e ∣ b L ∣ ] ≤ C ℓ 2 if ∣ b ∣ ℓ ≤ c .
Taylor’s formula, followed by log ( 1 + y ) ≤ y \log(1+y) \le y log ( 1 + y ) ≤ y , therefore yields
log E e b L ≤ − b S ( x ∣ U ) ρ + C b 2 ℓ 2 , ∣ b ∣ ℓ ≤ c . (43) \log\mathbb{E}e^{bL} \le-bS(x|U)_\rho+ Cb^2\ell^2,\qquad|b|\ell\le c. \tag*{(43)} log E e b L ≤ − b S ( x ∣ U ) ρ + C b 2 ℓ 2 , ∣ b ∣ ℓ ≤ c . (43)
These constants are independent of dim U \dim U dim U .
A useful consequence is a conditional Schatten estimate. For 0 < a < 1 / 4 0 < a < 1/4 0 < a < 1/4 , put
K = Q − a ρ Q − a , r = ( 1 − 2 a ) − 1 , Z = ( Tr K r ) 1 / r . K = Q^{-a}\rho Q^{-a},\qquad r = (1-2a)^{-1},\qquad Z = (\operatorname{Tr}K^r)^{1/r}. K = Q − a ρ Q − a , r = ( 1 − 2 a ) − 1 , Z = ( Tr K r ) 1/ r .
Then, after reducing the universal c c c if necessary,
log Z ≤ − 2 a S ( x ∣ U ) ρ + C a 2 ℓ 2 , a ℓ ≤ c . \log Z \le-2aS(x|U)_\rho+ Ca^2\ell^2,\qquad a\ell\le c. log Z ≤ − 2 a S ( x ∣ U ) ρ + C a 2 ℓ 2 , a ℓ ≤ c .
Indeed interpolate ρ [ z / 2 ] Q − a z \rho^{[z/2]}Q^{-az} ρ [ z /2 ] Q − a z between operator norm at ℜ z = 0 \Re z=0 ℜ z = 0 and Hilbert–Schmidt norm at ℜ z = r \Re z=r ℜ z = r . The first bound is one, and the square of the second is
Tr ρ r Q − 2 a r = E e ( r − 1 ) L . \operatorname{Tr}\rho^rQ^{-2ar}=\mathbb{E}e^{(r-1)L}. Tr ρ r Q − 2 a r = E e ( r − 1 ) L .
The resulting bound at z = 1 z=1 z = 1 is
Z = ∥ ρ 1 / 2 Q − a ∥ 2 r 2 ≤ ( E e ( r − 1 ) L ) 1 / r . Z=\lVert\rho^{1/2}Q^{-a}\rVert_{2r}^2\le\left(\mathbb{E}e^{(r-1)L}\right)^{1/r}. Z = ∥ ρ 1/2 Q − a ∥ 2 r 2 ≤ ( E e ( r − 1 ) L ) 1/ r .
One can obtain this interpolation directly from scalar three-lines: for a matrix B = V ∣ B ∣ B=V|B| B = V ∣ B ∣ with ∥ B ∥ ( 2 r ) ′ = 1 \lVert B\rVert_{(2r)'}=1 ∥ B ∥ ( 2 r ) ′ = 1 , pair the analytic matrix with ∣ B ∣ ( 2 r ) ′ ( 1 − z / ( 2 r ) ) V ∗ |B|^{(2r)'(1-z/(2r))}V^* ∣ B ∣ ( 2 r ) ′ ( 1 − z / ( 2 r )) V ∗ in the trace. This test has trace norm one on the first boundary and Hilbert–Schmidt norm one on the second; at z = 1 z=1 z = 1 it is B ∗ B^* B ∗ . Noninvertible test matrices follow by approximation. Now use r − 1 = 2 a r r-1=2ar r − 1 = 2 a r in (43) to prove (5.3) .
Moving a subsystem
Lemma 5.1 (Conditional movement estimate). Let θ \theta θ be a unit pure vector on four finite-dimensional systems P P P , x x x , U U U , F F F , and let ρ D \rho_D ρ D denote its marginal on D D D . Set
d = dim x , ℓ = log ( e d ) , η = S ( x ∣ P ) θ + S ( x ∣ U ) θ = I ( x : F ∣ U ) θ = I ( x : F ∣ P ) θ . d=\dim x,\qquad\ell=\log(ed),\qquad\eta=S(x|P)_\theta+S(x|U)_\theta=I(x:F|U)_\theta=I(x:F|P)_\theta. d = dim x , ℓ = log ( e d ) , η = S ( x ∣ P ) θ + S ( x ∣ U ) θ = I ( x : F ∣ U ) θ = I ( x : F ∣ P ) θ .
There are universal constants c , C > 0 c,C>0 c , C > 0 such that, for 0 < a ℓ ≤ c 0<a\ell\le c 0 < a ℓ ≤ c and arbitrary density matrices σ \sigma σ on x P xP x P and τ \tau τ on x U xU xU ,
∥ σ a / 2 ρ ^ P − a / 2 τ a / 2 ρ ^ U − a / 2 θ ∥ ≤ exp ( − a 2 η + C a 5 / 4 ℓ 2 ) . (44) \left\|\sigma^{a/2}\widehat{\rho}_P^{-a/2}\tau^{a/2}\widehat{\rho}_U^{-a/2}\theta\right\|\le\exp\left(-\frac{a}{2}\eta+Ca^{5/4}\ell^2\right). \tag*{(44)} σ a /2 ρ P − a /2 τ a /2 ρ U − a /2 θ ≤ exp ( − 2 a η + C a 5/4 ℓ 2 ) . (44)
The same bound holds for positive subnormalized σ , τ \sigma,\tau σ , τ .
Proof. Purity and strong subadditivity give the displayed identities and η ≥ 0 \eta\ge0 η ≥ 0 . It suffices initially to take σ , τ \sigma,\tau σ , τ faithful. Write d U = S ( x ∣ U ) θ d_U=S(x|U)_\theta d U = S ( x ∣ U ) θ and d P = S ( x ∣ P ) θ d_P=S(x|P)_\theta d P = S ( x ∣ P ) θ . Consider
G ( z ) = σ a z ρ ^ P − a z τ a ( 1 − z ) ρ ^ U − a ( 1 − z ) θ , 0 ≤ ℜ z ≤ 1. G(z)=\sigma^{az}\widehat{\rho}_P^{-az}\tau^{a(1-z)}\widehat{\rho}_U^{-a(1-z)}\theta,\qquad0\le\Re z\le1. G ( z ) = σ a z ρ P − a z τ a ( 1 − z ) ρ U − a ( 1 − z ) θ , 0 ≤ ℜ z ≤ 1.
The midpoint is the vector in (44) . All imaginary powers here are unitary. In particular G G G is bounded on this strip, with bounds allowed at this intermediate step to depend on its fixed invertible factors.
On the left boundary, discard the leftmost unitary factors and move the remaining imaginary powers past the commuting real powers. With ρ = ρ X U \rho=\rho_{XU} ρ = ρ X U , Q = I X ⊗ ρ ^ U Q=I_X\otimes\hat{\rho}_U Q = I X ⊗ ρ ^ U , and τ u = Q − i a u τ Q i a u \tau_u=Q^{-iau}\tau Q^{iau} τ u = Q − ia u τ Q ia u , this gives
∥ G ( i u ) ∥ = M ( u ) : = ∥ τ u a Q − a ∥ . \lVert G(iu)\rVert=M(u):=\lVert\tau_u^aQ^{-a}\rVert. ∥ G ( i u )∥ = M ( u ) := ∥ τ u a Q − a ∥ .
Hölder’s inequality and (5.3) imply
M ( u ) 2 = Tr τ u 2 a K ≤ Z , log Z ≤ − 2 a d U + C a 2 ℓ 2 . M(u)^2=\operatorname{Tr}\tau_u^{2a}K\le Z,\qquad\log Z\le-2ad_U+Ca^2\ell^2. M ( u ) 2 = Tr τ u 2 a K ≤ Z , log Z ≤ − 2 a d U + C a 2 ℓ 2 .
We retain the slack in this bound: a large slack already improves the left boundary, while a small slack will control the distance from the right-boundary input to θ \theta θ . Choose a universal C 0 C_0 C 0 larger than half the constant in this last bound and set
λ ( u ) = − a d U + C 0 a 2 ℓ 2 − log M ( u ) ≥ 0 , ξ = K r Tr K r . (45) \lambda(u)=-ad_U+C_0a^2\ell^2-\log M(u)\ge0,\qquad\xi=\frac{K^r}{\operatorname{Tr}K^r}. \tag*{(45)} λ ( u ) = − a d U + C 0 a 2 ℓ 2 − log M ( u ) ≥ 0 , ξ = Tr K r K r . (45)
The normalized Hölder overlap then satisfies
Tr τ u 2 a ξ 1 − 2 a = M ( u ) 2 / Z ≥ e − 2 λ ( u ) . (46) \operatorname{Tr}\tau_u^{2a}\xi^{1-2a}=M(u)^2/Z\ge e^{-2\lambda(u)}. \tag*{(46)} Tr τ u 2 a ξ 1 − 2 a = M ( u ) 2 / Z ≥ e − 2 λ ( u ) . (46)
We need to relate this overlap to ρ \rho ρ , independently of the smallest eigenvalues of either marginal. Taking ρ \rho ρ in place of τ u \tau_u τ u for this comparison gives
∥ ρ a Q − a θ ∥ ≥ ⟨ θ , ρ a Q − a θ ⟩ = Tr ρ 1 + a Q − a = E e a L ≥ e − a d U . \lVert\rho^aQ^{-a}\theta\rVert\ge\langle\theta,\rho^aQ^{-a}\theta\rangle=\operatorname{Tr}\rho^{1+a}Q^{-a}=\mathbb{E}e^{aL}\ge e^{-ad_U}. ∥ ρ a Q − a θ ∥ ≥ ⟨ θ , ρ a Q − a θ ⟩ = Tr ρ 1 + a Q − a = E e a L ≥ e − a d U .
The trace is real and nonnegative. Thus 1 − Tr ρ 2 a ξ 1 − 2 a ≤ C a 2 ℓ 2 1-\operatorname{Tr}\rho^{2a}\xi^{1-2a}\le Ca^2\ell^2 1 − Tr ρ 2 a ξ 1 − 2 a ≤ C a 2 ℓ 2 . The function b ↦ 1 − Tr ρ b ξ 1 − b b\mapsto1-\operatorname{Tr}\rho^b\xi^{1-b} b ↦ 1 − Tr ρ b ξ 1 − b is nonnegative and concave on [ 0 , 1 ] [0,1] [ 0 , 1 ] : expand in their two eigenbases for concavity, and use Hölder for nonnegativity. For 2 a ≤ 1 / 2 2a\le1/2 2 a ≤ 1/2 , concavity and its nonnegative value at zero give
1 − Tr ρ ξ ≤ 1 − Tr ρ 2 a ξ 1 − 2 a 4 a . 1-\operatorname{Tr}\sqrt{\rho}\sqrt{\xi}\le\frac{1-\operatorname{Tr}\rho^{2a}\xi^{1-2a}}{4a}. 1 − Tr ρ ξ ≤ 4 a 1 − Tr ρ 2 a ξ 1 − 2 a .
Consequently
H : = ∥ ρ − ξ ∥ 2 ≤ C a ℓ . (47) H:=\lVert\sqrt{\rho}-\sqrt{\xi}\rVert_2\le C\sqrt{a}\ell. \tag*{(47)} H := ∥ ρ − ξ ∥ 2 ≤ C a ℓ . (47)
We next show how the slack in (45) controls the state arriving at the opposite boundary. Define
θ u = τ − i a u Q i a u θ = Q i a u τ u − i a u θ . \theta_u=\tau^{-iau}Q^{iau}\theta=Q^{iau}\tau_u^{-iau}\theta. θ u = τ − ia u Q ia u θ = Q ia u τ u − ia u θ .
This is a unit vector with the same P P P marginal as θ \theta θ . We claim
∥ θ u − θ ∥ ≤ C ( 1 + ∣ u ∣ ) ( λ ( u ) + a ℓ ) . (48) \lVert\theta_u-\theta\rVert\le C(1+|u|)\left(\sqrt{\lambda(u)}+\sqrt{a}\ell\right). \tag*{(48)} ∥ θ u − θ ∥ ≤ C ( 1 + ∣ u ∣ ) ( λ ( u ) + a ℓ ) . (48)
Here and in the verification all kernel phases are extended by one. First,
∥ ( Q − i a u − ρ ^ − i a u ) θ ∥ 2 ≤ a 2 u 2 E L 2 ≤ C a 2 u 2 ℓ 2 . \lVert(Q^{-iau}-\hat{\rho}^{-iau})\theta\rVert^2\le a^2u^2\mathbb{E}L^2\le Ca^2u^2\ell^2. ∥( Q − ia u − ρ ^ − ia u ) θ ∥ 2 ≤ a 2 u 2 E L 2 ≤ C a 2 u 2 ℓ 2 .
For the remaining comparison of τ u \tau_u τ u and ρ \rho ρ insert the phase of ξ \xi ξ . For any densities A , B A,B A , B and real b b b ,
∥ ( A ^ i b − B ^ i b ) B ∥ 2 ≤ C ( 1 + ∣ b ∣ ) ∥ A − B ∥ 2 . (49) \lVert(\hat{A}^{ib}-\hat{B}^{ib})\sqrt{B}\rVert_2\le C(1+|b|)\lVert\sqrt{A}-\sqrt{B}\rVert_2. \tag*{(49)} ∥( A ^ ib − B ^ ib ) B ∥ 2 ≤ C ( 1 + ∣ b ∣ ) ∥ A − B ∥ 2 . (49)
To check this, expand in their two spectral bases. For positive eigenvalues with ratio v v v , use ∣ 1 − v i b ∣ ≤ C ( 1 + ∣ b ∣ ) ∣ 1 − v ∣ |1-v^{ib}|\le C(1+|b|)|1-\sqrt{v}| ∣1 − v ib ∣ ≤ C ( 1 + ∣ b ∣ ) ∣1 − v ∣ . This follows from the mean-value theorem when 1 / 4 ≤ v ≤ 4 1/4\le v\le4 1/4 ≤ v ≤ 4 , and the bound two outside that interval. At a zero eigenvalue of A A A the same assertion follows from the bound two and ∣ 1 − 0 ∣ = 1 |1-\sqrt{0}|=1 ∣1 − 0 ∣ = 1 ; zero eigenvalues of B B B contribute nothing to the left side.
Replacing ρ \sqrt{\rho} ρ by ξ \sqrt{\xi} ξ in the τ u , ξ \tau_u,\xi τ u , ξ phase difference costs at most 2 H 2H 2 H . On ξ \sqrt{\xi} ξ , give a pair of eigenvalues p p p of ξ \xi ξ and q q q of τ u \tau_u τ u the probability p ∣ ⟨ p , q ⟩ ∣ 2 p|\langle p,q\rangle|^2 p ∣ ⟨ p , q ⟩ ∣ 2 and put v = log ( q / p ) v=\log(q/p) v = log ( q / p ) . Faithfulness of τ u \tau_u τ u makes this finite, and
E e v ≤ 1 , E e 2 a v ≥ e − 2 λ ( u ) \mathbb{E}e^v\le1,\qquad\mathbb{E}e^{2av}\ge e^{-2\lambda(u)} E e v ≤ 1 , E e 2 a v ≥ e − 2 λ ( u )
by (46) . On v ≤ 0 v\le0 v ≤ 0 ,
∣ 1 − e − i a u v ∣ 2 ≤ C ( 1 + u 2 ) ( 1 − e 2 a v ) , |1-e^{-iauv}|^2\le C(1+u^2)(1-e^{2av}), ∣1 − e − ia uv ∣ 2 ≤ C ( 1 + u 2 ) ( 1 − e 2 a v ) ,
and
E [ ( 1 − e 2 a v ) 1 v ≤ 0 ] ≤ 1 − e − 2 λ ( u ) + E [ ( e 2 a v − 1 ) 1 v > 0 ] ≤ 2 λ ( u ) + 2 a . \mathbb{E}[(1-e^{2av})1_{v\le0}]\le1-e^{-2\lambda(u)}+\mathbb{E}[(e^{2av}-1)1_{v>0}]\le2\lambda(u)+2a. E [( 1 − e 2 a v ) 1 v ≤ 0 ] ≤ 1 − e − 2 λ ( u ) + E [( e 2 a v − 1 ) 1 v > 0 ] ≤ 2 λ ( u ) + 2 a .
The last step uses e 2 a v − 1 ≤ 2 a ( e v − 1 ) e^{2av}-1\le2a(e^v-1) e 2 a v − 1 ≤ 2 a ( e v − 1 ) for v > 0 v>0 v > 0 . On v > 0 v>0 v > 0 the squared phase difference is at most C a 2 u 2 e v Ca^2u^2e^v C a 2 u 2 e v . These estimates, followed by (49) for ξ , ρ \xi,\rho ξ , ρ and (47) , prove (48) .
The phase comparison now lets us recover the other conditional entropy. On the right boundary, the remaining P P P phases merely conjugate σ \sigma σ . Apply (5.3) and Hölder on x P xP x P to the input θ u \theta_u θ u , whose P P P marginal is unchanged. It follows that
log ∥ G ( 1 + i u ) ∥ ≤ − a S ( x ∣ P ) θ u + C a 2 ℓ 2 . \log\|G(1+iu)\|\le-aS(x|P)_{\theta_u}+Ca^2\ell^2. log ∥ G ( 1 + i u ) ∥ ≤ − a S ( x ∣ P ) θ u + C a 2 ℓ 2 .
The continuity bound for conditional entropy in Lemma 2.1, using only dim x \dim x dim x , and (48) now give
log ∥ G ( 1 + i u ) ∥ ≤ − a d P + C a 2 ℓ 2 + C a ℓ ( 1 + ∣ u ∣ ) 1 / 2 ( λ ( u ) 1 / 4 + a 1 / 4 ℓ 1 / 2 ) . \log\|G(1+iu)\|\le-ad_P+Ca^2\ell^2
+Ca\ell(1+|u|)^{1/2}\bigl(\lambda(u)^{1/4}+a^{1/4}\ell^{1/2}\bigr). log ∥ G ( 1 + i u ) ∥ ≤ − a d P + C a 2 ℓ 2 + C a ℓ ( 1 + ∣ u ∣ ) 1/2 ( λ ( u ) 1/4 + a 1/4 ℓ 1/2 ) .
On the left boundary the bound is exactly − a d U + C 0 a 2 ℓ 2 − λ ( u ) -ad_U+C_0a^2\ell^2-\lambda(u) − a d U + C 0 a 2 ℓ 2 − λ ( u ) .
For clarity, the logarithmic interpolation used here assigns density
d u 2 cosh ( π u ) \frac{du}{2\cosh(\pi u)} 2 cosh ( π u ) d u
to each boundary line when evaluated at the midpoint. Each line has total mass 1 / 2 1/2 1/2 . This follows by mapping the strip to the upper half-plane by z ↦ e π i z z\mapsto e^{\pi iz} z ↦ e π i z and using harmonic measure at i i i . Applied to the logarithm of a scalar analytic function it follows from the submean inequality, first on bounded domains and then by a limit. Pairing G G G with a unit vector in its midpoint direction gives the vector-norm assertion. All boundary norms above are bounded above and away from zero for the fixed faithful factors, so this application and the limit are legitimate.
Pair the two boundary estimates at the same u u u . Young’s inequality gives
− λ + C a ℓ ( 1 + ∣ u ∣ ) 1 / 2 λ 1 / 4 ≤ C ( a ℓ ( 1 + ∣ u ∣ ) 1 / 2 ) 4 / 3 . -\lambda+Ca\ell(1+|u|)^{1/2}\lambda^{1/4}\le C\bigl(a\ell(1+|u|)^{1/2}\bigr)^{4/3}. − λ + C a ℓ ( 1 + ∣ u ∣ ) 1/2 λ 1/4 ≤ C ( a ℓ ( 1 + ∣ u ∣ ) 1/2 ) 4/3 .
After integration, this term, the quadratic errors, and the remaining a 5 / 4 ℓ 3 / 2 a^{5/4}\ell^{3/2} a 5/4 ℓ 3/2 term are all at most C a 5 / 4 ℓ 2 Ca^{5/4}\ell^2 C a 5/4 ℓ 2 . The entropy contribution is − a ( d P + d U ) / 2 -a(d_P+d_U)/2 − a ( d P + d U ) /2 , proving (44) for faithful σ , τ \sigma,\tau σ , τ . Approximation by faithful densities removes that restriction by continuity of positive powers. Finally normalizing subdensities only increases the left side; the zero subdensity case is immediate.
Comparing marginal phases
To prove the local conjugation estimate, we first control a change in products of marginal imaginary powers by conditional mutual information. For faithful states, Petz’s equality theorem characterizes preservation of relative entropy under restriction to a subalgebra by equality of the corresponding products of imaginary powers [33 ] . The comparison below gives the quantitative estimate needed here, with constants controlled by dim x x x .
Lemma 5.2 (Marginal-phase comparison). Let θ \theta θ be a unit pure vector on finite-dimensional systems P , x , U , F P,x,U,F P , x , U , F , write ρ D \rho_D ρ D for its marginals, and put d = dim x d=\dim x d = dim x and η = I ( x : F ∣ U ) θ \eta=I(x:F|U)_\theta η = I ( x : F ∣ U ) θ . For η > 0 \eta>0 η > 0 define
y = min ( 1 , η ) , R η = y + η log ( e d / y ) , y=\min(1,\eta),\qquad\mathcal{R}_\eta=\sqrt{y}+\sqrt{\eta\log(ed/y)}, y = min ( 1 , η ) , R η = y + η log ( e d / y ) ,
and set R 0 = 0 \mathcal{R}_0=0 R 0 = 0 . There is a universal constant C > 0 C>0 C > 0 such that, for every u ∈ R u\in\mathbb{R} u ∈ R ,
∥ ( ρ ^ U − i u ρ ^ x U i u − ρ ^ U F − i u ρ ^ x U F i u ) θ ∥ ≤ C ∣ sinh ( π u ) ∣ R η . (50) \left\|\left(\widehat{\rho}_U^{-iu}\widehat{\rho}_{xU}^{iu}-\widehat{\rho}_{UF}^{-iu}\widehat{\rho}_{xUF}^{iu}\right)\theta\right\|\leq C|\sinh(\pi u)|\mathcal{R}_\eta. \tag*{(50)} ( ρ U − i u ρ xU i u − ρ U F − i u ρ xU F i u ) θ ≤ C ∣ sinh ( π u ) ∣ R η . (50)
In particular the two phase products agree on θ \theta θ if η = 0 \eta=0 η = 0 . The constants do not depend on dim P \dim P dim P , dim U \dim U dim U , or dim F \dim F dim F .
Proof. The proof writes η \eta η as the integral of a nonnegative resolvent defect. Two moment bounds, involving only d d d , control the ends of the integral; the entropy controls the part between them. Initially let ρ f = ρ x U F \rho_f=\rho_{xUF} ρ f = ρ xU F be faithful, and put
σ f = I x / d ⊗ ρ U F , ρ s = ρ x U , σ s = I x / d ⊗ ρ U , d = dim x . \sigma_f=I_x/d\otimes\rho_{UF},\qquad\rho_s=\rho_{xU},\qquad\sigma_s=I_x/d\otimes\rho_U,\qquad d=\dim x. σ f = I x / d ⊗ ρ U F , ρ s = ρ xU , σ s = I x / d ⊗ ρ U , d = dim x .
On their Hilbert–Schmidt matrix spaces define positive definite operators
A = L σ f R ρ f − 1 , B = L σ s R ρ s − 1 , A=L_{\sigma_f}R_{\rho_f}^{-1},\qquad B=L_{\sigma_s}R_{\rho_s}^{-1}, A = L σ f R ρ f − 1 , B = L σ s R ρ s − 1 ,
where L L L and R R R denote left and right multiplication. Define the isometry
V ( X ρ s ) = ( X ⊗ I F ) ρ f . V(X\sqrt{\rho_s})=(X\otimes I_F)\sqrt{\rho_f}. V ( X ρ s ) = ( X ⊗ I F ) ρ f .
It is an isometry by taking the partial trace of ρ f \rho_f ρ f . Taking matrix elements in the same way with σ f \sigma_f σ f shows V ∗ A V = B V^*AV=B V ∗ A V = B : both sides have the form Tr X ∗ σ s Y \operatorname{Tr}X^*\sigma_sY Tr X ∗ σ s Y . Put b 0 = ρ s b_0=\sqrt{\rho_s} b 0 = ρ s and a 0 = V b 0 = ρ f a_0=Vb_0=\sqrt{\rho_f} a 0 = V b 0 = ρ f . For v > 0 v>0 v > 0 , let
δ v = ( A + v I ) − 1 a 0 − V ( B + v I ) − 1 b 0 . \delta_v=(A+vI)^{-1}a_0-V(B+vI)^{-1}b_0. δ v = ( A + v I ) − 1 a 0 − V ( B + v I ) − 1 b 0 .
Expansion of its weighted squared norm, using V ∗ ( A + v I ) V = B + v I V^*(A+vI)V=B+vI V ∗ ( A + v I ) V = B + v I , gives the resolvent compression identity [14 ] :
∥ ( A + v I ) 1 / 2 δ v ∥ 2 2 = ⟨ a 0 , ( A + v I ) − 1 a 0 ⟩ − ⟨ b 0 , ( B + v I ) − 1 b 0 ⟩ = : h ( v ) ≥ 0. (51) \left\|(A+vI)^{1/2}\delta_v\right\|_2^2
=\langle a_0,(A+vI)^{-1}a_0\rangle-\langle b_0,(B+vI)^{-1}b_0\rangle=:h(v)\geq0. \tag*{(51)} ( A + v I ) 1/2 δ v 2 2 = ⟨ a 0 , ( A + v I ) − 1 a 0 ⟩ − ⟨ b 0 , ( B + v I ) − 1 b 0 ⟩ =: h ( v ) ≥ 0. (51)
The logarithmic resolvent formula gives
∫ 0 ∞ h ( v ) d v = D ( ρ f ∥ σ f ) − D ( ρ s ∥ σ s ) = η , (52) \int_0^\infty h(v)\,dv=D(\rho_f\Vert\sigma_f)-D(\rho_s\Vert\sigma_s)=\eta, \tag*{(52)} ∫ 0 ∞ h ( v ) d v = D ( ρ f ∥ σ f ) − D ( ρ s ∥ σ s ) = η , (52)
where D ( ρ ∥ σ ) = Tr ρ ( log ρ − log σ ) D(\rho\Vert\sigma)=\operatorname{Tr}\rho(\log\rho-\log\sigma) D ( ρ ∥ σ ) = Tr ρ ( log ρ − log σ ) . Indeed − ⟨ ρ , log ( L σ R ρ − 1 ) ρ ⟩ = D ( ρ ∥ σ ) -\langle\sqrt{\rho},\log(L_\sigma R_\rho^{-1})\sqrt{\rho}\rangle=D(\rho\Vert\sigma) − ⟨ ρ , log ( L σ R ρ − 1 ) ρ ⟩ = D ( ρ ∥ σ ) , and the identity terms in the log integral cancel. The last equality in (52) follows by expanding the four entropies. The local domination proved in (42) now reads ρ f ≤ d 2 σ f \rho_f\leq d^2\sigma_f ρ f ≤ d 2 σ f . Therefore
⟨ a 0 , A − 1 a 0 ⟩ = Tr ρ f 2 σ f − 1 ≤ d 2 , ⟨ b 0 , B b 0 ⟩ = Tr σ s = 1. \langle a_0,A^{-1}a_0\rangle=\operatorname{Tr}\rho_f^2\sigma_f^{-1}\leq d^2,\qquad\langle b_0,Bb_0\rangle=\operatorname{Tr}\sigma_s=1. ⟨ a 0 , A − 1 a 0 ⟩ = Tr ρ f 2 σ f − 1 ≤ d 2 , ⟨ b 0 , B b 0 ⟩ = Tr σ s = 1.
The first resolvent quadratic form in (51) is therefore at most d 2 d^{2} d 2 . For another bound use ( A + v I ) − 1 ≤ v − 1 I (A+vI)^{-1}\le v^{-1}I ( A + v I ) − 1 ≤ v − 1 I and ( B + v I ) − 1 ≥ v − 1 I − v − 2 B (B+vI)^{-1}\ge v^{-1}I-v^{-2}B ( B + v I ) − 1 ≥ v − 1 I − v − 2 B . We obtain
0 ≤ h ( v ) ≤ min ( d 2 , v − 2 ) , ∥ δ v ∥ 2 ≤ h ( v ) / v . (53) 0\le h(v)\le\min(d^{2},v^{-2}),\qquad\lVert\delta_v\rVert_{2}\le\sqrt{h(v)}/v. \tag*{(53)} 0 ≤ h ( v ) ≤ min ( d 2 , v − 2 ) , ∥ δ v ∥ 2 ≤ h ( v ) / v . (53)
For − 1 < Re z < 0 -1<\operatorname{Re}z<0 − 1 < Re z < 0 , scalar integration and spectral calculus give
A z a 0 − V B z b 0 = − sin π z π ∫ 0 ∞ v z δ v d v . A^{z}a_{0}-VB^{z}b_{0}=-\frac{\sin\pi z}{\pi}\int_{0}^{\infty}v^{z}\delta_v\,\mathrm{d}v. A z a 0 − V B z b 0 = − π sin π z ∫ 0 ∞ v z δ v d v .
One may approach z = − i u z=-iu z = − i u from − 1 / 4 ≤ Re z < 0 -1/4\le\operatorname{Re}z<0 − 1/4 ≤ Re z < 0 under this integral: (53) gives an integrable majorant d v − 3 / 4 d v^{-3/4} d v − 3/4 near zero and v − 3 / 2 v^{-3/2} v − 3/2 near infinity. Hence
∥ A − i u a 0 − V B − i u b 0 ∥ 2 ≤ C ∣ sinh π u ∣ ∫ 0 ∞ h ( v ) / v d v . \lVert A^{-iu}a_{0}-VB^{-iu}b_{0}\rVert_{2}\le C\lvert\sinh\pi u\rvert\int_{0}^{\infty}\sqrt{h(v)}/v\,\mathrm{d}v. ∥ A − i u a 0 − V B − i u b 0 ∥ 2 ≤ C ∣ sinh π u ∣ ∫ 0 ∞ h ( v ) / v d v .
For η > 0 \eta>0 η > 0 , split the integral at y / d 2 y/d^{2} y / d 2 and 1 / y 1/y 1/ y . The two ends cost at most C y C\sqrt{y} C y by (53) ; Cauchy–Schwarz and (52) bound the middle by
( ∫ h ( v ) d v ) 1 / 2 ( ∫ y / d 2 1 / y d v v ) 1 / 2 ≤ C η log ( e d / y ) . \left(\int h(v)\,\mathrm{d}v\right)^{1/2}\left(\int_{y/d^{2}}^{1/y}\frac{\mathrm{d}v}{v}\right)^{1/2}\le C\sqrt{\eta\log(ed/y)}. ( ∫ h ( v ) d v ) 1/2 ( ∫ y / d 2 1/ y v d v ) 1/2 ≤ C η log ( e d / y ) .
If η = 0 \eta=0 η = 0 , nonnegativity and continuity imply h ( v ) = 0 h(v)=0 h ( v ) = 0 for all v > 0 v>0 v > 0 , so the discrepancy is zero. To identify the resulting vectors, use the definition of V V V :
A − i u a 0 = σ f − i u ρ f i u ρ f , A^{-iu}a_{0}=\sigma_{f}^{-iu}\rho_{f}^{iu}\sqrt{\rho_{f}}, A − i u a 0 = σ f − i u ρ f i u ρ f ,
V B − i u b 0 = ( σ s − i u ρ s i u ⊗ I F ) ρ f . VB^{-iu}b_{0}=(\sigma_{s}^{-iu}\rho_{s}^{iu}\otimes I_{F})\sqrt{\rho_{f}}. V B − i u b 0 = ( σ s − i u ρ s i u ⊗ I F ) ρ f .
After cancelling the common scalar phase d i u d^{iu} d i u and reversing the sign of the difference, its Hilbert–Schmidt norm is
∥ ( ρ ^ U − i u ρ ^ x U i u − ρ ^ U F − i u ρ ^ x U F i u ) ρ f ∥ 2 . \left\lVert\left(\widehat{\rho}_{U}^{-iu}\widehat{\rho}_{xU}^{iu}-\widehat{\rho}_{UF}^{-iu}\widehat{\rho}_{xUF}^{iu}\right)\sqrt{\rho_{f}}\right\rVert_{2}. ( ρ U − i u ρ xU i u − ρ U F − i u ρ xU F i u ) ρ f 2 .
For any operator T T T on x U F xUF xU F one has ∥ T θ ∥ = ∥ T ρ f ∥ 2 \lVert T\theta\rVert=\lVert T\sqrt{\rho_{f}}\rVert_{2} ∥ T θ ∥ = ∥ T ρ f ∥ 2 . This proves (50) in the faithful case.
For a possibly singular ρ f \rho_f ρ f , replace it by ( 1 − ϵ ) ρ f + ϵ I / dim ( x U F ) (1-\epsilon)\rho_f+\epsilon I/\dim(xUF) ( 1 − ϵ ) ρ f + ϵ I / dim ( xU F ) and use its reductions in the preceding proof. Conditional mutual information converges in finite dimension. The phase products on the square root converge in Hilbert–Schmidt norm in the required order. For example, the innermost lifted phase of ρ x U , ϵ \rho_{xU,\epsilon} ρ xU , ϵ acts on ρ f , ϵ \sqrt{\rho_{f,\epsilon}} ρ f , ϵ . Its limit lies in supp ρ x U ⊗ F \operatorname{supp}\rho_{xU}\otimes F supp ρ xU ⊗ F , because supp ρ f ⊆ supp ρ x U ⊗ F \operatorname{supp}\rho_f\subseteq\operatorname{supp}\rho_{xU}\otimes F supp ρ f ⊆ supp ρ xU ⊗ F and the square-root mass outside this space tends to zero. On this space the inner phase converges, since the mollified marginal commutes with its limit. Its output lies in x ⊗ supp ρ U ⊗ F x\otimes\operatorname{supp}\rho_U\otimes F x ⊗ supp ρ U ⊗ F , so the outer ρ U , ϵ \rho_{U,\epsilon} ρ U , ϵ phase also converges there. The same argument applies to the x U F , U F xUF,UF xU F , U F pair. All phases have norm one, which controls the vanishing complementary pieces. Thus the limit is the product of support phases, equivalently the unitary extensions appearing in (50) . No operator-norm convergence of phases on a limiting kernel is being used. The faithful proof was on Hilbert–Schmidt spaces, so it also applies when a faithful approximation would require a larger purifying system than P P P . This establishes (50) in full generality.
A local conjugation estimate
We now combine the marginal-phase comparison with an analytic strip bound for a local positive operator. This converts the phase control into the real-power estimate used in the replica argument.
Lemma 5.3 (Conditional skew estimate). Let θ \theta θ be a unit pure vector on P , x , U , F P,x,U,F P , x , U , F , put Y = x U Y=xU Y = xU , and write ρ D \rho_D ρ D for its marginals. Suppose P = P 0 P 1 P=P_0P_1 P = P 0 P 1 and that 0 ≤ h ≤ I 0\le h\le I 0 ≤ h ≤ I is supported on P 0 x P_0x P 0 x . Set
d h = ( dim P 0 ) ( dim x ) , ℓ h = log ( e d h ) , η = I ( x : F ∣ U ) θ = I ( x : F ∣ P ) θ . d_h=(\dim P_0)(\dim x),\qquad\ell_h=\log(ed_h),\qquad\eta=I(x:F|U)_\theta=I(x:F|P)_\theta. d h = ( dim P 0 ) ( dim x ) , ℓ h = log ( e d h ) , η = I ( x : F ∣ U ) θ = I ( x : F ∣ P ) θ .
Define the entire scalar function
f ( z ) = ⟨ θ , ρ P [ z ] ρ Y [ − z ] h ρ P [ − z ] ρ Y [ z ] θ ⟩ . f(z)=\langle\theta,\rho_P^{[z]}\rho_Y^{[-z]}h\rho_P^{[-z]}\rho_Y^{[z]}\theta\rangle. f ( z ) = ⟨ θ , ρ P [ z ] ρ Y [ − z ] h ρ P [ − z ] ρ Y [ z ] θ ⟩ .
There are universal constants c , C > 0 c,C>0 c , C > 0 such that for 0 < a ℓ h ≤ c 0<a\ell_h\le c 0 < a ℓ h ≤ c and t = a / 2 t=a/2 t = a /2 ,
∣ f ( t ) ∣ − ℜ f ( t ) ≤ C a 2 ℓ h 2 η 1 / 8 . (54) |f(t)|-\Re f(t)\le Ca^2\ell_h^2\eta^{1/8}. \tag*{(54)} ∣ f ( t ) ∣ − ℜ f ( t ) ≤ C a 2 ℓ h 2 η 1/8 . (54)
In particular the left side is zero if η = 0 \eta=0 η = 0 .
Proof. Put p = ⟨ θ , h θ ⟩ ∈ [ 0 , 1 ] p=\langle\theta,h\theta\rangle\in[0,1] p = ⟨ θ , h θ ⟩ ∈ [ 0 , 1 ] , so f ( 0 ) = p f(0)=p f ( 0 ) = p . We first bound f f f on a strip using the support dimension of h h h , then compare its imaginary-axis values with p p p , and finally estimate its real-axis deviation from [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) . Expand h = ∑ c ⊗ d ′ h=\sum c\otimes d' h = ∑ c ⊗ d ′ across P 0 , x P_0,x P 0 , x using matrix units on P 0 P_0 P 0 . There are at most d h 2 d_h^2 d h 2 terms, with ∥ c ∥ ∥ d ′ ∥ ≤ 1 \|c\|\|d'\|\le1 ∥ c ∥∥ d ′ ∥ ≤ 1 for each. For 0 ≤ ℜ z ≤ 1 / 4 0\le\Re z\le1/4 0 ≤ ℜ z ≤ 1/4 the contribution is the inner product of
ρ Y [ z ‾ ] ( d ′ ) ∗ ρ Y [ − z ‾ ] θ and ρ P [ z ] c ρ P [ − z ] θ . \rho_Y^{[\overline z]}(d')^*\rho_Y^{[-\overline z]}\theta
\qquad\text{and}\qquad
\rho_P^{[z]}c\rho_P^{[-z]}\theta. ρ Y [ z ] ( d ′ ) ∗ ρ Y [ − z ] θ and ρ P [ z ] c ρ P [ − z ] θ .
Each norm is bounded by the norm of its local operator: for a marginal ρ \rho ρ and 0 ≤ ℜ z ≤ 1 / 2 0\le\Re z\le1/2 0 ≤ ℜ z ≤ 1/2 ,
∥ ρ [ z ] c ρ [ 1 / 2 − z ] ∥ 2 ≤ ∥ c ∥ \|\rho^{[z]}c\rho^{[1/2-z]}\|_2\le\|c\| ∥ ρ [ z ] c ρ [ 1/2 − z ] ∥ 2 ≤ ∥ c ∥
by Schatten Hölder. This is also valid at the endpoints using support powers. Reflection f ( − z ‾ ) = f ( z ) ‾ f(-\overline z)=\overline{f(z)} f ( − z ) = f ( z ) treats negative real parts. Thus ∣ f ( z ) ∣ ≤ d h 2 |f(z)|\le d_h^2 ∣ f ( z ) ∣ ≤ d h 2 on ∣ ℜ z ∣ ≤ 1 / 4 |\Re z|\le1/4 ∣ℜ z ∣ ≤ 1/4 . On the imaginary axis it is an expectation in a unit vector and has absolute value at most one. Three-lines on the two half-strips gives
∣ f ( z ) ∣ ≤ C ( ∣ ℜ z ∣ ≤ b ) , b = c 0 / ℓ h , |f(z)|\le C\qquad(|\Re z|\le b),\qquad b=c_0/\ell_h, ∣ f ( z ) ∣ ≤ C ( ∣ℜ z ∣ ≤ b ) , b = c 0 / ℓ h ,
for a sufficiently small universal c 0 > 0 c_0>0 c 0 > 0 .
On the imaginary axis Schmidt mirroring across P , Y F P,YF P , Y F gives
f ( i u ) = ⟨ w u , h w u ⟩ , w u = ρ ^ Y i u ρ ^ Y F − i u θ . f(iu)=\langle w_u,hw_u\rangle,\qquad w_u=\widehat{\rho}_Y^{iu}\widehat{\rho}_{YF}^{-iu}\theta. f ( i u ) = ⟨ w u , h w u ⟩ , w u = ρ Y i u ρ Y F − i u θ .
Compare this with w u 0 = ρ ^ U i u ρ ^ U F − i u θ w_u^0=\widehat{\rho}_U^{iu}\widehat{\rho}_{UF}^{-iu}\theta w u 0 = ρ U i u ρ U F − i u θ . The latter is a unitary acting only on U F UF U F , so ⟨ w u 0 , h w u 0 ⟩ = p \langle w_u^0,hw_u^0\rangle=p ⟨ w u 0 , h w u 0 ⟩ = p . Multiplication of both vectors first by ρ ^ P i u \widehat{\rho}_P^{iu} ρ P i u and then by ρ ^ U − i u \widehat{\rho}_U^{-iu} ρ U − i u , and a second use of Schmidt mirroring, show that
∥ w u − w u 0 ∥ = ∥ ( ρ ^ U − i u ρ ^ Y i u − ρ ^ U F − i u ρ ^ Y F i u ) θ ∥ . (55) \|w_u-w_u^0\|=\|(\widehat{\rho}_U^{-iu}\widehat{\rho}_Y^{iu}-\widehat{\rho}_{UF}^{-iu}\widehat{\rho}_{YF}^{iu})\theta\|. \tag*{(55)} ∥ w u − w u 0 ∥ = ∥ ( ρ U − i u ρ Y i u − ρ U F − i u ρ Y F i u ) θ ∥. (55)
Lemma 5.2 therefore gives ∥ w u − w u 0 ∥ ≤ C ∣ sinh ( π u ) ∣ R η \|w_u-w_u^0\|\le C|\sinh(\pi u)|R_\eta ∥ w u − w u 0 ∥ ≤ C ∣ sinh ( π u ) ∣ R η , where R η R_\eta R η is defined there with d = dim x d=\dim x d = dim x . It remains to pass from phases to the real-power skew. Positivity of h h h and the identity ⟨ w u 0 , h w u 0 ⟩ = p \langle w_u^0,hw_u^0\rangle=p ⟨ w u 0 , h w u 0 ⟩ = p imply
∣ f ( i u ) − p ∣ ≤ 2 p ∥ w u − w u 0 ∥ + ∥ w u − w u 0 ∥ 2 . |f(iu)-p|\le2\sqrt p\|w_u-w_u^0\|+\|w_u-w_u^0\|^2. ∣ f ( i u ) − p ∣ ≤ 2 p ∥ w u − w u 0 ∥ + ∥ w u − w u 0 ∥ 2 .
In particular, differentiating at zero and using (50) gives
f ′ ( 0 ) ∈ i R , ∣ f ′ ( 0 ) ∣ ≤ C p R η . (56) f'(0)\in i\mathbb{R},\qquad|f'(0)|\le C\sqrt p\,R_\eta. \tag*{(56)} f ′ ( 0 ) ∈ i R , ∣ f ′ ( 0 ) ∣ ≤ C p R η . (56)
The imaginary character also follows from f ( − z ‾ ) = f ( z ) ‾ f(-\overline z)=\overline{f(z)} f ( − z ) = f ( z ) . Set m = min ( 1 , R η ) m=\min(1,\mathcal{R}_{\eta}) m = min ( 1 , R η ) . The function F ( z ) = ( f ( z ) − p ) e z 2 F(z)=(f(z)-p)e^{z^{2}} F ( z ) = ( f ( z ) − p ) e z 2 has absolute value at most C m Cm C m on the imaginary axis: use (50) , the Gaussian factor e − u 2 e^{-u^{2}} e − u 2 , and also ∣ f ( i u ) − p ∣ ≤ 2 |f(iu)-p|\le2 ∣ f ( i u ) − p ∣ ≤ 2 . On the two outer lines ℜ z = ± b \Re z=\pm b ℜ z = ± b it is bounded by a universal constant by (5.15) . Three-lines on each half-strip therefore bounds ∣ F ∣ |F| ∣ F ∣ by C m 1 / 2 Cm^{1/2} C m 1/2 on ∣ ℜ z ∣ ≤ b / 2 |\Re z|\le b/2 ∣ℜ z ∣ ≤ b /2 . If m = 0 m=0 m = 0 , the identity theorem already gives f ≡ p f\equiv p f ≡ p . Otherwise Cauchy’s estimates on a circle of radius b / 2 b/2 b /2 centered at zero, applied also to the bounded factor e − z 2 e^{-z^{2}} e − z 2 on this circle, give
∣ f ( t ) − p − t f ′ ( 0 ) ∣ ≤ C ( t / b ) 2 m 1 / 2 , 0 ≤ t ≤ b / 8. |f(t)-p-tf'(0)|\le C(t/b)^2m^{1/2},\qquad0\le t\le b/8. ∣ f ( t ) − p − t f ′ ( 0 ) ∣ ≤ C ( t / b ) 2 m 1/2 , 0 ≤ t ≤ b /8.
Write f ′ ( 0 ) = i b 1 f'(0)=ib_1 f ′ ( 0 ) = i b 1 with b 1 ∈ R b_1\in\mathbb{R} b 1 ∈ R . If p > 0 p>0 p > 0 , then
∣ p + i t b 1 ∣ − p ≤ t 2 b 1 2 / p ≤ C t 2 R η 2 ; |p+itb_1|-p\le t^2b_1^2/p\le Ct^2\mathcal{R}_{\eta}^{2}; ∣ p + i t b 1 ∣ − p ≤ t 2 b 1 2 / p ≤ C t 2 R η 2 ;
if p = 0 p=0 p = 0 , (56) makes b 1 = 0 b_1=0 b 1 = 0 . Adding the remainder changes ∣ f ∣ − ℜ f |f|-\Re f ∣ f ∣ − ℜ f by at most twice its absolute value. Thus
∣ f ( t ) ∣ − ℜ f ( t ) ≤ C a 2 ( ℓ h 2 m 1 / 2 + R η 2 ) . |f(t)|-\Re f(t)\le Ca^2(\ell_h^2m^{1/2}+\mathcal{R}_{\eta}^{2}). ∣ f ( t ) ∣ − ℜ f ( t ) ≤ C a 2 ( ℓ h 2 m 1/2 + R η 2 ) .
Since d = dim x ≤ d h d=\dim x\le d_h d = dim x ≤ d h , the quantity supplied by Lemma 5.2 satisfies, for 0 < η ≤ 1 0<\eta\le1 0 < η ≤ 1 , R η ≤ C η log ( e d h / η ) \mathcal{R}_{\eta}\le C\sqrt{\eta}\log(ed_h/\eta) R η ≤ C η log ( e d h / η ) ; for η ≥ 1 \eta\ge1 η ≥ 1 , the bound η ≤ 2 log d ≤ 2 ℓ h \eta\le2\log d\le2\ell_h η ≤ 2 log d ≤ 2 ℓ h gives R η ≤ C ℓ h \mathcal{R}_{\eta}\le C\ell_h R η ≤ C ℓ h . These two cases imply
ℓ h 2 m 1 / 2 + R η 2 ≤ C ℓ h 4 η 1 / 8 , \ell_h^2m^{1/2}+\mathcal{R}_{\eta}^{2}\le C\ell_h^4\eta^{1/8}, ℓ h 2 m 1/2 + R η 2 ≤ C ℓ h 4 η 1/8 ,
absorbing the logarithm of 1 / η 1/\eta 1/ η by the smaller power of η \eta η . Taking the universal c c c in the lemma small enough to ensure t = a / 2 ≤ b / 8 t=a/2\le b/8 t = a /2 ≤ b /8 proves (54) .
The movement and skew estimates hold without any Hamiltonian assumption. A local change of a partition has a nonnegative conditional information cost, and the departure of a conjugated local positive expectation from the nonnegative real axis is controlled by a fractional power of that same cost. The one-copy constants depend only on the moved or supporting dimension; the remaining systems may be arbitrarily large.
Symmetric replicas and entropy metrics
We now lift the one-copy estimates of Section 5 to positive operators on symmetric tensor powers. There are two outputs. A transfer of a subsystem gives an operator lower bound with its conditional mutual information in the exponent. A similarity transform of a local term has a scalar symbol whose departure from the nonnegative real axis is controlled by Lemma 5.3. The latter assertion requires a product calculus: it is not enough to compute the expectation of the similarity transform alone.
Throughout this section, V \mathcal{V} V is a fixed finite-dimensional complex Hilbert space with a specified tensor factorization, possibly including auxiliary factors. Write
d = dim V , S k = Sym k V , D k = dim S k = ( k + d − 1 d − 1 ) . d=\dim\mathcal{V},\qquad S_k=\operatorname{Sym}^{k}\mathcal{V},\qquad D_k=\dim S_k=\binom{k+d-1}{d-1}. d = dim V , S k = Sym k V , D k = dim S k = ( d − 1 k + d − 1 ) .
and let Π k \Pi_k Π k be the orthogonal projector onto S k S_k S k . A subsystem Q Q Q is a union of the specified factors; its complement is Q c Q^{c} Q c , and d Q d_Q d Q denotes its Hilbert-space dimension. The empty subsystem has dimension one. An operator on Q ⊗ k Q^{\otimes k} Q ⊗ k is extended by the identity on the other factors. The permutation of the k k k copies of Q Q Q associated with π ∈ S k \pi\in S_k π ∈ S k is denoted by U Q ( π ) U_Q(\pi) U Q ( π ) ; U ( π ) = U V ( π ) U(\pi)=U_{\mathcal{V}}(\pi) U ( π ) = U V ( π ) permutes entire copies. Every limit below is taken with V \mathcal{V} V , its factorization, and all real exponents fixed. When these results are applied at a scale n n n , the entire finite system, auxiliary dimensions, and finite collection of partitions are fixed before k → ∞ k \to\infty k → ∞ . Constants and degrees in poly ( k ) \operatorname{poly}(k) poly ( k ) may depend on these fixed data. Errors o k ( 1 ) o_k(1) o k ( 1 ) are uniform over all density matrices supported on S k \mathcal{S}_k S k . In particular, they remain uniform for density matrices depending on an interpolation parameter. A cutoff and a polynomial approximation are fixed before taking k → ∞ k \to\infty k → ∞ ; their errors are removed only afterwards.
Schur labels and their quantitative bounds
Young-diagram labels encode the spectrum of an independent tensor-power state in the spectrum-estimation theorem of Keyl and Werner [22 ] . Here we need label estimates for arbitrary permutation-invariant densities as well as tensor powers. We derive the specific inequalities from Schur–Weyl duality below.
A partition λ ⊢ k \lambda\vdash k λ ⊢ k is a decreasing sequence of nonnegative integers summing to k k k . Trailing zeroes may be appended. Let [ λ ] [\lambda] [ λ ] be the corresponding irreducible representation of S k \mathcal{S}_k S k , and write d λ = dim [ λ ] d_\lambda= \dim[\lambda] d λ = dim [ λ ] . Schur–Weyl duality and the Weyl character formula give
( C q ) ⊗ k = ⨁ λ ⊢ k ℓ ( λ ) ≤ q [ λ ] ⊗ V λ ( q ) , χ λ ( q ) ( x ) = det [ x i λ j + q − j ] det [ x i q − j ] . (57) (\mathbb{C}^{q})^{\otimes k} = \bigoplus_{\substack{\lambda\vdash k\\ \ell(\lambda)\le q}} [\lambda] \otimes V_{\lambda}^{(q)}, \qquad\chi_{\lambda}^{(q)}(x) = \frac{\det\left[x_i^{\lambda_j+q-j}\right]}{\det\left[x_i^{q-j}\right]}. \tag*{(57)} ( C q ) ⊗ k = λ ⊢ k ℓ ( λ ) ≤ q ⨁ [ λ ] ⊗ V λ ( q ) , χ λ ( q ) ( x ) = det [ x i q − j ] det [ x i λ j + q − j ] . (57)
Here the two factors are the irreducible modules for the permutation and diagonal general-linear actions, respectively, and the two actions have mutual centralizer algebras. These statements are [19 ] , Theorem 5.18.4, Corollary 5.19.2, and Theorem 5.22.1. They apply over C \mathbb{C} C in every dimension used here. The polynomial modules remain irreducible under the unitary group: invariance under its differentiated action implies invariance under its complex span, which is the full matrix Lie algebra.
Let π Q , k λ \pi_{Q,k}^{\lambda} π Q , k λ denote the Schur-label projector on Q ⊗ k Q^{\otimes k} Q ⊗ k . Define the self-adjoint label observable
F Q , k = ∑ λ ⊢ k ( log d λ ) π Q , k λ . F_{Q,k} = \sum_{\lambda\vdash k}(\log d_\lambda)\pi_{Q,k}^{\lambda}. F Q , k = λ ⊢ k ∑ ( log d λ ) π Q , k λ .
We omit the subscript k k k when the number of copies is unambiguous. For zero copies, the only label is the empty partition and F Q , 0 = 0 F_{Q,0}=0 F Q , 0 = 0 . We say labels are compatible if their joint spectral projector is nonzero.
The next lemma treats three operations on labels. Merging subsystems and splitting the copies into groups will be used in the norm comparisons of Section 8. Removing the last copy will control the ratio between successive metrics below. The dimension and surprisal estimates supply entropy bounds for these operations.
Lemma 6.1 (Schur-label estimates). For the finite-dimensional tensor systems just defined, the following statements hold.
For λ ⊢ k \lambda\vdash k λ ⊢ k of length at most q q q , put l i = λ i + q − i l_i=\lambda_i+q-i l i = λ i + q − i for 1 ≤ i ≤ q 1\le i\le q 1 ≤ i ≤ q . Then
dim V λ ( q ) = ∏ i < j l i − l j j − i , d λ = k ! ∏ i < j ( l i − l j ) ∏ i l i ! , log d λ = k H ( λ / k ) + O q ( log ( k + 2 ) ) . (58) \dim V_{\lambda}^{(q)}=\prod_{i<j}\frac{l_i-l_j}{j-i}, \qquad d_\lambda=\frac{k!\prod_{i<j}(l_i-l_j)}{\prod_i l_i!}, \qquad\log d_\lambda=kH(\lambda/k)+O_q(\log(k+2)). \tag*{(58)} dim V λ ( q ) = i < j ∏ j − i l i − l j , d λ = ∏ i l i ! k ! ∏ i < j ( l i − l j ) , log d λ = k H ( λ / k ) + O q ( log ( k + 2 )) . (58)
The number of labels and the sum of their general-linear multiplicities are polynomially bounded in k k k , with q q q fixed.
Central label functions commute for nested or disjoint subsystems. On S k S_k S k , complementary label projectors agree: π Q , k λ = π Q c , k λ \pi_{Q,k}^{\lambda}=\pi_{Q^c,k}^{\lambda} π Q , k λ = π Q c , k λ .
If Q , E Q,E Q , E are disjoint and their labels λ , μ \lambda,\mu λ , μ are compatible with label ν \nu ν on Q E QE QE , then
d ν ≤ d λ d μ , d λ ≤ d ν d μ . d_\nu\le d_\lambda d_\mu,\qquad d_\lambda\le d_\nu d_\mu. d ν ≤ d λ d μ , d λ ≤ d ν d μ .
For a tensor product of permutation-invariant density matrices on Q ⊗ k Q^{\otimes k} Q ⊗ k and E ⊗ k E^{\otimes k} E ⊗ k , the conditional probability of ν \nu ν given λ , μ \lambda,\mu λ , μ is at most poly ( k ) d ν / ( d λ d μ ) \operatorname{poly}(k)d_\nu/(d_\lambda d_\mu) poly ( k ) d ν / ( d λ d μ ) . Consequently, for 0 ≤ b ≤ 1 0\le b\le1 0 ≤ b ≤ 1 ,
E ( d λ d μ d ν ) b ≤ poly ( k ) , (59) \mathbb{E}\left(\frac{d_\lambda d_\mu}{d_\nu}\right)^b\le\operatorname{poly}(k), \tag*{(59)} E ( d ν d λ d μ ) b ≤ poly ( k ) , (59)
uniformly in those density matrices.
Split the copies into specified groups of sizes k − r k-r k − r and r r r . If their labels α , β \alpha,\beta α , β on a fixed subsystem are compatible with the full label λ \lambda λ , then
d α d β ≤ d λ ≤ ( k r ) d α d β . d_\alpha d_\beta\le d_\lambda\le\binom{k}{r}d_\alpha d_\beta. d α d β ≤ d λ ≤ ( r k ) d α d β .
These subgroup label projectors commute with the full label projector.
If ρ \rho ρ is any permutation-invariant density matrix on Q ⊗ k Q^{\otimes k} Q ⊗ k and L ρ = − log ρ L_\rho=-\log\rho L ρ = − log ρ on its support, then F Q F_Q F Q commutes with ρ \rho ρ , 0 ≤ F Q ≤ L ρ 0\le F_Q\le L_\rho 0 ≤ F Q ≤ L ρ on that support, and
Tr ρ exp ( b ( L ρ − F Q ) ) ≤ poly ( k ) ( 0 ≤ b ≤ 1 ) . (60) \operatorname{Tr}\rho\exp\bigl(b(L_\rho-F_Q)\bigr)\le\operatorname{poly}(k)\qquad(0\le b\le1). \tag*{(60)} Tr ρ exp ( b ( L ρ − F Q ) ) ≤ poly ( k ) ( 0 ≤ b ≤ 1 ) . (60)
The full Q Q Q label λ \lambda λ and the first-( k − 1 ) (k-1) ( k − 1 ) label ν \nu ν are compatible precisely along the possible removable-row branches ν = λ − e i \nu=\lambda-e_i ν = λ − e i . In any permutation-invariant Q Q Q state, conditional on λ \lambda λ , the probability of this branch is
p λ , i = d λ − e i d λ = l i k ∏ a < b ( l a − δ a i − l b + δ b i ) ∏ a < b ( l a − l b ) ≤ 2 q l i k . p_{\lambda,i}=\frac{d_{\lambda-e_i}}{d_\lambda}=\frac{l_i}{k}\frac{\prod_{a<b}(l_a-\delta_{ai}-l_b+\delta_{bi})}{\prod_{a<b}(l_a-l_b)}\le2^q\frac{l_i}{k}. p λ , i = d λ d λ − e i = k l i ∏ a < b ( l a − l b ) ∏ a < b ( l a − δ ai − l b + δ bi ) ≤ 2 q k l i .
The normalized Jucys–Murphy, or star, operator [40 ] (Section 2)
J Q , k = 1 k ∑ j < k U Q ( ( j k ) ) (61) J_{Q,k}=\frac{1}{k}\sum_{j<k}U_Q((j\ k)) \tag*{(61)} J Q , k = k 1 j < k ∑ U Q (( j k )) (61)
has eigenvalue ( λ i − i ) / k (\lambda_i-i)/k ( λ i − i ) / k on that branch.
The polynomial bounds may depend on the fixed subsystem dimensions, but not on the density matrices.
Proof. The first formula in (58) is the value of the Weyl character at the identity. To derive the second, multiply the character decomposition of ( x 1 + ⋯ + x q ) k (x_1+\cdots+x_q)^k ( x 1 + ⋯ + x q ) k by det [ x i q − j ] \det[x_i^{q-j}] det [ x i q − j ] and extract the coefficient of x 1 l 1 ⋯ x q l q x_1^{l_1}\cdots x_q^{l_q} x 1 l 1 ⋯ x q l q . The strict decrease of the l i l_i l i selects only label λ \lambda λ and the identity term in its numerator alternant. On the other side the coefficient is
k ! det [ 1 ( l i − q + j ) ! ] i , j = 1 q = k ! ∏ i l i ! det [ ( l i ) q − j ] i , j = 1 q = k ! ∏ i l i ! ∏ i < j ( l i − l j ) . k!\det\left[\frac{1}{(l_i-q+j)!}\right]_{i,j=1}^{q}=\frac{k!}{\prod_i l_i!}\det\left[(l_i)_{q-j}\right]_{i,j=1}^{q}=\frac{k!}{\prod_i l_i!}\prod_{i<j}(l_i-l_j). k ! det [ ( l i − q + j )! 1 ] i , j = 1 q = ∏ i l i ! k ! det [ ( l i ) q − j ] i , j = 1 q = ∏ i l i ! k ! i < j ∏ ( l i − l j ) .
Here a reciprocal negative factorial is zero and ( u ) m (u)_m ( u ) m is the falling factorial. The last determinant is a Vandermonde because its columns are monic polynomials of the indicated degrees. The estimate log n ! = n log n − n + O ( log ( n + 2 ) ) \log n! = n \log n - n + O(\log(n + 2)) log n ! = n log n − n + O ( log ( n + 2 )) gives the entropy formula, including zero parts, with 0 log 0 = 0 0 \log0 = 0 0 log 0 = 0 . The fixed shifts from λ i \lambda_i λ i to l i l_i l i and the Vandermonde contribute only O q ( log ( k + 2 ) ) O_q(\log(k + 2)) O q ( log ( k + 2 )) . There are at most ( k + 1 ) q (k + 1)^q ( k + 1 ) q labels, and the dimension formula bounds each dim V χ ( q ) \dim V_\chi^{(q)} dim V χ ( q ) by ( k + q ) q ( q − 1 ) / 2 (k + q)^{q(q-1)/2} ( k + q ) q ( q − 1 ) /2 .
Each label projector is a central character idempotent in the permutation algebra:
π Q , k λ = d λ k ! ∑ π ∈ S k χ λ ( π − 1 ) U Q ( π ) . \pi_{Q,k}^{\lambda} = \frac{d_\lambda}{k!} \sum_{\pi\in S_k} \chi_\lambda(\pi^{-1}) U_Q(\pi). π Q , k λ = k ! d λ π ∈ S k ∑ χ λ ( π − 1 ) U Q ( π ) .
This follows from character orthogonality, or directly from Schur’s lemma applied to the central sum and its trace on each irreducible. Conjugation by U Q c ( π ) U_{Q^c}(\pi) U Q c ( π ) sends a central function of the Q Q Q permutations to itself. This proves nested commutation; disjoint commutation is immediate. On S k S_k S k , U Q ( π ) z = U Q c ( π − 1 ) z U_Q(\pi)z = U_{Q^c}(\pi^{-1})z U Q ( π ) z = U Q c ( π − 1 ) z . A permutation is conjugate to its inverse, so χ λ ( π ) = χ λ ( π − 1 ) \chi_\lambda(\pi) = \chi_\lambda(\pi^{-1}) χ λ ( π ) = χ λ ( π − 1 ) and the two central-projector sums agree there. This also shows that all Specht modules are self-dual: their dual characters are the same.
For disjoint subsystems, [ ν ] [\nu] [ ν ] is a constituent of [ λ ] ⊗ [ μ ] [\lambda] \otimes[\mu] [ λ ] ⊗ [ μ ] under diagonal permutations. This proves the first inequality of (6.4) . The identity
Hom S k ( [ ν ] , [ λ ] ⊗ [ μ ] ) ≃ Hom S k ( [ λ ] , [ ν ] ⊗ [ μ ] ∗ ) \operatorname{Hom}_{S_k}([\nu],[\lambda]\otimes[\mu]) \simeq\operatorname{Hom}_{S_k}([\lambda],[\nu]\otimes[\mu]^*) Hom S k ([ ν ] , [ λ ] ⊗ [ μ ]) ≃ Hom S k ([ λ ] , [ ν ] ⊗ [ μ ] ∗ )
and self-duality prove the second. Conditional on λ , μ \lambda,\mu λ , μ , a product of invariant states is the identity divided by d λ d μ d_\lambda d_\mu d λ d μ on the two Specht factors. If g λ μ ν g_{\lambda\mu\nu} g λ μν is the multiplicity of [ ν ] [\nu] [ ν ] in their tensor product, its conditional label probability is exactly g λ μ ν d ν / ( d λ d μ ) g_{\lambda\mu\nu}d_\nu/(d_\lambda d_\mu) g λ μν d ν / ( d λ d μ ) . The ambient decomposition of ( Q ⊗ E ) ⊗ k (Q \otimes E)^{\otimes k} ( Q ⊗ E ) ⊗ k implies
g λ μ ν dim V λ ( d Q ) dim V μ ( d E ) ≤ dim V ν ( d Q d E ) , g_{\lambda\mu\nu} \dim V_\lambda^{(d_Q)} \dim V_\mu^{(d_E)} \le\dim V_\nu^{(d_Qd_E)}, g λ μν dim V λ ( d Q ) dim V μ ( d E ) ≤ dim V ν ( d Q d E ) ,
so g λ μ ν g_{\lambda\mu\nu} g λ μν is polynomially bounded. With R = d λ d μ / d ν ≥ 1 R = d_\lambda d_\mu/d_\nu\ge1 R = d λ d μ / d ν ≥ 1 , the conditional expectation in (59) is ∑ ν g λ μ ν R b − 1 ≤ ∑ ν g λ μ ν \sum_\nu g_{\lambda\mu\nu}R^{b-1} \le\sum_\nu g_{\lambda\mu\nu} ∑ ν g λ μν R b − 1 ≤ ∑ ν g λ μν , again polynomial.
For the copy-group assertion, choose a copy of [ α ] ⊗ [ β ] [\alpha] \otimes[\beta] [ α ] ⊗ [ β ] inside the restriction of [ λ ] [\lambda] [ λ ] to S k − r × S r S_{k-r} \times S_r S k − r × S r . Its dimension gives the lower bound. The translates of this subspace span [ λ ] [\lambda] [ λ ] , by irreducibility. Choosing one representative of each subgroup coset bounds the span dimension by ( k r ) d α d β \binom{k}{r}d_\alpha d_\beta ( r k ) d α d β . Central elements of S k S_k S k commute with its subgroup algebra, proving the commutation claim.
An invariant density has blocks ρ = ⨁ λ I [ λ ] ⊗ M λ \rho= \bigoplus_\lambda I_{[\lambda]} \otimes M_\lambda ρ = ⨁ λ I [ λ ] ⊗ M λ . Every positive eigenvalue u u u of M λ M_\lambda M λ is repeated d λ d_\lambda d λ times, so u d λ ≤ 1 u d_\lambda\le1 u d λ ≤ 1 . This gives F Q ≤ L ρ F_Q \le L_\rho F Q ≤ L ρ and
Tr ρ e b ( L ρ − F Q ) = ∑ λ ∑ u > 0 ( u d λ ) 1 − b ≤ ∑ λ dim V λ ( d Q ) ( 0 ≤ b ≤ 1 ) , \operatorname{Tr}\rho e^{b(L_\rho-F_Q)} = \sum_\lambda\sum_{u>0} (u d_\lambda)^{1-b} \le\sum_\lambda\dim V_\lambda^{(d_Q)} \qquad(0 \le b \le1), Tr ρ e b ( L ρ − F Q ) = λ ∑ u > 0 ∑ ( u d λ ) 1 − b ≤ λ ∑ dim V λ ( d Q ) ( 0 ≤ b ≤ 1 ) ,
where the inner sum counts eigenvalues with multiplicity in M λ M_\lambda M λ .
It remains to identify the marked-copy branches. Multiplying a Weyl numerator alternant by ∑ i x i \sum_i x_i ∑ i x i gives the sum of alternants with one exponent increased by one. Terms with equal exponents vanish; the remaining terms correspond exactly to adding a legal box to a partition. Thus V ν ( q ) ⊗ C q = ⨁ λ = ν + e i V λ ( q ) V_\nu^{(q)} \otimes\mathbb{C}^q = \bigoplus_{\lambda=\nu+e_i} V_\lambda^{(q)} V ν ( q ) ⊗ C q = ⨁ λ = ν + e i V λ ( q ) , with multiplicity one. Comparing the two Schur–Weyl decompositions of the first k − 1 k-1 k − 1 copies and the last copy shows that the ν \nu ν branch in the λ \lambda λ block has rank d ν d_\nu d ν on [ λ ] [\lambda] [ λ ] , and acts identically on V λ ( q ) V_\lambda^{(q)} V λ ( q ) . The invariant state is uniform on [ λ ] [\lambda] [ λ ] , giving the probability in (6.8) . The dimension formula gives the displayed quotient. In its Vandermonde ratio, a factor involving an earlier row is at most two, and a factor involving a later row is at most one. Positivity holds on a legal removable branch.
For the star eigenvalue, let E a b t o t E^{\mathrm{tot}}_{ab} E ab tot be the sum over copies of the matrix unit E a b E_{ab} E ab on C q \mathbb{C}^{q} C q . Direct multiplication gives
∑ a , b E a b t o t E b a t o t = k q I + 2 ∑ j < j ′ U Q ( ( j j ′ ) ) . \sum_{a,b}E^{\mathrm{tot}}_{ab}E^{\mathrm{tot}}_{ba}=kqI+2\sum_{j<j'}U_Q((j\ j')). a , b ∑ E ab tot E ba tot = k q I + 2 j < j ′ ∑ U Q (( j j ′ )) .
The right side is scalar on a Schur block. The lexicographically leading weight in its Weyl character is λ \lambda λ ; a vector of that weight is annihilated by E a b t o t E^{\mathrm{tot}}_{ab} E ab tot for a < b a<b a < b , since those operators would increase the weight. On this vector the diagonal terms contribute ∑ i λ i 2 \sum_i\lambda_i^2 ∑ i λ i 2 , and the two terms for a < b a<b a < b contribute λ a − λ b \lambda_a-\lambda_b λ a − λ b , using [ E a b t o t , E b a t o t ] = E a a t o t − E b b t o t [E^{\mathrm{tot}}_{ab},E^{\mathrm{tot}}_{ba}]=E^{\mathrm{tot}}_{aa}-E^{\mathrm{tot}}_{bb} [ E ab tot , E ba tot ] = E aa tot − E bb tot . The scalar is therefore ∑ i λ i ( λ i + q + 1 − 2 i ) \sum_i\lambda_i(\lambda_i+q+1-2i) ∑ i λ i ( λ i + q + 1 − 2 i ) . Subtract the formula for k − 1 k-1 k − 1 copies with label λ − e i \lambda-e_i λ − e i . The difference of the transposition sums is k J Q , k kJ_{Q,k} k J Q , k , and its value is λ i − i \lambda_i-i λ i − i .
A common metric on every subsystem
Fix 0 < t < 1 / 4 0<t<1/4 0 < t < 1/4 and set a = 2 t a=2t a = 2 t . Complementary labels will need to give exactly the same metric, even when the two subsystem dimensions differ. We therefore use the full dimension d d d in the following formula for every subsystem. Besides having eigenvalues of size e − t F Q e^{-tF_{Q}} e − t F Q up to polynomial factors, the metric must admit a positive mixture of tensor powers, so that the conditional movement estimate can be applied inside its integral. The ratio between its k k k -copy and ( k − 1 ) (k-1) ( k − 1 ) -copy weights must also approximate marginal powers for the local-operator calculation. The following common label function has all these properties. Pad each label to length d d d and put
c = d + ( 1 + t ) ( d 2 ) , w k ( λ ) = Γ ( c ) Γ ( c + t k ) ∏ i = 1 d Γ ( 1 + t ( λ i + d − i ) ) Γ ( 1 + t ( d − i ) ) , W Q , k = ∑ λ w k ( λ ) π Q , k λ . (62) \begin{aligned}
c&=d+(1+t)\binom{d}{2},\\
w_k(\lambda)&=\frac{\Gamma(c)}{\Gamma(c+tk)}\prod_{i=1}^{d}\frac{\Gamma(1+t(\lambda_i+d-i))}{\Gamma(1+t(d-i))},\\
W_{Q,k}&=\sum_{\lambda}w_k(\lambda)\pi^\lambda_{Q,k}. \tag*{(62)}
\end{aligned} c w k ( λ ) W Q , k = d + ( 1 + t ) ( 2 d ) , = Γ ( c + t k ) Γ ( c ) i = 1 ∏ d Γ ( 1 + t ( d − i )) Γ ( 1 + t ( λ i + d − i )) , = λ ∑ w k ( λ ) π Q , k λ . (62)
In particular W Q , 0 = I W_{Q,0}=I W Q , 0 = I . For a one-dimensional subsystem at positive k k k , W Q , k W_{Q,k} W Q , k is the positive scalar w k ( ( k ) ) w_k((k)) w k (( k )) ; it need not equal one. This convention keeps the label function identical on all subsystems.
Lemma 6.2 (Integral formula and marked ratios). The operators in (62) are positive definite and central. Uniformly in their labels,
poly ( k ) − 1 e − t F Q , k ≤ W Q , k ≤ poly ( k ) e − t F Q , k . (63) \operatorname{poly}(k)^{-1}e^{-tF_{Q,k}}\le W_{Q,k}\le\operatorname{poly}(k)e^{-tF_{Q,k}}. \tag*{(63)} poly ( k ) − 1 e − t F Q , k ≤ W Q , k ≤ poly ( k ) e − t F Q , k . (63)
On S k \mathcal{S}_k S k , W Q , k = W Q c , k W_{Q,k}=W_{Q^c,k} W Q , k = W Q c , k exactly. For each subsystem there is a probability measure on positive definite subdensities σ \sigma σ on Q Q Q , with Tr σ ≤ 1 \operatorname{Tr}\sigma\le1 Tr σ ≤ 1 , such that
W Q , k = ∫ ( σ t ) ⊗ k d ζ Q ( σ ) ( k ≥ 0 ) . W_{Q,k}=\int(\sigma^t)^{\otimes k}\,d\zeta_Q(\sigma)\qquad(k\ge0). W Q , k = ∫ ( σ t ) ⊗ k d ζ Q ( σ ) ( k ≥ 0 ) .
The measure is independent of k k k .
Extend W Q , k − 1 W_{Q,k-1} W Q , k − 1 by the identity on the last copy and define R Q , k = W Q , k W Q , k − 1 − 1 R_{Q,k}=W_{Q,k}W^{-1}_{Q,k-1} R Q , k = W Q , k W Q , k − 1 − 1 . Then
∥ R Q , k − ( J Q , k ) + t ∥ ⟶ 0 (64) \left\|R_{Q,k}-(J_{Q,k})^t_+\right\|\longrightarrow0 \tag*{(64)} R Q , k − ( J Q , k ) + t ⟶ 0 (64)
on the entire tensor space. There is a constant C V , t C_{V,t} C V , t such that, for every unit z ∈ S k z\in\mathcal{S}_k z ∈ S k , ∥ R Q , k − 1 z ∥ ≤ C V , t \|R^{-1}_{Q,k}z\|\le C_{V,t} ∥ R Q , k − 1 z ∥ ≤ C V , t , and
lim sup k → ∞ sup z ∈ S k ∥ z ∥ = 1 ∥ ( R Q , k − 1 − max ( J Q , k , δ ) − t ) z ∥ ≤ C V , t δ ( 1 − 2 t ) / 2 ( 0 < δ < 1 ) . (65) \limsup_{k\to\infty}\sup_{\substack{z\in\mathcal{S}_k\\ \|z\|=1}}\left\|\left(R^{-1}_{Q,k}-\max(J_{Q,k},\delta)^{-t}\right)z\right\|\le C_{V,t}\delta^{(1-2t)/2}\qquad(0<\delta<1). \tag*{(65)} k → ∞ lim sup z ∈ S k ∥ z ∥ = 1 sup ( R Q , k − 1 − max ( J Q , k , δ ) − t ) z ≤ C V , t δ ( 1 − 2 t ) /2 ( 0 < δ < 1 ) . (65)
Proof. Begin in dimension d d d . Write Δ ( s ) = ∏ i < j ( s i − s j ) \Delta(s)=\prod_{i<j}(s_i-s_j) Δ ( s ) = ∏ i < j ( s i − s j ) and choose s s s on the simplex s i ≥ 0 s_i\ge0 s i ≥ 0 , ∑ i s i = 1 \sum_i s_i=1 ∑ i s i = 1 , with density proportional to Δ ( s ) Δ ( s t ) \Delta(s)\Delta(s^t) Δ ( s ) Δ ( s t ) . This is a nonnegative, integrable density, positive off the collision hyperplanes in the simplex interior. It is the simplex normalization of the Laguerre Muttalib–Borodin weight; the gamma integral below is the corresponding form of [20 ] , Section 2.3, equation (26). We include the calculation before verifying the common-subsystem and ratio properties. For d = 1 d=1 d = 1 use the point mass at s 1 = 1 s_1=1 s 1 = 1 . Choose an independent Haar-distributed unitary eigenbasis and let σ \sigma σ have eigenvalues s s s . The integral of ( σ t ) ⊗ k (\sigma^t)^{\otimes k} ( σ t ) ⊗ k commutes both with permutations and with the diagonal unitary group; hence it is central in the Schur decomposition. Its eigenvalue on λ \lambda λ is the mean of χ λ ( d ) ( s t ) / dim V λ ( d ) \chi_{\lambda}^{(d)}(s^t)/\dim V_{\lambda}^{(d)} χ λ ( d ) ( s t ) / dim V λ ( d ) .
Put l i = λ i + d − i l_i=\lambda_i+d-i l i = λ i + d − i . The Weyl denominator cancels Δ ( s t ) \Delta(s^t) Δ ( s t ) in the density. Expanding the two remaining determinants and using the simplex integral
∫ s i ≥ 0 ∑ i s i = 1 ∏ i s i u i d s = ∏ i Γ ( 1 + u i ) Γ ( d + ∑ i u i ) ( u i > − 1 ) \int_{\substack{s_i\ge0\\ \sum_i s_i=1}}\prod_i s_i^{u_i}\,ds=\frac{\prod_i\Gamma(1+u_i)}{\Gamma(d+\sum_i u_i)}\qquad(u_i>-1) ∫ s i ≥ 0 ∑ i s i = 1 i ∏ s i u i d s = Γ ( d + ∑ i u i ) ∏ i Γ ( 1 + u i ) ( u i > − 1 )
gives, before dividing by the Weyl dimension and the density’s normalization,
d ! Γ ( c + t k ) det [ Γ ( 1 + t l i + d − j ) ] i , j = 1 d . \frac{d!}{\Gamma(c+tk)}\det\left[\Gamma(1+tl_i+d-j)\right]_{i,j=1}^{d}. Γ ( c + t k ) d ! det [ Γ ( 1 + t l i + d − j ) ] i , j = 1 d .
The simplex identity follows, for example, by changing variables x i = r s i x_i=rs_i x i = r s i in the product of the defining gamma integrals; the Jacobian contributes r d − 1 r^{d-1} r d − 1 . Factor Γ ( 1 + t l i ) \Gamma(1+tl_i) Γ ( 1 + t l i ) from each row. The remaining entries are rising-factorial monic polynomials in t l i tl_i t l i of degrees d − j d-j d − j , so their determinant is t d ( d − 1 ) / 2 Δ ( l ) t^{d(d-1)/2}\Delta(l) t d ( d − 1 ) /2 Δ ( l ) . The Weyl dimension cancels Δ ( l ) \Delta(l) Δ ( l ) . Normalizing at k = 0 k=0 k = 0 gives exactly (62) .
For d Q ≤ d d_Q\le d d Q ≤ d , choose an isometry E : H Q → C d E:\mathcal{H}_Q\to\mathbb{C}^d E : H Q → C d . Compression of a permutation on ( C d ) ⊗ k (\mathbb{C}^d)^{\otimes k} ( C d ) ⊗ k by E ⊗ k E^{\otimes k} E ⊗ k is the same permutation on Q ⊗ k \mathcal{Q}^{\otimes k} Q ⊗ k . Compressing its central label function therefore gives the identical function w k ( λ ) w_k(\lambda) w k ( λ ) on all labels that occur in dimension d Q d_Q d Q . On each sample, write B = E † σ t E B=E^\dagger\sigma^tE B = E † σ t E and τ = B 1 / t \tau=B^{1/t} τ = B 1/ t . The min–max principle bounds the decreasing eigenvalues of B B B by the corresponding eigenvalues of σ t \sigma^t σ t . Consequently Tr τ ≤ Tr σ = 1 \operatorname{Tr}\tau\le\operatorname{Tr}\sigma=1 Tr τ ≤ Tr σ = 1 , while B > 0 B>0 B > 0 almost surely. Thus the compressed integral has the form (6.12), with the distribution of τ \tau τ as ζ Q \zeta_Q ζ Q . This proves the asserted representation without changing the common label function. Exact complement equality follows from Lemma 6.1.
The gamma estimate log Γ ( 1 + u ) = u log u − u + O ( log ( u + 2 ) ) \log\Gamma(1+u)=u\log u-u+O(\log(u+2)) log Γ ( 1 + u ) = u log u − u + O ( log ( u + 2 )) , with 0 log 0 = 0 0\log0=0 0 log 0 = 0 , applied to the fixed number of factors in (62) , gives log w k ( λ ) = − t k H ( λ / k ) + O d , t ( log ( k + 2 ) ) \log w_k(\lambda)=-tkH(\lambda/k)+O_{d,t}(\log(k+2)) log w k ( λ ) = − t k H ( λ / k ) + O d , t ( log ( k + 2 )) . The terms containing log t \log t log t cancel. Formula (58) proves (63) .
For the marked ratio, now put l i = λ i + d − i l_i=\lambda_i+d-i l i = λ i + d − i using the full dimension. On a removable branch its exact eigenvalue is
r λ , i = Γ ( c + t ( k − 1 ) ) Γ ( c + t k ) Γ ( 1 + t l i ) Γ ( 1 + t ( l i − 1 ) ) . r_{\lambda,i}=\frac{\Gamma(c+t(k-1))}{\Gamma(c+tk)}\frac{\Gamma(1+tl_i)}{\Gamma(1+t(l_i-1))}. r λ , i = Γ ( c + t k ) Γ ( c + t ( k − 1 )) Γ ( 1 + t ( l i − 1 )) Γ ( 1 + t l i ) .
Gamma ratios give r λ , i ≲ d , t ( ( l i + 1 ) / k ) t r_{\lambda,i}\lesssim_{d,t}((l_i+1)/k)^t r λ , i ≲ d , t (( l i + 1 ) / k ) t . When l i / k l_i/k l i / k is bounded away from zero, the same ratios give uniform convergence to ( l i / k ) t (l_i/k)^t ( l i / k ) t . When l i / k l_i/k l i / k is small, both r λ , i r_{\lambda,i} r λ , i and max ( ( l i − d ) / k , 0 ) t \max((l_i-d)/k,0)^t max (( l i − d ) / k , 0 ) t are uniformly small. First separate at l i / k = ε l_i/k=\varepsilon l i / k = ε , then let k → ∞ k\to\infty k → ∞ and ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 . The star eigenvalue formula proves (64) and a uniform bound for ∥ R Q , k ∥ \|R_{Q,k}\| ∥ R Q , k ∥ .
The Q Q Q marginal of a symmetric vector is permutation invariant. Its conditional branch probabilities are bounded by C d l i / k C_d l_i/k C d l i / k : Lemma 6.1 first uses λ i + d Q − i \lambda_i+d_Q-i λ i + d Q − i , which is no larger than l i l_i l i . Hence, conditional on any λ \lambda λ ,
∑ i p λ , i r λ , i − 2 ≤ C d , t ∑ i ( l i / k ) 1 − 2 t ≤ C d , t . \sum_i p_{\lambda,i}r_{\lambda,i}^{-2}\le C_{d,t}\sum_i(l_i/k)^{1-2t}\le C_{d,t}. i ∑ p λ , i r λ , i − 2 ≤ C d , t i ∑ ( l i / k ) 1 − 2 t ≤ C d , t .
This proves the inverse vector bound. On the spectral part J Q , k ≥ δ J_{Q,k}\ge\delta J Q , k ≥ δ , the inverse approximation follows in operator norm from (64) . On the remaining part, l i / k ≤ δ + d / k l_i/k\le\delta+d/k l i / k ≤ δ + d / k . The true inverse’s squared norm there is at most C d , t ( δ + d / k ) 1 − 2 t C_{d,t}(\delta+d/k)^{1-2t} C d , t ( δ + d / k ) 1 − 2 t ; the clipped inverse’s squared norm is at most C d ( δ + d / k ) δ − 2 t C_d(\delta+d/k)^{\delta-2t} C d ( δ + d / k ) δ − 2 t . Taking the limit superior and the square root proves (65) . All bounds were conditional on an arbitrary label, so they are uniform in the original symmetric vector.
The common label function also gives an exact restriction identity. If B , Q B,Q B , Q are disjoint and B B B is held in a fixed pure vector ϕ ⊗ k \phi^{\otimes k} ϕ ⊗ k , then
W B Q , k ( ϕ ⊗ k ⊗ z ) = ϕ ⊗ k ⊗ W Q , k z . W_{BQ,k}(\phi^{\otimes k}\otimes z)=\phi^{\otimes k}\otimes W_{Q,k}z. W B Q , k ( ϕ ⊗ k ⊗ z ) = ϕ ⊗ k ⊗ W Q , k z .
Indeed every simultaneous permutation on B Q BQ B Q fixes the repeated B B B vector and acts as the corresponding permutation on Q Q Q . Apply the same central permutation coefficients on both sides. The corresponding identity holds for F F F and for every real power of W W W . In particular it applies when the fixed vector on B B B is a Bell vector between two factors: its entanglement inside B B B is irrelevant to simultaneous permutations of the entire B B B factor.
For a partition P , Y , F P,Y,F P , Y , F of the full one-copy system, the moves considered below transfer a subsystem x ⊆ Y x\subseteq Y x ⊆ Y to either P P P or F F F . We call P , F P,F P , F the outer parts and Y Y Y the middle part; these names impose no geometric condition. Define the partition’s metric on S k S_k S k by
A k ( P , Y , F ) = ( W P , k − 1 W F , k − 1 W Y , k ) 2 . A_k(P,Y,F)=\left(W_{P,k}^{-1}W_{F,k}^{-1}W_{Y,k}\right)^2. A k ( P , Y , F ) = ( W P , k − 1 W F , k − 1 W Y , k ) 2 .
The three factors commute. The preceding lemmas imply
log A k = a ( F P + F F − F Y ) + O V , t ( log ( k + 2 ) ) , A k ≥ poly ( k ) − 1 I . (66) \log A_k=a(F_P+F_F-F_Y)+O_{V,t}(\log(k+2)),\qquad A_k\geq\operatorname{poly}(k)^{-1}I. \tag*{(66)} log A k = a ( F P + F F − F Y ) + O V , t ( log ( k + 2 )) , A k ≥ poly ( k ) − 1 I . (66)
The error here is an operator-norm bound. Indeed F Y = F P F F F_Y=F_PF_F F Y = F P F F on symmetry and F P F F ≤ F P + F F F_PF_F\leq F_P+F_F F P F F ≤ F P + F F on every compatible label. If a one-copy operator h h h is contained in one part, its copy average h ˉ = k − 1 ∑ j h ( j ) \bar h=k^{-1}\sum_j h^{(j)} h ˉ = k − 1 ∑ j h ( j ) commutes with this metric: it commutes with permutations on that part and is disjoint from the other parts.
An operator lower bound for moving a subsystem
The integral representation of W W W lets us apply the one-copy movement estimate inside a replica metric. We first show that moving x x x from the middle part to an outer part produces the corresponding entropy gain as a rank-one operator bound. For a unit one-copy vector θ \theta θ , put P θ , k = ∣ θ ⊗ k ⟩ ⟨ θ ⊗ k ∣ P_{\theta,k}=|\theta^{\otimes k}\rangle\langle\theta^{\otimes k}| P θ , k = ∣ θ ⊗ k ⟩ ⟨ θ ⊗ k ∣ . All constants outside polynomial factors in k k k will depend only on the one-copy estimate and the dimension of x x x .
Lemma 6.3 (Relative coherent pin). Let P , x , Y 0 , F P,x,Y_0,F P , x , Y 0 , F partition the fixed finite system V \mathcal{V} V , put Y = x Y 0 Y=xY_0 Y = x Y 0 , and let
A k = A k ( P , x Y 0 , F ) , B k = A k ( P x , Y 0 , F ) , C x , k = A k − 1 / 2 B k A k − 1 / 2 . A_k=A_k(P,xY_0,F),\qquad B_k=A_k(Px,Y_0,F),\qquad C_{x,k}=A_k^{-1/2}B_kA_k^{-1/2}. A k = A k ( P , x Y 0 , F ) , B k = A k ( P x , Y 0 , F ) , C x , k = A k − 1/2 B k A k − 1/2 .
Suppose 0 < t < 1 / 4 0<t<1/4 0 < t < 1/4 , a = 2 t a=2t a = 2 t , and a log ( e dim x ) ≤ c a\log(e\dim x)\leq c a log ( e dim x ) ≤ c , with c c c as in Lemma 5.1. For every unit θ ∈ V \theta\in\mathcal{V} θ ∈ V , define
η θ = S θ ( x ∣ P ) + S θ ( x ∣ Y 0 ) = I θ ( x : F ∣ P ) = I θ ( x : F ∣ Y 0 ) ≥ 0. \eta_\theta=S_\theta(x|P)+S_\theta(x|Y_0)=I_\theta(x:F|P)=I_\theta(x:F|Y_0)\geq0. η θ = S θ ( x ∣ P ) + S θ ( x ∣ Y 0 ) = I θ ( x : F ∣ P ) = I θ ( x : F ∣ Y 0 ) ≥ 0.
There is a polynomial bound uniform in θ \theta θ such that, on S k S_k S k ,
C x , k ≥ poly ( k ) − 1 exp { k a [ η θ − C a 1 / 4 log c ( e dim x ) ] } P θ , k . (67) C_{x,k}\geq\operatorname{poly}(k)^{-1}\exp\left\{ka\left[\eta_\theta-Ca^{1/4}\log^c(e\dim x)\right]\right\}P_{\theta,k}. \tag*{(67)} C x , k ≥ poly ( k ) − 1 exp { k a [ η θ − C a 1/4 log c ( e dim x ) ] } P θ , k . (67)
The same statement holds for a move to F F F after exchanging the outer parts. A choice making no move has C x , k = I C_{x,k}=I C x , k = I and may be assigned gain zero.
Proof. For a positive definite C C C and unit vector z z z , Cauchy–Schwarz gives
∣ ⟨ z , u ⟩ ∣ 2 ≤ ⟨ z , C − 1 z ⟩ ⟨ u , C u ⟩ , C ≥ ⟨ z , C − 1 z ⟩ − 1 ∣ z ⟩ ⟨ z ∣ . |\langle z,u\rangle|^2 \le\langle z,C^{-1}z\rangle\langle u,Cu\rangle,\qquad C \ge\langle z,C^{-1}z\rangle^{-1}|z\rangle\langle z|. ∣ ⟨ z , u ⟩ ∣ 2 ≤ ⟨ z , C − 1 z ⟩ ⟨ u , C u ⟩ , C ≥ ⟨ z , C − 1 z ⟩ − 1 ∣ z ⟩ ⟨ z ∣.
It therefore suffices to bound the inverse quadratic form of C x , k C_{x,k} C x , k at θ ⊗ k \theta^{\otimes k} θ ⊗ k . Since C x , k − 1 = A k 1 / 2 B k − 1 A k 1 / 2 C_{x,k}^{-1}=A_k^{1/2}B_k^{-1}A_k^{1/2} C x , k − 1 = A k 1/2 B k − 1 A k 1/2 ,
⟨ θ ⊗ k , C x , k − 1 θ ⊗ k ⟩ = ∥ B k − 1 / 2 A k 1 / 2 θ ⊗ k ∥ 2 = ∥ W P x , k W x Y 0 , k W P , k − 1 W Y 0 , k − 1 θ ⊗ k ∥ 2 . (68) \begin{aligned}
\langle\theta^{\otimes k},C_{x,k}^{-1}\theta^{\otimes k}\rangle
&=\left\|B_k^{-1/2}A_k^{1/2}\theta^{\otimes k}\right\|^2\\
&=\left\|W_{P_x,k}W_{xY_0,k}W_{P,k}^{-1}W_{Y_0,k}^{-1}\theta^{\otimes k}\right\|^2. \tag*{(68)}
\end{aligned} ⟨ θ ⊗ k , C x , k − 1 θ ⊗ k ⟩ = B k − 1/2 A k 1/2 θ ⊗ k 2 = W P x , k W x Y 0 , k W P , k − 1 W Y 0 , k − 1 θ ⊗ k 2 . (68)
To obtain the second line, cancel the disjoint F F F factors and commute the remaining nested or disjoint central factors. This is an identity of the displayed norms; no commutation of A k A_k A k with B k B_k B k is asserted.
Let ρ R \rho_R ρ R be the marginal of θ \theta θ for R = P , Y 0 R=P,Y_0 R = P , Y 0 , and set
T R = W R , k − 1 ( ρ R t ) ⊗ k , T_R=W_{R,k}^{-1}(\rho_R^t)^{\otimes k}, T R = W R , k − 1 ( ρ R t ) ⊗ k ,
with the positive power zero on the kernel. The invariant density ρ R ⊗ k \rho_R^{\otimes k} ρ R ⊗ k has every eigenvalue in its λ \lambda λ block at most d λ − 1 d_\lambda^{-1} d λ − 1 by eigenvalue repetition, as in the proof of (60) . Thus (63) implies
∥ T R ∥ ≤ poly ( k ) , (69) \|T_R\|\le\operatorname{poly}(k), \tag*{(69)} ∥ T R ∥ ≤ poly ( k ) , (69)
uniformly in θ \theta θ , including marginals of deficient rank. Furthermore T P T_P T P commutes with both numerator factors in (68) , and so does T Y 0 T_{Y_0} T Y 0 . For the overlapping numerator this follows because W R , k W_{R,k} W R , k is central on the nested subsystem and ( ρ R t ) ⊗ k (\rho_R^t)^{\otimes k} ( ρ R t ) ⊗ k commutes with every simultaneous permutation on x R xR x R ; the other numerator is disjoint from R R R .
Extend ρ R \rho_R ρ R by eigenvalue one on its kernel and denote this extension by ρ ~ R \widetilde{\rho}_R ρ R . The product of the two marginal support projectors fixes θ \theta θ , since P P P and Y 0 Y_0 Y 0 are disjoint. We can therefore insert T P , T Y 0 T_P,T_{Y_0} T P , T Y 0 and move them to the left in (68) , obtaining the upper bound
poly ( k ) ∥ W P x , k W x Y 0 , k ( ρ ~ P t ρ ~ Y 0 − t ) ⊗ k θ ⊗ k ∥ 2 . \operatorname{poly}(k)\left\|W_{P_x,k}W_{xY_0,k}(\widetilde{\rho}_P^{\,t}\widetilde{\rho}_{Y_0}^{\,-t})^{\otimes k}\theta^{\otimes k}\right\|^2. poly ( k ) W P x , k W x Y 0 , k ( ρ P t ρ Y 0 − t ) ⊗ k θ ⊗ k 2 .
Here and below the polynomial can be enlarged to absorb its square. Expand the two numerator integrals (6.12) in their stated order. The triangle inequality and the tensor-power norm identity bound this by
poly ( k ) sup σ , τ ∥ σ P x t τ x Y 0 t ρ ~ P − t ρ ~ Y 0 − t θ ∥ 2 k , (70) \operatorname{poly}(k)\sup_{\sigma,\tau}\left\|\sigma_{P_x}^{t}\tau_{xY_0}^{t}\widetilde{\rho}_P^{-t}\widetilde{\rho}_{Y_0}^{-t}\theta\right\|^{2k}, \tag*{(70)} poly ( k ) σ , τ sup σ P x t τ x Y 0 t ρ P − t ρ Y 0 − t θ 2 k , (70)
where σ , τ \sigma,\tau σ , τ are positive definite subdensities on the indicated subsystems. Normalizing a subdensity multiplies its t t t -power by a scalar at least one, so it suffices to take density matrices. Since P P P is disjoint from x Y 0 xY_0 x Y 0 , its inverse power commutes with τ x Y 0 \tau_{xY_0} τ x Y 0 . The one-copy word is therefore
σ P x a / 2 ρ ~ P − a / 2 τ x Y 0 a / 2 ρ ~ Y 0 − a / 2 θ , \sigma_{P_x}^{a/2}\widetilde{\rho}_P^{-a/2}\tau_{xY_0}^{a/2}\widetilde{\rho}_{Y_0}^{-a/2}\theta, σ P x a /2 ρ P − a /2 τ x Y 0 a /2 ρ Y 0 − a /2 θ ,
exactly the word in Lemma 5.1. That lemma bounds its log norm by − a η θ / 2 + C a 5 / 4 log C ( e dim x ) -a\eta\theta/2+Ca^{5/4}\log^C(e\dim x) − a η θ /2 + C a 5/4 log C ( e dim x ) . Substituting in (70) , and then using the inverse Cauchy–Schwarz inequality at the start of the proof, gives (67) . Every polynomial bound used in this argument was uniform in θ \theta θ .
Scalar symbols, products, and absolute values
The relative lower bound is now available. To control energy, we also need scalar descriptions of products and absolute values of local terms after a metric similarity transform. This requires a further argument beyond their individual expectations on product vectors.
Let d θ d\theta d θ be invariant probability measure on the unit sphere of V \mathcal{V} V . Unitary invariance and irreducibility of S k \mathcal{S}_k S k give
∫ P θ , k d θ = D k − 1 Π k . \int P_{\theta,k}\,d\theta= D_k^{-1}\Pi_k. ∫ P θ , k d θ = D k − 1 Π k .
The trace fixes the scalar. For a density matrix σ \sigma σ supported on S k \mathcal{S}_k S k , define its coherent probability measure by
d μ σ ( θ ) = D k Tr ( σ P θ , k ) d θ . (71) d\mu_\sigma(\theta)=D_k\operatorname{Tr}(\sigma P_{\theta,k})\,d\theta. \tag*{(71)} d μ σ ( θ ) = D k Tr ( σ P θ , k ) d θ . (71)
This is the coherent measure used in finite quantum de Finetti theorems [17 , 25 ] . We reproduce its fixed-copy approximation in the proof below, then establish the additional product calculus needed for the nonlinear functions of our metric. Here θ \theta θ is a pure one-copy state, whereas σ \sigma σ may be any symmetric replica density. The same σ \sigma σ defines both the operator expectation and the measure mixing the one-copy symbols below.
Lemma 6.4 (Marked-copy scalar symbols). Fix a partition P , Y , F P,Y,F P , Y , F of V \mathcal{V} V , 0 < t < 1 / 4 0<t<1/4 0 < t < 1/4 , and a one-copy operator h h h supported on P Y P Y P Y . Let A k A_k A k be (6.17) , and define on S k \mathcal{S}_k S k
O k = A k − 1 / 2 h A k 1 / 2 , f θ = ⟨ θ , ρ P t ρ Y − t h ρ P − t ρ Y t θ ⟩ , O_k=A_k^{-1/2}hA_k^{1/2},\qquad
f_\theta=\langle\theta,\rho_P^t\rho_Y^{-t}h\rho_P^{-t}\rho_Y^t\theta\rangle, O k = A k − 1/2 h A k 1/2 , f θ = ⟨ θ , ρ P t ρ Y − t h ρ P − t ρ Y t θ ⟩ ,
where ρ Q \rho_Q ρ Q is the Q Q Q marginal of θ \theta θ . All powers in f θ f_\theta f θ are zero on kernels. Then sup k ∥ O k ∥ < ∞ \sup_k\lVert O_k\rVert<\infty sup k ∥ O k ∥ < ∞ , with a bound allowed to depend on the fixed entire system and h h h . For every fixed noncommutative polynomial q q q in two variables,
sup σ ∣ Tr σ q ( O k , O k † ) − ∫ q ( f θ , f θ ‾ ) d μ σ ( θ ) ∣ ⟶ 0 , (72) \sup_\sigma\left|\operatorname{Tr}\sigma q(O_k,O_k^\dagger)-\int q(f_\theta,\overline{f_\theta})\,d\mu_\sigma(\theta)\right|\longrightarrow0, \tag*{(72)} σ sup Tr σ q ( O k , O k † ) − ∫ q ( f θ , f θ ) d μ σ ( θ ) ⟶ 0 , (72)
where the supremum is over all density matrices on S k \mathcal{S}_k S k . Moreover, for D k = ∣ O k ∣ + ∣ O k † ∣ − O k − O k † D_k=\lvert O_k\rvert+\lvert O_k^\dagger\rvert-O_k-O_k^\dagger D k = ∣ O k ∣ + ∣ O k † ∣ − O k − O k † ,
Tr σ D k = 2 ∫ ( ∣ f θ ∣ − Re f θ ) d μ σ ( θ ) + o k ( 1 ) , (73) \operatorname{Tr}\sigma D_k
=2\int\left(\lvert f_\theta\rvert-\operatorname{Re}f_\theta\right)\,d\mu_\sigma(\theta)+o_k(1), \tag*{(73)} Tr σ D k = 2 ∫ ( ∣ f θ ∣ − Re f θ ) d μ σ ( θ ) + o k ( 1 ) , (73)
uniformly in σ \sigma σ .
If 0 ≤ h ≤ I 0\le h\le I 0 ≤ h ≤ I has a designated supporting subsystem of dimension d h d_h d h , put x = Y ∩ supp h x=Y\cap\operatorname{supp}h x = Y ∩ supp h , Y 0 = Y ∖ x Y_0=Y\setminus x Y 0 = Y ∖ x , and
η θ = S θ ( x ∣ P ) + S θ ( x ∣ Y 0 ) = I θ ( x : F ∣ P ) = I θ ( x : F ∣ Y 0 ) . \eta_\theta=S_\theta(x\mid P)+S_\theta(x\mid Y_0)
=I_\theta(x:F\mid P)=I_\theta(x:F\mid Y_0). η θ = S θ ( x ∣ P ) + S θ ( x ∣ Y 0 ) = I θ ( x : F ∣ P ) = I θ ( x : F ∣ Y 0 ) .
Here the designated support may replace the minimal support in the definition of x x x . If a log ( e d h ) ≤ c a\log(e d_h)\le c a log ( e d h ) ≤ c , then
Tr σ D k ≤ C a 2 log C ( e d h ) ∫ η θ 1 / 8 d μ σ ( θ ) + o k ( 1 ) . (74) \operatorname{Tr}\sigma D_k
\le Ca^2\log^C(e d_h)\int\eta_\theta^{1/8}\,d\mu_\sigma(\theta)+o_k(1). \tag*{(74)} Tr σ D k ≤ C a 2 log C ( e d h ) ∫ η θ 1/8 d μ σ ( θ ) + o k ( 1 ) . (74)
The assertion also holds with the two outer parts exchanged.
Proof. We first replace the marked ratios by bounded polynomial words, then prove a product calculus for those words, and finally pass to absolute values. The inverse approximation must be applied on symmetric input vectors; no full-space bound for R Q , k − 1 R_{Q,k}^{-1} R Q , k − 1 is needed.
Bounded approximation on symmetric inputs. Between symmetric vectors, h ( k ) h^{(k)} h ( k ) may replace h ˉ \bar{h} h ˉ . The F F F factors commute with this term and cancel. Since W Q , k − 1 W_{Q,k-1} W Q , k − 1 commutes with W Q , k W_{Q,k} W Q , k and is disjoint from h ( k ) h^{(k)} h ( k ) , the remaining form is the compression of
R P , k R Y , k − 1 h ( k ) R P , k − 1 R Y , k . R_{P,k}R_{Y,k}^{-1}h^{(k)}R_{P,k}^{-1}R_{Y,k}. R P , k R Y , k − 1 h ( k ) R P , k − 1 R Y , k .
Write h h h as a finite sum of products c P ⊗ e Y c_P \otimes e_Y c P ⊗ e Y . Such a decomposition follows by expanding matrix units on the two parts of its support; its length and norm bounds are fixed here. For one product and a symmetric unit vector z z z , the quadratic form of (6.28) equals
⟨ R Y , k e Y † R Y , k − 1 z , R P , k c P R P , k − 1 z ⟩ . \left\langle R_{Y,k}e_Y^\dagger R_{Y,k}^{-1}z, R_{P,k}c_P R_{P,k}^{-1}z\right\rangle. ⟨ R Y , k e Y † R Y , k − 1 z , R P , k c P R P , k − 1 z ⟩ .
Both inverses act directly on z z z . The uniform forward operator bound and inverse vector bound from Lemma 6.2 bound these two vectors uniformly and therefore bound the numerical radius of O k O_k O k . The elementary inequality ∥ T ∥ ≤ 2 sup ∥ z ∥ = 1 ∣ ⟨ z , T z ⟩ ∣ \lVert T\rVert\le2\sup_{\lVert z\rVert=1} \lvert\langle z,Tz\rangle\rvert ∥ T ∥ ≤ 2 sup ∥ z ∥ = 1 ∣⟨ z , T z ⟩∣ , obtained by polarizing the quadratic form, proves uniform boundedness of O k O_k O k .
In (6.29) , replace each inverse by max ( J Q , k , δ ) − t \max(J_{Q,k},\delta)^{-t} max ( J Q , k , δ ) − t using (65) ; then replace each forward ratio by ( J Q , k ) + t (J_{Q,k})_+^t ( J Q , k ) + t using (64) . The first replacement has limiting error at most C V , t , h δ ( 1 − 2 t ) / 2 C_{V,t,h}\delta^{(1-2t)/2} C V , t , h δ ( 1 − 2 t ) /2 , uniformly on symmetric unit vectors. At fixed δ \delta δ the second has error tending to zero. Approximate the continuous functions u ↦ u + t u\mapsto u_+^t u ↦ u + t and u ↦ max ( u , δ ) − t u\mapsto\max(u,\delta)^{-t} u ↦ max ( u , δ ) − t uniformly on [ − 1 , 1 ] [-1,1] [ − 1 , 1 ] by polynomials. All star spectra lie in this interval. Polarization, applied after summing the finitely many product components, gives compressed operators B k B_k B k , each a fixed polynomial word in marked operators and stars, such that
lim sup k ∥ O k − B k ∥ ≤ ε . (75) \limsup_{k}\lVert O_k-B_k\rVert\le\varepsilon. \tag*{(75)} k lim sup ∥ O k − B k ∥ ≤ ε . (75)
Here any ε > 0 \varepsilon>0 ε > 0 is achieved by first choosing δ \delta δ , then the polynomials, and then taking the limit in k k k . The approximants may be chosen with a common bound on lim sup k ∥ B k ∥ \limsup_k\lVert B_k\rVert lim sup k ∥ B k ∥ ; an approximation-dependent threshold for k k k does not affect any of the limits below.
The coherent measure on a fixed number of copies. We next establish the uniform coherent-measure calculation for a fixed number of copies. If G G G acts on V ⊗ m \mathcal{V}^{\otimes m} V ⊗ m , let T k , m ( G ) T_{k,m}(G) T k , m ( G ) be its average over all ordered injections of these m m m copies into k k k copies. It preserves S k S_k S k . For k ≥ m k\ge m k ≥ m , symmetry gives Tr σ T k , m ( G ) = Tr σ ( m ) G \operatorname{Tr}\sigma T_{k,m}(G)=\operatorname{Tr}\sigma^{(m)}G Tr σ T k , m ( G ) = Tr σ ( m ) G . For the integral of its product-vector expectation, (6.23) gives the finite-copy identity [15 ]
∫ ⟨ θ ⊗ m , G θ ⊗ m ⟩ d μ σ ( θ ) = D k D k + m Tr [ ( σ ⊗ G ) Π k + m ] . (76) \int\langle\theta^{\otimes m},G\theta^{\otimes m}\rangle\,d\mu_\sigma(\theta)=\frac{D_k}{D_{k+m}}\operatorname{Tr}\left[(\sigma\otimes G)\Pi_{k+m}\right]. \tag*{(76)} ∫ ⟨ θ ⊗ m , G θ ⊗ m ⟩ d μ σ ( θ ) = D k + m D k Tr [ ( σ ⊗ G ) Π k + m ] . (76)
In the permutation expansion of Π k + m \Pi_{k+m} Π k + m , the fraction mapping every one of the last m m m indices into the first k k k is ( k ) m / ( k + m ) m = 1 − O m ( k − 1 ) (k)_m/(k+m)_m=1-O_m(k^{-1}) ( k ) m / ( k + m ) m = 1 − O m ( k − 1 ) . Any such permutation is equivalent, by a permutation of the first k k k indices on each side, to m m m disjoint swaps matching last indices with distinct first indices. Indeed reorder the old images of the last indices on the left and their old preimages on the right, then eliminate the remaining permutation among old indices. Both old permutations are absorbed because U ( π ) σ = σ U ( π ) = σ U(\pi)\sigma=\sigma U(\pi)=\sigma U ( π ) σ = σ U ( π ) = σ . The matched swaps contribute exactly Tr σ ( m ) G \operatorname{Tr}\sigma^{(m)}G Tr σ ( m ) G by partial trace. Every other term has absolute value at most ∥ σ ⊗ G ∥ 1 ≤ d m ∥ G ∥ \lVert\sigma\otimes G\rVert_1\le d^m\lVert G\rVert ∥ σ ⊗ G ∥ 1 ≤ d m ∥ G ∥ . Also D k / D k + m = 1 + O d , m ( k − 1 ) D_k/D_{k+m}=1+O_{d,m}(k^{-1}) D k / D k + m = 1 + O d , m ( k − 1 ) . Consequently
∣ Tr σ T k , m ( G ) − ∫ ⟨ θ ⊗ m , G θ ⊗ m ⟩ d μ σ ∣ ≤ C d , m ∥ G ∥ k , (77) \left\lvert\operatorname{Tr}\sigma T_{k,m}(G)-\int\langle\theta^{\otimes m},G\theta^{\otimes m}\rangle\,d\mu_\sigma\right\rvert\le\frac{C_{d,m}\lVert G\rVert}{k}, \tag*{(77)} Tr σ T k , m ( G ) − ∫ ⟨ θ ⊗ m , G θ ⊗ m ⟩ d μ σ ≤ k C d , m ∥ G ∥ , (77)
uniformly in σ \sigma σ .
Products after compression. The remaining issue is multiplication after compression. For any ambient operator B B B , define its full-copy permutation average
T k ( B ) = 1 k ! ∑ π ∈ S k U ( π ) B U ( π ) † . \mathcal{T}_k(B) = \frac{1}{k!}\sum_{\pi\in S_k} U(\pi)BU(\pi)^\dagger. T k ( B ) = k ! 1 π ∈ S k ∑ U ( π ) B U ( π ) † .
It commutes with all U ( π ) U(\pi) U ( π ) , hence preserves symmetry, and
Π k B Π k ∣ S k = T k ( B ) ∣ S k . \Pi_kB\Pi_k\big|_{\mathcal{S}_k}=\mathcal{T}_k(B)\big|_{\mathcal{S}_k}. Π k B Π k S k = T k ( B ) S k .
Products of compressed words are therefore restrictions of products of their full permutation averages. The multiplication of these averages uses disjoint placements of fixed copy blocks, as in the mean-field symmetrization argument of [35 ] , Lemma IV.1. For fixed operators G G G , H H H on m m m , n n n copies, respectively,
∥ T k , m ( G ) T k , n ( H ) − T k , m + n ( G ⊗ H ) ∥ ≤ C m , n ∥ G ∥ ∥ H ∥ k . (78) \left\|\mathcal{T}_{k,m}(G)\mathcal{T}_{k,n}(H)-\mathcal{T}_{k,m+n}(G\otimes H)\right\|\leq\frac{C_{m,n}\|G\|\|H\|}{k}. \tag*{(78)} ∥ T k , m ( G ) T k , n ( H ) − T k , m + n ( G ⊗ H ) ∥ ≤ k C m , n ∥ G ∥∥ H ∥ . (78)
for sufficiently large k k k . Indeed two independently chosen injections have intersecting images with probability O m , n ( k − 1 ) O_{m,n}(k^{-1}) O m , n ( k − 1 ) . Conditional on disjoint images, their union is a uniform ordered injection of m + n m+n m + n copies. The intersecting terms and the change in normalization each cost at most that probability times ∥ G ∥ ∥ H ∥ \|G\|\|H\| ∥ G ∥∥ H ∥ .
Expand a fixed star word as sums over its donor indices, with one marked center. Repeated donor indices have total coefficient weight O ( k − 1 ) O(k^{-1}) O ( k − 1 ) , so their contribution has norm O ( k − 1 ) O(k^{-1}) O ( k − 1 ) for that fixed word. After averaging each word separately, both its center and its donors occupy a uniformly relocated block of indices. For a monomial containing r r r stars, its distinct-donor terms give an injection average with coefficient ( k − 1 ) r / k r = 1 + O r ( k − 1 ) (k-1)_r/k^r=1+O_r(k^{-1}) ( k − 1 ) r / k r = 1 + O r ( k − 1 ) . Thus each averaged word is, up to operator-norm error O ( k − 1 ) O(k^{-1}) O ( k − 1 ) , a finite sum of injection averages of fixed operators. Iterating (78) puts a product of words on disjoint blocks, with a separate center for each word.
On a product vector, a donor appearing in one partial swap contracts to ρ Q \rho_Q ρ Q on the center. In matrix units this is the identity
Tr d o n o r [ ( ∣ θ ⟩ ⟨ θ ∣ ) d o n o r ∑ a , b ( E a b ) Q , d o n o r ⊗ ( E b a ) Q , c e n t e r ] = ( ρ Q ) c e n t e r . \operatorname{Tr}_{\mathrm{donor}}\left[(|\theta\rangle\langle\theta|)_{\mathrm{donor}}\sum_{a,b}(E_{ab})_{Q,\mathrm{donor}}\otimes(E_{ba})_{Q,\mathrm{center}}\right]=(\rho_Q)_{\mathrm{center}}. Tr donor ( ∣ θ ⟩ ⟨ θ ∣ ) donor a , b ∑ ( E ab ) Q , donor ⊗ ( E ba ) Q , center = ( ρ Q ) center .
Tracing distinct donors successively preserves the order of the operators on each center. The separate centers give multiplication of scalar expectations, since
⟨ θ ⊗ ( m + n ) , ( G ⊗ H ) θ ⊗ ( m + n ) ⟩ = ⟨ θ ⊗ m , G θ ⊗ m ⟩ ⟨ θ ⊗ n , H θ ⊗ n ⟩ . \langle\theta^{\otimes(m+n)},(G\otimes H)\theta^{\otimes(m+n)}\rangle=\langle\theta^{\otimes m},G\theta^{\otimes m}\rangle\langle\theta^{\otimes n},H\theta^{\otimes n}\rangle. ⟨ θ ⊗ ( m + n ) , ( G ⊗ H ) θ ⊗ ( m + n ) ⟩ = ⟨ θ ⊗ m , G θ ⊗ m ⟩ ⟨ θ ⊗ n , H θ ⊗ n ⟩ .
It follows that a polynomial approximant has the symbol obtained by replacing its stars by the corresponding marginal densities, its adjoint has the complex conjugate symbol, and products multiply these scalar symbols. Applying (77) proves these assertions uniformly in the symmetric density matrix, for each fixed polynomial word.
Removing clipping and taking absolute values. We have proved the product assertion with fixed clipping. To remove clipping on the one-copy side, use
∑ 0 < p i < δ p i 1 − 2 t ≤ d Q δ 1 − 2 t . \sum_{0<p_i<\delta}p_i^{1-2t}\leq d_Q\delta^{1-2t}. 0 < p i < δ ∑ p i 1 − 2 t ≤ d Q δ 1 − 2 t .
for the eigenvalues of any marginal density. This bounds the squared norm of its inverse-power tail on θ \theta θ , uniformly in θ \theta θ . The clipped one-copy vectors corresponding to (6.29) therefore converge uniformly to their support-power limits, and their inner product converges uniformly to the zero-kernel-power expression f θ f_\theta f θ . In particular this symbol is bounded and continuous, as a uniform limit of the clipped continuous symbols. Telescoping fixed products in (75) , using the common limiting norm bound, now proves (72) .
In particular, both O k † O k O_k^\dagger O_k O k † O k and O k O k † O_k O_k^\dagger O k O k † have symbol ∣ f θ ∣ 2 \lvert f_\theta\rvert^2 ∣ f θ ∣ 2 . Choose an interval [ 0 , M 2 ] [0,M^2] [ 0 , M 2 ] containing all their spectra and all values ∣ f θ ∣ 2 \lvert f_\theta\rvert^2 ∣ f θ ∣ 2 . Uniform polynomial approximation of the square root on that interval gives symbols ∣ f θ ∣ \lvert f_\theta\rvert ∣ f θ ∣ for ∣ O k ∣ \lvert O_k\rvert ∣ O k ∣ and ∣ O k † ∣ \lvert O_k^\dagger\rvert ∣ O k † ∣ , with arbitrarily small uniform expectation errors. This argument applies whether or not O k O_k O k is normal. Combining with the linear terms proves (73) . Finally apply Lemma 5.3 pointwise to f θ f_\theta f θ to obtain (74) . Purity gives the two expressions for η θ \eta_\theta η θ ; enlarging x x x to the designated supporting subsystem is allowed by that lemma. The proof is unchanged after exchanging P P P and F F F .
The section has supplied two compatible one-copy quantities: the gain η θ \eta_\theta η θ in (67) , and the cost η θ 1 / 8 \eta_\theta^{1/8} η θ 1/8 in (74) . The operator lower bound can be tested against any symmetric density, and the symbol error is uniform over those densities, with the prescribed order of limits. They can therefore be applied to the same density matrices when metric changes are averaged.
Transport through finite trees of metrics
The relative metric estimate of Lemma 6.3 measures the entropy gained by one change of partition. We now combine such changes through a finite tree of matrix means. The resulting derivative is an average of entropy gains against positive, trace-one states. The same states control the energy of the filtered vector. A second occurrence of the probability that a term is split is essential in this energy estimate. All trees, one-copy spaces, and partitions in this section are finite and are fixed before the number of copies tends to infinity. The matrix means carry perturbations from leaves to the root. The trace adjoints of their normalized derivatives carry a density matrix at the root back to each leaf; this reverse passage will identify the states used in both estimates.
Positive matrix means and their derivatives
For positive definite operators A A A , B B B on a finite-dimensional Hilbert space and 0 ≤ p ≤ 1 0 \le p \le1 0 ≤ p ≤ 1 , define
A # p B = A 1 / 2 ( A − 1 / 2 B A − 1 / 2 ) p A 1 / 2 . (79) A\#_{p}B=A^{1/2}\left(A^{-1/2}BA^{-1/2}\right)^{p}A^{1/2}. \tag*{(79)} A # p B = A 1/2 ( A − 1/2 B A − 1/2 ) p A 1/2 . (79)
A binary operation of this form is the weighted operator geometric mean in the Kubo–Ando framework [24 ] ; the earlier geometric mean of positive forms is due to Pusz and Woronowicz [34 ] . We prove below the finite-tree properties and normalized derivative identities needed for the entropy and energy estimates. A weighted binary tree is a finite rooted binary tree with a parameter p ∈ [ 0 , 1 ] p \in[0,1] p ∈ [ 0 , 1 ] assigned to each internal vertex; its two outgoing edges have weights 1 − p 1-p 1 − p and p p p , respectively. Its terminal weights are the products of edge weights along root-to-leaf paths; they sum to one. Assign positive definite operators to the leaves and evaluate each internal vertex by (79) . This defines the root operator. An edge of weight zero is omitted, and a vertex with only one remaining child is contracted. Any finite probability distribution can be represented in this way, by successively splitting its support and using conditional probabilities. The choice of tree is part of the data; no associativity of matrix means is asserted.
Lemma 7.1 (Properties of a finite mean tree). *Let T T T be a weighted binary tree with terminal weights w j w_j w j and positive definite inputs A j A_j A j , and let M M M be its root. The root commutes with invertible congruence, is monotone in each input, and satisfies
T ( c j A j : j ) = ( ∏ j c j w j ) M ( c j > 0 ) . (80) T(c_jA_j:j)=\left(\prod_j c_j^{w_j}\right)M \qquad(c_j>0). \tag*{(80)} T ( c j A j : j ) = ( j ∏ c j w j ) M ( c j > 0 ) . (80)
For every unit vector z z z ,
⟨ z , M z ⟩ ≤ ∏ j ⟨ z , A j z ⟩ w j . (81) \langle z,Mz\rangle\le\prod_j\langle z,A_jz\rangle^{w_j}. \tag*{(81)} ⟨ z , M z ⟩ ≤ j ∏ ⟨ z , A j z ⟩ w j . (81)
If P P P is an orthogonal projection and A j ≥ c j P A_j\ge c_jP A j ≥ c j P with c j > 0 c_j>0 c j > 0 , then
M ≥ ( ∏ j c j w j ) P . (82) M\ge\left(\prod_j c_j^{w_j}\right)P. \tag*{(82)} M ≥ ( j ∏ c j w j ) P . (82)
Finally, suppose A j = ∏ g = 1 K A j , g A_j=\prod_{g=1}^{K}A_{j,g} A j = ∏ g = 1 K A j , g with positive definite factors, and every factor from band g g g commutes with every factor from band g ′ g' g ′ whenever g ≠ g ′ g\ne g' g = g ′ . Then M = ∏ g = 1 K M g M=\prod_{g=1}^{K}M_g M = ∏ g = 1 K M g , where M g M_g M g is the root of the same weighted tree with inputs A j , g A_{j,g} A j , g . The factors M g M_g M g commute.
Proof. We first prove the assertions for one binary vertex. For an invertible S S S , put A ^ = S ∗ A S \widehat{A}=S^*AS A = S ∗ A S and U = A 1 / 2 S A ^ − 1 / 2 U=A^{1/2}S\widehat{A}^{-1/2} U = A 1/2 S A − 1/2 . Then U U U is unitary and
A ^ − 1 / 2 S ∗ B S A ^ − 1 / 2 = U ∗ ( A − 1 / 2 B A − 1 / 2 ) U . \widehat{A}^{-1/2}S^*BS\widehat{A}^{-1/2}=U^*(A^{-1/2}BA^{-1/2})U. A − 1/2 S ∗ B S A − 1/2 = U ∗ ( A − 1/2 B A − 1/2 ) U .
Functional calculus proves ( S ∗ A S ) # p ( S ∗ B S ) = S ∗ ( A # p B ) S (S^*AS)\#_p(S^*BS)=S^*(A\#_pB)S ( S ∗ A S ) # p ( S ∗ B S ) = S ∗ ( A # p B ) S . After congruence to A = I A=I A = I , the identity A # p B = B # 1 − p A A\#_pB=B\#_{1-p}A A # p B = B # 1 − p A reduces to C p = C 1 / 2 ( C − 1 ) 1 − p C 1 / 2 C^p=C^{1/2}(C^{-1})^{1-p}C^{1/2} C p = C 1/2 ( C − 1 ) 1 − p C 1/2 . For 0 < p < 1 0<p<1 0 < p < 1 , the scalar formula
x p = sin ( π p ) π ∫ 0 ∞ λ p − 1 x ( x + λ ) − 1 d λ x^p=\frac{\sin(\pi p)}{\pi}\int_0^\infty\lambda^{p-1}x(x+\lambda)^{-1}\,d\lambda x p = π sin ( π p ) ∫ 0 ∞ λ p − 1 x ( x + λ ) − 1 d λ
follows by substituting λ = x t \lambda=xt λ = x t in the beta integral. The inverse reverses the order of positive definite operators, so C ( C + λ I ) − 1 = I − λ ( C + λ I ) − 1 C(C+\lambda I)^{-1}=I-\lambda(C+\lambda I)^{-1} C ( C + λ I ) − 1 = I − λ ( C + λ I ) − 1 is increasing in C C C . Thus C ↦ C p C\mapsto C^p C ↦ C p is operator monotone. This proves monotonicity in B B B , and symmetry proves it in A A A . The endpoint cases are immediate. Scalar homogeneity at a vertex is ( c A ) # p ( d B ) = c 1 − p d p ( A # p B ) (cA)\#_p(dB)=c^{1-p}d^p(A\#_pB) ( c A ) # p ( d B ) = c 1 − p d p ( A # p B ) .
For the vector inequality let r = ⟨ z , A z ⟩ r=\langle z,Az\rangle r = ⟨ z , A z ⟩ and y = A 1 / 2 z / r y=A^{1/2}z/\sqrt{r} y = A 1/2 z / r . Scalar Jensen applied to the spectral measure of C = A − 1 / 2 B A − 1 / 2 C=A^{-1/2}BA^{-1/2} C = A − 1/2 B A − 1/2 in the unit vector y y y gives
⟨ z , ( A # p B ) z ⟩ = r ⟨ y , C p y ⟩ ≤ r ⟨ y , C y ⟩ p = ⟨ z , A z ⟩ 1 − p ⟨ z , B z ⟩ p . \langle z,(A\#_pB)z\rangle=r\langle y,C^py\rangle\le r\langle y,Cy\rangle^p=\langle z,Az\rangle^{1-p}\langle z,Bz\rangle^p. ⟨ z , ( A # p B ) z ⟩ = r ⟨ y , C p y ⟩ ≤ r ⟨ y , C y ⟩ p = ⟨ z , A z ⟩ 1 − p ⟨ z , B z ⟩ p .
Induction proves the congruence, monotonicity, homogeneity, and vector inequality for the full tree. To prove (82) , fix 0 < ε < 1 0<\varepsilon<1 0 < ε < 1 . For every leaf,
A j − ( 1 − ε ) c j P = ( 1 − ε ) ( A j − c j P ) + ε A j ≥ ε λ min ( A j ) I . A_j-(1-\varepsilon)c_jP=(1-\varepsilon)(A_j-c_jP)+\varepsilon A_j\ge\varepsilon\lambda_{\min}(A_j)I. A j − ( 1 − ε ) c j P = ( 1 − ε ) ( A j − c j P ) + ε A j ≥ ε λ m i n ( A j ) I .
Choose a common δ > 0 \delta>0 δ > 0 so small that ( 1 − ε ) c j δ ≤ ε λ min ( A j ) (1-\varepsilon)c_j\delta\le\varepsilon\lambda_{\min}(A_j) ( 1 − ε ) c j δ ≤ ε λ m i n ( A j ) for all leaves. Monotonicity and homogeneity applied to the strictly positive inputs ( 1 − ε ) c j ( P + δ I ) (1-\varepsilon)c_j(P+\delta I) ( 1 − ε ) c j ( P + δ I ) give
M ≥ ( 1 − ε ) ( ∏ j c j w j ) ( P + δ I ) ≥ ( 1 − ε ) ( ∏ j c j w j ) P . M\ge(1-\varepsilon)\left(\prod_j c_j^{w_j}\right)(P+\delta I)\ge(1-\varepsilon)\left(\prod_j c_j^{w_j}\right)P. M ≥ ( 1 − ε ) ( j ∏ c j w j ) ( P + δ I ) ≥ ( 1 − ε ) ( j ∏ c j w j ) P .
Let ε \varepsilon ε decrease to zero. This argument needs no definition of the mean on singular inputs.
For the last assertion, cross-band commutation implies
( ∏ g D g ) # p ( ∏ g E g ) = ∏ g ( D g # p E g ) . \left(\prod_g D_g\right)\#_p\left(\prod_g E_g\right)=\prod_g(D_g\#_pE_g). ( g ∏ D g ) # p ( g ∏ E g ) = g ∏ ( D g # p E g ) .
Indeed the inverse square root of the first product factors, its whitened second input is the product of the commuting positive operators D g − 1 / 2 E g D g − 1 / 2 D_g^{-1/2}E_gD_g^{-1/2} D g − 1/2 E g D g − 1/2 , and the p p p th power factors. Induction over the tree completes the proof.
We next describe how a perturbation at a leaf reaches the root. A linear map on matrices is completely positive if its entrywise action on every matrix amplification preserves positive semidefinite matrices. It is unital if it maps the identity to the identity.
Lemma 7.2 (Normalized derivative maps). At a binary vertex with output M M M and a child D D D of positive edge weight w w w , define
Φ D ( Z ) = 1 w M − 1 / 2 ∂ D M [ D 1 / 2 Z D 1 / 2 ] M − 1 / 2 . (83) \Phi_D(Z)=\frac{1}{w}M^{-1/2}\partial_D M[D^{1/2}ZD^{1/2}]M^{-1/2}. \tag*{(83)} Φ D ( Z ) = w 1 M − 1/2 ∂ D M [ D 1/2 Z D 1/2 ] M − 1/2 . (83)
Here ∂ D \partial_D ∂ D is the Fréchet derivative with the other child and the weight fixed. This map is unital and completely positive. Composing these maps from a terminal leaf j j j to the root gives a unital completely positive map Φ j \Phi_j Φ j such that
M − 1 / 2 ∂ A j M [ A j 1 / 2 Z A j 1 / 2 ] M − 1 / 2 = w j Φ j ( Z ) . M^{-1/2}\partial_{A_j}M[A_j^{1/2}ZA_j^{1/2}]M^{-1/2}=w_j\Phi_j(Z). M − 1/2 ∂ A j M [ A j 1/2 Z A j 1/2 ] M − 1/2 = w j Φ j ( Z ) .
If all tree inputs are block diagonal for a fixed orthogonal decomposition, these maps preserve each matrix block. On the first diagonal block they are the normalized derivative maps for the tree of first diagonal blocks and do not depend on the other diagonal blocks.
Proof. Differentiating (7.5) gives
D ( C p ) [ H ] = sin ( π p ) π ∫ 0 ∞ λ p ( C + λ I ) − 1 H ( C + λ I ) − 1 d λ . D(C^p)[H]=\frac{\sin(\pi p)}{\pi}\int_0^\infty\lambda^p(C+\lambda I)^{-1}H(C+\lambda I)^{-1}\,d\lambda. D ( C p ) [ H ] = π sin ( π p ) ∫ 0 ∞ λ p ( C + λ I ) − 1 H ( C + λ I ) − 1 d λ .
The integral converges in operator norm: its integrand is O ( λ p ) O(\lambda^p) O ( λ p ) at zero and O ( λ p − 2 ) O(\lambda^{p-2}) O ( λ p − 2 ) at infinity. Each integrand is a completely positive sandwich map. Formula (7.8) , together with the congruences in (79) , proves complete positivity for the second child. Exchange symmetry proves it for the first child. Scalar homogeneity gives ∂ D M [ D ] = w M \partial_D M[D]=wM ∂ D M [ D ] = w M , proving unitality. The chain rule, with the square-root normalizations cancelling at successive vertices, proves (7.7) . Composition preserves both properties; the map along an empty path is the identity. In the derivative integral all sandwich factors are block diagonal when the inputs are block diagonal; their first blocks depend only on the first blocks of the inputs. The same is true after exchanging the children and composing the maps.
Write ad Q ( Z ) = Q Z − Z Q \operatorname{ad}_Q(Z)=QZ-ZQ ad Q ( Z ) = QZ − Z Q . The functions below convert normalized matrix derivatives into derivatives of vector norms and into energy errors. Fix 0 < s < 1 / 2 0<s<1/2 0 < s < 1/2 and set
g s ( z ) = sinh ( s z ) sinh ( z / 2 ) , m s ( u ) = sin ( 2 π s ) cosh ( 2 π u ) + cos ( 2 π s ) , g s ( 0 ) = 2 s . g_s(z)=\frac{\sinh(sz)}{\sinh(z/2)},\qquad m_s(u)=\frac{\sin(2\pi s)}{\cosh(2\pi u)+\cos(2\pi s)},\qquad g_s(0)=2s. g s ( z ) = sinh ( z /2 ) sinh ( sz ) , m s ( u ) = cosh ( 2 π u ) + cos ( 2 π s ) sin ( 2 π s ) , g s ( 0 ) = 2 s .
The function g s g_s g s is a rescaling of the classical positive-definite hyperbolic-sine kernel studied in [10 ] , Theorem 3.2. We give the Fourier normalization and the shifted-density comparison needed here.
Lemma 7.3 (The two Fourier multipliers). For real z z z ,
g s ( z ) = ∫ R e i u z m s ( u ) d u , m s ( u ) > 0 , ∫ R m s ( u ) d u = 2 s . (84) g_s(z)=\int_{\mathbb{R}} e^{iuz}m_s(u)\,du,\qquad m_s(u)>0,\qquad\int_{\mathbb{R}}m_s(u)\,du=2s. \tag*{(84)} g s ( z ) = ∫ R e i u z m s ( u ) d u , m s ( u ) > 0 , ∫ R m s ( u ) d u = 2 s . (84)
For s = 1 / 4 s=1/4 s = 1/4 , the functions
h ± ( z ) = e ± s z − 1 2 sinh ( z / 2 ) = ± e ± s z / 2 g s / 2 ( z ) (85) h_{\pm}(z)=\frac{e^{\pm sz}-1}{2\sinh(z/2)}=\pm e^{\pm sz/2}g_{s/2}(z) \tag*{(85)} h ± ( z ) = 2 sinh ( z /2 ) e ± sz − 1 = ± e ± sz /2 g s /2 ( z ) (85)
have Fourier densities
q ± ( u ) = ± m s / 2 ( u ± i s / 2 ) , ∣ q ± ( u ) ∣ ≤ 1 2 m s ( u ) . (86) q_{\pm}(u)=\pm m_{s/2}(u\pm is/2),\qquad|q_{\pm}(u)|\leq\frac{1}{\sqrt{2}}m_s(u). \tag*{(86)} q ± ( u ) = ± m s /2 ( u ± i s /2 ) , ∣ q ± ( u ) ∣ ≤ 2 1 m s ( u ) . (86)
The quotients in (85) are interpreted continuously at zero.
Proof. For fixed real z ≠ 0 z\ne0 z = 0 , integrate e i u z m s ( u ) e^{iuz}m_s(u) e i u z m s ( u ) around a rectangle between the lines R \mathbb{R} R and R + i \mathbb{R}+i R + i . The vertical integrals tend to zero because the denominator grows exponentially with ∣ ℜ u ∣ |\Re u| ∣ℜ u ∣ . The two poles in the strip are i ( 1 / 2 − s ) i(1/2-s) i ( 1/2 − s ) and i ( 1 / 2 + s ) i(1/2+s) i ( 1/2 + s ) , with residues of m s m_s m s equal to 1 / ( 2 π i ) 1/(2\pi i) 1/ ( 2 π i ) and − 1 / ( 2 π i ) -1/(2\pi i) − 1/ ( 2 π i ) , respectively. Since m s ( u + i ) = m s ( u ) m_s(u+i)=m_s(u) m s ( u + i ) = m s ( u ) , the residue theorem gives
( 1 − e − z ) ∫ R e i u z m s ( u ) d u = e − ( 1 / 2 − s ) z − e − ( 1 / 2 + s ) z . (1-e^{-z})\int_{\mathbb{R}}e^{iuz}m_s(u)\,du=e^{-(1/2-s)z}-e^{-(1/2+s)z}. ( 1 − e − z ) ∫ R e i u z m s ( u ) d u = e − ( 1/2 − s ) z − e − ( 1/2 + s ) z .
Division gives (84) ; dominated convergence gives its value at zero. Positivity follows from the displayed denominator.
The algebraic identities in (85) follow by factoring e ± s z − 1 e^{\pm sz}-1 e ± sz − 1 . The nearest poles of m s / 2 m_{s/2} m s /2 have imaginary parts of absolute value 1 / 2 − s / 2 1/2-s/2 1/2 − s /2 , larger than s / 2 s/2 s /2 . Shifting its Fourier contour by ± i s / 2 \pm is/2 ± i s /2 therefore crosses no pole and gives the densities in (86) . To check the bound without losing a constant, write c = cosh ( 2 π u ) c=\cosh(2\pi u) c = cosh ( 2 π u ) . At s = 1 / 4 s=1/4 s = 1/4 ,
m s ( u ) = c − 1 , m s / 2 ( u ± i s / 2 ) = 1 c + 1 ± i sinh ( 2 π u ) . m_s(u)=c^{-1},\qquad m_{s/2}(u\pm is/2)=\frac{1}{c+1\pm i\sinh(2\pi u)}. m s ( u ) = c − 1 , m s /2 ( u ± i s /2 ) = c + 1 ± i sinh ( 2 π u ) 1 .
Consequently
∣ m s / 2 ( u ± i s / 2 ) ∣ m s ( u ) = c 2 ( c + 1 ) ≤ 1 2 . \frac{|m_{s/2}(u\pm is/2)|}{m_s(u)}=\sqrt{\frac{c}{2(c+1)}}\leq\frac{1}{\sqrt{2}}. m s ( u ) ∣ m s /2 ( u ± i s /2 ) ∣ = 2 ( c + 1 ) c ≤ 2 1 .
Finite histories and entropy gains
We specify the data to which the transport estimate applies. Let V \mathcal{V} V be a fixed finite tensor product of one-copy physical and auxiliary spaces, and put S k = Sym k V \mathcal{S}_k=\operatorname{Sym}^k\mathcal{V} S k = Sym k V . The metrics W Q , k W_{Q,k} W Q , k are defined in (62) and studied in Lemma 6.2, with the common padding dimension dim V \dim\mathcal{V} dim V . We suppress k k k in W Q , k W_{Q,k} W Q , k . A partition ( P , Y , F ) (P,Y,F) ( P , Y , F ) of these tensor factors has band metric
A ( P , Y , F ) = ( W P − 1 W F − 1 W Y ) 2 on S k . (87) A(P,Y,F)=\left(W_P^{-1}W_F^{-1}W_Y\right)^2\text{ on }\mathcal{S}_k. \tag*{(87)} A ( P , Y , F ) = ( W P − 1 W F − 1 W Y ) 2 on S k . (87)
All three factors in this formula commute and are positive definite.
Fix a positive integer K K K and a finite weighted history tree with leaves h ∈ H h\in\mathcal{H} h ∈ H and weights w h > 0 w_h>0 w h > 0 . For each h h h and g ∈ { 1 , … , K } g\in\{1,\ldots,K\} g ∈ { 1 , … , K } choose an old partition ( P h , g , Y h , g , F h , g ) (P_{h,g},Y_{h,g},F_{h,g}) ( P h , g , Y h , g , F h , g ) . At each history h h h also fix a finite conditional choice tree with leaves c ∈ C h c\in\mathcal{C}_h c ∈ C h and weights q c ∣ h > 0 q_{c|h}>0 q c ∣ h > 0 . A choice specifies a new partition in every band. Each new partition is obtained either by doing nothing or by transferring a tensor subsystem x ⊆ Y x \subseteq Y x ⊆ Y entirely to P P P or entirely to F F F . Write A h , g A_{h,g} A h , g and A h , c , g A_{h,c,g} A h , c , g for the old and new band metrics and set
A h = ∏ g = 1 K A h , g , A h , c = ∏ g = 1 K A h , c , g . A_h = \prod_{g=1}^{K} A_{h,g}, \qquad A_{h,c} = \prod_{g=1}^{K} A_{h,c,g}. A h = g = 1 ∏ K A h , g , A h , c = g = 1 ∏ K A h , c , g .
We impose the following commutation condition: every old or new metric from band g g g commutes with every old or new metric from band g ′ g' g ′ for g ≠ g ′ g \ne g' g = g ′ , including metrics at different histories and choices. No commutation within a band is required.
Let B h B_h B h be the conditional choice-tree root with inputs A h , c A_{h,c} A h , c . For one common parameter p ∈ [ 0 , 1 ] p \in[0,1] p ∈ [ 0 , 1 ] , replace each old input of the history tree by A h # p B h A_h \#_p B_h A h # p B h and call the resulting root M ( p ) M(p) M ( p ) . Its terminal leaves at 0 < p < 1 0 < p < 1 0 < p < 1 are
j = ( h , o l d ) , π j = ( 1 − p ) w h , or j = ( h , c , n e w ) , π j = p w h q c ∣ h . (88) j = (h,\mathrm{old}), \qquad\pi_j = (1-p)w_h, \qquad\text{or} \qquad j = (h,c,\mathrm{new}), \qquad\pi_j = p w_h q_{c|h}. \tag*{(88)} j = ( h , old ) , π j = ( 1 − p ) w h , or j = ( h , c , new ) , π j = p w h q c ∣ h . (88)
Their metrics are A h A_h A h and A h , c A_{h,c} A h , c , respectively. At p = 1 p=1 p = 1 this is the history tree with the conditional choice trees attached; it can serve as the old tree of a subsequent round. The same p p p is used at every history in a round.
Figure 1 displays the two types of terminal leaf. The history and conditional-choice weights are products along paths; the single interpolation vertex contributes 1 − p 1-p 1 − p or p p p .
Figure 1. One history and one conditional choice in a round. Arrows point toward the root and show metric evaluation; every internal vertex uses its specified geometric mean. Dotted arrows abbreviate whole paths, not single edges. The same interpolation parameter p p p is used at every history. Trace adjoints of normalized derivatives carry states in the reverse direction.
For a unit vector θ ∈ V \theta\in\mathcal{V} θ ∈ V , the entropy assigned to a move of x x x to P P P , with Y = x Y 0 Y = xY_0 Y = x Y 0 , is
η h , c , g ( θ ) = S θ ( x ∣ P ) + S θ ( x ∣ Y 0 ) = I θ ( x : F ∣ P ) ≥ 0. (89) \eta_{h,c,g}(\theta) = S_\theta(x \mid P) + S_\theta(x \mid Y_0) = I_\theta(x : F \mid P) \ge0. \tag*{(89)} η h , c , g ( θ ) = S θ ( x ∣ P ) + S θ ( x ∣ Y 0 ) = I θ ( x : F ∣ P ) ≥ 0. (89)
For a move to F F F exchange P P P and F F F in this definition. A choice that makes no move has η h , c , g = 0 \eta_{h,c,g}=0 η h , c , g = 0 . The equality in (89) follows by purity on P x Y 0 F P xY_0F P x Y 0 F . Choose ℓ ≥ 1 \ell\ge1 ℓ ≥ 1 bounding log ( e dim x ) \log(e\dim x) log ( e dim x ) for every transferred subsystem. Throughout, a = 2 t > 0 a=2t>0 a = 2 t > 0 satisfies the smallness hypotheses of Lemmas 6.3 and 5.3; in particular t < 1 / 4 t<1/4 t < 1/4 and a ℓ a\ell a ℓ is bounded by a sufficiently small absolute constant.
For the energy part of the estimate, let 0 ≤ h i ≤ I 0 \le h_i \le I 0 ≤ h i ≤ I , i i i in a finite index set, act on physical tensor factors, and let D i D_i D i be a designated tensor support containing the actual support of h i h_i h i . For each terminal partition and each band, assume D i D_i D i is contained in one of its three parts, except possibly in one band. In that exceptional band, D i D_i D i meets Y Y Y and exactly one of P , F P,F P , F . Call this a split of i i i at leaf j j j , and write J i \mathcal{J}_i J i for the set of such leaves. For a split put x = D i ∩ Y x=D_i\cap Y x = D i ∩ Y , let the receiving side be the part P P P or F F F met by D i D_i D i , and define η i , j \eta_{i,j} η i , j by the corresponding formula (89) . In addition to the bounds for all transferred subsystems, require log ( e dim D i ) ≤ ℓ \log(e\dim D_i)\leq\ell log ( e dim D i ) ≤ ℓ for every i i i with J i ≠ ∅ \mathcal{J}_i\neq\varnothing J i = ∅ , retaining the smallness condition on a ℓ a\ell a ℓ . No support-dimension bound is required for terms that are unsplit at every terminal leaf. These are explicit assumptions on a finite collection of partitions and supports; geometric ways to satisfy them are considered later.
Define
h ˉ i = 1 k ∑ r = 1 k h i , r ∣ S k , H ˉ = ∑ i h ˉ i , W i ( p ) = ∑ j ∈ J i π j . (90) \bar{h}_i=\left.\frac{1}{k}\sum_{r=1}^{k}h_{i,r}\right|_{\mathcal{S}_k},\qquad\bar{H}=\sum_i\bar{h}_i,\qquad W_i(p)=\sum_{j\in\mathcal{J}_i}\pi_j. \tag*{(90)} h ˉ i = k 1 r = 1 ∑ k h i , r S k , H ˉ = i ∑ h ˉ i , W i ( p ) = j ∈ J i ∑ π j . (90)
If a leaf does not split i i i , its metric commutes with h ˉ i \bar{h}_i h ˉ i . Indeed, when D i D_i D i is contained in a partition part, the sum of its copy-translates commutes with every copy permutation on that part and with every permutation on its disjoint complement. It therefore commutes with the Schur-label functions defining that band’s metric. Apply this argument in every band.
For use in the statement, recall the coherent vectors and measures
P θ , k = ∣ θ ⊗ k ⟩ ⟨ θ ⊗ k ∣ , D k = dim S k , d μ σ ( θ ) = D k Tr ( σ P θ , k ) d θ , (91) P_{\theta,k}=\lvert\theta^{\otimes k}\rangle\langle\theta^{\otimes k}\rvert,\qquad D_k=\dim\mathcal{S}_k,\qquad d\mu_\sigma(\theta)=D_k\operatorname{Tr}(\sigma P_{\theta,k})\,d\theta, \tag*{(91)} P θ , k = ∣ θ ⊗ k ⟩ ⟨ θ ⊗ k ∣ , D k = dim S k , d μ σ ( θ ) = D k Tr ( σ P θ , k ) d θ , (91)
where d θ d\theta d θ is Haar probability on the unit sphere of V \mathcal{V} V . For a density matrix σ \sigma σ on S k \mathcal{S}_k S k , this is a probability measure, since D k ∫ P θ , k d θ = I S k D_k\int P_{\theta,k}\,d\theta=I_{\mathcal{S}_k} D k ∫ P θ , k d θ = I S k .
Proposition 7.4 (Entropy and energy transport). Fix a finite one-copy space, history and conditional choice trees, partitions, cross-band commutation, positive parameter a a a , and positive contractions with designated supports as specified above. Let ℓ \ell ℓ bound the logarithmic dimensions of every transferred subsystem and every designated support D i D_i D i for which J i ≠ ∅ \mathcal{J}_i\neq\varnothing J i = ∅ , with the stipulated smallness of a ℓ a\ell a ℓ . For every k k k and nonzero p r e ∈ S k \mathrm{pre}\in\mathcal{S}_k pre ∈ S k , set
s = 1 4 , N ( p ) = ∥ M ( p ) − s p r e ∥ , v ( p ) = M ( p ) − s p r e N ( p ) . (92) s=\frac{1}{4},\qquad N(p)=\left\|\mathcal{M}(p)^{-s}\mathrm{pre}\right\|,\qquad v(p)=\frac{\mathcal{M}(p)^{-s}\mathrm{pre}}{N(p)}. \tag*{(92)} s = 4 1 , N ( p ) = M ( p ) − s pre , v ( p ) = N ( p ) M ( p ) − s pre . (92)
For every 0 < p < 1 0<p<1 0 < p < 1 , let Φ j \Phi_j Φ j be the normalized map from terminal leaf j j j to M ( p ) \mathcal{M}(p) M ( p ) and define density matrices
σ j , u = Φ j ∗ ( ∣ M ( p ) − i u v ( p ) ⟩ ⟨ M ( p ) − i u v ( p ) ∣ ) , u ∈ R . (93) \sigma_{j,u}=\Phi_j^*\left(\lvert\mathcal{M}(p)^{-iu}v(p)\rangle\langle\mathcal{M}(p)^{-iu}v(p)\rvert\right),\qquad u\in\mathbb{R}. \tag*{(93)} σ j , u = Φ j ∗ ( ∣ M ( p ) − i u v ( p )⟩ ⟨ M ( p ) − i u v ( p )∣ ) , u ∈ R . (93)
The adjoint here is for the trace pairing: Tr ( Φ j ∗ ( σ ) Z ) = Tr ( σ Φ j ( Z ) ) \operatorname{Tr}(\Phi_j^*(\sigma)Z)=\operatorname{Tr}(\sigma\Phi_j(Z)) Tr ( Φ j ∗ ( σ ) Z ) = Tr ( σ Φ j ( Z )) . Write σ h , u \sigma_{h,u} σ h , u for the state at j = ( h , o l d ) j=(h,\mathrm{old}) j = ( h , old ) , and put C h = A h − 1 / 2 B h A h − 1 / 2 C_h=A_h^{-1/2}B_hA_h^{-1/2} C h = A h − 1/2 B h A h − 1/2 . Then
− ∂ p log N ( p ) 2 = ∑ h w h ∫ R m s ( u ) Tr ( σ h , u log C h ) d u . (94) -\partial_p\log N(p)^2=\sum_h w_h\int_{\mathbb{R}}m_s(u)\operatorname{Tr}(\sigma_{h,u}\log C_h)\,du. \tag*{(94)} − ∂ p log N ( p ) 2 = h ∑ w h ∫ R m s ( u ) Tr ( σ h , u log C h ) d u . (94)
There is β k = O f i x e d ( log ( k + 1 ) ) \beta_k=O_{\mathrm{fixed}}(\log(k+1)) β k = O fixed ( log ( k + 1 )) , independent of p p p and p r e \mathrm{pre} pre , such that
− ∂ p log N ( p ) 2 ≥ k a ∑ h , g w h ∫ R m s ( u ) ∫ R ∑ c ∈ C h q c ∣ h η h , c , g ( θ ) d μ σ h , u ( θ ) d u − C k a K a 1 / 4 ℓ C − β k . (95) -\partial_p\log N(p)^2\geq ka\sum_{h,g}w_h\int_{\mathbb{R}}m_s(u)\int_{\mathbb{R}}\sum_{c\in C_h}q_{c\mid h}\eta_{h,c,g}(\theta)\,d\mu_{\sigma_{h,u}}(\theta)\,du-CkaK a^{1/4}\ell^C-\beta_k. \tag*{(95)} − ∂ p log N ( p ) 2 ≥ k a h , g ∑ w h ∫ R m s ( u ) ∫ R c ∈ C h ∑ q c ∣ h η h , c , g ( θ ) d μ σ h , u ( θ ) d u − C k a K a 1/4 ℓ C − β k . (95)
If in addition H ˉ p r e = E 0 p r e \bar{H}\,\mathrm{pre}=E_0\mathrm{pre} H ˉ pre = E 0 pre , then
⟨ v , H ˉ v ⟩ ≤ 2 E 0 + C a 2 ℓ C ∑ i W i ( p ) ∑ j ∈ J i π j ∫ R m s ( u ) ∫ R η i , j ( θ ) 1 / 8 d μ σ j , u ( θ ) d u + o k ( 1 ) . (96) \langle v,\bar{H}v\rangle\leq2E_0+Ca^2\ell^C\sum_iW_i(p)\sum_{j\in\mathcal{J}_i}\pi_j\int_{\mathbb{R}}m_s(u)\int_{\mathbb{R}}\eta_{i,j}(\theta)^{1/8}\,d\mu_{\sigma_{j,u}}(\theta)\,du+o_k(1). \tag*{(96)} ⟨ v , H ˉ v ⟩ ≤ 2 E 0 + C a 2 ℓ C i ∑ W i ( p ) j ∈ J i ∑ π j ∫ R m s ( u ) ∫ R η i , j ( θ ) 1/8 d μ σ j , u ( θ ) d u + o k ( 1 ) . (96)
The remainder in (96) is uniform in p ∈ ( 0 , 1 ) p\in(0,1) p ∈ ( 0 , 1 ) , in nonzero p r e \mathrm{pre} pre satisfying the eigenvector assumption, and in all replica states. The constants C C C and the exponents denoted by C C C in (95) and (96) are universal; support dimensions enter those coefficients only through ℓ \ell ℓ . Only the implicit constant in β k = O f i x e d ( log ( k + 1 ) ) \beta_k = O_{\mathrm{fixed}}(\log(k+1)) β k = O fixed ( log ( k + 1 )) and the convergence rate of o k ( 1 ) o_k(1) o k ( 1 ) may depend on the entire fixed finite data. Neither depends on p p p or the replica state. The entropy estimate can be integrated over a closed subinterval of [ 0 , 1 ] [0,1] [ 0 , 1 ] using the continuous endpoint values of N N N .
Proof. We first identify the derivative states and prove the entropy estimate. We then construct an auxiliary block tree for each physical term and derive (96) by a matrix Schwarz inequality.
The derivative at an interpolating vertex. At the vertex M h = A h # p B h M_h=A_h\#_pB_h M h = A h # p B h , put V h = C h p / 2 A h 1 / 2 M h − 1 / 2 V_h=C_h^{p/2}A_h^{1/2}M_h^{-1/2} V h = C h p /2 A h 1/2 M h − 1/2 . Since V h ∗ V h = I V_h^*V_h=I V h ∗ V h = I , this matrix is unitary, and direct differentiation gives
M h − 1 / 2 ∂ p M h M h − 1 / 2 = V h ∗ ( log C h ) V h . M_h^{-1/2}\partial_pM_hM_h^{-1/2}=V_h^*(\log C_h)V_h. M h − 1/2 ∂ p M h M h − 1/2 = V h ∗ ( log C h ) V h .
This is also the normalized old-child derivative applied to log C h \log C_h log C h . To verify that assertion, perturb the old input to A h 1 / 2 ( I + δ log C h ) A h 1 / 2 A_h^{1/2}(I+\delta\log C_h)A_h^{1/2} A h 1/2 ( I + δ log C h ) A h 1/2 while keeping B h B_h B h fixed. After congruence the two inputs commute, so their mean is
( I + δ log C h ) # p C h = ( I + δ log C h ) 1 − p C h p . (I+\delta\log C_h)\#_pC_h=(I+\delta\log C_h)^{1-p}C_h^p. ( I + δ log C h ) # p C h = ( I + δ log C h ) 1 − p C h p .
Its derivative at zero is ( 1 − p ) C h p log C h (1-p)C_h^p\log C_h ( 1 − p ) C h p log C h . The normalization in (83) divides by 1 − p 1-p 1 − p and proves the assertion. Composing with the ancestor maps therefore yields
H : = M − 1 / 2 ( ∂ p M ) M − 1 / 2 = ∑ h w h Φ ( h , o l d ) ( log C h ) . (97) H:=\mathcal{M}^{-1/2}(\partial_p\mathcal{M})\mathcal{M}^{-1/2}=\sum_h w_h\Phi_{(h,\mathrm{old})}(\log C_h). \tag*{(97)} H := M − 1/2 ( ∂ p M ) M − 1/2 = h ∑ w h Φ ( h , old ) ( log C h ) . (97)
The coefficient here is w h w_h w h , whereas the weight of the same terminal leaf in the full tree is ( 1 − p ) w h (1-p)w_h ( 1 − p ) w h .
To differentiate the norm, diagonalize M \mathcal{M} M with eigenvalues x r > 0 x_r>0 x r > 0 and substitute p r = N M s v p_r=N\mathcal{M}^{s}v p r = N M s v . The matrix coefficient, between the components v ‾ r \overline{v}_r v r and v t v_t v t , multiplying the ( r , t ) (r,t) ( r , t ) entry of H H H is
− ( x r x t ) s + 1 / 2 x r − 2 s − x t − 2 s x r − x t = g s ( log x r − log x t ) , -(x_rx_t)^{s+1/2}\frac{x_r^{-2s}-x_t^{-2s}}{x_r-x_t}=g_s(\log x_r-\log x_t), − ( x r x t ) s + 1/2 x r − x t x r − 2 s − x t − 2 s = g s ( log x r − log x t ) ,
with the divided difference interpreted as a derivative when the eigenvalues agree. The common value in that case is 2 s 2s 2 s . Consequently
− ∂ p log N 2 = ⟨ v , g s ( ad log M ) ( H ) v ⟩ . (98) -\partial_p\log N^2=\langle v,g_s(\operatorname{ad}_{\log\mathcal{M}})(H)v\rangle. \tag*{(98)} − ∂ p log N 2 = ⟨ v , g s ( ad l o g M ) ( H ) v ⟩ . (98)
Insert (97) and the Fourier formula (84) . Lemma 7.2 implies that (93) is positive and has trace one. Moving each map to its trace adjoint proves [](#eq:7.20.
Transfer of the relative metric lower bound. By Lemma 7.1, the old metrics, the conditional roots, the interpolated root M = ∏ g M g \mathcal{M}=\prod_g\mathcal{M}_g M = ∏ g M g , and the relative metrics factor over bands. Here M g \mathcal{M}_g M g is the full tree evaluated on the inputs from band g g g alone. More precisely, if B h , g B_{h,g} B h , g is the conditional tree of new metrics in band g g g , then
C h = ∏ g C h , g , C h , g = A h , g − 1 / 2 B h , g A h , g − 1 / 2 , log C h = ∑ g log C h , g . C_h=\prod_g C_{h,g},\qquad C_{h,g}=A_{h,g}^{-1/2}B_{h,g}A_{h,g}^{-1/2},\qquad\log C_h=\sum_g\log C_{h,g}. C h = g ∏ C h , g , C h , g = A h , g − 1/2 B h , g A h , g − 1/2 , log C h = g ∑ log C h , g .
Congruence covariance identifies C h , g C_{h,g} C h , g as the conditional choice tree of the single-move relative metrics A h , g − 1 / 2 A h , c , g A h , g − 1 / 2 A_{h,g}^{-1/2}A_{h,c,g}A_{h,g}^{-1/2} A h , g − 1/2 A h , c , g A h , g − 1/2 . Lemma 6.3 gives, for every unit θ \theta θ ,
A h , g − 1 / 2 A h , c , g A h , g − 1 / 2 ≥ b k exp ( k a [ η h , c , g ( θ ) − C a 1 / 4 ℓ C ] ) P θ , k , A_{h,g}^{-1/2}A_{h,c,g}A_{h,g}^{-1/2}\ge b_k\exp\left(k a\left[\eta_{h,c,g}(\theta)-C a^{1/4}\ell^C\right]\right)P_{\theta,k}, A h , g − 1/2 A h , c , g A h , g − 1/2 ≥ b k exp ( k a [ η h , c , g ( θ ) − C a 1/4 ℓ C ] ) P θ , k ,
where b k > 0 b_k>0 b k > 0 and − log b k = O f i x e d ( log ( k + 1 ) ) -\log b_k=O_{\mathrm{fixed}}(\log(k+1)) − log b k = O fixed ( log ( k + 1 )) . The same b k b_k b k and constant can be used for the finitely many moves. For a move of the empty subsystem the relative metric is the identity, and the assertion holds after decreasing b k b_k b k to at most one. Projection transfer, (82) , gives
C h , g ≥ b k exp ( k a [ ∑ c q c ∣ h η h , c , g ( θ ) − C a 1 / 4 ℓ C ] ) P θ , k . (99) C_{h,g}\ge b_k\exp\left(ka\left[\sum_c q_{c|h}\eta_{h,c,g}(\theta)-Ca^{1/4}\ell^C\right]\right)P_{\theta,k}. \tag*{(99)} C h , g ≥ b k exp ( k a [ c ∑ q c ∣ h η h , c , g ( θ ) − C a 1/4 ℓ C ] ) P θ , k . (99)
The common polynomial factor occurs once, because the conditional weights sum to one.
Here is the logarithmic passage from this pointwise rank-one inequality to an estimate valid in every state. Define the unital positive map
Q k ( f ) = D k ∫ f ( θ ) P θ , k d θ . Q_k(f)=D_k\int f(\theta)P_{\theta,k}\,\mathrm{d}\theta. Q k ( f ) = D k ∫ f ( θ ) P θ , k d θ .
The identity Q k ( 1 ) = I Q_k(1)=I Q k ( 1 ) = I follows from the invariance of the integral and irreducibility of Sym k V \operatorname{Sym}^k V Sym k V under the full unitary group; its trace fixes the scalar. For a positive bounded function f f f bounded away from zero, integration of the positive scalar block matrix with entries f , 1 ; 1 , f − 1 f,1;1,f^{-1} f , 1 ; 1 , f − 1 gives
( Q k ( f ) I I Q k ( f − 1 ) ) ≥ 0 , Q k ( f ) − 1 ≤ Q k ( f − 1 ) . \begin{pmatrix}
Q_k(f) & I\\
I & Q_k(f^{-1})
\end{pmatrix}\ge0,\qquad Q_k(f)^{-1}\le Q_k(f^{-1}). ( Q k ( f ) I I Q k ( f − 1 ) ) ≥ 0 , Q k ( f ) − 1 ≤ Q k ( f − 1 ) .
Apply this also to f + λ f+\lambda f + λ and integrate the scalar resolvent formula
log x = ∫ 0 ∞ ( ( 1 + λ ) − 1 − ( x + λ ) − 1 ) d λ . \log x=\int_0^\infty\left((1+\lambda)^{-1}-(x+\lambda)^{-1}\right)\,\mathrm{d}\lambda. log x = ∫ 0 ∞ ( ( 1 + λ ) − 1 − ( x + λ ) − 1 ) d λ .
It proves
log Q k ( f ) ≥ Q k ( log f ) . (100) \log Q_k(f)\ge Q_k(\log f). \tag*{(100)} log Q k ( f ) ≥ Q k ( log f ) . (100)
The same inverse-order argument proves operator monotonicity of the logarithm. All these integrals converge in norm on compact positive spectral intervals.
Integrating (99) against Haar probability gives
C h , g ≥ b k D k Q k ( exp { k a [ ∑ c q c ∣ h η h , c , g − C a 1 / 4 ℓ C ] } ) . C_{h,g}\ge\frac{b_k}{D_k}Q_k\left(\exp\left\{ka\left[\sum_c q_{c|h}\eta_{h,c,g}-Ca^{1/4}\ell^C\right]\right\}\right). C h , g ≥ D k b k Q k ( exp { k a [ c ∑ q c ∣ h η h , c , g − C a 1/4 ℓ C ] } ) .
Thus operator log monotonicity and (100) turn the factor D k D_k D k into an additive logarithmic loss:
log C h , g ≥ k a Q k ( ∑ c q c ∣ h η h , c , g − C a 1 / 4 ℓ C ) + ( log b k − log D k ) I . (101) \log C_{h,g}\ge kaQ_k\left(\sum_c q_{c|h}\eta_{h,c,g}-Ca^{1/4}\ell^C\right)+(\log b_k-\log D_k)I. \tag*{(101)} log C h , g ≥ k a Q k ( c ∑ q c ∣ h η h , c , g − C a 1/4 ℓ C ) + ( log b k − log D k ) I . (101)
The entropies are bounded in the fixed one-copy dimension, so the exponential symbol used here is positive and bounded away from zero for each fixed k k k . Also D k = ( k + dim V − 1 dim V − 1 ) D_k=\binom{k+\dim V-1}{\dim V-1} D k = ( d i m V − 1 k + d i m V − 1 ) is polynomial in k k k . Taking the expectation in the trace-one state σ h , u \sigma_{h,u} σ h , u , summing (7.26) , and using ∑ h w h = 1 \sum_h w_h=1 ∑ h w h = 1 and ∫ m s = 1 / 2 \int m_s=1/2 ∫ m s = 1/2 proves (95) . In particular the loss is logarithmic in k k k , without an additional factor D k D_k D k after taking expectations.
We have obtained the entropy gain against the old-leaf states. To control the energy in these same states, the remaining argument represents the commutator with each h ˉ i \bar h_i h ˉ i by a block matrix and transports its square through the same tree.
An auxiliary positive metric for each energy term. Fix i i i . Let T : S k ⟶ D T:S_k\longrightarrow\mathcal{D} T : S k ⟶ D be h i 1 / 2 h_i^{1/2} h i 1/2 on the last copy, restricted to S k S_k S k , with codomain its image. Then T ∗ T = h ˉ i T^*T=\bar{h}_i T ∗ T = h ˉ i : matrix elements of any marked copy coincide between symmetric vectors, and their average is the restriction in (90) . If T = 0 T=0 T = 0 , the term contributes nothing and can be omitted. Otherwise T T T is surjective onto D \mathcal{D} D .
We will add a second diagonal block to each leaf metric. This block is chosen so that the squared off-diagonal commutator recovers the absolute-value expression of Lemma 6.4. The first block remains the original metric, so Lemma 7.2 will preserve its derivative maps when the enlarged tree is evaluated. For every terminal leaf with input A j A_j A j , we construct a positive definite operator B i , j B_{i,j} B i , j on D \mathcal{D} D . When [ A j , h ˉ i ] = 0 [A_j,\bar{h}_i]=0 [ A j , h ˉ i ] = 0 , use the polar decomposition T = U ∣ T ∣ T=U|T| T = U ∣ T ∣ . Here U U U is unitary from supp ∣ T ∣ \operatorname{supp}|T| supp ∣ T ∣ onto D \mathcal{D} D , and this support is invariant under A j A_j A j . Set B i , j = U ( A j ∣ supp ∣ T ∣ ) U ∗ B_{i,j}=U(A_j|_{\operatorname{supp}|T|})U^* B i , j = U ( A j ∣ supp ∣ T ∣ ) U ∗ . Commutation with ∣ T ∣ |T| ∣ T ∣ gives
Y i , j : = B i , j 1 / 2 T A j − 1 / 2 = T = B i , j − 1 / 2 T A j 1 / 2 = : Z i , j . Y_{i,j}:=B_{i,j}^{1/2}TA_j^{-1/2}=T=B_{i,j}^{-1/2}TA_j^{1/2}=:Z_{i,j}. Y i , j := B i , j 1/2 T A j − 1/2 = T = B i , j − 1/2 T A j 1/2 =: Z i , j .
For a split leaf put
O i , j = A j − 1 / 2 h ˉ i A j 1 / 2 , S j = T A j − 1 / 2 , Q j = ∣ O i , j ∣ . O_{i,j}=A_j^{-1/2}\bar{h}_iA_j^{1/2},\qquad S_j=TA_j^{-1/2},\qquad Q_j=|O_{i,j}|. O i , j = A j − 1/2 h ˉ i A j 1/2 , S j = T A j − 1/2 , Q j = ∣ O i , j ∣.
For any operator O O O , the notation ∣ O ∣ |O| ∣ O ∣ means ( O ∗ O ) 1 / 2 (O^*O)^{1/2} ( O ∗ O ) 1/2 . The range of O i , j O_{i,j} O i , j is the range of S j ∗ S_j^* S j ∗ , namely A j − 1 / 2 ran T ∗ A_j^{-1/2}\operatorname{ran}T^* A j − 1/2 ran T ∗ . Since S j S_j S j is surjective, S j S j ∗ S_jS_j^* S j S j ∗ is positive definite on D \mathcal{D} D . Define
B i , j = ( S j S j ∗ ) − 1 S j Q j S j ∗ ( S j S j ∗ ) − 1 . B_{i,j}=(S_jS_j^*)^{-1}S_jQ_jS_j^*(S_jS_j^*)^{-1}. B i , j = ( S j S j ∗ ) − 1 S j Q j S j ∗ ( S j S j ∗ ) − 1 .
The operator Q j Q_j Q j is strictly positive on ran S j ∗ \operatorname{ran}S_j^* ran S j ∗ . Thus (7.31) is positive definite on D \mathcal{D} D and S j ∗ B i , j S j = Q j S_j^*B_{i,j}S_j=Q_j S j ∗ B i , j S j = Q j ; the latter follows because S j ∗ ( S j S j ∗ ) − 1 S j S_j^*(S_jS_j^*)^{-1}S_j S j ∗ ( S j S j ∗ ) − 1 S j is the projection onto ran S j ∗ \operatorname{ran}S_j^* ran S j ∗ . Define Y i , j , Z i , j Y_{i,j},Z_{i,j} Y i , j , Z i , j by the formulas in (7.30) . They now satisfy
Y i , j ∗ Y i , j = ∣ O i , j ∗ ∣ , Y i , j ∗ Z i , j = O i , j . Y_{i,j}^*Y_{i,j}=|O_{i,j}^*|,\qquad Y_{i,j}^*Z_{i,j}=O_{i,j}. Y i , j ∗ Y i , j = ∣ O i , j ∗ ∣ , Y i , j ∗ Z i , j = O i , j .
The map Y i , j Y_{i,j} Y i , j is surjective. Consequently Y i , j ( Y i , j ∗ Y i , j ) + Y i , j ∗ = I D Y_{i,j}(Y_{i,j}^*Y_{i,j})^+Y_{i,j}^*=I_{\mathcal{D}} Y i , j ( Y i , j ∗ Y i , j ) + Y i , j ∗ = I D , where the plus denotes the inverse on the support and zero on the kernel. Multiplying on the two sides by Z i , j ∗ Z_{i,j}^* Z i , j ∗ and Z i , j Z_{i,j} Z i , j shows
Z i , j ∗ Z i , j = O i , j ∗ ∣ O i , j ∗ ∣ + O i , j = ∣ O i , j ∣ . Z_{i,j}^*Z_{i,j}=O_{i,j}^*|O_{i,j}^*|^+O_{i,j}=|O_{i,j}|. Z i , j ∗ Z i , j = O i , j ∗ ∣ O i , j ∗ ∣ + O i , j = ∣ O i , j ∣.
The last equality follows, for example, from a singular value decomposition of O i , j O_{i,j} O i , j . Hence
D i , j : = ( Y i , j − Z i , j ) ∗ ( Y i , j − Z i , j ) = ∣ O i , j ∗ ∣ + ∣ O i , j ∣ − O i , j − O i , j ∗ ≥ 0. (102) D_{i,j}:=(Y_{i,j}-Z_{i,j})^*(Y_{i,j}-Z_{i,j})=|O_{i,j}^*|+|O_{i,j}|-O_{i,j}-O_{i,j}^*\geq0. \tag*{(102)} D i , j := ( Y i , j − Z i , j ) ∗ ( Y i , j − Z i , j ) = ∣ O i , j ∗ ∣ + ∣ O i , j ∣ − O i , j − O i , j ∗ ≥ 0. (102)
For an unsplit leaf use D i , j = 0 D_{i,j}=0 D i , j = 0 ; it agrees with the same formula because O i , j = h ˉ i O_{i,j}=\bar{h}_i O i , j = h ˉ i . The construction has therefore included singular h ˉ i \bar{h}_i h ˉ i without ever inverting it on its kernel.
Transporting the square with both Fourier kernels. Evaluate the full terminal tree on the block inputs
M i , j = ( A j 0 0 B i , j ) . M_{i,j}=\begin{pmatrix} A_j & 0 \\ 0 & B_{i,j} \end{pmatrix}. M i , j = ( A j 0 0 B i , j ) .
Its root is M i = diag ( M , B i ) M_i=\operatorname{diag}(\mathcal{M},B_i) M i = diag ( M , B i ) . Denote its normalized leaf maps by Φ ^ i , j \widehat{\Phi}_{i,j} Φ i , j . Their first diagonal-block restrictions are exactly Φ j \Phi_j Φ j , by Lemma 7.2, although the second blocks depend on i i i . Let
L i = ( 0 T ∗ T 0 ) , K i , j = M i , j 1 / 2 L i M i , j − 1 / 2 − M i , j − 1 / 2 L i M i , j 1 / 2 . L_i=\begin{pmatrix}0&T^*\\T&0\end{pmatrix},\qquad K_{i,j}=M_{i,j}^{1/2}L_iM_{i,j}^{-1/2}-M_{i,j}^{-1/2}L_iM_{i,j}^{1/2}. L i = ( 0 T T ∗ 0 ) , K i , j = M i , j 1/2 L i M i , j − 1/2 − M i , j − 1/2 L i M i , j 1/2 .
Rotating every input by e i t L i e^{itL_i} e i t L i rotates the root by the same unitary, by congruence covariance. Differentiate at zero, normalize at the root, and cancel the common factor − i -i − i . The chain rule gives
2 sinh ( ad log M i / 2 ) L i = ∑ j π j Φ ^ i , j ( K i , j ) . (103) 2\sinh\left(\operatorname{ad}_{\log M_i}/2\right)L_i=\sum_j\pi_j\widehat{\Phi}_{i,j}(K_{i,j}). \tag*{(103)} 2 sinh ( ad l o g M i /2 ) L i = j ∑ π j Φ i , j ( K i , j ) . (103)
The lower-left block of K i , j K_{i,j} K i , j is Y i , j − Z i , j Y_{i,j}-Z_{i,j} Y i , j − Z i , j , its upper-right block is the negative adjoint, and the upper-left block of K i , j ∗ K i , j K_{i,j}^{*}K_{i,j} K i , j ∗ K i , j is D i , j D_{i,j} D i , j . In particular K i , j = 0 K_{i,j}=0 K i , j = 0 for j ∉ J i j\notin\mathcal{J}_i j ∈ / J i . Apply h ± ( ad log M i ) h_\pm(\operatorname{ad}_{\log M_i}) h ± ( ad l o g M i ) to (103) . By (85) , the lower-left block of the left side is
E i , ± = B i ± s T M M ∓ s − T . (104) E_{i,\pm}=B_i^{\pm sT}\mathcal{M}M^{\mp s}-T. \tag*{(104)} E i , ± = B i ± s T M M ∓ s − T . (104)
The Fourier formula for the right side and preservation of blocks give an expression for ( 0 , E i , ± v ) (0,E_{i,\pm}v) ( 0 , E i , ± v ) as a sum over split leaves of
π j ∫ R q ± ( u ) M i i u Φ ^ i , j ( K i , j ) M i − i u ( v , 0 ) d u . \pi_j\int_{\mathbb{R}}q_\pm(u)M_i^{iu}\widehat{\Phi}_{i,j}(K_{i,j})M_i^{-iu}(v,0)\,du. π j ∫ R q ± ( u ) M i i u Φ i , j ( K i , j ) M i − i u ( v , 0 ) d u .
The output phase is unitary. Cauchy–Schwarz with respect to the positive measure assigning mass π j ∣ q ± ( u ) ∣ d u \pi_j\lvert q_\pm(u)\rvert\,du π j ∣ q ± ( u )∣ d u to ( j , u ) (j,u) ( j , u ) therefore bounds the squared norm by
W i ( ∫ R ∣ q ± ( u ) ∣ d u ) ∑ j ∈ J i π j ∫ R ∣ q ± ( u ) ∣ ∥ Φ ^ i , j ( K i , j ) ( M − i u v , 0 ) ∥ 2 d u . W_i\left(\int_{\mathbb{R}}\lvert q_\pm(u)\rvert\,du\right)\sum_{j\in\mathcal{J}_i}\pi_j\int_{\mathbb{R}}\lvert q_\pm(u)\rvert\left\|\widehat{\Phi}_{i,j}(K_{i,j})(M^{-iu}v,0)\right\|^2\,du. W i ( ∫ R ∣ q ± ( u )∣ d u ) j ∈ J i ∑ π j ∫ R ∣ q ± ( u )∣ Φ i , j ( K i , j ) ( M − i u v , 0 ) 2 d u .
For a unital completely positive map Ψ \Psi Ψ ,
Ψ ( K ) ∗ Ψ ( K ) ≤ Ψ ( K ∗ K ) . \Psi(K)^*\Psi(K)\leq\Psi(K^*K). Ψ ( K ) ∗ Ψ ( K ) ≤ Ψ ( K ∗ K ) .
Indeed apply its two-by-two amplification to the positive block matrix ( K ∗ K K ∗ K I ) \left(\begin{smallmatrix}K^*K&K^*\\K&I\end{smallmatrix}\right) ( K ∗ K K K ∗ I ) and take the Schur complement of the identity. By the first-block restriction of Φ ^ i , j \widehat{\Phi}_{i,j} Φ i , j , this bounds the norm squared in the preceding display by Tr ( σ j , u D i , j ) \operatorname{Tr}(\sigma_{j,u}D_{i,j}) Tr ( σ j , u D i , j ) . Finally (86) and ∫ m s = 1 / 2 \int m_s=1/2 ∫ m s = 1/2 give the exact estimate
∥ E i , ± v ∥ 2 ≤ 1 4 W i ∑ j ∈ J i π j ∫ R m s ( u ) Tr ( σ j , u D i , j ) d u . (105) \left\|E_{i,\pm}v\right\|^2\leq\frac{1}{4}W_i\sum_{j\in\mathcal{J}_i}\pi_j\int_{\mathbb{R}}m_s(u)\operatorname{Tr}(\sigma_{j,u}D_{i,j})\,du. \tag*{(105)} ∥ E i , ± v ∥ 2 ≤ 4 1 W i j ∈ J i ∑ π j ∫ R m s ( u ) Tr ( σ j , u D i , j ) d u . (105)
This proves the bound for both signs. The first factor W i W_i W i comes from Cauchy–Schwarz, and the sum contains a second total split weight. For example, a uniform bound on its trace integrals gives a bound proportional to W i 2 W_i^2 W i 2 , rather than W i W_i W i .
From the transported square to physical energy. At a split leaf only one band fails to commute with h ˉ i \bar h_i h ˉ i . The other factors cancel in its similarity transform O i , j O_{i,j} O i , j . At such a leaf j ∈ J i j\in\mathcal{J}_i j ∈ J i , the assumed bound log ( e dim D i ) ≤ ℓ \log(e\dim D_i)\leq\ell log ( e dim D i ) ≤ ℓ applies. Our designated-support assumptions put this two-part split within the hypotheses of Lemma 6.4; Lemma 5.3 then gives, uniformly over density matrices σ \sigma σ on S k \mathcal{S}_k S k ,
Tr ( σ D i , j ) ≤ C a i 2 ℓ C ∫ η i , j ( θ ) 1 / 8 d μ σ ( θ ) + r k , r k ⟶ 0. (106) \operatorname{Tr}(\sigma D_{i,j})\leq Ca_i^2\ell^C\int\eta_{i,j}(\theta)^{1/8}\,d\mu_\sigma(\theta)+r_k,\qquad r_k\longrightarrow0. \tag*{(106)} Tr ( σ D i , j ) ≤ C a i 2 ℓ C ∫ η i , j ( θ ) 1/8 d μ σ ( θ ) + r k , r k ⟶ 0. (106)
There are finitely many split term–leaf pairs, so one common r k ≥ 0 r_k\geq0 r k ≥ 0 can be chosen for all of them; take r k = 0 r_k=0 r k = 0 if there are none. Unsplit pairs have D i , j = 0 D_{i,j}=0 D i , j = 0 exactly and incur no symbol remainder or support-dimension factor. These terminal metrics do not depend on the interpolation parameter. Uniformity over σ \sigma σ makes (106) applicable to every σ j , u \sigma_{j,u} σ j , u , regardless of p p p , u u u , or the normalized vector.
The two opposite powers of B i \mathcal{B}_i B i in (104) cancel in the pairing:
ℜ ⟨ ( T + E i , + ) v , ( T + E i , − ) v ⟩ = ℜ ⟨ M − s v , h ˉ i M s v ⟩ ≥ 1 2 ∥ T v ∥ 2 − 3 2 ( ∥ E i , + v ∥ 2 + ∥ E i , − v ∥ 2 ) . (107) \Re\langle(T+E_{i,+})v,(T+E_{i,-})v\rangle=\Re\langle\mathcal{M}^{-s}v,\bar{h}_i\mathcal{M}^{s}v\rangle
\geq\frac{1}{2}\lVert Tv\rVert^2-\frac{3}{2}\left(\lVert E_{i,+}v\rVert^2+\lVert E_{i,-}v\rVert^2\right). \tag*{(107)} ℜ ⟨( T + E i , + ) v , ( T + E i , − ) v ⟩ = ℜ ⟨ M − s v , h ˉ i M s v ⟩ ≥ 2 1 ∥ T v ∥ 2 − 2 3 ( ∥ E i , + v ∥ 2 + ∥ E i , − v ∥ 2 ) . (107)
For the last inequality, expand the left pairing, bound each linear cross term by 1 4 ∥ T v ∥ 2 + ∥ E i , ± v ∥ 2 \frac{1}{4}\lVert Tv\rVert^2+\lVert E_{i,\pm}v\rVert^2 4 1 ∥ T v ∥ 2 + ∥ E i , ± v ∥ 2 , and bound the remaining mixed term by half the sum of the two error squares. Summing the equality in (107) over i i i gives E 0 E_0 E 0 : one has M s v = p r e / N \mathcal{M}^{s}v=\mathrm{pre}/N M s v = pre / N , and ⟨ M − s v , M s v ⟩ = 1 \langle\mathcal{M}^{-s}v,\mathcal{M}^{s}v\rangle=1 ⟨ M − s v , M s v ⟩ = 1 . Thus
⟨ v , H ~ v ⟩ ≤ 2 E 0 + 3 ∑ i , ± ∥ E i , ± v ∥ 2 . \langle v,\widetilde{H}v\rangle\leq2E_0+3\sum_{i,\pm}\lVert E_{i,\pm}v\rVert^2. ⟨ v , H v ⟩ ≤ 2 E 0 + 3 i , ± ∑ ∥ E i , ± v ∥ 2 .
Insert (105) and (106) to obtain (96) . The total remainder is bounded by a fixed constant times r k ∑ i W i 2 r_k\sum_i W_i^2 r k ∑ i W i 2 and hence tends to zero uniformly in p p p and v v v .
Finally, all tree inputs are positive definite, so for fixed k k k the roots and N N N are smooth up to p = 0 , 1 p=0,1 p = 0 , 1 . The normalized maps are used only where their branch weights are positive; their being unital ensures bounds uniform as p p p approaches an endpoint. The entropies are bounded in the fixed one-copy space, and all probability weights sum to one. Thus the entropy integrand and its error have the uniform bounds required to integrate (95) and pass to the endpoints. A finite sequence of rounds permits the same choices of polynomial losses and remainders by taking their maxima. □
The proposition separates two uses of a history. Its old-leaf state in (94) is exactly the state used for that leaf in (105) . Only the scalar weights differ: w h w_h w h in the derivative and ( 1 − p ) w h (1-p)w_h ( 1 − p ) w h in the energy estimate. This identity allows a later averaging argument to select one common time and one common interpolation parameter while retaining control of all energy terms.
Norm comparisons from an auxiliary pair
The metric deformation of Section 7 provides a vector whose physical energy can be small. We now compare the norm defining that vector in two ways. Projecting the target and an auxiliary system onto an entangled pair gives an upper bound on the negative logarithm of the norm. A lower bound follows because most physical copies of a low-energy vector are in the ground state. The auxiliary systems retain large representation labels in this second comparison. Their contribution is what makes the two bounds useful.
We formulate the comparison for a finite collection of partitions. No traversal procedure or choice of geometric scales is needed in this section. All physical entropies below are in a fixed normalized pure vector Ω ~ ∈ H p h y s \widetilde{\Omega}\in\mathcal{H}_{\mathrm{phys}} Ω ∈ H phys , unless another state is specified. Suppose that a positive Hamiltonian H ~ \widetilde{H} H has this unique ground vector, ground energy E ~ 0 \widetilde{E}_0 E 0 , and gap g ~ > 0 \widetilde{g}>0 g > 0 . Fix a physical subsystem X X X . A status consists of K K K partitions
H p h y s = H X ⊗ H U g ⊗ H Y g ⊗ H V g , 1 ≤ g ≤ K . \mathcal{H}_{\mathrm{phys}}=\mathcal{H}_X\otimes\mathcal{H}_{U_g}\otimes\mathcal{H}_{Y_g}\otimes\mathcal{H}_{V_g},\qquad1\leq g\leq K. H phys = H X ⊗ H U g ⊗ H Y g ⊗ H V g , 1 ≤ g ≤ K .
There are finitely many allowed statuses. We assume that, for every allowed choice of the two statuses and every g < g ′ g<g' g < g ′ , their physical sets satisfy
X U g Y g ⊆ X U g ′ . XU_gY_g\subseteq XU_{g'}. X U g Y g ⊆ X U g ′ .
As usual, juxtaposition joins disjoint tensor factors. The inclusion in (8.1) compares sets of physical sites. It ensures the commutation of the different bands’ metric algebras after complementary labels are identified on the symmetric space.
Here are the entropy data used in the comparisons. Write S X = S ( X ) S_X=S(X) S X = S ( X ) . Choose a nonempty set E E E of positive Schmidt indices of X X X such that, for some w ≥ 0 w\ge0 w ≥ 0 ,
e − S X − w ≤ p i ≤ e − S X + w ( i ∈ E ) , z = ∑ i ∈ E p i > 0. e^{-S_X-w}\le p_i\le e^{-S_X+w}\quad(i\in E),\qquad z=\sum_{i\in E}p_i>0. e − S X − w ≤ p i ≤ e − S X + w ( i ∈ E ) , z = i ∈ E ∑ p i > 0.
Put d ∗ = ∣ E ∣ d_*=\lvert E\rvert d ∗ = ∣ E ∣ , p i ′ = p i / z p_i'=p_i/z p i ′ = p i / z , and S ′ = − ∑ i ∈ E p i ′ log p i ′ S'=-\sum_{i\in E}p_i'\log p_i' S ′ = − ∑ i ∈ E p i ′ log p i ′ . For the later choice of a scale parameter n ≥ 2 n\ge2 n ≥ 2 , Lemma 3.1 will supply w = n 3 / 5 w=n^{3/5} w = n 3/5 and z ≥ 1 − n − 100 z\ge1-n^{-100} z ≥ 1 − n − 100 . Only (8.2) is needed here. Directly from (8.2) ,
∣ log d ∗ − S X ∣ ≤ w + ∣ log z ∣ , ∣ S ′ − S X ∣ ≤ w + ∣ log z ∣ . (108) \lvert\log d_*-S_X\rvert\le w+\lvert\log z\rvert,\qquad\lvert S'-S_X\rvert\le w+\lvert\log z\rvert. \tag*{(108)} ∣ log d ∗ − S X ∣ ≤ w + ∣ log z ∣ , ∣ S ′ − S X ∣ ≤ w + ∣ log z ∣ . (108)
For the rough upper bound, assume there is a finite nested collection R \mathcal{R} R of physical subsystems disjoint from X X X . For every status and band, each of U g U_g U g and U g Y g U_gY_g U g Y g has a matched member of R \mathcal{R} R which contains it or is contained in it. Assume
S ( B ) ≤ B s h ( B ∈ R ) , 1 + log dim H B △ Q ≤ B e x c (109) S(B)\le B_{\mathrm{sh}}\quad(B\in\mathcal{R}),\qquad1+\log\dim\mathcal{H}_{B\triangle Q}\le B_{\mathrm{exc}} \tag*{(109)} S ( B ) ≤ B sh ( B ∈ R ) , 1 + log dim H B △ Q ≤ B exc (109)
for every such matched pair ( B , Q ) (B,Q) ( B , Q ) , where Q = U g Q=U_g Q = U g or U g Y g U_gY_g U g Y g . The symmetric difference here is simply the difference between the two nested sets. The added 1 in B e x c B_{\mathrm{exc}} B exc absorbs a fixed margin in a spectral cutoff.
The sharp bounds additionally use the following marginal moment assumption. For every set
Q ∈ { X U g , V g , Y g , U g , U g Y g : allowed statuses and bands } , Q\in\{XU_g,V_g,Y_g,U_g,U_gY_g:\text{ allowed statuses and bands}\}, Q ∈ { X U g , V g , Y g , U g , U g Y g : allowed statuses and bands } ,
let ρ Q \rho_Q ρ Q be the marginal of Ω ~ \widetilde{\Omega} Ω . There are constants C 0 , c 0 > 0 C_0,c_0>0 C 0 , c 0 > 0 and B ≥ 1 B\ge1 B ≥ 1 such that
log Tr ρ Q 1 − u ≤ u S ( Q ) + C 0 B u 2 , ∣ u ∣ ≤ c 0 B . (110) \log\operatorname{Tr}\rho_Q^{1-u}\le uS(Q)+C_0Bu^2,\qquad\lvert u\rvert\le\frac{c_0}{\sqrt{B}}. \tag*{(110)} log Tr ρ Q 1 − u ≤ u S ( Q ) + C 0 B u 2 , ∣ u ∣ ≤ B c 0 . (110)
Only positive eigenvalues are used in this expression. We retain the parameter B B B from the marginal estimate, including any logarithmic factors it contains.
Append systems C , R C,R C , R of dimension d ∗ d_* d ∗ , with bases indexed by E E E , and put
Bell C R = d ∗ − 1 / 2 ∑ i ∈ E ∣ i ⟩ C ∣ i ⟩ R . \operatorname{Bell}_{CR}=d_*^{-1/2}\sum_{i\in E}\lvert i\rangle_C\lvert i\rangle_R. Bell C R = d ∗ − 1/2 i ∈ E ∑ ∣ i ⟩ C ∣ i ⟩ R .
Use the common-dimension Schur metrics of Section 6 on
V = H p h y s ⊗ H C ⊗ H R , S k = Sym k V . \mathcal{V}=\mathcal{H}_{\mathrm{phys}}\otimes\mathcal{H}_C\otimes\mathcal{H}_R,\qquad\mathcal{S}_k=\operatorname{Sym}^k\mathcal{V}. V = H phys ⊗ H C ⊗ H R , S k = Sym k V .
In particular the same scalar function of a partition label defines every W Q , k W_{Q,k} W Q , k , with labels padded to dim V \dim\mathcal{V} dim V . Suppress k k k when it is unambiguous. Fix 0 < a ≤ a 0 0<a\le a_0 0 < a ≤ a 0 , where a 0 > 0 a_0>0 a 0 > 0 is a sufficiently small absolute constant, set t = a / 2 t=a/2 t = a /2 , s = 1 / 4 s=1/4 s = 1/4 , and W = a K W=aK W = a K . At a terminal leaf j j j of any finite binary mean tree, put
P j , g = C X U j , g , F j , g = R V j , g , A j , g = ( W P j , g − 1 W F j , g − 1 W Y j , g ) 2 , A j = ∏ g = 1 K A j , g . (111) P_{j,g}=CXU_{j,g},\qquad F_{j,g}=RV_{j,g},\qquad A_{j,g}=\left(W_{P_{j,g}}^{-1}W_{F_{j,g}}^{-1}W_{Y_{j,g}}\right)^2,\qquad A_j=\prod_{g=1}^{K}A_{j,g}. \tag*{(111)} P j , g = C X U j , g , F j , g = R V j , g , A j , g = ( W P j , g − 1 W F j , g − 1 W Y j , g ) 2 , A j = g = 1 ∏ K A j , g . (111)
Thus X X X , U j , g U_{j,g} U j , g , Y j , g Y_{j,g} Y j , g , V j , g V_{j,g} V j , g are the physical factors, while P j , g P_{j,g} P j , g , Y j , g Y_{j,g} Y j , g , F j , g F_{j,g} F j , g form the full partition used by the metric. The target is X X X . The auxiliary factors C , R C,R C , R are initialized in the Bell pair above, and the same factors are used in every band. Only the physical factors contribute to the Hamiltonian.
Let w j w_j w j be the terminal path probabilities, let M \mathcal{M} M be the mean-tree root with leaves A j A_j A j , and let M g \mathcal{M}_g M g use the same tree with leaves A j , g A_{j,g} A j , g . Then M = ∏ g M g \mathcal{M} = \prod_g \mathcal{M}_g M = ∏ g M g , with commuting factors. We write
⟨ f ⟩ a v = 1 K ∑ g = 1 K ∑ j w j f j , g \langle f\rangle_{\mathrm{av}} = \frac{1}{K}\sum_{g=1}^{K}\sum_j w_j f_{j,g} ⟨ f ⟩ av = K 1 g = 1 ∑ K j ∑ w j f j , g
for the full terminal-path and band average. In particular it includes both old and new terminal leaves when the tree contains an interpolation.
Proposition 8.1 (Upper and lower norm comparisons). Fix the positive gapped Hamiltonian and physical target X X X above, a finite collection of status partitions satisfying (8.1) , a typical Schmidt set satisfying (8.2) , and a mean tree with metrics (111) . There is a sequence of common auxiliary labels λ k \lambda_k λ k and nonzero vectors
pre k = π R λ k ( Ω ~ ⊗ Bell C R ) ⊗ k ∈ S k , ∥ pre k ∥ ≤ 1 , (112) \operatorname{pre}_k = \pi_R^{\lambda_k}\left(\widetilde{\Omega}\otimes\operatorname{Bell}_{CR}\right)^{\otimes k}\in\mathcal{S}_k,\qquad\|\operatorname{pre}_k\|\leq1, \tag*{(112)} pre k = π R λ k ( Ω ⊗ Bell C R ) ⊗ k ∈ S k , ∥ pre k ∥ ≤ 1 , (112)
Here π R λ k \pi_R^{\lambda_k} π R λ k is the Schur-label projection on the R R R copies. These vectors are physical mean-energy eigenvectors of eigenvalue E ~ 0 \widetilde{E}_0 E 0 and have label λ k \lambda_k λ k on both C C C and R R R . For every tree above, set
N = ∥ M − s pre k ∥ , v = M − s pre k / N , E d e f = ⟨ v , H ~ v ⟩ − E ~ 0 g ~ , H ~ = 1 k ∑ i = 1 k H ~ ( i ) . N=\|\mathcal{M}^{-s}\operatorname{pre}_k\|,\qquad v=\mathcal{M}^{-s}\operatorname{pre}_k/N,\qquad E_{\mathrm{def}}=\frac{\langle v,\widetilde{H}v\rangle-\widetilde{E}_0}{\widetilde{g}},\qquad\widetilde{H}=\frac{1}{k}\sum_{i=1}^{k}\widetilde{H}^{(i)}. N = ∥ M − s pre k ∥ , v = M − s pre k / N , E def = g ⟨ v , H v ⟩ − E 0 , H = k 1 i = 1 ∑ k H ( i ) .
Rough comparisons. For 0 < τ < 1 / 2 0<\tau<1/2 0 < τ < 1/2 , the upper bound below uses the prefix data (109) :
− log N 2 k ≤ 2 log d ∗ − log z + 2 s W ( 2 B s h z ~ + 2 B e x c ) + o k ( 1 ) , (113) -\frac{\log N^2}{k}\leq2\log d_*-\log z+2sW\left(\frac{2B_{\mathrm{sh}}}{\widetilde{z}}+2B_{\mathrm{exc}}\right)+o_k(1), \tag*{(113)} − k log N 2 ≤ 2 log d ∗ − log z + 2 s W ( z 2 B sh + 2 B exc ) + o k ( 1 ) , (113)
− log N 2 k ≥ 2 s W [ 2 S ′ − C ( τ log d ∗ + h ( τ ) a ) − C E d e f τ S ′ ] − o k ( 1 ) . (114) -\frac{\log N^2}{k}\geq2sW\left[2S'-C\left(\tau\log d_*+\frac{h(\tau)}{a}\right)-C\frac{E_{\mathrm{def}}}{\tau}S'\right]-o_k(1). \tag*{(114)} − k log N 2 ≥ 2 s W [ 2 S ′ − C ( τ log d ∗ + a h ( τ ) ) − C τ E def S ′ ] − o k ( 1 ) . (114)
Here h h h is binary entropy. The lower bound does not require (109) or (110) .
Sharp comparisons. If (110) holds and a ≤ c / B a\leq c/\sqrt{B} a ≤ c / B , with c c c sufficiently small in terms of c 0 c_0 c 0 , define
g j , g p r e = S ( X U j , g ) + S ( V j , g ) − S ( Y j , g ) , g^{\mathrm{pre}}_{j,g}=S(XU_{j,g})+S(V_{j,g})-S(Y_{j,g}), g j , g pre = S ( X U j , g ) + S ( V j , g ) − S ( Y j , g ) ,
g j , g p o s t = S ( U j , g ) + S ( U j , g Y j , g ) − S ( Y j , g ) , g max = max j , g g j , g p r e . g^{\mathrm{post}}_{j,g}=S(U_{j,g})+S(U_{j,g}Y_{j,g})-S(Y_{j,g}),\qquad g_{\max}=\max_{j,g}g^{\mathrm{pre}}_{j,g}. g j , g post = S ( U j , g ) + S ( U j , g Y j , g ) − S ( Y j , g ) , g m a x = j , g max g j , g pre .
Then g j , g p r e ≥ 0 g^{\mathrm{pre}}_{j,g}\geq0 g j , g pre ≥ 0 , and the sharp comparisons are
− log N 2 k ≤ 2 log d ∗ − log z + 2 s W [ ⟨ g p o s t ⟩ a v + C ( a B + ∣ log z ∣ a ) ] + o k ( 1 ) , (115) -\frac{\log N^2}{k}\leq2\log d_*-\log z+2sW\left[\langle g^{\mathrm{post}}\rangle_{\mathrm{av}}+C\left(aB+\frac{|\log z|}{a}\right)\right]+o_k(1), \tag*{(115)} − k log N 2 ≤ 2 log d ∗ − log z + 2 s W [ ⟨ g post ⟩ av + C ( a B + a ∣ log z ∣ ) ] + o k ( 1 ) , (115)
− log N 2 k ≥ 2 s W [ 2 S ′ + ( 1 − τ ) ⟨ g p r e ⟩ a v − C ( τ log d ∗ + h ( τ ) a + a B ) − C E d e f τ ( S ′ + g max ) ] − o k ( 1 ) . (116) -\frac{\log N^2}{k}\geq2sW\left[2S'+(1-\tau)\langle g^{\mathrm{pre}}\rangle_{\mathrm{av}}-C\left(\tau\log d_*+\frac{h(\tau)}{a}+aB\right)-C\frac{E_{\mathrm{def}}}{\tau}(S'+g_{\max})\right]-o_k(1). \tag*{(116)} − k log N 2 ≥ 2 s W [ 2 S ′ + ( 1 − τ ) ⟨ g pre ⟩ av − C ( τ log d ∗ + a h ( τ ) + a B ) − C τ E def ( S ′ + g m a x ) ] − o k ( 1 ) . (116)
The upper sharp bound does not require (109) . For every physical partition there is the exact identity
2 S X + g j , g p r e − g j , g p o s t = I ( X : V j , g ) + I ( X : Y j , g V j , g ) . (117) 2S_X+g^{\mathrm{pre}}_{j,g}-g^{\mathrm{post}}_{j,g}=I(X:V_{j,g})+I(X:Y_{j,g}V_{j,g}). \tag*{(117)} 2 S X + g j , g pre − g j , g post = I ( X : V j , g ) + I ( X : Y j , g V j , g ) . (117)
All replica limits are taken with the physical system, auxiliary dimensions, finite status collection and tree, a a a , and τ \tau τ fixed. The errors are uniform over terminal probabilities, including their dependence on k k k , and over the symmetric vectors to which the lower comparison is applied. Constants or degrees in intermediate polynomial factors in k k k may depend on the fixed entire system. They disappear in o k ( 1 ) o_k(1) o k ( 1 ) . The displayed constants in the rough bounds are universal; those in the sharp bounds may also depend on C 0 C_0 C 0 , c 0 c_0 c 0 . None has additional dependence on the system dimensions.
Labels selected by the auxiliary pair
We first record the entropy concentration of the labels that will be used. For a permutation-invariant density ρ \rho ρ on k k k copies of a fixed region, let L = − log ρ L=-\log\rho L = − log ρ on its support and let F F F denote the logarithm of its Specht dimension. Lemma 6.1(5) gives
F ≤ L , [ F , L ] = 0 , Tr ρ e b ( L − F ) ≤ poly ( k ) , 0 ≤ b ≤ 1. (118) F \le L,\qquad[F,L]=0,\qquad\operatorname{Tr}\rho e^{b(L-F)} \le\operatorname{poly}(k),\qquad0 \le b \le1. \tag*{(118)} F ≤ L , [ F , L ] = 0 , Tr ρ e b ( L − F ) ≤ poly ( k ) , 0 ≤ b ≤ 1. (118)
For an iid marginal satisfying (110) , it follows that
log E exp { ± u ( F Q − k S ( Q ) ) } ≤ C k B u 2 + O ( log ( k + 1 ) ) , 0 ≤ u ≤ c B . (119) \log\mathbb{E}\exp\left\{\pm u(F_Q-kS(Q))\right\} \le CkBu^2+O(\log(k+1)),\qquad0 \le u \le\frac{c}{\sqrt{B}}. \tag*{(119)} log E exp { ± u ( F Q − k S ( Q )) } ≤ C k B u 2 + O ( log ( k + 1 )) , 0 ≤ u ≤ B c . (119)
For the positive sign use F Q ≤ L F_Q\le L F Q ≤ L and the iid moment bound. For the negative sign apply Cauchy–Schwarz to e − u ( L − k S ( Q ) ) e u ( L − F Q ) e^{-u(L-kS(Q))}e^{u(L-F_Q)} e − u ( L − k S ( Q )) e u ( L − F Q ) , using the moment bound at − 2 u -2u − 2 u and (118) at 2 u 2u 2 u . Shrinking c c c ensures both conditions. Only the O ( log ( k + 1 ) ) O(\log(k+1)) O ( log ( k + 1 )) term has fixed-system dependence.
Choose Schmidt vectors so that
Ω ~ = ∑ i p i ∣ i ⟩ X ∣ w i ⟩ , ψ = ∑ i ∈ E p i ′ ∣ i ⟩ R ∣ w i ⟩ . \widetilde{\Omega}=\sum_i\sqrt{p_i}\,|i\rangle_X|w_i\rangle,\qquad\psi=\sum_{i\in E}\sqrt{p'_i}\,|i\rangle_R|w_i\rangle. Ω = i ∑ p i ∣ i ⟩ X ∣ w i ⟩ , ψ = i ∈ E ∑ p i ′ ∣ i ⟩ R ∣ w i ⟩ .
Thus ψ \psi ψ is the normalized typical truncation with X X X relabeled as R R R . Define the vector and projection used to pin the target:
B X C = 1 d ∗ ∑ i ∈ E ∣ i ⟩ X ∣ i ⟩ C , post k = B X C ⊗ k ⊗ ψ ⊗ k . B_{XC}=\frac{1}{\sqrt{d_*}}\sum_{i\in E}|i\rangle_X|i\rangle_C,\qquad\operatorname{post}_k=B_{XC}^{\otimes k}\otimes\psi^{\otimes k}. B X C = d ∗ 1 i ∈ E ∑ ∣ i ⟩ X ∣ i ⟩ C , post k = B X C ⊗ k ⊗ ψ ⊗ k .
and let P P P project ( X C ) ⊗ k (XC)^{\otimes k} ( X C ) ⊗ k onto B X C ⊗ k B_{XC}^{\otimes k} B X C ⊗ k . The auxiliary label must have at least inverse polynomial probability in post k \operatorname{post}_k post k . We therefore select it using ψ \psi ψ , then impose it on the initial auxiliary pair. Its initial probability need only be nonzero; the prevector remains unnormalized.
In ψ ⊗ k \psi^{\otimes k} ψ ⊗ k , the iid surprisal on R R R is k S ′ + o ( k ) kS'+o(k) k S ′ + o ( k ) in probability. For instance, at fixed system Chebyshev’s inequality gives a window of width k 3 / 4 k^{3/4} k 3/4 . By (118) , the difference between that surprisal and F R F_R F R exceeds k 3 / 4 k^{3/4} k 3/4 with probability at most poly ( k ) e − k 3 / 4 / 2 \operatorname{poly}(k)e^{-k^{3/4}/2} poly ( k ) e − k 3/4 /2 . The number of labels is polynomial. Consequently one can select λ k \lambda_k λ k such that
q k : = ∥ π R λ k ψ ∥ 2 ≥ poly ( k ) − 1 , log d λ k = k S ′ + o ( k ) . (120) q_k:=\left\|\pi_R^{\lambda_k}\psi\right\|^2\ge\operatorname{poly}(k)^{-1},\qquad\log d_{\lambda_k}=kS'+o(k). \tag*{(120)} q k := π R λ k ψ 2 ≥ poly ( k ) − 1 , log d λ k = k S ′ + o ( k ) . (120)
The same label has positive probability on the initial uniform pair: every label allowed for d ∗ d_* d ∗ occurs in the tensor power of a full-rank maximally mixed density. This proves that (112) is nonzero. Its physical part is unchanged by the auxiliary projection, so it is an exact mean-energy eigenvector.
On the repeated uniform pair, the C C C and R R R labels agree. Each metric preserves these two labels: a central permutation operator on an auxiliary system commutes with the simultaneous permutations on a larger region containing it. The tree preserves them as well.
The pinning calculation in one copy, and then in k k k copies, gives
Pre k = ( z d ∗ ) k π R λ k post k . (121) \operatorname{Pre}_k=\left(\frac{\sqrt{z}}{d_*}\right)^k\pi_R^{\lambda_k}\operatorname{post}_k. \tag*{(121)} Pre k = ( d ∗ z ) k π R λ k post k . (121)
The projector P P P commutes with all metrics: X C XC X C is contained in every P j , g P_{j,g} P j , g , and the repeated vector B X C ⊗ k B_{XC}^{\otimes k} B X C ⊗ k is invariant under simultaneous permutations on X C XC X C . In (121) the label projector is on R R R , disjoint from the pin. Therefore
N 2 ≥ ( z d ∗ 2 ) k ∥ M − s π R λ k post k ∥ 2 . (122) N^2\ge\left(\frac{z}{d_*^2}\right)^k\left\|\mathcal{M}^{-s}\pi_R^{\lambda_k}\operatorname{post}_k\right\|^2. \tag*{(122)} N 2 ≥ ( d ∗ 2 z ) k M − s π R λ k post k 2 . (122)
On the pinned symmetric range, the P j , g P_{j,g} P j , g label is the U j , g U_{j,g} U j , g label. By complementarity the F j , g F_{j,g} F j , g label is that of U j , g Y j , g U_{j,g}Y_{j,g} U j , g Y j , g . Because the same label function defines all W Q W_Q W Q , restriction of the metric is exactly
A ~ j , g = ( W U j , g − 1 W U j , g Y j , g − 1 W Y j , g ) 2 , log A ~ j , g = a ( F U j , g + F U j , g Y j , g − F Y j , g ) + O ( log ( k + 1 ) ) id . (123) \widetilde{A}_{j,g}=\left(W_{U_{j,g}}^{-1}W_{U_{j,g}Y_{j,g}}^{-1}W_{Y_{j,g}}\right)^2,\qquad\log\widetilde{A}_{j,g}=a\left(F_{U_{j,g}}+F_{U_{j,g}Y_{j,g}}-F_{Y_{j,g}}\right)+O(\log(k+1))\operatorname{id}. \tag*{(123)} A j , g = ( W U j , g − 1 W U j , g Y j , g − 1 W Y j , g ) 2 , log A j , g = a ( F U j , g + F U j , g Y j , g − F Y j , g ) + O ( log ( k + 1 )) id . (123)
The final error notation means a bound in operator norm; it does not assert that the error is scalar. The restricted tree will be denoted M ~ \widetilde{\mathcal{M}} M , with factors M ~ g \widetilde{\mathcal{M}}_g M g .
Upper comparisons
For any physical B B B disjoint from X X X , tracing the Schmidt truncation gives
ρ B = z ρ ψ , B + ( 1 − z ) ρ r e m , B , ρ ψ , B ≤ z − 1 ρ B , S ( ρ ψ , B ) ≤ S ( B ) / z , (124) \rho_B=z\rho_{\psi,B}+(1-z)\rho_{\mathrm{rem},B},\qquad\rho_{\psi,B}\le z^{-1}\rho_B,\qquad S(\rho_{\psi,B})\le S(B)/z, \tag*{(124)} ρ B = z ρ ψ , B + ( 1 − z ) ρ rem , B , ρ ψ , B ≤ z − 1 ρ B , S ( ρ ψ , B ) ≤ S ( B ) / z , (124)
where the remainder is omitted if z = 1 z=1 z = 1 . The entropy inequality is concavity, with the nonnegative remainder entropy discarded.
For the rough comparison, simultaneously impose the cutoffs
F B ≤ k ( S ( B ) / z + 1 ) , B ∈ R , F_B\le k(S(B)/z+1),\qquad B\in\mathcal{R}, F B ≤ k ( S ( B ) / z + 1 ) , B ∈ R ,
on post k \operatorname{post}_k post k . These spectral projections commute, since R \mathcal{R} R is nested. Each failure has exponentially small probability in k k k : under the iid marginal of ψ \psi ψ , F B F_B F B is at most the surprisal, whose one-copy law is bounded on its positive spectrum at this fixed system; exponential Markov and (124) then apply. The finite union of failures is still exponentially small. All these projections commute with π R λ k \pi_{\mathcal{R}}^{\lambda_k} π R λ k . Their common projection of π R λ k post k \pi_{\mathcal{R}}^{\lambda_k}\operatorname{post}_k π R λ k post k therefore has squared norm at least poly ( k ) − 1 \operatorname{poly}(k)^{-1} poly ( k ) − 1 by (120) . Normalize it to φ \varphi φ ; then
∣ ⟨ φ , π R λ k post k ⟩ ∣ 2 ≥ poly ( k ) − 1 . (125) \left|\left\langle\varphi,\pi_{\mathcal{R}}^{\lambda_k}\operatorname{post}_k\right\rangle\right|^2\ge\operatorname{poly}(k)^{-1}. \tag*{(125)} ⟨ φ , π R λ k post k ⟩ 2 ≥ poly ( k ) − 1 . (125)
If Q Q Q is matched to B B B , the nested label inequalities give F Q ≤ F B + k log dim H B △ Q F_Q\le F_B+k\log\dim\mathcal{H}_{B\triangle Q} F Q ≤ F B + k log dim H B △ Q , in either inclusion direction. The two label operators commute. Thus φ \varphi φ belongs to the spectral range
F Q ≤ k ( B s h / z + B e x c ) , Q = U j , g , U j , g Y j , g . (126) F_Q\le k(B_{\mathrm{sh}}/z+B_{\mathrm{exc}}),\qquad Q=U_{j,g},\ U_{j,g}Y_{j,g}. \tag*{(126)} F Q ≤ k ( B sh / z + B exc ) , Q = U j , g , U j , g Y j , g . (126)
An actual label need only commute with its matched cutoff to obtain this conclusion; no commutation with every imposed cutoff is being assumed. Within any one product leaf, all the labels in (123) commute by (8.1) . Dropping the negative labels therefore gives
⟨ φ , ∏ g A ~ j , g φ ⟩ ≤ poly ( k ) exp { 2 k a K ( B s h / z + B e x c ) } . \left\langle\varphi,\prod_g\widetilde{A}_{j,g}\varphi\right\rangle\le\operatorname{poly}(k)\exp\{2kaK(B_{\mathrm{sh}}/z+B_{\mathrm{exc}})\}. ⟨ φ , g ∏ A j , g φ ⟩ ≤ poly ( k ) exp { 2 k a K ( B sh / z + B exc )} .
Equation (81) , iterated through the tree, gives the same bound for ⟨ φ , M ~ φ ⟩ \langle\varphi,\widetilde{\mathcal{M}}\varphi\rangle ⟨ φ , M φ ⟩ . Since 2 s ≤ 1 2s\le1 2 s ≤ 1 , another scalar Jensen inequality bounds the expectation of M ~ 2 s \widetilde{\mathcal{M}}^{2s} M 2 s by the 2 s 2s 2 s power of its expectation. Cauchy–Schwarz in (125) , applied to M ~ s φ \widetilde{\mathcal{M}}^s\varphi M s φ and M ~ − s π R λ k post k \widetilde{\mathcal{M}}^{-s}\pi_{\mathcal{R}}^{\lambda_k}\operatorname{post}_k M − s π R λ k post k , now proves (113) using (122) .
For the sharp bound, instead normalize π R λ k post k \pi_{\mathcal{R}}^{\lambda_k}\operatorname{post}_k π R λ k post k itself to a vector ψ ^ k \widehat{\psi}_k ψ k . Scalar Jensen for the exponential gives
∥ M ~ − s π R λ k post k ∥ 2 ≥ q k exp { − 2 s ⟨ ψ ^ k , log M ~ ψ ^ k ⟩ } . \left\|\widetilde{\mathcal{M}}^{-s}\pi_{\mathcal{R}}^{\lambda_k}\operatorname{post}_k\right\|^2\ge q_k\exp\{-2s\langle\widehat{\psi}_k,\log\widetilde{\mathcal{M}}\widehat{\psi}_k\rangle\}. M − s π R λ k post k 2 ≥ q k exp { − 2 s ⟨ ψ k , log M ψ k ⟩} .
Split the logarithm into the commuting band factors. On each band, log Jensen, commutation with the auxiliary sector, and vector mean Jensen give
⟨ ψ ^ k , log M ~ g ψ ^ k ⟩ ≤ log ⟨ ψ ^ k , M ~ g ψ ^ k ⟩ ≤ O ( log ( k + 1 ) ) + ∑ j w j log ⟨ post k , A ~ j , g post k ⟩ . (127) \begin{aligned}
\langle\widehat{\psi}_k,\log\widetilde{\mathcal{M}}_g\widehat{\psi}_k\rangle
&\le\log\langle\widehat{\psi}_k,\widetilde{\mathcal{M}}_g\widehat{\psi}_k\rangle\\
&\le O(\log(k+1))+\sum_j w_j\log\langle\operatorname{post}_k,\widetilde{A}_{j,g}\operatorname{post}_k\rangle. \tag*{(127)}
\end{aligned} ⟨ ψ k , log M g ψ k ⟩ ≤ log ⟨ ψ k , M g ψ k ⟩ ≤ O ( log ( k + 1 )) + j ∑ w j log ⟨ post k , A j , g post k ⟩ . (127)
The conditioning cost is only − log q k = O ( log ( k + 1 ) ) -\log q_k = O(\log(k+1)) − log q k = O ( log ( k + 1 )) . For a leaf expectation in (127) , use (123) and scalar Hölder with powers three on its three commuting signed label exponentials. Each corresponding post marginal is bounded by z − k Q Ω ⊗ k z^{-k}Q_{\Omega}^{\otimes k} z − k Q Ω ⊗ k , by (124) . Apply (119) at 3 a 3a 3 a . The result is
log ⟨ post k , A ~ j , g post k ⟩ ≤ k a g j , g post + C k a 2 B + k ∣ log z ∣ + O ( log ( k + 1 ) ) . \log\langle\operatorname{post}_k,\widetilde{A}_{j,g}\operatorname{post}_k\rangle\le ka g_{j,g}^{\operatorname{post}}+Cka^2\mathcal{B}+k|\log z|+O(\log(k+1)). log ⟨ post k , A j , g post k ⟩ ≤ k a g j , g post + C k a 2 B + k ∣ log z ∣ + O ( log ( k + 1 )) .
Together with the pin norm this proves (115) .
The inverse metric on copies near the ground state
We next prove the lower comparison. The gap first bounds the vector’s mass outside a subspace with few excited physical copies. On that subspace we will bound the compression of each inverse metric; this will give an operator lower bound that can pass through the mean tree. Let Q i = id − ∣ Ω ~ ⟩ ⟨ Ω ~ ∣ Q_i=\operatorname{id}-|\widetilde{\Omega}\rangle\langle\widetilde{\Omega}| Q i = id − ∣ Ω ⟩ ⟨ Ω ∣ on physical copy i i i . On the symmetric space with the two fixed auxiliary labels, let Π \Pi Π project onto ∑ i Q i ≤ τ k \sum_i Q_i\le\tau k ∑ i Q i ≤ τ k . The full physical gap gives
H ‾ − E ~ 0 id ≥ g ~ k ∑ i Q i , ⟨ v , Π v ⟩ ≥ 1 − E d e f τ . (128) \overline{H}-\widetilde{E}_0\operatorname{id}\ge\frac{\widetilde{g}}{k}\sum_i Q_i,\qquad\langle v,\Pi v\rangle\ge1-\frac{E_{\mathrm{def}}}{\tau}. \tag*{(128)} H − E 0 id ≥ k g i ∑ Q i , ⟨ v , Π v ⟩ ≥ 1 − τ E def . (128)
The projection is compatible with symmetry and the auxiliary sectors because the defect count acts on physical copies only and is invariant under simultaneous copy permutations.
Fix a unit vector u u u in the range of Π \Pi Π . For a subset B ⊆ { 1 , … , k } B\subseteq\{1,\ldots,k\} B ⊆ { 1 , … , k } , let u B u_B u B be its component with precisely the physical copies in B B B excited. Then
u = ∑ ∣ B ∣ ≤ τ k u B , ∑ B ∥ u B ∥ 2 = 1. u=\sum_{|B|\le\tau k}u_B,\qquad\sum_B\lVert u_B\rVert^2=1. u = ∣ B ∣ ≤ τ k ∑ u B , B ∑ ∥ u B ∥ 2 = 1.
In estimates for normalized components, omit the terms with u B = 0 u_B=0 u B = 0 . For r = ∣ B ∣ r=|B| r = ∣ B ∣ , u B u_B u B is invariant under simultaneous permutations separately on the k ′ = k − r k'=k-r k ′ = k − r good copies and the r r r bad copies. It factors as Ω ~ ⊗ k ′ \widetilde{\Omega}^{\otimes k'} Ω ⊗ k ′ on the good physical factors, tensored with a vector on the remaining factors. Each u B u_B u B still has the two whole-copy auxiliary labels λ k \lambda_k λ k .
We first compare metrics on the full copy space, before evaluating on these components. Extend a band metric there by its disjoint W W W formula. For any region Q Q Q , its whole label and its two subgroup labels commute. On a compatible triple,
F Q g o o d + F Q b a d ≤ F Q w h o l e ≤ F Q g o o d + F Q b a d + log ( k r ) . (129) F_Q^{\mathrm{good}}+F_Q^{\mathrm{bad}}\le F_Q^{\mathrm{whole}}\le F_Q^{\mathrm{good}}+F_Q^{\mathrm{bad}}+\log\binom{k}{r}. \tag*{(129)} F Q good + F Q bad ≤ F Q whole ≤ F Q good + F Q bad + log ( r k ) . (129)
The first inequality is inclusion of a subgroup irreducible; the second holds because its coset translates span the whole irreducible. These are the subgroup dimension inequalities from Lemma 6.1. For the three disjoint regions P , Y , F P,Y,F P , Y , F , all labels needed in this comparison commute. With G = F P + F F − F Y G=F_P+F_F-F_Y G = F P + F F − F Y , the logarithmic approximation of the W W W metrics yields the operator inequality
A j , g − 1 ≤ poly ( k ) ( k r ) C a exp { − a G g o o d − a G b a d } . (130) A_{j,g}^{-1}\le\operatorname{poly}(k)\binom{k}{r}^{Ca}\exp\{-aG^{\mathrm{good}}-aG^{\mathrm{bad}}\}. \tag*{(130)} A j , g − 1 ≤ poly ( k ) ( r k ) C a exp { − a G good − a G bad } . (130)
This step does not commute an individual physical-position projector through A j , g A_{j,g} A j , g . Such a commutation would generally be false.
On the bad group, simultaneous symmetry implies G b a d ≥ 0 G^{\mathrm{bad}} \ge0 G bad ≥ 0 on the measured support. It may be discarded in the expectation of (130) ; the good factors preserve that support because they act on disjoint copies. For each auxiliary system, (129) and its whole label give, on u B u_B u B ,
F C g o o d , F R g o o d ≥ k S ′ − r log d ∗ − log ( k r ) − o ( k ) . (131) F_C^{\mathrm{good}},\ F_R^{\mathrm{good}} \ge kS' - r \log d_* - \log\binom{k}{r} - o(k). \tag*{(131)} F C good , F R good ≥ k S ′ − r log d ∗ − log ( r k ) − o ( k ) . (131)
Indeed a bad-group Specht dimension is at most d ∗ r d_*^r d ∗ r , and (120) controls the whole label.
The good copies therefore retain both large auxiliary labels. To bound the inverse metric on each component, we now compare the combined physical–auxiliary labels with their separate labels. The physical factors will supply exact iid moments, and the loss from combining labels will have exponential moments bounded by polynomials in k k k . Suppress the good-group superscript for the next calculation and write Q = X U j , g Q = XU_{j,g} Q = X U j , g , V = V j , g V = V_{j,g} V = V j , g , Y = Y j , g Y = Y_{j,g} Y = Y j , g . Define the merge deficits
D C = F Q + F C − F Q C , D R = F V + F R − F V R , G p h y s = F Q + F V − F Y . D_C = F_Q + F_C - F_{QC}, \qquad D_R = F_V + F_R - F_{VR}, \qquad G_{\mathrm{phys}} = F_Q + F_V - F_Y. D C = F Q + F C − F QC , D R = F V + F R − F V R , G phys = F Q + F V − F Y .
All these operators, as well as F C F_C F C , F R F_R F R , commute. The deficits are nonnegative by the tensor-product dimension inequalities, and
G g o o d = G p h y s + F C + F R − D C − D R . (132) G^{\mathrm{good}} = G_{\mathrm{phys}} + F_C + F_R - D_C - D_R. \tag*{(132)} G good = G phys + F C + F R − D C − D R . (132)
The physical good copies are symmetric, so they lie in the spectral projection J = 1 [ 0 , ∞ ) ( G p h y s ) J = 1_{[0,\infty)}(G_{\mathrm{phys}}) J = 1 [ 0 , ∞ ) ( G phys ) . The projection J J J commutes with both merge deficits: physical central labels commute with the larger-region simultaneous permutations which define the merged labels. Consequently it continues to enforce G p h y s ≥ 0 G_{\mathrm{phys}} \ge0 G phys ≥ 0 while the other commuting factors are measured. We use this compatible-physical-label projection, not an assertion that the full physical symmetric subspace is preserved by a merge.
We need dimension-independent exponential rates for the deficits. In a normalized component u B u_B u B , the marginal on Q Q Q , C C C is the tensor product of the iid physical marginal on Q Q Q and a permutation-invariant auxiliary marginal on C C C . Conditional on their labels γ \gamma γ , β \beta β , the two Specht factors are independent and maximally mixed. If ν \nu ν is their combined label, its conditional probability is
m γ , β ν d ν d γ d β . m_{\gamma,\beta}^{\nu} \frac{d_{\nu}}{d_{\gamma}d_{\beta}}. m γ , β ν d γ d β d ν .
Here the multiplicity m γ , β ν m_{\gamma,\beta}^{\nu} m γ , β ν is polynomial in k k k at fixed dimensions. To see this, embed one copy of [ γ ] ⊗ [ β ] [\gamma] \otimes[\beta] [ γ ] ⊗ [ β ] into ( Q C ) ⊗ k (QC)^{\otimes k} ( QC ) ⊗ k by choosing vectors in the separate multiplicity spaces. Its multiplicity of [ ν ] [\nu] [ ν ] cannot exceed the dimension of the combined multiplicity space, which is polynomial by Schur–Weyl decomposition. Thus, for 0 ≤ b ≤ 1 0 \le b \le1 0 ≤ b ≤ 1 ,
E u B / ∥ u B ∥ e b D C ≤ poly ( k ) , E u B / ∥ u B ∥ e b D R ≤ poly ( k ) . (133) \mathbb{E}_{u_B/\lVert u_B\rVert} e^{bD_C} \le\operatorname{poly}(k), \qquad\mathbb{E}_{u_B/\lVert u_B\rVert} e^{bD_R} \le\operatorname{poly}(k). \tag*{(133)} E u B / ∥ u B ∥ e b D C ≤ poly ( k ) , E u B / ∥ u B ∥ e b D R ≤ poly ( k ) . (133)
For example the conditional sum is ∑ ν m γ , β ν ( d ν / ( d γ d β ) ) 1 − b ≤ ∑ ν m γ , β ν \sum_{\nu} m_{\gamma,\beta}^{\nu}(d_{\nu}/(d_{\gamma}d_{\beta}))^{1-b} \le\sum_{\nu} m_{\gamma,\beta}^{\nu} ∑ ν m γ , β ν ( d ν / ( d γ d β ) ) 1 − b ≤ ∑ ν m γ , β ν . No iid hypothesis on the auxiliary marginal is used. Its permutation invariance follows by tracing the other factors from the good-group symmetric component.
For the rough estimate, use J J J to discard e − a G p h y s e^{-aG_{\mathrm{phys}}} e − a G phys , and use Cauchy–Schwarz on e a D C e a D R e^{aD_C}e^{aD_R} e a D C e a D R with (133) . For the sharp estimate, use scalar Hölder with powers five on these two factors and the three factors e − a F Q e^{-aF_Q} e − a F Q , e − a F V e^{-aF_V} e − a F V , e a F Y e^{aF_Y} e a F Y . Their physical moments are evaluated in the exact iid state Ω ~ ⊗ k \widetilde{\Omega}^{\otimes k} Ω ⊗ k ; apply (119) . Choosing a 0 a_0 a 0 and c c c small ensures that all fivefold moments and the negative-sign doubling in that estimate are allowed. Combining with (131) gives
⟨ u B , A j , g − 1 u B ⟩ ∥ u B ∥ 2 ≤ poly ( k ) exp { − 2 k a S ′ − ( k − r ) a g j , g p r e + 2 a r log d ∗ + C a log ( k r ) + C k a 2 B + o ( k ) } . (134) \frac{\langle u_B,A_{j,g}^{-1}u_B\rangle}{\lVert u_B\rVert^2}\le\operatorname{poly}(k)\exp\left\{-2kaS'-(k-r)ag_{j,g}^{\mathrm{pre}}+2ar\log d_*+Ca\log\binom{k}{r}+Cka^2B+o(k)\right\}. \tag*{(134)} ∥ u B ∥ 2 ⟨ u B , A j , g − 1 u B ⟩ ≤ poly ( k ) exp { − 2 k a S ′ − ( k − r ) a g j , g pre + 2 a r log d ∗ + C a log ( r k ) + C k a 2 B + o ( k ) } . (134)
For the rough estimate omit both the g j , g p r e g_{j,g}^{\mathrm{pre}} g j , g pre and a 2 B a^2B a 2 B terms. The entropy g j , g p r e g_{j,g}^{\mathrm{pre}} g j , g pre is nonnegative because physical purity gives S ( Y ) = S ( Q V ) ≤ S ( Q ) + S ( V ) S(Y)=S(QV)\le S(Q)+S(V) S ( Y ) = S ( Q V ) ≤ S ( Q ) + S ( V ) .
There are at most ( k + 1 ) e k h ( τ ) (k+1)e^{kh(\tau)} ( k + 1 ) e k h ( τ ) subsets with r ≤ τ k r\le\tau k r ≤ τ k , and log ( k r ) ≤ k h ( τ ) \log\binom{k}{r}\le kh(\tau) log ( r k ) ≤ k h ( τ ) . Cauchy–Schwarz for A j , g − 1 / 2 ∑ B u B A_{j,g}^{-1/2}\sum_Bu_B A j , g − 1/2 ∑ B u B , followed by (134) , proves
Π A j , g − 1 / 2 Π ≤ exp { − k a L j , g + o ( k ) } Π , L j , g = 2 S ′ + ( 1 − τ ) g j , g p r e − C ( τ log d ∗ + h ( τ ) a + a B ) . (135) \Pi A_{j,g}^{-1/2}\Pi\le\exp\{-kaL_{j,g}+o(k)\}\Pi,\qquad L_{j,g}=2S'+(1-\tau)g_{j,g}^{\mathrm{pre}}-C\left(\tau\log d_*+\frac{h(\tau)}{a}+aB\right). \tag*{(135)} Π A j , g − 1/2 Π ≤ exp { − k a L j , g + o ( k )} Π , L j , g = 2 S ′ + ( 1 − τ ) g j , g pre − C ( τ log d ∗ + a h ( τ ) + a B ) . (135)
In the rough version set g p r e = 0 g^{\mathrm{pre}}=0 g pre = 0 and omit a B aB a B . The factor counting subsets is precisely the source of h ( τ ) / a h(\tau)/a h ( τ ) / a . Taking the operator norm of A j , g − 1 / 2 Π A_{j,g}^{-1/2}\Pi A j , g − 1/2 Π shows that (135) is equivalent to the useful lower pin
A j , g ≥ exp { k a L j , g − o ( k ) } Π . (136) A_{j,g}\ge\exp\{kaL_{j,g}-o(k)\}\Pi. \tag*{(136)} A j , g ≥ exp { k a L j , g − o ( k )} Π. (136)
For instance, apply the norm bound for Π A j , g − 1 / 2 \Pi A_{j,g}^{-1/2} Π A j , g − 1/2 to A j , g 1 / 2 x A_{j,g}^{1/2}x A j , g 1/2 x to get the quadratic-form inequality for every x x x . No commutation of A j , g A_{j,g} A j , g with Π \Pi Π is required.
Passing the lower pin through the tree
The individual lower pins must be combined with the floor on the whole symmetric space before logarithms are taken. For a common polynomial p ( k ) p(k) p ( k ) , all the finitely many leaves satisfy A j , g ≥ p ( k ) − 1 id A_{j,g}\ge p(k)^{-1}\operatorname{id} A j , g ≥ p ( k ) − 1 id there. This follows from F Y ≤ F P + F F F_Y\le F_P+F_F F Y ≤ F P + F F on simultaneous symmetry and the logarithmic metric approximation. Restrict throughout to the common auxiliary sector and put b 0 = ( 2 p ( k ) ) − 1 b_0=(2p(k))^{-1} b 0 = ( 2 p ( k ) ) − 1 . Averaging the floor and (136) yields
A j , g ≥ b 0 ( id − Π ) + b j , g Π , b j , g = b 0 + 1 2 exp { k a L j , g − o ( k ) } . A_{j,g}\ge b_0(\operatorname{id}-\Pi)+b_{j,g}\Pi,\qquad b_{j,g}=b_0+\frac{1}{2}\exp\{kaL_{j,g}-o(k)\}. A j , g ≥ b 0 ( id − Π ) + b j , g Π , b j , g = b 0 + 2 1 exp { k a L j , g − o ( k )} .
The right sides all commute with each other. Mean monotonicity and scalar homogeneity therefore give
M g ≥ b 0 ( id − Π ) + e ℓ g Π , ℓ g = ∑ j w j log b j , g . M_g\ge b_0(\operatorname{id}-\Pi)+e^{\ell_g}\Pi,\qquad\ell_g=\sum_jw_j\log b_{j,g}. M g ≥ b 0 ( id − Π ) + e ℓ g Π , ℓ g = j ∑ w j log b j , g .
Uniformly in the probabilities,
ℓ g ≥ k a ∑ j w j L j , g − o ( k ) , 0 ≤ ℓ g − log b 0 ≤ k a max j ( L j , g ) + + o ( k ) . \ell_g\ge ka\sum_jw_jL_{j,g}-o(k),\qquad0\le\ell_g-\log b_0\le ka\max_j(L_{j,g})_++o(k). ℓ g ≥ k a j ∑ w j L j , g − o ( k ) , 0 ≤ ℓ g − log b 0 ≤ k a j max ( L j , g ) + + o ( k ) .
Log monotonicity and (128) now imply
⟨ v , log M g v ⟩ ≥ k a [ ∑ j w j L j , g − E d e f τ max j ( L j , g ) + ] − o ( k ) . (137) \langle v,\log M_gv\rangle\ge ka\left[\sum_jw_jL_{j,g}-\frac{E_{\mathrm{def}}}{\tau}\max_j(L_{j,g})_+\right]-o(k). \tag*{(137)} ⟨ v , log M g v ⟩ ≥ k a [ j ∑ w j L j , g − τ E def j max ( L j , g ) + ] − o ( k ) . (137)
One may first use min ( 1 , E d e f / τ ) \min(1,E_{\mathrm{def}}/\tau) min ( 1 , E def / τ ) in the error, which also makes its uniformity in the state immediate, and then weaken to the displayed expression. In the rough case max j ( L j , g ) + ≤ 2 S ′ \max_j(L_{j,g})_+\le2S' max j ( L j , g ) + ≤ 2 S ′ ; in the sharp case it is at most 2 S ′ + g max 2S'+g_{\max} 2 S ′ + g m a x .
Finally,
N 2 ⟨ v , M 2 s v ⟩ = ∥ pre k ∥ 2 ≤ 1 , − log N 2 ≥ log ⟨ v , M 2 s v ⟩ ≥ 2 s ⟨ v , log M v ⟩ . N^{2}\langle v,\mathcal{M}^{2s}v\rangle=\|\operatorname{pre}_{k}\|^{2}\le1,\qquad-\log N^{2}\ge\log\langle v,\mathcal{M}^{2s}v\rangle\ge2s\langle v,\log\mathcal{M}v\rangle. N 2 ⟨ v , M 2 s v ⟩ = ∥ pre k ∥ 2 ≤ 1 , − log N 2 ≥ log ⟨ v , M 2 s v ⟩ ≥ 2 s ⟨ v , log M v ⟩ .
Since log M = ∑ g log M g \log\mathcal{M}=\sum_g\log\mathcal{M}_g log M = ∑ g log M g , summing (137) proves (114) and (116) .
To finish, physical purity gives S ( X V ) = S ( U Y ) S(XV)=S(UY) S ( X V ) = S ( U Y ) and S ( X Y V ) = S ( U ) S(XYV)=S(U) S ( X Y V ) = S ( U ) . Expanding the two mutual informations on the right of (117) proves that identity. The comparison is therefore complete: its rough form discounts the target entropy, while its sharp form bounds the target’s mutual information with the physical far systems.
All estimates above use maxima over finitely many statuses, fixed-dimension Schur polynomial bounds, and the single sequence of labels (120) . The norm estimates for the defect components are uniform in their auxiliary states. Jensen and mean monotonicity introduce no inverse terminal probability. Consequently the replica errors are uniform in all terminal probabilities, including at zero weights by omitting those branches. This also permits a later choice of a different tree interpolation point for each k k k , followed by the limit k → ∞ k\to\infty k → ∞ at the fixed finite physical system.
Scanning collars and improving the entropy bound
The preceding estimates compare the entropy gained by moving a small set across a partition with the energy cost of changing its metric. We now construct a finite schedule of such moves. Random initial offsets make any fixed interaction unlikely to cross a moving boundary; random choices of local moves give each crossing interaction a chance to be moved in full. Together these two features produce a small-energy interpolation. The rough norm comparison then improves the safe-box exponent, and the sharp comparison gives a sublinear mutual-information bound across a collar.
Fix the cut A A A , and write Z Z Z for its crossing-edge endpoints. Throughout this section, depth means ambient integer sup-norm distance. Interaction supports and their truncations still use the graph metric of Λ \Lambda Λ . In particular, a depth row is a set of sites at a fixed distance from the target, and need not be a horizontal lattice row.
The moving partitions
Let T ⊂ Z 2 T\subset\mathbb{Z}^{2} T ⊂ Z 2 be a finite ambient target. Write T j = T + [ − j , j ] 2 T_j=T+[-j,j]^2 T j = T + [ − j , j ] 2 , Q j = A ∩ ( T j ∖ T ) Q_j=A\cap(T_j\setminus T) Q j = A ∩ ( T j ∖ T ) , and X = A ∩ T X=A\cap T X = A ∩ T , and suppose X ≠ ∅ X\ne\varnothing X = ∅ . A useful example is a safe integer rectangle of maximal side length s 0 s_0 s 0 : depth rows in a collar of width at most s 0 s_0 s 0 contain O ( s 0 ) O(s_0) O ( s 0 ) sites, so the row scale can be a fixed multiple of s 0 s_0 s 0 . The safe-box estimate bounds its core entropy; covering a sufficiently narrow shell by safe squares gives the shell entropy input. We give this verification, and its extension to the polygonal unions needed by the final tiling, after deriving the general scanner estimate.
At an integer scale n ≥ 2 n\ge2 n ≥ 2 , choose
L = ⌈ n 1 − ℓ ⌉ , m = ⌈ n μ ⌉ , K = ⌈ L / ( 8 m ) ⌉ , D = ⌈ n κ ⌉ , a = W / K , (138) L=\lceil n^{1-\ell}\rceil,\qquad m=\lceil n^\mu\rceil,\qquad K=\lceil L/(8m)\rceil,\qquad D=\lceil n^\kappa\rceil,\qquad a=W/K, \tag*{(138)} L = ⌈ n 1 − ℓ ⌉ , m = ⌈ n μ ⌉ , K = ⌈ L / ( 8 m )⌉ , D = ⌈ n κ ⌉ , a = W / K , (138)
where 0 < ℓ < 1 0<\ell<1 0 < ℓ < 1 , 0 < κ < μ < 1 − ℓ 0<\kappa<\mu<1-\ell 0 < κ < μ < 1 − ℓ , and W ≥ 1 W\ge1 W ≥ 1 . We work at large enough n n n that K ≥ 1 K\ge1 K ≥ 1 . Assume
∣ T ∣ ≤ C n 2 , ∣ T j ∖ T j − 1 ∣ ≤ n ( 1 ≤ j ≤ L ) , dist ∞ ( T , Z ) > 2 L + 10 r 0 , (139) |T|\le Cn^2,\qquad|T_j\setminus T_{j-1}|\le n\quad(1\le j\le L),\qquad\operatorname{dist}_{\infty}(T,Z)>2L+10r_0, \tag*{(139)} ∣ T ∣ ≤ C n 2 , ∣ T j ∖ T j − 1 ∣ ≤ n ( 1 ≤ j ≤ L ) , dist ∞ ( T , Z ) > 2 L + 10 r 0 , (139)
where r 0 = ⌈ C log 2 n ⌉ r_0=\lceil C\log^2 n\rceil r 0 = ⌈ C log 2 n ⌉ is chosen as in Proposition 4.5. Increasing its constant fixes the truncation error at n − 1000 n^{-1000} n − 1000 . We require n n n large enough that r 0 ≪ D ≪ m ≪ L r_0\ll D\ll m\ll L r 0 ≪ D ≪ m ≪ L . The compact set used for that proposition is S 0 = A ∩ T L S_0=A\cap T_L S 0 = A ∩ T L ; it has O ( n 2 ) O(n^2) O ( n 2 ) sites. Denote the resulting Hamiltonian, exact ground vector, ground energy, and spectral gap by H ~ , Ω ~ , E ~ 0 \widetilde H,\widetilde\Omega,\widetilde E_0 H , Ω , E 0 , and g ~ \widetilde g g , respectively. Write h ~ i \widetilde h_i h i for its terms and X ~ i \widetilde{X}_i X i for their designated supports, as in that proposition. In particular E ~ 0 ≤ n − 1000 \widetilde{E}_0 \le n^{-1000} E 0 ≤ n − 1000 and g ~ ≥ g / 2 \widetilde{g} \ge g/2 g ≥ g /2 . The target cut has O ( n ) O(n) O ( n ) edges: an ambient edge leaving T T T has its outside endpoint in the first positive-depth row, and the clearance excludes edges from X X X to Λ ∖ A \Lambda\setminus A Λ ∖ A . This observation will control the target’s marginal spectrum even for these general targets.
Table 2.
The scalar W W W is distinct from the subsystem operators W Q , k W_{Q,k} W Q , k .
Order the sites of each positive-depth row, and pad that order to exactly n n n slots. An absent site or a site outside A A A is a blank for the scan. The order of these slots will remain fixed. For band q ′ = 0 , … , K − 1 q' = 0,\ldots,K-1 q ′ = 0 , … , K − 1 , put b q ′ = 8 q ′ m b_{q'} = 8q'm b q ′ = 8 q ′ m , and choose an independent uniform offset r q ′ ∈ { 0 , … , m − 1 } r_{q'} \in\{0,\ldots,m-1\} r q ′ ∈ { 0 , … , m − 1 } . Its initial physical partition is
P 0 = { x ∈ A : dist ∞ ( x , T ) ≤ b q ′ + m + r q ′ } = X U , V = ( Λ ∖ A ) ∪ { x ∈ A : dist ∞ ( x , T ) > b q ′ + 5 m + r q ′ } , Y = Λ ∖ ( P 0 ∪ V ) . \begin{aligned}
P_0 &= \{x \in A : \operatorname{dist}_{\infty}(x,T) \le b_{q'} + m + r_{q'}\} = XU,\\
V &= (\Lambda\setminus A) \cup\{x \in A : \operatorname{dist}_{\infty}(x,T) > b_{q'} + 5m + r_{q'}\},\\
Y &= \Lambda\setminus(P_0 \cup V).
\end{aligned} P 0 V Y = { x ∈ A : dist ∞ ( x , T ) ≤ b q ′ + m + r q ′ } = X U , = ( Λ ∖ A ) ∪ { x ∈ A : dist ∞ ( x , T ) > b q ′ + 5 m + r q ′ } , = Λ ∖ ( P 0 ∪ V ) .
The two auxiliary systems of Proposition 8.1, denoted here by C C C and R R R , give the full partition P = C P 0 P = CP_0 P = C P 0 , Y Y Y , F = R V F = RV F = R V . Every band uses the same auxiliary systems, but has its own evolving physical partition.
There are two kinds of rounds. A fill advances a nominal front according to a fixed schedule. A charge chooses an interaction and attempts to move the entire unassigned part of its designated support. The random choices specify the weights of a finite history tree; the metric construction below uses the whole tree.
There are n m nm nm fill rounds and n m nm nm charge rounds, interleaved, with a fill first. A round performs one transition in every band. At fill rounds the receiving side alternates between the near and far sides. Its schedule consumes one slot of the original middle window, in increasing depth for the near side and decreasing depth for the far side. Within a row use its fixed order, reversed on the far side if necessary. If the slot is a site still in Y Y Y , move it to the receiving side. Consume the slot also when it is blank or was already assigned. In particular, a charge never changes the fill schedule.
For the near side use oriented depth λ = dist ∞ ( ⋅ , T ) \lambda= \operatorname{dist}_{\infty}(\mathord{\cdot},T) λ = dist ∞ ( ⋅ , T ) , and for the far side use λ = − dist ∞ ( ⋅ , T ) \lambda= -\operatorname{dist}_{\infty}(\mathord{\cdot},T) λ = − dist ∞ ( ⋅ , T ) . If t P , t F t_P,t_F t P , t F are the numbers of fills already assigned to the respective sides, their next incomplete row depths are
j P = b q ′ + m + r q ′ + 1 + ⌊ t P / n ⌋ , j F = − ( b q ′ + 5 m + r q ′ ) + ⌊ t F / n ⌋ . (140) j_P = b_{q'} + m + r_{q'} + 1 + \lfloor t_P/n \rfloor,\qquad
j_F = -(b_{q'} + 5m + r_{q'}) + \lfloor t_F/n \rfloor. \tag*{(140)} j P = b q ′ + m + r q ′ + 1 + ⌊ t P / n ⌋ , j F = − ( b q ′ + 5 m + r q ′ ) + ⌊ t F / n ⌋ . (140)
At a charge round choose a uniform side. On that side form the list of labelled term anchors with oriented depth in [ j − r 0 , j + D ] [j-r_0,j+D] [ j − r 0 , j + D ] , counting anchor multiplicity, and pad it to a fixed integer M n = ⌈ C 1 n D ⌉ M_n = \lceil C_1 nD \rceil M n = ⌈ C 1 n D ⌉ . Here C 1 C_1 C 1 is a uniform constant large enough for every such list. Choose a uniform slot of this list. If its graph r 0 r_0 r 0 -ball meets both the receiving physical side and Y Y Y , move all sites of that ball which remain in Y Y Y to the side. Otherwise make no move. The choices are conditionally independent across bands. The band margins ensure that every unsigned depth appearing in these lists is between 1 and L L L .
The two probabilities needed later have different roles. Initial offsets will bound the probability that a fixed term splits by O ( D / m ) O(D/m) O ( D / m ) . Except on rare histories, a charge will select each term currently split with probability at least c / ( n D ) c/(nD) c / ( n D ) . The deterministic fill schedule is essential to both estimates: a charge never changes a nominal front. Figure 2 shows the nominal partitions and the possible lead of the charged sites.
Figure 2. Schematic nominal depth partitions in two bands, not to scale. The horizontal coordinate records distance from the target, not a physical lattice direction. Dashed lines are the nominal fronts, and arrows show the fill directions. Charges may have assigned individual sites in the hatched intervals, so the actual sets U U U , Y Y Y , V V V need not be depth intervals. The separated windows ensure that one support cannot split two bands. Every site of Λ ∖ A \Lambda\setminus A Λ ∖ A also belongs to V V V in each band. Auxiliary systems are not shown.
A history records the offsets and all choices already made. Its probability is the classical path probability, before transporting any replica state. At each round form the conditional binary mean trees of the new choices and interpolate every old leaf by the same parameter p ∈ [ 0 , 1 ] p \in[0,1] p ∈ [ 0 , 1 ] , as in Proposition 7.4. At p = 1 p=1 p = 1 attach the choice trees to the history tree and proceed to the next round. The parameter p p p is common to all old histories and all bands in that round. This gives the root metric M \mathcal{M} M , the norm N N N , and the normalized replica vector v v v used in the preceding two sections.
Lemma 9.1 (Geometry and probabilities of the scan). Under (9.1)–(9.2), the preceding construction has the following properties for all sufficiently large n n n .
Every splitting designated support is a graph r 0 r_0 r 0 -ball wholly inside A A A . It splits at most one band, and there it meets Y Y Y and exactly one of the two sides. The metric algebras generated by all statuses of distinct bands commute on the symmetric replica space.
Every assigned site of A A A has oriented depth at most j + D + r 0 j+D+r_0 j + D + r 0 on its side. Each actual set U U U or U Y UY U Y is comparable by inclusion with a deterministic positive-depth prefix, and differs from that prefix by at most C n D CnD C n D sites. The cuts of U U U , U Y UY U Y , Y Y Y , P 0 P_0 P 0 , V V V have at most C n D CnD C n D edges. At most C K n D CKnD C K n D terms split in any joint status.
For every labelled term i i i , every round, and every common p p p , the sum of the full terminal-leaf probabilities on which it splits is at most C D / m CD/m C D / m .
An old history is called good if no side has an assigned site of A A A of oriented depth greater than j + D / 2 j+D/2 j + D /2 . For every fixed M > 0 M>0 M > 0 , the probability of a history failing this condition at any time is at most n − M n^{-M} n − M , for sufficiently large n n n . At a charge round on a good old history, each split term is sampled on its splitting side with probability at least c / ( n D ) c/(nD) c / ( n D ) .
All probabilities here are the classical path probabilities of the history tree, before the transport of replica states.
Proof. Deterministic geometry and nesting. A truncated support meeting S 0 S_0 S 0 has radius r 0 r_0 r 0 : when its anchor is at distance d > 2 r 0 d > 2r_0 d > 2 r 0 , the alternative radius ⌊ d / 2 ⌋ \lfloor d/2 \rfloor ⌊ d /2 ⌋ cannot reach S 0 S_0 S 0 . Every splitting support meets a compact part contained in S 0 S_0 S 0 , so this observation applies. If an r 0 r_0 r 0 -ball meeting S 0 S_0 S 0 also contained a site of Λ ∖ A \Lambda\setminus A Λ ∖ A , a graph path inside the ball would contain a cut edge with an endpoint at ambient distance at most L + 2 r 0 L + 2r_0 L + 2 r 0 from T T T . This contradicts (139) .
At a charge the largest newly assigned oriented depth is at most j + D + r 0 j+D+r_0 j + D + r 0 ; subsequent movement of the nominal front only improves this bound. Each side receives at most ⌈ n m / 2 ⌉ \lceil nm/2 \rceil ⌈ nm /2 ⌉ fills, so advances through at most m / 2 + O ( 1 ) m/2 + O(1) m /2 + O ( 1 ) deterministic rows. Its charged lead is D + O ( r 0 ) = o ( m ) D + O(r_0) = o(m) D + O ( r 0 ) = o ( m ) . The two fronts in a window remain separated by order m m m , as do the active regions of successive windows. This proves both that an opposite side cannot have consumed a scheduled slot and that a support cannot split two fronts. All nonblank slots strictly behind a nominal front have been assigned to that side.
A near set contains its completed deterministic prefix and is contained in the prefix ending at its maximal allowed lead. The difference has at most C n D C nD C n D sites. For U Y UY U Y , take the complement of the assigned far suffix within the original shell prefix: it is contained in the deterministic prefix ending at the nominal far front and differs from it only in O ( D ) O(D) O ( D ) rows. These deterministic comparison prefixes are all prefixes of one fixed ordered list of positive-depth slots and are consequently nested, even across histories and bands.
A full depth prefix has O ( n ) O(n) O ( n ) boundary edges. For its outer boundary at positive depth, use the last included row, since depth changes by at most one along an edge. For the boundary at depth zero, use the first positive row. Partial rows cost at most 4 n 4n 4 n more edges. There are no compact-to-opposite-color edges, by the clearance. Changing at most C n D CnD C n D sites then gives the claimed O ( n D ) O(nD) O ( n D ) bound for all status cuts and their differences. Split anchors themselves lie in O ( D ) O(D) O ( D ) rows around the nominal fronts, containing O ( n D ) O(nD) O ( n D ) anchors per band. Summing gives C K n D CKnD C K n D .
For two bands g ′ < g ′ ′ g' < g'' g ′ < g ′′ , the entire near side together with the middle of the first band is contained in the near side of the second band, for every pair of histories. After adjoining C C C , this says P g ′ Y g ′ ⊂ P g ′ ′ P_{g'}Y_{g'} \subset P_{g''} P g ′ Y g ′ ⊂ P g ′′ . Mirror the central function on F g ′ F_{g'} F g ′ to its complement P g ′ Y g ′ P_{g'}Y_{g'} P g ′ Y g ′ , using Lemma 6.1. The resulting functions from the first band commute with those of the second: they are disjoint from its Y , F Y,F Y , F parts and invariant under the joint permutations whose center acts on its P P P part. This proves the asserted cross-band commutation.
Dilution by the initial offsets. For a fixed anchor to split, its oriented depth must lie between j − O ( r 0 ) j - O(r_0) j − O ( r 0 ) and j + D + O ( r 0 ) j + D + O(r_0) j + D + O ( r 0 ) . Both formulas in (140) are affine, with coefficient 1 1 1 or − 1 -1 − 1 , in the initial uniform offset. Thus only O ( D ) O(D) O ( D ) of the m m m offsets can permit this event, and only O ( 1 ) O(1) O ( 1 ) bands can reach the fixed anchor. This proves C D / m CD/m C D / m separately for the old and new leaf distributions, and hence also for their common-p p p mixture. It does not require conditional independence of the split event and the later charge choices.
Charge ancestry and availability. We finally bound the probability that charged sites get too far ahead of a nominal front. This will ensure that every old split lies in the charge list. Suppose a side has an assigned site of A A A leading its nominal front by more than D / 2 D/2 D /2 . Trace the site’s first assignment backwards through the charge ball that assigned it, choosing a previously assigned same-side site in that ball, until an initial or deterministic assignment is reached. An ancestry with j ′ j' j ′ charges changes oriented depth by at most 2 r 0 j ′ 2r_0j' 2 r 0 j ′ . If its first charge is at time t 1 t_1 t 1 and the history is tested at time t t t , then
2 r 0 j ′ > D / 2 + j ( t ) − j ( t 1 ) − O ( 1 ) . 2r_0j' > D/2 + j(t) - j(t_1) - O(1). 2 r 0 j ′ > D /2 + j ( t ) − j ( t 1 ) − O ( 1 ) .
The fixed fill schedule gives j ( t ) − j ( t 1 ) ≥ ( t − t 1 ) / ( 4 n ) − O ( 1 ) j(t)-j(t_1) \ge(t-t_1)/(4n)-O(1) j ( t ) − j ( t 1 ) ≥ ( t − t 1 ) / ( 4 n ) − O ( 1 ) . Substitution in the preceding inequality yields both
j ′ ≥ c D / r 0 , t − t 1 ≤ C n r 0 j ′ . j' \ge cD/r_0,\qquad t-t_1 \le Cnr_0j'. j ′ ≥ cD / r 0 , t − t 1 ≤ C n r 0 j ′ .
Thus all ancestry times lie in this last interval of rounds. All sites in the ancestry are in A A A , including for the far side, because the charging balls are wholly in A A A .
For a fixed endpoint, test time, and length j ′ j' j ′ , the time choices and spatial choices have at most
( C n r 0 j ′ j ′ ) ( C r 0 4 ) j ′ \binom{Cnr_0j'}{j'}(Cr_0^4)^{j'} ( j ′ C n r 0 j ′ ) ( C r 0 4 ) j ′
possibilities. The spatial bound permits both an anchor and a predecessor within O ( r 0 ) O(r_0) O ( r 0 ) graph distance at each step, and includes the bounded anchor multiplicity. Conditional on earlier choices, a prescribed hit has probability at most ( c n D ) − 1 (cnD)^{-1} ( c n D ) − 1 . The bound ( j ′ ) ≤ ( e v / j ′ ) j ′ \binom{j'}{\,} \le(ev/j')^{j'} ( j ′ ) ≤ ( e v / j ′ ) j ′ therefore makes the total probability at most
poly ( n ) ∑ j ′ ≥ c D / r 0 ( C r 0 5 / D ) j ′ . \operatorname{poly}(n)\sum_{j'\ge cD/r_0}(Cr_0^5/D)^{j'}. poly ( n ) j ′ ≥ cD / r 0 ∑ ( C r 0 5 / D ) j ′ .
The endpoints being counted are charged sites in S 0 S_0 S 0 , of which there are O ( n 2 ) O(n^2) O ( n 2 ) ; the numbers of test times and bands are also polynomial in n n n . Thus no far-domain volume enters this factor. Since r 0 r_0 r 0 is polylogarithmic and D = n κ + o ( 1 ) D=n^{\kappa+o(1)} D = n κ + o ( 1 ) , the bound is smaller than every fixed inverse power of n n n .
On a good old history, a split anchor has oriented depth at least j − r 0 j-r_0 j − r 0 , because its ball meets an unassigned site, and at most j + D / 2 + r 0 j+D/2+r_0 j + D /2 + r 0 , because it meets the side. For large n n n this interval lies in the sampling interval [ j − r 0 , j + D ] [j-r_0,j+D] [ j − r 0 , j + D ] . Choosing the relevant side and its labelled slot has probability 1 / ( 2 M n ) ≥ c / ( n D ) 1/(2M_n) \ge c/(nD) 1/ ( 2 M n ) ≥ c / ( n D ) , and the resulting move is exactly the Y Y Y -part of that designated support. □
Selecting a low-energy interpolation
The scan provides the nested prefixes required by the norm comparisons and the two probability estimates required by entropy and energy transport. We now combine them to select one low-energy interpolation. The entropy input below concerns the original ground state; the polynomially accurate truncation transfers it to Ω ~ \widetilde{\Omega} Ω . No gap for a Hamiltonian restricted to the target or its collar is used.
Proposition 9.2 (The scanner estimate). Assume (138) and (139) , and let 0 < e < 1 0<e<1 0 < e < 1 satisfy κ ≤ e \kappa\le e κ ≤ e . Suppose
S Ω ( X ) ≤ C e n 1 + e , S Ω ( Q j ) ≤ C e ( n L e + n ) ( 0 ≤ j ≤ L ) . (141) S_{\Omega}(X)\le C e n^{1+e},\qquad S_{\Omega}(Q_j)\le C e(nL^e+n)\qquad(0\le j\le L). \tag*{(141)} S Ω ( X ) ≤ C e n 1 + e , S Ω ( Q j ) ≤ C e ( n L e + n ) ( 0 ≤ j ≤ L ) . (141)
Let ϵ = n − ν \epsilon=n^{-\nu} ϵ = n − ν , where ν > 0 \nu>0 ν > 0 is fixed, and suppose a r 0 2 ar_0^2 a r 0 2 is sufficiently small. Construct the auxiliary systems, the fixed label sector, and the unnormalized vector pre \operatorname{pre} pre as in Proposition 8.1 8.1 8.1 , using typical width w = n 3 / 5 w=n^{3/5} w = n 3/5 . For each sufficiently large replica count k k k , there are a charge round and a common parameter p k ∈ [ ϵ / 2 , ϵ ] p_k\in[\epsilon/2,\epsilon] p k ∈ [ ϵ /2 , ϵ ] at which the normalized vector v k = M − s pre / N v_k=M^{-s}\operatorname{pre}/N v k = M − s pre / N , s = 1 / 4 s=1/4 s = 1/4 , has defect energy
E d e f , k = ⟨ v k , H ~ v k ⟩ − E ~ 0 g ~ E_{\mathrm{def},k}=\frac{\langle v_k,\widetilde{H}v_k\rangle-\widetilde{E}_0}{\widetilde{g}} E def , k = g ⟨ v k , H v k ⟩ − E 0
bounded by
E d e f , k ≤ C n ℓ D 2 W 2 ( log n ) C ( δ n 1 / 8 + ϵ + n − 100 ) + C n − 1000 + o k ( 1 ) . (142) E_{\mathrm{def},k}\le Cn^\ell D^2W^2(\log n)^C\left(\delta_n^{1/8}+\epsilon+n^{-100}\right)+Cn^{-1000}+o_k(1). \tag*{(142)} E def , k ≤ C n ℓ D 2 W 2 ( log n ) C ( δ n 1/8 + ϵ + n − 100 ) + C n − 1000 + o k ( 1 ) . (142)
where
δ n = C ϵ − 1 ( n ϵ − μ + a 1 / 4 ( log n ) C ) . (143) \delta_n=C\epsilon^{-1}\left(n^{\epsilon-\mu}+a^{1/4}(\log n)^C\right). \tag*{(143)} δ n = C ϵ − 1 ( n ϵ − μ + a 1/4 ( log n ) C ) . (143)
Here H ~ \widetilde{H} H is the mean of the physical Hamiltonian over the copies. All norm comparisons of Proposition 8.1 apply at the selected points, with shell entropy bound B s h ≤ C e ( n L e + n ) B_{\mathrm{sh}} \le C_{\mathrm{e}}(nL^{\mathrm{e}}+n) B sh ≤ C e ( n L e + n ) , mismatch B e x c ≤ C n D B_{\mathrm{exc}} \le CnD B exc ≤ C n D , and marginal parameter B ≤ C n D ( log n ) C B \le CnD(\log n)^{C} B ≤ C n D ( log n ) C . The sharp comparisons additionally require their stated condition on a B a\sqrt{B} a B .
The entire finite physical system, n n n , the scan, and all auxiliary dimensions are fixed before k → ∞ k \to\infty k → ∞ . The remainder is uniform over the selected round and parameter, although these may depend on k k k . Constants may depend on the fixed exponents and the input constant C e C_{\mathrm{e}} C e .
Proof. The transfer from Ω \Omega Ω to Ω ~ \widetilde{\Omega} Ω costs O ( n − 248 ) O(n^{-248}) O ( n − 248 ) in any entropy in (141) : the trace distance is O ( n − 500 ) O(n^{-500}) O ( n − 500 ) , and the compact systems have O ( n 2 ) O(n^{2}) O ( n 2 ) sites, so Lemma 2.1 applies. A partial last depth row adds at most n log q n\log q n log q . Lemma 9.1 then gives the matched-prefix and mismatch bounds required by the comparators. It also gives the O ( n D ) O(nD) O ( n D ) status boundaries. A crossing support has Hilbert dimension at most q C ( 1 + r 0 ) 2 q^{C(1+r_{0})^{2}} q C ( 1 + r 0 ) 2 , and its anchor lies within distance r 0 r_{0} r 0 of a cut edge. Consequently the marginal-tail parameter of Lemma 3.1 is at most C n D ( log n ) C CnD(\log n)^{C} C n D ( log n ) C . At the target itself it is at most C n ( log n ) C Cn(\log n)^{C} C n ( log n ) C . The latter bound shows that the width w = n 3 / 5 w=n^{3/5} w = n 3/5 has failure mass at most n − 100 n^{-100} n − 100 for all sufficiently large n n n . In fact its tail is bounded by C exp [ − c n 1 / 10 / ( log n ) C ] C\exp[-cn^{1/10}/(\log n)^{C}] C exp [ − c n 1/10 / ( log n ) C ] .
At a charge round write h h h for an old joint history, of probability w h w_h w h , and σ h , u \sigma_{h,u} σ h , u for its transported state in Proposition 7.4. Let μ σ \mu_{\sigma} μ σ denote the coherent probability measure of Lemma 6.4. The entropy derivative uses the old-history weights w h w_h w h ; the same transported states occur in the energy estimate with terminal weights ( 1 − p ) w h (1-p)w_h ( 1 − p ) w h . We therefore measure the entropy cost of the old splits by Q ( p ) Q(p) Q ( p ) , defined as
∑ h g o o d w h ∫ R m s ( u ) ∫ ∑ i s p l i t i n h η i , h ( θ ) d μ σ h , u ( θ ) d u . (144) \sum_{h\ \mathrm{good}} w_h \int_{\mathbb{R}} m_s(u)\int\sum_{\substack{i\ \mathrm{split}\\\mathrm{in}\ h}} \eta_{i,h}(\theta)\,d\mu_{\sigma_{h,u}}(\theta)\,du. \tag*{(144)} h good ∑ w h ∫ R m s ( u ) ∫ i split in h ∑ η i , h ( θ ) d μ σ h , u ( θ ) d u . (144)
Each split term in this sum has a unique splitting band, and its partition P , Y , F P,Y,F P , Y , F is understood to be that band’s partition. If term i i i splits on the near side, its moved set is x = Y ∩ X ~ x=Y\cap\widetilde{X} x = Y ∩ X , the unassigned part of its designated r 0 r_{0} r 0 -ball, and η i , h = S θ ( x ∣ P ) + S θ ( x ∣ Y ∖ x ) \eta_{i,h}=S_{\theta}(x\mid P)+S_{\theta}(x\mid Y\setminus x) η i , h = S θ ( x ∣ P ) + S θ ( x ∣ Y ∖ x ) ; on the far side exchange P , F P,F P , F . These quantities are nonnegative. They are also bounded by C ( log n ) C C(\log n)^{C} C ( log n ) C , because the moved sites lie in an r 0 r_{0} r 0 -ball. The measure m s ( u ) d u m_s(u)\,du m s ( u ) d u has fixed finite mass 2 s 2s 2 s .
On every good old history each split term is sampled with probability at least c / ( n D ) c/(nD) c / ( n D ) , and its sampled move has exactly the corresponding η i , h \eta_{i,h} η i , h . Equation (95) therefore gives, at a charge round,
− ∂ p log N 2 ≥ c k α n D Q ( p ) − C k α K a 1 / 4 ( log n ) C − O f i x e d ( log ( k + 2 ) ) . (145) -\partial_p\log N^{2}\ge\frac{ck\alpha}{nD}Q(p)-Ck\alpha K a^{1/4}(\log n)^{C}-O_{\mathrm{fixed}}(\log(k+2)). \tag*{(145)} − ∂ p log N 2 ≥ n D c k α Q ( p ) − C k α K a 1/4 ( log n ) C − O fixed ( log ( k + 2 )) . (145)
At fill rounds retain just the same negative error; the entropy gains are nonnegative. Here and below “fixed” means that the complete single-copy instance and the scanner have been fixed. No such constant survives the replica limit.
Integrate over every full round, including fills. Adjacent endpoint metrics agree by construction, so the left sides telescope. Initially − log N 2 ≥ − O f i x e d ( log ( k + 2 ) ) -\log N^{2}\ge-O_{\mathrm{fixed}}(\log(k+2)) − log N 2 ≥ − O fixed ( log ( k + 2 )) : the floor (66) passes to the initial mean tree by Lemma 7.1, and ∥ p r e ∥ ≤ 1 \lVert\mathrm{pre}\rVert\le1 ∥ pre ∥ ≤ 1 . At the last endpoint the rough upper comparison (113) gives
− k − 1 log N 2 ≤ 2 log d ∗ − log z + C e W ( n L e + n D + n ) + o k ( 1 ) ≤ C e W n 1 + ϵ + o k ( 1 ) . -k^{-1}\log N^{2}\le2\log d_{*}-\log z+C_{\mathrm{e}}W(nL^{\mathrm{e}}+nD+n)+o_k(1)\le C_{\mathrm{e}}Wn^{1+\epsilon}+o_k(1). − k − 1 log N 2 ≤ 2 log d ∗ − log z + C e W ( n L e + n D + n ) + o k ( 1 ) ≤ C e W n 1 + ϵ + o k ( 1 ) .
For the last inequality use κ ≤ ϵ \kappa\le\epsilon κ ≤ ϵ , L ≤ n L\le n L ≤ n , and log d ∗ = S Ω ~ ( X ) + O ( w + ∣ log z ∣ ) \log d_{*}=S_{\widetilde{\Omega}}(X)+O(w+|\log z|) log d ∗ = S Ω ( X ) + O ( w + ∣ log z ∣ ) . Restrict the positive charge integrals in (145) to [ ϵ / 2 , ϵ ] [\epsilon/2,\epsilon] [ ϵ /2 , ϵ ] , but pay the negative errors on all 2 n m 2nm 2 nm full rounds. Since α K = W \alpha K=W α K = W , the integrated inequality, normalized by the number of charge rounds, is
1 n m ∑ c h a r g e r o u n d s ∫ ϵ / 2 ϵ Q ( p ) K n D d p ≤ C e ( n ϵ m + a 1 / 4 ( log n ) C ) + o k ( 1 ) . \frac{1}{nm}\sum_{\mathrm{charge\ rounds}}\int_{\epsilon/2}^{\epsilon}\frac{Q(p)}{K nD}\,dp\le C_{\mathrm{e}}\left(\frac{n^{\epsilon}}{m}+a^{1/4}(\log n)^{C}\right)+o_k(1). nm 1 charge rounds ∑ ∫ ϵ /2 ϵ K n D Q ( p ) d p ≤ C e ( m n ϵ + a 1/4 ( log n ) C ) + o k ( 1 ) .
The interval has length ϵ / 2 \epsilon/2 ϵ /2 , and m ≲ n ℓ m \lesssim n^{\ell} m ≲ n ℓ . Averaging therefore gives a charge round and a p k p_k p k in this interval such that
Q ( p k ) K n D ≤ δ n + o k ( 1 ) . (146) \frac{Q(p_k)}{KnD} \le\delta_n + o_k(1). \tag*{(146)} K n D Q ( p k ) ≤ δ n + o k ( 1 ) . (146)
The fixed factor two in the interval length is absorbed into constants. All integrands are bounded at fixed k k k , and continuous in the interior interpolation parameter, so ordinary averaging suffices for this selection.
Apply the energy estimate (96) at this same point. For each term its split weight is at most C D / m CD/m C D / m . There are at most C K n D CKnD C K n D split term occurrences in each joint leaf. On old good leaves the transported states are exactly those in (144) ; their full terminal weight differs only by the factor 1 − p k ≤ 1 1-p_k \le1 1 − p k ≤ 1 . Hölder’s inequality, applied to the positive measure over histories, terms, u u u , and θ \theta θ , bounds their sum of η 1 / 8 \eta^{1/8} η 1/8 by
C K n D ( δ n + o k ( 1 ) ) 1 / 8 . CKnD\left(\delta_n+o_k(1)\right)^{1/8}. C K n D ( δ n + o k ( 1 ) ) 1/8 .
On bad old histories use the uniform local dimension bound and Lemma 9.1 with an arbitrarily large fixed tail power. On all new leaves use the same dimension bound and their total terminal weight p k ≤ ϵ p_k \le\epsilon p k ≤ ϵ . After increasing the fixed logarithmic power, the energy estimate is therefore
⟨ v k , H ~ v k ⟩ ≤ 2 E ~ 0 + C a 2 D m K n D ( log n ) C ( δ n 1 / 8 + ϵ + n − 100 ) + o k ( 1 ) . \langle v_k,\widetilde H v_k\rangle\le2\widetilde E_0 + Ca^2\frac{D}{m}KnD(\log n)^C\left(\delta_n^{1/8}+\epsilon+n^{-100}\right)+o_k(1). ⟨ v k , H v k ⟩ ≤ 2 E 0 + C a 2 m D K n D ( log n ) C ( δ n 1/8 + ϵ + n − 100 ) + o k ( 1 ) .
The factors in this expression have distinct origins: D / m D/m D / m is the split probability of one fixed term, K n D KnD K n D counts split occurrences, and a 2 a^2 a 2 is the local skew cost. Their product simplifies to
a 2 D m K n D = W 2 n D 2 m K ≤ C W 2 n ℓ D 2 . a^2\frac{D}{m}KnD=\frac{W^2nD^2}{mK}\le CW^2n^{\ell}D^2. a 2 m D K n D = m K W 2 n D 2 ≤ C W 2 n ℓ D 2 .
Subtracting E ~ 0 \widetilde E_0 E 0 and dividing by g ~ ≥ g / 2 \widetilde g \ge g/2 g ≥ g /2 proves (142) .
Only splitting terms contribute to this energy error; all others have zero skew exactly. Thus its coefficient contains no total-volume factor. The symbol remainders can be summed over all terms before taking k → ∞ k \to\infty k → ∞ , because that complete term set is finite and fixed. Their uniformity in replica states and in the interpolation parameter also justifies the possibly k k k -dependent selection in (146) . □
We now supply the scanner’s geometric and entropy inputs for unions of rectangles and triangles. These include the geometric targets of the final tiling, whose number of pieces may grow with the scale. The constant D 0 D_0 D 0 and the function F b o x F_{\mathrm{box}} F box are those of Proposition 3.3. Fix the numerical constant C t p l C_{\mathrm{tpl}} C tpl large enough to absorb the layer-count constant in the proof below. The entropy bounds will be reused each time the safe-box exponent improves.
Definition 9.3 (A template). Let s 0 ≥ 1 s_0 \ge1 s 0 ≥ 1 and n n n be positive integers. A template with parameters ( n , s 0 ) (n,s_0) ( n , s 0 ) is a nonempty finite set T ⊂ Z 2 T \subset\mathbb{Z}^2 T ⊂ Z 2 of the form
T = ⋃ a = 1 N 0 ( P a ∩ Z 2 ) , n ≥ C t p l N 0 ( s 0 + 1 ) , diam ∞ T ≤ n , T=\bigcup_{a=1}^{N_0}(P_a\cap\mathbb{Z}^2),\qquad n\ge C_{\mathrm{tpl}}N_0(s_0+1),\qquad\operatorname{diam}_{\infty}T\le n, T = a = 1 ⋃ N 0 ( P a ∩ Z 2 ) , n ≥ C tpl N 0 ( s 0 + 1 ) , diam ∞ T ≤ n ,
where N 0 ≥ 1 N_0\ge1 N 0 ≥ 1 is an integer and each P a P_a P a is a closed convex rectangle or triangle of sup-norm diameter at most s 0 s_0 s 0 , all of whose sides have slope 0 0 0 , ∞ \infty ∞ , 1 1 1 , or − 1 -1 − 1 . Empty sampled pieces can be omitted. For the fixed cut A A A , the template is separated from the cut if
dist ∞ ( T , Z ) > 4 D 0 s 0 . \operatorname{dist}_{\infty}(T,\mathbb{Z})>4D_0s_0. dist ∞ ( T , Z ) > 4 D 0 s 0 .
As above, T j T_j T j is the ambient integer dilation, X = A ∩ T X = A \cap T X = A ∩ T , and Q j = A ∩ ( T j ∖ T ) Q_j = A \cap(T_j \setminus T) Q j = A ∩ ( T j ∖ T ) , for j ≥ 0 j \ge0 j ≥ 0 .
The diameter condition merely fixes a convenient common size parameter. The estimates below use the number and sizes of the pieces, rather than convexity of their union. They therefore allow the disconnected fragments which occur in the later tiling.
Lemma 9.4 (Rows, coverings, and shell entropy). For C t p l C_{\mathrm{tpl}} C tpl sufficiently large, a template satisfies
∣ T ∣ ≤ C n s 0 , ∣ T j ∖ T j − 1 ∣ ≤ n ( 1 ≤ j ≤ s 0 ) , ∣ ∂ Z 2 T j ∣ ≤ C n ( 0 ≤ j ≤ s 0 ) . (147) |T| \le Cns_0,\qquad|T_j \setminus T_{j-1}| \le n\quad(1 \le j \le s_0),\qquad|\partial_{\mathbb{Z}^2} T_j| \le Cn\quad(0 \le j \le s_0). \tag*{(147)} ∣ T ∣ ≤ C n s 0 , ∣ T j ∖ T j − 1 ∣ ≤ n ( 1 ≤ j ≤ s 0 ) , ∣ ∂ Z 2 T j ∣ ≤ C n ( 0 ≤ j ≤ s 0 ) . (147)
Suppose it is separated from the cut and, for some 0 < ϵ < 1 0 < \epsilon< 1 0 < ϵ < 1 , F b o x ( r ) ≤ C ϵ r 1 + ϵ F_{\mathrm{box}}(r) \le C\epsilon r^{1+\epsilon} F box ( r ) ≤ C ϵ r 1 + ϵ for every integer r ≥ 1 r \ge1 r ≥ 1 . Then, for every integer 1 ≤ L ≤ s 0 1 \le L \le s_0 1 ≤ L ≤ s 0 ,
S Ω ( X ) ≤ C ′ ϵ n s 0 ϵ , S Ω ( Q j ) ≤ C ′ ϵ n L ϵ ( 0 ≤ j ≤ L ) . (148) S_{\Omega}(X) \le C' \epsilon n s_0^{\epsilon},\qquad S_{\Omega}(Q_j) \le C' \epsilon n L^{\epsilon}\quad(0 \le j \le L). \tag*{(148)} S Ω ( X ) ≤ C ′ ϵ n s 0 ϵ , S Ω ( Q j ) ≤ C ′ ϵ n L ϵ ( 0 ≤ j ≤ L ) . (148)
The same shell bound, with an additional C n Cn C n , holds for any prefix obtained by including all depth rows before one row and an arbitrary subset of that last row. All physical cuts of X X X , Q j Q_j Q j , and A ∩ T j A \cap T_j A ∩ T j have O ( n ) O(n) O ( n ) edges.
Proof. Consider first one sampled piece. On an integer horizontal row its sites form an integer interval. Its left endpoint is a maximum of affine integer-valued functions with slopes in { − 1 , 0 , 1 } \{-1,0,1\} { − 1 , 0 , 1 } , and its right endpoint is a minimum of such functions; horizontal sides impose an interval constraint on the row index. To obtain these formulas, round the intercepts of the defining line inequalities. Because the slopes are integers, this rounding is independent of the integer row index. The difference of the lower and upper bounds is convex, so the nonempty rows are consecutive. On consecutive nonempty rows each endpoint moves by at most one. Consecutive row intervals overlap or are adjacent as integer intervals.
After integer sup-norm dilation by j j j , the interval on a row is the union of the original intervals in the window of rows at distance at most j j j , each extended by j j j on both ends. This union is still an integer interval. Its endpoints are the sliding minimum and maximum of the old endpoints, minus or plus j j j . They again move by at most one between consecutive nonempty rows: the nonempty index windows at two consecutive rows have Hausdorff distance at most one, and the old endpoint functions are 1-Lipschitz. One more dilation changes each endpoint on an old row by at most two and adds at most two rows, each of length O ( s 0 + j + 1 ) O(s_0+j+1) O ( s 0 + j + 1 ) . This proves a bound C ( s 0 + j + 1 ) C(s_0+j+1) C ( s 0 + j + 1 ) for both the new layer and the edge boundary of one piece. Summing over the pieces proves (147) , with the layer constant absorbed in C t p l C_{\mathrm{tpl}} C tpl . The area bound follows from ∣ P a ∩ Z 2 ∣ ≤ C ( s 0 + 1 ) 2 |P_a \cap\mathbb{Z}^2| \le C(s_0+1)^2 ∣ P a ∩ Z 2 ∣ ≤ C ( s 0 + 1 ) 2 .
We also need a count at intermediate dyadic scales. In the usual dyadic partition of the lattice into integer squares, the number of side-u u u squares containing both a site of a dilated piece and a site outside it is
O ( ( s 0 + j + 1 ) / u + 1 ) , u ≥ 1. O\bigl((s_0+j+1)/u+1\bigr),\qquad u \ge1. O ( ( s 0 + j + 1 ) / u + 1 ) , u ≥ 1.
Indeed, in a block of u u u consecutive nonempty rows the two endpoints vary by at most u u u . Only constantly many square columns near each endpoint can be mixed. At the first and last blocks count instead the whole width, which costs O ( ( s 0 + j + 1 ) / u + 1 ) O((s_0+j+1)/u+1) O (( s 0 + j + 1 ) / u + 1 ) in total. A square mixed for a union, or for a difference of two unions, must be mixed for at least one of the constituent sets. Thus the corresponding count for T T T , T j T_j T j , or T j ∖ T T_j \setminus T T j ∖ T , with j ≤ s 0 j \le s_0 j ≤ s 0 , is at most C ( N 0 + n / u ) C(N_0+n/u) C ( N 0 + n / u ) .
Cover T j ∖ T T_j \setminus T T j ∖ T by maximal contained dyadic squares, with side capped at the largest power of two not exceeding L L L . These squares partition the set: a single site is an admissible square, and the dyadic nesting makes distinct maximal squares disjoint. At the cap there are at most C n / L Cn/L C n / L squares because ∣ T j ∖ T ∣ ≤ n j ≤ n L |T_j \setminus T| \le nj \le nL ∣ T j ∖ T ∣ ≤ nj ≤ n L . Below the cap, the parent of each maximal square is mixed. Equation (9.12) therefore bounds the number of squares of side u u u by C ( N 0 + n / u ) ≤ C n / u C(N_0+n/u)\le Cn/u C ( N 0 + n / u ) ≤ C n / u , since u ≤ L ≤ s 0 u\le L\le s_0 u ≤ L ≤ s 0 and N 0 s 0 ≤ n N_0s_0\le n N 0 s 0 ≤ n . All these squares are safe: their sites lie in T j T_j T j , their sides are at most s 0 s_0 s 0 , and
dist ∞ ( T j , Z ) ≥ dist ∞ ( T , Z ) − j > 4 D 0 s 0 − s 0 > D 0 s 0 . \operatorname{dist}_{\infty}(T_j,Z)\ge\operatorname{dist}_{\infty}(T,Z)-j>4D_0s_0-s_0>D_0s_0. dist ∞ ( T j , Z ) ≥ dist ∞ ( T , Z ) − j > 4 D 0 s 0 − s 0 > D 0 s 0 .
Subadditivity and the assumed box bound now give
S Ω ( Q j ) ≤ C ε n ∑ u ≤ L u d y a d i c u ε ≤ C ε ′ n L ε . S_{\Omega}(Q_j)\le C_{\varepsilon}n\sum_{\substack{u\le L\\u\ \mathrm{dyadic}}}u^{\varepsilon}\le C'_{\varepsilon}nL^{\varepsilon}. S Ω ( Q j ) ≤ C ε n u ≤ L u dyadic ∑ u ε ≤ C ε ′ n L ε .
Covering T T T in the same way, with cap comparable to s 0 s_0 s 0 , uses O ( n / s 0 ) O(n/s_0) O ( n / s 0 ) squares at the cap and O ( n / u ) O(n/u) O ( n / u ) below it, and gives the first bound in (148) .
Adding an arbitrary part of one depth row changes entropy by at most n log q n\log q n log q . Finally, near these sets there is no edge joining A A A to its complement: such an edge would have an endpoint in Z Z Z within distance s 0 + 1 s_0+1 s 0 + 1 of T T T . Thus their physical boundaries are bounded by the ambient template and shell boundaries just counted. This argument does not count missing lattice edges as physical boundary edges.
A small safe-box exponent
We use the scanner first with a bounded total metric weight. The rough comparison is sufficient here, even when a B \sqrt{B} B is large. This separates the bootstrap from the sharper concentration condition needed only in the final application.
Proposition 9.5 (Improved safe-box estimate). There is a constant C C C , depending only on the Hamiltonian parameters, such that
F b o x ( r ) ≤ C r 1 + ε ∗ ( r ≥ 1 ) , ε ∗ = 2 ⋅ 10 − 6 . F_{\mathrm{box}}(r)\le Cr^{1+\varepsilon_*}\qquad(r\ge1),\qquad\varepsilon_*=2\cdot10^{-6}. F box ( r ) ≤ C r 1 + ε ∗ ( r ≥ 1 ) , ε ∗ = 2 ⋅ 1 0 − 6 .
Proof. Let ε 0 ∈ ( 0 , 1 ) \varepsilon_0\in(0,1) ε 0 ∈ ( 0 , 1 ) be supplied by Proposition 3.3. If ε 0 ≤ ε ∗ \varepsilon_0\le\varepsilon_* ε 0 ≤ ε ∗ , the assertion already follows. Otherwise fix, once for the entire bootstrap,
g 0 = ( 1 − ε 0 ) / 2 , μ = 1 − g 0 , ν = g 0 / 1000 , ℓ = ν / 100 , κ = min ( ν / 100 , ε ∗ / 4 ) , W = 4. (149) g_0=(1-\varepsilon_0)/2,\qquad\mu=1-g_0,\qquad\nu=g_0/1000,\qquad\ell=\nu/100,\qquad\kappa=\min(\nu/100,\varepsilon_*/4),\qquad W=4. \tag*{(149)} g 0 = ( 1 − ε 0 ) /2 , μ = 1 − g 0 , ν = g 0 /1000 , ℓ = ν /100 , κ = min ( ν /100 , ε ∗ /4 ) , W = 4. (149)
These parameters will not change when the current entropy exponent improves.
Suppose F b o x ( r ) ≤ C r 1 + ε F_{\mathrm{box}}(r)\le Cr^{1+\varepsilon} F box ( r ) ≤ C r 1 + ε , where ε ∗ < ε ≤ ε 0 \varepsilon_*<\varepsilon\le\varepsilon_0 ε ∗ < ε ≤ ε 0 . Take any safe integer rectangle T T T of actual maximal side length s 0 s_0 s 0 , and set n = ⌈ C 2 s 0 ⌉ n=\lceil C_2s_0\rceil n = ⌈ C 2 s 0 ⌉ for a sufficiently large fixed C 2 C_2 C 2 . If A ∩ T A\cap T A ∩ T is empty, its entropy is zero, so assume otherwise. For large s 0 s_0 s 0 , L = o ( s 0 ) L=o(s_0) L = o ( s 0 ) , so (139) holds. In particular the weaker safe-box clearance D 0 s 0 D_0s_0 D 0 s 0 , rather than the stronger template clearance of Definition 9.3, is enough for this application.
Here is the shell entropy input explicitly. The shell T j ∖ T T_j\setminus T T j ∖ T , j ≤ L j\le L j ≤ L , has area O ( n L ) O(nL) O ( n L ) and consists of a bounded number of rectangular strips. Its mixed dyadic squares of side u u u number O ( n / u + 1 ) O(n/u+1) O ( n / u + 1 ) , by the boundary-line count. The maximal-contained-square argument of Lemma 9.4, capped at side comparable to L L L , therefore gives S Ω ( Q j ) ≤ C ε n L ε S_{\Omega}(Q_j)\le C_{\varepsilon}nL^{\varepsilon} S Ω ( Q j ) ≤ C ε n L ε . These covering squares are safe: their sides are at most L L L , and their distance from Z Z Z is at least D 0 s 0 − L > D 0 L D_0s_0-L>D_0L D 0 s 0 − L > D 0 L once s 0 s_0 s 0 is large. This also covers thin rectangles. The target entropy is at most C ε s 0 1 + ε C_{\varepsilon}s_0^{1+\varepsilon} C ε s 0 1 + ε . Adding a partial row costs O ( n ) O(n) O ( n ) , so all the hypotheses of Proposition 9.2 hold.
We check its quantitative output. Since K ≲ n g 0 − ℓ K\lesssim n^{g_0-\ell} K ≲ n g 0 − ℓ , a ≲ n − g 0 + ℓ a\lesssim n^{-g_0+\ell} a ≲ n − g 0 + ℓ . In (143) the two powers before logarithms are at most
ε 0 − μ + ν = − 0.999 g 0 , − ( g 0 − ℓ ) / 4 + ν = − 0.2489975 g 0 . \varepsilon_0-\mu+\nu=-0.999g_0,\qquad-(g_0-\ell)/4+\nu=-0.2489975g_0. ε 0 − μ + ν = − 0.999 g 0 , − ( g 0 − ℓ ) /4 + ν = − 0.2489975 g 0 .
Thus δ n ≤ n − 0.24 g 0 \delta_n \le n^{-0.24g_0} δ n ≤ n − 0.24 g 0 for sufficiently large n n n , after constants and fixed logarithmic powers have been absorbed. The energy prefactor has power ℓ + 2 κ ≤ 0.00003 g 0 \ell+ 2\kappa\le0.00003g_0 ℓ + 2 κ ≤ 0.00003 g 0 . Its slower decaying input is ϵ = n − 0.001 g 0 \epsilon= n^{-0.001g_0} ϵ = n − 0.001 g 0 , rather than δ n 1 / 8 ≤ n − 0.03 g 0 \delta_n^{1/8} \le n^{-0.03g_0} δ n 1/8 ≤ n − 0.03 g 0 . Hence
E d e f , k ≤ C n − ν / 2 + o k ( 1 ) . (150) E_{\mathrm{def},k} \le C n^{-\nu/2} + o_k(1). \tag*{(150)} E def , k ≤ C n − ν /2 + o k ( 1 ) . (150)
All scale conditions and the smallness of a r 0 2 a r_0^2 a r 0 2 hold at large n n n . No sharp marginal-moment condition has been used.
Put τ = n − ν / 4 \tau= n^{-\nu/4} τ = n − ν /4 . Apply the rough upper and lower comparisons (113) and (114) at the selected interpolation. Write S X = S Ω ~ ( X ) S_X = S_{\widetilde{\Omega}}(X) S X = S Ω ( X ) . The upper pin cost has leading coefficient 2 S X 2S_X 2 S X ; the lower coefficient is 4 s W S X = 4 S X 4s_W S_X = 4S_X 4 s W S X = 4 S X . Replacing log d ∗ \log d_* log d ∗ and S ′ S' S ′ by S X S_X S X costs O ( w + ∣ log z ∣ ) O(w + |\log z|) O ( w + ∣ log z ∣ ) . The remaining relative loss in this coefficient is at most C ( τ + E d e f , k / τ ) C(\tau+ E_{\mathrm{def},k}/\tau) C ( τ + E def , k / τ ) , which is small after taking k → ∞ k \to\infty k → ∞ and then n n n sufficiently large. The two comparisons consequently imply
S X ≤ C e ( n L e + n D + w + h ( τ ) / a + 1 ) . S_X \le C_e(nL^e + nD + w + h(\tau)/a + 1). S X ≤ C e ( n L e + n D + w + h ( τ ) / a + 1 ) .
To justify the order of limits in this absorption, keep n n n fixed in both norm comparisons and use (150) . The resulting scalar inequality has the same S X S_X S X for every k k k ; all other remainders are uniform at the selected points and vanish. Only then choose the large-scale threshold making the coefficient loss smaller than the fixed margin between four and two.
For 0 < τ < 1 / 2 0 < \tau< 1/2 0 < τ < 1/2 , h ( τ ) ≤ C τ log ( e / τ ) h(\tau) \le C\tau\log(e/\tau) h ( τ ) ≤ C τ log ( e / τ ) . Therefore
h ( τ ) / a ≤ C n g 0 − ℓ − ν / 4 log n = O ( n ) , h(\tau)/a \le Cn^{g_0-\ell-\nu/4}\log n = O(n), h ( τ ) / a ≤ C n g 0 − ℓ − ν /4 log n = O ( n ) ,
because g 0 < 1 / 2 g_0 < 1/2 g 0 < 1/2 . Also w = n 3 / 5 ≤ n w = n^{3/5} \le n w = n 3/5 ≤ n , and κ ≤ e ∗ / 4 < ( 1 − ℓ ) e \kappa\le e_*/4 < (1-\ell)e κ ≤ e ∗ /4 < ( 1 − ℓ ) e while e > e ∗ e > e_* e > e ∗ . Equation (9.15) , followed by the negligible transfer back to Ω \Omega Ω , gives
S Ω ( A ∩ T ) ≤ C e ′ n 1 + ( 1 − ℓ ) e ≤ C e ′ ′ s 0 1 + ( 1 − ℓ ) e . S_\Omega(A \cap T) \le C'_e n^{1+(1-\ell)e} \le C''_e s_0^{1+(1-\ell)e}. S Ω ( A ∩ T ) ≤ C e ′ n 1 + ( 1 − ℓ ) e ≤ C e ′′ s 0 1 + ( 1 − ℓ ) e .
Bounded s 0 s_0 s 0 are included by increasing the constant, using the volume bound. Taking the supremum over safe boxes thus replaces the current exponent e e e by ( 1 − ℓ ) e (1-\ell)e ( 1 − ℓ ) e .
Starting from e 0 e_0 e 0 , finitely many repetitions reach an exponent at most e ∗ e_* e ∗ , which can be loosened to e ∗ e_* e ∗ . Every iteration uses only the current safe-box estimate on the shell covering squares. The parameters in (149) , and the finite number of iterations, depend only on the fixed Hamiltonian parameters. Thus the final constant is uniform over the domain and cut. □
After the bootstrap we allow the total metric weight to grow slowly. The exact norm comparison then charges the remaining target pin cost by the reciprocal of that weight. This is the point at which the entropy identity in Proposition 8.1 gives a bound independent of the selected history.
Proposition 9.6 (A sublinear collar bound). Let T T T be a template separated from the cut, with parameters ( n , s 0 ) (n,s_0) ( n , s 0 ) as in Definition 9.3. Set
L = ⌈ n 1 − 10 − 5 ⌉ , X = A ∩ T , S 0 = A ∩ T L , L = \lceil n^{1-10^{-5}} \rceil,\qquad X = A \cap T,\qquad S_0 = A \cap T_L, L = ⌈ n 1 − 1 0 − 5 ⌉ , X = A ∩ T , S 0 = A ∩ T L ,
and suppose L ≤ s 0 L \le s_0 L ≤ s 0 . For all sufficiently large n n n ,
I Ω ( X : A ∖ S 0 ) ≤ C n 1 − ε , ε = 10 − 5 . (151) I_\Omega(X : A \setminus S_0) \le C n^{1-\varepsilon},\qquad\varepsilon= 10^{-5}. \tag*{(151)} I Ω ( X : A ∖ S 0 ) ≤ C n 1 − ε , ε = 1 0 − 5 . (151)
The constant and threshold are independent of T T T , s 0 s_0 s 0 , n n n , Λ \Lambda Λ , and A A A . The cuts of X X X , S 0 S_0 S 0 , and S 0 ∖ X S_0 \setminus X S 0 ∖ X have O ( n ) O(n) O ( n ) edges, and ∣ S 0 ∣ = O ( n 2 ) |S_0| = O(n^2) ∣ S 0 ∣ = O ( n 2 ) . Proof. If X X X is empty there is nothing to prove. Otherwise Proposition 9.5 and Lemma 9.4 supply (141) with e = e ∗ = 2 ⋅ 10 − 6 e=e_* = 2\cdot10^{-6} e = e ∗ = 2 ⋅ 1 0 − 6 . Since s 0 ≤ n s_0\le n s 0 ≤ n , the core entropy is at most C n 1 + e Cn^{1+e} C n 1 + e . The template clearance and L ≤ s 0 L\le s_0 L ≤ s 0 imply (139) at large n n n ; the logarithmic truncation radius is negligible compared with L L L .
Use the following fixed parameter choices:
μ = 1 4 , ν = 1 1000 , ℓ = 1 100000 , ω = 1 20000 , κ = 1 1000000 , W = n ω . (152) \mu=\frac{1}{4},\quad\nu=\frac{1}{1000},\quad\ell=\frac{1}{100000},\quad\omega=\frac{1}{20000},\quad\kappa=\frac{1}{1000000},\quad W=n^\omega. \tag*{(152)} μ = 4 1 , ν = 1000 1 , ℓ = 100000 1 , ω = 20000 1 , κ = 1000000 1 , W = n ω . (152)
Then a ≍ n − 0.74994 a\asymp n^{-0.74994} a ≍ n − 0.74994 . The two terms in (143) have powers − 0.248998 -0.248998 − 0.248998 and − 0.186485 -0.186485 − 0.186485 , before the fixed logarithmic factors. Hence δ n ≤ n − 0.18 \delta_n\le n^{-0.18} δ n ≤ n − 0.18 at sufficiently large scales. The power of the energy prefactor is
ℓ + 2 κ + 2 ω = 0.000112. \ell+2\kappa+2\omega=0.000112. ℓ + 2 κ + 2 ω = 0.000112.
The ϵ = n − 0.001 \epsilon=n^{-0.001} ϵ = n − 0.001 term is again the limiting one, and Proposition 9.2 gives
E d e f , k ≤ C n − 0.0005 + o k ( 1 ) . (153) E_{\mathrm{def},k}\le Cn^{-0.0005}+o_k(1). \tag*{(153)} E def , k ≤ C n − 0.0005 + o k ( 1 ) . (153)
Set τ = n − 0.00025 \tau=n^{-0.00025} τ = n − 0.00025 . All fixed multiples of a a a lie in the marginal-moment interval required for the sharp comparisons, since
a B ≤ C n − 0.2499395 ( log n ) C ⟶ 0. a\sqrt{B}\le Cn^{-0.2499395}(\log n)^C\longrightarrow0. a B ≤ C n − 0.2499395 ( log n ) C ⟶ 0.
At each leaf write, as before, the physical partition as X , U , Y , V X,U,Y,V X , U , Y , V . All entropies in the next calculation refer to Ω ~ \widetilde{\Omega} Ω . Let
g p r e = S ( X U ) + S ( V ) − S ( Y ) , g p o s t = S ( U ) + S ( U Y ) − S ( Y ) . g_{\mathrm{pre}}=S(XU)+S(V)-S(Y),\qquad g_{\mathrm{post}}=S(U)+S(UY)-S(Y). g pre = S ( X U ) + S ( V ) − S ( Y ) , g post = S ( U ) + S ( U Y ) − S ( Y ) .
These are the quantities in the sharp norm comparisons. Their upper bounds are uniform in the status. In particular S ( X U ) ≤ S ( X ) + S ( U ) ≤ C n 1 + e S(XU)\le S(X)+S(U)\le Cn^{1+e} S ( X U ) ≤ S ( X ) + S ( U ) ≤ C n 1 + e , and by purity S ( V ) = S ( X U Y ) ≤ S ( X ) + S ( U Y ) ≤ C n 1 + e S(V)=S(XUY)\le S(X)+S(UY)\le Cn^{1+e} S ( V ) = S ( X U Y ) ≤ S ( X ) + S ( U Y ) ≤ C n 1 + e . Here the matched-prefix error C n D Cn^D C n D is absorbed because κ < e \kappa<e κ < e . Thus 0 ≤ g p r e ≤ C n 1 + e 0\le g_{\mathrm{pre}}\le Cn^{1+e} 0 ≤ g pre ≤ C n 1 + e .
Denote the full terminal path and uniform band average by ⟨ ⋅ ⟩ l e a f \langle\cdot\rangle_{\mathrm{leaf}} ⟨ ⋅ ⟩ leaf . Subtracting (115) from (116) , and then dividing by 2 s W 2sW 2 s W , bounds 2 S ( X ) + ⟨ g p r e − g p o s t ⟩ l e a f 2S(X)+\langle g_{\mathrm{pre}}-g_{\mathrm{post}}\rangle_{\mathrm{leaf}} 2 S ( X ) + ⟨ g pre − g post ⟩ leaf by a constant times
S ( X ) + 1 W + w + ( τ + E d e f , k τ ) n 1 + e + h ( τ ) a + a B + ∣ log z ∣ a + o k ( 1 ) . (154) \frac{S(X)+1}{W}+w+\left(\tau+\frac{E_{\mathrm{def},k}}{\tau}\right)n^{1+e}+\frac{h(\tau)}{a}+aB+\frac{|\log z|}{a}+o_k(1). \tag*{(154)} W S ( X ) + 1 + w + ( τ + τ E def , k ) n 1 + e + a h ( τ ) + a B + a ∣ log z ∣ + o k ( 1 ) . (154)
This calculation uses S ′ = S ( X ) + O ( w + ∣ log z ∣ ) S'=S(X)+O(w+|\log z|) S ′ = S ( X ) + O ( w + ∣ log z ∣ ) and the analogous estimate for log d ∗ \log d_* log d ∗ . It also restores the lost τ ⟨ g p r e ⟩ l e a f \tau\langle g_{\mathrm{pre}}\rangle_{\mathrm{leaf}} τ ⟨ g pre ⟩ leaf from the lower comparison using the preceding uniform bound.
For each leaf separately, purity gives the exact identity
2 S ( X ) + g p r e − g p o s t = I ( X : V ) + I ( X : Y V ) . (155) 2S(X)+g_{\mathrm{pre}}-g_{\mathrm{post}}=I(X:V)+I(X: YV). \tag*{(155)} 2 S ( X ) + g pre − g post = I ( X : V ) + I ( X : Y V ) . (155)
Both V V V and Y V YV Y V contain the fixed subsystem Λ ∖ S 0 \Lambda\setminus S_0 Λ ∖ S 0 . Monotonicity of mutual information therefore makes the left side of (155) at least I Ω ~ ( X : Λ ∖ S 0 ) I_{\widetilde{\Omega}}(X:\Lambda\setminus S_0) I Ω ( X : Λ ∖ S 0 ) , independently of the history. This remains true after the leaf average, even though the selected round and its weights can vary with k k k .
For completeness, after k → ∞ k\to\infty k → ∞ the terms in (154) have the following upper bounds on their powers of n n n , apart from fixed logarithms.
Table 1.
All are strictly below 1 − ε = 0.99999 1-\varepsilon=0.99999 1 − ε = 0.99999 . Equation (153) controls the mass-loss term uniformly before the limit. This proves I ~ Ω ( X : Λ ∖ S 0 ) ≤ C n 1 − ε \widetilde{I}_{\Omega}(X:\Lambda\setminus S_0)\leq Cn^{1-\varepsilon} I Ω ( X : Λ ∖ S 0 ) ≤ C n 1 − ε .
Finally write mutual information as S ( X ) − S ( X ∣ Λ ∖ S 0 ) S(X)-S(X\mid\Lambda\setminus S_0) S ( X ) − S ( X ∣ Λ ∖ S 0 ) and use Lemma 2.1. Only log dim H X = O ( n 2 ) \log\dim\mathcal{H}_X=O(n^2) log dim H X = O ( n 2 ) enters, even if the far subsystem is very large. The trace distance O ( n − 500 ) O(n^{-500}) O ( n − 500 ) between the original and truncated ground states therefore changes this mutual information by O ( n − 248 ) O(n^{-248}) O ( n − 248 ) . This proves (151) . The final size and boundary assertions were established in Lemma 9.4.
The replica construction has now been eliminated: the conclusion of Proposition 9.6 is an inequality for the original finite ground state. The next section applies the exact positive quasi-local system to that state. In particular, the exponentially large auxiliary operator used there never multiplies a truncation or a replica error from the present argument.
Amplifying the collar estimate
Proposition 9.6 gives a sublinear bound on the mutual information between a target and the region beyond its collar. We now make this mutual information smaller than any fixed inverse power of the scale, at the cost of a slightly wider collar. Typical spectral subspaces first give a candidate restoring operator whose norm is controlled by the collar mutual information. Positive constraints suppress its excited component, yielding accurate restoration after localization. A polar decomposition then replaces this operator by a local unitary. An untouched reference copy records the target’s correlations with the remote system and witnesses their decoupling.
Throughout this section fix
ε = 10 − 5 , β = 1 − 2 ⋅ 10 − 6 , α = p p + 1 > 1 − 10 − 6 . (156) \varepsilon=10^{-5},\qquad\beta=1-2\cdot10^{-6},\qquad\alpha=\frac{p}{p+1}>1-10^{-6}. \tag*{(156)} ε = 1 0 − 5 , β = 1 − 2 ⋅ 1 0 − 6 , α = p + 1 p > 1 − 1 0 − 6 . (156)
where the integer p p p is fixed. Apply Proposition 4.3 with this value of p p p . Thus, in this section, H F = ∑ i k i H_F=\sum_i k_i H F = ∑ i k i is a fresh exact positive system with
0 ≤ k i ≤ I , k i Ω = 0 , H F ≥ g ( I − P Ω ) , P Ω = ∣ Ω ⟩ ⟨ Ω ∣ , (157) 0\leq k_i\leq I,\qquad k_i\Omega=0,\qquad H_F\geq g(I-P_\Omega),\qquad P_\Omega=\lvert\Omega\rangle\langle\Omega\rvert, \tag*{(157)} 0 ≤ k i ≤ I , k i Ω = 0 , H F ≥ g ( I − P Ω ) , P Ω = ∣ Ω ⟩ ⟨ Ω ∣ , (157)
and g > 0 g>0 g > 0 is independent of the finite domain. The scanner’s truncated Hamiltonian is no longer used. All neighborhoods below are neighborhoods in the induced graph: for S ⊆ Λ S\subseteq\Lambda S ⊆ Λ we write N r ( S ) = { y ∈ Λ : d Λ ( y , S ) ≤ r } = N r Λ ( S ) N_r(S)=\{y\in\Lambda:d_\Lambda(y,S)\leq r\}=N_r^\Lambda(S) N r ( S ) = { y ∈ Λ : d Λ ( y , S ) ≤ r } = N r Λ ( S ) .
Localizing products of positive constraints
The following estimate supplies the localization needed later. It is stated for a general operator, which may act on additional finite systems. These additional systems are spectators in the dynamics. The spatial truncation argument has the propagation structure of dissipative Lieb–Robinson estimates [9 ] , Theorems 1 and 2. We prove it here on coupled clock realizations, since the needed bound is an expectation of a norm.
Lemma 10.1 (Local constraint products). Let positive contractions k i k_i k i , anchored at a i ∈ Λ a_i\in\Lambda a i ∈ Λ with bounded multiplicity, satisfy
∥ k i − E i , l k i ∥ ≤ C e − l α ( l ≥ 0 ) . \lVert k_i-E_{i,l}k_i\rVert\leq Ce^{-l\alpha}\qquad(l\geq0). ∥ k i − E i , l k i ∥ ≤ C e − l α ( l ≥ 0 ) .
where E i , l E_{i,l} E i , l is conditional expectation onto N l ( a i ) N_l(a_i) N l ( a i ) . Set G i = ( I − k i ) 1 / 2 G_i=(I-k_i)^{1/2} G i = ( I − k i ) 1/2 and K i = k i 1 / 2 K_i=k_i^{1/2} K i = k i 1/2 . Fix t ≥ 0 t\geq0 t ≥ 0 and an integer r ≥ 1 r\geq1 r ≥ 1 . At each anchor label run an independent rate-one Poisson clock on [ 0 , t ] [0,t] [ 0 , t ] . In @ Bibliography keys occurrence order, with later factors on the left, let D D D be the product of all G i G_i G i , and let D r e t D_{\mathrm{ret}} D ret retain only events with d Λ ( a i , S ) ≤ r d_{\Lambda}(a_i,S) \le r d Λ ( a i , S ) ≤ r , for a nonempty set S ⊆ Λ S \subseteq\Lambda S ⊆ Λ . Let L L L be the same retained product with each G i G_i G i replaced by G i , r = ( I − E i , r k i ) 1 / 2 G_{i,r} = (I-E_{i,r}k_i)^{1/2} G i , r = ( I − E i , r k i ) 1/2 .
There are uniform constants C , c , v > 0 C,c,v>0 C , c , v > 0 such that
E ∥ D r e t − L ∥ ≤ C t ∣ S ∣ ( 1 + r ) 2 e − c r α . (158) \mathbb{E}\lVert D_{\mathrm{ret}}-L\rVert\le Ct|S|(1+r)^2e^{-cr^\alpha}. \tag*{(158)} E ∥ D ret − L ∥ ≤ C t ∣ S ∣ ( 1 + r ) 2 e − c r α . (158)
In particular L L L is a contraction supported on N 2 r ( S ) N_{2r}(S) N 2 r ( S ) . If k i Ω = 0 k_i\Omega=0 k i Ω = 0 and an operator B B B is supported on S S S and spectator systems, then, for every unit spectator vector ξ \xi ξ ,
E ∥ ( D − D r e t ) B ( Ω ⊗ ξ ) ∥ ≤ C t ∣ S ∣ ∥ B ∥ e v t − c r α . (159) \mathbb{E}\lVert(D-D_{\mathrm{ret}})B(\Omega\otimes\xi)\rVert\le Ct|S|\lVert B\rVert e^{vt-cr^\alpha}. \tag*{(159)} E ∥( D − D ret ) B ( Ω ⊗ ξ )∥ ≤ C t ∣ S ∣ ∥ B ∥ e v t − c r α . (159)
Both bounds concern the same coupled clock realization. Their constants are independent of ∣ Λ ∣ |\Lambda| ∣Λ∣ and of spectator dimensions.
Proof. We first prove an operator estimate for unital channels. Define
E i ( B ) = G i B G i + K i B K i , E i , l ( B ) = G i , l B G i , l + K i , l B K i , l , \mathcal{E}_i(B)=G_iBG_i+K_iBK_i,\qquad\mathcal{E}_{i,l}(B)=G_{i,l}BG_{i,l}+K_{i,l}BK_{i,l}, E i ( B ) = G i B G i + K i B K i , E i , l ( B ) = G i , l B G i , l + K i , l B K i , l ,
where K i , l = ( E i , l k i ) 1 / 2 K_{i,l}=(E_{i,l}k_i)^{1/2} K i , l = ( E i , l k i ) 1/2 . When k i Ω = 0 k_i\Omega=0 k i Ω = 0 , functional calculus gives G i Ω = Ω G_i\Omega=\Omega G i Ω = Ω and K i Ω = 0 K_i\Omega=0 K i Ω = 0 , so
E i ( C ) ( Ω ⊗ ξ ) = G i C ( Ω ⊗ ξ ) (160) \mathcal{E}_i(C)(\Omega\otimes\xi)=G_iC(\Omega\otimes\xi) \tag*{(160)} E i ( C ) ( Ω ⊗ ξ ) = G i C ( Ω ⊗ ξ ) (160)
for every operator C C C and spectator vector ξ \xi ξ . Products of these channels therefore recover the contraction products when evaluated on the ground vector. We localize the channels first: their unitality makes each local channel fix the algebra outside its supporting ball. They are also completely positive, hence contractions in operator norm, including after adjoining spectators. Lemma 4.4 gives
∥ E i − E i , l ∥ c b ≤ C e − c l α . (161) \lVert\mathcal{E}_i-\mathcal{E}_{i,l}\rVert_{\mathrm{cb}}\le Ce^{-cl^\alpha}. \tag*{(161)} ∥ E i − E i , l ∥ cb ≤ C e − c l α . (161)
The completely bounded norm here is the supremum of the operator norms after adjoining identity maps on finite spectator systems. In this case the estimate follows directly from the norm bounds for the two square roots, so it has no dimension factor.
Put E i , − 1 = i d \mathcal{E}_{i,-1}=\mathrm{id} E i , − 1 = id and Δ i , l = E i , l − E i , l − 1 \Delta_{i,l}=\mathcal{E}_{i,l}-\mathcal{E}_{i,l-1} Δ i , l = E i , l − E i , l − 1 for l ≥ 0 l\ge0 l ≥ 0 . By increasing C C C to include l = 0 l=0 l = 0 ,
∥ Δ i , l ∥ c b ≤ C e − c l α . (162) \lVert\Delta_{i,l}\rVert_{\mathrm{cb}}\le Ce^{-cl^\alpha}. \tag*{(162)} ∥ Δ i , l ∥ cb ≤ C e − c l α . (162)
Both channels in this difference fix operators commuting with the algebra on N l ( a i ) N_l(a_i) N l ( a i ) . Thus the difference vanishes on that commutant. For an operator B B B define its oscillation at a physical site y y y by
d y ( B ) = sup U y u n i t a r y ∥ [ U y , B ] ∥ . d_y(B)=\sup_{U_y\ \mathrm{unitary}}\lVert[U_y,B]\rVert. d y ( B ) = U y unitary sup ∥[ U y , B ]∥ .
Average over the on-site unitaries in a set Q Q Q , one site at a time. The total norm change is at most ∑ z ∈ Q d z ( B ) \sum_{z\in Q}d_z(B) ∑ z ∈ Q d z ( B ) , and the result commutes with the algebra on Q Q Q . Consequently
∥ Δ i , l ( B ) ∥ ≤ C e − c l α ∑ z ∈ N l ( a i ) d z ( B ) . (163) \lVert\Delta_{i,l}(B)\rVert\le Ce^{-cl^\alpha}\sum_{z\in N_l(a_i)}d_z(B). \tag*{(163)} ∥ Δ i , l ( B )∥ ≤ C e − c l α z ∈ N l ( a i ) ∑ d z ( B ) . (163)
This argument also applies to operators acting on spectators.
To bound the oscillation after one event, suppose first that m = d Λ ( a i , y ) < ∞ m=d_\Lambda(a_i,y)<\infty m = d Λ ( a i , y ) < ∞ . The channel E i , m − 1 \mathcal{E}_{i,m-1} E i , m − 1 does not act at y y y and commutes with conjugation by U y U_y U y ; hence it cannot increase d y d_y d y . Telescope the shells from radius m m m onward and use d y ( C ) ≤ 2 ∥ C ∥ d_y(C)\le2\lVert C\rVert d y ( C ) ≤ 2 ∥ C ∥ to obtain
d y ( E i B ) ≤ d y ( B ) + C ∑ l ≥ d Λ ( a i , y ) e − c l α ∑ z ∈ N l ( a i ) d z ( B ) . (164) d_y(\mathcal{E}_iB)\le d_y(B)+C\sum_{l\ge d_\Lambda(a_i,y)}e^{-cl^\alpha}\sum_{z\in N_l(a_i)}d_z(B). \tag*{(164)} d y ( E i B ) ≤ d y ( B ) + C l ≥ d Λ ( a i , y ) ∑ e − c l α z ∈ N l ( a i ) ∑ d z ( B ) . (164)
For m = 0 m = 0 m = 0 the initial channel is the identity. If m = ∞ m = \infty m = ∞ , E i \mathcal{E}_i E i acts in a different component and cannot increase d y d_y d y . Exact component support follows either from the construction or by letting l l l exceed the component diameter in the approximation assumption.
Sum the increment in (164) over the retained anchor labels. Define the nonnegative matrix
A y z = C ∑ i r e t a i n e d ∑ l ≥ 0 e − c l α 1 { y , z ∈ N l ( a i ) } , A_{yz} = C \sum_{i\ \mathrm{retained}} \sum_{l\geq0} e^{-cl^\alpha} \mathbf{1}_{\{y,z\in N_l(a_i)\}}, A y z = C i retained ∑ l ≥ 0 ∑ e − c l α 1 { y , z ∈ N l ( a i )} ,
with the constant from (164) . It has a uniformly bounded weighted row sum:
sup y ∑ z : d Λ ( y , z ) < ∞ A y z e a d Λ ( y , z ) α ≤ v (165) \sup_y \sum_{z:d_\Lambda(y,z)<\infty} A_{yz}e^{ad_\Lambda(y,z)^\alpha} \leq v \tag*{(165)} y sup z : d Λ ( y , z ) < ∞ ∑ A y z e a d Λ ( y , z ) α ≤ v (165)
for some a > 0 a > 0 a > 0 . Indeed, at radius l l l there are at most C ( 1 + l ) 2 C(1+l)^2 C ( 1 + l ) 2 anchor labels whose balls contain y y y , and at most C ( 1 + l ) 2 C(1+l)^2 C ( 1 + l ) 2 sites in each ball. Their distances from y y y are at most 2 l 2l 2 l . The left side is therefore bounded by
C ∑ l ≥ 0 ( 1 + l ) 4 e − c l α + a ( 2 l ) α , C\sum_{l\geq0}(1+l)^4e^{-cl^\alpha+a(2l)^\alpha}, C l ≥ 0 ∑ ( 1 + l ) 4 e − c l α + a ( 2 l ) α ,
which is finite for sufficiently small a a a . There are no kernel entries between different components.
Let B u B_u B u be the result of the retained channel events up to time u u u , starting from B B B . The Poisson jump formula and (164) imply, in integral form, the differential upper bound
d d u E d y ( B u ) ≤ ∑ z A y z E d z ( B u ) . \frac{d}{du}\mathbb{E}d_y(B_u) \leq\sum_z A_{yz}\mathbb{E}d_z(B_u). d u d E d y ( B u ) ≤ z ∑ A y z E d z ( B u ) .
The site and anchor sums are finite for a fixed domain, and the radius sums converge absolutely with the uniform bounds in (165) . Initially d y ( B ) ≤ 2 ∥ B ∥ 1 s ( y ) d_y(B) \leq2\|B\|_1s(y) d y ( B ) ≤ 2∥ B ∥ 1 s ( y ) . On components meeting S S S , weight the last inequality by e a d Λ ( y , S ) α e^{ad_\Lambda(y,S)^\alpha} e a d Λ ( y , S ) α . The triangle inequality and 0 < α < 1 0 < \alpha< 1 0 < α < 1 give
d Λ ( y , S ) α − d Λ ( z , S ) α ≤ d Λ ( y , z ) α . d_\Lambda(y,S)^\alpha-d_\Lambda(z,S)^\alpha\leq d_\Lambda(y,z)^\alpha. d Λ ( y , S ) α − d Λ ( z , S ) α ≤ d Λ ( y , z ) α .
The weighted supremum thus grows at rate at most v v v . Gronwall’s inequality yields
E d y ( B u ) ≤ 2 ∥ B ∥ e v u − a d Λ ( y , S ) α . (166) \mathbb{E}d_y(B_u) \leq2\|B\|e^{vu-ad_\Lambda(y,S)^\alpha}. \tag*{(166)} E d y ( B u ) ≤ 2∥ B ∥ e v u − a d Λ ( y , S ) α . (166)
Oscillations on components disjoint from S S S remain zero.
We can now remove the distant events. For an omitted anchor at finite distance d = d Λ ( a i , S ) > r d=d_\Lambda(a_i,S)>r d = d Λ ( a i , S ) > r , sum (163) over all l ≥ 0 l\geq0 l ≥ 0 and apply (166) . When l ≤ d / 2 l\leq d/2 l ≤ d /2 , every z ∈ N l ( a i ) z\in N_l(a_i) z ∈ N l ( a i ) has d Λ ( z , S ) ≥ d / 2 d_\Lambda(z,S)\geq d/2 d Λ ( z , S ) ≥ d /2 . The sum over these radii is bounded by C ∥ B ∥ e v u − a ( d / 2 ) α C\|B\|e^{vu-a(d/2)^\alpha} C ∥ B ∥ e v u − a ( d /2 ) α . For l > d / 2 l>d/2 l > d /2 use the shell decay and the ball cardinality instead. Absorbing its polynomial factor gives, in both cases,
E ∥ ( E i − id ) ( B u ) ∥ ≤ C ∥ B ∥ e v u − c ′ d α . (167) \mathbb{E}\|(\mathcal{E}_i-\operatorname{id})(B_u)\| \leq C\|B\|e^{vu-c'd^\alpha}. \tag*{(167)} E ∥ ( E i − id ) ( B u ) ∥ ≤ C ∥ B ∥ e v u − c ′ d α . (167)
At infinite distance the left side is zero.
Couple full and retained processes by using the same clocks. The difference of their products telescopes with earlier retained channels and later full channels. All the later channels contract the operator norm. The earlier retained process is independent of the omitted clocks, so their expected contributions are obtained by integrating the rate-one bound (167) . There are at most C ∣ S ∣ ( d + 1 ) 2 C|S|(d+1)^2 C ∣ S ∣ ( d + 1 ) 2 anchor labels at distance d d d from S S S . Summing the stretched-exponential tail and integrating time therefore prove the coupled expected-norm estimate
E ∥ E f u l l ( B ) − E r e t ( B ) ∥ ≤ C t ∣ S ∣ ∥ B ∥ e v t − c ′ ′ r α . (168) \mathbb{E}\|\mathcal{E}_{\mathrm{full}}(B)-\mathcal{E}_{\mathrm{ret}}(B)\| \leq Ct|S|\|B\|e^{vt-c''r^\alpha}. \tag*{(168)} E ∥ E full ( B ) − E ret ( B ) ∥ ≤ C t ∣ S ∣∥ B ∥ e v t − c ′′ r α . (168)
In particular this is a bound on the expectation of the norm, not merely on the norm of a difference of averaged operators.
If k i Ω = 0 k_i\Omega=0 k i Ω = 0 , evaluating both channel products on Ω ⊗ ξ \Omega\otimes\xi Ω ⊗ ξ and iterating (160) converts (168) into (159) . Unitality is essential in the channel argument: the single map C ↦ G i C G i \mathcal{C}\mapsto G_i\mathcal{C}G_i C ↦ G i C G i need not fix operators on a disjoint system.
Finally there are at most C ∣ S ∣ ( 1 + r ) 2 C|S|(1+r)^2 C ∣ S ∣ ( 1 + r ) 2 retained labels, and hence their expected number of events is at most C t ∣ S ∣ ( 1 + r ) 2 Ct|S|(1+r)^2 C t ∣ S ∣ ( 1 + r ) 2 . Each event’s contraction changes by at most C e − c r α Ce^{-cr^\alpha} C e − c r α under radius-r r r approximation. Telescoping the contraction products proves (158) . A retained anchor is within r r r of S S S , so every approximating factor is supported on N 2 r ( S ) N_{2r}(S) N 2 r ( S ) . This completes the proof.
Ground-state-preserving products that suppress excited states also occur in detectability-lemma constructions [4 ] , Section III. For the random contractions here, the gap gives the following estimate. Under (157) , for any vector ζ \zeta ζ including spectator systems,
E ∥ D ( I − P Ω ) ζ ∥ 2 ≤ e − g t ∥ ( I − P Ω ) ζ ∥ 2 . (169) \mathbb{E}\lVert D(I-P_\Omega)\zeta\rVert^2\le e^{-gt}\lVert(I-P_\Omega)\zeta\rVert^2. \tag*{(169)} E ∥ D ( I − P Ω ) ζ ∥ 2 ≤ e − g t ∥( I − P Ω ) ζ ∥ 2 . (169)
Here and below physical projections are tensored with the identity on spectators. To see this, every self-adjoint G i G_i G i fixes Ω \Omega Ω and commutes with P Ω P_\Omega P Ω . At a clock event the squared norm of an excited vector decreases by ⟨ ζ , k i ζ ⟩ \langle\zeta,k_i\zeta\rangle ⟨ ζ , k i ζ ⟩ . Summing the conditional rate of these decreases gives at least g ∥ ζ ∥ 2 g\lVert\zeta\rVert^2 g ∥ ζ ∥ 2 , and integrating proves (169) . Thus the global gap is used for decay, while the preceding channel argument supplies locality.
A local unitary from a small collar cost
For an ambient set T ⊂ Z 2 T\subset\mathbb{Z}^2 T ⊂ Z 2 , write T L = T + [ − L , L ] Z 2 T_L=T+[-L,L]^2_{\mathbb{Z}} T L = T + [ − L , L ] Z 2 as in the scanner. The next proposition states explicitly the information it needs from that scanner.
Proposition 10.2 (Amplification). Fix C 0 > 0 C_0>0 C 0 > 0 and let ε , β , α \varepsilon,\beta,\alpha ε , β , α be as in (156) . Suppose n ≥ 2 n\ge2 n ≥ 2 , L = ⌊ n 1 − ε ⌋ L=\lfloor n^{1-\varepsilon}\rfloor L = ⌊ n 1 − ε ⌋ , and
X = A ∩ T , S 0 = A ∩ T L , Y = S 0 ∖ X , Z ′ = Λ ∖ S 0 . X=A\cap T,\qquad S_0=A\cap T_L,\qquad Y=S_0\setminus X,\qquad Z'=\Lambda\setminus S_0. X = A ∩ T , S 0 = A ∩ T L , Y = S 0 ∖ X , Z ′ = Λ ∖ S 0 .
Assume that ∣ S 0 ∣ ≤ C 0 n 2 |S_0|\le C_0n^2 ∣ S 0 ∣ ≤ C 0 n 2 , that each of the three cuts X , Y , S 0 X,Y,S_0 X , Y , S 0 has at most C 0 n C_0n C 0 n crossing edges, and that
I : = I Ω ( X : Z ′ ) ≤ C 0 n 1 − ε . (170) \mathcal{I}:=I_\Omega(X:Z')\le C_0n^{1-\varepsilon}. \tag*{(170)} I := I Ω ( X : Z ′ ) ≤ C 0 n 1 − ε . (170)
For every integer M ≥ 1 M\ge1 M ≥ 1 , at all sufficiently large n n n , there is an integer radius r r r such that
r ≤ C M n ( 1 − ε ) / α , L + 2 r = o ( n β ) , r\le C_Mn^{(1-\varepsilon)/\alpha},\qquad L+2r=o(n^\beta), r ≤ C M n ( 1 − ε ) / α , L + 2 r = o ( n β ) ,
and, simultaneously for every physical set J ⊆ Λ ∖ N 2 r ( S 0 ) J\subseteq\Lambda\setminus N_{2r}(S_0) J ⊆ Λ ∖ N 2 r ( S 0 ) ,
I Ω ( X : J ) ≤ C M n − M . I_\Omega(X:J)\le C_Mn^{-M}. I Ω ( X : J ) ≤ C M n − M .
The same bound holds with any subset of X X X in place of X X X . The constants and the threshold may depend on C 0 C_0 C 0 and M M M , but are independent of Λ , A , T \Lambda,A,T Λ , A , T subject to the stated assumptions.
If in addition
dist ∞ ( T , Z ) > L + n β , (171) \operatorname{dist}_{\infty}(T,Z)>L+n^\beta, \tag*{(171)} dist ∞ ( T , Z ) > L + n β , (171)
where Z Z Z is the set of endpoints of the original cut, then N 2 r ( S 0 ) ⊆ A N_{2r}(S_0)\subseteq A N 2 r ( S 0 ) ⊆ A . In particular the remote set J J J may include all of A ∖ A A\setminus A A ∖ A . Proof. The case X = ∅ X = \varnothing X = ∅ is immediate; take r = 1 r = 1 r = 1 . Suppose that X X X is nonempty. We keep the entire physical system fixed while constructing the auxiliary operators; the estimates below are uniform in its volume.
Set w = n 3 / 5 w = n^{3/5} w = n 3/5 . Lemma 3.1, applied in the original ground state to the three cuts, provides spectral projections P X , T Y , Q S 0 P_X,T_Y,Q_{S_0} P X , T Y , Q S 0 onto their positive eigenvalues with surprisal in the intervals
[ S ( X ) − w , S ( X ) + w ] , [ S ( Y ) − w , S ( Y ) + w ] , [ S ( S 0 ) − w , S ( S 0 ) + w ] , [S(X)-w,S(X)+w], \qquad[S(Y)-w,S(Y)+w], \qquad[S(S_0)-w,S(S_0)+w], [ S ( X ) − w , S ( X ) + w ] , [ S ( Y ) − w , S ( Y ) + w ] , [ S ( S 0 ) − w , S ( S 0 ) + w ] ,
respectively. The original interactions have uniformly bounded support dimensions and at most C n Cn C n terms cross each cut. Thus each failed projection has probability at most C exp ( − c n 1 / 10 ) C\exp(-cn^{1/10}) C exp ( − c n 1/10 ) . For any fixed integer K ≥ 1 K \ge1 K ≥ 1 , increasing the scale threshold makes these three probabilities at most
δ = n − 2 K . \delta= n^{-2K}. δ = n − 2 K .
For a trivial subsystem its projection is the identity. All inverse eigenvalues used below are restricted to the selected positive spectrum, so no invertibility assumption is imposed on a marginal.
Choose a full eigenbasis { ∣ x ⟩ } \{|x\rangle\} { ∣ x ⟩} for ρ X \rho_X ρ X , with eigenvalues p x ≥ 0 p_x \ge0 p x ≥ 0 , and write a Schmidt expansion
Ω = ∑ y : p y > 0 p y ∣ y ⟩ X ∣ ω y ⟩ Y Z ′ . \Omega= \sum_{y:p_y>0}\sqrt{p_y}\,|y\rangle_X|\omega_y\rangle_{YZ'}. Ω = y : p y > 0 ∑ p y ∣ y ⟩ X ∣ ω y ⟩ Y Z ′ .
Append two systems s ′ s' s ′ , e ′ e' e ′ , each a copy of the Hilbert space on X X X , with fixed unit blank vectors denoted ∣ 0 ⟩ |0\rangle ∣0 ⟩ . Consider the unit vectors
ϕ = ∣ 0 ⟩ X ∣ 0 ⟩ s ′ ∑ y : p y > 0 p y ∣ y ⟩ e ′ ∣ ω y ⟩ Y Z ′ , (172) \phi= |0\rangle_X|0\rangle_{s'}\sum_{y:p_y>0}\sqrt{p_y}|y\rangle_{e'}|\omega_y\rangle_{YZ'}, \tag*{(172)} ϕ = ∣0 ⟩ X ∣0 ⟩ s ′ y : p y > 0 ∑ p y ∣ y ⟩ e ′ ∣ ω y ⟩ Y Z ′ , (172)
η = Ω ⊗ ∑ x : p x > 0 p x ∣ x ⟩ s ′ ∣ x ⟩ e ′ . (173) \eta= \Omega\otimes\sum_{x:p_x>0}\sqrt{p_x}|x\rangle_{s'}|x\rangle_{e'}. \tag*{(173)} η = Ω ⊗ x : p x > 0 ∑ p x ∣ x ⟩ s ′ ∣ x ⟩ e ′ . (173)
In ϕ \phi ϕ , the original target has moved to e ′ e' e ′ , so its joint reduction with a remote physical system is unchanged after relabeling. In η \eta η , e ′ e' e ′ is purified by s ′ s' s ′ and is independent of all physical systems. The unitary we construct will leave e ′ e' e ′ untouched and act only on s ′ s' s ′ and a graph neighborhood of S 0 S_0 S 0 .
For readability write Q = Q S 0 Q=Q_{S_0} Q = Q S 0 and T 0 = T Y T_0=T_Y T 0 = T Y . On s ′ s' s ′ , X X X , Y Y Y define the square operator
R 0 = ∑ x s e l e c t e d p x − 1 / 2 ∣ x ⟩ ⟨ 0 ∣ s ′ ⊗ Q ∣ x ⟩ ⟨ 0 ∣ X ⊗ T 0 . (174) R_0 = \sum_{x\ {\rm selected}}p_x^{-1/2}|x\rangle\langle0|_{s'}\otimes Q|x\rangle\langle0|_X\otimes T_0. \tag*{(174)} R 0 = x selected ∑ p x − 1/2 ∣ x ⟩ ⟨ 0 ∣ s ′ ⊗ Q ∣ x ⟩ ⟨ 0 ∣ X ⊗ T 0 . (174)
It acts trivially on e ′ e' e ′ and Z ′ Z' Z ′ . The localization lemma applies to vectors of the form B ( Ω ⊗ ξ ) B(\Omega\otimes\xi) B ( Ω ⊗ ξ ) with a local operator B B B . To put R 0 ϕ R_0\phi R 0 ϕ in this form, define an operator supported on S 0 S_0 S 0 , s ′ s' s ′ , e ′ e' e ′ by
B 0 = ∑ x s e l e c t e d y i n t h e f u l l b a s i s p x − 1 / 2 ∣ x ⟩ ⟨ 0 ∣ s ′ ⊗ ∣ y ⟩ ⟨ 0 ∣ e ′ ⊗ Q ∣ x ⟩ ⟨ y ∣ X ⊗ T 0 . (175) B_0 = \sum_{\substack{x\ {\rm selected}\\ y\ {\rm in\ the\ full\ basis}}}p_x^{-1/2}|x\rangle\langle0|_{s'}\otimes|y\rangle\langle0|_{e'}\otimes Q|x\rangle\langle y|_X\otimes T_0. \tag*{(175)} B 0 = x selected y in the full basis ∑ p x − 1/2 ∣ x ⟩ ⟨ 0 ∣ s ′ ⊗ ∣ y ⟩ ⟨ 0 ∣ e ′ ⊗ Q ∣ x ⟩ ⟨ y ∣ X ⊗ T 0 . (175)
The summation over y y y includes zero-probability eigenvectors. Direct substitution gives
R 0 ϕ = B 0 ( Ω ⊗ ∣ 00 ⟩ s ′ e ′ ) . (176) R_0\phi= B_0(\Omega\otimes|00\rangle_{s'e'}). \tag*{(176)} R 0 ϕ = B 0 ( Ω ⊗ ∣00 ⟩ s ′ e ′ ) . (176)
We establish three estimates for these operators before introducing the constraint product. The first is a norm bound controlled by I \mathcal{I} I . Let
B Y = ∑ x s e l e c t e d p x − 1 T 0 ⟨ x ∣ Q ∣ x ⟩ T 0 ≥ 0. B_Y = \sum_{x\ {\rm selected}}p_x^{-1}T_0\langle x|Q|x\rangle T_0 \ge0. B Y = x selected ∑ p x − 1 T 0 ⟨ x ∣ Q ∣ x ⟩ T 0 ≥ 0.
Orthogonality of the output vectors in (174) gives R 0 † R 0 = ∣ 0 ⟩ ⟨ 0 ∣ s ′ ⊗ ∣ 0 ⟩ ⟨ 0 ∣ X ⊗ B Y R_0^\dagger R_0 = \lvert0\rangle\langle0\rvert_{s'} \otimes\lvert0\rangle\langle0\rvert_X \otimes B_Y R 0 † R 0 = ∣ 0 ⟩ ⟨ 0 ∣ s ′ ⊗ ∣ 0 ⟩ ⟨ 0 ∣ X ⊗ B Y . Similarly, B 0 † B 0 = ∣ 00 ⟩ ⟨ 00 ∣ s ′ e ′ ⊗ I X ⊗ B Y B_0^\dagger B_0 = \lvert00\rangle\langle00\rvert_{s'e'} \otimes I_X \otimes B_Y B 0 † B 0 = ∣ 00 ⟩ ⟨ 00 ∣ s ′ e ′ ⊗ I X ⊗ B Y . The typical spectral inequalities are
p x − 1 ≤ e S ( X ) + w , Q ≤ e S ( S 0 ) + w ρ S 0 , T 0 ρ Y T 0 ≤ e − S ( Y ) + w T 0 . p_x^{-1} \le e^{S(X)+w}, \qquad Q \le e^{S(S_0)+w}\rho_{S_0}, \qquad T_0\rho_YT_0 \le e^{-S(Y)+w}T_0. p x − 1 ≤ e S ( X ) + w , Q ≤ e S ( S 0 ) + w ρ S 0 , T 0 ρ Y T 0 ≤ e − S ( Y ) + w T 0 .
They imply
∥ R 0 ∥ , ∥ B 0 ∥ ≤ M 0 , M 0 = exp ( ( I + 3 w ) / 2 ) , (177) \lVert R_0\rVert,\ \lVert B_0\rVert\le M_0,\qquad M_0=\exp((\mathcal{I}+3w)/2), \tag*{(177)} ∥ R 0 ∥ , ∥ B 0 ∥ ≤ M 0 , M 0 = exp (( I + 3 w ) /2 ) , (177)
because purity gives S ( X ) + S ( S 0 ) − S ( Y ) = I ( X : Z ′ ) = I S(X)+S(S_0)-S(Y)=I(X:Z')=\mathcal{I} S ( X ) + S ( S 0 ) − S ( Y ) = I ( X : Z ′ ) = I .
The second estimate is an adjoint identity with no factor M 0 M_0 M 0 . Let R X R_X R X be the isometry that relabels X X X as e ′ e' e ′ and inserts the blank vectors on X , s ′ X,s' X , s ′ ; thus R X Ω = ϕ R_X\Omega=\phi R X Ω = ϕ . For every physical operator L ′ L' L ′ the coefficients p x \sqrt{p_x} p x in (173) cancel the selected inverse square roots, giving exactly
R 0 † ( L ′ ) † η = R X ( P X ⊗ T 0 ) Q ( L ′ ) † Ω . (178) R_0^\dagger(L')^\dagger\eta=R_X(P_X\otimes T_0)Q(L')^\dagger\Omega. \tag*{(178)} R 0 † ( L ′ ) † η = R X ( P X ⊗ T 0 ) Q ( L ′ ) † Ω. (178)
The three projections are contractions, whether or not they commute. Telescoping them on Ω \Omega Ω and using (10.19) therefore gives
∥ R 0 † ( L ′ ) † η − ϕ ∥ ≤ 3 δ + ∥ ( L ′ ) † Ω − Ω ∥ . (179) \lVert R_0^\dagger(L')^\dagger\eta-\phi\rVert\le3\sqrt{\delta}+\lVert(L')^\dagger\Omega-\Omega\rVert. \tag*{(179)} ∥ R 0 † ( L ′ ) † η − ϕ ∥ ≤ 3 δ + ∥( L ′ ) † Ω − Ω ∥ . (179)
Third, although R 0 ϕ R_0\phi R 0 ϕ may have large norm, its physical ground component has norm at most one. Define
M X = Tr Y [ ( I X ⊗ T 0 ) ρ S 0 Q ] . M_X=\operatorname{Tr}_Y[(I_X\otimes T_0)\rho_{S_0}Q]. M X = Tr Y [( I X ⊗ T 0 ) ρ S 0 Q ] .
Since Q Q Q commutes with ρ S 0 \rho_{S_0} ρ S 0 , one has 0 ≤ ρ S 0 Q ≤ ρ S 0 0\le\rho_{S_0}Q\le\rho_{S_0} 0 ≤ ρ S 0 Q ≤ ρ S 0 . Cyclicity of the partial trace for operators on Y Y Y allows a second T 0 T_0 T 0 on the right. Hence
0 ≤ M X ≤ Tr Y [ ( I ⊗ T 0 ) ρ S 0 ( I ⊗ T 0 ) ] ≤ ρ X . 0\le M_X\le\operatorname{Tr}_Y[(I\otimes T_0)\rho_{S_0}(I\otimes T_0)]\le\rho_X. 0 ≤ M X ≤ Tr Y [( I ⊗ T 0 ) ρ S 0 ( I ⊗ T 0 )] ≤ ρ X .
The last inequality follows by adding the analogous positive term with I − T 0 I-T_0 I − T 0 ; the two cross terms have zero partial trace. In particular M X M_X M X vanishes on ker ρ X \ker\rho_X ker ρ X . On its support put A X = ρ X − 1 / 2 M X ρ X − 1 / 2 A_X=\rho_X^{-1/2}M_X\rho_X^{-1/2} A X = ρ X − 1/2 M X ρ X − 1/2 , so 0 ≤ A X ≤ I 0\le A_X\le I 0 ≤ A X ≤ I . With ρ X + \rho_X^+ ρ X + denoting the inverse on the support and zero on the kernel,
M X ρ X + M X = ρ X 1 / 2 A X 2 ρ X 1 / 2 ≤ M X . M_X\rho_X^+M_X=\rho_X^{1/2}A_X^2\rho_X^{1/2}\le M_X. M X ρ X + M X = ρ X 1/2 A X 2 ρ X 1/2 ≤ M X .
The ancillary coefficient of ∣ x ⟩ s ′ ∣ y ⟩ e ′ \lvert x\rangle_{s'}\lvert y\rangle_{e'} ∣ x ⟩ s ′ ∣ y ⟩ e ′ in P Ω R 0 ϕ P_\Omega R_0\phi P Ω R 0 ϕ is ( M X ) y x / p x (M_X)_{yx}/\sqrt{p_x} ( M X ) y x / p x for selected x x x . It follows that
∥ P Ω R 0 ϕ ∥ 2 = ∑ x s e l e c t e d , y ∣ ( M X ) y x ∣ 2 p x ≤ Tr ( M X ρ X + M X ) ≤ Tr M X ≤ 1. (180) \lVert P_\Omega R_0\phi\rVert^2
=\sum_{x\ \mathrm{selected},y}\frac{\lvert(M_X)_{yx}\rvert^2}{p_x}
\le\operatorname{Tr}(M_X\rho_X^+M_X)\le\operatorname{Tr}M_X\le1. \tag*{(180)} ∥ P Ω R 0 ϕ ∥ 2 = x selected , y ∑ p x ∣( M X ) y x ∣ 2 ≤ Tr ( M X ρ X + M X ) ≤ Tr M X ≤ 1. (180)
We have now constructed a restoring operator whose norm is e O ( I + w ) e^{O(\mathcal{I}+w)} e O ( I + w ) , whose adjoint is accurate on the desired state, and whose ground component is bounded. Positive constraints will suppress the remaining component while preserving the last two properties.
Run the clocks of Lemma 10.1 for time
t ∗ = C ( I + w + K log n ) , r = ⌈ ( C ′ ( t ∗ + K log n ) ) 1 / α ⌉ , (181) t_* = C(\mathcal{I}+w+K\log n),\qquad r=\left\lceil\left(C'(t_*+K\log n)\right)^{1/\alpha}\right\rceil, \tag*{(181)} t ∗ = C ( I + w + K log n ) , r = ⌈ ( C ′ ( t ∗ + K log n ) ) 1/ α ⌉ , (181)
where C C C and then C ′ C' C ′ are chosen sufficiently large. Use S = S 0 S=S_0 S = S 0 , and put ζ = R 0 ϕ \zeta=R_0\phi ζ = R 0 ϕ . The full, retained, and truncated products are denoted D , D r e t , L ′ D,D_{\mathrm{ret}},L' D , D ret , L ′ respectively. Equations (169) and (177) imply
E ∥ D ( I − P Ω ) ζ ∥ 2 ≤ M 0 2 e − g t ∗ . \mathbb{E}\lVert D(I-P_\Omega)\zeta\rVert^2\le M_0^2e^{-gt_*}. E ∥ D ( I − P Ω ) ζ ∥ 2 ≤ M 0 2 e − g t ∗ .
Apply Lemma 10.1 with B = B 0 B=B_0 B = B 0 , ξ = ∣ 00 ⟩ s ′ e ′ \xi=\lvert00\rangle_{s'e'} ξ = ∣ 00 ⟩ s ′ e ′ , and S = S 0 S=S_0 S = S 0 . The column representation (176) then gives
E ∥ ( D − D r e t ) ζ ∥ ≤ C t ∗ ∣ S 0 ∣ M 0 e v t ∗ − c r α , M 0 E ∥ D r e t − L ′ ∥ ≤ C t ∗ ∣ S 0 ∣ ( 1 + r ) 2 M 0 e − c r α . \begin{aligned}
\mathbb{E}\lVert(D-D_{\mathrm{ret}})\zeta\rVert&\le C t_* \lvert S_0\rvert M_0 e^{v t_* - c r^\alpha},\\
M_0\mathbb{E}\lVert D_{\mathrm{ret}}-L'\rVert&\le C t_* \lvert S_0\rvert(1+r)^2 M_0 e^{-c r^\alpha}.
\end{aligned} E ∥( D − D ret ) ζ ∥ M 0 E ∥ D ret − L ′ ∥ ≤ C t ∗ ∣ S 0 ∣ M 0 e v t ∗ − c r α , ≤ C t ∗ ∣ S 0 ∣ ( 1 + r ) 2 M 0 e − c r α .
All of these estimates are on the same clock space.
Here is explicit control of the scale choices. First choose C C C so that g t ∗ ≥ I + 3 w + 6 K log n g t_* \ge I+3w+6K\log n g t ∗ ≥ I + 3 w + 6 K log n . The first expectation is then at most n − 6 K n^{-6K} n − 6 K . By (170) , both t ∗ t_* t ∗ and r r r are bounded by fixed powers of n n n , with constants depending on K K K . Their polynomial prefactors and ∣ S 0 ∣ \lvert S_0\rvert ∣ S 0 ∣ therefore cost only O K ( log n ) O_K(\log n) O K ( log n ) in the logarithm. Since log M 0 = ( I + 3 w ) / 2 ≤ C t ∗ \log M_0=(I+3w)/2\le Ct_* log M 0 = ( I + 3 w ) /2 ≤ C t ∗ , choosing C C C larger makes each of the last two expectations at most n − 3 K n^{-3K} n − 3 K for large n n n . Markov’s inequality and a union bound consequently provide a realization satisfying
∥ D ( I − P Ω ) ζ ∥ ≤ n − K , ∥ ( D − D r e t ) ζ ∥ ≤ n − K , M 0 ∥ D r e t − L ′ ∥ ≤ n − K . (182) \lVert D(I-P_\Omega)\zeta\rVert\le n^{-K},\qquad
\lVert(D-D_{\mathrm{ret}})\zeta\rVert\le n^{-K},\qquad
M_0\lVert D_{\mathrm{ret}}-L'\rVert\le n^{-K}. \tag*{(182)} ∥ D ( I − P Ω ) ζ ∥ ≤ n − K , ∥( D − D ret ) ζ ∥ ≤ n − K , M 0 ∥ D ret − L ′ ∥ ≤ n − K . (182)
Indeed the three failure probabilities sum to at most n − 4 K + 2 n − 2 K < 1 n^{-4K}+2n^{-2K}<1 n − 4 K + 2 n − 2 K < 1 at sufficiently large scales.
Every exact factor fixes the ground vector in both directions. Thus D D D preserves the ground component in (180) , and D r e t † Ω = Ω D_{\mathrm{ret}}^\dagger\Omega=\Omega D ret † Ω = Ω . Since M 0 ≥ 1 M_0\ge1 M 0 ≥ 1 , (182) gives
∥ L ′ R 0 ϕ ∥ ≤ 1 + 3 n − K , ∥ ( L ′ ) † Ω − Ω ∥ ≤ n − K . (183) \lVert L'R_0\phi\rVert\le1+3n^{-K},\qquad
\lVert(L')^\dagger\Omega-\Omega\rVert\le n^{-K}. \tag*{(183)} ∥ L ′ R 0 ϕ ∥ ≤ 1 + 3 n − K , ∥( L ′ ) † Ω − Ω ∥ ≤ n − K . (183)
Combining the latter bound with (179) , and writing R ′ = L ′ R 0 R'=L'R_0 R ′ = L ′ R 0 , we obtain
∥ ( R ′ ) † η − ϕ ∥ ≤ 4 n − K . \lVert(R')^\dagger\eta-\phi\rVert\le4n^{-K}. ∥( R ′ ) † η − ϕ ∥ ≤ 4 n − K .
Because ϕ , η \phi,\eta ϕ , η are unit vectors, the real overlap satisfies ℜ ⟨ η , R ′ ϕ ⟩ ≥ 1 − 4 n − K \Re\langle\eta,R'\phi\rangle\ge1-4n^{-K} ℜ ⟨ η , R ′ ϕ ⟩ ≥ 1 − 4 n − K . Expanding the square using (183) gives
∥ R ′ ϕ − η ∥ ≤ C n − K / 2 . (184) \lVert R'\phi-\eta\rVert\le Cn^{-K/2}. \tag*{(184)} ∥ R ′ ϕ − η ∥ ≤ C n − K /2 . (184)
The square operator R ′ R' R ′ is supported on s ′ s' s ′ and N 2 r ( S 0 ) N_{2r}(S_0) N 2 r ( S 0 ) , and acts trivially on e ′ e' e ′ . Its polar decomposition extends on this finite local space to R ′ = U ′ H + R'=U'H_+ R ′ = U ′ H + , where U ′ U' U ′ is unitary and H + = ( R ′ † R ′ ) 1 / 2 H_+=(R'^\dagger R')^{1/2} H + = ( R ′ † R ′ ) 1/2 . Such a unitary extension exists even when R ′ R' R ′ is singular: its two polar support spaces have equal dimension, as do their orthogonal complements. Tensor it with the identity elsewhere. For ξ = ( U ′ ) † η \xi=(U')^\dagger\eta ξ = ( U ′ ) † η we have
∥ H + ξ − ϕ ∥ ≤ 4 n − K , ∥ H + ϕ − ξ ∥ ≤ C n − K / 2 . \lVert H_+\xi-\phi\rVert\le4n^{-K},\qquad
\lVert H_+\phi-\xi\rVert\le Cn^{-K/2}. ∥ H + ξ − ϕ ∥ ≤ 4 n − K , ∥ H + ϕ − ξ ∥ ≤ C n − K /2 .
Subtract these two errors in the identity
( I + H + ) ( ξ − ϕ ) = ( H + ξ − ϕ ) − ( H + ϕ − ξ ) . (I+H_+)(\xi-\phi)=(H_+\xi-\phi)-(H_+\phi-\xi). ( I + H + ) ( ξ − ϕ ) = ( H + ξ − ϕ ) − ( H + ϕ − ξ ) .
Since ∥ ( I + H + ) − 1 ∥ ≤ 1 \lVert(I+H_+)^{-1}\rVert\le1 ∥( I + H + ) − 1 ∥ ≤ 1 , this proves
∥ U ′ ϕ − η ∥ ≤ C n − K / 2 . (185) \lVert U'\phi-\eta\rVert\le Cn^{-K/2}. \tag*{(185)} ∥ U ′ ϕ − η ∥ ≤ C n − K /2 . (185)
In particular no bound on ∥ H + ∥ \lVert H_+\rVert ∥ H + ∥ is needed.
Let J ⊆ Λ ∖ N 2 r ( S 0 ) J\subseteq\Lambda\setminus N_{2r}(S_0) J ⊆ Λ ∖ N 2 r ( S 0 ) be arbitrary. The unitary U ′ U' U ′ changes neither e ′ e' e ′ nor J J J , so their joint reduction in U ′ ϕ U'\phi U ′ ϕ is exactly the original X J XJ X J reduction, with X X X relabeled as e ′ e' e ′ . In η \eta η that joint reduction is a product. Apply Lemma 2.1 to I ( e ′ : J ) = S ( e ′ ) − S ( e ′ ∣ J ) I(e':J)=S(e')-S(e'|J) I ( e ′ : J ) = S ( e ′ ) − S ( e ′ ∣ J ) and (185) . Only the dimension of e ′ e' e ′ appears. It has log dim e ′ = ∣ X ∣ log q ≤ C n 2 \log\dim e'=\lvert X\rvert\log q\le Cn^2 log dim e ′ = ∣ X ∣ log q ≤ C n 2 , and therefore
I Ω ( X : J ) ≤ C n 2 − K / 4 . I_\Omega(X:J)\le Cn^{2-K/4}. I Ω ( X : J ) ≤ C n 2 − K /4 .
Choose the fixed integer K ≥ 4 ( M + 3 ) K \ge4(M+3) K ≥ 4 ( M + 3 ) . This proves (10.17), uniformly for every such J J J . Discarding part of X X X proves the assertion for its subsets.
Finally (10.29) and (10.15) give r ≤ C M n ( 1 − ε ) / α r \le CMn^{(1-\varepsilon)/\alpha} r ≤ C M n ( 1 − ε ) / α . The choices in (10.1) imply ( 1 − ε ) / α < β (1-\varepsilon)/\alpha< \beta ( 1 − ε ) / α < β and 1 − ε < β 1-\varepsilon< \beta 1 − ε < β , which prove (10.16). If a graph path of length at most 2 r 2r 2 r from S 0 S_0 S 0 reached Λ ∖ A \Lambda\setminus A Λ ∖ A , it would contain an endpoint of the original cut. A starting point of this path has ambient distance at most L L L from T T T , and each graph step changes ambient distance by at most one. That endpoint would be within L + 2 r L+2r L + 2 r of T T T , contradicting (10.18) for large n n n . Thus the graph neighborhood lies in A A A , as claimed.
The global gap enters through the marginal-tail estimate, the construction of positive constraints, and the excited-state decay. Its final entropy comparison is confined to the target dimension. The next section constructs tiles whose enlarged graph neighborhoods avoid all previously used tiles of the same family, so that Proposition 10.2 can be applied repeatedly.
Two families of regions and the area bound
The amplified collar estimate controls the mutual information between one region and any collection of sites outside its collar. To use it in an entropy chain, we need to divide A A A into two families: within each family, the collar of a region must avoid all regions that precede it. We group cells in distance layers into primary tiles separated by sparse strips. Filling the strips with suitable labels leaves only point contacts between regions of the same family. We separate those contacts by recursively replacing small squares around them. The sites left at the end of this construction, and all the mutual-information errors, will be bounded by the number of cut edges.
The construction takes place in the ambient plane. Its use of ambient distance only supplies sufficient conditions for separation in the induced graph: every graph path of length r r r has ambient displacement at most r r r . We never require an ambiently short path to exist in the domain.
The entropy cancellation
We first isolate the elementary reason that two families suffice. This also specifies precisely the separation property that the geometry must provide.
Lemma 11.1 (Two-family entropy cancellation). Let ψ \psi ψ be a pure state on a finite tensor product with site set Λ \Lambda Λ . Suppose that
A = D ∪ ˙ ⋃ i ∈ I 0 X i ∪ ˙ ⋃ i ∈ I 1 X i ⊆ Λ A = D \mathbin{\dot\cup} \bigcup_{i\in I_0} X_i \mathbin{\dot\cup} \bigcup_{i\in I_1} X_i \subseteq\Lambda A = D ∪ ˙ i ∈ I 0 ⋃ X i ∪ ˙ i ∈ I 1 ⋃ X i ⊆ Λ
is a partition into disjoint sets, and fix an order on each finite index set I f I_f I f , f ∈ { 0 , 1 } f \in\{0,1\} f ∈ { 0 , 1 } . Write B = Λ ∖ A B = \Lambda\setminus A B = Λ ∖ A . If
I ψ ( X i : B ∪ ⋃ j ∈ I f j < i X j ) ≤ ε i ( i ∈ I f ) , I_\psi\left(X_i : B \cup\bigcup_{\substack{j\in I_f\\j<i}} X_j\right) \le\varepsilon_i \qquad(i \in I_f), I ψ X i : B ∪ j ∈ I f j < i ⋃ X j ≤ ε i ( i ∈ I f ) ,
then
S ψ ( A ) ≤ S ψ ( D ) + 1 2 ∑ i ε i . S_\psi(A) \le S_\psi(D) + \frac{1}{2}\sum_i \varepsilon_i. S ψ ( A ) ≤ S ψ ( D ) + 2 1 i ∑ ε i .
Proof. Write A f = ⋃ i ∈ I f X i A_f = \bigcup_{i\in I_f} X_i A f = ⋃ i ∈ I f X i and E f = ∑ i ∈ I f ε i E_f = \sum_{i\in I_f}\varepsilon_i E f = ∑ i ∈ I f ε i . The entropy chain rule and purity give
S ψ ( B A f ) ≥ S ψ ( B ) + ∑ i ∈ I f S ψ ( X i ) − E f = S ψ ( A ) + ∑ i ∈ I f S ψ ( X i ) − E f . S_\psi(BA_f) \ge S_\psi(B) + \sum_{i\in I_f} S_\psi(X_i) - E_f = S_\psi(A) + \sum_{i\in I_f} S_\psi(X_i) - E_f. S ψ ( B A f ) ≥ S ψ ( B ) + i ∈ I f ∑ S ψ ( X i ) − E f = S ψ ( A ) + i ∈ I f ∑ S ψ ( X i ) − E f .
On the other hand, purity and subadditivity give
S ψ ( B A f ) = S ψ ( D A 1 − f ) ≤ S ψ ( D ) + ∑ i ∈ I 1 − f S ψ ( X i ) . S_{\psi}(BA_f)=S_{\psi}(DA_{1-f})\le S_{\psi}(D)+\sum_{i\in I_{1-f}}S_{\psi}(X_i). S ψ ( B A f ) = S ψ ( D A 1 − f ) ≤ S ψ ( D ) + i ∈ I 1 − f ∑ S ψ ( X i ) .
Adding the inequalities for f = 0 f=0 f = 0 and f = 1 f=1 f = 1 cancels every individual tile entropy and proves the claim.
The geometric statement
Keep the exponent β = 1 − 2 ⋅ 10 − 6 \beta=1-2\cdot10^{-6} β = 1 − 2 ⋅ 1 0 − 6 from Proposition 10.2, and put
δ 0 = 2 ⋅ 10 − 7 , ζ = 1 − δ 0 2 , ρ 0 = 1 + β 2 , ℓ = 10 − 5 . \delta_0=2\cdot10^{-7},\qquad\zeta=1-\frac{\delta_0}{2},\qquad\rho_0=\frac{1+\beta}{2},\qquad\ell=10^{-5}. δ 0 = 2 ⋅ 1 0 − 7 , ζ = 1 − 2 δ 0 , ρ 0 = 2 1 + β , ℓ = 1 0 − 5 .
The inequalities we shall use are
( 1 + 2 δ 0 ) β < ζ < 1 , ( 1 + 2 δ 0 ) ( 1 − ℓ ) < 1 , 1 − ℓ < β < ρ 0 < 1. (1+2\delta_0)\beta<\zeta<1,\qquad(1+2\delta_0)(1-\ell)<1,\qquad1-\ell<\beta<\rho_0<1. ( 1 + 2 δ 0 ) β < ζ < 1 , ( 1 + 2 δ 0 ) ( 1 − ℓ ) < 1 , 1 − ℓ < β < ρ 0 < 1.
All their gaps are fixed positive numbers. Thresholds depending on these gaps may therefore be chosen independently of Λ \Lambda Λ and A A A .
A birth region below is the bounded closed planar region assigned to a tile when that tile is created. Later steps only delete points from that tile. Its actual region is the interior of its birth region remaining after all deletions. Different pieces with the same tile identifier are treated as one region; neither a birth region nor an actual region is required to be connected. Its ambient lattice template is the intersection of its birth region with Z 2 \mathbb{Z}^2 Z 2 . We distinguish the two family labels 0 , 1 0,1 0 , 1 from the two sides A , Λ ∖ A A,\Lambda\setminus A A , Λ ∖ A of the physical cut.
Proposition 11.2 (Two families with separated birth templates). Fix the constants D 0 D_0 D 0 and C t p l C_{\mathrm{tpl}} C tpl in Definition 9.3, and a lower scale threshold n ∗ ≥ 1 n_*\ge1 n ∗ ≥ 1 . There is a constant C C C with the following property. Let Λ \Lambda Λ be a finite induced subgraph of the square lattice, let A ⊆ Λ A\subseteq\Lambda A ⊆ Λ , and suppose that b = ∣ ∂ Λ A ∣ > 0 b=|\partial_\Lambda A|>0 b = ∣ ∂ Λ A ∣ > 0 . Let Z Z Z be the set of endpoints of those cut edges.
There are a set D ⊆ A D\subseteq A D ⊆ A , a finite ordered collection of disjoint nonempty sets X i ⊆ A X_i\subseteq A X i ⊆ A , labels f i ∈ { 0 , 1 } f_i\in\{0,1\} f i ∈ { 0 , 1 } , ambient templates T i ⊂ Z 2 T_i\subset\mathbb{Z}^2 T i ⊂ Z 2 , and integers n i ≥ n ∗ n_i\ge n_* n i ≥ n ∗ such that:
A = D ∪ ˙ ⋃ i X i A=D\mathbin{\dot\cup}\bigcup_i X_i A = D ∪ ˙ ⋃ i X i and ∣ D ∣ ≤ C b |D|\le Cb ∣ D ∣ ≤ C b .
X i ⊆ A ∩ T i X_i\subseteq A\cap T_i X i ⊆ A ∩ T i . Each T i T_i T i is a template of Definition 9.3: it is a union of N i N_i N i lattice samples of closed convex rectangles or triangles with side slopes 0 , ∞ , 1 , − 1 0,\infty,1,-1 0 , ∞ , 1 , − 1 , each of sup-norm diameter at most s i s_i s i , where
diam ∞ T i ≤ n i , n i ≥ C t p l N i ( s i + 1 ) , dist ∞ ( T i , Z ) > 4 D 0 s i . \operatorname{diam}_{\infty}T_i\le n_i,\qquad n_i\ge C_{\mathrm{tpl}}N_i(s_i+1),\qquad\operatorname{dist}_{\infty}(T_i,Z)>4D_0s_i. diam ∞ T i ≤ n i , n i ≥ C tpl N i ( s i + 1 ) , dist ∞ ( T i , Z ) > 4 D 0 s i .
Moreover L i = ⌊ n i 1 − ℓ ⌋ ≤ s i L_i=\lfloor n_i^{1-\ell}\rfloor\le s_i L i = ⌊ n i 1 − ℓ ⌋ ≤ s i .
The templates satisfy
dist ∞ ( T i , Z ) > 2 n i β , (186) \operatorname{dist}_{\infty}(T_i,Z)>2n_i^\beta, \tag*{(186)} dist ∞ ( T i , Z ) > 2 n i β , (186)
dist ∞ ( T i , ⋃ j < i f j = f i X j ) > 2 n i β . (187) \operatorname{dist}_{\infty}\left(T_i,\bigcup_{\substack{j<i\\f_j=f_i}}X_j\right)>2n_i^\beta. \tag*{(187)} dist ∞ T i , j < i f j = f i ⋃ X j > 2 n i β . (187)
As usual, the distance to the empty set is infinite.
The scale losses are summable:
∑ i n i − 100 ≤ C b . \sum_i n_i^{-100} \le Cb. i ∑ n i − 100 ≤ C b .
The constant C C C may depend on the fixed template constants and on n ∗ n_\ast n ∗ , but not on the domain or cut.
We prove the proposition in stages. First we construct layers with sparse connecting strips. Next we remove their same-family vertex contacts. Finally we verify separation for the entire birth templates, not merely for the smaller actual regions.
Layers and sparse strips
Fix a translated origin
o = ( 2 , 3 ) . o=(\sqrt{2},\sqrt{3}). o = ( 2 , 3 ) .
Each of o 1 , o 2 , o 1 + o 2 , o 1 − o 2 o_1,o_2,o_1+o_2,o_1-o_2 o 1 , o 2 , o 1 + o 2 , o 1 − o 2 is nonintegral. On every dyadic scale r = 2 k r=2^k r = 2 k , use the half-open cells
C k , z = o + r ( z + [ 0 , 1 ) 2 ) , z ∈ Z 2 . C_{k,z}=o+r\left(z+[0,1)^2\right),\qquad z\in\mathbb{Z}^2. C k , z = o + r ( z + [ 0 , 1 ) 2 ) , z ∈ Z 2 .
These grids are nested. Half-open cells determine indices; their closures will determine birth regions. Choose an integer C 0 C_0 C 0 sufficiently large compared with D 0 D_0 D 0 , for example C 0 > 100 ( D 0 + 1 ) C_0>100(D_0+1) C 0 > 100 ( D 0 + 1 ) , and define
Z k = { z : C k , z ∩ Z ≠ ∅ } , N k = ⋃ dist ∞ ( z , Z k ) ≤ C 0 C k , z . Z_k=\{z:C_{k,z}\cap\mathbb{Z}\ne\varnothing\},\qquad
N_k=\bigcup_{\operatorname{dist}_{\infty}(z,Z_k)\le C_0}C_{k,z}. Z k = { z : C k , z ∩ Z = ∅ } , N k = dist ∞ ( z , Z k ) ≤ C 0 ⋃ C k , z .
Here the distance in the subscript is the sup distance between integer cell indices. Passing to parents shows that N k ⊆ N k + 1 N_k\subseteq N_{k+1} N k ⊆ N k + 1 : if two child indices differ by at most C 0 C_0 C 0 in each coordinate, their parent indices also differ by at most C 0 C_0 C 0 . The sets N k N_k N k exhaust the plane, since Z ≠ ∅ \mathbb{Z}\ne\varnothing Z = ∅ and C 0 ≥ 2 C_0\ge2 C 0 ≥ 2 .
For a lower index k 0 k_0 k 0 to be fixed later, regard N k 0 N_{k_0} N k 0 as one dummy tile , labeled by the parity of k 0 − 1 k_0-1 k 0 − 1 . Its points will initially be exceptional. For k ≥ k 0 k\ge k_0 k ≥ k 0 , the layer
D k = N k + 1 ∖ N k D_k=N_{k+1}\setminus N_k D k = N k + 1 ∖ N k
is a union of cells of side r = 2 k r=2^k r = 2 k . There are at most C ∣ Z ∣ ≤ C b C|\mathbb{Z}|\le Cb C ∣ Z ∣ ≤ C b of these cells: N k + 1 N_{k+1} N k + 1 has at most ( 2 C 0 + 1 ) 2 ∣ Z ∣ (2C_0+1)^2|\mathbb{Z}| ( 2 C 0 + 1 ) 2 ∣ Z ∣ cells of side 2 r 2r 2 r , each of which has four children. The cell-index definition also gives
C 0 r ≤ dist ∞ ( x , Z ) ≤ 2 ( C 0 + 1 ) r ( x ∈ D k ‾ ) . (188) C_0r\le\operatorname{dist}_{\infty}(x,\mathbb{Z})\le2(C_0+1)r
\qquad(x\in\overline{D_k}). \tag*{(188)} C 0 r ≤ dist ∞ ( x , Z ) ≤ 2 ( C 0 + 1 ) r ( x ∈ D k ) . (188)
For the lower bound, a cell outside N k N_k N k differs from every endpoint-occupied cell by at least C 0 + 1 C_0+1 C 0 + 1 in one coordinate. For the upper bound use its parent in N k + 1 N_{k+1} N k + 1 .
The function x ↦ dist ∞ ( x , Z ) x\mapsto\operatorname{dist}_{\infty}(x,\mathbb{Z}) x ↦ dist ∞ ( x , Z ) is 1-Lipschitz. Consequently, if h ≥ k + 2 h\ge k+2 h ≥ k + 2 , then
dist ∞ ( D k ‾ , D h ‾ ) ≥ C 0 2 h − 2 ( C 0 + 1 ) 2 k ≥ C 0 − 1 2 2 h . (189) \operatorname{dist}_{\infty}(\overline{D_k},\overline{D_h})
\ge C_0 2^h-2(C_0+1)2^k
\ge\frac{C_0-1}{2}2^h. \tag*{(189)} dist ∞ ( D k , D h ) ≥ C 0 2 h − 2 ( C 0 + 1 ) 2 k ≥ 2 C 0 − 1 2 h . (189)
Thus only the same layer or a neighboring layer can occur near a region whose size is much smaller than its layer scale.
In D k D_k D k put
s k = 2 ⌊ ( 1 + δ 0 ) k ⌋ , t k = 2 ⌊ ζ k ⌋ . s_k=2^{\lfloor(1+\delta_0)k\rfloor},\qquad
t_k=2^{\lfloor\zeta k\rfloor}. s k = 2 ⌊( 1 + δ 0 ) k ⌋ , t k = 2 ⌊ ζ k ⌋ .
For sufficiently large k 0 k_0 k 0 , we have t k ∣ r ∣ s k t_k\mid r\mid s_k t k ∣ r ∣ s k and t k ≪ r ≪ s k t_k\ll r\ll s_k t k ≪ r ≪ s k , uniformly as k → ∞ k\to\infty k → ∞ . Here r r r is the layer-cell scale, s k s_k s k is the pitch used to group fragments into primary tiles, and t k t_k t k will be the width of the strips separating those tiles. The larger pitch makes the strips sparse within a layer; the r r r -cells will later supply the small pieces in each primary’s template. The fine cells of side t k t_k t k have origin o o o . Choose two residue classes modulo s k / t k s_k/t_k s k / t k , one for each coordinate. A fine cell is called a belt cell if either of its two indices lies in the corresponding selected residue class. The remaining fine cells lie in open pitch interiors, each a square between successive belt strips. For each such pitch interior, give all its fragments in D k D_k D k one primary-tile identifier and the label k m o d 2 k \bmod2 k mod 2 .
The shifts can be chosen so that few belt cells meet the layer. Indeed, the layer contains at most C b ( r / t k ) 2 Cb(r/t_k)^2 C b ( r / t k ) 2 fine cells before any shift is chosen. Under a uniform choice of the two residue classes, each is a belt cell with probability at most 2 t k / s k 2t_k/s_k 2 t k / s k . Hence some shift satisfies
# { belt cells in D k } ≤ C b r 2 s k t k ≤ C b 2 − k δ 0 / 2 . (190) \#\{\text{belt cells in }D_k\} \le Cb\frac{r^2}{s_kt_k} \le Cb\,2^{-k\delta_0/2}. \tag*{(190)} # { belt cells in D k } ≤ C b s k t k r 2 ≤ C b 2 − k δ 0 /2 . (190)
We fix such a shift in each layer. This is an averaging argument on a predetermined collection of cells; no property of the state enters it. The geometric decay in k k k absorbs any fixed power of k k k . Below, (195) will bound the number of repairs descended from one contact by just such a power, so sparse strips also control the total number of tiles created by the repairs.
Each r r r -cell meets only a bounded number of pitch interiors, so there are at most C b Cb C b primary tiles in a layer. The birth region of one primary is a union of at most
C ( s k / r + 2 ) 2 (191) C(s_k/r+2)^2 \tag*{(191)} C ( s k / r + 2 ) 2 (191)
closed rectangles of sup-norm diameter at most r r r , obtained as closures of the intersections of that pitch interior with the r r r -cells of the layer. Its whole sup-norm diameter is at most s k s_k s k . Distinct primaries in the same layer are separated by a belt strip of width at least t k t_k t k . Primaries in adjacent layers have opposite labels; primaries of the same label in different layers satisfy (189) . Figure 3 shows why a primary can have several components even though it occupies a single pitch interior.
Figure 3. A schematic portion of one ambient layer, not to scale. Dashed lines mark the r r r -cells. The thick square is one pitch cell; its interior after removing the belt strips has side s k − t k s_k-t_k s k − t k . All blue fragments in that interior share the primary identifier P P P , even when disconnected. The neighboring fragment has identifier Q Q Q . Both primaries have family label k m o d 2 k \bmod2 k mod 2 ; the orange belt cells are filled and labeled in the next step. The drawing concerns the ambient layer D k D_k D k , before intersection with the physical set A A A .
Filling the belts
The remaining construction colors the belt cells while making every positive-length interface between different tile identifiers join opposite labels. Point contacts will be dealt with separately.
Adjacent layer fine meshes have side ratio either 1 or 2. They have a common translated dyadic origin, including after the pitch shifts, which were by multiples of their fine-cell sides. Divide a side of a belt cell at any corner of an opposing cell. A larger side can be divided only at its midpoint. Along each resulting elementary segment, the opposing region is either one primary or dummy tile, or one elementary segment of another belt cell. A layer boundary cannot change in the interior of such a segment: layer edges lie on the coarser dyadic grids.
Join the center of each belt cell to the endpoints of its elementary segments. This makes a fan of at most eight triangles, with edges of slopes 0, ∞ \infty ∞ , 1, − 1 -1 − 1 . A triangle facing a primary or dummy tile receives the opposite label. On a segment shared by two belt cells, assign any opposite pair of labels to its two incident triangles, consistently on both sides. Within each belt cell merge each cyclic run of consecutive triangles with the same label into one tile identifier. Distinct runs remain distinct identifiers; if all labels agree, the whole cell is one tile.
Every positive-length interface between distinct identifiers now joins opposite labels. Across a cell side this follows from the assignment; inside a fan it follows from merging equal-label neighbors. Primaries were already separated in the same layer, and adjacent-layer primaries have opposite labels. Thus a same-label contact between distinct tiles can only be a point, and every such contact involves a belt cell.
Mark the center, the four corners, and the four side midpoints of every belt cell. Some midpoint marks are unnecessary for its fan, but adding them simplifies the recursion. Deduplicate coincident marks, assigning a mark v v v the scale S v S_v S v equal to the smallest side length of a belt cell that marked it. There are at most nine times as many initial marks as belt cells.
Lemma 11.3 (Isolated stars of the initial mesh). There is an absolute constant a 0 > 0 a_0 > 0 a 0 > 0 , independent of the layer and the chosen shifts, such that, on taking k 0 k_0 k 0 sufficiently large:
Distinct marks v , w v,w v , w satisfy ∥ v − w ∥ ∞ ≥ a 0 max ( S v , S w ) \lVert v-w\rVert_\infty\ge a_0 \max(S_v,S_w) ∥ v − w ∥ ∞ ≥ a 0 max ( S v , S w ) .
In the square v + [ − a 0 S v , a 0 S v ] 2 v+[-a_0S_v,a_0S_v]^2 v + [ − a 0 S v , a 0 S v ] 2 , all active boundaries are straight rays from v v v in the eight axis and diagonal directions. Each sector between consecutive active rays has one tile identifier, and consecutive sectors have opposite labels. If there is no active ray, the square is in one tile.
An active boundary here means an interface of distinct identifiers; seams removed by a merge are not boundaries.
Proof. Consider a belt cell of side t = t k t=t_k t = t k . In its 10 t 10t 10 t -neighborhood only its own and adjacent layers can occur, by (189) and t k / 2 k → 0 t_k/2^k \to0 t k / 2 k → 0 . All fine-cell sides there are t / 2 t/2 t /2 , t t t , or 2 t 2t 2 t . Cell corners, fan centers, and side midpoints therefore lie on the affine mesh o + ( t / 4 ) Z 2 o+(t/4)\mathbb{Z}^2 o + ( t /4 ) Z 2 . All active lines have one of the four allowed slopes and intercepts on this mesh. Marks have local scales comparable to t t t . Distinct marks have distance at least t / 4 t/4 t /4 , and a supporting line that does not contain a given mark is at sup distance at least t / 8 t/8 t /8 from it. The same bounds apply to the nearest other endpoint of an incident segment. Choosing a 0 a_0 a 0 small gives both assertions locally. Apply this argument at the larger scale for a pair of nearby marks; pairs outside the local neighborhood already satisfy the asserted separation.
The preceding coloring shows that two sectors separated by an active ray have opposite labels. Coincident boundary segments or inactive seams are counted only once, so this describes the actual tile regions near the mark. ∴
The purpose of the next construction is to make the birth template of each newly created tile avoid the final actual sets of earlier tiles of the same label. Removing points only from the new tile would not provide that property. We remove a square from every old identifier incident with the mark before creating its replacement.
Choose a fixed stopping scale S ∗ S_\ast S ∗ sufficiently large that, for every S ≥ S ∗ S \ge S_\ast S ≥ S ∗ , the dyadic halfside
d ( S ) = 2 ⌊ ρ 0 log 2 S ⌋ (192) d(S) = 2^{\lfloor\rho_0 \log_2 S \rfloor} \tag*{(192)} d ( S ) = 2 ⌊ ρ 0 l o g 2 S ⌋ (192)
satisfies
1 2 S ρ 0 ≤ d ( S ) ≤ S ρ 0 , d ( S ) ≤ a 0 1000 S . (193) \frac{1}{2}S^{\rho_0} \le d(S) \le S^{\rho_0}, \qquad d(S) \le\frac{a_0}{1000}S. \tag*{(193)} 2 1 S ρ 0 ≤ d ( S ) ≤ S ρ 0 , d ( S ) ≤ 1000 a 0 S . (193)
We will increase S ∗ S_\ast S ∗ later to accommodate the collar estimate. Choose k 0 k_0 k 0 so that all initial mark scales are at least S ∗ S_\ast S ∗ . At each generation perform the following operations simultaneously at every active mark ( v , S ) (v,S) ( v , S ) :
Remove the closed square Q v = v + [ − d ( S ) , d ( S ) ] 2 Q_v = v + [-d(S),d(S)]^2 Q v = v + [ − d ( S ) , d ( S ) ] 2 from every old tile identifier.
If d ( S ) < S ∗ d(S) < S_\ast d ( S ) < S ∗ , leave its interior unassigned and declare it a terminal exceptional square.
Otherwise, continue the incident active rays through the square to its center. In each resulting sector give the new region the label opposite to that of the corresponding exterior sector, with a new identifier for each sector. If there are no rays, use one opposite-label square. Mark the center, corners, and side midpoints of Q v Q_v Q v , all at scale d ( S ) d(S) d ( S ) , for the next generation.
A sector with angle exceeding π \pi π need not be convex; it is a union of at most eight of the triangles from the center to side corners and midpoints. Thus all replacement birth regions retain the required finite description. Every old ray meets the square perimeter at a corner or side midpoint. Figure 4 illustrates the label reversal and the marks used at the next generation.
Figure 4. A four-sector example of the repair. The square around the contact is removed from every old tile, and its new sectors receive the opposite labels. Positive-length interfaces still join opposite labels. Any same-label contacts involving the new tiles occur among the nine marked points; the next, smaller removal separates them. The proof also allows any configuration of the eight permitted ray directions with opposite labels in consecutive sectors.
We now verify that this procedure continues with uniform geometric constants. In particular, neither the separation constant nor the isolation radius is allowed to deteriorate with the number of generations.
Lemma 11.4 (Uniform repair induction). For a sufficiently small fixed choice of a 0 a_0 a 0 and the corresponding threshold S ∗ S_* S ∗ , every active mark ( v , S ) (v,S) ( v , S ) at every generation has a terminal-square-free isolated star v + [ − a 0 S , a 0 S ] 2 v + [-a_0S,a_0S]^2 v + [ − a 0 S , a 0 S ] 2 with the properties of Lemma 11.3. Distinct active marks satisfy the same separation inequality. The simultaneous removal squares are disjoint. Each replacement has opposite labels across every positive-length interface of distinct identifiers, and its same-label contacts with old remnants or peer replacements occur only at marks of the next generation. Every descendant mark and every descendant birth region of a mark ( v , S ) (v,S) ( v , S ) lies within sup distance 2 d ( S ) 2d(S) 2 d ( S ) of v v v . Each branch terminates after finitely many generations.
Proof. Suppose the assertions hold at one generation. By (193) , the squares of radius 6 d ( S ) 6d(S) 6 d ( S ) are contained in their parent stars. They are also disjoint from all other current removal squares. Indeed for parent marks ( v , S ) , ( w , T ) (v,S),(w,T) ( v , S ) , ( w , T ) ,
∥ v − w ∥ ∞ ≥ a 0 max ( S , T ) , 6 d ( S ) + d ( T ) ≤ 7 a 0 1000 max ( S , T ) . \lVert v-w\rVert_\infty\ge a_0 \max(S,T), \qquad6d(S)+d(T) \le\frac{7a_0}{1000}\max(S,T). ∥ v − w ∥ ∞ ≥ a 0 max ( S , T ) , 6 d ( S ) + d ( T ) ≤ 1000 7 a 0 max ( S , T ) .
Thus each modification sees only its parent’s radial boundaries.
Across a new perimeter segment away from ray hits, the new interior label was chosen opposite to the exterior label. Across an interior ray, the two labels remain opposite because the two exterior labels were opposite. All other positive-length interfaces are unchanged. Contacts not lying in the relative interior of one of these segments are among the center, corners, or side midpoints of the new square. This proves the coloring and contact assertions.
Normalize one removal square to [ − 1 , 1 ] 2 [-1,1]^2 [ − 1 , 1 ] 2 . Its post-replacement boundaries are subsets of the original eight radial rays together with the four lines supporting this square. The possible new marks are the nine points of { − 1 , 0 , 1 } 2 \{-1,0,1\}^2 { − 1 , 0 , 1 } 2 . Every nonincident supporting line stays at a fixed positive distance from a mark, and every other endpoint stays at distance at least one. Thus a fixed sufficiently small a 0 a_0 a 0 gives an isolated radial star at each child, on the child’s scale d ( S ) d(S) d ( S ) . This is the same finite line configuration at every generation, so no iteration of a shrinking constant is involved.
Two children of the same parent are at least d ( S ) d(S) d ( S ) apart. For children of different parents their separation is at least
a 0 max ( S , T ) − d ( S ) − d ( T ) ≥ a 0 2 max ( S , T ) , a_0\max(S,T)-d(S)-d(T) \ge\frac{a_0}{2}\max(S,T), a 0 max ( S , T ) − d ( S ) − d ( T ) ≥ 2 a 0 max ( S , T ) ,
which is larger than a 0 max ( d ( S ) , d ( T ) ) a_0\max(d(S),d(T)) a 0 max ( d ( S ) , d ( T )) by (193) . Their isolated-star squares therefore satisfy the original separation invariant as well.
The child stars lie inside the parent star. Consequently they avoid all terminal squares from earlier generations. A terminal square created at another parent in the current generation is excluded by the same cross-parent distance estimate. For a direct statement covering all later generations, each successive child displacement is at most the preceding removal radius, and subsequent radii shrink by the fixed factor at most a 0 / 1000 a_0/1000 a 0 /1000 . Their sum, including the radius of the final descendant birth square, is less than 2 d ( S ) 2d(S) 2 d ( S ) . Subtrees of distinct parents are therefore separated by the preceding inequalities, even if one subtree has already terminated. This proves the asserted terminal-square avoidance and descendant bound.
Finally, as long as a branch continues, its successive scales satisfy S j + 1 = d ( S j ) ≤ S j ρ 0 S_{j+1}=d(S_j)\le S_j^{\rho_0} S j + 1 = d ( S j ) ≤ S j ρ 0 with ρ 0 < 1 \rho_0<1 ρ 0 < 1 . After finitely many steps the computed next halfside is below S ∗ S_* S ∗ , and that removal is terminal. This completes the induction. □
All geometric edges avoid lattice sites. Initially their vertices are in o + Z 2 o+\mathbb{Z}^2 o + Z 2 because r , s k , t k r,s_k,t_k r , s k , t k are dyadic integers, and the halfsizes and midpoints used are integral. In the recursion each new center, corner, and midpoint is obtained by adding an integer vector to the preceding center; the halfside d ( S ) d(S) d ( S ) is an integer. Enlarge S ∗ S_\ast S ∗ once so that a terminal halfside produced from S ≥ S ∗ S \ge S_\ast S ≥ S ∗ is still at least two. Every supporting line consequently has equation
x 1 = o 1 + m , x 2 = o 2 + m , x 1 + x 2 = o 1 + o 2 + m , or x 1 − x 2 = o 1 − o 2 + m , m ∈ Z . x_1 = o_1 + m,\qquad x_2 = o_2 + m,\qquad x_1 + x_2 = o_1 + o_2 + m,\qquad\text{or}\qquad x_1 - x_2 = o_1 - o_2 + m,\qquad m \in\mathbb{Z}. x 1 = o 1 + m , x 2 = o 2 + m , x 1 + x 2 = o 1 + o 2 + m , or x 1 − x 2 = o 1 − o 2 + m , m ∈ Z .
None contains a point of Z 2 \mathbb{Z}^2 Z 2 . We may therefore use open actual tile regions and closed birth regions without any convention for assigning a lattice site on an interface. The final open tile regions, the unaltered part of the dummy region, and terminal-square interiors partition all lattice sites.
Separation from earlier actual regions
Order tile identifiers as follows: all primaries first, all initial belt tiles second, and then the replacement tiles by their generation of birth. Ties within each class can be broken arbitrarily. The dummy tile is excluded from this order. Primaries already have the required same-label separation from other primaries. The next lemma handles all remaining identifiers and explains why the order uses actual earlier regions.
Lemma 11.5 (Birth-template separation). There is a fixed c 1 > 0 c_1 > 0 c 1 > 0 such that the following holds. Let B B B be the closed birth region of an initial belt tile of side scale u = t k u = t_k u = t k , or of a replacement tile whose removal square has halfside u u u . Then its distance from the final actual region of every earlier or peer identifier of the same label is at least c 1 u 0 c_1u^0 c 1 u 0 . A peer means another initial belt tile, or another replacement born at the same generation, respectively.
Proof. At the birth of an initial belt tile, compare its closure with the primary and belt closures at that time. At the birth of a replacement, compare it with the old remnants after that generation’s removal squares have been cut out, and with the peer replacements. Each final actual region is a subset of the corresponding compared region. In particular an ancestor is compared after its square has been removed; its original birth region need not be disjoint from the new one.
Restrict attention to a closed box obtained by enlarging the tile’s cell or removal square by 2 u 2u 2 u in each direction. Points outside this box are at distance at least 2 u 2u 2 u from the birth region. Translate by its cell corner, or by its removal center, and rescale lengths by u u u . Only finitely many local pairs of closed regions can arise:
For belts, the nearby active lines and endpoints lie on the affine quarter mesh, with their four prescribed slopes. In a bounded box there are only finitely many such lines and endpoints. The local closures are unions of faces of their arrangement; allowing all possible identifier groupings still leaves only finitely many pairs of unions. We classify only the restrictions to this box: disconnected pieces of an identifier outside it do not change the local pattern.
For a replacement, the enlarged box lies in the isolated star of its parent, by (193) . It sees only the old radial layout and the new square and sectors. These lie on a fixed finite arrangement in the rescaled coordinates. Other parents’ simultaneous modifications do not enter this box.
Thus there is a common positive scale for the isolation neighborhoods used in all these comparisons. The two compared closures of the same label have no positive-length interface. Their intersections, if any, are contact marks by the belt construction or Lemma 11.4. At a belt contact the mark scale is comparable with u u u (neighboring belt scales differ by at most two); at a replacement contact it is u u u . Choose disjoint open contact squares of radius λ u \lambda u λ u inside the isolated stars, for a fixed sufficiently small λ > 0 \lambda> 0 λ > 0 .
First consider pairs of points ( x , y ) (x,y) ( x , y ) in the two compared closures that do not both belong to the same open contact square. This condition specifies a closed subset of the compact product of the two local closures. On it the distance ∥ x − y ∥ ∞ \lVert x-y\rVert_\infty ∥ x − y ∥ ∞ has a positive minimum: if the minimum were zero, x = y x=y x = y would be a common contact, and both points would belong to its open contact square. Since the list of rescaled patterns is finite, the minimum is uniformly at least c 2 u c_2u c 2 u whenever this subset is nonempty.
It remains to consider x , y x,y x , y in one contact star centered at v v v . Inside that star each closure is a union of closed radial sectors. Their direction sets are disjoint. A shared direction would give a shared ray segment, contrary to the absence of positive-length same-label contacts. Their boundary directions are among the eight axis and diagonal directions, so the angle between their direction sets is at least π / 4 \pi/4 π /4 . Elementary Euclidean geometry, followed by comparison of Euclidean and sup norms, gives
∥ x − y ∥ ∞ ≥ c 3 max { ∥ x − v ∥ ∞ , ∥ y − v ∥ ∞ } . (194) \lVert x-y\rVert_\infty\ge c_3\max\{\lVert x-v\rVert_\infty,\lVert y-v\rVert_\infty\}. \tag*{(194)} ∥ x − y ∥ ∞ ≥ c 3 max {∥ x − v ∥ ∞ , ∥ y − v ∥ ∞ } . (194)
For example, the squared Euclidean distance between radial vectors of lengths a , b a,b a , b and angle θ ≥ π / 4 \theta\ge\pi/4 θ ≥ π /4 is ( a − b ) 2 + 2 a b ( 1 − cos θ ) (a-b)^2+2ab(1-\cos\theta) ( a − b ) 2 + 2 ab ( 1 − cos θ ) , which bounds a fixed multiple of max ( a , b ) 2 \max(a,b)^2 max ( a , b ) 2 .
At the immediately following trim, the compared old or peer identifier loses a square about v v v of radius at least c 4 u ρ 0 c_4u^{\rho_0} c 4 u ρ 0 , by (192) and comparability of mark scales. This removal also occurs if the square is terminal. That identifier only shrinks afterward. Thus a point y y y in its final actual region has ∥ y − v ∥ ∞ ≥ c 4 u ρ 0 \lVert y-v\rVert_\infty\ge c_4u^{\rho_0} ∥ y − v ∥ ∞ ≥ c 4 u ρ 0 , and (194) supplies the required lower bound for pairs inside the contact star. Together with the preceding compactness estimate and the exterior-of-box estimate this proves the lemma.
The lemma compares the entire new birth region with an older actual region. Later deletions from the new tile are irrelevant to this estimate. This is the form needed for applying the collar estimate to its untrimmed template and then discarding part of that template.
Counting exceptional sites and verifying the templates
Let an initial mark have scale S S S . Along a branch, log S j ≤ ρ 0 j log S \log S_j\le\rho_0^j\log S log S j ≤ ρ 0 j log S until termination. Its depth is therefore at most
C + C log log ( e e + S ) . C+C\log\log(e^e+S). C + C log log ( e e + S ) .
There are at most nine children per mark. Consequently the number of marks and replacements descended from this initial mark is at most
C ( log ( S + 2 ) ) C . (195) C(\log(S+2))^C. \tag*{(195)} C ( log ( S + 2 ) ) C . (195)
The constants are fixed; their magnitude is immaterial for a size-independent area bound. The scale of a mark initially belonging to layer k k k is comparable with t k t_k t k , and hence its logarithm is at most C ( k + 1 ) C(k+1) C ( k + 1 ) . By (190) , the total number of belt tiles, marks, and replacements is bounded by
C b ∑ k ≥ k 0 2 − k δ 0 / 2 ( k + 1 ) C ≤ C ′ b . (196) Cb\sum_{k\ge k_0}2^{-k\delta_0/2}(k+1)^C\le C'b. \tag*{(196)} C b k ≥ k 0 ∑ 2 − k δ 0 /2 ( k + 1 ) C ≤ C ′ b . (196)
In particular this total is finite, even before restricting the construction to the finite domain.
Each terminal square has halfside below the fixed S ∗ S_* S ∗ and therefore contains at most C S ∗ 2 CS_*^2 C S ∗ 2 lattice sites. The dummy region has at most C ∣ Z ∣ C|Z| C ∣ Z ∣ cells of the fixed side 2 k 0 2^{k_0} 2 k 0 and hence at most C ′ b C'b C ′ b lattice sites. Let D D D be the sites of A A A that remain in the dummy identifier or lie in terminal squares. Sites overwritten by a replacement are no longer counted as dummy sites. Equations (195) and (196) give
∣ D ∣ ≤ C b . (197) |D|\le Cb. \tag*{(197)} ∣ D ∣ ≤ C b . (197)
This counts ambient sites and then intersects with A A A . Missing sites, holes, thin parts, and disconnected components of Λ \Lambda Λ can only reduce the count.
We now assign scanner scales to the birth templates. Let T = B ∩ Z 2 T = \mathcal{B} \cap\mathbb{Z}^2 T = B ∩ Z 2 for a birth region B \mathcal{B} B . For a primary in layer k k k , take
s 0 = r = 2 k , n = ⌊ C P r 1 + 2 δ 0 ⌋ . (198) s_0 = r = 2^k, \qquad n = \left\lfloor C_P r^{1+2\delta_0}\right\rfloor. \tag*{(198)} s 0 = r = 2 k , n = ⌊ C P r 1 + 2 δ 0 ⌋ . (198)
By (191) , it has at most N 0 ≤ C ( s k / r + 2 ) 2 ≤ C r 2 δ 0 N_0 \le C(s_k/r+2)^2 \le Cr^{2\delta_0} N 0 ≤ C ( s k / r + 2 ) 2 ≤ C r 2 δ 0 rectangular pieces, each of sup-norm diameter at most s 0 s_0 s 0 . Choosing C P C_P C P large ensures
n ≥ C t p l N 0 ( s 0 + 1 ) , diam ∞ T ≤ s k ≤ n . n \ge C_{\mathrm{tpl}}N_0(s_0+1), \qquad\operatorname{diam}_{\infty} T \le s_k \le n. n ≥ C tpl N 0 ( s 0 + 1 ) , diam ∞ T ≤ s k ≤ n .
The birth template has endpoint distance at least C 0 r C_0r C 0 r , so the safe clearance in Definition 9.3 follows from the choice of C 0 C_0 C 0 . The exponent inequalities give, uniformly over primaries,
L = ⌊ n 1 − ℓ ⌋ = o ( r ) , n β = o ( t k ) , n β = o ( r ) . (199) L = \left\lfloor n^{1-\ell}\right\rfloor= o(r), \qquad n^\beta= o(t_k), \qquad n^\beta= o(r). \tag*{(199)} L = ⌊ n 1 − ℓ ⌋ = o ( r ) , n β = o ( t k ) , n β = o ( r ) . (199)
For a belt tile take u = t k u=t_k u = t k , s 0 = u s_0=u s 0 = u , and n = ⌈ C B u ⌉ n=\lceil C_Bu\rceil n = ⌈ C B u ⌉ . It is a union of at most eight of the closed fan triangles. For a replacement whose removal halfside is u u u , take s 0 = 2 u s_0=2u s 0 = 2 u and n = ⌈ C B u ⌉ n=\lceil C_Bu\rceil n = ⌈ C B u ⌉ . Subdivision into the triangles from the center to corners and midpoints again uses at most eight pieces, including for a wide sector or a homogeneous square. Choose C B C_B C B large enough for all of these templates to satisfy n ≥ C t p l N 0 ( s 0 + 1 ) n \ge C_{\mathrm{tpl}}N_0(s_0+1) n ≥ C tpl N 0 ( s 0 + 1 ) and diam ∞ T ≤ n \operatorname{diam}_{\infty} T \le n diam ∞ T ≤ n . In both cases L = o ( u ) L=o(u) L = o ( u ) .
Their cut clearance remains much larger than their size. An initial belt cell in D k D_k D k has endpoint distance at least C 0 r C_0r C 0 r . A mark on its closure has the same lower bound. By Lemma 11.4, every descendant lies within 2 d ( S ) ≤ 2 t k ρ 0 = o ( t k ) 2d(S) \le2t_k^{\rho_0}=o(t_k) 2 d ( S ) ≤ 2 t k ρ 0 = o ( t k ) of that mark. After increasing k 0 k_0 k 0 , all its descendant birth templates therefore have endpoint distance at least ( C 0 − 1 ) r (C_0-1)r ( C 0 − 1 ) r . This also covers replacements extending into the dummy region. Since their side scales are at most 2 t k = o ( r ) 2t_k=o(r) 2 t k = o ( r ) , their endpoint distance exceeds both 4 D 0 s 0 4D_0s_0 4 D 0 s 0 and 2 n β 2n^\beta 2 n β .
These checks establish the exact geometric hypotheses of Lemma 9.4. In particular, for every birth template, its dilated layers up to L L L have the stipulated row and perimeter bounds, and the safe-box estimate yields the core and shell entropy bounds needed by Proposition 9.6. The verification uses the finite union of convex pieces; no assertion that a primary, a sector run, or its intersection with A A A is a rectangle is needed.
For clarity, the relevant thresholds can be fixed in the following order. First fix C 0 C_0 C 0 , C P C_P C P , C B C_B C B and the absolute isolation constant. Next increase S ∗ S_* S ∗ until (193) holds, all belt and replacement scanner scales are at least n ∗ n_* n ∗ , and
c 1 u ρ 0 > 2 ⌈ C B u ⌉ β ( u ≥ S ∗ ) . (200) c_1u^{\rho_0} > 2\lceil C_Bu\rceil^\beta\qquad(u\ge S_*). \tag*{(200)} c 1 u ρ 0 > 2 ⌈ C B u ⌉ β ( u ≥ S ∗ ) . (200)
This is possible because ρ 0 > β \rho_0>\beta ρ 0 > β . Finally increase k 0 k_0 k 0 to ensure that initial belt scales exceed S ∗ S_* S ∗ , that all primary scales exceed n ∗ n_* n ∗ , and that all the uniform large-scale inequalities just used hold. For primaries this includes their same-layer gap t k > 2 n β t_k>2n^\beta t k > 2 n β , their nonadjacent-layer gaps, and (199) . Floors and ceilings only change fixed multiplicative constants.
We can now finish the geometric proposition. Retain just identifiers whose final actual regions meet A A A , and let X i X_i X i be those intersections, ordered as above. There are finitely many, since these nonempty sets are pairwise disjoint subsets of a finite set. They partition A ∖ D A\setminus D A ∖ D , and each lies in its birth template. Equations (188) , (199) , and the descendant clearance prove (186) . For primaries, earlier same-label primaries are separated by t k t_k t k in the same layer or by (189) in other layers. For belts and replacements, Lemma 11.5 and (200) prove (187) . Restricting an older actual region to A A A preserves these lower bounds.
There are at most C b Cb C b primaries per layer, and their scales satisfy n ≥ c 2 ( 1 + 2 δ 0 ) k n \ge c2^{(1+2\delta_0)k} n ≥ c 2 ( 1 + 2 δ 0 ) k . Their error sum is therefore bounded by
C b ∑ k ≥ k 0 2 − 100 ( 1 + 2 δ 0 ) k ≤ C ′ b . Cb\sum_{k\ge k_0}2^{-100(1+2\delta_0)k}\le C'b. C b k ≥ k 0 ∑ 2 − 100 ( 1 + 2 δ 0 ) k ≤ C ′ b .
The total number of other tiles is O ( b ) O(b) O ( b ) by (196) , and each has n ≥ 1 n\ge1 n ≥ 1 . Their error sum is also O ( b ) O(b) O ( b ) . This proves every assertion of Proposition 11.2.
Proof of the area law
Proof of Theorem 1.1. The empty domain and the empty or full region have zero entropy. Put b = ∣ ∂ Λ A ∣ b=|\partial\Lambda_A| b = ∣ ∂ Λ A ∣ . If b = 0 b=0 b = 0 , Lemma 2.2 gives S Ω ( A ) = 0 S_\Omega(A)=0 S Ω ( A ) = 0 .
Assume b > 0 b>0 b > 0 . Choose n ∗ n_* n ∗ large enough for Proposition 9.6 and Proposition 10.2 with M = 100 M=100 M = 100 to apply to the templates of Proposition 11.2, uniformly with the stated template bounds. Increase it so that every radius r r r supplied by amplification at scale n ≥ n ∗ n\ge n_* n ≥ n ∗ satisfies L + 2 r < n β L+2r<n^\beta L + 2 r < n β . Let D , X i , T i , n i , f i D,X_i,T_i,n_i,f_i D , X i , T i , n i , f i be the resulting geometric decomposition, and put
S i = A ∩ ( T i + [ − L i , L i ] Z 2 ) , J i = ( Λ ∖ A ) ∪ ⋃ j < i f j = f i X j . S_i=A\cap\left(T_i+[-L_i,L_i]_{\mathbb Z}^2\right),\qquad
J_i=(\Lambda\setminus A)\cup\bigcup_{\substack{j<i\\ f_j=f_i}}X_j. S i = A ∩ ( T i + [ − L i , L i ] Z 2 ) , J i = ( Λ ∖ A ) ∪ j < i f j = f i ⋃ X j .
Here [ − L i , L i ] Z 2 [-L_i,L_i]_{\mathbb Z}^2 [ − L i , L i ] Z 2 denotes the integer square. For each i i i , let r i r_i r i be the radius supplied by amplification, using the size, boundary, and information bounds from Proposition 9.6. The resulting mutual-information estimate applies to A ∩ T i A\cap T_i A ∩ T i against any sites outside the graph neighborhood N 2 r i Λ ( S i ) N^\Lambda_{2r_i}(S_i) N 2 r i Λ ( S i ) .
We verify this condition for the whole set J i J_i J i , rather than for its individual pieces. A graph path of length at most 2 r i 2r_i 2 r i from S i S_i S i stays within ambient distance L i + 2 r i < n i β L_i+2r_i<n_i^\beta L i + 2 r i < n i β of T i T_i T i . Equation (187) excludes every earlier same-family X j X_j X j jointly. Such a path also cannot reach Λ ∖ A \Lambda\setminus A Λ ∖ A : its first crossing of the cut would put an endpoint of a cut edge within that ambient distance of T i T_i T i , contradicting (186) . Thus
J i ⊆ Λ ∖ N 2 r i Λ ( S i ) . J_i\subseteq\Lambda\setminus N^\Lambda_{2r_i}(S_i). J i ⊆ Λ ∖ N 2 r i Λ ( S i ) .
Proposition 10.2 and monotonicity under discarding part of its first system yield
I Ω ( X i : J i ) ≤ I Ω ( A ∩ T i : J i ) ≤ C n i − 100 . I_\Omega(X_i:J_i)\le I_\Omega(A\cap T_i:J_i)\le Cn_i^{-100}. I Ω ( X i : J i ) ≤ I Ω ( A ∩ T i : J i ) ≤ C n i − 100 .
These estimates all concern the same original state Ω \Omega Ω , although the auxiliary construction used to prove each estimate may differ.
Apply Lemma 11.1 to the two labels. Since each site has dimension q q q ,
S Ω ( A ) ≤ ∣ D ∣ log q + C 2 ∑ i n i − 100 ≤ C ′ b . S_\Omega(A)\le|D|\log q+\frac{C}{2}\sum_i n_i^{-100}\le C'b. S Ω ( A ) ≤ ∣ D ∣ log q + 2 C i ∑ n i − 100 ≤ C ′ b .
Every choice of threshold and every constant in this proof depends only on the fixed local dimension, interaction range and norm bound, and spectral gap. None depends on the size, shape, connectedness, or holes of Λ \Lambda Λ , or on the choice of A A A . This proves the theorem.