This paper establishes the existence of a spectral gap in PVBS models across all species numbers and dimensions for small anisotropy, aiding the classification of quantum phases.
Contribution
It provides a new proof of spectral gap existence for PVBS models in any dimension and species number using a finite-size criterion, extending previous results.
Findings
01
Spectral gap proven for all species and dimensions in PVBS models
02
Uses finite-size criterion instead of martingale method
03
Results support phase classification of quantum spin models
Abstract
Product vacua with boundary states (PVBS) are cousins of the Heisenberg XXZ spin model and feature n particle species on Zd. The PVBS models were originally introduced as toy models for the classification of ground state phases. A crucial ingredient for this classification is the existence of a spectral gap above the ground state sector. In this work, we derive a spectral gap for PVBS models at arbitrary species number n and in arbitrary dimension d in the perturbative regime of small anisotropy parameters. Instead of using the more common martingale method, the proof verifies a finite-size criterion in the spirit of Knabe.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Gapped PVBS models for all species numbers and dimensions
Marius Lemm
*Department of Mathematics
Harvard University
Cambridge, MA 02138, USA*
Bruno Nachtergaele
*Department of Mathematics and Center for Quantum Mathematics and Physics
University of California, Davis
Davis, CA 95616, USA*
(June 3, 2019)
Abstract
Product vacua with boundary states (PVBS) are cousins of the Heisenberg XXZ spin model and feature n particle species on Zd. The PVBS models were originally introduced as toy models for the classification of ground state phases. A crucial ingredient for this classification is the existence of a spectral gap above the ground state sector. In this work, we derive a spectral gap for PVBS models at arbitrary species number n and in arbitrary dimension d in the perturbative regime of small anisotropy parameters. Instead of using the more common martingale method, the proof verifies a finite-size criterion in the spirit of Knabe.
1 Introduction
This paper concerns a family of frustration-free quantum spin models called “Product Vacua with Boundary States” (PVBS). These models were first introduced in [4] in one dimension and subsequently generalized to d dimensions in [2]. The PVBS models can be seen as variants of the Heisenberg XXZ models in an external magnetic field. A remarkable feature of these is that, for appropriate parameter values, their gapped ground state phases can be explicitly classified in terms of edge-localized particles [2, 4, 6].
Our goal in this paper is to prove that the PVBS models exhibit a spectral gap above the ground state for arbitrary species number and arbitrary dimension, in a perturbative regime with small values of the anisotropy parameters, which also decrease from species to species. We review previous results below, which are restricted to species numbers n≤2 in dimensions d≥2 [5, 6]. Instead of using the more common martingale method [18], our proof is based on finite-size criteria à la Knabe [10, 12, 13, 15], whose original criterion was inspired by the seminal proof that the AKLT chain is gapped [1]. Specifically, we build on a recent generalization of these criteria to arbitrary dimensions d [13]. This is the first time that such finite-size criteria could be verified in a concrete model for dimensions d>1. The advantage of the more coarse method of finite-size criteria is that it handles the increase of complexity coming from large n and d seamlessly. A disadvantage is that, by design, the method requires a sufficiently large finite-size gap which currently limits us to the regime of small anisotropy parameters (see also [14] where the same phenomenon occurs in a one-dimensional context). The method does quantify what “small” means here; see (1.4) below.
We focus on the case of periodic boundary conditions for simplicity, and we interpret the result as a bulk gap. We expect that the methods developed here can be extended to derive a spectral gap for systems with free boundary conditions along sufficiently nice boundary shapes, like boxes; see Remark 1.3. We emphasize that the issue of boundary conditions is subtle for PVBS models, since they are known to exhibit weakly excited edge modes for certain half-plane geometries [6].
For motivation and background concerning spectral gaps, we refer to [15, 19]. Here we just mention two facts: (1) Spectral gaps are fundamental for distinguishing quantum phases of matter via Hastings’ spectral flow (also called quasi-adiabatic evolution) [11], see also [3, 19]. (2) The stability of spectral gaps under various “local” perturbations of the Hamiltonian has been a topic of interest recently [7, 9, 16, 17], and it is of course beneficial to have a wide net of gapped Hamiltonians available for further stability analysis.
1.1 Setup
The PVBS models are defined in terms of various parameters as follows. As the underlying graph, we take Zd, respectively a box ΛL=((−L,L]∩Z)d with periodic boundary conditions. The PVBS model with species number n≥1 is then defined on the Hilbert space
[TABLE]
Its local interactions are defined in terms of a collection of n×d positive anisotropy parameters (one for every species and every direction), which we denote by {λi(k)}1≤i≤n1≤k≤d. For a direction 1≤k≤d, the local interaction term is given by
[TABLE]
where the vectors ϕ^i(k),ϕ^ij(k)∈Cn+1⊗Cn+1 are the normalized versions of
[TABLE]
with 1≤i<j≤n and 1≤k≤d. (We remark that h(k) is itself a projection.) The full Hamiltonian HL is defined by placing an interaction h(k) at every oriented edge in direction k of the periodic box ΛL, with the convention that edges are oriented in the direction of the canonical basis vectorse1,…,ed. The Hamiltonian thus reads
[TABLE]
(We recall that we are using periodic boundary conditions.) The Hamiltonian HL is frustration-free, which can be phrased as
[TABLE]
Indeed, notice that the tensor power ∣0⟩⊗ΛL is a ground state. For connected sets with free boundary conditions, the ground states are labeled by subsets M⊂{1,…,N} and are given in [2]. Our main object of interest is the spectral gapγL of HL, which is defined as the smallest positive eigenvalue of HL.
In summary, the frustration-free PVBS models are defined in terms of the following parameters:
A central question concerning the PVBS models is whether they exhibit a spectral gap above the ground state, which we will define to mean infLγL>0. This is expected to hold at least as long as there is sufficient anisotropy (which translates to λi(k)=1 for 1≤i≤n and 1≤k≤d). Under this assumption, a spectral gap has been established for the following parameter regimes
In all these works, the spectral gap is derived via the martingale method [18]. From the works [2, 5], it appears that the martingale method becomes rather cumbersome in dimensions d≥2, especially for higher species numbers n. Instead, we use finite-size criteria which are more flexible, but also more coarse, and so the result only holds for small values of the anisotropy parameters in the following sense.
We shall write 0<δ<1 for the small parameter. We assume that
[TABLE]
holds for all 1≤i≤n and 1≤k≤d.
Our main result establishes a spectral gap for PVBS models in dimensions d≥2 at arbitrary species number n for sufficiently small values of δ>0.
Theorem 1.1** (Spectral gap).**
Fix two integers d≥2 and n≥1. There exists a positive constant cd,n>0 such that for all 0<δ<cd,n, the following holds. If the anisotropy parameters {λi(k)}1≤i≤n1≤k≤d satisfy (1.2), then HL is gapped, i.e.,
[TABLE]
Remark 1.2*.*
(i)
The proof of Theorem 1.1 yields explicit numerical choices for the constant cd,n. For instance, when d≥3, one can take
[TABLE]
with m=max{n1/(d−2),3d}. The choice (1.4) is far from optimal in terms of the universal constants, but it possesses the optimal scaling in m and n afforded by the proof. See (3.4) for a possible choice of c2,n.
2. (ii)
There is some flexibility regarding assumption (1.2). First, the constant 2 on both sides can be changed to a number a>0 and the only effect of this is to rescale cd,n by (a2)2. Second, the main role of (1.2) is to ensure that, for i<j, we have λj(k)/λi(k)→0 as δ→0. Replacing (1.2) by this weaker assumption also yields Theorem 1.1, but without any quantitative control on cd,n.
1.3 Comments on the proof strategy
Our proof is based on verifying a finite-size criterion for spectral gaps in the spirit of [10, 12, 13, 15]. In general a finite-size criterion says that if the Hamiltonian has a sufficiently large gap on a certain finite subsystem, then it is gapped uniformly for all system sizes. The choice of the appropriate subsystems becomes a delicate matter in higher dimensions, and we build on a recent observation [13] that there is additional freedom if one applies the operator Cauchy-Schwarz inequality in the appropriate place.
In Section 2, we present the particular finite-size criterion we use (Theorem 2.1), which is tailor-made for the application to the PVBS model. Let us explain what we mean by this. A key feature of our assumption (1.2) is that the Hamiltonian with δ=0 is a sum of commuting projections and therefore has spectral gap =1. Our result is then based on the idea that taking δ>0 amounts to a perturbation of norm ≤Cδ, which then does not close the gap (and hence verifies the finite-size criterion) for δ sufficiently small.
However, and this is the main technical problem we face, to implement this heuristic idea rigorously, it is necessary to ensure that there are no ground state degeneracies present in the finite system which are lifted by introducing δ and would thus lead to small excitation energies of O(δ), thereby spoiling the O(1) gap. Here is a simple example of this phenomenon (which is a common problem faced in degenerate perturbation theory) occurring for a pair of “frustration-free” 3×3 matrices. Set
[TABLE]
Then A has a spectral gap of 1, and ∥B−A∥=δ, but the spectral gap of B is equal to δ, i.e., small. The key fact about the finite subsystem that we use for the finite-size criterion (which we call “box on a stick”; see Section 2.1 below) is that it avoids any artificial ground state degeneracies. More precisely, all the degeneracies that occur for the box on a stick can be labeled using particle number symmetry and hence we can apply non-degenerate perturbation theory in each particle number sector. This allows us to verify the finite-size criterion for the box on a stick by the perturbative argument in the small parameter δ that was sketched above; see Section 3. (For contrast, we mention that a simple box without stick does have a large number of artificial degeneracies in each particle number sector, so the perturbative argument breaks down in that case.)
We close the introduction with a remark about a possible generalization of Theorem 1.1.
Remark 1.3* (The case of free boundary conditions).*
We expect that the argument can be generalized to derive a spectral gap with free boundary conditions on ΛL, instead of periodic ones. We mention that the key idea for this generalization is that, near the part of the boundary where one cannot fit a box on a stick into the set without losing the stick, one replaces the box by a cuboid, such that the stick still fits into ΛL. This may require rotating the stick by π/2. This change affects the combinatorics used to establish Theorem 2.1 near the boundary, but we fully expect that one still obtains a gap threshold of order m1. Finally, the resulting finite-size criterion can be verified for the “cuboid on the stick“ that one gets near the boundary, since, as we will see in proving Proposition 3.1, the existence of the stick is what is crucial to obtain a large gap of the subsystem, for sufficiently small δ>0.
2 A finite-size criterion
The main result of this section is the finite-size criterion Theorem 2.1 which holds for arbitrary frustration-free Hamiltonians defined on a periodic box ΛL⊂Zd (with directed or undirected edges).
2.1 Subsystem Hamiltonians
Given a connected subgraph G⊂Zd, let EG be the set of edges in G. We consider these sets as oriented subgraphs of Zd with the same orientation as before (i.e., edges are oriented along the canonical basis vectors). We can then define the subsystem Hamiltonian associated to G concisely as
[TABLE]
Here and in the following, we will often suppress the superscript (k) when denoting the interaction h(k), as it will be clear from the direction of the edge under consideration. I.e., we identify
[TABLE]
From now on, we fix a dimension d≥2 and a species number n≥1. The subgraphs we use for the finite-size criterion are the following Cm, which we call “box on a stick”. We set Cm=S∪Bm where S is the stick
[TABLE]
and Bm is the box of sidelength m defined by
[TABLE]
To these subsystems, we associate a frustration-free subsystem Hamiltonian HCm via Definition (2.1), and we write γCm, for its spectral gap.
2.2 The finite-size criterion
We are now ready to state the finite-size criterion which lower bounds the spectral gap of HL in terms of the spectral gap of the box on a stick, HCm.
Theorem 2.1** (Finite-size criterion).**
Let m≥4 and L≥2m+1. Then
[TABLE]
Remark 2.2*.*
(i)
This theorem functions as a finite-size criterion in the following way: If γCm>m1+m23d(1+md−2n) for some m≥4, then infLγL>0, and so HL is gapped. We will verify this condition later for δ sufficiently small.
2. (ii)
The proof of Theorem 2.1 closely follows the proof of a similar criterion just for boxes Bm⊂Zd from [13]. The key idea introduced there, which allows to extend the previous results for d∈{1,2} to arbitrary dimensions, is to employ the operator Cauchy-Schwarz inequality (2.10) to allow for more flexibility in Knabe’s original combinatorial argument [12]. Here, we follow that approach but we add the stick to the box and observe that this does not change the gap threshold significantly as long as n≪md−1, as one can see from (2.3). Adding the stick is crucial for applying the finite-size criterion to the PVBS model at hand, since, as anticipated in the introduction, the box on a stick has no accidental ground state degeneracies for the unperturbed system with δ=0.
3. (iii)
While we formulate Theorem 2.1 for the PVBS model for simplicity, the statement and proof extend verbatim to any frustration-free model defined on a periodic box ΛL⊂Zd.
In the remainder of this section, we prove Theorem 2.1
2.3 Step 1: Squaring the Hamiltonian
We introduce some convenient notation. We write EL=EΛL for the set of oriented edges in the box ΛL with periodic boundary conditions. Given two edges e,e′∈EL, we write e∼e′ if e and e′ share exactly one vertex, and we write e∼e′ if they share no vertex.
Finally, we denote the anticommutator of two operators A,B by {A,B}=AB+BA.
The first step to prove Theorem 2.1 is to square the Hamiltonian HL. Using that the local interactions h(k) are projectors (so he2=he), we obtain
[TABLE]
where we introduced
[TABLE]
2.4 Step 2: Comparing with an auxiliary operator
We define the shifted system
[TABLE]
where y−x is defined with periodic boundary conditions on ΛL. Now we introduce the auxiliary operator
[TABLE]
where we distributed the subsystem Hamiltonians across the entire box ΛL via translation, always incorporating periodic boundary conditions for ΛL.
Proposition 2.3**.**
It holds that
[TABLE]
We remark that the relevant regime to keep in mind is that of large m.
Here we defined Qx+Cm,Rx+Cm in the same way as Q,R in (2.5) above, except that the edges e,e′ are restricted to x+Cm, viewed as an oriented subgraph of Zd. We may reorganize the terms comprising the operator A as follows: We group together the following types of terms: (a) terms he, (b) terms {he,he′} with e∼e′ and (c) terms {he,he′} with e∼e′. The result is
[TABLE]
We now count how often each individual term of types (a)-(c) appears in the above sums.
\markoverwith
\ULdepth
\ULon
Type (a) terms. Modulo translations and rotations, there are only two different types of (a) terms: those labeled with edges in the e1 direction, we call this the vertical direction, and those with edges labeled in the remaining directions e2,…,ed; we call these non-vertical terms. We first count the non-vertical, i.e., we count the number of translated boxes Bm which contain a fixed edge, e2, say. This count is m(m+1)d−1. A vertical edge appears, additionally, in n−1 sticks. Since each term he≥0, these combinatorial considerations prove the operator inequality
[TABLE]
The lower bound in (2.8) already implies (2.6). Indeed, by frustration-freeness, the spectral theorem, and translation invariance, we have Hx+Cm2≥γCmHx+Cm and so
There are various basic kinds of type (b) terms {he,he′}. We recall that the e1-direction is the vertical direction for us. The first distinction we make is whether whether either of the edges e,e′ is vertical, which leads to the decomposition
[TABLE]
where Qiv contains the (b) terms {he,he′} where exactly i∈{0,1,2} of the edges e∼e′ are vertical (and we use the same convention to define the terms Qx+Cm,iv for i∈{0,1,2}).
Q0v** terms.** We first count the occurrences of each term from Q0v in the sum ∑x∈ΛLQx+Cm,0v. For this we can restrict attention to the box Bm. Modulo translations and rotations, there are two basic kinds of such terms, depending on the relative positions of e,e′, and we denote these by and , respectively. We count that there are (m−1)(m+1)d−1=(m2−1)(m+1)d−2 terms and m2(m+1)d−2 terms. A crucial observation, which we borrow from [13], is that these counts only differ by (m+1)d−2, a lower order term. The difference is controlled using the operator Cauchy-Schwarz inequality in the form
[TABLE]
which implies the bound
[TABLE]
We conclude
[TABLE]
Q1v** terms.** Next, we count the occurrences of Q1v terms (i.e., {he,he′} terms with exactly one vertical edge e or e′) in ∑x∈ΛLQx+Cm,1v. Now we need to also account for rotational degrees of freedom, and so we consider 4 subtypes of edge pairs, modulo rotations along the vertical axis: \leavevmodeto8.45pt\vboxto8.97pt\pgfpicture\makeatletter\lower-6.89046ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@beginscope\pgfsys@setlinewidth0.64pt\pgfsys@setdash0.0pt\pgfsys@roundcap\pgfsys@roundjoin\pgfsys@moveto-1.55997pt2.07996pt\pgfsys@curveto-1.42996pt1.29997pt0.0pt0.12999pt0.38998pt0.0pt\pgfsys@curveto0.0pt-0.12999pt-1.42996pt-1.29997pt-1.55997pt-2.07996pt\pgfsys@stroke\pgfsys@endscope\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto4.98045pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.04.98045pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@lineto5.69046pt-0.71pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.05.69046pt-0.71pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@moveto1.0pt0.0pt\pgfsys@curveto1.0pt0.55229pt0.55229pt1.0pt0.0pt1.0pt\pgfsys@curveto-0.55229pt1.0pt-1.0pt0.55229pt-1.0pt0.0pt\pgfsys@curveto-1.0pt-0.55229pt-0.55229pt-1.0pt0.0pt-1.0pt\pgfsys@curveto0.55229pt-1.0pt1.0pt-0.55229pt1.0pt0.0pt\pgfsys@closepath\pgfsys@moveto0.0pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt0.0pt\pgfsys@moveto6.69046pt0.0pt\pgfsys@curveto6.69046pt0.55229pt6.24275pt1.0pt5.69046pt1.0pt\pgfsys@curveto5.13817pt1.0pt4.69046pt0.55229pt4.69046pt0.0pt\pgfsys@curveto4.69046pt-0.55229pt5.13817pt-1.0pt5.69046pt-1.0pt\pgfsys@curveto6.24275pt-1.0pt6.69046pt-0.55229pt6.69046pt0.0pt\pgfsys@closepath\pgfsys@moveto5.69046pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@moveto6.69046pt-5.69046pt\pgfsys@curveto6.69046pt-5.13817pt6.24275pt-4.69046pt5.69046pt-4.69046pt\pgfsys@curveto5.13817pt-4.69046pt4.69046pt-5.13817pt4.69046pt-5.69046pt\pgfsys@curveto4.69046pt-6.24275pt5.13817pt-6.69046pt5.69046pt-6.69046pt\pgfsys@curveto6.24275pt-6.69046pt6.69046pt-6.24275pt6.69046pt-5.69046pt\pgfsys@closepath\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto8.09pt\vboxto8.09pt\pgfpicture\makeatletter\lower-6.89046ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt-5.69046pt\pgfsys@lineto4.98045pt-5.69046pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.04.98045pt-5.69046pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@lineto5.69046pt-0.71pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.05.69046pt-0.71pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt-5.69046pt\pgfsys@moveto1.0pt-5.69046pt\pgfsys@curveto1.0pt-5.13817pt0.55229pt-4.69046pt0.0pt-4.69046pt\pgfsys@curveto-0.55229pt-4.69046pt-1.0pt-5.13817pt-1.0pt-5.69046pt\pgfsys@curveto-1.0pt-6.24275pt-0.55229pt-6.69046pt0.0pt-6.69046pt\pgfsys@curveto0.55229pt-6.69046pt1.0pt-6.24275pt1.0pt-5.69046pt\pgfsys@closepath\pgfsys@moveto0.0pt-5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@moveto6.69046pt-5.69046pt\pgfsys@curveto6.69046pt-5.13817pt6.24275pt-4.69046pt5.69046pt-4.69046pt\pgfsys@curveto5.13817pt-4.69046pt4.69046pt-5.13817pt4.69046pt-5.69046pt\pgfsys@curveto4.69046pt-6.24275pt5.13817pt-6.69046pt5.69046pt-6.69046pt\pgfsys@curveto6.24275pt-6.69046pt6.69046pt-6.24275pt6.69046pt-5.69046pt\pgfsys@closepath\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt0.0pt\pgfsys@moveto6.69046pt0.0pt\pgfsys@curveto6.69046pt0.55229pt6.24275pt1.0pt5.69046pt1.0pt\pgfsys@curveto5.13817pt1.0pt4.69046pt0.55229pt4.69046pt0.0pt\pgfsys@curveto4.69046pt-0.55229pt5.13817pt-1.0pt5.69046pt-1.0pt\pgfsys@curveto6.24275pt-1.0pt6.69046pt-0.55229pt6.69046pt0.0pt\pgfsys@closepath\pgfsys@moveto5.69046pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto8.09pt\vboxto8.09pt\pgfpicture\makeatletter\lower-1.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt4.98045pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt4.98045pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto4.98045pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.04.98045pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@moveto1.0pt0.0pt\pgfsys@curveto1.0pt0.55229pt0.55229pt1.0pt0.0pt1.0pt\pgfsys@curveto-0.55229pt1.0pt-1.0pt0.55229pt-1.0pt0.0pt\pgfsys@curveto-1.0pt-0.55229pt-0.55229pt-1.0pt0.0pt-1.0pt\pgfsys@curveto0.55229pt-1.0pt1.0pt-0.55229pt1.0pt0.0pt\pgfsys@closepath\pgfsys@moveto0.0pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt0.0pt\pgfsys@moveto6.69046pt0.0pt\pgfsys@curveto6.69046pt0.55229pt6.24275pt1.0pt5.69046pt1.0pt\pgfsys@curveto5.13817pt1.0pt4.69046pt0.55229pt4.69046pt0.0pt\pgfsys@curveto4.69046pt-0.55229pt5.13817pt-1.0pt5.69046pt-1.0pt\pgfsys@curveto6.24275pt-1.0pt6.69046pt-0.55229pt6.69046pt0.0pt\pgfsys@closepath\pgfsys@moveto5.69046pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt5.69046pt\pgfsys@moveto1.0pt5.69046pt\pgfsys@curveto1.0pt6.24275pt0.55229pt6.69046pt0.0pt6.69046pt\pgfsys@curveto-0.55229pt6.69046pt-1.0pt6.24275pt-1.0pt5.69046pt\pgfsys@curveto-1.0pt5.13817pt-0.55229pt4.69046pt0.0pt4.69046pt\pgfsys@curveto0.55229pt4.69046pt1.0pt5.13817pt1.0pt5.69046pt\pgfsys@closepath\pgfsys@moveto0.0pt5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture and , where the vertical edge is drawn vertically. Notice that the count for subtypes \leavevmodeto8.09pt\vboxto8.09pt\pgfpicture\makeatletter\lower-6.89046ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto4.98045pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.04.98045pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@lineto5.69046pt-0.71pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.05.69046pt-0.71pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@moveto1.0pt0.0pt\pgfsys@curveto1.0pt0.55229pt0.55229pt1.0pt0.0pt1.0pt\pgfsys@curveto-0.55229pt1.0pt-1.0pt0.55229pt-1.0pt0.0pt\pgfsys@curveto-1.0pt-0.55229pt-0.55229pt-1.0pt0.0pt-1.0pt\pgfsys@curveto0.55229pt-1.0pt1.0pt-0.55229pt1.0pt0.0pt\pgfsys@closepath\pgfsys@moveto0.0pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt0.0pt\pgfsys@moveto6.69046pt0.0pt\pgfsys@curveto6.69046pt0.55229pt6.24275pt1.0pt5.69046pt1.0pt\pgfsys@curveto5.13817pt1.0pt4.69046pt0.55229pt4.69046pt0.0pt\pgfsys@curveto4.69046pt-0.55229pt5.13817pt-1.0pt5.69046pt-1.0pt\pgfsys@curveto6.24275pt-1.0pt6.69046pt-0.55229pt6.69046pt0.0pt\pgfsys@closepath\pgfsys@moveto5.69046pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@moveto6.69046pt-5.69046pt\pgfsys@curveto6.69046pt-5.13817pt6.24275pt-4.69046pt5.69046pt-4.69046pt\pgfsys@curveto5.13817pt-4.69046pt4.69046pt-5.13817pt4.69046pt-5.69046pt\pgfsys@curveto4.69046pt-6.24275pt5.13817pt-6.69046pt5.69046pt-6.69046pt\pgfsys@curveto6.24275pt-6.69046pt6.69046pt-6.24275pt6.69046pt-5.69046pt\pgfsys@closepath\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto8.09pt\vboxto8.09pt\pgfpicture\makeatletter\lower-6.89046ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt-5.69046pt\pgfsys@lineto4.98045pt-5.69046pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.04.98045pt-5.69046pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@lineto5.69046pt-0.71pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.05.69046pt-0.71pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt-5.69046pt\pgfsys@moveto1.0pt-5.69046pt\pgfsys@curveto1.0pt-5.13817pt0.55229pt-4.69046pt0.0pt-4.69046pt\pgfsys@curveto-0.55229pt-4.69046pt-1.0pt-5.13817pt-1.0pt-5.69046pt\pgfsys@curveto-1.0pt-6.24275pt-0.55229pt-6.69046pt0.0pt-6.69046pt\pgfsys@curveto0.55229pt-6.69046pt1.0pt-6.24275pt1.0pt-5.69046pt\pgfsys@closepath\pgfsys@moveto0.0pt-5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@moveto6.69046pt-5.69046pt\pgfsys@curveto6.69046pt-5.13817pt6.24275pt-4.69046pt5.69046pt-4.69046pt\pgfsys@curveto5.13817pt-4.69046pt4.69046pt-5.13817pt4.69046pt-5.69046pt\pgfsys@curveto4.69046pt-6.24275pt5.13817pt-6.69046pt5.69046pt-6.69046pt\pgfsys@curveto6.24275pt-6.69046pt6.69046pt-6.24275pt6.69046pt-5.69046pt\pgfsys@closepath\pgfsys@moveto5.69046pt-5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt0.0pt\pgfsys@moveto6.69046pt0.0pt\pgfsys@curveto6.69046pt0.55229pt6.24275pt1.0pt5.69046pt1.0pt\pgfsys@curveto5.13817pt1.0pt4.69046pt0.55229pt4.69046pt0.0pt\pgfsys@curveto4.69046pt-0.55229pt5.13817pt-1.0pt5.69046pt-1.0pt\pgfsys@curveto6.24275pt-1.0pt6.69046pt-0.55229pt6.69046pt0.0pt\pgfsys@closepath\pgfsys@moveto5.69046pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture,\leavevmodeto8.09pt\vboxto8.09pt\pgfpicture\makeatletter\lower-1.2ptto0.0pt\pgfsys@beginscope\pgfsys@invoke\definecolorpgfstrokecolorrgb0,0,0\pgfsys@color@rgb@stroke000\pgfsys@invoke\pgfsys@color@rgb@fill000\pgfsys@invoke\pgfsys@setlinewidth0.4pt\pgfsys@invoke\nullfontto0.0pt\pgfsys@beginscope\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto0.0pt4.98045pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm0.01.0-1.00.00.0pt4.98045pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\pgfsys@setlinewidth0.8pt\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@lineto4.98045pt0.0pt\pgfsys@stroke\pgfsys@invoke\pgfsys@beginscope\pgfsys@invoke\pgfsys@transformcm1.00.00.01.04.98045pt0.0pt\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt0.0pt\pgfsys@moveto1.0pt0.0pt\pgfsys@curveto1.0pt0.55229pt0.55229pt1.0pt0.0pt1.0pt\pgfsys@curveto-0.55229pt1.0pt-1.0pt0.55229pt-1.0pt0.0pt\pgfsys@curveto-1.0pt-0.55229pt-0.55229pt-1.0pt0.0pt-1.0pt\pgfsys@curveto0.55229pt-1.0pt1.0pt-0.55229pt1.0pt0.0pt\pgfsys@closepath\pgfsys@moveto0.0pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto5.69046pt0.0pt\pgfsys@moveto6.69046pt0.0pt\pgfsys@curveto6.69046pt0.55229pt6.24275pt1.0pt5.69046pt1.0pt\pgfsys@curveto5.13817pt1.0pt4.69046pt0.55229pt4.69046pt0.0pt\pgfsys@curveto4.69046pt-0.55229pt5.13817pt-1.0pt5.69046pt-1.0pt\pgfsys@curveto6.24275pt-1.0pt6.69046pt-0.55229pt6.69046pt0.0pt\pgfsys@closepath\pgfsys@moveto5.69046pt0.0pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@beginscope\pgfsys@invoke\definecolor[named]pgffillcolorrgb0,0,0\pgfsys@color@gray@fill0\pgfsys@invoke\pgfsys@moveto0.0pt5.69046pt\pgfsys@moveto1.0pt5.69046pt\pgfsys@curveto1.0pt6.24275pt0.55229pt6.69046pt0.0pt6.69046pt\pgfsys@curveto-0.55229pt6.69046pt-1.0pt6.24275pt-1.0pt5.69046pt\pgfsys@curveto-1.0pt5.13817pt-0.55229pt4.69046pt0.0pt4.69046pt\pgfsys@curveto0.55229pt4.69046pt1.0pt5.13817pt1.0pt5.69046pt\pgfsys@closepath\pgfsys@moveto0.0pt5.69046pt\pgfsys@fillstroke\pgfsys@invoke\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\pgfsys@discardpath\pgfsys@invoke\lxSVG@closescope\pgfsys@endscope\hss\lxSVG@closescope\endpgfpicture is equal to the count we obtained for Q0v, since all these edge pairs can only occur in the box Bm anyway. However, the subtype appears 1 additional time compared to Q0v, at the connection of the stick S with the box Bm. We bound the missing terms via (2.10) which yields the operator inequality
[TABLE]
(We mention that there is some overcounting in this bound, since only vertical edges appear 3(d−1) times after applying (2.10) to the left-hand side.) We conclude
[TABLE]
Q2v** terms.** The count for these terms is equal to the count of terms in Q0, which was (m2−1)(m+1)d−2, plus the contribution from the stick, which is n. (Notice that this includes a pair of adjacent edges e,e′ where e∈S and e′∈Bm.) We conclude that
[TABLE]
In order to obtain Q=Q0v+Q1v+Q2v, we apply (2.10) again to the differences between Q0v,Q1v,Q2v and conclude
We continue with the proof of (2.7) in Proposition 2.3; it remains to compute the type (c) terms.
\markoverwith
\ULdepth
\ULon
Type (c) terms.
First, observe that each type (c) term is non-negative since {he,he′}≥0 if e∼e′, because in that case he and he′ are commuting projectors. It then suffices to observe that the count of all type (c) terms is controlled by the largest count of type (b) terms, which as we saw above was max{(m2−1)(m+1)d−2+n,m2(m+1)d−2+1}. Thanks to {he,he′}≥0, we can include the missing terms to find
[TABLE]
We recall that
[TABLE]
and so the claim (2.7) follows by combining (2.8), (2.9), and (2.12).
∎
2.5 Conclusion
We are now ready to prove the finite-size criterion Theorem 2.1. For convenience, we abbreviate
We compute the main contribution to the gap threshold:
[TABLE]
and the correction term
[TABLE]
This proves
[TABLE]
Note that we may always lower bound the prefactor on the right-hand side, even if the whole expression is negative, since the resulting inequality is then trivial. Hence, we conclude
[TABLE]
and now Theorem 2.1 follows by frustration-freeness of HL and the spectral theorem.
∎
3 Verification of the finite-size criterion
In order to conclude Theorem 1.1 from the finite-size criterion in Theorem 2.1, we aim to prove that, for some m≥4 and a sufficiently small δ>0,
[TABLE]
Such a bound is the content of the following proposition.
Proposition 3.1**.**
Define Cm,n:=8((m+1)d+n)(n2+n) and suppose that 3Cm,nδ<1. Then
[TABLE]
Notice that the lower bound 1−3Cm,nδ only exceeds the gap threshold from Theorem 2.1 for sufficiently small δ. As mentioned before, the proof of Proposition 3.1 is based on a perturbative argument via the reference Hamiltonian with δ=0.
3.1 Proof of the main result assuming Proposition 3.1
We will now prove Theorem 1.1 assuming Proposition 3.1. By the finite-size criterion in Theorem 2.1, the claimed gap exists if for some m≥4 we can verify
[TABLE]
By Proposition 3.1, this is ensured by the condition
[TABLE]
For d=2, we can set m=16n to see that (3.3) is guaranteed by the stronger condition
[TABLE]
so the right-hand side is a possible choice for c2,n>0.
Let d=3. When we assume that m≥max{n1/(d−2),8d}, we see that (3.3) is guaranteed by the stronger condition
[TABLE]
so the right-hand side is a possible choice for cd,n>0. This proves Theorem 1.1.
∎
3.2 The reference Hamiltonian with δ=0
Recall that the original interaction terms h(k) are defined by (1.1) as a sum of projections onto the (normalized) vectors
[TABLE]
with 1≤i<j≤n and 1≤k≤d. Since the vectors are normalized to form h(k), we may, without changing h(k), replace ϕij(k) by the vector
[TABLE]
We recall our assumption (1.2), which implies that, for all i<j and all 1≤k≤d, it holds that
[TABLE]
and this explains how we should define the reference model with δ=0. To this end, we first define the reference interaction with δ=0 by
[TABLE]
where we defined the vectors ϕ~i,ϕ~ij∈Cn+1⊗Cn+1 by
[TABLE]
for all 1≤i≤j≤n. We remark that h~ is a projection. We generalize Definition (2.1) in the natural way. I.e., given a subgraph G⊂ΛL, we define the associated Hamiltonian
[TABLE]
We note that H~G is frustration-free (an explicit ground state is given by the tensor product of the state ∣0⟩ over any subgraph G). We write γ~G for its spectral gap.
The key fact about the reference Hamiltonian is that it has a large gap of 1, uniformly in the system size.
Lemma 3.2** (The reference Hamiltonian always has gap 1).**
For all subgraphs G⊂ΛL, it holds that
[TABLE]
Proof.
Notice that we may write
[TABLE]
This observation implies that all projections h~e commute, and the lemma follows.
∎
We recall from the discussion in Section 1.3 that the key fact about the box on a stick is that it does not possess any artificial ground state degeneracies, i.e., no ground state degeneracies are lifted as we pass from δ=0 to δ>0. We establish this in two steps: In step 1, we characterize all the ground states of the reference Hamiltonian with δ=0. In step 2, we use symmetry (particle number conservation) to argue that none of these degeneracies are lifted. Afterwards, we combine these facts with Lemma 3.2 to prove Proposition 3.1 and hence the main result, Theorem 1.1.
3.3 Step 1: Characterizing the ground states of the reference Hamiltonian
The following lemma characterizes the ground states of HCm. For this, we will use a product basis for the Hilbert space HCm=⨂x∈CmCn+1 in the following form
[TABLE]
with the convention that the index il describes the state at site le1∈ΛL. In other words, the indices i0,…,in describe the basis states along the stick part of Cm, while the remaining j vector describes the basis state across the box Bm without its bottom corner. Notice that the model Hamiltonian H~Cm is diagonal in the B-basis.
Lemma 3.3** (Ground states of H~Cm).**
Let b=∣i0⊗i1⊗…⊗in⊗j⟩∈B. Then b∈kerH~Cm if and only if j=∣0⟩⊗(∣Bm∣−1) and the sequence (i0,i1,i2,…,in) satisfies the following two conditions:
(i)
The sequence (i0,i1,i2,…,in) is strictly decreasing until it reaches [math].
2. (ii)
After the sequence (i0,i1,i2,…,in) reaches [math], it remains at [math].
Proof.
Fix an edge e=(le1,(l+1)e1) with 0≤l≤n−1 along the stick. Notice that e is oriented upwards. Hence, the projections (3.7) assign an energy penalty of 1 at e if and only if 0=il≤il+1. Conversely, the energy penalty at e is [math] if and only if il>il+1 or il=il+1=0. Combining this fact over all 0≤l≤n−1, we see that b is a ground state across the stick if and only if conditions (i) and (ii) are satisfied.
Next, observe that conditions (i) and (ii) collectively imply that in=0. From this we see that the choice j=∣0⟩⊗(∣Bm∣−1) indeed yields a ground state. Conversely, fix an arbitrary index jl from j. There is an oriented path in Bm that connects the vertex at ne1, which carries the state ∣in⟩=∣0⟩, to the vertex with index jl. Hence, if jl=0, then along that path the Hamiltonian H~Cm must incur an energy penalty of at least 1 from having an oriented edge across which the indices increase. This proves that only the choice j=∣0⟩⊗(∣Bm∣−1) leads to a ground state and finishes the proof of Lemma 3.3.
∎
3.4 Step 2: Stability of ground state degeneracies by symmetry
The crucial observation is now that the ground states of H~Cm, as characterized in Lemma 3.3, each belong to a unique particle number sector. Since the perturbation of turning on δ>0 respects particle number conservation, this means that the ground state degeneracy of H~Cm is not lifted.
For each 1≤i≤n, we let Ni be the particle number operator for species i, which is defined on a basis element b=∣i0⊗i1⊗…⊗in⊗j⟩∈B as the number of occurrences of the label i, i.e., Ni has eigenvalues {0,1,…,∣Cm∣}. We define the particle number sectors
[TABLE]
for every sequence of particle numbers (ν1,…,νn)∈{0,1,…,∣Cm∣}n. Note that both Hamiltonians, HCm and H~Cm, commute with each particle number operator Ni and are hence block-diagonal with respect to the particle number sectors P(ν1,…,νn). In fact, it was observed in [2], by explicitly constructing the ground states of the true Hamiltonian HCm for any choice of anisotropy parameters λi(k)=0 that there are 2n ground states which each lie in a unique particle number sector P(ν1,…,νn) with (ν1,…,νn)∈{0,1}n. In other words, the ground states of HCm are labeled by subsets M⊂{1,…,n} and M encodes the particle species which are (once) present in the ground state.
We now observe that the same fact is true for the reference Hamiltonian H~Cm.
The ground states of kerH~Cm are labeled by subsets M⊂{1,…,n}. More precisely, for each ground state b∈B of kerH~Cm, there exists a unique vector (ν1,…,νn)∈{0,1}n such that b∈P(ν1,…,νn).
Proof.
By Lemma 3.3, j=∣0⟩⊗(∣Bm∣−1) for ground states and so particles (i.e. non-zero indices) can only occur along the stick. The strictly decreasing condition (ii) from Lemma 3.3 then implies the corollary.
∎
Corollary 3.4 allows us to apply non-degenerate perturbation theory in each particle number sector and conclude the proof of Proposition 3.1.
3.5 Conclusion
We will need the following lemma on the size of the perturbation in passing from the reference Hamiltonian H~Cm to the true Hamiltonian HCm.
Lemma 3.5**.**
We have the norm bound
[TABLE]
Consequently, for every normalized ϕ∈HCm, we have
[TABLE]
Proof.
We first note that, for any edge e0∈ECm,
[TABLE]
Notice that he0−h~e0 consists of a total of (2n)+n=2n2+n differences between projections. These are differences between projections onto ∣ϕ^i,j(k)⟩, respectively ∣ϕ~i,j⟩, with i=j, and differences between projections onto ∣ϕ^i(k)⟩, respectively ∣ϕ~i⟩. Thanks to (3.5) and the general estimate ∥∣v⟩⟨v∣−∣w⟩⟨w∣∥≤2∥∣v⟩−∣w⟩∥ for normalized vectors ∥v∥=∥w∥=1, the norm of these differences is bounded by
[TABLE]
This shows
[TABLE]
and proves the norm bound. Finally, we obtain (3.8) by
Let ψ∈(kerHCm)⊥ be a normalized eigenstate of HCm. Without loss of generality, we may also assume that ψ∈P(ν1,…,νn) for some choice of (ν1,…,νn)∈{0,1,…,∣Cm∣}n.
Case 1: Let ψ∈P(ν1,…,νn) such that at least one νl>1. By Corollary 3.4, this implies that ψ∈(kerH~Cm)⊥. Hence, by Lemmas 3.5 and 3.2,
[TABLE]
This concludes case 1.
Case 2: Let ψ∈P(ν1,…,νn) with each νl∈{0,1}. Let us write ψ0, respectively ψ~0, for the unique ground state of kerHCm, respectively kerH~Cm, in the sector P(ν1,…,νn) that has non-negative components in the tensor product basis B. (Note that this used Corollary 3.4 and the fact that the explicit ground states from [2] also have non-negative components.) Then we decompose ψ as follows:
[TABLE]
with ψ⊥∈P(ν1,…,νn)∩(kerH~Cm)⊥. By Lemma 3.5, H~Cmψ~0=0, and Lemma 3.2, we find
[TABLE]
It remains to bound ∣c0∣. We recall that ψ∈(kerHCm)⊥ and so ⟨ψ,ψ0⟩=0. By Cauchy-Schwarz,
[TABLE]
It remains to bound ∥ψ~0−ψ0∥2. The following lemma rests on the uniqueness of ground states in the sector P(ν1,…,νn), and hence on Corollary 3.4.
Lemma 3.6**.**
It holds that ∥ψ~0−ψ0∥2≤2Cm,nδ.
We will prove this lemma below. For now, we note that it implies ∣c0∣2≤2Cm,nδ and so, by (3.9), also
[TABLE]
which verifies the claim of Proposition 3.1 also in case 2. It thus remains to prove the lemma.
with φ⊥∈P(ν1,…,νn)∩(kerH~Cm)⊥. Notice that a0=⟨ψ0,ψ~0⟩≥0, since ψ0 and ψ~0 have non-negative components in the B-basis. On the one hand, we can argue similarly as in (3.9) by using Lemma 3.5, H~Cmψ~0=0, and Lemma 3.2 to find
[TABLE]
which is equivalent to a0≥1−Cm,nδ≥1−Cm,nδ. On the other hand, using that a0≥0, we have
[TABLE]
This proves Lemma 3.6, and hence Proposition 3.1.
∎
Acknowledgements
The authors thank Amanda Young for helpful comments. B.N. acknowledges support by the National Science Foundation under Grant DMS-1813149 and a CRM-Simons
Professorship for a stay at the Centre de Recherches Mathématiques (Montréal) during Fall 2018 where part of this work was carried out.
Bibliography19
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] I. Affleck, T. Kennedy, E. H. Lieb, and H. Tasaki, Valence Bond Ground States in Isotropic Quantum Antiferromagnets , Comm. Math. Phys. 115 (1988), no. 3, 477 – 528.
2[2] S. Bachmann, E. Hamza, B. Nachtergaele and A. Young, Product Vacua and Boundary State Models in d 𝑑 d Dimensions , J. Stat. Phys. 160 (2015), 636 – 658
3[3] S. Bachmann, S. Michalakis, B. Nachtergaele, and R. Sims, Automorphic equivalence within gapped phases of quantum lattice systems , Comm. Math. Phys. 309 (2012), no. 3, 835 – 871
4[4] S. Bachmann and B. Nachtergaele, Product Vacua with Boundary States and the Classification of Gapped Phases , Comm. Math. Phys. 329 (2014), 509 – 544
5[5] M. Bishop, Spectral gaps for the Two-Species Product Vacua and Boundary States models on the d 𝑑 d -dimensional lattice , ar Xiv:1705.04755
6[6] M. Bishop, B. Nachtergaele, A. Young, Spectral Gap and Edge Excitations of d 𝑑 d -dimensional PVBS models on half-spaces J. Stat. Phys. 162 (2016), 1485 – 1521
7[7] S. Bravyi, M. Hastings, S. Michalakis, Topological quantum order: stability under local perturbations , J. Math. Phys. 51 (2010), 093512
8[8] M. Fannes, B. Nachtergaele, R.F. Werner, Finitely Correlated States on Quantum Spin Chains , Commun. Math. Phys. 144 (1992), 443 – 490