Pith. sign in

REVIEW 2 major objections 3 minor 29 references

The Hamburger Criterion for Matrix Nevanlinna--Pick Interpolation

T0 review · 2 major / 3 minor · reviewed 2026-08-28 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Complete indeterminacy of a matrix Nevanlinna-Pick problem is equivalent to convergence of a matrix series built from rational functions of the first and second kind.

desk verdict Genuine but narrow new criterion; sound in spirit, with one load-bearing cited identity and a repairable sign slip in the printed proof. read the letter →

arxiv 2608.23004 v1 pith:WCTIPPWO submitted 2026-08-24 math.CA

Yury M. Dyukarev This is my paper · ORCID
classification math.CA
keywords problemcriterioninterpolationhamburgermatrixnevanlinna--pickclassicalconvergence
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

A Nevanlinna function is a holomorphic function on the upper half-plane whose imaginary part is never negative. The Nevanlinna-Pick interpolation problem asks: given a list of points in the upper half-plane and a list of target values, can we find a Nevanlinna function that takes those values at those points, and how many such functions are there? Classical results say the answer is either exactly one function or infinitely many. In the related Hamburger moment problem, one prescribes all moments of a measure and asks whether the measure is unique; Hamburger gave a test using an infinite series built from orthogonal polynomials.

This paper proves a matrix-valued version of that test for Nevanlinna-Pick problems. For problems in which every finite truncation is nondegenerate, the full problem has infinitely many solutions exactly when a certain infinite matrix series converges. The series is built from rational functions of the first and second kind, which play the role that orthogonal polynomials play in the moment problem. The proof uses Potapov's theory of J-contractive matrix functions: resolvent matrices are written as products of Blaschke-Potapov factors, and convergence of the products is compared with convergence of the series.

In the special case where all interpolation nodes lie on the imaginary axis, the criterion simplifies to exactly the same shape as the matrix Hamburger criterion, involving sums of P_j^*(0)P_j(0) and Q_j^*(0)Q_j(0). The paper also gives an infinite-product representation of the resolvent matrix and a parametrization of all solutions by Nevanlinna pairs.

Extended reading notes

Core claim

Theorem 6.10 (Hamburger Criterion): if all truncated matrix Nevanlinna-Pick problems are completely indeterminate, then the full problem (3.1) is completely indeterminate if and only if the matrix series (6.27), built from the modified matrices eP_j, converges. The paper also proves the special pure-imaginary-node version (Theorem 7.2), where the criterion takes the same form as the matrix Hamburger criterion (7.5).

Load-bearing premise

The theorem assumes every truncated Pick matrix is positive definite, P_n > O_{n m by n m} for all n, stated in (3.5). This is needed to define the resolvent matrices and Blaschke-Potapov factors; if some truncated problem is degenerate, the criterion is not stated and the proof does not apply.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 3 minor

Summary. The paper establishes an analogue of Hamburger's classical indeterminacy criterion for the matrix Nevanlinna--Pick interpolation problem. Assuming that all truncated Pick matrices are positive definite (3.5), the author defines rational matrix functions of the first and second kind, Blaschke--Potapov factors, and a modified resolvent matrix. The central result, Theorem 6.10, asserts that the full problem (3.1) is completely indeterminate if and only if the matrix series (6.27), built from the modified matrices eP_j, converges. The proof follows Potapov's theory of J-moduli: complete indeterminacy gives uniform bounds on the modified resolvent, which force convergence of a series of projectors; conversely, convergence of the series yields convergence of the modified resolvent product and hence nondegeneracy of the limit Weyl ball. Section 7 treats purely imaginary nodes, where the criterion reduces to convergence of the two series formed from the rational functions of the first and second kind, exactly matching the matrix Hamburger form (2.12)--(2.13). The paper also proves the infinite-product representation of the resolvent (Theorem 6.12) and the Nevanlinna parametrization of all solutions (Theorem 6.16).

