Spectral Theory of Infinite Quantum Graphs
Pavel Exner, Aleksey Kostenko, Mark Malamud, and Hagen Neidhardt

TL;DR
This paper explores the spectral properties of infinite quantum graphs without edge length restrictions, establishing a link with weighted discrete Laplacians and deriving new spectral results.
Contribution
It introduces a novel connection between quantum graph spectra and discrete Laplacian spectra, leading to new self-adjointness and spectral estimates for infinite quantum graphs.
Findings
Proved self-adjointness results including a Gaffney type theorem
Derived bounds for spectra and essential spectra of quantum graphs
Studied spectral types and lower semiboundedness
Abstract
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection between spectral properties of a quantum graph and the corresponding properties of a certain weighted discrete Laplacian on the underlying discrete graph. Using this connection together with spectral theory of (unbounded) discrete Laplacians on infinite graphs, we prove a number of new results on spectral properties of quantum graphs. Namely, we prove several self-adjointness results including a Gaffney type theorem. We investigate the problem of lower semiboundedness, prove several spectral estimates (bounds for the bottom of spectra and essential spectra of quantum graphs, CLR-type estimates) and study spectral types.
Peer Reviews
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.
Spectral Theory of Infinite Quantum Graphs
Pavel Exner
Doppler Institute for Mathematical Physics and Applied Mathematics
Czech Technical University
Břehová 7
11519 Prague
Czechia
and Department of Theoretical Physics
Nuclear Physics Institute
Czech Academy of Sciences
25068 Řež near Prague, Czechia
[email protected] http://gemma.ujf.cas.cz/~exner/ ,
Aleksey Kostenko
Faculty of Mathematics and Physics
University of Ljubljana
Jadranska 21
1000 Ljubljana
Slovenia
and Faculty of Mathematics
University of Vienna
Oskar–Morgenstern–Platz 1
1090 Wien
Austria
[email protected]; [email protected] http://www.mat.univie.ac.at/~kostenko/ ,
Mark Malamud
Peoples Friendship University of Russia (RUDN University)
Miklukho-Maklaya Str. 6
117198 Moscow
Russia
and
Hagen Neidhardt
Weierstrass Institute for Applied Analysis and Stochastics
Mohrenstr. 39
10117 Berlin
Germany
[email protected] http://www.wias-berlin.de/~neidhard/
Abstract.
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection between spectral properties of a quantum graph and the corresponding properties of a certain weighted discrete Laplacian on the underlying discrete graph. Using this connection together with spectral theory of (unbounded) discrete Laplacians on infinite graphs, we prove a number of new results on spectral properties of quantum graphs. Namely, we prove several self-adjointness results including a Gaffney type theorem. We investigate the problem of lower semiboundedness, prove several spectral estimates (bounds for the bottom of spectra and essential spectra of quantum graphs, CLR-type estimates) and study spectral types.
Key words and phrases:
Quantum graph, analysis on graphs, self-adjointness, spectrum
2010 Mathematics Subject Classification:
Primary 81Q35; Secondary 34B45; 34L05
Research supported by the Czech Science Foundation (GAČR) under grant No. 17-01706S and the European Union within the project CZ.02.1.01/0.0/0.0/16_019/0000778 (P.E.), by the Austrian Science Fund (FWF) under grant No. P28807 (A.K.), by the “RUDN University Program 5-100” (M.M.), and by the European Research Council (ERC) under grant No. AdG 267802 “AnaMultiScale” (H.N.)
Ann. Henri Poincaré (to appear); doi: 10.1007/s00023-018-0728-9
Contents
1. Introduction
During the last two decades, quantum graphs became an extremely popular subject because of numerous applications in mathematical physics, chemistry and engineering. Indeed, the literature on quantum graphs is vast and extensive and there is no chance to give even a brief overview of the subject here. We only mention a few recent monographs and collected works with a comprehensive bibliography: [14], [15], [36], [52] and [90]. The notion of quantum graph refers to a graph considered as a one-dimensional simplicial complex and equipped with a differential operator (“Hamiltonian”). The idea has it roots in the 1930s when it was proposed to model free electrons in organic molecules [89, 100]. It was rediscovered in the late 1980s and since that time it found numerous applications. Let us briefly mention some of them: superconductivity theory in granular and artificial materials [6, 98], microelectronics and waveguide theory [39, 82, 83], Anderson localization in disordered wires [1, 2, 35], chemistry (including studying carbon nanostructures) [10, 34, 62, 71, 91], photonic crystal theory [11, 42, 69], quantum chaotic systems [52, 63], and others. These applications of quantum graphs usually involve modelling of waves of various nature propagating in thin branching media which looks like a thin neighbourhood of a graph . A rigorous justification of such a graph approximation is a nontrivial problem. It was first addressed in the situation where the boundary of the “fat graph” is Neumann (see, e.g., [72, 99]), a full solution was obtained only recently [23, 38]. The Dirichlet case is more difficult and a work remains to be done (see, e.g., [49, 90]).
From the mathematical point of view, quantum graphs are interesting because they are a good model to study properties of quantum systems depending on geometry and topology of the configuration space. They exhibit a mixed dimensionality being locally one-dimensional but globally multi-dimensional of many different types. To the best of our knowledge, however, their analysis usually includes the assumption that there is a positive lower bound on the lengths of the graph edges (we are aware only of a few works dealing with metric graphs having edges of arbitrarily small length, however, with some other additional rather restrictive assumptions, e.g., radially symmetric trees [19, 105], some classes of fractals [7, 8, 9], graphs having finite total length or diameter [20]). Our main aim is to investigate spectral properties of quantum graphs avoiding this rather restrictive hypothesis on the geometry of the underlying metric graph .
To proceed further we need to introduce briefly some notions and structures (a detailed description is given in Section 2). Let be a (combinatorial) graph with finite or countably infinite sets of vertices and edges . For two different vertices , we shall write if there is an edge connecting with . For every , denotes the set of edges incident to the vertex . To simplify our considerations, we assume that the graph is connected and there are no loops or multiple edges (let us mention that these assumptions can be made without loss of generality, see Remark 2.1 below). In what follows we shall also assume that is equipped with a metric, that is, each edge is assigned with the length in a suitable way. A graph equipped with a metric is called a metric graph and is denoted by . Identifying every edge with the interval one can introduce the Hilbert space and then the Hamiltonian which acts in this space as the (negative) second derivative on every edge . To give the meaning of a quantum mechanical energy operator, it must be self-adjoint. To make it symmetric, one needs to impose appropriate boundary conditions at the vertices. Kirchhoff conditions (4.1) or, more generally, -type conditions with interactions strength
[TABLE]
are the most standard ones (cf. [15]). Restricting further to functions vanishing everywhere except finitely many edges, we end up with the pre-minimal symmetric operator (see Section 3 for a precise definition). The first question which naturally appears in this context is, of course, whether this operator is essentially self-adjoint in (which is the same that its closure is self-adjoint). To the best of our knowledge, in the case when both sets and are countably infinite, the self-adjointness of was established when and the interactions strength is bounded from below in a suitable sense (see, e.g., [15, Chapter I] and [73]). The subsequent analysis of was then naturally performed under these rather restrictive assumptions on and .
We propose a new approach to investigate spectral properties of infinite quantum graphs. To this goal, we exploit the boundary triplets machinery [29, 48, 102], a powerful approach to extension theory of symmetric operators (see Appendix A for further details and references). Consider in the following operator
[TABLE]
where denotes the standard Sobolev space on the edge . Clearly, is a closed symmetric operator in with deficiency indices . In particular, the deficiency indices are infinite when contains infinitely many edges and hence in this case the description of self-adjoint extensions and the study of their spectral properties is a very nontrivial problem. Despite some skepticism (see, e.g., [36, p.483]), we are indeed able to construct a suitable boundary triplet for the maximal operator in the case when . As an immediate outcome, the boundary triplets approach enables us to parameterize the set of all self-adjoint (respectively, symmetric) extensions of in terms of self-adjoint (respectively, symmetric) “boundary linear relations”. Furthermore, it turns out (see Proposition 3.3) that the boundary relation (to be more precise, its operator part) parameterizing the quantum graph operator is unitarily equivalent to the weighted discrete Laplacian defined in by the following expression
[TABLE]
where the weight functions and are given by
[TABLE]
Therefore, spectral properties of the quantum graph Hamiltonian and the discrete Laplacian are closely connected. For example, we show that (see Theorem 3.5):
- (i)
The deficiency indices of and are equal. In particular, is self-adjoint if and only if is self-adjoint.
Assume additionally that the operator (and hence also the operator ) is self-adjoint. Then:
- (ii)
* is lower semibounded if and only if is lower semibounded.*
- (iii)
The total multiplicities of negative spectra of and coincide. In particular, is nonnegative if and only if the operator is nonnegative. Moreover, negative spectra of and are discrete simultaneously.
- (iv)
* is positive definite if and only if is positive definite. *
- (v)
If in addition is lower semibounded, then exactly when respectively, .
- (vi)
The spectrum of is purely discrete if and only if the number is finite for every and the spectrum of is purely discrete.
Spectral theory of discrete Laplacians on graphs has a long and venerable history due to its numerous applications in probability (e.g., random walks on graphs) and physics (see the monographs [24], [26], [31], [75], [76], [106], [107] and references therein). If , then the corresponding discrete Laplacian might be unbounded even if . A significant progress in the study of unbounded discrete Laplacians has been achieved during the last decade (see the surveys [59], [60]) and we apply these recent results to investigate spectral properties of quantum graphs in the case when . For example, using (i), we establish a Gaffney type theorem (see Corollary 4.9 and Remark 4.10) by simply applying the corresponding result for discrete operators (see [55, Theorem 2]): if equipped with a natural path metric is complete as a metric space, then is self-adjoint. Notice that by a Hopf–Rinow type theorem from [55], is complete as a metric space if and only if satisfies the so-called finite ball condition (see, e.g., [15, Assumption 1.3.5]). Combining (iv) and (v) with the Cheeger type and the volume growth estimates for discrete Laplacians (see [12], [43], [59], [61]), we prove several spectral estimates for . In particular, we prove necessary (Theorem 4.21(iii)) and sufficient (Theorem 4.20(iii)) discreteness conditions for . In the case , it follows from (vi) that the condition is necessary for the spectrum of to be discrete and this is the very reason why the discreteness problem has not been addressed previously for quantum graphs (perhaps, the only exception is the case of radially symmetric trees since for this class of quantum graphs it is possible to reduce the spectral analysis to the analysis of Sturm–Liouville operators, see [105, §5.3]).
Let us also stress that some of our results are new even if . In this case the discrete Laplacian is bounded and hence we immediately conclude by applying (i) that is self-adjoint for any (Corollary 5.2). On the other hand, is bounded if and only if the weighted degree function defined by
[TABLE]
is bounded on (see [28]). Therefore, is self-adjoint for any in this case too (Lemma 5.1). Let us stress that the condition is sufficient for to be bounded on , however, it is not necessary (see Example 4.7).
The duality between spectral properties of continuous and discrete operators on finite graphs and networks was observed by physicists in the 1960s and then by mathematicians in the 1980s [13, 21, 33, 86, 93]. For a particular class, the so-called equilateral graphs, it is even possible to prove a sort of unitary equivalence between continuous and discrete operators [17, 87, 88] (actually, this can also be viewed as the analog of Floquet theory for periodic Sturm–Liuoville operators, cf. [3]). However, in all those cases is satisfied and the corresponding difference Laplacian in contrast to (1.2) is given by
[TABLE]
that is, the weight function is replaced by the combinatorial degree function (see, e.g., [90, Chapter II], [96]). These functions coincide only if the graph is equilateral and then both (1.2) and (1.4) (with ) reduce to the combinatorial Laplacian on . Moreover, in the case , spectral properties of operators defined by (1.2) and (1.4) can completely be different and spectral properties of (1.4) do not correlate with those of the quantum graph operator (this can be seen by simple examples of Jacobi matrices, see Remark 3.7).
In fact, it is not difficult to discover certain connections just by considering the corresponding quadratic forms. Namely, let be a continuous compactly supported function on the metric graph , which is linear on every edge. Setting , we then get (see Remark 3.8 for more details)
[TABLE]
If , then the closures of both forms and are regular Dirichlet forms whenever the corresponding graph is locally finite (cf. [46]). Clearly, (1.5) establishes a close connection between the corresponding Markovian semigroups as well as between Markov processes on the corresponding graphs. However, let us stress that it was exactly the above statement (iii) which helped us to improve and complete one result of G. Rozenblum and M. Solomyak [96] on the behavior of the heat semigroups generated by and (see Theorem 5.17 and Remark 5.18): for the following equivalence holds
[TABLE]
Here and are positive constants, which do not depend on . Let us also mention that the estimates of this type are crucial in proving Rozenblum–Cwikel–Lieb (CLR) type estimates for both and (see Section 5.2).
Our results continue and extend the previous work [64, 65, 66] and [67] on 1-D Schrödinger operators and matrix Schrödinger operators with point interactions, respectively. Notice that (see Example 3.6) in this case the line or a half-line can be considered as the simplest metric graph (a regular tree with ) and then the corresponding discrete Laplacian is simply a Jacobi (tri-diagonal) matrix (with matrix coefficients in the case of matrix Schrödinger operators).
Let us now finish the introduction by briefly describing the content of the article. The core of the paper is Section 2, where we construct a suitable boundary triplet for the operator (Theorem 2.3 and Corollary 2.5) by applying an efficient procedure suggested recently in [65], [79] (see also Appendix A.4). The central result of Section 2 is Theorem 2.9, which describes basic spectral properties (self-adjointness, lower semiboundedness, spectral estimates, etc.) of proper extensions of given by
[TABLE]
in terms of the corresponding properties of the boundary relation . In particular, (1.6) establishes a one-to-one correspondence between self-adjoint (respectively, symmetric) linear relations in an auxiliary Hilbert space and self-adjoint (respectively, symmetric) extensions of the minimal operator .
In Section 3 we specify Theorem 2.9 to the case of the Hamiltonian . First of all, we find the boundary relation parameterizing the operator in the sense of (1.6). As it was already mentioned, its operator part is unitarily equivalent to the discrete Laplacian (1.2)–(1.3) and hence this fact establishes a close connection between spectral properties of and (Theorem 3.5).
In Sections 4 and 5, we exploit recent advances in spectral theory of unbounded discrete Laplacians and prove a number of results on quantum graphs with Kirchhoff and -couplings at vertices avoiding the standard restriction . More specifically, the case of Kirchhoff conditions is considered in Section 4, where we prove several self-adjointness results and also provide estimates on the bottom of the spectrum as well as on the essential spectrum of . We discuss the self-adjointness of in Section 5.1. On the one hand, we show that is self-adjoint for any whenever the weighted degree function is bounded on . In the case when is locally bounded on , we prove self-adjointness and lower semiboundedness of under certain semiboundedness assumptions on . We also demonstrate by simple examples that these results are sharp. Section 5.2 is devoted to CLR-type estimates for quantum graphs. In Section 5.3 we investigate spectral types of . Moreover, using the Cheeger-type estimates for , we prove several spectral bounds for .
As it was already mentioned, Theorem 2.9 is valid for all self-adjoint extensions of , however, the corresponding boundary relation may have a complicated structure when we go beyond the couplings. In Section 6, we briefly discuss the case of the so-called -couplings, cf. [32] . It turns our that the corresponding boundary operator is a difference operator, however, its order depends on the vertex degree function of the underlying discrete graph.
In Appendix A we collect necessary definitions and facts about linear relations in Hilbert spaces, boundary triplets and Weyl functions.
Notation
, , , have standard meaning; .
, .
and denote separable complex Hilbert spaces; and are, respectively, the identity and the zero maps on ; and . By and we denote, respectively, the sets of bounded and closed linear operators in ; is the set of closed linear relations in ; is the two-sided von Neumann–Schatten ideal in , . In particular, , and denote the trace ideal, the Hilbert–Schmidt ideal and the set of compact operators in .
Let be a self-adjoint linear operator (relation) in . For a Borel set , by we denote the corresponding orthogonal spectral projection of . Moreover, we set
[TABLE]
that is, is the total multiplicity of the negative spectrum of . Note that is the number (counting multiplicities) of negative eigenvalues of if the negative spectrum of is discrete. In this case we denote by their absolute values numbered in the decreasing order and counting their multiplicities.
2. Boundary triplets for graphs
Let us set up the framework. Let be a (undirected) graph, that is, is a finite or countably infinite set of vertices and is a finite or countably infinite set of edges. For two vertices , we shall write if there is an edge connecting with . For every , we denote the set of edges incident to the vertex by and
[TABLE]
is called the degree (or combinatorial degree) of a vertex . A path of (combinatorial) length is a subset of vertices such that vertices are distinct and for all . A graph is called connected if for any two vertices there is a path connecting them.
We also need the following assumptions on the geometry of :
Hypothesis 2.1**.**
* is connected and there are no loops or multiple edges.*
Remark 2.1**.**
Let us stress that the above assumptions can be made without loss of generality. Namely, if is not connected, then one simply needs to consider each connected component separately. The simplicity assumption can always be achieved by adding the so-called inessential vertices (vertices of degree two and equipped with Kirchhoff conditions) to the corresponding metric graph. Indeed, adding or removing such a vertex does not change spectral properties of the corresponding quantum graph (see, e.g., [15, Remark 1.3.3]).
Let us assign each edge with length 111We shall always assume that there are no edges having an infinite length, however, see Remark 3.1(ii). and direction222This means that the graph is directed, that is, each edge has one initial vertex and one terminal vertex . In this case is called a metric graph. Moreover, every edge can be identified with the interval and hence we can introduce the Hilbert space of functions such that
[TABLE]
Let us equip with the Laplace operator. For every consider the maximal operator acting on functions as a negative second derivative. Now consider the maximal operator on defined by
[TABLE]
For every the following quantities
[TABLE]
and
[TABLE]
are well defined.
We begin with a simple and well known fact (see, e.g., [65]).
Lemma 2.2**.**
Let and be the corresponding maximal operator. The triplet , where the mappings , are defined by
[TABLE]
is a boundary triplet for . Moreover, the corresponding Weyl function is given by333Here denotes the principal branch of the square root with the cut along the negative semi-axis.
[TABLE]
Proof.
The proof is straightforward and we leave it to the reader. ∎
It is easy to see that the Green’s formula
[TABLE]
holds for all , , where is a subspace consisting of functions from vanishing everywhere on except finitely many edges, and the asterisk denotes complex conjugation. One would expect that a boundary triplet for can be constructed as a direct sum of boundary triplets , however, it is not true once (see [65] for further details). Using Theorem A.10, we proceed as follows (see also [65, Section 4]). First of all, (2.6) extends to a meromorphic function with simple poles , . Hence for every we set
[TABLE]
and then we define the new mappings , by
[TABLE]
that is,
[TABLE]
Clearly, is also a boundary triplet for . In addition, the following claim holds.
Theorem 2.3**.**
Suppose . Then the direct sum of boundary triplets
[TABLE]
is a boundary triplet for the operator . Moreover, the corresponding Weyl function is given by
[TABLE]
for all .
Proof.
By Theorem A.10, we need to verify either of the conditions (A.19) or (A.20). However, this can be done as in the proof of [65, Theorem 4.1] line by line since
[TABLE]
and we omit the details. ∎
Moreover, similarly to [65, Proposition 4.4] one can also prove the following
Lemma 2.4**.**
Suppose . Then the Weyl function given by (2.12) uniformly tends to as , that is, for every there is such that
[TABLE]
for all .
We shall also need another boundary triplet for , which can be obtained from the triplet by regrouping all its components with respect to the vertices:
[TABLE]
where
[TABLE]
and
[TABLE]
with
[TABLE]
Corollary 2.5**.**
If , then the triplet given by (2.13)–(2.16) is a boundary triplet for .
Proof.
Every and can be written as follows and , respectively. Define the operator by
[TABLE]
Clearly, is a unitary operator and moreover
[TABLE]
This completes the proof. ∎
Let us also mention other important relations.
Corollary 2.6**.**
The Weyl function corresponding to the boundary triplet (2.13)–(2.16) is given by
[TABLE]
where is the Weyl function corresponding to the triplet constructed in Theorem 2.3 and is the operator defined by (2.17).
Remark 2.7**.**
If
[TABLE]
where and are given by (2.5), then
[TABLE]
have the following form
[TABLE]
and
[TABLE]
Corollary 2.8**.**
Let be the Weyl function corresponding to the boundary triplet . Then uniformly tends to as .
Proof.
It is an immediate consequence of Lemma 2.4 and (2.19). ∎
Let be a linear relation in and define the following operator
[TABLE]
where the mappings and are defined by (2.13)–(2.15). Since is a boundary triplet for , every proper extension of the operator has the form (2.23). Moreover, by Theorem A.3, (2.23) establishes a bijective correspondence between the set of proper extensions of and the set of all linear relations in . The next result summarizes basic spectral properties of operators characterized in terms of the corresponding boundary relation . In particular, we are able to describe all self-adjoint extensions of the minimal operator .
Theorem 2.9**.**
Suppose . Also, let be a linear relation in and let be the corresponding operator (2.23). Then:
- (i)
.
- (ii)
* is closed if and only if the linear relation is closed.*
- (iii)
* is symmetric if and only if is symmetric and, moreover,*
[TABLE]
In particular, is self-adjoint if and only if so is .
Assume in addition that is a self-adjoint linear relation (hence is also self-adjoint). Then:
- (iv)
* is lower semibounded if and only if the same is true for .*
- (v)
* is nonnegative (positive definite) if and only if is nonnegative (positive definite).*
- (vi)
The total multiplicities of negative spectra of and coincide,
[TABLE]
- (vii)
For every the following equivalence holds
[TABLE]
- (viii)
If the negative spectrum of (or equivalently ) is discrete, then for every the following equivalence holds
[TABLE]
as , where either or .
- (ix)
*If, in addition, is lower semibounded, then holds exactly when *respectively, .
- (x)
Also, let . Then for every the following equivalence holds for the corresponding Neumann–Schatten ideals
[TABLE]
If holds in addition, then
[TABLE]
- (xi)
The spectrum of is purely discrete if and only if is finite for every and the spectrum of the linear relation is purely discrete.
Proof.
Consider the boundary triplet constructed in Theorem 2.3. Items (i), (ii), (iii) and (x) follow from Theorem A.3. Item (iv) follows from Theorem A.8 and Corollary 2.8.
Next consider the corresponding Weyl function given by (2.12). Clearly,
[TABLE]
for all . Then (2.12) together with (A.10) implies that . Moreover, in view of (2.19), we get
[TABLE]
Noting that
[TABLE]
is the Friedrichs extension of , we immediately conclude that
[TABLE]
is the Friedrichs extension of . Moreover,
[TABLE]
and hence
[TABLE]
Now items (v)–(viii) follow from Theorem A.6 and item (ix) follows from Theorem A.9.
Finally, it follows from (2.29) and (2.30) that the spectrum of is purely discrete if and only if is finite for every . This fact together with Theorem A.3(iv) implies item (xi). ∎
Remark 2.10**.**
The assumption in Theorem 2.9 can be dropped either by modifying the underlying graph by adding additional vertices or by modifying the construction of the boundary triplet in Theorem 2.3. However, both options lead to a more cumbersome form of the corresponding boundary relation and we decided to exclude this case from our considerations in order to keep the exposition as transparent as possible.
Remark 2.11**.**
The analogs of statements (iii) and (iv) of Theorem 2.9 were obtained in [73] under the additional restrictive assumption . Notice that if the latter holds, then the regularization (2.8)–(2.10) is not needed and one can construct a boundary triplet for the maximal operator by summing up the triplets (2.5).
3. Parameterization of quantum graphs with -couplings
Turning to a more specific problem, we need to make further assumptions on the geometry of a connected metric graph .
Hypothesis 3.1**.**
* is locally finite, that is, every vertex has finitely many neighbours, for all . Moreover, there is a finite upper bound on the lengths of edges,*
[TABLE]
Let be given and equip every vertex with the so-called -type vertex condition:
[TABLE]
Let us define the operator as the closure of the operator given by
[TABLE]
where consists of functions from vanishing everywhere on except finitely many edges.
Remark 3.1**.**
A few remarks are in order:
- (i)
If for some , then it was shown in **[73, Theorem 5.2]** that a Kirchhoff-type boundary condition at (as well as (3.2)) leads to an operator which is not closed. Moreover, it turns out that its closure gives rise to Dirichlet boundary condition at , i.e., disconnected edges.
- (ii)
Assumption (3.1) is of a technical character. Of course, the case of edges having an infinite length would require separate considerations in Section 2 and this will be done elsewhere. On the other hand, the case when all edges have finite length but there is no uniform upper bound can be reduced to the case of graphs satisfying (3.1) either by adding additional inessential vertices or by slight modifications in the considerations of Section 2. Note also that those allow to include situations when the graph is not simple, that is, it has loops and multiple edges (cf. Hypothesis 2.1).
Let us emphasize that the operator is symmetric. Moreover, simple examples show that might not be self-adjoint.
Example 3.2** (1-D Schrödinger operator with -interactions).**
Consider the positive semi-axis and let be a strictly increasing sequence such that and . Considering as vertices and the intervals as edges, we end up with the simplest infinite metric graph. Notice that for every real sequence with conditions (3.2) take the following form: and
[TABLE]
The operator is known as the one-dimensional Schrödinger operator with -interactions on (see, e.g., [4]), and the corresponding differential expression is given by
[TABLE]
It was proved in [65] that is self-adjoint if (the latter is known in the literature as the Ismagilov condition, see [56]). On the other hand (see [65, Proposition 5.9]), if and in addition for all sufficiently large , then the operator is symmetric with whenever satisfies the following condition
[TABLE]
This effect was discovered by C. Shubin Christ and G. Stolz [104, pp. 495–496] in the special case and , . For further details and results we refer to [66], [81].
Our main aim is to find a boundary relation parameterizing the operator in terms of the boundary triplet given by (2.13)–(2.15). First of all, notice that at each vertex the boundary conditions (3.2) have the following form
[TABLE]
where , (see (2.21) and (2.22)) and the matrices , are given by
[TABLE]
It is easy to check that these matrices satisfy the Rofe–Beketov conditions (see Proposition A.1), that is
[TABLE]
and hence
[TABLE]
is a self-adjoint linear relation in . Now set
[TABLE]
Clearly, satisfies
[TABLE]
if and only if . In view of (2.20), we get
[TABLE]
where
[TABLE]
and , and are defined by (2.8) and (2.17), respectively. Hence we conclude that if and only if satisfies
[TABLE]
where
[TABLE]
Thus we are led to specification of the boundary relation parameterizing the operator . Namely, consider now the linear relation defined in by
[TABLE]
where consists of vectors of having only finitely many nonzero coordinates. It is not difficult to see that is symmetric and hence it admits the decomposition (see Appendix A.1)
[TABLE]
and is the operator part of . Clearly,
[TABLE]
Let , where . Next we observe that
[TABLE]
and
[TABLE]
where
[TABLE]
Noting that
[TABLE]
we get
[TABLE]
Let us now show that for every . Denote by the orthogonal projection in onto . Next notice that
[TABLE]
Finally, take and consider
[TABLE]
Therefore, define by
[TABLE]
where the function is given by
[TABLE]
Clearly,
[TABLE]
and hence . Moreover, (3.10) immediately implies that
[TABLE]
Noting that is an orthogonal basis in and for all , we conclude that the operator part of is unitarily equivalent to the following pre-minimal difference operator defined in by
[TABLE]
where is given by
[TABLE]
More precisely, we define the operator in on the domain by
[TABLE]
Here and below is the space of finitely supported functions on . Notice that Hypothesis 3.1 guarantees that is well defined since for every . Moreover, is symmetric and let us denote its closure by .
Thus we proved the following result.
Proposition 3.3**.**
Assume that Hypotheses 2.1 and 3.1 are satisfied. Also, let be the closure of the pre-minimal operator (3.3) and let be the boundary triplet (2.13)–(2.15). Then
[TABLE]
where is a linear relation in defined as the closure of given by (3.9). Moreover, the operator part of is unitarily equivalent to the operator acting in .
We also need another discrete Laplacian. Specifically, in the weighted Hilbert space we consider the minimal operator defined by the following difference expression
[TABLE]
Lemma 3.4**.**
The pre-minimal operator associated with (3.17) in is unitarily equivalent to the operator defined by (3.13), (3.15) and acting in .
Proof.
It suffices to note that
[TABLE]
where the operator
[TABLE]
isometrically maps onto . ∎
In the following we shall use as the symbol denoting the closures of both operators. Now we are ready to formulate our main result.
Theorem 3.5**.**
Assume that Hypotheses 2.1 and 3.1 are satisfied. Let and be a closed symmetric operator associated with the graph and equipped with the -type coupling conditions (3.2) at the vertices. Also, let be the discrete Laplacian defined either by (3.13) in or by (3.17) in , where the functions and are given by (3.11) and (3.14), respectively. Then:
- (i)
The deficiency indices of and are equal and
[TABLE]
In particular, is self-adjoint if and only if is self-adjoint.
Assume in addition that (and hence also ) is self-adjoint. Then:
- (ii)
The operator is lower semibounded if and only if the operator is lower semibounded.
- (iii)
The operator is nonnegative (positive definite) if and only if the operator is nonnegative (respectively, positive definite).
- (iv)
The total multiplicities of negative spectra of and coincide,
[TABLE]
- (v)
Moreover, the following equivalence
[TABLE]
holds for all . In particular, negative spectra of and are discrete simultaneously.
- (vi)
If , then the following equivalence holds for all
[TABLE]
as , where either or .
- (vii)
*If, in addition, is lower semibounded, then exactly when *respectively, .
- (viii)
The spectrum of is purely discrete if and only if the number is finite for every and the spectrum of the operator is purely discrete.
- (ix)
If is such that , then the following equivalence
[TABLE]
holds for all .
Proof.
We only need to comment on the first equality in (3.18) since the rest immediately follows from Theorem 2.9 and Proposition 3.3. However, the first equality in (3.18) follows from the equality of deficiency indices of the operator . Indeed, by the von Neumann theorem since commutes with the complex conjugation. ∎
Let us demonstrate Theorem 3.5 by applying it to the 1-D Schrödinger operator with -interactions (3.5) considered in Example 3.2.
Example 3.6**.**
Let be the Schrödinger operator (3.5) with -interactions on the positive semi-axis . Recall that in this case and , where . By (3.11) and (3.14), we get
[TABLE]
where for all , and
[TABLE]
Setting with , we see that the difference expression (3.13) is just a three-term recurrence relation
[TABLE]
where
[TABLE]
for all . Hence the corresponding operator is the minimal operator associated in with the Jacobi (tri-diagonal) matrix
[TABLE]
In this particular case Theorem 3.5 was established in [65] and in the recent paper [67] it was extended to the case of Schrödinger operators in a space of vector-valued functions.
Remark 3.7**.**
Let us emphasize the difference between the operators generated by (1.2) and (1.4) in the case . Indeed, replacing by in (3.23) and noting that for all , we end up with the Jacobi matrix, which does not reflect spectral properties of the Hamiltonian . For example, setting , , (3.13) with in place of then gives rise to the matrix
[TABLE]
The Carleman test shows that the minimal operator associated with in is always self-adjoint, however, with for all defines in the minimal symmetric operator with deficiency indices (cf. Example 3.2). In particular, in this case the spectrum of every self-adjoint extension of (and hence of !) is purely discrete, however, the spectrum of with this choice of is purely absolutely continuous and covers the whole real line (cf. [57]). The latter shows that one cannot replace (1.2) by (1.4) in Theorem 3.5 if .
Remark 3.8**.**
One can notice a connection between the discrete Laplacian (3.17) and the operator without the boundary triplets approach. Namely, consider the kernel of , which consists of piecewise linear functions on . Every can be identified with its values on . First of all, notice that
[TABLE]
Now restrict ourselves to the subspace of which consists of continuous functions vanishing everywhere on except finitely many edges. Clearly,
[TABLE]
defines an equivalent norm on . On the other hand, for every we get
[TABLE]
However, one can easily check that the latter is the quadratic form of the discrete operator defined in by (3.17), that is, the following equality
[TABLE]
holds for every .
4. Quantum graphs with Kirchhoff vertex conditions
As in Section 3, if it is not explicitly stated, we shall always assume that satisfies Hypotheses 2.1 and 3.1. In this section we restrict ourselves to the case , that is, we consider the quantum graph with Kirchhoff vertex conditions
[TABLE]
at every vertex . Let us denote by the closure of the corresponding operator given by (3.3). By Theorem 3.5, the spectral properties of are closely connected with those of , where is the discrete Laplacian defined in by the difference expression
[TABLE]
and the functions , are defined by (3.11) and (3.14), respectively,
[TABLE]
Note that both operators and are symmetric and nonnegative. Moreover, Theorem 3.5 immediately implies the following result.
Corollary 4.1**.**
Assume that Hypotheses 2.1 and 3.1 are satisfied. Then:
- (i)
The deficiency indices of and are equal and
[TABLE]
In particular, is self-adjoint if and only if is self-adjoint.
Assume in addition that (and hence also ) is self-adjoint. Then:
- (ii)
* is positive definite if and only if the same is true for .*
- (iii)
* if and only if .*
- (iv)
The spectrum of is purely discrete if and only if the number is finite for every and the spectrum of the operator is purely discrete.
Our next goal is to use the spectral theory of discrete Laplacians (4.2) to prove new results for quantum graphs.
4.1. Intrinsic metrics on graphs
During the last decades a lot of attention has been paid to the study of spectral properties of the discrete Laplacian (4.2). Let us recall several basic concepts. Suppose that the metric graph satisfies Hypotheses 2.1 and 3.1. The function defined by
[TABLE]
is called the weighted degree. Notice that by [28, Lemma 1] (see also [60, Theorem 11]), is bounded on (and hence self-adjoint) if and only if the weighted degree is bounded on . In this case (see [28, Lemma 1])
[TABLE]
A pseudo metric on is a symmetric function such that for all and satisfies the triangle inequality. Notice that every function generates a path pseudo metric on with respect to the graph via
[TABLE]
Here the infimum is taken over all paths connecting and .
Following [44] (see also [12, 59]), a pseudo metric on is called intrinsic with respect to the graph if
[TABLE]
holds on . Notice that for any given locally finite graph an intrinsic metric always exists.
Example 4.2**.**
- (a)
Let be defined by
[TABLE]
It is straightforward to check that the corresponding path pseudo metric is intrinsic (see [55, Example 2.1], [59]).
- (b)
Another pseudo metric was suggested in [25]. Namely, let be a path pseudo metric generated by the function
[TABLE]
It was shown in [55] that this metric is equivalent to the metric (4.8) if and only if the combinatorial degree is bounded on .
It turns out that for the discrete operator given by (4.2), (4.3) the natural path metric induced by the metric graph is intrinsic.
Lemma 4.3**.**
The function given by
[TABLE]
generates an intrinsic (with respect to the graph ) path metric on .
Proof.
First of all, notice that for the functions (4.3) the condition (4.7) takes the following form
[TABLE]
for every . Clearly (4.11) holds with for all with equality instead of inequality since
[TABLE]
whenever . ∎
For any and , the distance ball with respect to a pseudo metric is defined by
[TABLE]
Finally for a set , the combinatorial neighbourhood of is given by
[TABLE]
4.2. Self-adjointness of
In this and the following subsections we shall always assume that the metric graph satisfies Hypotheses 2.1 and 3.1. We begin with the following result.
Theorem 4.4**.**
If the weighted degree is bounded on ,
[TABLE]
then the operator is self-adjoint.
Proof.
Consider the corresponding boundary operator defined by (4.2). Since is bounded on , the operator is bounded on (see (4.5)) and hence self-adjoint. It remains to apply Corollary 4.1(i). ∎
As an immediate corollary of this result we obtain the following widely known sufficient condition (cf. [15, Theorem 1.4.19]).
Corollary 4.5**.**
If , then the operator is self-adjoint.
Proof.
By Theorem 4.4, it suffices to check that is bounded on :
[TABLE]
A few remarks are in order:
Remark 4.6**.**
- (i)
Numerous graphs considered both in theoretical purposes and in applications belong to this category **[15]**. Prominent examples are equilateral graphs (see, e.g., **[21, 87, 88]**) and periodic graphs (with a finite number of edges in the period cell).
- (ii)
Notice that under Hypothesis 3.1, the conditions and (4.14) are equivalent only if . It is not difficult to construct examples of graphs such that and condition (4.14) is satisfied (see Example 4.7 below).
Example 4.7**.**
Let be a strictly increasing sequence of natural numbers. Consider the following metric graph: Let be a distinguished vertex which has emanating edges. Moreover, suppose that one of those edges has length and the other edges have a fixed length, say . Next, suppose every vertex in the first combinatorial sphere (i.e., every ) has emanating edges and again their lengths equal except one edge having length . Continuing this procedure to infinity we end up with an infinite metric graph (called a rooted tree) such that
[TABLE]
It is easy to see that
[TABLE]
Hence, by Theorem 4.4 the corresponding Hamiltonian is self-adjoint. Moreover, we shall prove below (see Lemma 5.1) that in this case the corresponding Hamiltonian with interactions is self-adjoint for any .
The next result shows that we can replace uniform boundedness of the weighted degree function by the local one (in a suitable sense of course).
Theorem 4.8**.**
Let be an intrinsic pseudo metric on such that the weighted degree is bounded on every distance ball in . Then is self-adjoint.
Proof.
By [55, Theorem 1], the operator is self-adjoint. Hence by Corollary 4.1(i) so is . ∎
As an immediate corollary we arrive at the following Gaffney type theorem for quantum graphs.
Corollary 4.9**.**
Let be a natural path metric on defined in Lemma 4.3. If is complete as a metric space, then is self-adjoint.
Proof.
By Hypothesis 3.1, the discrete graph is locally finite. Hence by a Hopf–Rinow type theorem [55], is complete as a metric space if and only if the distance balls in are finite. The latter immediately implies that the weighted degree is bounded on every distance ball in . It remains to apply Theorem 4.8. ∎
Remark 4.10**.**
Notice that Corollary 4.9 can be seen as the analog of the classical result of Gaffney [47] (see also [50, Chapter 11] for further details), who established self-adjointness of the Dirichlet Laplacian on a complete Riemannian manifold. Indeed, generates a natural path metric on a metric graph and it is easy to check that equipped with this metric is complete as a metric space if and only if is complete as a metric space.
Let us also mention that Corollary 4.9 proves the self-adjointness of if the metric graph satisfies the finite ball condition (see [15, Assumption 1.3.5]), which is equivalent to the completeness of .
On the one hand, simple examples demonstrate that Corollary 4.9 is sharp. Indeed, consider the second derivative on an interval with . As in Example 3.2, let be a strictly increasing sequence such that as . In this case Kirchhoff conditions are equivalent to the continuity of a function and its derivative at every vertex (see (3.4)). The corresponding operator is self-adjoint only if . However, we can improve Corollary 4.9 by replacing the natural path metric by another path metric (which is not intrinsic!) generated by the weight function .
Theorem 4.11**.**
Let be defined by
[TABLE]
where is given by (4.3), and let be the corresponding path metric (4.6). If is complete as a metric space, then is self-adjoint.
Proof.
Applying the Hopf–Rinow theorem from [55] once again, is complete as a metric space if and only if all infinite geodesics have infinite length, which is further equivalent to the fact that distance balls in are finite. The former statement implies, in particular, that for every infinite path its length
[TABLE]
is infinite. However, (4.15) implies the following estimate
[TABLE]
for every finite path in . Hence for every infinite path we conclude that the sum
[TABLE]
is infinite. By Theorem 6 from [61], the latter implies that the operator is self-adjoint in . It remains to apply Corollary 4.1(i). ∎
As an immediate corollary of Theorem 4.11 we obtain the following improvement of Corollary 4.5.
Corollary 4.12**.**
If
[TABLE]
then the operator is self-adjont.
Proof.
Clearly, every infinite geodesic in has infinite length if (4.16) is satisfied. According to Hypothesis 3.1, is a locally finite graph and hence combining the Hopf–Rinow type theorem [55] with Theorem 4.11 we finish the proof. ∎
Remark 4.13**.**
- (i)
Notice that the self-adjointness of in under the assumption (4.16) was first mentioned in **[53, Corollary 9.2]**.
- (ii)
Clearly, for all and hence every infinite geodesic in with infinite length will have an infinite length in . However, the converse statement is not true which can be seen by simple examples.
Example 4.14**.**
Let be a planar graph constructed as follows (see the figure depicted below). Let be a strictly increasing sequence with . We set and denote , and . Now we define the set of edges by the following rule: if either and or and . Finally, we assign lengths as the usual Euclidean length in : the length of every vertical edge is equal to , and the length of the horizontal edge is equal to .
\bullet$$v_{1,0}$$\bullet$$v_{2,0}$$\bullet$$v_{3,0}$$\bullet$$v_{4,0}$$\bullet$$v_{5,0}$$\bullet$$v_{1,1}$$\bullet$$v_{2,1}$$\bullet$$v_{3,1}$$\bullet$$v_{4,1}$$\bullet$$v_{5,1}$$\bullet$$v_{1,-1}$$\bullet$$v_{2,-1}$$\bullet$$v_{3,-1}$$\bullet$$v_{4,-1}$$\bullet$$v_{5,-1}
Clearly, is complete as a metric space if and only if
[TABLE]
On the other hand,
[TABLE]
for all , and hence is always complete. Therefore, the corresponding operator is always self-adjoint in view of Corollary 4.12.
Remark 4.15**.**
The graphs considered in Examples 4.7 and 4.14 belong to a special class of graphs, the so-called trees. More precisely, a path is called a cycle if . A connected graph without cycles is called a tree. Notice that for any two vertices , on a tree there is exactly one path connecting and and hence every path on a tree is a geodesic with respect to a path metric.
Let us finish this subsection with some sufficient conditions for to have nontrivial deficiency indices. Let be a path metric on generated by the function defined by
[TABLE]
If is not complete as a metric space, we then denote the metric completion of by and . By [25, Lemma 2.1], every function such that the corresponding quadratic form
[TABLE]
is finite, is uniformly Lipschitz with respect to the metric and hence admits a continuation to as a Lipschitz function. Following [25], we set .
Proposition 4.16**.**
If is not complete as a metric space and there is such that and , then is not a self-adjoint operator.
Proof.
Follows from [25, Theorem 3.1] and Corollary 4.1(i). ∎
A few remarks are in order.
Remark 4.17**.**
- (i)
The question on deficiency indices of in this case was left in **[25]** as an open problem.
- (ii)
Clearly, Proposition 4.16 provides only a sufficient condition for to have nontrivial deficiency indices.
Example 4.18**.**
Let us slightly modify the metric graph considered in Example 4.14 by shrinking the vertical edges. It is not difficult to show (see, e.g., [19, 20]) that the corresponding operator is not self-adjoint if the graph has finite total length,
[TABLE]
On the other hand, the latter is further equivalent to the fact that is not complete as a metric space. Thus, Theorem 4.11 provides a self-adjointness criterion in this case.
Let us also mention that we expect that the deficiency indices of the operator in the case (4.18) are equal to one.
Remark 4.19**.**
Taking into account the above example, it is a rather natural guess that Theorem 4.11 provides a self-adjointness criterion not only in the special case considered in Example 4.18 but also for arbitrary graphs. However, for radially symmetric trees, the operator is not self-adjoint exactly when the corresponding tree has finite total length, that is, (4.18) holds true (see [105, §3.4] and also [19]). Moreover, it is easy to check that in this case (4.18) is not equivalent to non-completeness of .
4.3. Uniform positivity and the essential spectrum of
For any vertex set , *the boundary * of is defined by
[TABLE]
For every subset one defines the isoperimetric constant
[TABLE]
where
[TABLE]
Moreover, we need the isoperimetric constant at infinity
[TABLE]
Theorem 4.20**.**
Suppose that the operator is self-adjoint. Then:
- (i)
* is uniformly positive whenever .*
- (ii)
* if .*
- (iii)
The spectrum of is purely discrete if the number is finite for every and .
Proof.
Let be a natural path metric on (see Lemma 4.3). Noting that is an intrinsic metric on , let us apply the Cheeger estimates from [12] to the discrete Laplacian given by (4.2), (4.3). First of all (see [12, Section 2.3]), observe that the weighted area with respect to is given by
[TABLE]
Hence in this case the Cheeger estimate for discrete Laplacians (see Theorems 3.1 and 3.3 in [12]) implies the following estimates
[TABLE]
Combining these estimates with Corollary 4.1(ii)–(iii), we prove (i) and (ii), respectively.
Applying [12, Theorem 3.3] once again, we see that the spectrum of is purely discrete if . Corollary 4.1(iv) finishes the proof of (iii). ∎
Let be a distance ball with respect to the natural path metric . Following [54] (see also [59]), we define
[TABLE]
for a fixed , and
[TABLE]
Notice that does not depend on if .
Theorem 4.21**.**
Let be complete as a metric space. Then:
- (i)
* if .*
If in addition , then
- (ii)
* if .*
- (iii)
The spectrum of is not discrete if .
Proof.
By Corollary 4.9, the operator is self-adjoint. The proof follows from the growth volume estimates on the spectrum of . More precisely, the following bounds were established in [54] (see also [43, 59]):
[TABLE]
It remains to apply Corollary 4.1(ii)-(iv). ∎
We finish this section with a remark.
Remark 4.22**.**
Connections between and and also between and by means of Theorem A.6 and Theorem A.9 are rather complicated since they involve the corresponding Weyl function, which in our case has the form (2.19). In particular, it would be a rather complicated task to use these connections and then apply the Cheeger-type bounds for to estimate and . For example, the following upper estimate, which easily follows from (2.29),
[TABLE]
seems to be unrelated to .
5. Spectral properties of quantum graphs with -couplings
In this section we are going to investigate spectral properties of the Hamiltonian with -couplings (3.2) at the vertices. Namely, let and the operator be defined in as the closure of (3.3). By Theorem 3.5, its spectral properties correlate with the corresponding properties of the discrete operator defined in by (3.17). In this section we shall always assume Hypotheses 2.1 and 3.1.
5.1. Self-adjointness and lower semiboundedness
We begin with the study of the self-adjointness of the operator . Our first result can be seen as a straightforward extension of Theorem 4.4.
Lemma 5.1**.**
If the weighted degree function defined by (4.4) is bounded on , that is, (4.14) is satisfied, then the operator is self-adjoint for any . Moreover, in this case the operator is bounded from below if and only if
[TABLE]
Proof.
The operator of multiplication defined in on the maximal domain by
[TABLE]
is clearly self-adjoint. If is bounded on , then the operator is bounded and self-adjoint in (see (4.5)). It remains to note that and hence is a self-adjoint operator since the self-adjointness is stable under bounded perturbations. Moreover, is bounded from below if and only if so is . The latter is clearly equivalent to (5.1). Theorem 3.5(i)-(ii) completes the proof. ∎
As an immediate corollary we arrive at the following result.
Corollary 5.2**.**
If , then the operator is self-adjont for any . Moreover, is bounded from below if and only if satisfies (5.1).
Proof.
As in the proof of Corollary 4.5, we get
[TABLE]
It remains to apply Lemma 5.1. ∎
Remark 5.3**.**
A few remarks are in order.
- (i)
Using the form approach, the self-adjointness claim in Corollary 5.2 was proved in **[15, Section I.4.5]** under the additional assumption that is bounded from below,
[TABLE]
If , then it is easy to see that (5.3) is equivalent to (5.1).
- (ii)
Let us also mention that the graphs constructed in Examples 4.7 and 4.14 do not satisfy the condition of Corollary 5.2, however, they satisfy (4.14) and hence, by Lemma 5.1, the corresponding Hamiltonian is self-adjoint for any .
The next result allows us to replace the boundedness assumption on the weighted degree by the local boundedness, however, now we need to assume some semiboundedness on . We begin with the following result.
Proposition 5.4**.**
If the operator with Kirchhoff vertex conditions is self-adjoint in , then the operator with -couplings on is self-adjoint whenever the function satisfies (5.1).
Proof.
By Corollary 4.1(i), the discrete Laplacian given by (4.2), (4.3) is a nonnegative self-adjoint operator in . On the other hand, (5.1) implies that the multiplication operator defined by (5.2) is a self-adjoint lower semibounded operator in . Noting that is a core for both and since the graph is locally finite, we conclude that the operator defined as a closure of the sum of and is a lowersemibounded self-adjoint operator in (see [58, Chapter VI.1.6]). It remains to apply Theorem 3.5(i). ∎
Remark 5.5**.**
It follows from the proof of Proposition 5.4 and Theorem 3.5(ii) that the operator is lower semibounded in this case.
Combining Proposition 5.4 with the self-adjointness results from Section 4.2, we can extend Corollary 5.2 to a much wider setting. Let us present only one result in this direction.
Corollary 5.6**.**
Let be the path metric (4.15), (4.6) on . If is complete as a metric space and satisfies (5.1), then is a lower semibounded self-adjoint operator.
In particular, if the weight function satisfies (4.16) and , then is a lower semibounded self-adjoint operator.
Proof.
Straightforward from Proposition 5.4, Theorem 4.11 and Corollary 4.12. ∎
Remark 5.7**.**
Let us stress that both conditions (completeness of and (5.1)) are important. Indeed, 1-D Schrödinger operators with -type interactions (see Example 3.2) immediately provide counterexamples. First of all, in this setting completeness of means that we consider a Schrödinger operator on an unbounded interval (either on the whole line or on a semi-axis). Clearly, in the case of a compact interval the minimal operator is not self-adjoint even in the case of trivial couplings . On the other hand, it was proved in [5] that in the case when all -interactions are attractive ( for all ), the operator given by (3.5) is bounded from below if and only if
[TABLE]
In the case the latter is equivalent to .
5.2. Negative spectrum: CLR-type estimates
Let be a nonnegative function on . The main focus of this section is to obtain the estimates on the number of negative eigenvalues of the operator in terms of the interactions . Note that by Theorem 3.5(iv),
[TABLE]
where is the (self-adjoint) discrete Laplacian defined either by (3.13) in or by (3.17) in .
Suppose that the discrete Laplacian defined by (3.17) with is a self-adjoint operator in (see Section 4.2). It is well known (cf., e.g., [46]) that in this case generates a symmetric Markovian semigroup (one can easily check that the Beurling–Deny conditions [27, 46] are satisfied). Let us consider the corresponding quadratic form in :
[TABLE]
which is a regular Dirichlet form since is locally finite (see [46, 61]). Recall that the functions and are given by (4.3).
The following theorem is a particular case of [74, Theorems 1.2–1.3] (see also [45, Theorem 2.1]). As it was already mentioned, generates a symmetric Markovian semigroup in . Noting that for all , where is a multiplication operator (5.2), and then applying [74, Theorems 1.2–1.3] (see also [45, Theorem 2.1]) to the operator , we arrive at the following result.
Theorem 5.8** ([74]).**
Assume that is a self-adjoint operator in . Then the following conditions are equivalent:
- (i)
There are constants and such that
[TABLE]
for all with .
- (ii)
There are constants and such that for all belonging to the form
[TABLE]
is bounded from below and closed in and, moreover, the negative spectrum of is discrete and the following estimate holds
[TABLE]
Remark 5.9**.**
- (i)
The constants and in Theorem 5.8 are connected by (see **[45]**).
- (ii)
Since is a core for both and whenever is essentially self-adjoint, it follows from Theorem 5.8 that the operator is bounded from below and self-adjoint for all if (5.7) is satisfied.
Combining Theorem 3.5(iv) with Theorem 5.8, we immediately arrive at the following CLR-type estimate for quantum graphs with -couplings at vertices.
Theorem 5.10**.**
Assume that is a self-adjoint operator in . Then the following conditions are equivalent:
- (i)
There are constants and such that (5.7) holds for all with .
- (ii)
There are constants and such that for all belonging to the operator is self-adjoint, bounded from below, its negative spectrum is discrete and the following estimate holds
[TABLE]
The constants and are connected by .
Of course, the most difficult part is to check the validity of the Sobolev-type inequality (5.7). However, there are several particular cases of interest when (5.7) is known to be true (see [51], [101], [106] and references therein).
Corollary 5.11**.**
Let the metric graph be such that the discrete graph is a Cayley graph of a group of polynomial growth with . If belongs to , then
[TABLE]
with some constant , which depends only on .
Proof.
By Theorem 5.10, we only need to show that (5.7) holds true. The argument is similar to [74, Theorem 3.7]. Indeed, by [106, Theorem VI.5.2], since is a Cayley graph of the group of polynomial growth, there is a such that
[TABLE]
for all with . Since (see Hypothesis 3.1), we get
[TABLE]
for all . Combining this inequality with (5.11) and noting that
[TABLE]
we get (5.7). ∎
Remark 5.12**.**
Notice that in Corollary 5.11 we did not make any additional assumptions on the weight function . Namely, we only assumed that the edges lengths satisfy (3.1).
In particular, in the case we get the following estimate.
Corollary 5.13**.**
Let with . Also, assume that (3.1) is satisfied. If belongs to , then
[TABLE]
with some constant , which depends only on and .
It was first noticed by G. Rozenblum and M. Solomyak (see [95, Theorem 3.1] and also [96]) that in contrast to Schrödinger operators on , in the case for every the following holds
[TABLE]
whenever and , that is,
[TABLE]
as or equivalently as , where is a re-arrangement of in a decreasing order. Define
[TABLE]
It turns out that the later holds in a wider setting and hence we arrive at the following result.
Proposition 5.14**.**
Assume the conditions of Theorem 5.10. If satisfies (4.14), then for every
[TABLE]
whenever . Here the constant depends only on , and .
Proof.
By Theorem 3.5(iv), we only need to show that
[TABLE]
The validity of (5.15) was established in [96, Theorem 3.1] under the additional assumptions and . In fact, this proof (see also [95, §3]) can be extended line by line to the case of graphs satisfying (4.14). ∎
Remark 5.15**.**
For a further discussion of eigenvalue estimates for discrete operators and quantum graphs on the lattice we refer to [97].
Remark 5.16**.**
To a large extent, the behavior of the negative spectrum of is determined by the behavior of the following function
[TABLE]
where is the heat kernel (see [94, 96] and also [45, 84, 85]). In particular, the exponents and determined by
[TABLE]
and called the local dimension and the global dimension, respectively, are very important in the analysis of (see Section 2 in [94]). By [106, Theorem II.5.2], (5.7) is equivalent to the following estimate
[TABLE]
with some positive constant . On the other hand, if (4.14) holds, that is, if is a bounded operator and, moreover, . It is precisely this fact which allows to prove Proposition 5.14. Note that for Schrödinger operators on and hence the estimates of the type (5.14) have no analogues in this case.
Equality (5.5) together with Remark 5.16 indicate that there is a close connection between the heat semigroups and . In fact, the following holds true.
Theorem 5.17**.**
Assume that and are self-adjoint operators in and , respectively. Then the following statements are equivalent
- (i)
* holds for all with some and ,*
- (ii)
* holds for all with some and .*
Here the constants and might be different.
Proof.
By Varopoulos’s theorem (see [106, Theorem II.5.2]), (i) and (ii) are equivalent to the validity of the corresponding Sobolev type inequalities. Namely, (i) is equivalent to (5.7) and (ii) is equivalent to the inequality
[TABLE]
where is the Sobolev space on , which coincides with the form domain of the operator , and and . Hence it suffices to show that (5.7) is equivalent to (5.19).
First observe that every admits a unique decomposition , where is piecewise linear on and takes zero values at the vertices . It is easy to check that
[TABLE]
Moreover, we have (see Remark 3.8):
[TABLE]
Next it is easy to see that (5.19) holds for all with and with a constant which depends only on and . Noting that every piecewise linear function satisfies
[TABLE]
we conclude that (i) implies (ii).
Clearly, to prove that (ii) implies (i) it suffices to show that every linear function on a finite interval satisfies the estimate
[TABLE]
where is a positive constant which depends only on . Indeed, we have (cf. Remark 3.8)
[TABLE]
Applying the Hölder inequality to the left-hand side in (5.21), one gets
[TABLE]
On the other hand, applying the Cauchy–Schwarz inequality to the right-hand side in (5.21), we arrive at
[TABLE]
where depends only on . Combining this estimate with (5.21) and (5.22), we obtain (5.20), which implies that
[TABLE]
holds for all . ∎
Remark 5.18**.**
The implication in Theorem 5.17 was observed by Rozenblum and Solomyak (see [96, Theorem 4.1]), however, for a different discrete Laplacian defined by (1.4), where the weight function is replaced by the vertex degree function . Since
[TABLE]
for all and , is continuously embedded into , however, the converse is not true. This together with Theorem 5.8 imply that one cannot replace (4.2) by (1.4) in Theorem 5.17 and the converse statement to Theorem 4.1 in [96] is not true without further assumptions on the function .
5.3. Spectral types
In this subsection we plan to investigate the structure of the spectrum of .
5.3.1. Resolvent comparability
We begin with the following simple corollary of Theorem 3.5(viii).
Corollary 5.19**.**
Assume the conditions of Theorem 3.5.
- (i)
If , then . In particular, if , then .
- (ii)
If , then . In particular, if , then .
Here means that the set is finite for every .
Proof.
It suffices to note that for all . Hence if and then, by the Weyl theorem and Theorem 3.5(viii), we prove the first claim.
Moreover, whenever . It remains to apply Theorem 3.5(viii) and the Birman–Krein theorem. ∎
The presence (or absence) of an absolutely continuous spectrum for quantum graphs with Kirchhoff vertex conditions at vertices is a challenging open problem. To the best of our knowledge, some partial results have been obtained in the cases of radially symmetric trees and for some special classes of (equilateral) graphs that originate from groups, e.g., the corresponding Cayley graphs or Schreier graphs (see, e.g., [16], [36], [37], [41], [105]). In particular, it is shown in [41, Theorem 5.1] that in the case when is a rooted radial tree with a finite complexity of the geometry, the absolutely continuous spectrum of is nonempty if and only if is eventually periodic.
Our next result provides a sufficient condition for to have purely singular spectrum.
Theorem 5.20**.**
Assume that and . If is such that for any infinite path without cycles
[TABLE]
then .
Proof.
The proof is based on the standard trace class argument [103]. By Corollary 5.2, the operator is self-adjoint. Since (5.23) holds for every infinite path , we can find a subset such that
[TABLE]
and the graph is a countable union of finite subgraphs , such that the boundary of every subgraph is contained in . Define a new function by
[TABLE]
that is, at every vertex the corresponding boundary condition for is given by (3.2) and at every vertex it has the Dirichlet boundary condition. Let us show that
[TABLE]
It is easy to see that under the assumptions and the triplet given by (2.21), (2.22) is a boundary triplet for . Next we set
[TABLE]
where and are given by (3.7), and
[TABLE]
where
[TABLE]
Observe that the corresponding boundary relations and parameterizing and via the boundary triplet are the closures of
[TABLE]
Straightforward calculations show that
[TABLE]
which is finite according to (5.24). Therefore, by Theorem A.3(iv), (5.26) holds true. It remains to note that is the orthogonal sum of operators having discrete spectra and hence the spectrum of is pure point. The Birman–Krein theorem then yields . ∎
Corollary 5.21**.**
Let be a rooted radially symmetric tree with the root and such that and . Also, let be radially symmetric, that is, for all such that , where is the combinatorial distance from to the root . If
[TABLE]
then .
Remark 5.22**.**
Corollary 5.21 can be seen as the analog of [104, Theorem 3] and [80, Theorem 1]. Moreover, the assumption in Theorem 5.20 and Corollary 5.21 can be removed by adding inessential vertices.
5.3.2. Bounds on the spectrum of
Throughout this subsection we shall assume that , that is, all interactions at vertices are nonnegative. Let be an intrinsic metric. In order to include into Cheeger type estimates, we need to modify the definition of Cheeger constants (4.20) and (4.22) following [60], [12]. For every subgraph one defines the modified isoperimetric constant
[TABLE]
where
[TABLE]
and
[TABLE]
Moreover, we need the isoperimetric constant at infinity
[TABLE]
Theorem 5.23**.**
Suppose that the operator is self-adjoint. Then:
- (i)
* is uniformly positive if .*
- (ii)
* if .*
- (iii)
The spectrum of is discrete if the number is finite for every and .
Proof.
The proof is analogous to that of Theorem 4.20 and we only need to use the corresponding modifications of Cheeger type bounds for the discrete operator from [12]. ∎
6. Other boundary conditions
In the present paper our main focus was on the Kirchhoff and -type couplings at vertices (see (3.2)). There are several other physically relevant classes of couplings (see, e.g., [15, 22, 32]). Our main result, Theorem 2.9, covers all possible cases, however, the key problem is to calculate the boundary operator and then to investigate its spectral properties. It turned out that for -couplings the corresponding boundary operator is given by the discrete Laplacian (3.17), which attracted an enormous attention during the last three decades. However, for other boundary conditions new nontrivial discrete operators of higher order may arise. For example, this happens in the case of the so-called -couplings, cf. [32]. Namely (see [22, 32]), let and consider the following boundary conditions at the vertices :
[TABLE]
Define the corresponding operator as the closure of the operator given by
[TABLE]
To avoid lengthy and cumbersome calculations of the corresponding boundary relation parameterizing with the help of the boundary triplet constructed in Corollary 2.5, let us consider the kernel of as in Remark 3.8. Recall that consists of piecewise linear functions on and every can be identified with its values on , . Moreover, the norm of is equivalent to
[TABLE]
It is not difficult to see that (see also [15, p.27])
[TABLE]
Therefore, for every we get
[TABLE]
Clearly, the right-hand side in (6.3) is a form sum of two difference operators, where the first one is the standard discrete Laplacian, however, the second one gives rise to a difference expression of higher order. In particular, its order at every vertex equals the degree of the corresponding vertex . Unfortunately, we are not aware of the literature where the difference operators of this type have been studied.
Appendix A Boundary triplets and Weyl functions
A.1. Linear relations
Let be a separable Hilbert space. A (closed) linear relation in is a (closed) linear subspace in . The set of all closed linear relations is denoted by . Since every linear operator in can be identified with its graph, the set of linear operators can be seen as a subset of all linear relations in . In particular, the set of closed linear operators is a subset of .
Recall that the domain, the range, the kernel and the multivalued part of a linear relation are given, respectively, by
[TABLE]
The adjoint linear relation is defined by
[TABLE]
is called symmetric if . If , then it is called self-adjoint. Note that is orthogonal to if is symmetric. Setting , we obtain the orthogonal decomposition of a symmetric linear relation :
[TABLE]
where and is a symmetric linear operator in , called the operator part of .
The inverse of the linear relation is given by
[TABLE]
The sum of linear relations and is defined by
[TABLE]
Hence one can introduce the resolvent of the linear relation , which is well defined for all . However, the set of those for which is a graph of a closed bounded operator in is called the resolvent set of and is denoted by . Its complement is called the spectrum of . If is symmetric, then taking into account (A.2) we obtain
[TABLE]
This immediately implies that , and, moreover, one can introduce the spectral types of as those of its operator part .
Let us mention that self-adjoint linear relations admit a very convenient representation, which was first obtained by Rofe-Beketov [92] in the finite dimensional case (see also [102, Exercises 14.9.3-4]).
Proposition A.1**.**
Let and be bounded operators on and
[TABLE]
Then is self-adjoint if and only if
[TABLE]
If , then the second condition in (A.5) is equivalent to .
Further details and facts about linear relations in Hilbert spaces can be found in, e.g., [30, Chapter 6.1], [102, Chapter 14].
A.2. Boundary triplets and proper extensions
Let be a densely defined closed symmetric operator in a separable Hilbert space with equal deficiency indices .
Definition A.2** ([48]).**
A triplet is called a boundary triplet for the adjoint operator if is a Hilbert space and are bounded linear mappings such that the abstract Green’s identity
[TABLE]
holds for all and the mapping
[TABLE]
is surjective.
A boundary triplet for exists if and only if the deficiency indices of are equal (see, e.g., [30, Prop.7.4], [102, Prop. 14.5]). Moreover, and . Note also that the boundary triplet for is not unique.
An extension of is called proper if . The set of all proper extensions is denoted by .
Theorem A.3** ([29, 78]).**
Let be a boundary triplet for . Then the mapping defines a bijective correspondence between and the set of all linear relations in :
[TABLE]
Moreover, the following holds:
- (i)
.
- (ii)
* if and only if .*
- (iii)
* is symmetric if and only if is symmetric and holds. In particular, is self-adjoint if and only if is self-adjoint.*
- (iv)
If and , then for every the following equivalence holds
[TABLE]
If additionally , then
[TABLE]
Notice that according to (A.3), the deficiency indices of a symmetric linear relation can be defined as the deficiency indices of its operator part . Moreover, a self-adjoint linear relation is said to belong to the von Neumann–Schatten ideal if its operator part belongs to .
Remark A.4**.**
The proof of Theorem A.3(i)–(ii) can be found in, e.g., [30, Prop. 7.8], [102, Prop. 14.7]; (iii) was obtained in [78, Prop. 3], see also [30, Prop. 7.14]; for the proof of item (iv) see [29, Theorem 2].
A.3. Weyl functions and extensions of semibounded operators
With every boundary triplet one can associate two linear operators
[TABLE]
Clearly, (A.8) implies and , where and . It easily follows from Theorem A.3(iii) that and .
Definition A.5** ([29]).**
Let be a boundary triplet for . The operator-valued function defined by
[TABLE]
is called the Weyl function corresponding to the boundary triplet .
The Weyl function is well defined and holomorphic on . Moreover, it is a Herglotz–Nevanlinna function (see [29, §1], [30, §7.4.2] and also [102, §14.5]).
Assume now that is a lower semibounded operator, i.e., with some . Let be the largest lower bound for ,
[TABLE]
The Friedrichs extension of is denoted by . If is a boundary triplet for such that , then the corresponding Weyl function is holomorphic on . Moreover, is strictly increasing on (that is, for all , , is positive definite whenever ) and the following strong resolvent limit exists (see [29])
[TABLE]
However, is in general a closed linear relation which is bounded from below.
Theorem A.6** ([29, 77]).**
Let with some and let be a boundary triplet for such that . Also, let and be the corresponding self-adjoint extension (A.8). If , then:
- (i)
* if and only if .*
- (ii)
[TABLE]
If additionally is positive definite, that is, , then:
- (iii)
* is positive definite if and only if is positive definite.*
- (iv)
For every the following equivalence holds
[TABLE]
where .
- (v)
For every the following equivalence holds
[TABLE]
as . Moreover, either or .
Remark A.7**.**
For the proofs of (i) and (ii) consult Theorems 5 and 6 in [29]; the proofs of (iii)–(v) can be found in [77, Theorem 3].
We also need the following important statement (see [29, Theorem 3] and [30, Theorem 8.22]).
Theorem A.8** ([29]).**
Assume the conditions of Theorem A.6. Then the following statements
- (i)
* is lower semibounded,*
- (ii)
* is lower semibounded,*
are equivalent if and only if tends uniformly to as , that is, for every there exists such that for all .
The implication always holds true (cf. Theorem A.6(i)), however, the validity of the converse implication requires that tends uniformly to . Let us mention in this connection that the weak convergence of to , i.e., the relation
[TABLE]
holds for all whenever . Moreover, this relation characterizes Weyl functions of the Friedrichs extension among all non-negative (and even lower semibounded) self-adjoint extensions of (see [68], [29, Proposition 4]).
The next new result establishes a connection between the essential spectra of and and also it can be seen as an improvement of Theorem A.6 (iv).
Theorem A.9**.**
Let and let be a boundary triplet for such that . Also, let be the corresponding Weyl function and let be such that is lower semibounded. Then the following equivalences hold:
[TABLE]
Proof.
First observe that (A.11) easily follows from Theorem A.6(iv). Hence it remains to prove (A.12) since (A.13) follows from (A.11) and (A.12).
Since is uniformly positive and , we can assume without loss of generality that . Indeed, and hence we can replace the boundary triplet by the triplet and in this case the Weyl function and the boundary relation are replaced respectively by and . Moreover, for simplicity we shall assume that is a self-adjoint linear operator (cf. (A.3)).
We divide the proof of (A.12) into two parts.
(i) Let us first establish the implication “” in (A.12). For , we set
[TABLE]
and then define the operators , . Since both subspaces and are reducing for , . Moreover, we set
[TABLE]
Combining this inequality with the assumption and applying Theorem A.6(iii), we obtain that for some .
On the other hand, is lower semibounded since so is (see a remark after Theorem A.8). Hence the operator is lower semibounded too and by the definition of either is finite-rank or the point is the only accumulation point for , i.e., . Therefore,
[TABLE]
By Theorem A.3 (iv), this relation yields
[TABLE]
which, in turn, implies . Hence
[TABLE]
This proves the implication “” in (A.12).
(ii) To prove the remaining implication “” in (A.12), let and assume the contrary, that is . Then at least one of the following two conditions is satisfied:
[TABLE]
In the first case, Theorem A.6(ii) implies . Since is lower semibounded, we get , which contradicts the assumption .
In the second case, recall that with . The corresponding Weyl function is analytic on and is positive definite for all . Fix some and let be such that . Noting that
[TABLE]
for all f\in\operatorname{ran}E_{B}([0,\delta)\big{)}\setminus\{0\}, we get
[TABLE]
for all whenever . By Theorem A.6(ii),
[TABLE]
and hence since is lower semibounded. This contradiction finishes the proof. ∎
A.4. Direct sums of boundary triplets
Let be a countable index set, . For each , let be a closed densely defined symmetric operator in a separable Hilbert space such that . Also, let be a boundary triplet for the operator , . In the Hilbert space , consider the operator , which is symmetric and . Its adjoint is given by . Let us define a direct sum of boundary triplets by setting
[TABLE]
Note that given by (A.18) may not form a boundary triplet for in the sense of Definition A.2 (for example, or may be unbounded) and first counterexamples were constructed by A. N. Kochubei. The next result provides several criteria for (A.18) to be a boundary triplet for the operator .
Theorem A.10** ([65, 79, 18]).**
Let and let be defined by (A.18). Then the following conditions are equivalent:
- (i)
* is a boundary triplet for the operator .*
- (ii)
The mappings and are bounded as mappings from equipped with the graph norm to .
- (iii)
The Weyl functions corresponding to the triplets , , satisfy the following condition
[TABLE]
- (iv)
If in addition is a point of a regular type of the operator (i.e., there exists a positive constant such that for all ), then (i)–(iii) are further equivalent to
[TABLE]
Based on these criteria, different regularizations of triplets such that the corresponding direct sum forms a boundary triplet for were suggested in [18, 65, 79].
Acknowledgments
We thank Noema Nicolussi for useful discussions and helpful remarks. We are also grateful to the referees for the careful reading of our manuscript, their remarks and hints with respect to the literature that have helped to improve the exposition.
A.K. appreciates the hospitality at the Department of Theoretical Physics, Nuclear Physics Institute, during several short stays in 2016, where a part of this work was done.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Aizenman, R. Sims and S. Warzel, Stability of the absolutely continuous spectrum of random Schrödinger operators on tree graphs , Probab. Theory Related Fields 136 , 363–394 (2005).
- 2[2] M. Aizenman, R. Sims and S. Warzel, Absolutely continuous spectra of quantum tree graphs with weak disorder , Commun. Math. Phys. 264 , 371–389 (2006).
- 3[3] S. Albeverio, J. F. Brasche, M. M. Malamud, and H. Neidhardt, Inverse spectral theory for symmetric operators with several gaps: scalar-type Weyl functions , J. Funct. Anal. 228 , 144–188 (2005).
- 4[4] S. Albeverio, F. Gesztesy, R. Hoegh-Krohn, and H. Holden, Solvable Models in Quantum Mechanics , 2nd edn. with an appendix by P. Exner, Amer. Math. Soc., Providence, RI, 2005.
- 5[5] S. Albeverio, A. Kostenko, and M. Malamud, Spectral theory of semi-bounded Sturm-Liouville operators with local interactions on a discrete set , J. Math. Phys. 51 , Art. ID 102102 (2010).
- 6[6] S. Alexander, Superconductivity of networks. A percolation approach to the effects of disorder , Phys. Rev. B 27 , 1541–1557 (1985).
- 7[7] P. Alonso-Ruiz, Explicit formulas for heat kernels on diamond fractals , Commun. Math. Phys., to appear, doi: 10.1007/s 00220-018-3221-x (2018). · doi ↗
- 8[8] P. Alonso-Ruiz, U. Freiberg and J. Kigami, Completely symmetric resistance forms on the stretched Sierpinski gasket , J. Fractal Geometry 5 , no. 3, 227–277 (2018).
