Spectra of Jacobi operators via connection coefficient matrices

We address the computational spectral theory of Jacobi operators that are compact perturbations of the free Jacobi operator via the asymptotic properties of a connection coefficient matrix. In particular, for finite-rank perturbation we show that the computation of the spectrum can be reduced to a polynomial root finding problem, from a polynomial that is derived explicitly from the entries of a connection coefficient matrix. A formula for the spectral measure of the operator is also derived explicitly from these entries. The analysis is extended to trace-class perturbations. We address issues of computability in the framework of the Solvability Complexity Index, proving that the spectrum of compact perturbations of the free Jacobi operator is computable in finite time with guaranteed error control in the Hausdorff metric on sets.


Introduction
where α k and β k are real numbers with β k > 0. One interpretation of this operator is as a discrete Schrödinger operator on the half line, and its spectral theory is arguably its most important aspect. The spectral theorem for Jacobi operators guarantees the existence of a probability measure µ supported on the spectrum σ(J) ⊂ R, called the spectral measure, and a unitary operator U : 2 → L 2 µ (R) such that U JU * [f ](s) = sf (s), (1.2) for all f ∈ L 2 µ (R) [12]. The coefficients {α k } k≥0 and {β k } k≥0 are the three-term recurrence coefficients of the orthonormal polynomials {P k } k≥0 with respect to µ, which are given by P k = U e k .
Suppose we have a second Jacobi operator, D, for which the spectral theory is known analytically. The point of this paper is to show that for certain classes of Jacobi operators J and D, the computation and theoretical study of the spectrum and spectral measure of J can be conducted effectively using the connection coefficient matrix between J and D, combined with known properties of D.
Definition 1.1. The connection coefficient matrix C = C J→D = (c ij ) ∞ i,j=0 is the upper triangular matrix representing the change of basis between the orthonormal polynomials (P k ) ∞ k=0 of J, and the orthonormal polynomials (Q k ) ∞ k=0 of D, whose entries satisfy, P k (s) = c 0k Q 0 (s) + c 1k Q 1 (s) + · · · + c kk Q k (s). and J is a Jacobi operator of the form J = ∆ + K, where K is compact. In the discrete Schrödinger operator setting, K is a diagonal potential function which decays to zero at infinity [37]. Another reason this class of operators is well studied is because the Jacobi operators for the classical Jacobi polynomials are of this form [32]. Since scaling and shifting by the identity operator affects the spectrum in a trivial way, results about these Jacobi operators J apply to all Jacobi operators which are compact perturbations of a Toeplitz operator (Toeplitz-plus-compact).
The spectral theory of Toeplitz operators such as ∆ is known explicitly [7]. The spectral measure of ∆ is the semi-circle dµ ∆ (s) = 2 π (1 − s 2 ) 1 2 (restricted to [−1, 1]), and the orthonormal polynomials are the Chebyshev polynomials of the second kind, U k (s). We prove the following new results.
If J is a finite rank perturbation of ∆ (Toeplitz-plus-finite-rank), i.e. there exists n such that α k = 0, β k−1 = 1 2 for all k ≥ n, (1.5) • Theorem 4.8: The connection coefficient matrix C J→∆ can be decomposed into C Toe +C fin where C Toe is Toeplitz, upper triangular and has bandwidth 2n − 1, and the entries of C fin are zero outside the n − 1 × 2n − 1 principal submatrix.
where cos(θ) = s. The denominator in the first term can be expressed using the polynomial, |c(e iθ )| 2 = 2n−1 k=0 C T e k , C T e 0 U k (s). For R > 0, define the Banach space 1 R to be scalar sequences such that ∞ k=0 |v k |R k < ∞. If J is a trace class perturbation of ∆ (Toeplitz-plus-trace-class), i.e., ∞ k=0 |α k | + β k − 1 2 < ∞, (1.8) • Theorem 5.11: C = C J→∆ is bounded as an operator from 1 R into itself, for all R > 1. Further, we have the decomposition C = C Toe + C K where C Toe is upper triangular Toeplitz and C K is compact as an operator from 1 R into itself for all R > 1.  Figure 1: These are the spectral measures of three different Jacobi operators; each differs from ∆ in only one entry. The left plot is of the spectral measure of the Jacobi operator which is ∆ except the (0, 0) entry is 1, the middle plot is that except the (1, 1) entry is 1, and the right plot is that except the (4, 4) entry is 1. This can be interpreted as a discrete Schrödinger operator with a single Dirac potential at different points along [0, ∞). The continuous parts of the measures are given exactly by the computable formula in equation (1.7), and each has a single Dirac delta corresponding to discrete spectrum (the weight of the delta gets progressively smaller in each plot), the location of which can be computed with guaranteed error using interval arithmetic (see Appendix A) .
• Theorem 5.13 and Theorem 5.15 : The Toeplitz symbol of C Toe , c, is analytic in the complex unit disc. The discrete eigenvalues, as in the Toeplitz-plus-finite-rank case are of the form 1 2 (z k + z −1 k ) where z k are the roots of c in the open unit disc.
The relevance of the space 1 R here is that for an upper triangular Toeplitz matrix which is bounded as an operator from 1 R to itself for all R > 1, the symbol of that operator is analytic in the open unit disc.
Following the pioneering work of Ben-Artzi-Hansen-Nevanlinna-Seidel on the Solvability Complexity Index [4,5,24], we prove two theorems about computability. We assume real number arithmetic, and the results do not necessarily apply to algorithms using floating point arithmetic.
• Theorem 6.7: If J is a Toeplitz-plus-finite-rank Jacobi operator, then in a finite number of operations, the absolutely continuous part of the spectral measure is computable exactly, and the locations and weights of the discrete part of the spectral measure are computable to any desired accuracy. If the rank of the perturbation is known a priori then the algorithm can be designed to terminate with guaranteed error control.
• Theorem 6.9: If J = ∆ + K is a Toeplitz-plus-compact Jacobi operator, then in a finite number of operations, the spectrum of J is computable to any desired accuracy in the Hausdorff metric on subsets of R. If the quantity sup k≥m |α k | + sup k≥m |β k − 1 2 | can be estimated for all m, then the algorithm can be designed to terminate with guaranteed error control.
The present authors consider these results to be the beginning of a long term project on the computation of spectra of structured operators. Directions for future research are outlined in Section 7.

