Synthesis of a quantum tree Weyl matrix

A method for successive synthesis of a Weyl matrix (or Dirichlet-to-Neumann map) of an arbitrary quantum tree is proposed. It allows one, starting from one boundary edge, to compute the Weyl matrix of a whole quantum graph by adding on new edges and solving elementary systems of linear algebraic equations in each step.


Introduction
Quantum graphs or differential equations networks have wide applications in science and engineering and give rise to challenging problems involving many areas of modern mathematics, from combinatorics to partial differential equations and spectral theory.A number of surveys and collections of papers on quantum graphs appeared last years, including the first books on this topic by Berkolaiko and Kuchment [8] and Mugnolo [14].In the present work we consider tree graphs, that is, finite connected compact graphs without cycles.The Weyl or Titchmarsh-Weyl matrix of a quantum graph is one of the key mathematical objects, it naturally appears in direct and inverse spectral theory, in the control theory of quantum graphs and in numerous applications.Its importance lies in the fact that the Weyl matrix (or more precisely, its transposed matrix) is the Dirichlet-to-Neumann map of the quantum graph.For a fixed value of the spectral parameter, a vector of arbitrary Dirichlet-type boundary values of a solution multiplied by the transposed Weyl matrix gives one a vector of the corresponding Neumann-type boundary values, if only the value of the spectral parameter is not a Dirichlet eigenvalue of the quantum graph.Moreover, the singularities of the Weyl matrix, considered as a function of the spectral parameter, determine the Dirichlet spectrum of the quantum graph.Many papers on inverse problems for quantum graphs exploit the Weyl matrix or equivalent spectral data, see, e.g., [6], [9], [15], [7], [10], [4].
Direct construction of the Weyl matrix for a sufficiently large quantum tree is quite a challenging problem.It requires solving large systems of equations involving solutions (and their derivatives) of differential equations on all edges of the tree.The main result of the present work is a simple procedure for a progressive synthesis of the Weyl matrix of an arbitrary quantum tree.Starting from just one leaf edge and adding successively new edges, it allows one to compute the Weyl matrices for ever larger quantum trees from the Weyl matrices for the smaller ones.We call this procedure the synthesis of the Weyl matrix.In a sense, it is inverse with respect to the leaf peeling method, which was developed in [4], see also [5], [2].The proposed synthesis of the Weyl matrix is based on revealed relations between Weyl solutions of a larger quantum tree graph Ω with those of a smaller one Ω, obtained from Ω by cutting out all the leaf edges of an internal vertex.
In Section 2 we recall necessary definitions and express the Weyl solutions in terms of fundamental systems of solutions of the Sturm-Liouville equation on each edge.Section 3 presents the main result of the work, the procedure of the synthesis of a Weyl matrix of an arbitrary quantum tree graph.Finally, Section 4 contains some concluding remarks.

Preliminaries
Let Ω be a finite connected compact graph without cycles (a tree graph) consisting of P edges, e 1 , . . ., e P , and P + 1 vertices, V = {v 1 , ..., v P +1 } .The notation e j ∼ v means that the edge e j is incident to the vertex v. Every edge e j is identified with an interval (0, L j ) of the real line.The boundary Γ = {γ 1 , . . ., γ m } of Ω is the set of all leaves of the graph (the external vertices).The edge adjacent to some γ j is called a leaf or boundary edge.
A continuous function u defined on the graph Ω is a P -tuple of functions u j ∈ C [0, L j ] satisfying the continuity condition at the internal vertices v: u i (v) = u j (v) for all e i , e j ∼ v. Then u ∈ C(Ω).
Let q ∈ L 1 (Ω) be real valued, and λ a complex number.Consider the Sturm-Liouville equation on Ω: −u ′′ (x) + q(x)u(x) = λu(x). (2.1) A function u defined on Ω is said to be a solution of (2.1) if besides (2.1) we have that and for every internal vertex v the Kirchhoff-Neumann condition is fulfilled Here u j is a restriction of u onto e j , ∂u j (v) stands for the derivative of u at the vertex v taken along the edge e j in the direction outward the vertex, and the sum is taken over all the edges incident to the internal vertex v.
For simplicity we assume that the considered graph does not have vertices of degree two, because every such vertex can be regarded as an internal point of an edge which is a sum of two edges incident at such a vertex, and the continuity condition (2.2) together with the Kirchhoff-Neumann condition (2.3) guarantee that any solution of (2.1) on the incident edges keeps satisfying (2.1) also on the union of them.Definition 2.1 A solution w i of (2.1) on Ω is called the Weyl solution associated with the leaf γ i if it satisfies the boundary conditions w i (γ i ) = 1 and w i (γ j ) = 0 for all j = i. (2.4) If λ in (2.1) is not a Dirichlet eigenvalue of the quantum tree Ω, the Weyl solution w i exists and is unique for any i = 1, . . ., m.In particular, since the potential q is real valued, the Dirichlet spectrum is real and thus the boundary value problem (2.1), (2.4) is uniquely solvable for all λ / ∈ R.
For a fixed value of λ, the transposed Weyl matrix represents a Dirichlet-to-Neumann map of the quantum graph defined by Ω and q ∈ L 1 (Ω).Indeed, if u is a solution of (2.1) satisfying the Dirichlet condition at the boundary vertices It is clear that the direct computation of the Weyl matrix, which involves finding Weyl solutions and computing their derivatives at leaves may be a difficult task, especially, when Ω consists of a large number of edges.The corresponding systems of equations which need to be solved in this case may be too large, because they should combine information on the solutions and their derivatives on each edge and at all internal vertices.
The main result of the present work is a simple procedure which allows one to synthesize the Weyl matrix progressively, by adding edges to smaller graphs and computing the Weyl matrices for the obtained larger graphs from the Weyl matrices for the smaller ones.We call this procedure synthesis of the Weyl matrix.It allows one to compute the Weyl matrix of any quantum tree starting from one leaf edge and adding successively new edges.
By ϕ i (ρ, x) and S i (ρ, x) we denote the so-called fundamental solutions of the Sturm-Liouville equation on the edge e j : satisfying the initial conditions Here q i (x) is the component of the potential q(x) on the edge e i , and ρ = √ λ, Im ρ ≥ 0. For a leaf edge e i it is convenient to identify its leaf γ i with the left endpoint x = 0. Then the Weyl solution w i (ρ, x) has the form w ii (ρ, x) = ϕ i (ρ, x) + M i,i (ρ 2 )S i (ρ, x) on the adjacent leaf edge e i and w ij (ρ, x) = M i,j (ρ 2 )S j (ρ, x) on every other leaf edge e j , j = i.
Hereafter, the notation w ij (ρ, x) means that we consider j-th component of a solution w i (ρ, x), that is, the solution w i (ρ, x) on the edge e j .
Figure 1: Tree graph Ω is obtained from a subgraph Ω (its edges are presented by solid lines) by attaching to the vertex γ 0 a number of new edges (dashed lines).
On internal edges e j we have where the choice of which vertex is identified with zero is arbitrary, and in general the factors a ij (ρ), b ij (ρ) are unknown.Since in direct and inverse spectral problems involving the Weyl matrix one deals with solutions on large ranges of the parameter ρ, it is convenient to use the Neumann series of Bessel functions representations for ϕ j (ρ, x) and S j (ρ, x), introduced in [13] and applied in a number of direct and inverse problems (see, e.g., [1], [2], [3], [11], [12]).One of the features of these representations is the existence of estimates for the remainders of the series independent of Re ρ.

