De Branges canonical systems with finite logarithmic integral
Roman Bessonov, Sergey Denisov

TL;DR
This paper characterizes certain canonical Hamiltonian systems with spectral measures having finite logarithmic integrals, extending classical theorems and connecting spectral theory with orthogonal polynomials and Gaussian process prediction.
Contribution
It provides a spectral characterization of Hamiltonian systems with measures having convergent logarithmic integrals, extending classical spectral and polynomial orthogonality results.
Findings
Describes canonical Hamiltonian systems with finite logarithmic spectral measures
Establishes a spectral analogue of Szego's theorem for these systems
Extends Krein-Wiener completeness theorem in spectral theory
Abstract
Krein-de Branges spectral theory establishes a correspondence between the class of differential operators called canonical Hamiltonian systems and measures on the real line with finite Poisson integral. We further develop this area by giving a description of canonical Hamiltonian systems whose spectral measures have logarithmic integral converging over the real line. This result can be viewed as a spectral version of the classical Szego theorem in the theory of polynomials orthogonal on the unit circle. It extends Krein-Wiener completeness theorem, a key fact in the prediction of stationary Gaussian processes.
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.
De Branges canonical systems with finite
logarithmic integral
Roman V. Bessonov, Sergey A. Denisov
Roman Bessonov: [email protected]
St. Petersburg State University
Universitetskaya nab. 7-9, 199034 St. Petersburg, RUSSIA
St. Petersburg Department of Steklov Mathematical Institute
Russian Academy of Sciences
Fontanka 27, 191023 St.Petersburg, RUSSIA
Sergey Denisov: [email protected]
University of Wisconsin–Madison
Department of Mathematics
480 Lincoln Dr., Madison, WI, 53706, USA
Keldysh Institute of Applied Mathematics
Russian Academy of Sciences
Miusskaya pl. 4, 125047 Moscow, RUSSIA
Abstract.
Krein – de Branges spectral theory establishes a correspondence between the class of differential operators called canonical Hamiltonian systems and measures on the real line with finite Poisson integral. We further develop this area by giving a description of canonical Hamiltonian systems whose spectral measures have logarithmic integral converging over the real line. This result can be viewed as a spectral version of the classical Szegő theorem in the theory of polynomials orthogonal on the unit circle. It extends Krein–Wiener completeness theorem, a key fact in the prediction of stationary Gaussian processes.
Key words and phrases:
Szegő class, Canonical Hamiltonian system, Inverse problem, Entropy.
2010 Mathematics Subject Classification:
42C05, 34L40, 34A55
The work of RB in Sections 5 and 7 is supported by grant RScF 19-71-30002 of the Russian Science Foundation. The work of SD done in Sections 9 and 10 is supported by grants RScF-14-21-00025 and RScF-19-71-30004 of the Russian Science Foundation. His research conducted in the rest of the paper is supported by the grants NSF-DMS-1464479, NSF DMS-1764245, and Van Vleck Professorship Research Award. SD gratefully acknowledges the hospitality of IHES where part of this work was done.
Contents
- 1 Introduction
- 2 Preliminaries on canonical Hamiltonian systems
- 3 Main steps in the proof of Theorem 1.2
- 4 Hamiltonians in class , matrix-valued -condition, and some examples
- 5 Reduction to Hamiltonian with unit determinant. Proof of Theorem 3.1
- 6 Szegő condition implies factorization. Proof of Theorem 3.2
- 7 Factorization implies Szegő condition. Proof of Theorem 3.3
- 8 Factorization controls mean oscillation. Proof of Theorem 3.4
- 9 The condition on mean oscillation implies factorization. Proof of Theorem 3.5
- 10 Appendix
1. Introduction
In this paper, we look at the spectral theory of de Branges’ canonical system, which is defined by the system of differential equations of the form
[TABLE]
The matrix-function on is called the Hamiltonian of canonical system (1.1). We will always assume that satisfies the following conditions:
and for Lebesgue almost every , 2.
the entries of are real measurable functions absolutely integrable on compact subsets of .
In 1960’s, L. de Branges developed his theory of Hilbert spaces of entire functions (see [13] and [38, 37] for recent exposition). One result of this monumental work is the theorem that establishes a bijection between Hamiltonians in (1.1) and nonconstant analytic functions in with nonnegative imaginary part. Every such function is generated by a nonnegative measure on the real line. In this paper, we make a further step in de Branges’ theory by identifying Hamiltonians that correspond to measures in the Szegő class, i.e., the measures whose logarithmic integral converges over .
To formulate the main results of the paper, we need some definitions. A Hamiltonian on is called singular if
[TABLE]
Two Hamiltonians , on are called equivalent if there exists an increasing absolutely continuous function defined on such that , , and for Lebesgue almost every . Clearly, rescales the variable . We say that Hamiltonian is trivial if there is a non-negative matrix with , such that is equivalent to , i.e., for a.e. , where is an increasing absolutely continuous function on , which satisfies and . If Hamiltonian is not trivial, it is called nontrivial.
Recall that function belongs to the Herglotz-Nevanlinna class if it is analytic in and for . It is well-known [21], that if and only if it admits the following representation
[TABLE]
where , , and is a Radon measure on , which satisfies
[TABLE]
We call measures on satisfying (1.3) Poisson-finite. The class appears naturally in the theory of canonical Hamiltonian systems. Let be a nontrivial and singular Hamiltonian. Given condition on , there exists unique matrix-valued function that solves (1.1). Denote by , its entries so that
[TABLE]
Fix a parameter . The Titchmarsh-Weyl function of is defined by
[TABLE]
where the fraction for non-zero numbers , is interpreted as . In Weyl’s theory for canonical systems (see [22] or Section 8 in [38]), it is shown that the expression under the limit in (1.5) is well-defined for large (i.e., the denominator is non-zero) for every given singular nontrivial Hamiltonian . Moreover, the limit exists, does not depend on , is analytic in and has non-negative imaginary part, i.e., . In particular, admits representation (1.2). The measure in (1.2) is called the spectral measure for the Hamiltonian . It is easy to check that equivalent Hamiltonians have equal Titchmarsh-Weyl functions, see [43].
Now we can formulate the result of de Branges that establishes a bijection between Hamiltonians and Herglotz-Nevanlinna functions. See [13], [38], [42] and also [24] for its proofs.
Theorem 1.1**.**
(de Branges)* For every nonconstant function , there exists a singular nontrivial Hamiltonian on such that is the Titchmarsh-Weyl function (1.5) for . Moreover, any two singular nontrivial Hamiltonians , on generated by are equivalent.*
For trivial Hamiltonians, function is a real constant. Indeed, in that case, one can solve (1.1) explicitly and this calculation shows that . For example, gives
[TABLE]
so . Similarly, if , then and we let .
Given a Poisson-finite measure on , we will denote by the density of with respect to the Lebesgue measure on , and by the singular part of , so that . In this paper, our aim is to characterize singular nontrivial Hamiltonians whose spectral measures have finite logarithmic integral, i.e., the integral
[TABLE]
converges. The trivial bound shows that logarithmic integral of a Poisson-finite measure can diverge only to . It will be convenient to call the set of all measures with finite logarithmic integral the Szegő class , i.e.,
[TABLE]
If and measure in (1.2) is in Szegő class, we can define
[TABLE]
One can use and Jensen’s inequality to show that . Notice that if and only if is a constant with positive imaginary part.
Let us introduce the class of Hamiltonians that characterizes measures in Szegő class. If is such that , define
[TABLE]
Since the entries of are locally integrable functions, the function is also locally integrable on and make sense. It is not difficult to check (see Lemma 10.8 in Appendix) that
[TABLE]
This shows that the series in (1.8) contains only non-negative terms and hence its sum is well-defined but could be , in general. In Lemma 4.1, we explain that can be rewritten in the form reminiscent of matrix Muckenhoupt condition. Roughly speaking, measures how fast the entries of oscillate. In fact, we have if and only if the Hamiltonian is equivalent to a constant positive matrix, see Lemma 10.8. Notice that if the Hamiltonian is trivial then its determinant is zero and is undefined. Define the class of Hamiltonians by
[TABLE]
Here is the main result of the paper.
Theorem 1.2**.**
The spectral measure of a singular nontrivial Hamiltonian on belongs to the Szegő class if and only if . Moreover, we have
[TABLE]
for some absolute positive constants , .
We emphasize that is essentially sharp up to numerical values of and . Indeed, for such that , (1.9) gives . Moreover, in Section 9 we present two examples for both of which . In the first example, we have and , where is arbitrarily large parameter. This shows that the exponent in the right hand side of (1.9) can not be dropped. In the second example, we have and , where is again arbitrarily large parameter. Thus, the left bound in (1.9) can not be improved.
The problem of controlling the entropy of the spectral measure for various differential operators has a long history and dates back at least to M. Krein’s work [30] published in 1955. Quite recently, a large number of results that relate coefficients in differential or difference operators and spectral data were obtained (see, e.g., [4], [9], [14],[16], [26], [27], [32], [35], [40], and a book [39]). Many of them can be considered as analogs of Szegő theorem from the theory of polynomials orthogonal on the unit circle. Our main theorem provides, perhaps, the most natural and far-reaching extension of this classical result. The following less general and a bit weaker version of Theorem 1.2 has been proved in [12].
Theorem 1.3**.**
(Bessonov-Denisov, [12])* An even measure belongs to the Szegő class if and only if some (and then every) Hamiltonian generated by is such that and*
[TABLE]
where are given by (1.8). Moreover, we have and for an absolute constant .
A characterization of Krein strings for which the spectral measure has finite logarithmic integral has been given in [12] as well. That was an immediate corollary of Theorem 1.3. Other spectral theoretic applications of Theorems 1.2 and 1.3 can be found in [10],[11],[19],[20],[28].
Some proofs in [12] relied on the fact that diagonal matrices (arising from diagonal Hamiltonians) commute, which forces us to find a different argument for the proof of Theorem 1.2 in full generality. We also want to emphasize here that the method used in our proof does not involve any “sum rules”, which often times is the basis for other proofs found in the literature. We outline the main steps of the proof in Section 3.
The Szegő class proved to be important in mathematical physics, in particular, in the scattering theory of wave propagation. For example, in [15], strong wave operators for a one-dimensional Dirac system with a -potential were expressed in terms of the Szegő function of the spectral measure. The main result of [10] shows that regularized version of strong wave operator for a one-dimensional Dirac system exists and is complete under the single assumption that the spectral measure belongs to the Szegő class . Using Theorem 1.2, we describe such Dirac systems below.
Corollary 1.4**.**
Let be the spectral measure of the Dirac operator on , defined by
[TABLE]
with a real-valued locally summable potential which satisfies condition . Then, if and only if , where solves , , .
One version of classical Krein-Wiener completeness theorem says that the future subspace of a Gaussian stationary process is not determined by its past subspace if and only if the spectral measure of the process belongs to the Szegő class, see, e.g., [23]. Very interesting direction for further research is to find probabilistic applications of Theorem 1.2. We mention two papers [2], [18] related to the subject.
A few months after the current manuscript was posted on arXiv, the authors received a note from Peter Yuditskii in which the logarithmic integral of a quantity closely connected to spectral measure was expressed via the integral of elements of Hamiltonian, written in a special form. It is of interest to relate this “sum rule” to estimates obtained in this work.
Here is an outline of the paper. In the second section, we give more detail about canonical systems. In the third section, we explain the main steps of the proof of the main result, Theorem 1.2. Section 4 contains some examples relevant to Theorem 1.2. It is followed by sections which contain different parts of the proof. In the Appendix, we collect auxiliary results used in the main text.
1.1. Notation
- •
denotes the set of real matrices with unit determinant.
- •
If is matrix, stands for operator norm in .
- •
For , let us denote by the set of matrix-valued functions on such that
[TABLE]
Let denote the set of sums equipped with the norm
[TABLE]
Similar notation will be used for scalar functions.
- •
The symbol denotes the absolute constant which can change the value from formula to formula. If we write, e.g., , this defines a positive function of parameter .
- •
For two non-negative functions and , we write if there is an absolute constant such that for all values of the arguments of and . We define similarly and say that if and simultaneously. If , we will write .
- •
Given any interval and , we define
[TABLE]
- •
Entire function is called Hermite-Biehler function if it has no zeroes in and
[TABLE]
with
[TABLE]
- •
If is a set, denotes the characteristic function of .
- •
We sometimes use symbol instead of . The reader should be aware that these two quantities are identical by definition. Notation will be explained in the next section.
- •
- •
If is self-adjoin matrix, we denote its smallest and largest eigenvalues by and , respectively.
- •
For , we define
[TABLE]
so , , and .
2. Preliminaries on canonical Hamiltonian systems
In this section, we collect some definitions and known results that will be used later in the text. In fact, we almost literally repeat the content of Section 1 in [12] and Section 2 in [10]. See monographs [13], [37], [38] for the classical theory of de Branges systems.
2.1. Two results on canonical systems
Later in the text, we will need two classical results from the spectral theory of canonical Hamiltonian systems. Given a Hamiltonian on , define the function
[TABLE]
Since for all , the function is integrable on compact subsets of . In particular, is correctly defined and absolutely continuous function on . In the case when , one can define the function
[TABLE]
Observe that for in (1.8). For , denote by the linear space of functions with smooth Fourier transform supported on . The following theorem is a consequence of results by M. Riesz, S. Mergelian, and M. Krein, see Proposition 2.5 in [10].
Theorem 2.1**.**
Let be a singular nontrivial Hamiltonian on , and let be its spectral measure. If is not dense in for some , then for some .
Next result is usually referred to as the Krein-Wiener completeness theorem. See Section 4.2 in [17] or Theorem A.6 in [16] for the proof.
Theorem 2.2**.**
Let be a Poisson-finite measure on . Then if and only if is not dense in .
Remark. Our main result, Theorem 1.2, complements Krein-Wiener’s theorem by giving yet another criterion for completeness.
2.2. Bernstein-Szegő approximation, entropy function of a Hamiltonian, invariance
Let be a singular nontrivial Hamiltonian on . For every , define to be the Hamiltonian defined on . Let , , , denote the Titchmarsh-Weyl function of , its spectral measure, and the coefficients in the Herglotz representation (1.2) for . Define
[TABLE]
where is the decomposition of into the absolutely continuous and singular parts. In the case when for some , we set . The entropy function of is introduced as follows
[TABLE]
Notice that , where was defined in (1.7). Since , Jensen’s inequality implies . Next, consider the Hamiltonian
[TABLE]
where , , . The Hamiltonian coincides with on and is constant on . We call the Bernstein-Szegő approximation to . Some properties of the functions , , are collected in the following two lemmas.
Lemma 2.3**.**
Let be a singular nontrivial Hamiltonian on and let be the spectral measure of . Assume that . Then, for every the measure belongs to and
,
, .
If, moreover, a.e. on , then , and are absolutely continuous on and
,
,
,
almost everywhere on .
Proof. For items and , see Lemma 2.3 in [10] and its proof therein (Appendix I in [10]). Identities - are equivalent to formulas - in [10] after elementary algebraic manipulations are performed. ∎
Remark. In the case of diagonal , identities - can be found in Lemma 2.5 and Lemma 2.7 in [12].
Recall that SL is related to fractional linear transformations that leave invariant, i.e.,
[TABLE]
Given any , we define conjugation of by as follows:
[TABLE]
The spectral measure of will be denoted by . Next lemma proves that both and are invariant under conjugation and under linear fractional transform, respectively.
Lemma 2.4**.**
Let be a singular nontrivial Hamiltonian on , and let be its spectral measure. Then,
- (a)
* if and only if *
- (b)
* if and only if .*
Moreover, and whenever these quantities are finite.
Proof. Since for a.e. and is -independent, we see that if and only if , and, moreover, . This proves .
To show , we first compute Titchmarsh-Weyl function for . Suppose and are the solutions of (1.1) for the Hamiltonians and , respectively. We are claiming that
[TABLE]
Indeed, by definition of we have , . This implies
[TABLE]
To prove (2.4), we only need to notice that by Lemma 10.1. For , we have
[TABLE]
Taking in (1.5) for , we get
[TABLE]
It remains to note that , hence
[TABLE]
where we used Lemma 10.9 in Appendix. ∎
The Hamiltonian dual to is defined by conjugating with , i.e.,
[TABLE]
Notice that . Lemma 2.4 yields the following corollary (see also Lemma 3 in [10]).
Corollary 2.5**.**
Let be a singular nontrivial Hamiltonian, denote the spectral measure of , and denote the Titchmarsh-Weyl function of . Then, if and only if . Moreover, we have and .
Proof. The first part of the statement follows from Lemma 2.4 by taking . Formula (2.2) shows that . ∎
Remark. In (1.7), the definition of , we evaluate at and the Poisson kernel inside the integral is evaluated at the same point. Changing this reference point results in the whole family of entropies indexed by parameter . Clearly, if entropy at one point is finite, it is finite at any other point. In this paper, we do not study how our main result can be modified (i.e., how constants in two-sided estimates in Theorem 1.2 depend on ) but we believe this is a promising direction.
3. Main steps in the proof of Theorem 1.2
In this short section, we explain the structure of the proof of Theorem 1.2. The following special factorization of Hamiltonian lies at the core of our approach.
Definition. Suppose are three non-negative parameters. Let be a Hamiltonian which satisfies for a.e. . We will say that admits – factorization if for some matrix-valued functions , with real entries such that
[TABLE]
Remark. This –factorization is not unique, in general. Since and , we get . Note that the matrix-valued function in this definition necessarily has real entries. Equation gives
[TABLE]
For real matrices, the condition is equivalent to being symmetric. Therefore, being symmetric and already imply for all . The factor can be regarded as “slow” and factor can be regarded as the “fast” one. Indeed, elements of are absolutely continuous and elements of are only locally integrable. On the other hand, can grow infinitely when although is “close to ” at infinity as follows from and .
Remark. In the definition of Hamiltonians that admit factorization, we didn’t specify . This was done intentionally. In fact, given and , we can take . The parameters in the factorization of can be chosen the same as in that of and , by Lemma 2.4 (and we will later prove that these quantities are in fact finite).
Definition. The class (shorthand for “finally constant”) is the set of singular nontrivial Hamiltonians on such that on for some and a constant positive matrix . Parameter and matrix might depend on .
Theorem 1.2 follows from five theorems formulated below. Their proofs are given in Sections 5-9.
Theorem 3.1**.**
Assume that
[TABLE]
holds for every Hamiltonian such that almost everywhere on . Then, the conclusions of Theorem 1.2 follow, i.e.,
The spectral measure of a singular nontrivial Hamiltonian belongs to if and only if .
Moreover, (3.2) holds for all with the same constants , and .
Theorem 3.2**.**
Let be a singular nontrivial Hamiltonian which satisfies almost everywhere on , and let be its spectral measure. If , then admits –factorization with and .
Theorem 3.3**.**
Let be a singular nontrivial Hamiltonian on and let be its spectral measure. If admits – factorization, then . Moreover, .
Theorem 3.4**.**
Suppose that is a Hamiltonian on allowing –factorization. Then and we have for an absolute constant .
Theorem 3.5**.**
Suppose that and for almost all . Then admits -factorization. Moreover, we have , , and .
Assuming Theorems 3.1–3.5 are proved, we can easily finish the proof of the main result.
Proof of Theorem 1.2. By Theorem 3.1, it suffices to show that
[TABLE]
for every Hamiltonian with unit determinant, which belongs to class . Take such . Combining Theorem 3.3 and Theorem 3.5, we see that admits -factorization. Moreover, we get the estimates
[TABLE]
so . From Theorem 3.4 and Theorem 3.2, we get
[TABLE]
so and we have (3.3). ∎
Proof of Corollary 1.4. It is known that the spectral measure of Dirac system (1.11) coincides with the spectral measure of the canonical Hamiltonian system generated by the Hamiltonian , see details in [10]. Thus, the application of Theorem 1.2 gives the corollary. ∎
4. Hamiltonians in class , matrix-valued -condition, and some examples
The diagonal Hamiltonians in class have been thoroughly studied in [12]. If we assume that , i.e., if is diagonal and for a.e. , then condition reads as follows:
[TABLE]
In [12], the class of functions that satisfy this condition was denoted by in analogy to the standard Muckenhoupt condition on the weights. We recall that, given non-negative matrix-valued function defined on , the matrix Muckenhoupt characteristics of is defined by (see, e.g., [41])
[TABLE]
where the supremum is taken over all intervals in . To see the connection with our condition (1.8), we need the following lemma.
Lemma 4.1**.**
Suppose is nonnegative matrix-valued function defined on and satisfies for a.e. . Then,
[TABLE]
In particular, for every that satisfies , we have
[TABLE]
Proof. By a change of variables, we can assume that . Let . Since and , we have
[TABLE]
Notice that
[TABLE]
as can be checked directly. Then, since for every matrix , we can write
[TABLE]
because , being the unitary matrix, preserves the norm. Notice that for all positive matrices , we have an identity
[TABLE]
which follows from the formula
[TABLE]
and an observation that the last self-adjoint matrix has eigenvalues . ∎
We will call the class of weights satisfying (4.1) the matrix-valued class. The following lemma asserts that the diagonal elements of mappings in the matrix-valued class belong to the scalar class .
Lemma 4.2**.**
Let belong to and a.e. on . Then, we have
[TABLE]
Similar bound holds for .
Proof. For every interval , we have by Cauchy-Schwarz inequality
[TABLE]
Recall that so . Then, we can rewrite the last bound as
[TABLE]
Taking , subtracting from both sides and summing in finishes the proof. ∎
In the case of diagonal Hamiltonians, the proofs of Theorems 3.4, 3.5 are much easier because they can be reduced to considerations of scalar functions. For instance, the following lemma solves the problem of existence of – factorization for diagonal Hamiltonians.
Lemma 4.3**.**
A function on belongs to if and only if there exist functions , on such that
* almost every where on , ,*
* is real-valued, ,*
, .
While this lemma could be proved by means of elementary function theory, its proof is rather complicated. For completeness, we give a short proof based on Theorems 3.4, 3.5.
Proof. Suppose that and consider the Hamiltonian . We have . An inspection of the proof of Theorem 3.5 shows that admits – factorization of the form with parameters , such that
[TABLE]
where satisfies and satisfies . Solving equation , , we get
[TABLE]
This gives representation for . Conversely, if , , satisfy assertions -, then the Hamiltonian admits – factorization for , as above. By Theorem 3.4, we have . Then Lemma 4.2 implies . ∎
We now provide some examples of Hamiltonians in class . The first two of them show that Theorem 1.2 is essentially sharp.
Example 1. Take , where is a large integer parameter. Then, , and
[TABLE]
The Titchmarsh-Weyl function can be computed using the formula (2.13) from [12]:
[TABLE]
in which , because the Titchmarsh-Weyl function of Hamiltonian is equal to constant . Relations (1.6) yield Thus,
[TABLE]
For , we can write
[TABLE]
So, .
Example 2. Consider Dirac system
[TABLE]
with potential , where is a large integer and is a small parameter. They will be chosen such that . Define the Hamiltonian on . Then, a straightforward calculation gives
[TABLE]
We have , and
[TABLE]
after applying Taylor expansion in small . To estimate entropy, we notice that allows factorization in which and . Moreover, is already taken in truncated form similar to (7.19). The spectral measure of is absolutely continuous and Lemma 7.5 gives where solve Krein system (7.6),(7.7):
[TABLE]
with . We consider and . Finding eigenvalues and eigenvectors , of matrix , we take into account initial data to find
[TABLE]
for . We have
[TABLE]
Consider . Then,
[TABLE]
Since , this gives us
[TABLE]
for . Thus, recalling notation (1.12), we get the following estimate
[TABLE]
for the spectral measure of . We notice that and this convergence is uniform in for every fixed segment . Thus, . The trivial bound yields
[TABLE]
and thus
[TABLE]
for . This gives . On the other hand, (1.9) says that so the left-hand side bound in (1.9) is sharp up to a constant.
Example 3: Hamiltonians generated by . Consider equation
[TABLE]
from Corollary 1.4 in the case when . Then, we can find and explicitly. These calculations give
[TABLE]
Then, the Theorem 3.4 implies provided that , because allows –factorization in which with and .
In the case when takes the form , the equation (4.3) can also be solved explicitly. That gives yet another class of examples of Hamiltonians in . It was discussed in [10] in connection with scattering theory for Dirac system.
Example 4: Szegő condition and indeterminate moment problem. Consider for which all moments ,
[TABLE]
are finite. The sequence defines the Hamburger moment problem (see [1] and, e.g., [6, 5, 8], [3], [36] for recent developments) and is one of its solutions. We recall that, given a sequence , the moment problem is called indeterminate if, firstly, there is a measure on the line having as its moments and, secondly, this measure is not unique. It was noticed by M. Krein, that measures that satisfy both and (4.4) give rise to indeterminate moment problem (see, e.g., [1], pp. 87-88). One example of such measures is , where is the Freud weight: , provided that (see [31] for detailed study of this case).
Every measure that satisfies (4.4) and has support different from a finite number of points gives rise to a system of polynomials orthogonal on the real line. These polynomials satisfy the three-term recurrence which defines the semi-infinite Jacobi matrix. The inclusion of Jacobi matrices to the more general class of de Branges systems is well-known [25],[38]. In particular, it shows that measure that satisfies (4.4) gives rise to a Hamiltonian for which there is an interval on which . This interval represents the Jacobi matrix and the elements of in (1.1) can be expressed in terms of orthogonal polynomials for . However, even for the classical case of Freud weight we are not aware of any systematic study of the corresponding Hamiltonian on the interval . We notice that our Theorem 1.2 yields for every .
The extensive literature on moment problem contains some cases for which the moments, Jacobi recurrence coefficients, and Nevanlinna matrix of the indeterminate moment problem can be explicitly found. This gives a way of constructing explicit examples of Hamiltonians with known spectral measures in Szegő class. For instance, one can consider an example from [7], Section 2.3, which is related to birth/death processes. Here, the polynomials involved satisfy recursion
[TABLE]
which can be easily symmetrized (see formulas (2.28)–(2.32) in [7]) to produce Jacobi matrix. In the special case when
[TABLE]
Berg and Valent obtained the asymptotics of for large and this allowed them to write (Proposition 3.3.2) the associated Nevanlinna matrix
[TABLE]
in terms of elementary functions. According to classical theory [1], all solutions to indeterminate moment problem can be parameterized using Nevanlinna matrix in the following way:
[TABLE]
where is arbitrary function from . In particular, taking , corresponds to choosing on the interval , where was mentioned above and can be computed as well. This gives rise to orthogonality measure with density determined by the formula (see (2.15) and section 3.5 in [7])
[TABLE]
Since and are known, we have (see formula (3.35) in [7])
[TABLE]
where and are some positive constants known explicitly. Simple analysis shows that which places to class.
5. Reduction to Hamiltonian with unit determinant. Proof of Theorem 3.1
In this section, we show that the general case in Theorem 1.2 can be reduced to the case when Hamiltonian has the unit determinant. Our considerations are based on several lemmas that use additivity of the entropy function (see assertion in Lemma 2.3) and its upper-semicontinuity. The same ideas were employed in [12].
Lemma 5.1**.**
Let , be singular nontrivial Hamiltonians on such that for every and all . Then, we have .
Lemma 5.1 was stated and proved in [12] for diagonal Hamiltonians, see Lemma 4.1 in [12]. Its proof, however, did not use the fact that the Hamiltonian is diagonal and hence works in the general case.
Lemma 5.2**.**
The spectral measure of a Hamiltonian lies in class.
Proof. Recall the definition of class . By Lemma 2.2, one can assume that . Formula (2.14) in [12] then gives
[TABLE]
where are the entries of the matrix in (2.2). In particular, is a function of bounded characteristic in and we have , see Proposition 2.1 in [12]. ∎
Lemma 5.3**.**
Assume that for every Hamiltonian such that a.e. on we have
[TABLE]
with an absolute constant c. Then, the same estimates with the same constants , hold for every .
Proof. Let be such that for , where and is some positive matrix. For every , define on . As before, and denotes the characteristic function of For , set
[TABLE]
and let be the inverse function to . Since bijectively maps onto , the function is defined correctly on . Moreover, we have a.e. on , hence is absolutely continuous on . Consider the Hamiltonian . By construction, a.e. on , so the Hamiltonian has unit determinant a.e. on . By Lemma 5.2, the spectral measures of , , , respectively, belong to . Our assumption implies the estimates
[TABLE]
For every , we have
[TABLE]
by a change of variables. This shows . Since and are equivalent, their Titchmarsh-Weyl functions and spectral measures coincide. Thus, from (5.3) we get
[TABLE]
for every . We claim that . Let , , be the numbers defined in (1.8) for the Hamiltonian . Then, and for every . Moreover, for sufficiently large we have
[TABLE]
due to the fact that , are constant on the corresponding intervals. So, our claim follows from the limiting relations
[TABLE]
which are immediate by the Lebesgue theorem on dominated convergence. To complete the proof, it remains to show that . To this end, we will use the following well-known formula (see, e.g., Section 2 in [12]) for and :
[TABLE]
Denote by the Titchmarsh-Weyl function for . Let also be the entries of the solution to Cauchy problem (1.1) for . Since tends to uniformly on in the matrix norm and on , we have
[TABLE]
Applying (5.5) to , we get . Formula (2.15) in [12] can be rewritten (see also (58) in [10]) as
[TABLE]
where . The last relation in (5.6) implies while the first two relations together with (5.7) give us . Recall (see (2.2)) that
[TABLE]
Thus, tends to and the lemma follows from (5.4). ∎
Proof of Theorem 3.1. By Lemma 5.3, we can drop the condition from our assumptions. Let be a nontrivial singular Hamiltonian on such that its spectral measure lies in the class . Then, . Theorem 2.1 and Theorem 2.2 imply that . In particular, the sequence in (1.8) is defined correctly. For , consider the Hamiltonian , introduced in (2.3). The first terms defining and in (1.8) are identical. Hence,
[TABLE]
where the first estimate follows from construction and definition of , the second inequality follows from assumption of the theorem, and the third one follows from assertion (a) of Lemma 2.3. Thus, and the first estimate in (3.2) holds.
Conversely, suppose that . For every integer , define
[TABLE]
For each , set
[TABLE]
where . Then, we have for every . By construction,
[TABLE]
Indeed, is constant on and on , hence the terms with indices in formula (1.8) for vanish, while the terms with indices coincide with the corresponding terms in (1.8) for the Hamiltonian . Since on , we have
[TABLE]
where we used . To obtain the last bound, we recalled (5.8) which gives
[TABLE]
and
[TABLE]
From (5.9) and Lemma 10.4, we get for every . Moreover,
[TABLE]
By Lemma 5.2, the spectral measure of the Hamiltonian belongs to for every . Hence, and
[TABLE]
where the first inequality follows from Lemma 5.1. The theorem is proved. ∎
6. Szegő condition implies factorization. Proof of Theorem 3.2
In this section we prove Theorem 3.2.
Lemma 6.1**.**
The following estimates are true
[TABLE]
Proof. We will prove the third one, the other bounds can be obtained similarly. Notice that (6.3) is equivalent to showing that
[TABLE]
for . We check that so factoring gives and we get the needed estimate. ∎
Proof of Theorem 3.2. Recall , the functions in , which were introduced in (2.1) and (2.2). Let and . Consider
[TABLE]
Now, we can use calculations done in the proof of Lemma 4.3 in [10], to conclude the following:
- •
From the last line in (44), [10] and Lemma 10.1, we get .
- •
From the third line in (44), [10], we obtain .
- •
The fourth line from the bottom on the same page gives .
Observe that and in non-increasing by assertion of Lemma 2.3. Hence, is a symmetric matrix with real entries such that
[TABLE]
almost everywhere on . It follows that almost everywhere on . Moreover, we have
[TABLE]
where the last equality follows from Lemma 2.3. It remains to estimate the norm of in . Let , . Then, we see from the assertion of Lemma 2.3 that
[TABLE]
where and . We also define and . Then, we can write with
[TABLE]
Lemma 6.1 and assertion of Lemma 2.3 imply that
[TABLE]
So, we have three bounds: , and . Cauchy-Schwarz inequality yields
[TABLE]
By assertion of Lemma 2.3 and (6.2), the right hand side of the above inequality does not exceed . This gives . Hence, and, moreover,
[TABLE]
Similarly, , as required. ∎
7. Factorization implies Szegő condition. Proof of Theorem 3.3
The key idea of the proof is to find and estimate an outer function defined in , which satisfies
[TABLE]
for almost every . This will provide required bound on the entropy after the multiplicative representation for is written at point . We start with some auxiliary statements.
Lemma 7.1**.**
Let be a singular nontrivial Hamiltonian on that admits – factorization. Then, there exists such that
* admits – factorization as , where for some .*
* for the Titchmarsh-Weyl function of .*
Proof. Consider , where for some parameter and to be chosen later. Define
[TABLE]
Using identity (see Lemma 10.1), one can check that
[TABLE]
Moreover, and . Thus, admits – factorization for any choice of and . Next, choose symmetric matrix as
[TABLE]
where
[TABLE]
and recall that denotes Titchmarsh-Weyl function for . One can verify directly that . Then, we apply (2.2) to check that
[TABLE]
where . Next, we notice that (2.2) implies
[TABLE]
for every Hamiltonian and every , provided that . Therefore, for any choice of . From , , and trace , we conclude that . Since , we can take to make sure that diagonalizes and for some . That proves and . ∎
Lemma 7.2**.**
Assume that matrix-functions , satisfy – in (3.1). Then, we have and .
Proof. We have by definition. Since , we also have
[TABLE]
Let . At each point of , we have
[TABLE]
Therefore, . We also have so Chebyshev inequality gives
[TABLE]
Using the estimate , we obtain
[TABLE]
The lemma is proved. ∎
Next, we will reduce the canonical system with , which admits factorization, to a system of Dirac type. Then, the system of Dirac type will be further reduced to generalized Krein system. The generalized Krein system turns out to be more convenient for finding representation (7.1).
Assume that admits – factorization and . Define , where is the first column of the solution to Cauchy problem (1.1). Since , we have . By Lemma 10.1, this yields , which could be rewritten in the form . It follows that , hence
[TABLE]
for almost every . In the case when , this equation reduces to Dirac system (4.2).
Fix absolutely continuous function on and consider the following functions for each :
[TABLE]
Lemma 7.3**.**
For every , the function is absolutely continuous in . There are functions and that satisfy
[TABLE]
such that
[TABLE]
for almost every and all . Moreover,
[TABLE]
Proof. Define the mapping
[TABLE]
We can rewrite (7.4) and (7.5) as
[TABLE]
Differentiating with respect to , we get
[TABLE]
where Straightforward calculation shows that
[TABLE]
and
[TABLE]
for any . Put , where
[TABLE]
Then, and (7.10) shows
[TABLE]
where we used identity . Now, we only need to take
[TABLE]
to get (7.6). Formula (7.7) then follows from the relation
[TABLE]
which can be proved directly by noticing that and are real for . Lemma 7.2 gives
[TABLE]
and we have by in (3.1). Function is non-negative since (use and to see this). ∎
Remark. Equations (7.6) and (7.7) define the generalization of Krein system. The Krein system was introduced in [29] (see also [16]). In fact, (7.6) and (7.7) are identical to Krein system if and does not depend on .
Remark. Consider the dual Hamiltonian . Note that if admits factorization , then the same is true for with , . This allows us to define the functions for as we did it for . The functions , , , from the proof of Lemma 7.3 for , , correspondingly, are related by identities , , due to (7.11) and
[TABLE]
Lemma 7.4**.**
Let be Hamiltonian which allows factorization . If for some , then
[TABLE]
Proof. In (7.12), we will estimate only, the analysis for is analogous. In Lemma 10.3, take as
[TABLE]
and write equations for at point in the form:
[TABLE]
Since ,
[TABLE]
where . Notice that Lemma 7.2 gives
[TABLE]
Let us write , where
[TABLE]
and notice that
[TABLE]
We can write
[TABLE]
and
[TABLE]
The eigenvalues of self-adjoint matrix are . Since , we can use Taylor formula to get To finish the proof of the first bound in (7.12), it is left to apply Lemma 10.3.
Now, consider (7.13). Denote . If , (7.13) follows from (7.12). Thus, we can assume that . This implies, in particular, that and we only need to show that
[TABLE]
If is the function from Lemma 7.3, we let and for all . Define
[TABLE]
where was introduced in (7.11). Then, we have , and a.e. on . It follows that
[TABLE]
Using , we obtain and , so
[TABLE]
Now we can apply Grönwall inequality to get
[TABLE]
where we extended to by zero. From Young’s inequality for convolution, i.e.,
[TABLE]
we obtain
[TABLE]
It follows that . By Lemma 7.3, we have , hence with an absolute constant . The same argument applies to the “dual” function . In particular, we have
[TABLE]
where we used formula (7.17) and the fact that (see Remark before the proof). It follows that . Multiplying with , we see that the linear in terms cancel out, while the other terms are controlled by . This yields the following estimate:
[TABLE]
after combining all terms. Since and , we see that (7.18) implies (7.16), because
[TABLE]
for . ∎
Given and a Hamiltonian which allows – factorization , we can define the following approximation (compare it with (2.3) which always exists):
[TABLE]
where and solves Cauchy problem
[TABLE]
for . From the definition, we get for and for . Clearly, Hamiltonian admits –factorization. Moreover, (7.11) shows that for . Therefore, (7.6) yields for . In the next lemma, we show that is the function we are looking for: an outer function in which provides a factorization of the spectral measure of .
Lemma 7.5**.**
Let be a Hamiltonian which allows -factorization. Let be defined by (7.5) for . Then, satisfies the following properties:
* is the spectral measure for ,*
* is an outer function in and, in particular,*
[TABLE]
Proof. If , then (2.5) and (2.2) imply that the Titchmarsh-Weyl function for Hamiltonian is given by , since the Titchmarsh-Weyl function of Hamiltonian is equal to . Therefore, the density of the spectral measure of can be written as follows (see , Lemma 2.2 in [10]):
[TABLE]
which proves . Recall that . By definition of , we have
[TABLE]
Since , we can apply Lemma 10.1 to get
[TABLE]
It follows that
[TABLE]
Let and notice that
[TABLE]
Since , it is invertible and we have
[TABLE]
for all . Formulas (7.22) then yield
[TABLE]
On the other hand, it is known that the entire function is in Hermite-Biehler class. In particular, it has no zeroes in , which implies that and have no zeroes in as well. It is also known (see, e.g., Section 6 in [38]) that has bounded type in and, moreover,
[TABLE]
Therefore, the function has bounded type in as well (in particular, ), and
[TABLE]
Since is of bounded type, it allows canonical factorization (see Theorem 5.5 in [21]):
[TABLE]
where are Blaschke products, are inner functions, and is an outer function. However, since has no zeroes and it is entire, we get and . Then, (7.23) shows that so is an outer function in and (7.20) holds. ∎
Proof of Theorem 3.3. By Lemma 5.1, it is sufficient to consider and prove
[TABLE]
for all . Denote Titchmarsh-Weyl function of by . By Lemma 7.1, we may additionally assume that and that admits – factorization with for some . We notice here that if Hamiltonian is an approximation of the type (7.19), it will be of the same type after modifying it as in Lemma 7.1. Using Lemma 7.5, we obtain
[TABLE]
By Corollary 2.5, we have and for the dual Hamiltonian . Hence, . Then, Lemma 7.4 gives the estimate
[TABLE]
and the theorem follows. ∎
Remark. In this paper, we do not develop the full Szegő theory for generalized Krein systems. In particular, we do not study convergence of to Szegő function when . In [10], this question was addressed for a special kind of Krein systems. We believe that the same argument works in full generality.
8. Factorization controls mean oscillation. Proof of Theorem 3.4
In this section, we show that a Hamiltonian which admits –factorization belongs to .
Proof of Theorem 3.4. Suppose that is –factorization of . Take and define as the solution to
[TABLE]
Then, we have for . Defining
[TABLE]
we iterate integral equation
[TABLE]
once to write in the form
[TABLE]
Since , we get
[TABLE]
Denote . Since , we have
[TABLE]
by Cauchy-Schwarz inequality. It follows that
[TABLE]
For matrices and , we have
[TABLE]
as can be easily seen by doing calculation on the determinant. So, taking
[TABLE]
we get
[TABLE]
Notice, that the sum of smaller order terms allows the bound
[TABLE]
as follows from (8.1), (8.2), and (8.3). Since
[TABLE]
it remains to estimate . We have
[TABLE]
Let , denote the eigenvalues of the matrix for and we can assume that , because . Then is a non-negative function whose integral over does not exceed . Define the function on and observe that . Consider two sets and . We define , and use (6.1) and (6.3) to get
[TABLE]
Recall that and introduce
[TABLE]
Then, Cauchy-Schwarz inequality gives
[TABLE]
Hence,
[TABLE]
Notice that
[TABLE]
for any matrix and
[TABLE]
So, we are left with
[TABLE]
Since , we have
[TABLE]
Combining it with (8.4) and using a trivial bound , we get with an absolute constant . ∎
9. The condition on mean oscillation implies factorization. Proof of Theorem 3.5
Now, we turn to proving Theorem 3.5. We need first one auxiliary result on triangular factorization of matrices. Suppose is positive real matrix. We denote by real upper-triangular matrix which satisfies
[TABLE]
One can solve equations for and find uniquely:
[TABLE]
Lemma 9.1**.**
Suppose are positive real matrices, , and for some . Consider and write . Then, there is such that
[TABLE]
Moreover,
[TABLE]
Proof. Identities (9.4) are straightforward. Using and , we obtain the estimates
[TABLE]
Let , so
[TABLE]
We have
[TABLE]
hence
[TABLE]
Since and , we also have
[TABLE]
where the second inequality follows from Lemma 10.4. Together with (9.8), this yields
[TABLE]
Inequalities and imply . Therefore, . In a similar way, one gets . Thus, (9.3) is proved. Note that for relations (9.2) follow from (9.3) and the fact that . Now, assume that and write
[TABLE]
These inequalities imply
[TABLE]
so that
[TABLE]
Since , we have . Hence, and
[TABLE]
Analogous estimate holds for . Moreover, we have
[TABLE]
It follows that . Since and , we also have
[TABLE]
and
[TABLE]
Relations (9.2) now follow from (9.7) and Taylor expansion. ∎
Remark. In the case , the above calculations provide explicit bounds:
[TABLE]
Thus,
[TABLE]
Proof of Theorem 3.5. For integer , we introduce , as follows:
[TABLE]
The inequality (10.1) from Lemma 10.7 and Corollary 10.6 yield
[TABLE]
for all integers . Let be real upper-triangular matrix (check the formula (9.1)) such that . Iteratively applying Lemma 9.1 and taking , , , we obtain representation for some , where and , are real matrices written coordinate-wise as
[TABLE]
and satisfying
[TABLE]
For , we introduce the following functions which will be used later in the proof:
[TABLE]
so . In the next lemmas, we prove that it is indeed a required factorization for .
Lemma 9.2**.**
We have
[TABLE]
for all , .
Proof. By construction, and . In particular, is constant on each . We also have
[TABLE]
By (9.17), . Corollary 10.6 yields the bound
[TABLE]
which gives . Lemma 10.4 provides inequality
[TABLE]
and this establishes an alternative estimate. The proof of (9.20) is finished. The bounds for imply inequalities for since . ∎
Lemma 9.3**.**
For every , the matrix is invertible, absolutely continuous, and
[TABLE]
for almost every . We also have
[TABLE]
where
[TABLE]
Proof. For , we have
[TABLE]
and
[TABLE]
hence is invertible and is defined correctly on . Direct calculation shows that almost everywhere on . We also have
[TABLE]
which yields (9.23). ∎
Remark. This lemma allows us to write
[TABLE]
and we can use definition of to get
[TABLE]
since . We notice here that for all thus we can take a square root in the formula above.
Lemma 9.4**.**
For , , we have
[TABLE]
Proof. For , we have
[TABLE]
If , we use (9.15), (9.18), and Taylor expansion to get
[TABLE]
If , we recall (9.18) again and write
[TABLE]
where we, first, used the fact that a linear function in achieves its minimum at an endpoint of the segment and, second, combined all four possible values in the sum in right hand side. ∎
Lemma 9.5**.**
The matrix-function is symmetric and has real entries for all . Moreover, there exist , such that , and and .
Proof. Indeed, for all , we have
[TABLE]
It follows from (9.18) that and for every . In particular, there exists such that the estimate implies
[TABLE]
Therefore, if we define and , then . Let and, finally, define and on each by (recall that , see (9.23))
[TABLE]
so the identity follows from (9.31). By (9.29), we have
[TABLE]
Similarly to (9.30), we get
[TABLE]
We claim that
[TABLE]
for every . Indeed, we have
[TABLE]
At the endpoints of the quadratic polynomial takes values or . It is also positive on . We can use (9.18) to write a bound . If the first coefficient satisfies , reaches minimum over at an endpoint and we are done because and . Otherwise, consider, e.g., the case . The point of minimum of over is given by If , then and again reaches minimum over at zero, an endpoint of . If, however, , we get and so we can write
[TABLE]
Thus, we have (9.34) in all cases. Summarizing, we get
[TABLE]
Since and we have
[TABLE]
The lemma follows. ∎
Lemma 9.6**.**
We have and
[TABLE]
Proof. Notice that . Since and , we also have . Recall that and . So, we only need an estimate for from above. For each , we consider
[TABLE]
and handle separately the cases of small and large .
Case 1. Assume that . Define on . Then, for , we use (9.28) to write
[TABLE]
From (9.27), we get
[TABLE]
Since , we recall (9.20) and (9.29) to write
[TABLE]
For , we have , that is,
[TABLE]
Recalling the formulas (9.24) for , we get
[TABLE]
We remind that and denote smallest and largest eigenvalues of self-adjoint matrix , respectively. Then, the formulas for , show that
[TABLE]
Hence,
[TABLE]
and
[TABLE]
for some function satisfying on . Then,
[TABLE]
so Cauchy-Schwarz inequality implies
[TABLE]
The right hand side of the above formula equals
[TABLE]
as follows from Lemma 9.2. Using von Neumann inequality for the trace of a product of two matrices [34], we obtain
[TABLE]
We now use (9.36) to obtain
Case 2. Assume that . We only need to show that since that would imply the bound
[TABLE]
We can write . Then, notice that
[TABLE]
again by von Neumann inequality for the trace. Introducing
[TABLE]
we can write
[TABLE]
so
[TABLE]
Since , we only need to show that
[TABLE]
Let us apply Lemma 10.2. We take , and notice that and . Let us estimate quantities from Lemma 10.2. We get
[TABLE]
since the diagonal elements of and are positive by definition. Moreover and so . For the quadratic form, we have an estimate
[TABLE]
in which we applied Cauchy-Schwarz inequality in the second bound. So, . Thus, since . Now, Lemma 10.2 gives (9.37). ∎
We are ready to complete the proof of Theorem 3.5. From the definition of , , we see that on and we already established that . Moreover,
[TABLE]
Lemma 9.5 and Lemma 9.6 provide the necessary bounds for and and that finishes the proof. ∎
10. Appendix
In this Appendix, we collect some auxiliary statements used in the main text. Most of them are well-known but we give proofs for the reader’s convenience.
Lemma 10.1**.**
If , then .
Proof. The proof is a straightforward calculation. ∎
We recall that denotes the upper-triangular matrix providing factorization of matrix introduced in (9.1).
Lemma 10.2**.**
Suppose and are real positive symmetric matrices, , , and . If , then
[TABLE]
Proof. Denote , . Clearly, . Then, we have
[TABLE]
Thus, and so . ∎
Lemma 10.3**.**
Suppose is a matrix-function defined on and integrable over any finite interval. Denote the largest eigenvalue of by . If is absolutely continuous vector-function that solves then .
Proof. If , then
[TABLE]
and we get statement of the lemma. ∎
Lemma 10.4**.**
If and are two real non-negative matrices and , then
[TABLE]
Moreover, if we have equality above and , then . If we have equality and , then either or there is such that .
Proof. If , the statement becomes trivial after we notice that is equivalent to . If and , then
[TABLE]
where unitary diagonalizes and is an eigenvalue of . This implies that with some . ∎
The following bound is known as Minkowski estimate for determinants (e.g., [33], p.115).
Lemma 10.5**.**
If and are two non-negative real matrices, then
[TABLE]
and equality holds if and only if one of the following conditions holds:
- •
* and with some ,*
- •
* and with some ,*
- •
,
- •
* and there is such that .*
Proof. If or , the proof follows from the previous lemma. Otherwise, we can always reduce the setup to the case when by dividing the both sides by . If
[TABLE]
we only need to check that
[TABLE]
which is equivalent to
[TABLE]
Equality holds if and only if . ∎
We immediately get the following corollary.
Corollary 10.6**.**
Suppose are two real non-negative matrices, then
[TABLE]
Lemma 10.7**.**
Let be real and non-negative matrix function on , for almost every , and . Then, we have
[TABLE]
Moreover, equality holds if and only if is constant almost everywhere on .
Proof. By a change of variables, we can reduce the problem to the case when . We have
[TABLE]
for every real matrix with nonzero determinant. Take . By Jensen’s inequality, we have
[TABLE]
If equality holds in (10.1), then is constant in for every . We can call this constant . By polarization identity, is constant in for every . Taking , for , where is standard basis in , we see that elements of are constants in . ∎
Lemma 10.8**.**
Let be real and non-negative matrix function and . Then,
[TABLE]
Assuming that almost everywhere on , we have equality in (10.2) if and only if is equivalent to a non-negative constant matrix .
Proof. We can assume that and . Let us first do the proof assuming that there is such that
[TABLE]
Consider increasing function
[TABLE]
and let define its inverse function so that
[TABLE]
We write
[TABLE]
Formula (10.4) makes sure that the matrix under the last integral has unit determinant and the previous lemma gives
[TABLE]
On the other hand,
[TABLE]
since the integrand is equal to . Now that we have proved the lemma under assumption (10.3), we can use the standard approximation argument (e.g., by considering with and then sending ), to show (10.2) in full generality.
Next, assume that , and that we have equality in (10.2). Then, for every , we get
[TABLE]
Lemma 10.5 provides us with an opposite bound so we actually have equality in the estimate above. Notice that and by our assumptions on the trace. If for some , then by Lemma 10.5. Moreover, if , then for all since . Similarly, if , we get . Thus, if for some , then for all and, by continuity,
[TABLE]
Then, by Lemma 10.4, we get
[TABLE]
with . Taking trace of both sides, we get
[TABLE]
Therefore, and differentiation of (10.5) in gives
[TABLE]
So, is equivalent to .
Let us suppose now that for all . By Lemma 10.5, there is a positive function such that and so
[TABLE]
In a similar way, we get
[TABLE]
and is equivalent to . ∎
Lemma 10.9**.**
Suppose and . Then,
[TABLE]
We skip the proof of this well-known fact, which is based on mean value formula for harmonic functions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] N. I. Akhiezer. The classical moment problem and some related questions in analysis . Translated by N. Kemmer. Hafner Publishing Co., New York, 1965.
- 2[2] D. Alpay and A. Kipnis. Wiener chaos approach to optimal prediction. Numer. Funct. Anal. Optim. , 36(10):1286–1306, 2015.
- 3[3] A. Baranov. Polynomials in the de Branges spaces of entire functions. Ark. Mat. , 44(1):16–38, 2006.
- 4[4] A. Baranov, Y. Belov, and A. Poltoratski. De Branges functions of Schroedinger equations. Collect. Math. , 68(2):251–263, 2017.
- 5[5] C. Berg. Recent results about moment problems. In Probability measures on groups and related structures, XI (Oberwolfach, 1994) , pages 1–13. World Sci. Publ., River Edge, NJ, 1995.
- 6[6] C. Berg and R. Szwarc. On the order of indeterminate moment problems. Adv. Math. , 250:105–143, 2014.
- 7[7] C. Berg and G. Valent. The Nevanlinna parametrization for some indeterminate Stieltjes moment problems associated with birth and death processes. Methods Appl. Anal. , 1(2):169–209, 1994.
- 8[8] C. Berg and G. Valent. Nevanlinna extremal measures for some orthogonal polynomials related to birth and death processes. J. Comput. Appl. Math. , 57(1-2):29–43, 1995.