Significance. If the proof is completed as indicated below, the result is a genuine and long-sought analogue of the Hamburger criterion for the matrix Nevanlinna--Pick problem. The criterion is an explicit function of the interpolation data, contains no fitted or free parameters, and the pure-imaginary specialization is structurally identical to the classical matrix Hamburger criterion, which is an elegant and convincing confirmation of the analogy. The paper uses the standard Potapov machinery and gives a coherent proof skeleton, including the key factorization (6.23)--(6.24) and the application of the Potapov convergence theorem. The main defects are not in the architecture of the proof but in two load-bearing points that must be fixed before the argument is rigorous: the unproved import of the Weyl-ball identity (6.28)--(6.29) and the sign error in the sufficiency comparison near (6.38). Both appear repairable within the manuscript's framework.

major comments (2)
  1. [Theorem 6.10, equations (6.28)-(6.29)] The necessity direction hinges entirely on the identities (6.28) and (6.29), which are imported from [10, Eq. (2.33)] without proof. These identities express the modified resolvent matrix eU_n in terms of the Weyl-ball parameters c_n, rho_n, r_n, and the uniform boundedness obtained from them is what feeds Potapov's Theorem 5.6. The manuscript does not verify that the normalization of eU_n in (6.22) matches the normalization used in [10, Eq. (2.33)], nor does it state the exact hypotheses under which that identity holds. Since a misquoted or differently normalized identity would remove the only argument for necessity, the authors should either prove (6.28)-(6.29) in the present notation or state them as a lemma with a precise reference and a verification of the normalization.
  2. [Theorem 6.10, sufficiency proof after (6.38)] The printed comparison argument is sign-inconsistent. Equation (6.38) has terms (Im z_j/|z0-z_j|^2) tr eP_j = -m (Im z_j/|z0-z_j|^2), which are negative because tr eP_j = -m; the text's claim that "both series have non-negative terms" is therefore false. The intended argument can be repaired by comparing the positive series sum Im z_j/|z0-z_j|^2 with sum -alpha_j(z0) tr eP_j = m sum alpha_j(z0), but as written the sufficiency proof is not literally valid. In addition, the step "Applying Corollary 5.2" to pass from convergence of (6.40) to convergence of sum -alpha_j(z0)eP_j needs the representation (6.35) and the positivity of tr(eP_jJ); the text should spell this out, since Corollary 5.2 concerns series of the form X_j^*X_j, not arbitrary matrices eP_j.
minor comments (3)
  1. [Section 7, before Theorem 7.2] The sentence "The Hamburger criterion (6.10) now takes considerably simpler form" should refer to equation (6.27), not (6.10); equation (6.10) is the exponential identity in Remark 6.4.
  2. [Theorem 7.2, proof] In the proof, "the special Nevanlinna-Pick problem (7.2) is indeterminate" should read "(7.1)", since (7.2) is the standing assumption on the nodes rather than the interpolation problem itself.
  3. [Theorem 6.10] The statement fixes an arbitrary point z0 in C+\Z; a remark should explicitly note that complete indeterminacy is independent of z0 and, consequently, that convergence of (6.27) is equivalent for every admissible z0. As written, this independence is only implicit.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Hamburger criterion (6.27) is an explicit series in the interpolation data, and the author-overlap citations supply independent structural identities rather than the target result.

full rationale

Walking the derivation chain of Theorem 6.10, the convergence criterion is an explicit infinite series built from the Pick data: the matrices P_j are defined in (4.8) from the Schur complements bK_j and the rational functions P_j, Q_j, and the modified matrices eP_j are defined in (6.16)-(6.17) by a fixed J-unitary normalization. No parameter is fitted to the conclusion 'completely indeterminate.' In the necessity direction, complete indeterminacy is translated into uniform bounds via the Weyl-ball identities (6.28)-(6.29), quoted from the same author's [10, Eq. (2.33)]; that identity concerns finite truncated resolvent matrices and Weyl-ball parameters, not the infinite-series criterion, so it is independent structural support rather than a renaming of the theorem. The sufficiency direction reconstructs nonsingular limiting radii from convergence of (6.27) through (6.29) and Potapov's theorem. The sign slip near (6.38)-(6.40), where the text says 'both series have non-negative terms' although tr eP_j = -m, is a repairable correctness issue and not a circular reduction. Overall, no equation in the paper is equivalent to its own input by construction.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No fitted constants appear: z0 is an arbitrary but fixed auxiliary point, not a parameter tuned to data. The axioms are either standard analysis theorems or explicitly stated domain restrictions on the interpolation data. No new physical or model entities are introduced; the modified Blaschke-Potapov factors are mathematical constructions, not postulated objects requiring independent empirical evidence.

