On a local Darlington synthesis problem
L. Golinskii

TL;DR
This paper introduces a local version of the Darlington synthesis problem, relating algebraic embedding conditions to analytic pseudocontinuation, and proves a local analog of the Arov--Douglas--Helton theorem.
Contribution
It formulates and proves a local version of the Darlington synthesis problem and extends the ADH theorem to a localized setting.
Findings
Established a local Darlington synthesis framework
Proved a local analog of the ADH theorem
Connected algebraic and analytic properties in a localized context
Abstract
The Darlington synthesis problem (in the scalar case) is the problem of embedding a given contractive analytic function to an inner matrix function as the entry. A fundamental result of Arov--Douglas--Helton relates this algebraic property to a pure analytic one known as a pseudocontinuation of bounded type. We suggest a local version of the Darlington synthesis problem and prove a local analog of the ADH theorem.
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.
Taxonomy
TopicsSpectral Theory in Mathematical Physics · Quantum Mechanics and Applications · Matrix Theory and Algorithms
On a local Darlington synthesis problem
L. Golinskii
B. Verkin Institute for Low Temperature Physics and Engineering, 47 Science ave., Kharkov 61103, Ukraine
Abstract.
The Darlington synthesis problem (in the scalar case) is the problem of embedding a given contractive analytic function to an inner matrix function as the entry. A fundamental result of Arov–Douglas–Helton relates this algebraic property to a pure analytic one known as a pseudocontinuation of bounded type. We suggest a local version of the Darlington synthesis problem and prove a local analog of the ADH theorem.
Key words and phrases:
Darlington synthesis, pseudocontinuation, inner matrix function, unitary matrix, Nevanlinna, Schur and Smirnov classes
2010 Mathematics Subject Classification:
30H05, 30H15, 30C80
Introduction
The Darlington synthesis with its origin in electrical engineering has a long history. The synthesis of non-lossless circuits was a hard problem at the pre-computer time. The idea of the Darlington synthesis was to reduce any such problem to a lossless one
A mathematical setup in the simplest scalar case looks as follows, see [1, 2, 3, 5] and [6, Section 6.7].
An analytic function on the unit disk is called a Schur (contractive) function, , if in . Similarly, an analytic on matrix function (throughout this note we deal only with matrices of order ) is a Schur (contractive) matrix function, , if
[TABLE]
is a unity matrix. A function (a matrix function ) is said to be inner (matrix) function if its boundary values which exist almost everywhere on the unit circle , are unimodular (unitary). Given , the Darlington synthesis problem asks whether there exists an inner matrix function so that
[TABLE]
A seminal result of Arov [1] and Douglas–Helton [3] states that a Schur function admits the Darlington synthesis if and only if it possesses a pseudocontinuation of bounded type across . Recall that a meromorphic on a region function of bounded type is the quotient of two bounded (or contractive) analytic on functions
[TABLE]
Such functions constitute the Nevanlinna class .
The goal of this note is to suggest a local version of the Darlington synthesis problem and to prove a local analog of the Arov–Douglas–Helton theorem.
Definition 0.1**.**
Let be an arc of the unit circle (the case is not excluded). Denote by the exterior of the unit disk with respect to the extended complex plane . A function admits the pseudocontinuation of bounded type across if there is a function so that their boundary values agree
[TABLE]
We write for such functions. The class is nontrivial, see Example 1.1 in Section 1.
Theorem 0.2**.**
Let . The following conditions are equivalent.
- (1)
There is a matrix function so that , , and is unitary a.e. on the arc ; 2. (2)
.
In the case , the above matrix function is inner due to the Maximum Norm Principle, and we come to the Arov–Douglas–Helton theorem.
Given an arc , we denote by () the class of the Schur (Nevanlinna) functions, unimodular a.e. on . Similarly, stands for the class of the Schur matrix functions unitary a.e. on .
It is clear that a matrix function with contractive entries does not necessarily belong to . So the question arises naturally whether the matrix in Theorem 0.2 can be taken from . If , the answer is affirmative: the matrix function
[TABLE]
with an arbitrary inner function belongs to . But, in general, the answer is negative. The reason is that being an entry of a contractive, nondiagonal matrix function is supposed to obey a global condition
[TABLE]
is the normalized Lebesgue measure on . As it turns out, this condition is also sufficient.
Theorem 0.3**.**
Let . The following conditions are equivalent.
- (1)
There is a matrix function so that ; 2. (2)
* and holds.*
In contrast to the case of the whole unit circle, we have neither the model spaces theory nor the Douglas–Shapiro–Shilds theorem at hand. So the argument is more or less straightforward and relies upon the explicit (in a sense) expressions for the matrix entries of the matrices in question.
1. Local pseudocontinuation and Darlington synthesis
Let us begin with the classes and , which play the same role as the class of inner functions does in the classical setting of the Darlington synthesis problem.
Example 1.1**.**
Let . Write
[TABLE]
Then and a.e. on , so . In particular, , and, moreover, such unless is an inner function.
Proof of Theorem 0.2.
. The argument here is standard. By the hypothesis, , so we write
[TABLE]
It is clear that all entries of belong to , and a.e. on . Hence, admits the pseudocontinuation of bounded type across , , with
[TABLE]
Note that in fact each entry of the bounded matrix function , unitary a.e. on , is in the class .
. The arguments in Example 1.1 and around relation (0.4) show that the result holds for . So we assume further that .
Define a pair of functions on
[TABLE]
where is the pseudocontinuation of bounded type of across . Now, implies , so , see [4, Theorem 2.2], and
[TABLE]
We see that as long as , which is a local counterpart of relation (0.5).
In view of (1.4), the function
[TABLE]
is a well-defined, outer Schur function, , with the boundary values
[TABLE]
We choose .
Going back to the Nevanlinna functions in (1.3), we write
[TABLE]
where is the standard inner-outer factorization of a Schur function . We proceed with the further factorization of the outer factors with respect to , precisely,
[TABLE]
for the arc . We have and
[TABLE]
Hence,
[TABLE]
Put
[TABLE]
so a.e. on . Our choice of and is
[TABLE]
It is clear that and (1.5) are contractive functions. As for and (1.11), we note that they belong to an important subclass of the Nevanlinna class, which is usually referred to as the Smirnov class, see [4, Section 2.5]. It is characterized by the denominator in (0.2) being an outer Schur function, which is exactly the case in (1.11). The main feature of this class is the Smirnov maximum modulus principle, [4, Theorem 2.11],
[TABLE]
For we have , a.e. in view of (1.8). For we have a.e., so
[TABLE]
and the first claim of the Theorem follows from (1.12).
To show that is unitary a.e. on , we put
[TABLE]
By (1.6),
[TABLE]
a.e. on . Next, a.e. on implies
[TABLE]
Finally, by (1.6) and the definition of ,
[TABLE]
a.e. on . So, , as claimed. The proof is complete.
Proof of Theorem 0.3.
. By Theorem 0.2, , so we have to verify condition (0.5). Note that at least one of the functions , is not identically zero (otherwise, ). Assume that and write
[TABLE]
so . Since , condition (0.5) follows.
. The matrix arises as an appropriate modification of the matrix from Theorem 0.2. By (0.5), the function
[TABLE]
is well-defined and lies in . Denote by the outer Schur function with
[TABLE]
where is a small enough positive constant, and put . Take the matrix in question as
[TABLE]
As both and are unimodular on , then so is , and thereby is unitary a.e. on .
It remains to check that . To this end we put on the arc
[TABLE]
Since
[TABLE]
then and so
[TABLE]
a.e. on . Next, the functions are contractive, so
[TABLE]
and
[TABLE]
a.e. on for . Finally,
[TABLE]
and so
[TABLE]
a.e. on .
To show that a.e. on , given , , we compute the determinant of
[TABLE]
a.e. on for . So, , as claimed.
We complete this note with some properties of the pseudocontinuation of bounded type across an arc.
Proposition 1.2**.**
Let and a.e. on the arc . Then and belong to simultaneously.
Proof.
Let . We have the canonical factorization
[TABLE]
and, by the assumption, . Hence,
[TABLE]
The function , so, see Example 1.1, . The later class is closed under multiplication, so , as claimed. ∎
Recall that is defined in (1.5) under condition (1.4).
Proposition 1.3**.**
Let and . Then
[TABLE]
Proof.
As we mentioned earlier in the proof of Theorem 0.2, each entry of the bounded matrix function , unitary a.e. on , is in the class . If , the matrix function in Theorem 0.2 contains both and as its entries, and we are done.
Conversely, let . By Theorem 0.2, there is a matrix function with contractive entries, unitary a.e. on , and
[TABLE]
In particular, , and so a.e. on . The function , being the entry of , belongs to the class . By Proposition 1.2, so does , as claimed. ∎
Remark 1.4**.**
The fact that is the arc of the unit circle is obviously immaterial. The argument works for an arbitrary Borel set of positive measure.
Acknowledgement. The author thanks the participants of the Analysis Seminar at Kharkov National University for valuable discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Arov D. Z., Darlington’s method in the study of dissipative systems, Dokl. Akad. Nauk SSSR, 201 (1971), no. 3, 559–562.
- 2[2] Arov D. Z., Realization of matrix-valued functions according to Darlington, Izv. Akad. Nauk SSSR, Ser. Mat. 7 (1973), no. 6, 1295–1326.
- 3[3] Douglas R. G., Helton J. W., Inner dilations of analytic matrix functions and Darlington synthesis, Acta Sci. Math (Szeged) 34 (1973), 61–67.
- 4[4] Duren P., Theory of H p superscript 𝐻 𝑝 H^{p} Spaces , Pure and Applied Math., v.38, Academic Press, NY–London, 1970.
- 5[5] Garcia S. R., Inner matrices and Darlington synthesis, Meth. Func. Anal. Topol. 11 (2005), no. 1, 37–47.
- 6[6] Ross W. T., Shapiro H. S., Generalized Analytic Continuation , University Lecture Series, v. 25, AMS, Providence R. I., 2002.