Synthesis of Weyl matrix
Consider a quantum tree graph Ω whose leaves are γ 0 , γ 1 , . . ., γ m .Assume its Weyl matrix M(ρ 2 ) to be known for some value of ρ.Attach a number of edges to the leaf γ 0 (see Fig. 1), so that γ 0 becomes an internal vertex of a new larger graph Ω, and γ 1 , . . ., γ m , γ m+1 , . . ., γ m+m 1 the leaves of Ω.Here m 1 is the number of the new attached edges.Thus, Ω is a tree graph obtained from Ω by attaching m 1 edges to γ 0 .For simplicity we call these new edges e m+1 , . . ., e m+m 1 and denote their respective lengths as L m+1 , . . ., L m+m 1 .We assume that a corresponding potential q j ∈ L 1 (0, L j ), j = m + 1, . . ., m + m 1 , is given on each new edge, and the leaf γ j is identified with x = 0.
Our task is to find the Weyl matrix M(ρ 2 ) of the quantum graph Ω.The idea is to construct the Weyl solutions w i (ρ, x) of Ω in terms of the Weyl solutions w j (ρ, x) of Ω.We start with the Weyl solutions w m+j (ρ, x) associated with the new leaves γ m+j , j = 1, . . ., m 1 .
Then the entries of the 2 × 2 -Weyl matrix M(ρ 2 ) have the form Now, as a first step for synthesis of the Weyl matrix of a quantum tree we attach a number of edges to the vertex γ 0 , that gives us a quantum star graph.The procedure described above gives us its Weyl matrix.Subsequently, attaching new edges to the leaves and applying the above procedure leads to the computation of the Weyl matrix of an ever larger quantum tree.Thus, starting with one edge we synthesize the Weyl matrix of the whole quantum tree.
Remark 3.1 The requirement on the potential q to be real valued is not essential.The proposed procedure for the synthesis of the Weyl matrix is applicable to complex valued potentials without modifications.The only constraint that must be checked at each step is that ρ ∈ C does not belong to the Dirichlet spectrum of either graph Ω or Ω.

Conclusions
A procedure of the synthesis of a Weyl matrix of an arbitrary quantum tree graph is developed.It allows one to compute the Weyl matrix for a large quantum tree successively, by adding new edges and computing the Weyl matrices for ever larger subgraphs.In each step relatively small systems of linear algebraic equations are solved.Due to the fact that the transposed Weyl matrix is the Dirichlet-to-Neumann map of the quantum tree graph, the synthesis procedure will find applications in solving a variety of boundary value and control problems on quantum tree graphs.
Funding The research of Sergei Avdonin was supported in part by the National Science Foundation, grant DMS 1909869, and by Moscow Center for Fundamental and Applied Mathematics.The research of Vladislav Kravchenko was supported by CONACYT, Mexico, via the project 284470.