Abstract

The problem to find the minimal rank extensions of the lower triangular part of a finite rank matrix kernel appears in a natural way (see [3]) in the study of minimal representations of semi-separable integral operators or, equivalently, of minimal realizations of boundary value systems. In particular, one is interested in those kernels for which the minimal rank extension is unique. In this paper we give a full description of this class of so-called unique matrix kernels. We also define and characterize lower uniqueness for finite and semi-infinite block operator matrices. To state one of our main results, let k( t, s) be an m x n matrix kernel defined on the square [a, b] x [a, b]. Following [3] we say that k is lower separable if the lower triangular part k, of k, which is defined by kL,(t, 8) = k(t, s), a<s<t<b, admits a finite rank extension, i.e., there exists a finite rank matrix kernel h on [a, b] x [a, b] such that k, is the lower triangular part of h. Recall that for an m x n matrix kernel h on [a, fl] x [y, S] the rank of

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.