assumptions (6)
  • domain assumption All truncated Pick matrices are positive definite, P_n > O_{n m by n m} for every n (condition (3.5)).
    This is assumed in all main theorems and is needed to construct resolvent matrices and Blaschke-Potapov factors; degenerate cases are excluded.
  • domain assumption Interpolation nodes z_j are distinct in the upper half-plane; the special case uses z_j = i y_j with 0 < y_j < y_{j+1} and y_j to infinity.
    Stated in (3.1) and (7.2); the criterion and the proof rely on Blaschke factors and Weyl balls for such node sequences.
  • domain assumption The Weyl-ball limits c_n(z0), rho_n(z0), r_n(z0) exist and converge to nonsingular limits in the complete indeterminacy setting.
    Used in the proof of Theorem 6.10, around equations (6.28)-(6.29) and in the converse direction, where it is cited as 'well known' from [20,22,30].
  • standard math Potapov's theorem on convergence of products of moduli (Theorem 5.6).
    Essential for both directions of Theorem 6.10; cited to [27,28,29,32] and stated in Section 5.
  • standard math Orlov's rank-invariance theorem for Weyl balls.
    Used to define complete indeterminacy in Definition 6.1; cited to [25].
  • standard math Standard comparison test and matrix-series convergence criteria (Lemmas 5.1 through 5.3).
    Proved in Section 5 and used to reduce matrix-series convergence to convergence of scalar trace series.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Hamburger Criterion for Matrix Nevanlinna--Pick Interpolation." pith.science (2026). https://pith.science/paper/WCTIPPWO

@misc{pith2026260823004,
  author       = {Pith},
  title        = {Pith review of: The Hamburger Criterion for Matrix Nevanlinna--Pick Interpolation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WCTIPPWO}},
  note         = {Machine review of arXiv:2608.23004}
}
read the original abstract

The classical Hamburger moment problem can be viewed as an interpolation problem for Nevanlinna functions. A closely related problem is the Nevanlinna--Pick interpolation problem. Each of these problems is either determinate, with a unique solution, or indeterminate, with infinitely many solutions. Hamburger established a criterion for the indeterminacy of the moment problem in terms of the convergence of two series involving the classical polynomials of the first and second kind. In this paper, we establish an analogous criterion for the matrix Nevanlinna--Pick interpolation problem. The criterion is formulated in terms of the convergence of matrix series involving the rational functions of the first and second kind.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [10]

    Meth- ods Funct

    Dyukarev, Yu.M.: Indeterminacy conditions for the matrix Nevanlinna–Pick problem and rational matrix functions of the first and second kind. Meth- ods Funct. Anal. Topology 28(1), 25–40 (2022).https://doi.org/10.31392/ MFAT-npu26_1.2022.03

    work page 2022

  2. [1]

    Hafner Publishing Co., New York (1965)

    Akhiezer, N.I.: The classical moment problem and some related questions in analysis. Hafner Publishing Co., New York (1965). Translated by N. Kemmer. https://doi.org/10.1017/S0008439500028526

    work page doi:10.1017/s0008439500028526 1965

  3. [2]

    Encyclopedia of Mathematics and its Applications, vol

    Arov, D.Z., Dym, H.: J-contractive matrix valued functions and related topics. Encyclopedia of Mathematics and its Applications, vol. 116. Cam- bridge University Press, Cambridge (2008).https://doi.org/10.1017/ CBO9780511721427

    work page 2008

  4. [3]

    Coimbra Lecture Notes on Orthog- onal Polynomials, pp

    Berg, Ch.: The matrix moment problem. Coimbra Lecture Notes on Orthog- onal Polynomials, pp. 1–57. Nova Science Publishers Inc., New York (2008)

    work page 2008

  5. [4]

    Dubovoj, V.K., Fritzsche, B., Kirstein, B.: Matricial Version of the Classical Schur Problem. B.G. Teubner, Stuttgart (1992)

    work page 1992

  6. [5]

    Dyukarev, Yu.M.: On the indeterminacy of interpolation problems in the Stieltjes class. Mat. Sb. 196(3), 61–88 (2005).https://doi.org/10.1070/ SM2005v196n03ABEH000884

    work page 2005

  7. [6]

    Dyukarev, Yu.M.: Deficiency numbers of symmetric operators generated by block Jacobi matrices. Mat. Sb. 197(8), 73–100 (2006).https://doi.org/10. 1070/SM2006v197n08ABEH003794

    work page 2006

  8. [7]

    Dyukarev, Yu.M.: A generalized Stieltjes criterion for the complete inde- terminacy of interpolation problems. Mat. Zametki 84(1), 23–39 (2008). https://doi.org/10.1134/S000143460807002X 36 Yury M. Dyukarev

    work page doi:10.1134/s000143460807002x 2008

