Abstract
We consider a compact metric graph of size and attach to it several edges (leads) of length of order one (or of infinite length). As goes to zero, the graph obtained in this way looks like the star-graph formed by the leads joined in a central vertex. On we define an Hamiltonian , properly scaled with the parameter . We prove that there exists a scale invariant effective Hamiltonian on the star-graph that approximates (in a suitable norm resolvent sense) as . The effective Hamiltonian depends on the spectral properties of an auxiliary -independent Hamiltonian defined on the compact graph obtained by setting . If zero is not an eigenvalue of the auxiliary Hamiltonian, in the limit , the leads are decoupled.
MSC:
81Q35; 47A10; 34B45
1. Introduction
One nice feature of quantum graphs (metric graphs equipped with differential operators) is that they are simple objects. In many cases, for example in the framework of the analysis of self-adjoint realizations of the Laplacian, it is possible to write down explicit formulae for the relevant quantities, such as the resolvent or the scattering matrix (see, e.g., [] and []).
If the graph is too intricate though, it can be difficult, if not impossible, to perform exact computations. In such a situation, one may be interested in a simpler, effective model which captures only the most essential features of a complex quantum graph.
If several edges of the graph are much shorter then others, an effective model should rely on a simpler graph obtained by shrinking the short edges into vertices. These new vertices should keep track of at least some of the spectral or scattering properties of the shrinking edges, and perform as a black box approximation for a small, possibly intricate, network.
Our goal is to understand under what circumstances this type of effective models can be implemented. In this report we give some preliminary results showing that under certain assumptions such approximation is possible.
To fix the ideas, consider a compact metric graph of size (total length) , and attach to it several edges of length of order one (or of infinite length), the leads. Clearly, when goes to zero, the graph obtained in this way (let us denote it by ) looks like the star-graph formed by the leads joined in a central vertex. Let us denote by such star-graph and by the central vertex.
Given a certain Hamiltonian (self-adjoint Schrödinger operator) on , we want to show that there exists an Hamiltonian on such that, for small , approximates (in a sense to be specified) . Of course, one main issue is to understand what boundary conditions in the vertex characterize the domain of .
It turns out that, under several technical assumptions, the boundary conditions in are fully determined by the spectral properties of an auxiliary, -independent Hamiltonian defined on the graph .
Below we briefly discuss these technical assumptions, and refer to Section 2 for the details.
- (i)
- The Hamiltonian on is a self-adjoint realization of the operator on , where is a potential term.
- (ii)
- To set up the graph we select N distinct vertices in (we call them connecting vertices) and attach to each of them one lead, which is either a finite or an infinite length edge. The domain of is characterized by Kirchhoff (also called standard or free) boundary conditions at the connecting vertices, i.e., in each connecting vertex functions are continuous and the sum of the outgoing derivatives equals zero.
- (iii)
- Scale invariance; the small (or inner) part of the graph scales uniformly in , i.e., . The Hamiltonian has a specific scaling property with respect to the parameter ; loosely speaking, up to a multiplicative factor, the “restriction” of to is unitarily equivalent to an -independent operator on . The scale invariance property can be made precise by reasoning in terms of Hamiltonians on the inner graph . This is done in Section 4 below. Here we just mention that this assumption forces the scaling on the component of the potential , , and, in the vertices of , the Robin-type vertex conditions (if any) also scale with accordingly.
- (iv)
- The “restriction” of to the leads does not depend on . In particular, , the component of the potential, does not depend on .
We prove that it is always possible to identify an Hamiltonian on that approximates the Hamiltonian . The Hamiltonian is a self-adjoint realization of the operator on , and it is characterized by scale invariant vertex conditions in , i.e., vertex conditions with no Robin part (see [], Section 1.4.2); in our notation, scale invariant means in Equation (1). The precise form of the possible effective Hamiltonians is given in Definitions 6 and 7 below.
The convergence of to is understood in the following sense. We look at the resolvent operator , , as an operator in the Hilbert space . In the limit , the bounded operator converges to an operator which is diagonal in the decomposition . The component of the limiting operator is the resolvent of a self-adjoint operator in , which we identify as the effective Hamiltonian on the star-graph.
Additionally, we characterize the limiting boundary conditions in the vertex in terms of the spectral properties of an auxiliary Hamiltonian on the (compact) graph . We distinguish two mutually exclusive cases: in one case (that we call generic) zero is not an eigenvalue of the auxiliary Hamiltonian; in the other case (we call it non-generic) zero is an eigenvalue of the auxiliary Hamiltonian.
In the generic case the effective Hamiltonian, denoted by , is characterized by Dirichlet (also called decoupling) boundary conditions in the vertex , i.e., functions in its domain are zero in , see Definition 6. From the point of view of applications this is the less interesting case, since the leads are decoupled (no transmission through is possible).
In the non-generic case the situation is more involved. If zero is an eigenvalue of the auxiliary Hamiltonian one can identify a corresponding set of orthonormal eigenfunctions (in general eigenvalues can have multiplicity larger than one, included the zero eigenvalue). In the domain of the effective Hamiltonian , the boundary conditions in are associated to the values of these eigenfunctions in the connecting vertices, see Definition 7. In this case, the boundary conditions in the vertex are scale invariant but, in general, not of decoupling type. For example, if the multiplicity of the zero eigenvalue is one, and the corresponding eigenfunction assumes the same value in all the connecting vertices, the boundary conditions are of Kirchhoff type.
The proof of the convergence is based on a Kreĭn-type formula for the resolvent . This formula allows us to write as a block matrix operator in the decomposition (see Equation (31)). In the formula, the first term, , is block diagonal and contains the resolvents of and (a scaled down version of the auxiliary Hamiltonian, see Section 2.4); the second term is non-trivial, and couples the and components to reconstruct the resolvent of the full Hamiltonian . As goes to zero, the off-diagonal components in converge to zero, hence, the and components are always decoupled in the limit. A careful analysis of the non-trivial term in Formula (31) shows that it converges to zero in the generic case. In the non-generic case, instead, the component of the non-trivial term converges to a finite operator, and the whole component of reconstructs the resolvent of the effective Hamiltonian .
The limiting behavior of is essentially determined by the small asymptotics of the spectrum of the inner Hamiltonian . The scale invariance assumption implies that the eigenvalues of are given by , where are the eigenvalues of the (scaled up) auxiliary Hamiltonian . Obviously, all the non-zero eigenvalues move to infinity as ; the zero eigenvalue instead, if it exists, persists, and for this reason it plays a special role in the analysis.
Closely related to our work is the paper by G. Berkolaiko, Y. Latushkin, and S. Sukhtaiev [], to which we refer also for additional references. In [] the authors analyze the convergence of Schrödinger operators on metric graphs with shrinking edges. Our setting is similar to the one in [] with several differences. In [] there are no restrictions on the topology of the graph, i.e., is not necessarily a star-graph; outer edges can form loops, be connected among them or to arbitrarily intricate finite length graphs. In [], moreover, the scale invariance assumption is missing. With respect to our work, however, the potential terms in [] do not play an essential role in the limiting problem (because they are uniformly bounded in the scaling parameter).
As it was done in [], to analyze the convergence of to , since they are operators on different Hilbert spaces, one could use the notion of -quasi unitary equivalence (or generalized norm resolvent convergence) introduced by P. Exner and O. Post in the series of works [,,,,]. In Theorems 1 and 2 we state our main results in terms of the expansion of the resolvent in the decomposition ; and comment on the -quasi unitary equivalence of the operators and (or ) in Remark 6.
Our analysis, with the scaling on the potential , is also related to the problem of approximating point-interactions on the real line through scaled potentials in the presence of a zero energy resonance, see, e.g., []. The same type of scaling arises naturally also in the study of the convergence of Schrödinger operators in thin waveguides to operators on graphs, see, e.g., [,,,].
Problems on graphs with a small compact core have been studied in several papers in the case in which is itself a star-graph, see, e.g., [,,,,]. In particular, in the latter series of works, the authors point out the role of the zero energy eigenvalue.
Also related to our work is the problem of the approximation of vertex conditions through “physical Hamiltonians”. In [] (see also references therein), it is shown that all the possible self-adjoint boundary conditions at the central vertex of a star-graph, can be obtained as the limit of Hamiltonians with -interactions and magnetic field terms on a graph with a shrinking inner part.
Instead of looking at the convergence of the resolvent, a different approach consists in the analysis of the time dependent problem. This is done, e.g., in [], for a tadpole-graph as the circle shrinks to a point.
The paper is structured as follows. In Section 2 we introduce some notation, our assumptions and present the main results, see Theorems 1 and 2. In Section 3 we discuss the Kreĭn formulae for the resolvents of and (the limiting Hamiltonian in the non-generic case). These formulae are the main tools in our analysis. In Section 4 we discuss the scale invariance properties of the auxiliary Hamiltonian, and other relevant operators. In Section 5 we prove Theorems 1 and 2. In doing so we present the results with a finer estimate of the remainder, see Theorems 3 and 4. We conclude the paper with two appendices: in Appendix A we briefly discuss the proofs of the Kreĭn resolvent formulae from Section 3; in Appendix B we prove some useful bounds on the eigenvalues and eigenfunctions of .
Index of Notation
For the convenience of the reader we recall here the notation for the Hamiltonians used in our analysis. For the definitions we refer to Section 2 below.
- is the full Hamiltonian.
- is the auxiliary Hamiltonian
- is the scaled down auxiliary Hamiltonian (see Definition 2 and Section 4); .
- is the effective Hamiltonian in the generic case.
- is the effective Hamiltonian in the non-generic case.
- is the diagonal Hamiltonian in the decomposition (see Section 3).
2. Preliminaries and Main Results
For a general introduction to metric graphs we refer to the monograph []. Here, for the convenience of the reader, we introduce some notation and recall few basic notions that will be used throughout the paper.
2.1. Basic Notions and Notation
To fix the ideas we start by selecting a collection of points, the vertices of the graph, and a connection rule among them. The bonds joining the vertices are associated to oriented segments and are the finite-length edges of the graph. Other edges can be of infinite length, and these edges are connected only to one vertex and are associated to half-lines. In this way we obtained a metric graph, see, e.g., Figure 1.
Figure 1.
A metric graph with seven vertices (marked by dots) and 14 edges (three of which are half-lines).
Given a metric graph we denote by the set of its edges and by the set of its vertices. We shall also use the notation and to denote the cardinality of and respectively. We shall always assume that both and are finite.
For any , we identify the corresponding edge with the segment if e has finite length , or with if e has infinite length.
Given a function , for , denotes its restriction to the edge e. With this notation in mind one can define the Hilbert space
with scalar product and norm given by
In a similar way one can define the Sobolev space , equipped with the norm
Note that functions in are continuous in the edges of the graph but do not need to be continuous in the vertices.
For any vertex we denote by the degree of the vertex, this is the number of edges having one endpoint identified by v, counting twice the edges that have both endpoints coinciding with v (loops). Let be the set of edges which are incident to the vertex v. For any vertex v we order the edges in in an arbitrary way, counting twice the loops. In this way, for an arbitrary function , one can define the vector associated to the evaluation of in v, i.e., the components of are given by or , , depending whether v is the initial or terminal vertex of the edge e, or by both values if e is a loop.
In a similar way one can define the vector with components and , . Note that in the definition of , denotes the derivative of with respect to x, and the derivative in v is always taken in the outgoing direction with respect to the vertex.
We are interested in defining self-adjoint operators in which coincide with the Laplacian, possibly plus a potential term.
We denote by B the potential term in the operator, so that is a real-valued function on the graph; and denote by its restriction to the edge e. Additionally we assume that B is bounded and compactly supported on .
For every vertex we define a projection and a self-adjoint operator in , both and can be identified with Hermitian matrices.
It is well known, see, e.g., [] and ([], Example 5.2) that the operator defined by:
is self-adjoint. Instead of Equation (2), we shall write
to be understood componentwise.
We remark that for every and as above, is a self-adjoint extension of the symmetric operator
2.2. Graphs with a Small Compact Core
We consider a graph obtained by attaching several edges to a small compact core (a compact metric graph of size ).
We denote the compact core of the graph by . The graph is obtained by shrinking a compact graph by means of a parameter , more precisely, we set
We denote by the set of edges of the graph and by the set of edges of the graph .
In the graph (or, equivalently, in ) we select N distinct vertices that we label with , and refer to them as connecting vertices. We shall denote by the set of connecting vertices. We denote by the set of all the remaining vertices, and call the elements of inner vertices (note that the set may be empty).
To construct the graph , we attach to each connecting vertex one additional edge which can be an half-line or an edge of finite length (not dependent on ). We shall call these additional edges outer edges and denote by the corresponding set of edges; obviously . When needed, we shall denote these edges by , so that the edge is connected to the vertex , . Moreover we shall use the notation
Note that if is of finite length the endpoint which does not coincide with the connecting vertex is of degree one (all the finite length outer edges are pendants).
We shall always assume, without loss of generality, that for each edge in the connecting vertex is identified by .
We denote by and the sets of edges and vertices of the graph . We note that and , where is the set of vertices in which are neither connecting nor inner vertices.
Remark 1.
For anywe denote byits degree as a vertex of the graph, so that its degree as a vertex of the graph is .
As , the inner graph shrinks to one point, in the limit all the connecting vertices merge in one vertex which we identify with the point , being the coordinate along the edge , . In the limit the graph looks like a star-graph with N edges connected in the origin, see Figure 2; we denote the star-graph by .
Figure 2.
The dashed lines represent the edges of , the large dots the connecting vertices. The graph is obtained by merging the connecting vertices. In the example in the picture, has three infinite edges and one edge of finite length.
We define the Hilbert spaces:
We remark that one can always think of as the direct sum
and decompose each function as with and . When no misunderstanding is possible, we omit the dependence on , moreover we simply write , instead of or .
In a similar way we introduce the Sobolev spaces
2.3. Full Hamiltonian
Next we define an Hamiltonian in (of the form given in Equations (1)–(3)); this is the object of our investigation.
- Recall that if , then . For any we fix an orthogonal projection , and a self-adjoint operator in . Since vertices in have degree one, is either 1 or 0; whenever it makes sense to define which turns out to be the operator acting as the multiplication by a real constant. In other words, the boundary conditions in (of the form given in the definition of ) can be of Dirichlet type, ; of Neumann type ; or of Robin type with .It would be possible to consider a more general setting in which the outer graph has a non trivial topology, in same spirit of the work [], but we will not pursue this goal.
- For any we define the orthogonal projection (see Remark 1 for the definition of ):where denotes the vector (of unit norm) in defined by . In a similar way, we define the orthogonal projectionwhere is defined by . Both and have one-dimensional range given by the span of the vectors and respectively.A function satisfies Kirchhoff conditions in the vertex v (it is continuous in v and the sum of the outgoing derivatives in v equals zero) if and only if and .
- For any we fix an orthogonal projection , and a self-adjoint operator in .
- We fix an -dependent real-valued function , such that in the decomposition (5) one has . With bounded and compactly supported.
Definition 1 (Hamiltonian Hε).
We denote bythe self-adjoint operator indefined by
Remark 2.
In thedecomposition one has
Note that the action of the outer component ofdoes not depend on ε.
Remark 3.
By the definition of, in each connecting vertex boundary conditions inare of Kirchhoff-type: the function ψ is continuous inand
where the sum is taken on all the edges incident on v (counting loops twice) and the derivative is understood in the outgoing direction from the vertex.
2.4. Auxiliary Hamiltonian
We are interested in the limit of the operator as . We shall see that the limiting properties of are strongly related to spectral properties of the Hamiltonian :
Definition 2 (Auxiliary Hamiltonian, scaled down version).
Let , and define the unitary scaling group
its inverse is
By the scaling properties and , one infers the unitary relation
with defined on and given by . One consequence of Equation (7) is that the spectrum of is related to the spectrum of by the relation (see Section 4 for more comments on the implications of the scale invariance assumption). For this reason, we prefer to formulate the results in terms of the spectral properties of the -independent Hamiltonian instead of the spectral properties of .
Definition 3 (Auxiliary Hamiltonian ).
We call Auxiliary Hamiltonian the Hamiltoniandefined on.
Letting, the domain and action ofare given by
The spectrum of consists of isolated eigenvalues of finite multiplicity, see, e.g., ([], Theorem 3.1.1). For , we denote by the eigenvalues of (counting multiplicity) and by a corresponding set of orthonormal eigenfunctions.
Definition 4 (Generic/non-generic case).
In the analysis of the limit ofwe distinguish two cases:
- (1)
- Generic (or non-resonant, or decoupling) case.is not an eigenvalue of the operator.
- (2)
- Non-generic (or resonant) case.is an eigenvalue of the operator.In the non-generic case we denote bya set of (orthonormal) eigenfunctions corresponding to the zero eigenvalue. By Equation (8), functions inare continuous in the connecting vertices (see also Remark 3). We denote by,, the value ofin v, and define the vectors
Definition 5 ().
In the non-generic case, letbe the operator
is a bounded self-adjoint operator (it is anHermitian matrix). Denote byand, the range and the kernel ofrespectively. One has that the subspacesandare-invariant. Moreover,. In what follows we denote bythe orthogonal projection (Riesz projection, see, e.g., ([], Section I.2)) on, and bythe orthogonal projection on.
Remark 4.
We note thatif and only iffor all. To see that this indeed the case, observe that ifthen it must be, hence,, which in turn impliesfor all. The other implication is trivial.
Since, we inferfor all; hence,, or, equivalently,.
2.5. Effective Hamiltonians
We shall see that the definition of the limiting operator (effective Hamiltonian in ) depends on presence of a zero eigenvalue for (the occurrence of the generic case vs. the non-generic case).
Recall that for , we used to denote the component of on the edge attached to the connecting vertex . Moreover, we assumed that the vertex is identified by . With this remark in mind, given a function we define the vectors
These correspond to and , as defined in Section 2.1, where is the central vertex of the star-graph .
In the limit , the connecting vertices in coincide, and can be identified with the vertex .
We distinguish two possible effective Hamiltonians in .
Definition 6 (Effective Hamiltonian, generic case).
We denote bythe self-adjoint operator indefined by
Definition 7 (Effective Hamiltonian, non-generic case).
Letbe the orthogonal projection given in Definition 5. We denote bythe self-adjoint operator indefined by
The boundary conditions in in the definitions of and are scale invariant (see ([], Section 1.4.2)).
2.6. Main Results
In what follows C denotes a generic positive constant independent on . Given two Hilbert spaces X and Y, we denote by (or simply by if ) the space of bounded linear operators from X to Y, and by the corresponding norm. For any , we use the notation to denote a generic operator from X to Y whose norm is bounded by for small enough.
Given a bounded operator A in we use the notation
to describe its action in the decomposition (5): here , , are operators defined according to
Theorem 1.
Let. In the generic case (see Definition 4)
where the expansion has to be understood in thedecomposition (11).
Theorem 2.
Let. In the non-generic case (see Definition 4), letbe the restriction ofto.
Remark 5.
Remark 6.
We recall and adapt to our setting the notion of-quasi unitary equivalence of operators acting on different Hilbert spaces introduced by P. Exner and O. Post, see in particular ([], Section 3.2) and ([], Chapter 4). See also ([], Section 5) for a discussion on the application of this approach to the analysis of operators on graphs with shrinking edges.
Let J be the operator
whereis understood in the decomposition (5). Its adjointmapsin, and is given by:
Note that, whereis the identity in.
The operatoris-quasi unitarily equivalent to a self-adjoint operatorinif
for some.
By Theorem 1, in the generic case the operatoris ε-quasi unitarily equivalent to the operator.
By Theorem 2–(iii), in the non-generic case, if the vectors,, are linearly independent, the operatoris-quasi unitarily equivalent to the operator. More precisely, the second condition in Equation (16) always holds true, while the first one holds true only under the additional assumption that the vectorsare linearly independent.
We refer to [] for a comprehensive discussion on the comparison between operators acting on different spaces.
3. Kreĭn Resolvent Formulae
In this section we introduce the main tools in our analysis: the Kreĭn-type resolvent formulae for the resolvents of and . The proofs are postponed to Appendix A.
Given the Hilbert spaces , , , and , and a couple of operators and , we denote by , the operator , with and , acting as , for all , and .
We set
with and given as in Definitions 6 and 2.
Given an operator A, we denote by its resolvent set; the resolvent of A is defined as for all .
For the resolvents of the relevant operators we introduce the shorthand notation
Obviously, all the operators in Equations (18)–(21) are well-defined and bounded for , moreover .
Our aim is to write the resolvent difference in a suitable block matrix form, associated to the off-diagonal matrix in Equation (29). To do so we follow the approach of Posilicano [,]. All the self-adjoint extensions of the symmetric operator obtained by restricting a given self-adjoint operator to the kernel of a given map are parametrized by a projection and a self-adjoint operator in . We choose the reference operator and the map so that the Hamiltonian of interest is the self-adjoint extension parametrized by the identity and the self-adjoint operator given by the off-diagonal matrix . The Kreĭn formula for the resolvent difference , see Lemma 2, is obtained within the approach from [,].
We define the maps:
Moreover we set,
Note that we are using the identification .
The following maps are well-defined and bounded
and
Moreover we set
for . Note that and that all the maps above are well-defined bounded operators for .
The adjoint maps (in ) are denoted by
( denoting the adjoint) and
Obviously to be understood as an operator from to .
We note that, see Remark A2, and , for all and respectively, so that the maps (, z-dependent matrices)
are well defined. Moreover, we set
obviously .
In the following Lemmata we give two Kreĭn-type resolvent formulae: one allows to express the resolvent of in terms of the resolvent of ; the other gives the resolvent of in terms of the resolvent of . For the proofs we refer to Appendix A, Appendix A.1.
Lemma 1.
Letbe an orthogonal projection in, andandbe the Hamiltonians defined according to Definitions 7 and 6. Then, for any, the mapis invertible and
Lemma 2.
Let Θ be the block matrix
Then, for any, the mapis invertible and
We conclude this section with an alternative formula for the resolvent . We refer to Appendix A, Appendix A.2, for the proof.
Lemma 3.
Let, then the maps (, z-dependent matrices)
are invertible. Moreover,
4. Scale Invariance
In this section we discuss the scale invariance properties of and collect several formulae concerning the operators , , , and .
Recall that we have denoted by and the eigenvalues and a corresponding set of orthonormal eigenfunctions of .
The eigenvalues of (counting multiplicity) and a corresponding set of orthonormal eigenfunctions are given by
where are the eigenvalues of , and the corresponding (orthonormal) eigenfunctions.
By the spectral theorem and by the scaling properties (32), is given by
Hence, its integral kernel can be written as
Since there exists a positive constant C such that and for n large enough (see Appendix B), the series in Equation (34) is uniformly convergent for . Hence, we can write the operators and , and the matrix in a similar way, see Equations (35) and (36) below.
Note that, since functions in are continuous in the connecting vertices, the eigenfunctions can be evaluated in the connecting vertices, and, by the definition of (see Equation (23)), one has
So that, for any eigenfunction we can define the vector as
We note that , with
and that the vectors are defined in the same way as the vectors in Equation (9).
Remark 7.
In the non-generic case, zero is an eigenvalue of. We denote bythe corresponding set of (orthonormal) eigenfunctions given bywhereare the eigenfunctions corresponding to the eigenvalue zero of. The vectorsare related to the vectorsby the identity.
5. Proof of Theorems 1 and 2
This section is devoted to the proofs of Theorems 1 and 2. Actually, we shall prove a finer version of the results with more precise estimates of the remainders, see Theorems 3 and 4 below.
Remark 8.
5.1. Generic Case. Proof of Theorem 1
In this section we study the limit of the relevant quantities in the generic case and prove Theorem 1.
Proposition 1.
Let. In the generic case,
Proof.
We prove first Claim (42). For any , since is an orthonormal set of eigenfunctions in , and by Equation (33), we infer
where in the latter inequality we used the bound , which holds true in the generic case because for all and small enough.
To prove the first claim in Equation (43), let , then
Hence, from the Cauchy–Schwarz inequality,
because and . This proves the first Claim in Equation (43); the second one is trivial, being the adjoint of . □
Proposition 2.
Let. In the generic case,
Proof.
Recall Equation (36) and note that for any ,
because and . □
Theorem 3.
Proof.
Note that by Equation (44) and because is bounded and does not depend on . Hence, .
Theorem 1 is a direct consequence of Theorem 3.
5.2. Non-Generic Case. Proof of Theorem 2
In this section we study the limit of the relevant quantities in the non-generic case and prove Theorem 2.
Recall that, in the non-generic case, denotes a set of orthonormal eigenfunctions corresponding to the zero eigenvalue, see also Remark 7.
Proposition 3.
Let. In the non-generic case
Proof.
Next we prove a proposition on the expansion of the , z-dependent matrix . Recall that was defined in Definition 5.
Proposition 4.
Let. In the non-generic case,
Proof.
The claim immediately follows from Equation (36), after noticing that
and by treating the second term at the r.h.s. with argument similar to the one used in the proof of Proposition 2. □
We set
and recall that is invertible (see Remark A3), then
In the following proposition we give an expansion formula for the term in the non-generic case.
Proposition 5.
Let. In the non-generic case, decompose the spaceas, and denote bythe restriction ofto. Then, the mapis invertible in.
Set
then
to be understood in the decomposition.
Proof.
We postpone the proof of the fact that the map is invertible in to the appendix, see Remark A4.
Next we prove that the expansion formula (53) holds true. We start by noticing that the map is invertible. In fact, by Remark A4 and since , we infer
because it is the sum of two non-positive (or non-negative) terms and by the injectivity of , see Remark A1.
Moreover we have the a-priori estimate
The latter follows from (see also Equation (A3))
for some positive constant , from the injectivity of . Hence, setting , it follows that .
Next we use the expansion (see Equation (50))
which, together with the a-priori estimate (54), gives
Here we used the formula . Note that by using instead the complementary formula , we obtain
Next we analyze the term .
We start by noticing that the map is invertible, because is invertible in and .
By the identification (to be understood in the decomposition )
we have the identity
Hence, from the block-matrix inversion formula, we obtain
with given by
note that is well-defined because it is the inverse of a map of the form , and is invertible in .
Moreover, it holds true,
Hence,
The latter can also be written as
Using this expansion formula in Equation (56) we obtain
On the other hand, using Equation (57), we obtain
Hence Expansion (53) must hold true. □
Recall that, for , is invertible in , see Remark A3.
Proposition 6.
Let. In the non-generic case,
Proof.
Taking into account Expansion (55), rewritten in the decomposition , one has
So that, by Equation (53),
By the latter expansion and by the identification (58) it follows that (recall Equation (51) and the definition of in Equation (52))
To conclude, we apply the block-matrix inversion formula to Equation (58) to obtain
with
Hence it must be
so that
This, together with Equation (59), allows us to infer the expansion
and conclude the proof of the proposition. □
We are now ready to state and prove the main theorem for the non-generic case. In the statement of the theorem, we assume that , i.e., . In this way the quantity is certainly well defined. We discuss the case (i.e., ) separately in the proof of point (ii) of Theorem 2 (after the proof of Theorem 4).
Theorem 4.
Let. In the non-generic case assume that, then
where the expansion has to be understood in thedecomposition (11).
Proof.
We analyze term by term the r.h.s. in Equation (37).
Term : by Proposition 6 and Lemma 1, it immediately follows that
Term : by Equation (51) and by the definition of , recalling that and are bounded, it is enough to prove that
Taking into account the fact that for all , , and the fact that (it is a linear combination of vectors in , see Rem 4) we infer that (see Equation (47)),
with , , and .
Hence, by the expansion (53), we infer
Here the leading term is
and for it we have the bound
The remainder is bounded by
in the latter bound we used , see Equation (53) (see also Equation (54)). Hence,
and the bound (60) holds true.
The bound on the term follows immediately by noticing that .
Term ; by Equation (51), we have that
Theorem 2-(i) follows immediately from Theorem 4.
Proof of Theorem 2 - (ii).
Reasoning along the lines of the analysis of the generic case, see the proof of Theorem 3, and taking into account the expansion (46), one readily infers
which implies the statement in Theorem 2 - (ii). □
Proof of Theorem 2 - (iii).
To prove the second part of Theorem 2, recall that and , hence . By the definition of this is equivalent to
Remark 9.
Denote by Λ the operator in defined by
Λ is selfadjoint and . The first claim is obvious (recall that is selfadjoint). To prove the second claim, note that, since ,
but
where we used the fact that . Hence,
Hence, Λ is an orthogonal projection in .
Funding
This research received no external funding.
Acknowledgments
The author is grateful to Gregory Berkolaiko and Andrea Posilicano for enlightening discussions. The author also thanks the anonymous referees for many useful comments that helped to improve the quality of the paper.
Conflicts of Interest
The authors declare no conflict of interest.
Appendix A. Proof of the Kreĭn Resolvent Formulae
We use several known results from the theory of self-adjoint extensions of symmetric operators.
We follow, for the most, the approach and the notation from the papers by A. Posilicano [] and []. Other approaches would be possible, such as the one based on the use of boundary triples, see, e.g., [,,,].
When no misunderstanding is possible, in this appendix we omit the suffixes “”, “”, and .
Appendix A.1. Proofs of Lemmata 1 and 2
We denote by the restriction of the maps to the domain , by Equations (22) and (23) we infer
where in we used the definition of and the fact that functions in are continuous in the connecting vertices.
Remark A1.
The mapis surjective. Hence, the mapis also surjective as a map from(the operatoris obviously surjective). We conclude thatis an injective map from(it is the adjoint of a surjective map). A similar statement holds true also for the corresponding “” and “” operators.
Remark A2.
We claim that for allandone hasand
and similar properties hold true for the “” and “” operators (here Δ denotes the maximal Laplacian in , i.e., , ).
To prove thatand that Equation (A1) holds true we start by discussing the case. In such a case it is possible to obtain an explicit formula for the integral kernel of, see, e.g., ([], Lemma 4.2). By this explicit formula it is easily seen that the operatormaps any vectorin a function inand that. It is not needed to investigate the detailed properties of the boundary conditions in the vertices of, it is enough to take into account the dependence onof the integral kernel(see also ([], Examples 5.1 and 5.2)). That the same is true forfollows immediately from the resolvent identity
which givesand.
In consideration of the remark above, we infer that the maps (, z-dependent matrices) in Equations (26), (27) and (28) are all well defined. Moreover, by the resolvent identities
it follows that
Let us denote by the space or depending on if we are reasoning with operators in , or . By Equation (A2), it follows that for any projection P in and any self-adjoint operator in , the map is invertible in . To see that this is indeed the case, note that by Equation (A2) one has
So that, for and for all , such that , it holds
because is injective. Hence, is invertible in for .
Remark A3.
By the discussion above, it follows that the maps,, andare invertible for all.
By ([], Theorem 2.1) (see also ([], Theorem 2.1)) it follows that: for any the operators and are the resolvents of a self-adjoint extension of the symmetric operators and respectively.
We are left to prove that such self-adjoint extensions coincide with and respectively.
Let us focus attention on (similar considerations hold true for ). Since the self-adjoint operator associated to is an extension of , to prove that is the resolvent of , we just need to check that in the connecting vertices functions in satisfy the boundary conditions required by . The remaining boundary conditions are clearly satisfied because the map evaluates functions only in the connecting vertices.
Define the maps:
and
We recall the following formula which is obtained by integrating by parts
Fix and let and .
For all and as above, the identity (A4) gives
In what follows we use the decomposition , so that and .
Let . Then Identity (A5) gives
Take , such that and for all . Then , and Equation (A6) gives . In a similar way it is possible to show that for all . Hence, .
Next let . Then Identity (A5) gives
Take such that , and for all . Hence, , , and . Hence, Equation (A7) gives
In a similar way one can prove , , hence, .
We also note that the function is continuous in the connecting vertices (whenever the vertex degree is larger or equal than two). To see that this is indeed the case, consider in Equation (A7) a function such that , , , , . Since , condition (A7) gives . Repeating the process, moving in the vector on all the positions (from the second one on) one obtains the continuity of in the vertex . The same holds true for every connecting vertex.
We have proved that for any , setting , one has:
Let and set . One has that
On the other hand, noticing that , by the definition of (see Equations (10), (6), and (17)), and by Equation (A8) it follows that
We conclude that satisfies the condition . Taking into account the fact that is continuous in the connecting vertices, it is easy convince oneself that the condition is equivalent to
and
which, in turns, is equivalent to the Kirchhoff boundary conditions in .
The fact that the resolvent formula holds true for all , follows from ([], Theorem 2.19).
To prove the resolvent formula for , let and set . By the first formula in (A8), one has
hence, . Moreover,
Hence, the boundary conditions in are satisfied, see Definition 7.
Appendix A.2. Proof of Lemma 3
Recall that we are denoting by the space or depending on if we are reasoning with operators in , or .
Remark A4.
By Identities (A2) we infer
Hence, for, and for any projection P in, and
becauseis an injective map, being the composition of injective maps.
Hence, the mapis invertible in.
Appendix B. Estimates on Eigenvalues and Eigenfunctions of
In this appendix we prove the following proposition on the asymptotic behavior of eigenvalues and eigenfunctions of .
Proposition A1.
Recall that we denoted bythe eigenvalues of the Hamiltonian, and bya corresponding set of orthonormal eigenfunctions. There existssuch that for any:
and
for some positive constant C which does not depend on n.
Proof.
Claim (A10) is just the Weyl law. For a proof can be found in ([], Proposition 4.2) (see also []). For bounded, claim (A10) can be deduced by a perturbative argument.
To prove the bound (A11) we follow the lines in the proof of Theorem A.1 in []. For and real valued, and let f be the solution of the equation
with initial conditions and . Then can be written as
from which it immediately follows that
with
Then from Gronwall’s lemma, see, e.g. ([], page 103), one has
where we assumed . By equation (A13) and by the estimate (A14) it follows that
where C is a positive constant which does not depend on , and . We have then proved that
Any component of the eigenfunction satisfies in the corresponding edge an equation of the form (A12) with some initial data in . Then the discussion on the function above applies to all the components of the vector . By the normalization condition it follows that it must be , with (here f denotes a generic component of , i.e., the restriction of to a generic edge of ). Hence, from the identity
one infers
References
- Kostrykin, V.; Schrader, R. Kirchhoff’s rule for quantum wires. J. Phys. A Math. Gen. 1999, 32, 595–630. [Google Scholar] [CrossRef]
- Kostrykin, V.; Schrader, R. Laplacians on metric graphs: eigenvalues, resolvents and semigroups. Contemp. Math. 2006, 415, 201–226. [Google Scholar]
- Berkolaiko, G.; Kuchment, P. Introduction to quantum graphs. In Mathematical Surveys and Monographs; American Mathematical Society: Providence, RI, USA, 2013; Volume 186. [Google Scholar]
- Berkolaiko, G.; Latushkin, Y.; Sukhtaiev, S. Limits of quantum graph operators with shrinking edges. arXiv, 2018; arXiv:1806.00561. [Google Scholar]
- Exner, P.; Post, O. Convergence of spectra of graph-like thin manifolds. J. Geom. Phys. 2005, 54, 77–115. [Google Scholar] [CrossRef]
- Exner, P.; Post, O. Quantum networks modelled by graphs. AIP Conf. Proc. 2008, 998, 1–17. [Google Scholar]
- Exner, P.; Post, O. Approximation of quantum graph vertex couplings by scaled Schrödinger operators on thin branched manifolds. J. Phys. A 2009, 42, 415305. [Google Scholar] [CrossRef]
- Post, O. Spectral convergence of quasi-one-dimensional spaces. Ann. Henri Poincaré 2006, 7, 933–973. [Google Scholar] [CrossRef]
- Post, O. Spectral Analysis on Graph-Like Spaces; Springer Science & Business Media: Heidelberg, Germany, 2012; Volume 2039. [Google Scholar]
- Golovaty, Y.D.; Hryniv, R.O. On norm resolvent convergence of Schrödinger operators with δ′-like potentials. J. Phys. A Math. Theor. 2010, 43, 155204. [Google Scholar] [CrossRef]
- Cacciapuoti, C.; Finco, D. Graph-like models for thin waveguides with Robin boundary conditions. Asymptot. Anal. 2010, 70, 199–230. [Google Scholar]
- Cacciapuoti, C. Graph-like asymptotics for the Dirichlet Laplacian in connected tubular domains. Anal. Geom. Number Theory 2017, 2, 25–58. [Google Scholar]
- Cacciapuoti, C.; Exner, P. Nontrivial edge coupling from a Dirichlet network squeezing: the case of a bent waveguide. J. Phys. A 2007, 40, F511–F523. [Google Scholar] [CrossRef]
- Albeverio, S.; Cacciapuoti, C.; Finco, D. Coupling in the singular limit of thin quantum waveguides. J. Math. Phys. 2007, 48, 032103. [Google Scholar] [CrossRef]
- Exner, P.; Man’ko, S.S. Approximations of quantum-graph vertex couplings by singularly scaled potentials. J. Phys. A 2013, 46, 345202. [Google Scholar] [CrossRef]
- Exner, P.; Man’ko, S.S. Approximations of quantum-graph vertex couplings by singularly scaled rank-one operators. Lett. Math. Phys. 2014, 104, 1079–1094. [Google Scholar] [CrossRef]
- Man’ko, S.S. Schrödinger operators on star graphs with singularly scaled potentials supported near the vertices. J. Math. Phys. 2012, 53, 123521. [Google Scholar] [CrossRef]
- Man’ko, S.S. Quantum-graph vertex couplings: some old and new approximations. Math. Bohem. 2014, 139, 259–267. [Google Scholar]
- Man’ko, S.S. On δ′-Couplings at Graph Vertices, Mathematical Results in Quantum Mechanics; World Sci. Publ.: Hackensack, NJ, USA, 2015; pp. 305–313. [Google Scholar]
- Cheon, T.; Exner, P.; Turek, O. Approximation of a general singular vertex coupling in quantum graphs. Ann. Phys. 2010, 325, 548–578. [Google Scholar] [CrossRef]
- Ali Mehmeti, F.; Ammari, K.; Nicaise, S. Dispersive effects for the Schrödinger equation on the tadpole graph. J. Math. Anal. Appl. 2017, 448, 262–280. [Google Scholar] [CrossRef]
- Posilicano, A. Self-adjoint extensions of restrictions. Oper. Matrices 2008, 2, 483–506. [Google Scholar] [CrossRef]
- Gohberg, I.; Goldberg, S.; Kaashoek, M.A. Classes of Linear Operators. Volume I, Operator Theory: Advances and Applications; Birkhäuser Verlag: Basel, Swiss, 1990. [Google Scholar]
- Posilicano, A. A Kreĭn-like formula for singular perturbations of self-adjoint operators and applications. J. Funct. Anal. 2001, 183, 109–147. [Google Scholar] [CrossRef]
- Albeverio, S.; Pankrashkin, K. A remark on Krein’s resolvent formula and boundary conditions. J. Phys. A Math. Gen. 2005, 38, 4859–4864. [Google Scholar] [CrossRef]
- Brüning, J.; Geyler, V.; Pankrashkin, K. Spectra of self-adjoint extensions and applications to solvable Schrödinger operators. Rev. Math. Phys. 2008, 20, 1–70. [Google Scholar] [CrossRef]
- Gorbachuk, V.I.; Gorbachuk, M.L. Boundary Value Problems for Operator Differential Equations, Mathematics and its Applications (Soviet Series); Translated and Revised from the 1984 Russian Original; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1991. [Google Scholar]
- Schmüdgen, K. Unbounded Self-Adjoint Operators on Hilbert Space, Graduate Texts in Mathematics; Springer: Dordrecht, The Netherlands, 2012; Volume 265. [Google Scholar]
- Cacciapuoti, C.; Fermi, D.; Posilicano, A. On inverses of Kreĭn’s -functions. Rend. Mat. Appl. 2018, 39, 229–240. [Google Scholar]
- Bolte, J.; Endres, S. The trace formula for quantum graphs with general self adjoint boundary conditions. Ann. Henri Poincaré 2009, 10, 189–223. [Google Scholar] [CrossRef]
- Odžak, A.; Šćeta, L. On the Weyl law for quantum graphs. Bull. Malays. Math. Sci. Soc. 2019, 42, 119–131. [Google Scholar] [CrossRef]
- Currie, S.; Watson, B.A. Inverse nodal problems for Sturm-Liouville equations on graphs. Inverse Probl. 2007, 23, 2029–2040. [Google Scholar] [CrossRef]
- Hörmander, L. Lectures on Nonlinear Hyperbolic Differential Equations; Mathématiques & Applications (Berlin); Springer: Berlin, Germany, 1997. [Google Scholar]
© 2019 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).