Relation to existing work on connection coefficients
Recall that J and D are Jacobi operators with orthonormal polynomials {P k } ∞ k=0 and {Q k } ∞ k=0 respectively, and spectral measures µ and ν respectively. Uvarov gave expressions for the relation between {P k } ∞ k=0 and {Q k } ∞ k=0 in the case where the Radon-Nikodym derivative dν dµ is a rational function, utilising connection coefficients [43,44]. Decades later, Kautsky and Golub related properties of J, D and the connection coefficients matrix C = C J→D with the Radon-Nikodym derivative dν dµ , with applications to practical computation of Gauss quadrature rules in mind [28]. In the setting of Gauss quadrature rules, the connection coefficients are usually known as modified or mixed moments, (see [19,36,51]). The following results, which we prove in Section 3 for completeness, are straightforward generalisations of what can be found in the papers cited in this paragraph from the 1960's, 1970's and 1980's.
The Jacobi operators and the connection coefficients satisfy CJ = DC, (1.9) which makes sense as operators acting on finitely supported sequences (this is made clear and proved in Theorem 3.5). A finite-dimensional version of this result with a rank-one remainder term first appears in [28], but there it is . The connection coefficients matrix also determines the existence and certain properties of the Radon-Nikodym derivative dν dµ : • Proposition 3.7: dν dµ ∈ L 2 µ (R) if and only if the first row of C is an 2 sequence, in which case More generally, if ∞ k=0 c 0,k P k defines an L 1 µ (R) function (with the series converging at least in the probabilists' weak sense) then that function is precisely dν dµ .

Relation to existing work on spectra of Jacobi operators
There has been extensive work in the last 20 years or so on the spectral theory of Jacobi operators which are compact perturbations of the free Jacobi operator, particularly with applications to quantum theory and random matrix theory in mind [29,10,11,38,16,18]. The literature focuses on so-called sum rules, which are certain remarkable relationships between the spectral measures and the entries of Jacobi operators, and builds upon some 20th century developments in the Szegő theory of orthogonal polynomials [40,26,21,14,48,45,46,31,47].
For a Jacobi operator J, which is a compact perturbation of the free Jacobi operator ∆, with orthogonal polynomials {P k } ∞ k=0 and spectral measure dµ, the central analytical object of interest is the function Conditions on the perturbation J − ∆ yield a nicer u 0 . For instance, when J − ∆ is trace class, u 0 is analytic and its roots in the unit disc are in one-to-one correspondence with the eigenvalues of J, and when J − ∆ is of finite rank, u 0 is a polynomial [29].
The function u 0 defined as in (1.12) can be arrived at through several different definitions: the Jost functions, the perturbation determinant, the Szegő function and the Geronimo-Case functions (see the introduction of [29]). One contribution of the present paper is that it provides a new interpretation of u 0 : the Toeplitz symbol c(z). Furthermore, this new interpretation also has a matrix associated to it, the connection coefficients matrix C, which is defined for any two Jacobi operators, not only perturbations of the free Jacobi operator. This opens the door to generalisation, something the present authors intend to pursue in the future.

Outline of the paper
• In Section 2 we outline basic, established results about spectral theory of Jacobi operators.
• In Section 3 we discuss the basic properties of the connection coefficients matrix C J→D for general Jacobi operators J and D, and how they relate to the spectra of J and D.
• In Section 4 we show how connection coefficient matrices apply to Toeplitz-plus-finite-rank Jacobi operators, and in Section 5 we extend these results to the Toeplitz-plus-trace-class case.
• Section 6 is devoted to issues of computability.
• Appendix A gives an array of numerical examples produced using an open source Julia package SpectralMeasures.jl [49] that implements the ideas of this paper. It makes extensive use of the open source Julia package ApproxFun.jl [33,34], in particular the features for defining and manipulating functions and infinite-dimensional operators.

Spectral theory of Jacobi operators
In this section we present well known results about the spectra of Jacobi operators. This gives a self-contained account of what is required to prove the results later in the paper, and sets the notation.
(i) There exists a unique compactly supported probability measure µ on R, called the spectral measure of J, such that (ii) For any s 1 < s 2 in R, The point spectrum σ p (J) of J is the set of points s ∈ R such that the limit exists and is positive.
The continuous spectrum of J is the set of points s ∈ R such that µ({s}) = 0 but The measure µ is the spectral measure that appears in the spectral theorem for self-adjoint operators on Hilbert space [17], as demonstrated by the following theorem [12,41,37]. Definition 2.3. The orthonormal polynomials for J are P 0 , P 1 , P 2 , . . . defined by the three term recurrence 12]). Let J be a bounded Jacobi operator and let P 0 , P 1 , P 2 , . . . be as defined in Definition 2.3. Then we have the following.
(i) The polynomials are such that P k (J)e 0 = e k .
(ii) The polynomials are orthonormal with respect to the spectral measure of J, Then for all f ∈ L 2 (µ), (2.10) (iv) For all f ∈ L 1 (µ), the operator f (J) has entries given weakly by, The following definition is standard in orthogonal polynomial theory (see for example, [20, p. 18], [46]).
Definition 2.5. The first associated polynomials for J are P µ 0 , P µ 1 , P µ 2 , . . . defined by the three term recurrence The relevance of the first associated polynomials for this work is the following integral formula.
Lemma 2.6. ( [20, pp. 17,18]) The first associated polynomials are given by the integral formula (2.14) For notational convenience we also define the µ-derivative of a general polynomial.
Definition 2.7. Let µ be a probability measure compactly supported on the real line and let f be a polynomial. The µ-derivative of f is the polynomial defined by

Connection coefficient matrices
In this section we give preliminary results to indicate the relevance of connection coefficient matrices to spectral theory of Jacobi operators. Recall Definition 1.1, of the connection coefficients matrix between two Jacobi operators.

Basic properties
As in the introduction, consider a second bounded Jacobi operator, with principal residual function H(z), spectral measure ν and orthogonal polynomials denoted Q 0 , Q 1 , Q 2 , . . .. In the introduction (Definition 1.1) we defined the connection coefficient matrix between J and D, C = C J→D to have entries satisfying Definition 3.1. Denote the space of complex-valued sequences with finitely many nonzero elements by F , and its algebraic dual, the space of all complex-valued sequences, by F .
Note that C : F → F , because it is upper triangular, and C T : F → F , because it is lower triangular, and thus we may write By orthonormality of the polynomial sequences the entries can also be interpreted as where ·, · ν is the standard inner product on L 2 ν (R).
Lemma 3.2. The entries of the connection coefficients matrix C J→D satisfy the following 5-point discrete system: with boundary conditions Proof. Assume by convention that c ij = 0 if i = −1 or j = −1. Now using this boundary condition and the three term recurrences for the polynomial sequences, we see that Since sQ i (s), P j (s) ν = Q i (s), sP j (s) ν , we have the result for the interior points 0 ≤ i < j.
The remaining boundary conditions come from c i0 = Q i , P 0 ν which equals 1 if i = 0 and 0 otherwise.
The 5-point discrete system described in Lemma 3.2 can be used to find an explicit linear recurrence to compute the entries of C, The rows and columns of C also satisfy infinite-vector-valued three-term recurrence relations. It is simply the 5-point discrete system rewritten in vector form, but this is the form which we make use of in the proofs later.

