Green matrix estimates of block Jacobi matrices II: Bounded gap in the essential spectrum
Jan Janas, Sergey Naboko, Luis O. Silva

TL;DR
This paper derives decay bounds for Green matrices and eigenvectors of block Jacobi operators within spectral gaps, with refinements for commuting entries and illustrative examples.
Contribution
It introduces new decay estimates for block Jacobi matrices in spectral gaps, including cases with commuting entries and eigenvalues.
Findings
Decay bounds for Green matrices in spectral gaps
Refined estimates for commuting matrix entries
Examples illustrating the decay bounds
Abstract
This paper provides decay bounds for Green matrices and generalized eigenvectors of block Jacobi operators when the real part of the spectral parameter lies in a bounded gap of the operator's essential spectrum. The case of the spectral parameter being an eigenvalue is also considered. It is also shown that if the matrix entries commute, then the estimates can be refined. Finally, various examples of block Jacobi operators are given to illustrate the results.
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.
Taxonomy
TopicsMatrix Theory and Algorithms · Spectral Theory in Mathematical Physics · Numerical methods in inverse problems
\draftcopyName
DRAFT 130 \draftcopySetScale65
Green matrix estimates of block Jacobi matrices II:
Bounded gap in the essential spectrum 00footnotetext: Mathematics Subject Classification(2010): 41A10 47B36, 33E30 00footnotetext: Keywords: Block Jacobi operators; Generalized eigenvectors; Decay bounds.
Jan Janas
Institute of Mathematics
Polish Academy of Sciences (PAN)
Ul. Sw. Tomasza 30, 31-027
Krakow, Poland
Sergey Naboko
Department of Mathematical Physics
Institute of Physics
St. Petersburg State University
Ulyanovskaya 1, St. Petersburg 198904, Russia
Luis O. Silva
Department of Mathematical Sciences
University of Bath
Claverton Down, Bath BA2 7AY, U.K.
&
Departamento de Física Matemática
Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas
Universidad Nacional Autónoma de México
C.P. 04510, México D.F.
[email protected] Supported by UNAM-DGAPA-PAPIIT IN110818 and SEP-CONACYT CB-2015 254062. On sabbatical leave from UNAM with the support of PASPA-DGAPA-UNAM
Abstract
This paper provides decay bounds for Green matrices and generalized eigenvectors of block Jacobi operators when the real part of the spectral parameter lies in a bounded gap of the operator’s essential spectrum. The case of the spectral parameter being an eigenvalue is also considered. It is also shown that if the matrix entries commute, then the estimates can be refined. Finally, various examples of block Jacobi operators are given to illustrate the results.
1 Introduction
This work gives decay bounds for the entries of the Green matrix corresponding to a self-adjoint block Jacobi operator when the real part of the spectral parameter lies in a bounded gap of the operator’s essential spectrum. These estimates also show how fast the sequence of generalized eigenvectors decays. In a previous paper [13], decay bounds for Green matrix entries were established for the case of semibounded block Jacobi operators. It turns out that, on the one hand, the technique used in [13] for unbounded gaps in the essential spectrum cannot be applied to the case of bounded gaps without substantial modifications. On the other hand, the estimates in the case of bounded gaps are completely different from the ones of unbounded gaps.
The results of this work provide a refinement of the Combes-Thomas method used for obtaining estimates of the Green function’s decay. A crucial fact of this refinement is the use of Lemma 3.1 which was already implemented in [14, 12, 21] and is in a certain sense behind the improvements of the original method (see [2]). Combes-Thomas type estimates (cf.[2, 6]) are used in the analysis of some discrete random models (see [16]). We remark that block type random operators have been studied earlier (e.g.[7, 8, 17]) and a Combes-Thomas type estimate for random block operators is given in [8, Lem. 5.7].
The decay bounds of the generalized eigenvectors established in this work have interesting applications to the study of spectral phase transition phenomena (see for instance [14]). Notably, block Jacobi matrices permit more freedom in the construction of models which exhibit multi-threshold spectral phase transitions.
In the Hilbert space of square-summable sequences whose elements belong in turn to a Hilbert space , we consider the operator associated with a second order difference equation with operator coefficients acting in (see Definition 1). The operator coefficients, and (), are the entries of a block Jacobi matrix and, consequently, is called a block Jacobi operator. It is assumed that, for any , are bounded and defined on the whole space , *i.e.*they belong to . Additionally, the operators () are required to satisfy conditions guaranteeing that on a proper domain and the existence of a gap in the essential spectrum of . Under these assumptions, let us paraphrase the statements of Theorems 3.1 and 3.2. Denote by the ()-block entry of the resolvent’s matrix at the point (Definition 2). If the real part of is in the gap of the essential spectrum of , then there are positive constants and such that
[TABLE]
when is not an eigenvalue and
[TABLE]
when is an eigenvalue. The function is given by (3.2) and corresponds to a regularization of the reciprocal function. The function is given by (3.5) and (3.6), and the constants and do not depend on or (although they may depend on the spectral parameter ). Apart from depending on and the size of the gap, depends on a parameter which permits certain optimization (Remark 2).
The decay bounds given above cover a wide range of block Jacobi operators. In these estimates, we provide an explicit expression for the decay coefficient, and establish how they depend on the off-diagonal entries of the block Jacobi operator. The fact that the bounds depend inversely on the growth of the off-diagonal entries of a Jacobi matrix was already shown by Combes-Thomas type estimates. The results of this work, on the one hand, generalize to the case of block matrix operators the corresponding decay bounds obtained in [14, 12] for the scalar case. On the other hand, our results extend the region of the spectral parameter so that it is a complex non necessarily real number.
When the entries of the block Jacobi operator commute, a subsequent refinement of the results given above can be obtained (see Section 4). Indeed, under the assumptions on considered above and the additional requirement that the entries commute pairwise (see in Theorem 4.1 the precise statement), one has
[TABLE]
for being such that its real part is in the gap and it is not an eigenvalue. Here again is given by (3.5) and (3.6), and the constant does not depend on or . In this case of commuting entries, a result corresponding to the case when is an eigenvalue is also established (Theorem 4.2). We remark that this operator way of estimating the decay of generalized eigenvectors make it possible to optimize the estimates of these vectors along any spatial direction in by taking into account the matrix structure of the blocks.
Section 5 provides various examples which illustrate the results of this work. The asymptotic of generalized eigenvectors are obtained heuristically on the basis of methods which have been used to find the asymptotics of solutions to difference equations. We consider the examples of this section to be of independent interest.
Finally, in Section 6, we briefly describe an alternative approach to establishing decay bounds for block Jacobi operators. This approach makes use of the discrete nature of the problem and allows us to obtain more precise results in certain cases.
2 Preliminaries
2.1 Notation
By we denote a separable infinite dimensional Hilbert space which is always decomposed as an infinite orthogonal sum:
[TABLE]
where for all and is either an infinite or finite dimensional subspace of . A Hilbert space so decomposed is usually denoted by .
The symbol is used to denote the norm in , while the norm in is denoted by . ) and denote the spaces of bounded linear operators defined on the whole space and , respectively. The norms in and are denoted by and , respectively.
A vector in can be written as a sequence
[TABLE]
or as an infinite column vector, i.e.. Note that
[TABLE]
Throughout this work, we use to denote the identity operator in the spaces and since it will cause no confusion to use the same letter for these operators. The orthogonal projector in onto the subspace is denoted by while the symbol stands for the orthogonal projector onto
[TABLE]
Given a closed, densely defined operator in a Hilbert space, we denote by the operator given by applying the functional calculus to the self-adjoint operator . Finally, for any self-adjoint operator , we denote its essential spectrum, *i.e.*the union of the continuous spectrum and the eigenvalues of infinite multiplicity, by .
2.2 Block Jacobi matrices
Let us turn to the definition of block Jacobi operators. For any sequence (2.1), consider the second order difference expressions
[TABLE]
where and are in for any .
Definition 1**.**
In , define the operator such that
[TABLE]
and for any . Since is dense in , the adjoint of , , is an operator. One verifies from the difference expression that . The operator is said to be defined in the maximal domain given by the difference expression , whereas is the minimal closed operator associated with (see [3, Chap. 7 Sec. 2.5]).
The block tridiagonal matrix
[TABLE]
can be regarded as the matrix representation of the operator when every element in is written as in (2.1). (cf.[1, Sec. 47] where the matrix representation of an unbounded symmetric operator is given).
Remark 1**.**
In this work, we impose conditions on the sequences and so that is self-adjoint. A sufficient condition for this to happen is the generalized Carleman criterion [3, Chap. 7 Thm. 2.9], viz., if , then is self-adjoint. A particular case of an operator satisfying the Carleman criterion is a bounded block Jacobi operator for which the sequences and are bounded [3, Chap. 7 Sec. 2.11].
Sometimes, the same notation is used for the matrix and the operator. This cannot lead to confusion when (in this case the maximal and minimal domains coincide) and in the case of diagonal matrices. Thus,
[TABLE]
where for any , is used for denoting the operator and the matrix (the operator being with for all ).
In , consider the unilateral shift operator and its adjoint given by
[TABLE]
It can be verified that the operator
[TABLE]
coincides with when it is self-adjoint.
Definition 2**.**
Assume that the operator given in Definition 1 is self-adjoint. For any in the resolvent set of , define
[TABLE]
Note that by this definition , and therefore
[TABLE]
The operator can be regarded as the entry of the block matrix representation of the resolvent of at corresponding to the -th row and the -th column. Accordingly, we refer to as the block Green matrix corresponding to at .
3 Estimates in a bounded gap of the essential spectrum
This section establishes decay bounds for the Green matrix entries (Definition 2) corresponding to a self-adjoint Jacobi operator (Definition 1) with a bounded gap in the essential spectrum. The real part of the spectral parameter is assumed to be in this gap and we cover both cases; when this parameter is an eigenvalue and when it is not.
To streamline the writing of formulae, let us introduce the following functions. For
[TABLE]
and
[TABLE]
Also, let be such that . For , define
[TABLE]
The next assertion is part of [14, Lem. 3.3] and turns out to be crucial for proving the results of this section. Earlier versions of the statement can be found in [21].
Lemma 3.1**.**
Let be an invertible self-adjoint operator such that
[TABLE]
If is a self-adjoint contraction and is such that
[TABLE]
then the operator is continuously invertible.
One can find geometrical heuristics of this result in [14, 12]. It is worth mentioning that (3.4) cannot be replaced by the weaker condition (see [12, Rem. 4]).
To streamline the statements of our results, consider the following hypothesis.
Hypothesis 1**.**
The operator given in Definition 1 is self-adjoint and there is an interval of the real line such that .
For the following assertion, bare in mind the functions given in (3.1), (3.2), and (3.3).
Theorem 3.1**.**
Assume that Hypothesis 1 holds true. Fix an arbitrary , , and . If and , then
[TABLE]
where
[TABLE]
when , and
[TABLE]
otherwise. The constant depends neither on nor on .
Proof.
For any fixed , let
[TABLE]
where is given in (3.2) and the value of is to be determined later. We assume . Clearly, is a scalar operator for . Consider the following operator in
[TABLE]
This operator is a contraction and depends on , , and . When needed, we indicate the dependence on explicitly, i. e., . Note that the operator is a boundedly invertible contraction for any finite .
Let us introduce the operator:
[TABLE]
Using (2.4), one verifies that
[TABLE]
By (3.7), depends on and is in since the sequences (2.1) in the range of have a finite number of nonzero elements. Note that (3.8) implies that
[TABLE]
Define
[TABLE]
where is the spectral measure of . For , we also introduce the following operators. Below, we take large enough (see (3.25), (3.28), (3.36)).
[TABLE]
where is given in Section 2.1. Note that is a compact operator and depends on since also does.
Our aim is to show that is continuously invertible for indicated in the assertion of the theorem. Once the inverse of exists and is bounded, the result is established by the next argumentation. Taking into account that and (3.13), one obtains from (3.9) the equality
[TABLE]
Therefore, using the invertibility of and the fact that , one concludes that
[TABLE]
Left multiplying the last equality by yields
[TABLE]
where we have used the identity formally valid for any linear operator . Inserting the expression for from the last equality into (3.16), one arrives at
[TABLE]
In the right-hand side of the previous equality, the inverse of the operator in square brackets in (3.16) has been substituted by an explicit expression. The rigorous proof of the existence of this inverse follows by checking directly that the obtained expression is the left and right inverse simultaneously.
Clearly,
[TABLE]
Note that does not depend on . Thus,
[TABLE]
In view of Definition 2 and (3.7), by letting , one obtains
[TABLE]
for all . The estimate of the theorem is proven by combining both scalar exponential factors in (3.18). Note that we have proven the estimate for , but the other case is also covered by recurring to (2.5).
Let us turn to establishing the continuous invertibility of . We consider two mutually exclusive cases leading to the two different definitions of the function . If , then one establishes the invertibility of on the basis of Lemma 3.1 by choosing appropriately. If , then one can rely on the properties of dissipative (or anti-dissipative) operators to conclude that is invertible for some values of .
First we assume that . Observe that we have defined and so that
[TABLE]
Let us verify that the operators and satisfy the conditions of Lemma 3.1. To this end, we estimate the norms of the real and imaginary parts of .
It follows from (3.9) that
[TABLE]
Since the matrix of the operator has only two block diagonals not necessarily zero and one diagonal is the adjoint of the other, one has
[TABLE]
which in view of (3.7) yields
[TABLE]
Using the elementary inequality
[TABLE]
which holds for any , one arrives at
[TABLE]
To obtain an appropriate estimate for , first note that, for any given , if one defines
[TABLE]
then
[TABLE]
for all . Indeed, it follows from (3.2) that, when , the inequality (3.23) holds whenever
[TABLE]
Hence, (3.22) guarantees (3.23). In the case , assuming (3.22), rewrite (3.23) using (3.2) as follows
[TABLE]
By (3.1), this inequality is equivalent to
[TABLE]
so, after dividing by , one verifies that it holds since and the function is monotone for .
Comparing (3.21) to (3.23), one concludes that
[TABLE]
Since is compact, one can take sufficiently large so that, simultaneously,
[TABLE]
Thus, taking into account that
[TABLE]
and combining (3.24) and (3.25), one obtains
[TABLE]
On the other hand, by (3.15), one has
[TABLE]
Make perhaps even larger than what was required in (3.25) so that
[TABLE]
To found a bound for the second term in the right-hand side of (3.27), one uses the argumentation for obtaining the inequality (3.19) from the expression (3.9). Thus,
[TABLE]
A straightforward computation yields
[TABLE]
from which, by means of the elementary inequality
[TABLE]
valid for any positive , one obtains
[TABLE]
Proceeding as before, if one defines
[TABLE]
assuming and , then
[TABLE]
for all . Comparing this inequality with (3.31), one concludes that
[TABLE]
Taking into account that and inserting (3.28) and (3.33) into (3.27), one arrives at
[TABLE]
where the second inequality is obtained from (3.26).
The estimates (3.24) and (3.25) show that is invertible. Clearly, is a self-adjoint contraction. Thus, since according to (3.34) satisfies the conditions of Lemma 3.1, one concludes that is invertible.
Let us now consider the case
[TABLE]
As before, we first choose sufficiently large so that
[TABLE]
Now, if is as in (3.6), then
[TABLE]
This is shown following the reasoning used to established that (3.23) holds under the assumption (3.22). Comparing (3.37) and (3.31), one obtains
[TABLE]
Since , it follows from (3.15), (3.36) and (3.38) that
[TABLE]
Thus, if one considers the particular realization of (3.35) given by , then
[TABLE]
Thus the operator is anti-dissipative and therefore is invertible. The case is treated analogously. ∎
Remark 2**.**
In the estimate given by Theorem 3.1, there are no constraints in the choice of the constant . The function yields a priori better estimates when . Note, however, that one does not obtain a more accurate estimate by letting due to the dependence on of the function .
Remark 3**.**
The hypothesis of Theorem 3.1 is fulfilled by a bounded from below self-adjoint operator with bounded from below essential spectrum. For these operators [13, Thm. 3.1] provides an estimate for the decay of Green matrix entries which is more precise than the one given by Theorem 3.1. Note that that boundedness from below is not required by Theorem 3.1. In [13, Thm. 3.1], this requirement was crucial for the proof. As shown in [20], the asymptotic behaviour of generalized eigenvectors of a non-bounded from below Jacobi operator can depend on the main diagonal in contrast to [13, Thm. 3.1] and Theorem 3.1. The results of [20] illustrate why the semiboundedness is essential in the case of [13, Thm. 3.1] and does not contradicts Theorem 3.1 due to the different order of estimates.
For the next theorem, we rely on [13, Lem. 3.1]. Here we reproduce the statement of the lemma for easy reference. Recall that is given in Section 2.1.
Lemma 3.2**.**
Let be the operator given in Definition 1 and be a compact operator in with trivial kernel such that . If has trivial kernel for all and is in the discrete spectrum of , then, for any sufficiently small, is not in the spectrum of
[TABLE]
Theorem 3.2**.**
Assume that Hypothesis 1 holds true and that for any . Fix an arbitrary and . If and is the corresponding eigenvector, then
[TABLE]
where and are given by (3.5) and (3.2), respectively. The constant does not depend on .
Proof.
By Lemma 3.2, one can choose such that . Additionally, according to perturbation theory, (see [15, Chap. 4, Thm. 5.35 and Chap. 5, Thm. 4.11]). Therefore satisfies the hypothesis of Theorem 3.1.
Now, if is a nonzero vector in , then
[TABLE]
Therefore
[TABLE]
which in turn implies
[TABLE]
where in the first inequality we use that and in the second we resort to Theorem 3.1. ∎
Corollary 3.1**.**
Assume that Hypothesis 1 holds and that . Fix .
- (a)
If and , then
[TABLE]
where
[TABLE] 2. (b)
If is trivial for all , and is the corresponding eigenvector, then
[TABLE]
The constant does not depend on and , and does not depend on .
Remark 4**.**
Perhaps the most relevant case in various theoretical applications corresponds to being actually in the gap of the essential spectrum in item (a). This case admits further simplification. Indeed, it follows from (a) that if , then, for arbitrarily small , one has
[TABLE]
Proof.
First note that the expressions inside the minimum in (3.5) monotonically grow as . Since the minimum has to be taken, one should consider only the expression that grows slower, namely,
[TABLE]
By choosing appropriately (essentially sufficiently large), one obtains
[TABLE]
Given and , the choice of depends on .
If , then
[TABLE]
where is arbitrarily small whenever is sufficiently small. Indeed, it follows from (3.1) that if , then
[TABLE]
Thus, the assumption implies
[TABLE]
In view of (3.42), the choice of in (3.5) can be replaced by
[TABLE]
Finally, observe that, for any ,
[TABLE]
where the second and third terms can be absorbed into a constant which does not depend on since . ∎
4 Estimates in the case of commuting entries
The results of the previous section admit a refinement when the hypotheses of Theorems 3.1 and 3.2 are complemented with the requirement that commute for . This refinement permits to have different bound along different vectors in the space .
Hypothesis 2**.**
The system of operators given in section 2.2 commutes pairwise.
Theorem 4.1**.**
Assume that Hypotheses 1 and 2 hold true. Fix an arbitrary , , and . If and , then
[TABLE]
where is given by (3.5) if , and by (3.6) otherwise. The constant does not depend on and .
Proof.
Consider the operators given in (3.11)–(3.15). Now, we modify the definition of the operator . For any fixed , redefine the bounded operators on given in the proof of Theorem 3.1:
[TABLE]
The bounded operator on is defined by
[TABLE]
Note that this operator differs from its counterpart of the proof of Theorem 3.1. Similar to what we had in the proof of Theorem 3.1, depends on and is a boundedly invertible contraction for any finite . Note that this time the block operator is not a scalar operator.
Define the operator by (3.9) with the new sequence . Repeating the argumentation in the proof of Theorem 3.1, one arrives at (3.19). Using (4.1) and the fact that the system commutes pairwise, one obtains from (3.19) that
[TABLE]
Due to the inequality
[TABLE]
valid for any positive operator and obtained from (3.20) by the spectral theorem, one derives from (4.2) the estimate
[TABLE]
Taking as in (3.22), one concludes from (3.23) and the spectral theorem, that (3.24) holds.
Similarly, it follows from (3.30) that
[TABLE]
This inequality implies, by means of the operator inequality
[TABLE]
which holds for any positive operator due to the spectral theorem, that
[TABLE]
Thus, by choosing as in (3.32), one verifies through the spectral theorem that (3.33) holds.
Since (3.24) and (3.33) take place, the operator is invertible and therefore one has the estimate (3.17). Thus, in view of Definition 2 and (4.1), if , then
[TABLE]
for all . The assertion of the theorem follows from this inequality by combining the operators on both sides of . In this proof, , but the other case is also covered by recurring to (2.5). ∎
Theorem 4.2**.**
Assume that Hypotheses 1 and 2 hold true and that is trivial for any . Fix an arbitrary and . If and is the corresponding eigenvector, then
[TABLE]
where is given by (3.5). The constant does not depend on .
Proof.
One follows the argumentation of the proof of Theorem 3.2. Resort to Lemma 3.2 and choose so that . It follows from (3.39) that if is in , then (3.40) holds. Thus,
[TABLE]
One then obtains from this expression that
[TABLE]
For finishing the proof, it only remains to let and note that is continuously invertible. ∎
Corollary 4.1**.**
Fix . Assume that Hypotheses 1 and 2 hold true and ( invertible for ).
- a)
If and , then
[TABLE]
where is given by (3.41). 2. b)
If and is trivial for any , then
[TABLE]
where is the corresponding eigenvector.
The constant does not depend on and , and does not depend on .
Proof.
We prove the claim in (a). The statement in (b) is proven analogously. First one uses the argumentation of Corollary 3.1 to simplify the expression of when is large enough. Thus
[TABLE]
for all . By letting , one obtains from this that
[TABLE]
Finally, using the argumentation in (3.43), one concludes that, for any ,
[TABLE]
is a bounded operator whose norm is independent of . ∎
5 Examples
In this section, we consider concrete realizations of self-adjoint block Jacobi operators having finite gaps in the essential spectrum. The examples admit a straightforward calculation of the decay of the corresponding generalized eigenvectors although in some cases it is somehow involved. The estimates obtained in this way are compared with the ones given by Theorem 3.1.
Example 1. Let us first consider the block Jacobi operator given in Definition 1 so that, for any , and , where
[TABLE]
Here the sequence of complex numbers is such that . We denote this block Jacobi operator by . It can be decomposed as an infinite orthogonal sum of matrices:
[TABLE]
where the matrix is a one-dimensional matrix. From this decomposition, one can deduce that is self-adjoint and is discrete and the Green function is a band matrix function so that its entries decrease faster than any nonfinite sequence. If, instead of (5.1), one assumes , where
[TABLE]
with for all and , then the corresponding block Jacobi operator given by Definition 1 and denoted by , is also self-adjoint and has discrete spectrum. (Note that and could be examples of self-adjoint block Jacobi operators not satisfying the Carleman criterion when the sequences and are chosen appropriately). The Green function corresponding to is not anymore a band matrix. Nevertheless, the entries of the Green matrices also decay as fast as the sequence permits. This is shown by the following argument. By the Hilbert second resolvent identity, one has, for ,
[TABLE]
where is the block Jacobi operator given by Definition 1 with and , where
[TABLE]
for any . Note that is compact and, moreover, the rank of is finite since all the nonzero entries of its matrix representation are in a finite vicinity of the blocks indexed by the value of (denoted ). Therefore
[TABLE]
Taking into account that as , one obtains from Theorem 3.1 that
[TABLE]
where is given in (3.41). If or tend to and the corresponding series is divergent, then the Green matrix elements could decrease faster than any power when one let either one of the indices grow and the other is kept fixed.
Note that the estimate in (5.2) does not contain any information on the sequence . At the same time, the previous considerations show that the optimal estimates depend on . Hence, for some choices of the sequence the estimate in (5.2) may be close to optimal, however, in most cases, it is far from the real estimates. Example 1 illustrates a case when our results could not be optimal.
Example 2. Let
[TABLE]
Define the sequences of matrices and so that and . Let be the operator in given by Definition 1. Since the elements of the sequences and are all equal to constant matrices, the matrix (2.3) is periodic. Let us find conditions on for the operator to have a finite gap in the essential spectrum.
Proposition 5.1**.**
For the operator given in this example, . Thus, if , then the interval is a gap in the essential spectrum of .
Proof.
Denote by the unit circle in the complex plane and by the Lebesgue measure on the unit circle normalized so that . We also consider the Hilbert space and denote any of its elements, *i.e.*the sequence (( for all ) by an infinite column vector (*cf.*Section 2.1).
Define in , the map by
[TABLE]
where , . It is known that this is a unitary map from onto . Moreover (cf.[5, Chap. 2]) any “double-infinite” Jacobi operator with constant block entries acting in is transformed under this map into the multiplication operator by certain matrix function in , namely,
[TABLE]
Here the multiplication operator is defined by
[TABLE]
where is a -matrix function which will be determined some lines below.
Let be the operator corresponding to the matrix
[TABLE]
If is such that for all , then
[TABLE]
Thus, is transformed by into the operator of multiplication with .
For each , the spectrum of is
[TABLE]
According to [4, Chap. 8 Sec. 4], the spectrum of is given by the union of the essential range of the eigenvalues as functions of . Therefore
[TABLE]
Now, if is given by the matrix
[TABLE]
then , where is the operator associated with the matrix
[TABLE]
in the subspace () of the Hilbert space of . Since is a finite rank operator, it follows from Weyl theorem (see [4, Thm. 3 Sec. 1 Chap. 9]) that
[TABLE]
Hence, if one shows that , then and the assertion of the proposition follows.
The fact that is equivalent to the existence of a Weyl sequence (also known as singular sequence) at [4, Thm. 2 Sec. 1 Chap. 9], *i.e.*there is such that
- (1)
2. (2)
3. (3)
.
It follows from (1) that there is a such that for all ,
[TABLE]
The sequence in satisfies (1)–(3) due to the fact that the have constant block coefficients. Therefore, if is the projection in onto the subspace , then
[TABLE]
is a Weyl sequence at for the operator , which in turn means that . ∎
In view of Proposition 5.1, operator satisfies Hypothesis 1. Let us find the estimates given by Theorems 3.1 and 3.2 for this operator. To this end, one first computes the norm of the matrix by calculating the largest eigenvalue of . One has
[TABLE]
Inserting this expression into the formula given in Theorem 3.1, one arrives at the following estimate. If is an eigenvalue and is the corresponding eigenvector, then
[TABLE]
where the function is given by (3.5). If is not an eigenvalue, then
[TABLE]
This result can be compared with the straightforward computation of the generalized eigenvectors by the so-called transfer matrices. By defining
[TABLE]
the recurrence equation (see (2.2)) can be written as for , where
[TABLE]
Thus, estimates of the products of the transfer matrices yield decay estimates for generalized eigenvectors. Since in this case for any , the matrix does not depend on and will be denoted by . The eigenvalues of for a fixed are the solutions with respect to of the equation
[TABLE]
Therefore the four eigenvalues of are
[TABLE]
By a straightforward computation, the minimal decay of an eigenvector in the gap , is
[TABLE]
Now assume that is placed near the edge of the gap given in Proposition 5.1, say , (). In this case, the minimal decay of an eigenvector corresponding to this is
[TABLE]
Thus, as , the minimal decay of the corresponding eigenvector is
[TABLE]
Compare this with (5.5), where in this case . Note that in both cases the coefficient determining the decay rate is determined by , *i.e.*by the square root of the distance to the edge of the gap in the essential spectrum when this distance is small.
Example 3. Let be the operator given in Definition 1 with for any . Consider the constant matrix given in (5.3) and define
[TABLE]
where , , and (). For this example, it is assumed that . This assumption, as seen below, guarantees the existence of a bounded gap in the essential spectrum of .
The block Jacobi operator exhibits a gap in the essential spectrum. This operator does not reduce to “scalar” Jacobi operators and its spectral analysis requires, as shown in [19], generalizing some of the techniques used for studying Jacobi operators.
Due to the 2-periodic character of the matrix weights, we first construct block of transfer matrices (see for instance [10], and [9] for the block version). Using the matrices given in (5.6), define the monodromy matrix
[TABLE]
for each . Then
[TABLE]
where is given by (5.7). Thus, the generalized eigenvectors of at the spectral parameter are solutions to the discrete linear system (5.10) and, by the same token, the spectral properties of are determined by this system. We use here an approach to the analysis of (5.10) which has a heuristic component and refer the reader to [19] for the complete proof.
Substituting (5.6) into (5.9), one obtains
[TABLE]
Taking into account (5.8), one verifies by straightforward calculations that the monodromy matrix can be written as follows
[TABLE]
where is such that the sequence is summable. In the asymptotic analysis of (5.10), the sequence is not relevant and the factor can be easily deal with at the end of the computation.
Fix arbitrary complex numbers and , and put with fixed . Let us compute the determinant of the matrix , where
[TABLE]
(compare this expression with (5.11)). To this end, consider the auxiliary matrix
[TABLE]
By using the Schur complement for computing (see [22]), one obtains
[TABLE]
where is the adjugate of the matrix . Substituting (5.3) into the last expression and performing all necessary elementary (though lengthy) computations, one arrives at
[TABLE]
where the scalar depends only on , and its value, being a polynomial in , has no effect in the remaining computations. Recall that are polynomials of and in both variables of degree 2.
Let be the eigenvalues of
[TABLE]
Note that each eigenvalue is a multiplicity two eigenvalue of the matrix when . Now, on the basis of [15, Chap. 2 Sec. 2], since the algebraic and geometric multiplicities of the eigenvalues of coincide, the following asymptotic ansatz
[TABLE]
can be substituted into (5.12) to find from the equation by equating coefficients of the powers of . From the equation corresponding to , one obtains
[TABLE]
Hence, depending on the value of , both are either real or pure imaginary. Note that, in the leading approximation, the system is always in the elliptic regime () whereas, in the second approximation, which corresponds to the values of , its character depends on the spectral parameter . Indeed, if is in
[TABLE]
then the system is secondary hyperbolic ( are real). If is not in the closure of the interval given in (5.13), then the system is secondary elliptic ( are purely imaginary). The fact that the character of the leading approximation is elliptic means that the asymptotic behaviour of the solutions, namely their growth or decay, is actually determined by the sub-leading coefficients of the approximation, i.e., the values of . This is related to the divergence of the series defined by the sequence (recall that ). Note that the two degenerated eigenvalues of when split into two pairs of complex conjugate simple eigenvalues. In the secondary elliptic case, the splitting goes tangentially to the unit circle, while in the secondary hyperbolic case the splitting goes along the radius (perpendicular to the circle).
Now, one performs the asymptotic analysis of (5.10) à la Levinson (see for instance [11]). This allows one to conclude that the interval (5.13) is a gap in the essential spectrum of . Indeed, the idea of the Levinson approach is to replace the nontrivial structure of the solutions to (5.10) by the product of the eigenvalues of and then multiply by
[TABLE]
It is worth remarking that the formal application of the Levinson approach is the heuristic part of our analysis. The reason of this is that the product of eigenvalues of the monodromy matrix usually gives the correct main exponential term. However, the power in factor is not always correct.
The product of the eigenvalues of yields (up to a constant factor) the following four expressions
[TABLE]
Thus the heuristic application of the Levinson approach allows one to conclude that there are two linearly independent solutions such that
[TABLE]
Since are purely imaginary when the spectral parameter is outside the interval in (5.13), the exponential factor in the last formula has modulus 1. In this case, all the generalized eigenvectors decay as and the role of the perturbation is bounded by a purely oscillating factor. This behaviuor corresponds to the essential spectrum in the region given by (5.13). A rigorous proof of this fact can be obtained using Weyl sequences constructed on the basis of the asymptotic properties of (5.14) (see [14]). On the other hand, in the secondary hyperbolic case (i.e inside the interval given by (5.13)), are real with opposite signs which implies that one solution of (5.10) grows while the other decays. This case corresponds, at least at the physical level, to the absence of the essential spectrum (for a rigorous proof see the methods used in [18]).
A detailed asymptotic analysis of (5.10) and the proof of the above assertions concerning the spectral properties of in this example are done in [19] in which a further development of the techniques used in [20] is carried out.
The estimates for the decay of generalized eigenvalues inside the gap are thus given by
[TABLE]
In particular, this implies that
[TABLE]
for some positive constant .
Let us calculate the bound of the decay of the generalized eigenvectors given by Theorem 3.1 for this case. To this end, we first compute the norm of . We almost have already done this, since we have (5.4) and therefore
[TABLE]
Also the expression of can be simplified according to Corollary 3.1. Assuming that is in the gap (5.13), one thus has
[TABLE]
Hence, for a generalized eigenvector , there are constants such that
[TABLE]
Compare this inequality with (5.15). When (recall that ), the expression in the square brackets in (5.16) goes to and therefore the arguments of the exponential function in (5.16) and (5.15) exactly coincide up to which is arbitrarily small.
6 Discrete version of the method
In this section, a different realization of the method used in the previous sections is presented. Here we use an alternative expression for the auxiliary operators (3.7). The result of this change is an estimate that could be more precise in various cases, in particular when the sequence of operators has multiple occurrences of .
Redefine the sequence of operators (see the proof of Theorem 3.1) as follows:
[TABLE]
where . As in the proof of Theorem 3.1, one establishes the inequalities (3.19) and (3.29). From these inequalities, one obtains
[TABLE]
If , then is arbitrarily small for sufficiently large. Let us assume, without loss of generality, that for all .
The sequences from the right-hand sides of the inequalities have the form
[TABLE]
The rational functions and replace the transcendental functions and of the proof of Theorem 3.1. By a reasoning similar to the one used in the proof of Theorem 3.1 to obtain the estimates of the norm of the real and imaginary part of the operator , one concludes that assigning
[TABLE]
one obtains the necessary estimates guaranteeing that the existing of a constant such that
[TABLE]
for sufficiently large. Thus we have given the sketch of the proof of the following result.
Theorem 6.1**.**
Assume that Hypothesis 1 holds true and as . Fix an arbitrary , , and . If with and is so large that for , then
[TABLE]
where
[TABLE]
when , and
[TABLE]
otherwise. The constant depends neither on nor on .
Remark 5**.**
Note that the function given in (3.1) satisfies
[TABLE]
while
[TABLE]
Therefore the first two terms of the expansion of and coincide as . On the other hand, (see (3.1)) obeys
[TABLE]
and
[TABLE]
These asymptotic expansions show that there is an advantage in using instead of . It is possible to obtain better estimates of the Green matrix entries by using the discrete version of the method (see [12, Thm. 5]). Although the continuous version of the method, which was presented in the previous sections, gives a more convenient form for the estimates of the Green matrix entries, the discrete version introduced in this section yields a slightly better and more subtle form of the estimates. In general, the discrete version of the method is more natural since the problem has itself a discrete character. Moreover, even in the case of noncommuting entries of the block Jacobi matrix, the operator can be chosen as in (6.1), but with instead of , . Of course in this case the products should be taken in chronological order. The exponential form of in the proof of Theorem 3.1 has no sense in that case. If we want to obtain a more precise estimate we should choose this discrete version with nonscalar operators. It seems, however, that the continuous version of the method provides estimates accurate enough for most of the applications.
Acknowledgements
The authors thank the anonymous reviewer for pertinent and useful comments and remarks which led to an improved version of the manuscript.
S N was supported by grant RFBR 19-01-00657 A (Sections 1–4) and grant RScF 20-11-20032 (Sections 5–6). He expresses his gratitute to the Institut Mittag-Leffler, where part of this work has been done, for their kind hospitality and to the Knut and Alice Wallenberg Foundation for the support given. L O S has been supported by UNAM-DGAPA-PAPIIT IN110818 and SEP-CONACYT CB-2015 254062. Part of this work was carried out while L O S was on sabbatical leave at the University of Bath from UNAM with the support of PASPA-DGAPA-UNAM.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. I. Akhiezer and I. M. Glazman. Theory of linear operators in Hilbert space . Dover Publications Inc., New York, 1993. Translated from the Russian and with a preface by Merlynd Nestell, Reprint of the 1961 and 1963 translations, Two volumes bound as one.
- 2[2] J. M. Barbaroux, J. M. Combes, and P. D. Hislop. Localization near band edges for random Schrödinger operators. Helv. Phys. Acta , 70(1-2):16–43, 1997. Papers honouring the 60th birthday of Klaus Hepp and of Walter Hunziker, Part II (Zürich, 1995).
- 3[3] J. M. Berezans ′ kiĭ. Expansions in eigenfunctions of selfadjoint operators . Translated from the Russian by R. Bolstein, J. M. Danskin, J. Rovnyak and L. Shulman. Translations of Mathematical Monographs, Vol. 17. American Mathematical Society, Providence, R.I., 1968.
- 4[4] M. S. Birman and M. Z. Solomjak. Spectral theory of selfadjoint operators in Hilbert space . Mathematics and its Applications (Soviet Series). D. Reidel Publishing Co., Dordrecht, 1987. Translated from the 1980 Russian original by S. Khrushchëv and V. Peller.
- 5[5] A. Böttcher and B. Silbermann. Analysis of Toeplitz operators . Springer-Verlag, Berlin, 1990.
- 6[6] J. M. Combes and L. Thomas. Asymptotic behaviour of eigenfunctions for multiparticle Schrödinger operators. Comm. Math. Phys. , 34:251–270, 1973.
- 7[7] A. Elgart, M. Shamis, and S. Sodin. Localisation for non-monotone Schrödinger operators. J. Eur. Math. Soc. (JEMS) , 16(5):909–924, 2014.
- 8[8] M. Gebert and P. Müller. Localization for random block operators. In Mathematical physics, spectral theory and stochastic analysis , volume 232 of Oper. Theory Adv. Appl. , pages 229–246. Birkhäuser/Springer Basel AG, Basel, 2013.
