The main theme of this paper is to characterize distinguished subclasses of the matricial Schur class Sp×q(D) in terms of Taylor coefficients. Starting point of our investigations is the observation that the Taylor coefficient sequences of functions from Sp×q(D) are exactly the infinite p × q Schur sequences. We draw our attention mainly to the subclass Sp×q,∞(D) of Sp×q(D) which consists of all p×q Schur functions for which the corresponding Taylor coefficient sequences are nondegenerate p × q Schur sequences. Using an appropriate adaptation of the Schur-Potapov algorithm for functions belonging to Sp×q(D) to infinite sequences of complex p × q matrices we obtain an one-to-one correspondence between infinite nondegenerate p × q Schur sequences and the set of all infinite sequences (Ej) ∞ j=0 of strictly contractive complex p × q matrices. Taking into account the construction of Sp×q,∞(D) this gives us an one-to-one correspondence between Sp×q,∞(D) and the set of all infinite sequences (Ej) ∞ j=0 of strictly contractive complex p × q matrices. Hereby, (Ej) ∞ j=0 is called the sequence of Schur-Potapov parameters (shortly SP-parameters) of f . Mathematics Subject Classification (2000). Primary 30E05, 47A57.
This is the second and final part of a paper which appeared in a preceding issue of this journal. Herein the methods developed in the earlier sections of this paper are used first to develop a number of applications. A central theme of this paper is to study the interplay between functions from Sp×q,∞(D) and their sequence of SP-parameters. In particular, we describe how certain summability properties of the SP-parameters are expressed in terms of the associated functions from Sp×q,∞(D). As a byproduct of our investigations on the interplay between the SP-algorithm for p × q Schur functions and the SP-algorithm for sequences of complex p×q matrices we present a new approach to the nondegenerate matricial Schur problem. Our method complies with the basic strategy in Schur's classical paper [138] because it does not make use of any tools outside of the theory of Schur functions and Schur sequences. A closer look at the behaviour of distinguished subclasses of Sp×q(D) with respect to the SP-algorithm enables us to handle the corresponding versions of the matricial Schur problem restricted to these subclasses. Mathematics Subject Classification (2000). Primary 30E05, 47A57.Keywords. Schur function, matricial Schur problem, Schur-Potapov matrix polynomials, Arov-Kreȋn matrix polynomials. IntroductionIn the first part [57] of this paper we have established an appropriate adaptation of the Schur-Potapov algorithm for functions belonging to the matricial Schur class S p×q (D) to infinite sequences of complex p × q matrices. Using the fact that the Taylor coefficients sequences of functions from S p×q (D) are infinite p × q Schur sequences we mainly focused on the subclass S p×q,∞ (D) of S p×q (D) which consists of all p × q Schur functions for which the corresponding Taylor coefficient sequences are nondegenerate p × q Schur sequences. Thus, an one-to-one correspondence between infinite nondegenerate p × q Schur sequences and the set of all
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.