Show all 29 references
  1. [8]

    Dyukarev, Yu.M.: Examples of block Jacobi matrices that generate symmetric operators with arbitrary possible deficiency numbers. Mat. Sb. 201(12), 83–92 (2010).https://doi.org/10.1070/SM2010v201n12ABEH004131

    2010 doi

  2. [9]

    In: Complex Function Theory, Operator The- ory, Schur Analysis and Systems Theory, Oper

    Dyukarev, Yu.M.: On conditions of complete indeterminacy for the matricial Hamburger moment problem. In: Complex Function Theory, Operator The- ory, Schur Analysis and Systems Theory, Oper. Theory Adv. Appl., vol. 280, pp. 327–353. Birkh¨ auser/Springer, Cham (2020).https://do...

    2020

  3. [11]

    Linear Algebra Appl

    Dyukarev, Yu.M.: The Nevanlinna formula for matrix Nevanlinna–Pick inter- polation. Linear Algebra Appl. 709, 241–270 (2025).https://doi.org/10. 1016/j.laa.2025.01.007

    2025

  4. [12]

    Dyukarev, Yu.M., Choque Rivero, A.E.: The matrix version of Hamburger’s theorem. Math. Notes 91(3–4), 493–499 (2012). Translation of Mat. Zametki 91(4), 522–529 (2012).https://doi.org/10.1134/S0001434612030236

    2012 doi

  5. [13]

    Dyukarev, Yu.M., Choque Rivero, A.E.: Criterion for the complete inde- terminacy of the Nevanlinna–Pick matrix problem. Math. Notes 96(5–6), 651–665 (2014). Translation of Mat. Zametki 96(5), 658–673 (2014).https: //doi.org/10.1134/S0001434614110042

    2014 doi

  6. [14]

    Uspehi Mat

    Efimov, A.V., Potapov, V.P.:J-expanding matrix-valued functions, and their role in the analytic theory of electrical circuits. Uspehi Mat. Nauk 28(1), 65–130 (1973).https://doi.org/10.1070/RM1973v028n01ABEH001397

    1973 doi

  7. [15]

    Hamburger, H.: ¨Uber eine Erweiterung des Stieltjesschen Momentenproblems. Math. Ann. 81(2–4), 235–319 (1920).https://doi.org/10.1007/BF01564869

    1920 doi

  8. [16]

    Hamburger, H.: ¨Uber eine Erweiterung des Stieltjesschen Momentenproblems. Math. Ann. 82(1–2), 120–164 (1920).https://doi.org/10.1007/BF01457982

    1920 doi

  9. [17]

    Hamburger, H.: ¨Uber eine Erweiterung des Stieltjesschen Momentenproblems. Math. Ann. 82(3–4), 168–187 (1921).https://doi.org/10.1007/BF01498663

    1921 doi

  10. [18]

    In: Topics in Interpo- lation Theory (Leipzig, 1994), Oper

    Katsnelson, V.E., Kheifets, A.Y., Yuditskii, P.M.: An abstract interpolation problem and the extension theory of isometric operators. In: Topics in Interpo- lation Theory (Leipzig, 1994), Oper. Theory Adv. Appl., vol. 95, pp. 283–298. Birkh¨ auser, Basel (1997).https://doi.org...

    1997 doi

  11. [19]

    Kogan, V.I.: Operators generated byl p-matrices in the case of maximum deficiency indices. Teor. Funktsi˘ ı Funktsional. Anal. i Prilozhen., no. 11, 103– 107 (1970) (Russian)

    1970

  12. [20]

    Kovalishina, I.V.: Analytic theory of a class of interpolation problems. Izv. Akad. Nauk SSSR Ser. Mat. 47(3), 455–497 (1983) (Russian). Eng- lish transl. in Math. USSR-Izv. 22(3), 419–463 (1984).https://doi.org/ 10.1070/IM1984v022n03ABEH001452

    1983 doi

  13. [23]

    L´ opez-Rodr´ ıguez, P.: The Nevanlinna parametrization for a matrix moment problem. Math. Scand. 89(2), 245–267 (2001).https://doi.org/10.7146/ math.scand.a-14340

    2001

  14. [24]

    Nevanlinna, R.: Asymptotische Entwicklungen beschr¨ ankter Funktionen und das Stieltjessche Momentenproblem. Ann. Acad. Scient. Fennicae, Ser. A, vol. 18, no. 5, 1–53 (1922)

    1922

  15. [25]

    Orlov, S.A.: Nested matrix discs that depend analytically on a parameter, and theorems on the invariance of the ranks of the radii of the limit matrix discs. Izv. Akad. Nauk SSSR Ser. Mat. 40(3), 593–644, 710 (1976) (Russian). English transl. in Math. USSR-Izv. 10(3), 565–613 ...

    1976 doi

  16. [26]

    Trudy Moskov

    Potapov, V.P.: The multiplicative structure ofJ-contractive matrix func- tions. Trudy Moskov. Mat. Obˇ sc. 4, 125–236 (1955) (Russian). English transl. in Nine Papers on Foundations, Algebra, Topology, Functions of a Com- plex Variable, Amer. Math. Soc. Transl. (2) 15, 131–243...

    1955 doi

  17. [28]

    Potapov, V.P.: A theorem on the modulus. I. Fundamental concepts. The modulus. Teor. Funktsi˘ ı Funktsional. Anal. i Prilozhen., no. 38, 91–101 (1982) (Russian). English transl. in Seven Papers Translated from the Russian, Amer. Math. Soc. Transl. (2) 138, 55–65 (1988).https:/...

    1982 doi

  18. [29]

    Potapov, V.P.: A theorem on the modulus. II. Teor. Funktsi˘ ı Funktsional. Anal. i Prilozhen., no. 39, 95–106 (1983) (Russian). English transl. in Seven Papers Translated from the Russian, Amer. Math. Soc. Transl. (2) 138, 67–77 (1988).https://doi.org/10.1090/trans2/138

    1983 doi

  19. [30]

    Mathematics and Its Applications, vol

    Sakhnovich, L.A.: Interpolation theory and its applications. Mathematics and Its Applications, vol. 428. Kluwer Academic Publishers, Dordrecht (1997). https://doi.org/10.1007/978-94-009-0059-2

    1997 doi

  20. [31]

    Simon, B.: The classical moment problem as a self-adjoint finite difference op- erator. Adv. Math. 137(1), 82–203 (1998).https://doi.org/10.1006/aima. 1998.1728

    1998

  21. [32]

    Lecture Notes in Mathematics, vol

    Zolotarev, V.A.: Analytic methods of spectral representations of non- selfadjoint (non-unitary) operators. Lecture Notes in Mathematics, vol. 2355. Springer, Cham (2025).https://doi.org/10.1007/978-3-031-71657-7 38 Yury M. Dyukarev Yury M. Dyukarev Department of Physics, V. N....

    2025 doi

Pith tools

Reviewed August 28, 2026 · model on record in the stance chip above.