Connection coefficients and spectral theory
The following theorems give precise results about how the connection coefficients matrix C can be useful for studying and computing the spectra of Jacobi operators.
Theorem 3.5. Let J and D be bounded Jacobi operators and C = C J→D the connection coefficients matrix. For all polynomials p, we have the following as operators from F to F , Remark 3.6. In particular, as operators from F to F , Proof. First we begin with the case p(z) = z. By definition, Then by Corollary 3.3, this is equal to Dc * ,0 , which is equal to DCe 0 . Now, for any j > 0, Then by Corollary 3.3, this is equal to Dc * ,j , which is equal to DCe j . Hence CJ = DC.
Now, when f (z) = z k for any k > 0, D k C = D k−1 CJ = · · · = CJ k . By linearity Cf (J) = f (D)C for all polynomials f . Proof. Suppose first that dν dµ ∈ L 2 µ (R). Then dν dµ = ∞ k=0 a k P k , for some a ∈ 2 , because P 0 , P 1 , P 2 , . . . is an orthonormal basis of L 2 µ (R). The coefficients are given by, Hence c 0, * ∈ 2 and gives the P k coefficients of dν dµ . Conversely, suppose that c 0, * ∈ 2 . Then the function ∞ k=0 c 0,k P k is in L 2 µ (R), and by the same manipulations as above its projections onto polynomial subspaces are equal to that of dν dµ . Remark 3.8. Proposition 3.7 can be made more general. If the first row of C is such that the series defined by ∞ k=0 c 0,k P k converges weakly (in the probabilists' sense) to an L 1 µ (R) function, then dν dµ exists and is equal to that limit. However, such a condition on the entries of C is more difficult to check in practical situations.
Remark 3.9. If we have a situation in which c 0, * ∈ 2 , we can by Proposition 3.7 and basic properties of the Radon-Nikodym derivative deduce that σ(D) ⊂ σ(J) and the function defined by ∞ k=0 c 0,k P k is zero on σ(J) \ σ(D). This observation translates into a rootfinding problem in Section 4. Lemma 3.10. Let J and D be bounded Jacobi operators with spectral measures µ and ν respectively, and connection coefficient matrix C = C J→D . If ν is absolutely continuous with respect to µ, then as operators mapping F → F , Proof. Note first that since C : F → F and C T : This completes the proof.
Proposition 3.11. Let J and D be bounded Jacobi operators with spectral measures µ and ν respectively, and connection coefficient matrix C = C J→D . Then dν dµ ∈ L ∞ µ (R) if and only if C is a bounded operator on 2 , in which case Proof. Suppose first that dν dµ ∈ L ∞ µ (R). Then by Lemma 3.10, Hence C T C is bounded. The relationship C 2 2 = C T C 2 completes this direction. Now suppose that C is bounded. Then by Proposition 3.7 dν dµ ∈ L 2 µ (R). By Lemma 3.10, dν dµ (J) is a bounded operator on 2 (because it is equal to the bounded operator C T C). Since dν dµ (J) Corollary 3.12. Let J and D be bounded Jacobi operators with spectral measures µ and ν respectively, and connection coefficient matrix C = C J→D . Then dν dµ ∈ L ∞ µ (R) and dµ dν ∈ L ∞ ν (R) if and only if C is bounded and invertible on 2 .
Proof. By Proposition 3.11, C J→D is bounded if and only if dν dµ ∈ L ∞ µ (R), and C D→J is bounded if and only if dµ dν ∈ L ∞ ν (R). Combining this the fact that C −1 J→D = C D→J , as operators from F to itself, we complete the proof.
The following definition and lemma are useful later. Definition 3.13. Given polynomial sequences P 0 , P 1 , P 2 , . . . and Q 0 , Q 1 , Q 2 , . . . for Jacobi operators J and D respectively, we define the matrix C µ to be the connection coefficients matrix between P µ 0 , P µ 1 , P µ 2 , . . . and Q 0 , Q 1 , Q 2 , . . . as in Definition 1.1, where P µ 0 , P µ 1 , P µ 2 , . . . are the first associated polynomials for J as in Definition 2.5. Noting that the lower triangular matrix (C µ ) T is a well defined operator from F into itself, we have for all s.
Remark 3.14. Note that C µ is strictly upper triangular, because the first associated polynomials have their degrees one less than their indices.

Toeplitz-plus-finite-rank Jacobi operators
In this section we present several novel results which show how the connection coefficient matrices can be used for computing the spectral measure of a Toeplitz-plus-finite-rank Jacobi operator.

Jacobi operators for Chebyshev polynomials
There are two particular Jacobi operators with Toeplitz-plus-finite-rank structure that are of great interest, The spectral measures of ∆ and Γ are Using results of Stieltjes in his seminal paper [39], [1,App.], the principal resolvent can be written elegantly as a continued fraction, Using this gives explicit expressions for the principal resolvents, Remark 4.1. We must be careful about which branch we refer to when we write the resolvents in this explicit form. Wherever √ is written above we mean the standard branch that is positive on (0, ∞) with branch cut (−∞, 0]. This gives a branch cut along [−1, 1] in both cases, the discontinuity of G across which makes the Perron-Stieltjes inversion formula in Theorem 2.2 work. It also ensures the O(λ −1 ) decay resolvents enjoy as λ → ∞.
The orthonormal polynomials for ∆ are the Chebyshev polynomials of the second kind, which we denote U k (s), The orthonormal polynomials for Γ are the normalised Chebyshev polynomials of the first kind, which we denoteT k (s). Note that these are not the usual Chebyshev polynomials of the first kind (denoted T k (s)) [20,12]. We in fact have, The first associated polynomials have simple relationships with the orthonormal polynomials,

Rank-one perturbations
In this section we demonstrate for two simple, rank-one perturbations of ∆ how the connection coefficient matrix relates properties of the spectrum of the operators. This will give some intuition as to what to expect in more general cases.
We will discuss what happens when |α| ≥ 1 later in the section.
Then the connection coefficient matrix C J β →∆ is the banded Toeplitz-plus-rank-1 matrix Just as in Example 4.2, this can be computed using the explicit recurrences We will discuss what happens when β ≥ √ 2 later in the section. Note that the case β = √ 2 gives the Jacobi operator Γ in equation (4.1).

Fine properties of the connection coefficients
The two basic perturbations of ∆ discussed above give connection coefficient matrices that are highly structured. The following lemmata and theorems prove that this is no coincidence; in fact, if Jacobi operator J is a finite-rank perturbation of ∆ then C J→∆ is also a finite-rank perturbation of Toeplitz.
Remark 4.4. Note for the following results that all vectors and matrices are indexed starting from 0. Lemma 4.5. If δ j = β j for j ≥ n then c jj = c nn for all j ≥ n.
Lemma 4.6. Let J and D be Jacobi operators with coefficients {α k , β k } and {γ k , δ k } respectively, such that there exists an n such that 1 Then the entries of the connection coefficient matrix C = C J→D satisfy Remark 4.7. This means that C is of the form C = C Toe + C fin where C Toe is Toeplitz and C fin is zero except in the first n − 1 rows. For example, when n = 4, we have the following structure Proof. We prove by induction on k = 0, 1, 2, . . . that The last line follows from the induction hypothesis for the case k − 2 (hence why we needed two base cases).
The special case in which D is Toeplitz gives even more structure to C, as demonstrated by the following theorem. We state the results for a finite-rank perturbation of the free Jacobi operator ∆, but they apply to general Toeplitz-plus-finite rank Jacobi operators because the connection coefficients matrix C is unaffected by a scaling and shift by the identity applied to both J and D.
Theorem 4.8. Let J be a Jacobi operator such that there exists an n such that i.e. it is equal to the free Jacobi operator ∆ outside the n × n principal submatrix. Then the entries of the connection coefficient matrix C = C J→∆ satisfy Remark 4.9. This means that C is of the form C = C Toe + C fin where C Toe is Toeplitz with bandwidth 2n − 1 and C fin zero except for entries in the (n − 1) × (2n − 2) principal submatrix. For example when n = 4, we have the following structure, Proof. First we prove (4.7). Fix i, j such that i + j ≥ 2n. Note that the case i ≥ n is proven in Lemma 4.6. Hence we assume i < n, and therefore j > n. Using Lemma 3.2 and equations (3.3)-(3.7) we find the following recurrence. Substituting δ i = 1 2 , γ i = 0 for all i, and α k = 0, β k−1 = 1 2 for k ≥ n into the recurrence, we have Repeating this process on c i+1,j−1 in the above expression gives Repeating the process on c i+2,j−2 and so on eventually gives By Lemma 4.6, c n,i+j−n = c n−1,i+j−n−1 , so we are left with c i,j = c i−1,j−1 . This completes the proof of (4.7). Now we prove (4.8). Let j ≥ 2n. Then This is equal to zero by (4.7), because 1 + (j − 1) ≥ 2n.
Corollary 4.10. Let C µ be as defined in Definition 3.13 for C as in Theorem 4.8.
Proof. This follows from Theorem 4.8 applied to J µ as defined in Lemma 3.15.
Remark 4.11. A technical point worth noting for use in proofs later is that for Toeplitz-plus-finite-rank Jacobi operators like J and D occurring in Theorem 4.8 and Corollary 4.10, the operators C, C T , C µ and (C µ ) T all map F to F . Consequently, combinations such as CC T , C µ C T are all well defined operators from F to F .

Properties of the resolvent
When the Jacobi operator J is Toeplitz-plus-finite rank, as a consequence of the structure of the connection coefficients matrix proved in subsection 4.3, the principal resolvent G (see Definition 2.1) and spectral measure (see Theorem 2.2) are also highly structured. As usual these proofs are stated for a finite-rank perturbation of the free Jacobi operator ∆, but apply to general Toeplitz-plus-finite rank Jacobi operators by applying appropriate scaling and shifting.
Theorem 4.12. Let J be a Jacobi operator such that there exists an n such that i.e. it is equal to the free Jacobi operator ∆ outside the n × n principal submatrix. Then the principal resolvent for J is P k are the orthonormal polynomials for J, P µ k are the first associated polynomials for J as in Definition 2.5, and U k are the Chebyshev polynomials of the second kind.
Remark 4.13. p µ C is the µ-derivative of p C as in Definition 2.7. Proof. Using Theorem 2.2 and Proposition 3.7, The first term is equal to p C (λ)G(λ), and the second term is equal to p µ C (λ) by Lemma 2.6 and Remark 4.13. The equation can now be immediately rearranged to obtain (4.9).
To see the equality in equation (4.10), note that by the definition of the connection coefficient matrix C, Equation (4.11) follows by the same algebra.
Theorem 4.14. Let J be a Jacobi operator such that there exists an n such that i.e. it is equal to the free Jacobi operator ∆ outside the n × n principal submatrix. Then the spectral measure for J is where λ 1 , . . . , λ r are the roots of p C in R \ {1, −1} such that Furthermore, there are no roots of p C inside (−1, 1), and the number of roots of p C for which w k = 0 is at most n (i.e. r ≤ n).
Proof. Let G and µ be the principal resolvent and spectral measure of J respectively. By Theorem 4.12, .
Letting λ 1 , . . . , λ 2n−1 be the roots of p C in the complex plane, define the set By inspection of the above formula for G, and because resolvents of selfadjoint operators are analytic off the real line, we have that G is continuous outside of S. Therefore, for any s ∈ R such that dist(s, S) > 0, we have lim Hence by Theorem 2.2 part (ii), for any interval (s 1 , Therefore the essential support of µ is contained within S. We are interested in the real roots of p C . Can any roots of p C lie in the interval [−1, 1]? By This integral is only finite if p C has no roots in (−1, 1) and only simple roots at ±1. Since S is a disjoint union of [−1, 1] and a finite set S we can write By Theorem 2.2 part (iii), This gives the desired formula for w k . Finally, let us prove that the number of eigenvalues (denoted r in the statement of the theorem) must be at most n. We proceed by induction on n = 0, 1, 2, . . . that the Jacobi operator J = ∆+ n k=1 v k ⊗v k has at most n eigenvalues, where (v ⊗ w)u = w, u v for u, v, w ∈ 2 .
For n = 0 this is already known because ∆ only has continuous spectrum. Now consider n > 0. If λ is an eigenvalue of J with eigenvector w ∈ 2 , then If v k , w = 0 for all k then w is an eigenvector of ∆, which is impossible because ∆ has only continuous spectrum. Hence, without loss of generality v n , w = 0. WriteJ = ∆ + This implies that λ is not an eigenvalue ofJ. Hence we may write which after multiplying by v T n / v n , w gives There are four intervals of continuity for f ; they are (−∞, −3), (−3, −1), (1, 3) and (3, ∞), within each of which f is strictly increasing. As in the proof, the left-most interval cannot possibly contain a root because there f (λ) > 1. Hence f has at most three real roots.
If we write the left hand side as f (λ), then for Remark 4.15. Theorem 4.14 gives an explicit formula for the spectral measure of J, when J is Toeplitzplus-finite-rank Jacobi operator. The entries of C can be computed in O(n 2 ) operations (for an n × n perturbation of Toeplitz). Hence, the absolutely continuous part of the measure can be computed exactly in finite time. It would appear at first that we may compute the locations of the point spectrum by computing the roots of p C , but in fact we find that not all real roots of p C have w k = 0. Hence we rely on cancellation between the numerator and denominator in the formula for G(λ), which is a dangerous game, because if roots of polynomials are only known approximately then it is impossible to distinguish between cancellation and the case where a pole and a root are merely extremely close. Subsection 4.5 remedies this situation.
In the case where |α| > 1, we have a different situation. Here G ∆ ( 1 2 (α + α −1 )) = −2α −1 . Therefore the root λ = 1 2 (α + α −1 ) of the denominator is never cancelled out. Hence there is always a pole of G at λ = 1 2 (α + α −1 ), and therefore also an eigenvalue of J there. Notice a heavy reliance on cancellations in the numerator and denominator for the existence of eigenvalues. The approach in subsection 4.5 avoids this.
Clearly the only points G may have a pole is at λ However, it is difficult to see whether there would be cancellation on the numerator. In the previous discussion on this example we noted that there would not be any poles when |β| < √ 2, which means that the numerator must be zero at these points, but it is far from clear here. The techniques we develop in the sequel illuminate this issue, especially for examples which are much more complicated than the two trivial ones given so far.

The Joukowski transformation
The following two lemmata and two theorems prove that Theorem 4.12 and Theorem 4.14 can be simplified drastically by making the change of variables This map is known as the Joukowski map. It is an analytic bijection from D = {z ∈ C : |z| < 1} to C \ [−1, 1], sending the unit circle to two copies of the interval [−1, 1]. The Joukowski map has special relevance for the principal resolvent of ∆. A brief calculation reveals that for z ∈ D, G ∆ (λ(z)) = −2z. (4.13) Further, we will see that the polynomials p C (λ) and p µ C (λ) occurring in our formula for G can be expressed neatly as polynomials in z and z −1 . This is a consequence of a special property of the Chebyshev polynomials of the second kind, that for any k ∈ Z and z ∈ D (4.14) These convenient facts allow us to remove any square roots involved in the formulae in Theorem 4.12. where λ(z) = 1 2 (z + z −1 ).

Proof.
The key quantity to observe for this proof is 2n−1 k=0 c m,m+k P m+k (λ(z)) U m (λ(z)) , (4. 16) for z ∈ D as m → ∞. We will show it is equal to both sides of equation (4.15). Consider the polynomial U m · p C . The jth coefficient in an expansion in the basis P 0 , P 1 , P 2 , . . . is given by because p C = dµ∆ dµ by Proposition 3.7. Hence for all m ∈ N and all z ∈ D. Now we show that (4.16) converges to c(z)c(z −1 ) as m → ∞. By the definition of the connection coefficients, P m+k = 2n−1 j=0 c m+k−j,m+k U m+k−j . Therefore, Now, by Theorem 4.8, C = C Toe + C fin , where C fin is zero outside the (n − 1) × (2n − 2) principal submatrix. Hence for m sufficiently large we have c m,m+k = t k for a sequence (t k ) k∈Z such that t k = 0 for k / ∈ {0, 1, . . . , 2n − 1}. Hence we have for m sufficiently large, By equation (4.14), this tends to 2n−1 k=0 2n−1 j=0 t k t j z j−k as m → ∞. This is equal to c(z)c(z −1 ), as required to complete the proof. where λ(z) = 1 2 (z + z −1 ) and z ∈ D. Proof. The key quantity to observe for this proof is for z ∈ D, as m → ∞. We will compute two equivalent expressions for this quantity to derive equation (4.17). In the proof of Lemma 4.18, it was shown that U m (λ)p C (λ) = 2n−1 k=0 c m,m+k P k (λ). We take the µ-derivative (see Definition 2.7) of both sides as follows.
The following theorem describes Theorem 4.12 under the change of variables induced by the Joukowski map. The remarkable thing is that the resolvent is expressible as a rational function inside the unit disc.
Theorem 4.20. Let J be a Jacobi operator such that there exists an n such that i.e. it is equal to the free Jacobi operator ∆ outside the n × n principal submatrix. By Theorem 4.8 the connection coefficient matrix can be decomposed into C = C Toe + C fin . By Corollary 4.10, we similarly have C µ = C µ Toe + C µ fin . If c and c µ are the Toeplitz symbols of C Toe and C µ Toe respectively, then for λ(z) = 1 2 (z + z −1 ) with z ∈ D, the principal resolvent G is given by the rational function This completes the proof.
The following theorem gives a better description of the weights w k in Theorem 4.14, utilising the Joukowski map and the Toeplitz symbol c.
Theorem 4.21. Let J be a Jacobi operator such that there exists an n such that i.e. it is equal to the free Jacobi operator ∆ outside the n × n principal submatrix. By Theorem 4.8 the connection coefficient matrix can be written C = C Toe + C fin . If c is the Toeplitz symbol of C Toe , then the spectral measure of J is Here z k are the roots of c that lie in the open unit disk, which are all real and simple. The only roots of c on the unit circle are ±1, which can also only be simple. Further, r ≤ n.
Proof. By Theorem 4.14, where r ≤ n. Hence we just need to prove something more specific about the roots of c, λ 1 , . . . , λ r , and w 1 , . . . , w r . By Theorem 4.20, Therefore c(z) and c µ (z) cannot simultaneously be zero unless z = z −1 , which only happens at z = ±1. By the same reasoning, c(z) and c(z −1 ) also cannot be simultaneously zero unless z = ±1. Since the Joukowski map λ is a bijection from D to C \ [−1, 1], this shows that the (simple and real) poles of G in C \ [−1, 1] are precisely λ(z 1 ), . . . , λ(z r ), where z 1 , . . . , z r are the (necessarily simple and real) roots of c in D.
Note that if c(z) = 0 then c(z) = 0 because c has real coefficients. If c has a root z 0 on the unit circle, then c(z 0 ) = c(z −1 0 ) = 0 because z 0 = z −1 0 , which earlier in the proof we showed only occurs if z 0 = ±1. Hence c does not have roots on the unit circle except possibly ±1.  4), we see that the Toeplitz symbol c is c(z) = 1 − αz. By Theorem 4.21 the roots of c in the unit disc correspond to eigenvalues of J α . As is consistent with our previous considerations, c has a root in the unit disc if and only if |α| > 1, and those eigenvalues are λ(α −1 ) = 1 2 (α + α −1 ). See Appendix A for figures depicting the spectral measure and the resolvent. If ≥ 1 so there are no roots of c in the unit disc, as is consistent with the previous observations. What was difficult to see before is, if β > √ 2 then ± 1 √ is a root of c inside D, and it corresponds to an eigenvalue, λ ± 1 See Appendix A for figures depicting the spectral measure and the resolvent.

Toeplitz-plus-trace-class Jacobi operators
In this section we extend the results of the previous section to the case where the Jacobi operator is Toeplitz-plus-trace-class. This cannot be done as a direct extension of the work in the previous section as the formulae obtained depended on the fact that some of the functions involved were merely polynomials in order to have a function defined for all λ in an a priori known region of the complex plane. We admit that it may be possible to perform the analysis directly, but state that it is not straightforward. We are interested in feasible (finite) computation so are content to deal directly with the Toeplitz-plus-finite-rank case and perform a limiting process. The crucial question for computation is, can we approximate the spectral measure of a Toeplitz-plus-trace-class Jacobi operator whilst reading only finitely many entries of the matrix?
Here we make clear the definition of a Toeplitz-plus-trace-class Jacobi operator.

Jacobi operators for Jacobi polynomials
The most well known class of orthogonal polynomials is the Jacobi polynomials, whose measure of orthogonality is where α,β > −1 and B is Euler's Beta function. The Jacobi operator for the normalised Jacobi polynomials with respect to this probability measure, and hence the three-term recurrence coefficients, are given by [32], Note that |α k | = O(k −2 ) and Hence the Jacobi operators for the Jacobi polynomials are Toeplitz-plus-trace-class for all α, β > −1.
The Chebyshev polynomials T k and U k discussed in the previous section are specific cases of Jacobi polynomials, with α, β = − 1 2 , − 1 2 for T k and α, β = 1 2 , 1 2 for U k . In Appendix A numerical computations of the spectral measures and resolvents of these Jacobi operators are presented.

Toeplitz-plus-finite-rank approximations
We propose to use the techniques from Section 4. Therefore for a Jacobi operator J, we can define the Toeplitz-plus-finite-rank approximations J Proposition 5.2. Let J a Jacobi operator (bounded, but with no assumed structure imposed) and let µ be its spectral measure. Then the measures µ [1] , µ [2] , . . . which are the spectral measures of J [1] , J [2] , . . . , so we only need to consider polynomials as test functions, and by linearity we only need to consider the orthogonal polynomials for J. The first polynomial P 0 has immediate convergence, since the measures are all probability measures. Now consider P k for some k > 0, which satisfies P k (s) dµ(s) = 0. For m > k, P k is also the kth orthogonal polynomial for J [m] , hence P k (s) dµ [m] (s) = 0. This completes the proof.

Asymptotics of the connection coefficients
Here we formulate a lower triangular block operator equation Lc = e 0 0 , where e 0 0 = (e 0 , 0, 0, . . .) , satisfied by the entries of the connection coefficient matrices encoded into a vector c. For Toeplitzplus-trace-class Jacobi operators we give appropriate Banach spaces upon which the operator L is bounded and invertible, enabling precise results about the asymptotics of the connection coefficients to be derived. Lemma 5.3. Let J and D be Jacobi operators with entries {α k , β k } ∞ k=0 and {γ k , δ k } ∞ k=0 respectively. If we decompose the upper triangular part of C J→D into a sequence of sequences, stacking each diagonal on top of each other, we get the following block linear system, where for each i, For B −1 to make sense we define β −1 = 1/2.
Proof. This is simply the 5-point discrete system in Lemma 3.2 rewritten.
We write the infinite-dimensional-block-infinite-dimensional system (5.2) in the form, For general Jacobi operators J and D, the operators A i and B i are well defined linear operators from F to F . The block operator L is whence considered as a linear operator from the space of sequences of real sequences, F ( F ) to itself. We will use this kind of notation for other spaces as follows.
Definition 5.4 (Vector-valued sequences). If X is a vector space of scalar-valued sequences, and Y is another vector space then we let X (Y ) denote the vector space of sequences of elements of Y . In many cases in which X and Y are both normed spaces, then X (Y ) naturally defines a normed space in which the norm is derived from that of X by replacing all instances of absolute value with the norm on Y . For example, p ( ∞ ) is a normed space with norm (a k ) ∞ k=0 The following two spaces are relevant for the Toeplitz-plus-trace-class Jacobi operators.
The following result is immediate from the definition of the norm on bv.
Lemma 5.6. There is a continuous embedding bv ⊂ c the Banach space of convergent sequences i.e. for all (a k ) ∞ k=0 ∈ bv, lim k→∞ a k exists, and sup k |a k | ≤ (a k ) ∞ k=0 bv . Furthermore, lim k→∞ |a k | ≤ a bv . Definition 5.7 (Geometrically weighted 1 ). For any R > 0, e define the Banach space 1 R to be the space of sequences such that the norm is finite.
Proposition 5.8. The operator norm on 1 R is equal to The following Lemma and its Corollary show that it is natural to think of c as lying in the space This decomposition will allow us to prove that L is bounded and invertible as follows. We will show that as operators from 1 R (bv) to 1 R ( 1 ), T is bounded and invertible, and K is compact. This implies that L is a Fredholm operator with index 0. Therefore, by the Fredholm Alternative Theorem, L is invertible if and only if it is injective. It is indeed injective, because it is block lower triangular with invertible diagonal blocks, so forward substitution on the system Lv = 0 implies that each entry of v must be zero.
First let us prove that T is bounded and invertible. It is elementary that T is an isometric isomorphism from bv to 1 and T T is bounded with norm at most 1. Hence using Proposition 5.8 we have Because each operator is lower triangular, the left and right inverse of T : This matrix is block-lower triangular and block-Toeplitz with first column having 2ith block of the form T −1 (−T T T −1 ) i and (2i + 1)th block zero. We must check that T −1 is bounded in the norms on 1 R ( 1 ) to 1 R (bv) so that it may be extended to 1 R ( 1 ) from the dense subspace F . Again using Proposition 5.8 we have , where all elements are the same as in K, except that all occurrences of α i and 2β i − 1 are replaced by 0 for i ≥ m. Using Proposition 5.8 we have By the continuous embedding in Lemma 5.6, · bv→ 1 ≤ · ∞ → 1 . Hence This convergence is due to the fact that J − ∆ is trace class. Since K is a norm limit of finite rank operators it is compact. This completes the proof that L is bounded and invertible. Now consider the operator L [m] defined in the statement of the Lemma, which is equal to T + K [m] (where K [m] is precisely that which was considered whilst proving K is compact). Hence, This completes the proof.
Suppose that m is sufficiently large so that L − L [m] < L −1 −1 (guaranteed by Lemma 5.9). Note that L −1 is bounded by the Inverse Mapping Theorem and Lemma 5.9. Then by a well-known result (see for example, [2]), This tends to zero as m → ∞, by Lemma 5.9.
Theorem 5.11. Let J = ∆ + K be a Jacobi operator where K is trace class. Then C = C J→∆ can be decomposed into where C Toe is upper triangular, Toeplitz and bounded as an operator from 1 R to 1 R , and C com is compact as an operator from 1 R to 1 R , for all R > 1. Also, if J has Toeplitz-plus-finite-rank approximations com , then in the operator norm topology over 1 R for all R > 1.
Proof. By Lemma 5.9, for each k the sequence (c 0,0+k , c 1,1+k , c 2,2+k , . . .) is an element of bv. By Lemma 5.6 each is therefore a convergent sequence, whose limits we call t k . Hence we can define an upper triangular Toeplitz matrix C Toe whose (i, j)th element is t j−i , and define C com = C − C Toe . The Toeplitz matrix C Toe is bounded from 1 R to 1 R for all R > 1 by the following calculation.
By Lemma 5.9 this quantity is finite (since R −1 ∈ (0, 1)). Now we show convergence results. The compactness of C com will follow at the end. For all R > 1, For the third line of the above sequence of equations, note that for fixed k, c 0,k − c 2,2+k , . . . is a bv sequence, and refer to Lemma 5.6.
For the third line of the above sequence, note that t k −t [m] k is the limit of the bv sequence c * , * +k −c [m] * , * +k , and refer to Lemma 5.6. com has finite rank. Therefore, since C com = lim m→∞ C [m] com in the operator norm topology over 1 R −1 , we have that C com is compact in that topology. Corollary 5.12. Let C µ be as defined in Definition 3.13 for C as in Theorem 5.11. Then C µ can be decomposed into C µ = C µ Toe +C µ com where C µ Toe is upper triangular, Toeplitz and bounded as an operator from 1 R to 1 R , and C µ com is compact as an operator from 1 R to 1 R , for all R > 1. Furthermore, if J has Toeplitz-plus-finite-rank approximations J [m] with connection coefficient matrices in the operator norm topology over 1 R . Proof. This follows from Theorem 5.11 applied to J µ as defined in Lemma 3.15. Proof. Let R > 1 and let 0 ≤ |z| ≤ R −1 < 1. Then by Lemma 5.6 we have where c is as defined in equation (5.3). By Lemma 5.9 this quantity is finite. Since R is arbitrary, the radius of convergence of the series is 1. The same is true for c µ by Lemma 3.15. Now we prove that the Toeplitz symbols corresponding to the Toeplitz-plus-finite-rank approximations converge.
To go between the first and second lines, note that for each k, c * , * +k − c [m] * , * +k is a bv sequence whose limit is t k − t   Theorem 5.14 (See [27]). Let A and B be bounded self-adjoint operators on 2 . Then Theorem 5.15. Let J = ∆ + K be a Toeplitz-plus-trace-class Jacobi operator, and let c and c µ be the analytic functions as defined in Theorem 5.11 and Corollary 5.12. Then for λ(z) = 1 2 (z + z −1 ) with z ∈ D such that λ(z) / ∈ σ(J), the principal resolvent G is given by the meromorphic function Therefore, all eigenvalues of J are of the form λ(z k ), where z k is a root of c in D.
Proof. Let z ∈ D such that λ(z) / ∈ σ(J), and let J [m] denote the Toeplitz-plus-finite-rank approximations of J with principal resolvents G [m] . Then J [m] → J as m → ∞, so by Theorem 5.14 there exists M such that for all m ≥ M , λ(z) / ∈ σ(J [m] ). For such m, both G(λ(z)) and G [m] (λ(z)) are well defined, and using a well-known result on the difference of inverses (see for example, [2]), we have

Computability aspects
In this section we discuss computability questionsà la Ben-Artzi-Hansen-Nevanlinna-Seidel [4,5,24]. This involves an informal definition of the Solvability Complexity Index (SCI), a recent development that rigorously describes the extent to which various scientific computing problems can be solved. It is in contrast to classical computability theoryà la Turing, in which problems are solvable exactly in finite time. In scientific computing we are often interested in problems which we can only approximate the solution in finite time, such that in an ideal situation this approximation can be made as accurate as desired. For example, the solution to a differential equation, the roots of a polynomial, or the spectrum of a linear operator.
Throughout this section we will consider only real number arithmetic, and the results do not necessarily apply to algorithms using floating point arithmetic.
The following is a modified definition of the Solvability Complexity Index (SCI). It is slightly stronger than the Ben-Artzi-Hansen-Nevanlinna-Seidel definition, which can be found in [4]; we do this to avoid a lengthy self-contained account of the theory where this simpler but stronger definition suffices for our purposes. In other words, the output of Γ can be computed using a sequence of k limits.
Remark 6.2. The requirement we use here that the functions Γ n1,...,n k are Turing computable is much stronger than what is used in the formal setting of [4], where the authors merely assume that these functions Γ n1,...,n k depend only on, and are determined by, finitely many evaluable elements of the input datum. Informally, this suffices for our needs because we want to prove positive results about computability in this paper; we prove our problem is computable in this stronger regime and that implies computability in the weaker regime of [4].
We require a metric space for the SCI:  Theorem 6.4 implies that the SCI of computing the spectrum of bounded Jacobi operators in the Hausdorff metric is 1. In loose terms, the problem is solvable using only one limit of computable outputs. What more can we prove about the computability?
The results of Section 4 reduce the computation of the spectrum of a Toeplitz-plus-finite-rank Jacobi operator to finding the roots of a polynomial. From an uninformed position, one is lead to believe that polynomial rootfinding is a solved problem, with many standard approaches used every day. One common method is to use the QR algorithm to find the eigenvalues of the companion matrix for the polynomial. This can be done stably and efficiently in practice [3]. However, the QR algorithm is not necessarily convergent for non-normal matrices (companion matrices are normal if and only if they are unitary, which is exceptional). Fortunately, the SCI of polynomial rootfinding with respect to the Hausdorff metric in for subsets of C is 1, but if one requires the multiplicities of these roots then the SCI is not yet known [4].
A globally convergent polynomial rootfinding algorithm is given in [25]. For any degree d polynomial the authors describe a procedure guaranteed to compute fewer than 1.11d(log d) 2 points in the complex plane, such that for each root of the polynomial, a Newton iteration starting from at least one of these points will converge to this root.
Let > 0. If a polynomial p of degree d has r roots, how do we know when to stop so that we have r points in the complex plane each within of a distinct root of p? This leads us to the concept of error control. Definition 6.5. [Error control] A function Γ which takes inputs to elements in a metric space M is computable with error control if it has solvability complexity index 1, and for each we can compute n to guarantee that d M (Γ n (A), Γ(A)) < .
In other words, the output of Γ can be computed using a single limit, and an upper bound for the error committed by each Γ n is also computable.
Besides providing O(d(log d) 2 ) initial data for the Newton iteration (to find the complex roots of a degree d polynomial), the authors of [25] discuss stopping criteria. In Section 9 of [25], it is noted therein that for Newton iterates z 1 , z 2 , . . ., if |z k − z k−1 | < /d, then there exists a root ξ of the polynomial in question such that |z k − ξ| < . It is then noted, however, that if there are multiple roots then it is in general impossible to compute their multiplicities with complete certainty. This is because the Newton iterates can pass arbitrarily close to a root to which this iterate does not, in the end, converge. Another consequence of this possibility is that roots could be missed out altogether because all of the iterates can be found to be close to a strict subset of the roots.
To salvage the situation, we give the following lemma, which adds some assumptions to the polynomial in question. Lemma 6.6. Let p be a polynomial and Ω ⊂ C an open set such that, a priori, the degree d is known and it is known that there are r distinct roots of p in Ω and no roots on the boundary of Ω. Then the roots of p in Ω is computable with error control in the Hausdorff metric (see Definition 6.3 and Definition 6.5).
Proof. Use Newton's method with the O(d(log d) 2 ) complex initial data given in [25]. Using the stopping criteria in the discussion preceding this lemma, the algorithm at each iteration produces O(d(log d) 2 ) discs in the complex plane, within which all roots of p must lie. To be clear, these discs have centres z k and radii d · |z k − z k−1 |. Let R k ⊂ Ω denote the union of the discs which lie entirely inside Ω and have radius less than (the desired error). Note that this set may be empty if none of the discs are sufficiently small.
Because the Newton iterations are guaranteed to converge from these initial data, we must have eventually, for some sufficiently large k, that R k has r connected components each with diameter less than . Terminate when this verifiable condition has been fulfilled.
Theorem 6.7. Let J = ∆ + F be a Toeplitz-plus-finite-rank Jacobi operator such that the rank of F is known a priori. Then its point spectrum σ p (J) is computable with error control in the Hausdorff metric (see Definition 6.3 and Definition 6.5).
Proof. Suppose F is zero outside the n × n principal submatrix. The value of n can be computed given that we know the rank of F . Compute the principal 2n × 2n submatrix of the connection coefficients matrix C J→∆ using formulae (3.3)-(3.7). The entries in the final column of this 2n × 2n matrix give the coefficients of the Toeplitz symbol c, which is a degree 2n − 1 polynomial.
Decide if ±1 are roots by evaluating p(±1). Divide by the linear factors if necessary to obtain a polynomialp such thatp(±1) = 0. Use Sturm's Theorem to determine the number of roots ofp in (−1, 1), which we denote r [35]. Since all roots in D are real, there are r roots ofp in the open unit disc D and none on the boundary. By Lemma 6.6, the roots z 1 , . . . , z r of this polynomial c which lie in (−1, 1) can be computed with error control. By Theorem 4.21, for the point spectrum of J we actually require λ k = 1 2 (z k +z −1 k ) to be computed with error control. Note that since |λ k | ≤ J 2 for each k, we have that |z k | ≥ (1+2 J 2 ) −1 . We should ensure that this holds for the computed rootsẑ k ∈ D too. By the mean value theorem, Therefore it suffices to computeẑ k such that where is the desired error in the eigenvalues.
The following Theorem shows that taking Toeplitz-plus-finite rank approximations of a Toeplitzplus-compact Jacobi operator is sufficient for computing the spectrum with error control with respect to the Hausdorff metric. Proof. Let > 0. By the oracle assumed in the statement of the theorem, compute m such that Now compute the point spectrum of the Toeplitz-plus-finite-rank approximation J [m] such that d H (Σ, σ(J [m] )) < /2, where Σ denotes the computed set. Then, using Theorem 5.14, we have Here we used the fact that for a self-adjoint tridiagonal operator A, This completes the proof.
An immediate question following Lemma 6.6 and Theorem 6.7 is why we have opted to use a Newton iteration in the complex plane instead of a purely real algorithm. We do this purely because Lemma 6.6 is an interesting point to make in and of itself with regards to the Solvability Complexity Index of polynomial rootfinding with error control. The key point is that while there exist algorithms to compute all of the roots of a polynomial (without multiplicity) in a single limit (i.e. with SCI equal to 1), one does not necessarily know when to stop the algorithm to achieve a desired error. Lemma 6.6 provides a basic condition on the polynomial to allow such control, which applies to this specific spectral problem.

Conclusions
In this paper we have proven new results about the relationship between the connection coefficients matrix between two different families of orthonormal polynomials, and the spectral theory of their associated Jacobi operators. We specialised the discussion to finite-rank perturbations of the free Jacobi operator and demonstrated explicit formulas for the principal resolvent and the spectral measure in terms of entries of the connection coefficients matrix. We showed that the results extend to trace class perturbations. Finally, we discussed computability aspects of the spectra of Toeplitz-plus-compact Jacobi operators. We showed that the spectrum of a Toeplitz-plus-compact Jacobi operator can be computed with error control, as long as the tail of the coefficients can be suitably estimated.
There are some immediate questions. Regarding regularity properties of the Radon-Nikodym derivative dν dµ between the spectral measures ν and µ of Jacobi operators D and J respectively given in Propositions 3.7 and 3.11 and Corollary 3.12: can weaker regularity of dν dµ be related to weak properties of C = C J→D ? For example, the present authors conjecture that the Kullbeck-Leibler divergence, is finite if and only if the function of operators, C T C log(C T C) is well-defined as an operator mapping F → F . The reasoning comes from Lemma 3.10. Making such statements more precise for the case where D = Γ or D = ∆ (see equation (4.1)) could give greater insight into Szego and quasi-Szego asymptotics (respectively) for orthogonal polynomials [18,10,29].
Regarding computability: is there a theorem that covers the ground between Theorem 6.7 (for Toeplitz-plus-finite-rank Jacobi operators) and Theorem 6.9 (for Toeplitz-plus-compact Jacobi operators)? What can be said about the convergence of the continuous part of the spectral measure of a Toeplitz-plus-finite-rank truncations of a Toeplitz-plus-trace-class Jacob operator? Proposition 5.2 implies that this convergence is at least weak in the probabilists' sense.
The computability theorems in Section 6 all assume real arithmetic. What can be said about floating point arithmetic? Under what situations can the computation fail to give an unambiguously accurate solution? Answering this question is related to the mathematical problem of stability of the spectral measure under small perturbations of the Jacobi operator.
This paper also opens some broader avenues for future research. The connection coefficient matrix can be defined for any two Jacobi operators J and D. It is natural to explore what structure C J→D has when D is a different reference operator to ∆, and J is a finite rank, trace class, or compact perturbation of D. For example, do perturbations of the Jacobi operator with periodic entries [8,22] have structured connection coefficient matrices? Beyond periodic Jacobi operators, it would be interesting from the viewpoint of ergodic theory if we could facilitate the study and computation of almost-periodic Jacobi operators, such as the discrete almost-Mathieu operator [13]. Perturbations of the Jacobi operators for Laguerre polynomials and the Hermite polynomials could also be of interest, but challenges associated with the unboundedness of these operators could hamper progress [32]. Discrete Schrödinger operators with non-decaying potentials will also be of interest in this direction.
Spectra of banded self-adjoint operators may be accessible with these types of techniques too. Either using connection coefficient matrices between matrix orthogonal polynomials [9], or developing tridiagonalisation techniques are possible approaches, but the authors also consider this nothing more than conjecture at present. The multiplicity of the spectrum for operators with bandwidth greater than 1 appears to be a major challenge here.
Lower Hessenberg operators define polynomials orthogonal with respect to Sobolev inner products [20, pp. 40-43]. Therefore, we have two families of (Sobolev) orthogonal polynomials with which we may define connection coefficient matrices, as discussed in [23, p. 77]. Whether the connection coefficient matrices (which are still upper triangular) have structure which can be exploited for studying and computing the spectra of lower Hessenberg operators is yet to be studied.
Besides spectra of discrete operators defined on 2 , we conjecture that the results of this paper will also be applicable to continuous Schrödinger operators on L 2 (R), which are of the form L V [φ](x) = −φ (x) + V (x)φ(x) for a potential function V : R → R. The reference operator is the negative Laplacian L 0 (which is the "free" Schrödinger operator). In this scenario, whereas the entries of a discrete connection coefficient matrix satisfy a discrete second order recurrence relation on N 2 0 (see Lemma 3.2), the continuous analogue of the connection coefficient operator C L V →L0 is an integral operator whose (distributional) kernel satisfies a second order PDE on R 2 .

A Numerical results and the SpectralMeasures package
In this appendix we demonstrate some of the features of the SpectralMeasures.jl Julia package [49] that the authors have written to implement the ideas in the paper. This is part of the JuliaApproximation project, and builds on the package ApproxFun.jl [33]. ApproxFun is an extensive piece of software influenced by the Chebfun package [15] in Matlab, which can represent functions and operators [34,33]. The code is subject to frequent changes and updates.
Given a Jacobi operator J which is a finite-rank perturbation of the free Jacobi operator ∆ with entries given by α k = 0, β k−1 = 1 2 for all k ≥ n, SpectralMeasures.jl enables calculation of the following: (i) The connection coefficients matrix C J→∆ : This is computed using the recurrences in equation (3.3)-(3.3). By Theorem 4.8, we only need to compute n(n + 1) entries of C to have complete knowledge of all entries. In SpectralMeasures.jl, there is a type of operator called PertToeplitz, which allows such an operator to be stored and manipulated as if it were the full infinite-dimensional operator.
(ii) The spectral measure µ(s): By Theorem 4.14, this measure has the form where p C is the polynomial given by the computable formula p C (s) = 2n−1 k=0 C T e k , C T e 0 U k (s) and r ≤ n. By Theorem 4.21, the numbers λ k are found by finding the distinct real roots z k of c (the Toeplitz symbol of the Toeplitz part of C, which here is a polynomial of degree 2n − 1) in the interval (−1, 1). Also by Theorem 4.21, the weights w k can be computed using the formula (iii) The principal resolvent G(λ): For any λ ∈ C\σ(J), by Theorem 4.12, this function can be defined by the formula where p C is as above and p µ C (λ) = 2n−1 k=0 (C µ ) T e k , C T e 0 U k (λ). (iv) The mapped principal resolvent G(λ(z)): which is the principal resolvent mapped to z in the unit disc by the Joukowski map λ : z → 1 2 (z + z −1 ). This is computed using the simple formula from Theorem 4.20, where c and c µ are the Toeplitz symbols of the Toeplitz parts of C and C µ respectively (these are polynomials of degree 2n − 1 and 2n − 2 respectively).
Consider a concrete example of a Toeplitz-plus-finite-rank Jacobi operator, The connection coefficients operator C = C J→∆ is As was noted above, we only need to explicitly compute 3 · 4 = 12 entries and the rest are defined to be equal to the entry above and left one space. Because the perturbation is rational, the connection coefficients operator can be calculated exactly using the Rational type.
In Figure 3 we present plots of the spectral measure, the principal resolvent and the mapped principal resolvent. This format of figure is repeated for other Jacobi operators in the appendix.
The plot on left in Figure 3 is the spectral measure. There is a continuous part supported in the interval [−1, 1] and Dirac deltas are represented by vertical lines whose heights are precisely their weights. As noted in Theorem 6.7, it is possible to compute the eigenvalues of J with guaranteed error control. Computations with guaranteed error control are made quite straightforward and flexible using the ValidatedNumerics.jl package [6], in which computations are conducted using interval arithmetic, and the desired solution is rigorously guaranteed to lie within the interval the algorithm gives the user [42]. Using this open source Julia package, we can compute the two eigenvalues for this operator to be −1.1734766767874558 and 1.5795946563898884 with a guaranteed maximum error of 8.9 × 10 −16 . This can be replicated using the command validated spectrum([.75;-.25;.5], [1;.75]) in Spec-tralMeasures.
The coloured plots in the middle and the right of Figure 3 are Wegert plots (sometimes called phase portraits) [50,30]. For a function f : C → C, a Wegert plot assigns a colour to every point z ∈ C by the argument of f (z). Specifically, if f (z) = re iθ , then θ = 0 corresponds to the colour red, then cycles upwards through yellow, green, blue, purple as θ increases until at θ = 2π it returns to red. This makes zeros and poles very easy to see, because around them the argument cycles through all the colours the same number of times as the degree of the root or pole. In these particular Wegert plots, we also plot lines of constant modulus as shadowed steps.
The middle plot in Figure 3 is the principal resolvent G(λ), which always has a branch cut along the interval [−1, 1] and roots and poles along the real line. The poles correspond to Dirac delta measures in the spectral measure.
The third plot is the principal resolvent of J mapped to the unit disc by the Joukowski map. Poles and roots of this resolvent in the unit disc correspond to those of the middle plot outside [−1, 1]. The middle plot is a Wegert plot (explained in the text above) depicting the principal resolvent of the same Jacobi operator, and the right plot is the principal resolvent under the Joukowski mapping. The two Dirac deltas in the spectral measure correspond to two poles along the real line for the middle plot and two poles inside the unit disc for the right plot.
In Figure 4 we have plotted the spectral measure and principal resolvent of the Basic Perturbation 1 (see Examples 4.2,4.16,4.22) in which the top-left entry of the operator has been set to α/2 for values α = 0, 0.15, 0.35, 0.5, 0.75, 1. For the first four cases, the perturbation from the free Jacobi operator is small, and so the spectrum is purely continuous, which corresponds to no poles in the principal resolvent, and in the mapped resolvent there are only poles outside the unit disc. For the cases α = 0.75 and 1, the Jacobi operator has a single isolated point of discrete spectrum. This is manifested as a Dirac delta in the spectral measure and a single pole in the principal resolvent.
In Figure 5 we have plotted the spectral measure and principal resolvent of Basic Perturbation 2 (see Examples 4.3,4.17,4.23) in which the (0, 1) and (1, 0) entries have been set to β/2 for values β = 0.5, 0.707, 0.85, 1.0, 1.2, 1.5. The effect is similar to that observed in Figure 4. For small perturbations the spectrum remains purely continuous, but for larger perturbations here two discrete eigenvalues emerge corresponding to Dirac deltas in the spectral measure and poles in the principal resolvent.
In Figure 6 we have plotted a sequence of approximations to the Jacobi operator for the Legendre polynomials, which has entries α k = 0 for k = 0, 1, 2, . . . and β k−1 = 1 √ 4k 2 − 1 , for k = 1, 2, 3, . . . . This is a Toeplitz-plus-trace-class Jacobi operator because β k = 1 2 + O(k −2 ), and by taking Toeplitzplus-finite-rank approximations J [n] as in equation (5.1), we can compute approximations to the spectral measure and principal resolvent. Figure 6 depicts the spectral measure and the principal resolvent for the Toeplitz-plus-finite-rank Jacobi operators J [n] for the values n = 1, 2, 3, 10, 30, 100. For the spectral measures, we see that there is no discrete part for any n, and as n increases, the spectral measure converges to the scaled Lebesgue measure 1 2 ds restricted to [−1, 1]. The convergence is at least weak by Proposition 5.2, but it would be interesting (as mentioned in the conclusions) to determine if there is a stronger form of convergence at play due to the perturbation of ∆ lying in the space of trace class operators. There is a Gibbs-like effect occurring at the boundaries, which suggests that this convergence occur pointwise everywhere up to the boundary of [−1, 1]. For the principal resolvents, the middle plots do not vary greatly, as the difference between the functions in the complex plane is not major. However, in right plots, there are hidden pole-root pairs in the resolvent lying outside the unit disc which coalesce around the unit disc and form a barrier. The meaning of this barrier is unknown to the authors. Figures 7 and 8 demonstrate similar features to Figure 6, except that the polynomials sequences they correspond to are the ultraspherical polynomials with parameter γ = 0.6 (so that the spectral measure is proportional to (1 − s 2 ) 1.1 ) and the Jacobi polynomials with parameters (α, β) = (0.4, 1.9) (so that the spectral measure is proportional to (1 − s) 0.4 (1 + s) 1.9 ). Similar barriers of pole-root pairs outside the unit disc occur for these examples as well. Figure 9 presents a Toeplitz-plus-trace-class Jacobi operator with pseudo-randomly generated entries. With a random vector r containing entries uniformly distributed in the interval [0, 1), the following entries were used α k = 3 2r k − 1 (k + 1) 2 , β k = 1 2 .
Then the Toeplitz-plus-finite-rank approximations J [n] (see equation (5.1)) of this operator were taken for values n = 1, 2, 3, 10, 50, 100. Since the off-diagonal elements are constant, this is a scaled and shifted version of a discrete Schrödinger operator with a random, decaying potential.    (s), principal resolvents G(λ) and disc resolvents G(λ(z)) (analyticially continued outside the disc) respectively for J α , the Basic perturbation 1 example, with α = 0, 0.15, 0.35, 0.5, 0.75, 1. We see that a Dirac mass in the measure corresponds to a pole of the disc resolvent inside the unit disc, which corresponds to a pole in the principal resolvent outside the interval [−1, 1].    Figure 5: The left hand, centre and right hand figures show the spectral measures µ(s), principal resolvents G(λ) and disc resolvents G(λ(z)) (analyticially continued outside the disc) respectively for J β , the Basic perturbation 2 example, with β = 0.5, 0.707, 0.85, 1, 1.2, 1.5. Again, we see that a Dirac mass in the measure corresponds to a pole of the disc resolvent inside the unit disc, which corresponds to a pole in the principal resolvent outside the interval [−1, 1]. Legendre approximation, n = 100 Figure 6: These plots are of approximations to the spectral measure and principal resolvents of the Legendre polynomials, which has a Toeplitz-plus-trace-class Jacobi operator. The Jacobi operator can be found in Subsection 5.1. As the parameter n of the approximation increases, a barrier around the unit circle forms. Also notice that a Gibbs phenomenon forms at the end points, showing that there are limitations to how good these approximations can be to the final measure. Ultraspherical(0.6), n = 100 Figure 7: These plots are of approximations to the spectral measure and principal resolvents of the Ultraspherical polynomials with parameter γ = 0.6, which has a Toeplitz-plus-trace-class Jacobi operator. The Jacobi operator can be found in Subsection 5.1. As the parameter n of the approximation increases, a barrier around the unit circle forms. Jacobi(0.4,1.9), n = 100 Figure 8: These plots are of approximations to the spectral measure and principal resolvents of the Jacobi polynomials with parameter α, β = 0.4, 1.9, which has a Toeplitz-plus-trace-class Jacobi operator. The Jacobi operator can be found in Subsection 5.1. As the parameter n of the approximation increases, a barrier around the unit circle forms. Random, n = 100 Figure 9: These plots are of approximations to the spectral measure and principal resolvents of a trace-class pseudo-random diagonal perturbation of the free Jacobi operator.