
TL;DR
This paper investigates the extreme points of a set of analytic functions on the bidisk with positive real part, focusing on those with rational inner Cayley transforms, and introduces saturated polynomials related to these extreme points.
Contribution
The paper constructs families of extreme points using saturated polynomials and conjectures these are all such extreme points, advancing the understanding of function extremality in complex analysis.
Findings
Constructed families of extreme points from saturated polynomials.
Conjecture that these are all extreme points with rational inner Cayley transforms.
Provided a characterization of extreme points in the specified function set.
Abstract
We consider the problem of characterizing the extreme points of the set of analytic functions f on the bidisk with positive real part and f(0)=1. If one restricts to those f whose Cayley transform is a rational inner function, one gets a more tractable problem. We construct families of such f that are extreme points and conjecture that these are all such extreme points. These extreme points are constructed from polynomials dubbed saturated, which roughly speaking means they have no zeros in the bidisk and as many zeros as possible on the boundary without having infinitely many zeros.
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.
Extreme points and saturated polynomials
Greg Knese
Washington University in St. Louis
Department of Mathematics
St. Louis, MO 63130
Abstract.
We consider the problem of characterizing the extreme points of the set of analytic functions on the bidisk with positive real part and . If one restricts to those whose Cayley transform is a rational inner function, one gets a more tractable problem. We construct families of such that are extreme points and conjecture that these are all such extreme points. These extreme points are constructed from polynomials dubbed -saturated, which roughly speaking means they have no zeros in the bidisk and as many zeros as possible on the boundary without having infinitely many zeros.
Key words and phrases:
extreme points, polydisk, polydisc, bidisk, bidisc, holomorphic, analytic, intersection multiplicity, two-torus, determinantal representations, transfer functions, bounded analytic functions, inner functions, rational inner functions, stable polynomial, scattering stable polynomial
2010 Mathematics Subject Classification:
Primary: 32A10, Secondary 46A55, 47A57
Partially supported by NSF grant DMS-1363239
Contents
- 1 Introduction
- 2 Proof of McDonald’s characterization of faces
- 3 Preliminaries for Theorems 1.5 and 1.6
- 4 Completion of the proof of Theorem 1.5
- 5 Completion of the proof of Theorem 1.6
- 6 Degree polynomials
- 7 Example of a non-saturated polynomial
- 8 Integrability of perturbations
- 9 Determinantal representations and transfer function realizations
- 10 Acknowledgments
1. Introduction
Let denote the set of holomorphic functions such that . Here is the -dimensional unit polydisk in and is the right half plane in .
The set is a normal family and a convex set. Rudin posed the following natural question in his 1970 ICM address [RudinICM].
What are the extreme points of ?
A complete answer is known only in the case . The extreme points of are the functions
[TABLE]
where , the unit circle. Remarkably, this fact together with the Krein-Milman theorem suffices to prove the Herglotz representation theorem for elements of : for every there is a unique probability measure on such that
[TABLE]
In turn, this fact can be used to prove a variety of spectral theorems.
There is no known characterization of the extreme points of for and we would guess there is not a simple characterization. Every has a Poisson type representation
[TABLE]
where is the Poisson kernel and is a probability measure. However, when , cannot be an arbitrary probability measure; it must satisfy additional moment conditions since is analytic. Specifically, we must have where (resp. ) denotes the set of non-negative (resp. non-positive) integers. One might expect that extreme points of would be represented via measures with “small” support but McDonald has constructed an extreme point whose boundary measure is absolutely continuous with respect to Lebesgue measure on (see [McDonald2]). Not all of the known results are negative in spirit however.
Forelli has a useful necessary condition for to be an extreme point [Forelli]. Let denote the Schur class of the polydisk; the set of holomorphic functions . First, via a Cayley transform we may write
[TABLE]
where and . Forelli has proven that if is reducible in the sense that with non-constant with (but with no assumption on ), then is not an extreme point of . Forelli’s approach actually gives an elementary proof of the characterization of extreme points for the case .
Since the general problem of characterizing extreme points of seems difficult, it seems reasonable to restrict the problem to a more tractable subclass of functions. We shall examine the class
[TABLE]
Inner means for almost every , as . This implies at least away from such that . This class, while very special, is also dense in using the topology of local uniform convergence. (Rudin [FTIP] proves that rational inner functions are dense in and it then follows that is dense in .) Thus, we shall modify our opening question from Rudin.
Which are extreme points of ?
It is proven in Rudin [FTIP] that rational inner functions are of the form
[TABLE]
where
- (1)
has no zeros in , 2. (2)
multidegree at most (the degree in is at most ), and 3. (3)
the reflection of given by
[TABLE]
has no factors in common with .
We say multidegree “at most” above to allow for to have a monomial factor. Since , we get that has multidegree exactly . For this reason it often makes more sense to refer to the multidegree of .
Definition 1.1**.**
We say is scattering stable if it satisfies conditions (1)-(3) above for equal to the multidegree of .
Some simple examples of rational inner functions are
[TABLE]
and corresponding elements of are
[TABLE]
One way to analyze a convex set is to examine its faces. Given an element of a convex set , its face is the union of all line segments in with in the interior of . We set when is an extreme point. McDonald has characterized the faces of as elements of the convex set .
Theorem 1.2** (McDonald [McDonald1]).**
Let which we write as where is a rational inner function, written as above with and multidegree . Then, every element of the face of in is of the form
[TABLE]
where has multidegree at most , satisfies , , and and have no zeros in for some . The face has real dimension at most .
The condition with is just to make in the interior of an appropriate line segment. This theorem does not solve our problem because the condition that and have no zeros in is difficult to work with. Nevertheless, the theorem certainly provides a useful reduction. Indeed, it shows that does not depend on the choice of underlying convex set ( versus ).
The original proof of McDonald involves one variable slices and the Herglotz representation theorem. We shall give a very similar proof that uses only complex analysis (i.e. no measure theory). The number simply counts the real-linear dimension of the set of of multidegree at most satisfying and . In particular, if has no zeros in , then this dimension is exactly since will have no zeros in for small enough. Thus, if has no zeros in then is never an extreme point unless depends on only one variable.
For example, the function in (1.3) is not extreme and we can perturb using any with small enough . In fact, has no zeros in if and only if .
We have been able to prove the following add-on to McDonald’s theorem, which also says that the dimension of is maximal if and only if has no zeros in .
Theorem 1.3**.**
Assume the setup of Theorem 1.2. If vanishes at to order , then vanishes at least to order at .
We can also say something about the homogeneous expansion of . See Theorem 2.2 for details.
Unfortunately, Theorem 1.3 has limitations because order of vanishing is a crude way to count zeros in this setting. Consider the example above. Since has a zero at , so must any valid perturbation . This implies for some . It turns out is actually an extreme point, but it takes additional work to prove this (i.e. to show ).
Our main goal is to prove a theorem which describes a number of extreme points of coming from in the case . The denominators of the ’s appearing in these extreme points have a special property.
Definition 1.4**.**
Let be scattering stable and of bidegree . We say is -saturated if and have common zeros on .
The common zeros of and are counted with multiplicities as in Bézout’s theorem. The number counts all of the common zeros of and on . See [Fischer, Fulton] for more details about intersection multiplicities.
The class of -saturated polynomials is interesting in its own right. In the paper [GK], we gave two related characterizations of -saturated polynomials. One relates to a sums-of-squares formula for scattering stable polynomials. If is scattering stable of bidegree then
[TABLE]
where is sum of squared moduli of polynomials. A scattering stable polynomial is -saturated if and only if the sums of squares terms are unique (see Corollary 13.6 of [GK]).
A second characterization says that a scattering stable polynomial is -saturated if and only if
[TABLE]
for all nonzero satisfying for (see Corollary 6.5 of [GK]). Thus, -saturated polynomials have so many boundary zeros that lower degree polynomials cannot match them (in the above sense).
A simple example of a -saturated polynomial is . Note and share a single zero on but it has multiplicity . This can be computed using the resultant of and with respect to .
Our main theorem suggests a third characterization of -saturated polynomials and constructs a family of extreme points in .
Theorem 1.5**.**
Let be scattering stable and . Let . If is -saturated and is irreducible, then is an extreme point of .
For example, one can conclude the example is an extreme point simply by noticing is -saturated and is irreducible. On the other hand, being -saturated is not sufficient for to be extreme as the example
[TABLE]
shows.
Along the path to proving Theorem 1.5 we have been able to prove a more refined version of Theorem 1.3. Given two polynomials with a common zero , we let denote the intersection multiplicity of at .
Theorem 1.6**.**
Let where is scattering stable. Suppose
[TABLE]
belongs to the face of as in Theorem 1.2. Suppose for some . Then,
[TABLE]
We have been unable to prove the following.
Conjecture 1.7**.**
If is scattering stable, , and is an extreme point of , then is -saturated and is irreducible.
A very modest piece of evidence is the following. See section 6.
Theorem 1.8**.**
Conjecture 1.7 holds if has bidegree .
The reason Theorem 1.8 works out is that if is extreme and depends on both variables, then the associated must have at least one zero on . In the case of degree polynomials, a single zero implies saturation. In Section 7 we present an example of a non-saturated scattering stable polynomial with a zero on and we show that the associated is not extreme. This at least shows that -saturated should not be replaced with having at least one zero on .
One final piece of evidence in favor of Conjecture 1.7 is the following.
Theorem 1.9**.**
Suppose is scattering stable with .
If there exists such that , , , and have no zeros in , then .
Going in the other direction, if is not -saturated then there exists nonzero such that , , , and .
Of course the key thing missing in the last statement is have no zeros in for some small . This theorem requires some machinery from [GK].
In Section 9 we discuss some connections to determinantal representations for stable polynomials and transfer function representations for analytic functions. In particular, we point out that saturated polynomials possess symmetric, contractive determinantal representations, and the corresponding possess symmetric unitary transfer function realizations. These notions are all defined in Section 9.
2. Proof of McDonald’s characterization of faces
In this section we will give a slightly more elementary proof of McDonald’s characterization of faces (Theorem 1.2) for where is rational inner. It is essentially the same proof except we avoid measure theory and gain a little more information and the face of .
We first tackle the one variable case where is a Blaschke product which we may write as for a polynomial having no zeros in (because zeros on get cancelled out) and with . Then, .
Let be in the face corresponding to . This means there exist and analytic such that for . It will be convenient later to write for some holomorphic function . Division by is no loss of generality since this function is non-vanishing in (indeed, by the maximum principle in ). Note that
[TABLE]
Let be the set of zeros of on . Since and since for we see that for all
[TABLE]
as .
By the Schwarz reflection principle, the extend analytically across via the formula which even extends analytically to . The singularities at the are either removable or simple poles. (Without going into too much detail we can give an elementary explanation. The derivative of cannot vanish on because of local mapping properties. Thus, is imaginary-valued and monotone off singularities and this is enough to prove omits an imaginary line segment near singularities. This implies cannot have an essential singularity at any by either the Big Picard theorem or by conformal mapping and the Casorati-Weierstrass theorem. Any poles on must be simple because of local mapping properties of .) Therefore, the are rational and by their symmetry properties we get
[TABLE]
and after some simplification we get
[TABLE]
for . Necessarily, has no poles (because simple poles in the above function are accounted for by the denominator) and hence must be a polynomial. Also, and .
Thus, every element of the face associated to is of the form
[TABLE]
where is a polynomial such that , , has no zeros in , and there exists such that has no zeros in .
Conversely, given satisfying all of the above conditions, are finite Blaschke products, and is a convex combination of as defined above.
This gives the desired characterization of faces in the one variable case.
Next we look at several variables. Write where is scattering stable and has multidegree at most .
Now, if for and for some analytic , then we claim is a polynomial of degree at most with .
We examine slices where . We will use this notation for other functions, not just .
If we verify the hypotheses of the following lemma, then we are finished. The lemma will be proven at the end.
Lemma 2.1**.**
Let be analytic. If for each , is a (one variable) polynomial of degree at most satisfying , then is a ( variable) polynomial of multidegree at most and .
Fix . Since has multidegree at most , has degree at most and we can calculate that
[TABLE]
Then, for a choice of
[TABLE]
The point is that we are matching the earlier formulation of the Cayley transform. However, in this case it is possible for and to have common zeros, necessarily on . Let be a greatest common divisor of and . We can arrange for by multiplying by an appropriate constant since all of the roots of will be on . Let which has degree at most .
Then, and . We can now apply the one variable result to see that is a polynomial of degree and is equal to its reflection which means
[TABLE]
and this implies the hypotheses of Lemma 2.1, proven below. This lemma can essentially by found in McDonald [McDonald1] but we include a proof for convenience.
Proof of Lemma 2.1.
We write out the power series , so that
[TABLE]
and we see that for , we have and therefore for since this is an identically zero trigonometric polynomial.
The reflection condition on implies for
[TABLE]
By matching Fourier coefficients, we see that if for some we have . Thus, has multidegree at most and the sum on the right can be reindexed as
[TABLE]
(where if undefined) so that . This exactly means if we examine coefficients. ∎
This proves McDonald’s characterization of faces with the additional information that vanishes to at least the same order at a point of as . Using work of [GK] it is possible to show vanishes to at least the same order as at a point of .
Proof of Theorem 1.3.
We may assume . Theorem 14.1 of [GK] says that if has no zeros in and vanishes at to order , meaning
[TABLE]
where the are homogeneous of total degree and , then has no zeros in . Then, the order of vanishing of at equals because and . (Geometrically, the variety has no radial tangents on .)
Note both and have no zeros in . Thus, if vanishes to order at , then vanishes to order at . In turn, vanishes to at least order , and then so does , and we then conclude the order of vanishing of at is at least . ∎
If we use an additional result from [GK] we can say something about the bottom homogeneous term of at .
Proposition 14.5 of [GK] says that if has no zeros in and vanishes to order at then writing homogeneous expansions:
[TABLE]
we have that is a unimodular multiple of , say for some . (It will be convenient to take a square root of later.) Set . It is not hard to prove as non-tangentially in . The details are in Proposition 14.3 of [GK].
We also need to write out the homogeneous expansion of
[TABLE]
By the above work, vanishes at least to order at . It is possible that vanishes to higher order, so we allow for .
We assume for simplicity that have no zeros in ; this is true after rescaling . The following inequalities hold
[TABLE]
(see Lemma 14.4 of [GK]). We can rewrite this as
[TABLE]
Let and set . For small enough and since is a unimodular multiple of , vanishes to order at least in . This must also hold for the right hand side of (2.1) which implies
[TABLE]
which implies for some .
If , then the constant is of the form for . We summarize the above.
Theorem 2.2**.**
Assume the setup of Theorem 1.2. Suppose vanishes at to order . Let in the sense of a non-tangential limit. Assume . Then the bottom homogeneous terms of at , say , satisfy
[TABLE]
for some .
This result is strong enough to prove from the introduction is extreme. Note that for we have
[TABLE]
[TABLE]
which means . Then, any perturbation of must be of the form where and
[TABLE]
which is not a multiple of unless .
The theorem says nothing when and this is for good reason. Consider
[TABLE]
For we have and is not extreme:
[TABLE]
3. Preliminaries for Theorems 1.5 and 1.6
McDonald’s theorem reduces the possibilities for the face of a given . If is built out of a -saturated polynomial, we can limit ’s face further.
First, let us recall the Schur-Cohn test.
Theorem 3.1** (Schur-Cohn test).**
Let and write . Define
[TABLE]
Then, has no zeros in if and only if .
Actually this result is due to Schur while Cohn proved a generalization (see [PtakYoung]).
We can apply this to bivariate polynomials of bidegree as follows. Write . Then, where . Note that we use for the coordinates in instead of .
Define
[TABLE]
Note that for , is almost a direct analogue of above; it differs by a factor of . This gets cancelled out in the Schur-Cohn matrix calculation.
Indeed, has no zeros in if and only if for all .
The following formula holds for
[TABLE]
Lemma 3.2**.**
If has no zeros in or no zeros in , then for all .
Proof.
If has no zeros in , then the polynomial has no zeros in for . We can then form analogues of corresponding to which we label . The dependence on is evidently continuous. Then, on . If we send , then by continuity.
If has no zeros in , then has no zeros in for . We can again form analogues, say , of depending on for which on . Then, send to see on . ∎
Lemma 3.3**.**
If is scattering stable, then has no zeros in .
Proof.
For fixed , has no zeros in . By Hurwitz’s theorem, if we send to , we see that either has no zeros in or is identically zero. In the latter case, divides and hence also since . Thus, is non-vanishing on and by symmetry on . ∎
Lemma 3.4**.**
Let and form as above. Then, for all but finitely many if and only if has no zeros in where consists of finitely many points in and finitely many “vertical” lines with .
We can rule out vertical lines if we assume and have no common factors.
We note that the condition for all but finitely many is equivalent to saying and is not identically zero.
Proof.
By the Schur-Cohn test, for all but finitely many if and only if has no zeros in for all but finitely many . The latter condition means there exists a finite set such that has no zeros in except for when . By Hurwitz’s theorem, if then either has no zeros in or is identically zero. In the latter case, divides which means vanishes on a vertical line. In the former case, has no zeros in (although it could have zeros in ). Thus, the condition for all but finitely many is equivalent to having no zeros in where consists of finitely many vertical lines and finitely many points of . ∎
Lemma 3.5**.**
Assume has bidegree . Let be the resultant of and with respect to the variable . Then, on
[TABLE]
where are defined in (3.1). In particular, the polynomials and have a common factor involving if and only if for all .
Proof.
This proof is from [GW] (specifically Lemma 2.1.3 of that paper, which says their proof is inspired by similar arguments for Bezoutians in [LT], Theorem 1 Section 13.3).
Let and . Then,
[TABLE]
is the resultant or Sylvester matrix of and with respect to and its determinant is the resultant of and with respect to . Since and commute, we can compute
[TABLE]
and on this agrees with . Since is a set of uniqueness, this determinant is identically zero on if and only if the resultant which by standard properties of the resultant holds if and only if and have a common factor depending on . ∎
We shall begin the proofs of Theorem 1.5 and Theorem 1.6 simultaneously and then diverge at a certain point.
Let be in with associated scattering stable polynomial .
By McDonald’s characterization, points of the faces of are associated to satisfying: , , , and there is an interval with such that for , has no zeros in . For our purposes, we can shrink the interval to be symmetric about [math] and rescale so that have no zeros in and in fact are scattering stable. This is because the resultants associated to will not be identically zero and thus so will those of , for small.
Write and form
[TABLE]
All of the matrix functions in the rest of this proof will be functions of , so we will omit the evaluations such as and simply write . Since are scattering stable, for all but finitely many .
By the matrix Fejér-Riesz lemma, we can factor
[TABLE]
where are matrix polynomials of degree at most with non-zero for . We can also factor
[TABLE]
where is a matrix polynomial of degree at most and is non-singular whenever .
Let be the resultant of and with respect to , and let be the resultants of with respect to (for the choices of and ). The number of roots of the resultant on equals the number of common roots of and on since has no zeros on by Lemma 3.3. More precisely, the multiplicity of a given root of , say , counts the number of common roots of and on the line . Note that and on .
The left side of (3.3) is
[TABLE]
and averaging over and yields
[TABLE]
on . Setting we have on away from poles of . But, this equation shows are bounded on and so cannot have any poles. So, are analytic on since we already know has no poles in .
We conclude that on , . Let denote the number of common zeros of two polynomials on the line counting multiplicities. We have just proved the following.
Proposition 3.6**.**
Suppose is scattering stable, and suppose satisfies , as well as are scattering stable. Then, for
[TABLE]
Moreover, both intersection multiplicities are even.
The last statement follows from the formula which implies that zeros on occur with even multiplicity.
If the common zeros of and on had distinct -coordinates (or -coordinates) then we would be finished with Theorem 1.6.
At this stage the reader can jump to the next section to finish the proof of Theorem 1.5 or Section 5 to finish the proof of Theorem 1.6.
4. Completion of the proof of Theorem 1.5
Assume now that is -saturated and is irreducible. Then, the resultant of and , , has roots on and these must be all of its roots since has degree at most . This implies has roots on and therefore has roots on . These must be all of the roots of since is and of degree at most . Thus, is invertible in and . Also, is an matrix polynomial of degree at most , which implies has degree at most . Since has roots on , we can conclude that has all of its roots on . Thus, is invertible at [math].
At the same time,
[TABLE]
is analytic on since is invertible in . This implies are analytic on the Riemann sphere, which implies are constant matrices.
Subtract equation (3.3) with from to obtain
[TABLE]
Now we consider the matrices obtained from where is a real parameter. The matrices we get are
[TABLE]
Unless , there will be a value of such that
[TABLE]
is singular since all matrices involved are self-adjoint. For such , is identically zero on and by Lemma 3.5 this implies and have a common factor. Such a common factor must be proper (meaning it has strictly lower degree in one of the variables).
Indeed, if it is not proper, then divides or vice versa. The latter possibility is excluded by the fact . In the former case, for some non-constant polynomial with . (Note we could not immediately rule this case out based on degrees because only has degree at most .) Then, is reducible contrary to our assumption. However, a proper common factor of and implies a proper factor of , which again contradicts irreducibility of .
We are left with the possibility . By (4.1) we have , which implies
[TABLE]
for all . By (3.2), this implies for , that the following expression does not depend on
[TABLE]
The coefficient of is therefore identically zero yielding
[TABLE]
for . Since and , if we replace with and multiply through by we get
[TABLE]
for . As this is a polynomial in the identity holds for all , not just . Since is assumed to be irreducible, either:
- (1)
divides or 2. (2)
divides .
In addressing these two cases it is useful to point out that has bidegree exactly . This is because and the reflection of at the degree is which implies the coefficient of in is .
Case (1) implies does not depend on which is only possible if . But, being irreducible means or by the fundamental theorem of algebra. Having is not allowed and when we automatically have .
Case (2) implies is a multiple of since has degree at most and has degree exactly . Since this is impossible unless .
In all cases . This means the face of is the singleton and proves is an extreme point.
5. Completion of the proof of Theorem 1.6
We pick up where we left off in Section 3. Proposition 3.6 shows the number of common zeros of and on is less than or equal to the number of common zeros of and on . However, since the resultant is a global object we have only proven that the number of zeros on “vertical” lines in increases. To fix this we cannot do a linear change of variables as is often done when using the resultant to count common zeros (as in [Fischer] for instance). Instead we perform a more complicated change of variables and use a different (but equivalent) definition of intersection multiplicity.
First, recall that the intersection multiplicity of at a common zero is equal to
[TABLE]
Here is the localization of at , namely the ring of rational functions with denominators non-vanishing at . Also, denotes the ideal generated by within the local ring . This definition of intersection multiplicity is used in [Fulton].
Now, suppose have a common zero on which we assume without loss of generality is . The map
[TABLE]
is an isomorphism of the local ring onto itself since it has inverse . This implies that
[TABLE]
This applies to as well.
Since is scattering stable, so is . Indeed, has no zeros in since maps the bidisk into itself. Also,
[TABLE]
If and had a nontrivial common factor say , then
[TABLE]
One can then argue that is either already a polynomial or there exists such that , , are polynomials. Either case implies and have a non-trivial common factor contrary to assumption.
The same arguments apply to . Therefore, by Proposition 3.6
[TABLE]
Finally, we can choose so that and have a single common zero on the line namely . Then, the above intersection multiplicities count the multiplicity at just and these agree with the multiplicities associated to and as mentioned in equation (5.1).
This proves
[TABLE]
which proves Theorem 1.6.
A corollary of the proof is the following fundamental fact.
Corollary 5.1**.**
If is scattering stable then for , is even.
This follows because the intersection multiplicities in Proposition 3.6 are even. We gave a detailed proof of this corollary in Appendix C of [GK].
6. Degree polynomials
Proof of Theorem 1.8.
Suppose is scattering stable, has degree , and is an extreme point.
We can normalize so that . (We cannot normalize so that because has reflection not .)
Since , has the form ; . We can apply a rotation in each of the variables and replace with the polynomial ; we will drop the absolute values on and assume . This change of variables does not change extremality.
For to be stable we must have . Since is extreme, must have a zero on . This forces and the zero is . Zeros on occur with even multiplicity and this automatically implies is -saturated. (Thus, in this low degree situation a single zero forces the polynomial to be saturated.)
We need to show is irreducible. We have
[TABLE]
If this were reducible it would factor into . We will omit the details but the only way this can happen is if and . We can normalize so . Then,
[TABLE]
while
[TABLE]
where . Then, one can directly check
[TABLE]
contradicting extremality of . ∎
The next theorem is an amusing consequence of the above proof.
Theorem 6.1**.**
Let be scattering stable, , and . Set and for ,
[TABLE]
Then, there exists such that is not an extreme point of .
I. Klep and J. Pascoe have found an example which shows this theorem does not hold more generally.
Proof.
Let be scattering stable, , and . We claim some as in the theorem statement is not extreme. By Theorem 1.8 if is not -saturated, then is never extreme. So, we assume is -saturated.
If we follow the proof of Theorem 1.8 above, we see that if we set then which means is not extreme. ∎
7. Example of a non-saturated polynomial
Let which is scattering stable, has degree , and has a single zero on at . The multiplicity of this zero is , so is not saturated (which would require boundary zeros counting multiplicity). One can compute that this multiplicity is using the resultant (with respect to ) of and which is
[TABLE]
Next, we claim that is not extreme. To do this we must perturb with satisfying , , and stay stable. Let . We claim has no zeros in for . By the Schur-Cohn test we check when the following expression is non-negative on
[TABLE]
This can be rewritten as
[TABLE]
which is non-negative on for . Thus, for such , has no zeros in except for finitely many points on and finitely many vertical lines by Lemma 3.4. We can rule out vertical lines since
[TABLE]
is irreducible (and if had a factor with then so would and so would ). By Lemma 3.3 has no zeros in . For , the number of zeros of in depends continuously on by the argument principle and hence must be constant. We can show has no zeros in directly by noting for . Therefore, has no zeros in for . This proves is not extreme.
The endpoints of the line segment and are
[TABLE]
[TABLE]
Now, has two zeros on ; . Each has multiplicity 2 which implies is -saturated. Since is irreducible we conclude that is an extreme point by Theorem 1.5.
Next, has a single zero on ; . It occurs with multiplicity which implies is -saturated. As with , we see that the analogue of , namely , is also an extreme point.
Then,
[TABLE]
expresses as a convex combination of extreme points.
8. Integrability of perturbations
In this section we prove Theorem 1.9. We need to use several definitions and results from [GK].
Definition 8.1**.**
If is scattering stable and are vector polynomials satisfying
[TABLE]
then we call an Agler pair.
For this definition, need not have any relation to the bidegree of . One can in fact show , but this is not important for now. Later we do look at Agler pairs with minimal dimensions.
It is proven in [CW, GKpnoz] that has at least one Agler pair. (These vector polynomials are closely related to so-called Agler kernels for more general bounded analytic functions. See [BK].)
Lemma 7.3 of [GK] proves that the values of on are the same for all Agler pairs. Therefore, the following proposition does not depend on the particular Agler pair.
Proposition 8.2**.**
Suppose is scattering stable and is an Agler pair for .
Given , if and only if there is a constant such that
[TABLE]
holds on .
Proof.
Lemma 7.3 of [GK] proves explicit formulas for on in terms of . Corollary 7.4 of [GK] proves that the given inequality is equivalent to however it is stated using said explicit formulas from Lemma 7.3 (so that the corollary does not need to reference Agler pairs). ∎
The first part of Theorem 1.9 is contained in the following proposition.
Proposition 8.3**.**
Suppose is scattering stable, , and are scattering stable. Let . If then . In particular, .
Proof.
We can rescale so that are scattering stable. Let be Agler pairs for . Since
[TABLE]
it follows that for and , the pair is an Agler pair for . This comes from averaging the above formula over and .
Note that , on . These bounds along with Prop 8.2 automatically give that implies for .
Since we conclude that and hence . ∎
For any scattering stable polynomial with degree at most define the subspace
[TABLE]
Theorem B of [GK] states that
[TABLE]
where is the number of common zeros of and on counted with multiplicities. We can then conclude the following.
Corollary 8.4**.**
Under the assumptions of Proposition 8.3 we have
[TABLE]
This also follows from Theorem 1.6. As mentioned in the introduction is -saturated if and only if (see Corollary 6.5 of [GK]). We use this fact in the proof of the second half of Theorem 1.9 which is stated in the following proposition.
Proposition 8.5**.**
Suppose is scattering stable and not -saturated. Then, there exists nonzero with and .
Proof.
Since is not -saturated, there exists , . We can assume does not divide because otherwise and we could divide out all of the factors of if necessary.
Let be the reflection of at degree . Set . Note is nonzero because does not divide . Since on , we have . Therefore, . The other properties of are straightforward. ∎
9. Determinantal representations and transfer function realizations
In this section we discuss a number of formulas which are known to hold for scattering stable and corresponding in the case of two variables. When is saturated it turns out the formulas have a special form. The techniques of this section are well-known and this section is more of a supplement to the paper. See [Drexel, GKdv] for related results.
It is a well-established consequence of the sums of squares formula(1.4) that if is scattering stable of bidegree then there exists a unitary where is such that
[TABLE]
Here
[TABLE]
We call the formula (9.1) a unitary transfer function realization of .
Since has denominator , we see that divides . But, has bidegree at most we must have . Thus, has a contractive determinantal representation; so-called because is a contractive matrix. The matrix is not just contractive; it is also a rank one perturbation of a unitary matrix. Indeed, the matrices
[TABLE]
are unitary for . This follows from
[TABLE]
which implies
[TABLE]
and this is zero when .
Notice now that the numerator of is
[TABLE]
where adj denotes the classical adjoint or adjugate matrix. Observe that
[TABLE]
The second line used the “rank one matrix update formula”
[TABLE]
We conclude that has a unitary determinantal representation whenever . This gives a general way to describe the denominators of elements of .
The matrix can be chosen with special structure when is saturated.
Theorem 9.1**.**
If is -saturated, then possesses a symmetric unitary transfer function realization; i.e. in (9.1) can be chosen to be a unitary and symmetric: and . In particular, has a determinantal representation using a symmetric contraction (which is a rank one perturbation of a symmetric unitary) and has a symmetric unitary determinantal representation.
This theorem can be subdivided into two parts.
Proposition 9.2**.**
If is -saturated with then there exist of bidegrees at most such that
[TABLE]
and
[TABLE]
This follows directly from Theorem 1.1.5 of [GKpnoz] and Corollary 13.6 of [GK]. The condition in (9.4) can be replaced with the weaker conditions , . (An argument is given in the proof of Theorem 1.1.5 of [GKpnoz]. It uses the fact that any symmetric unitary can be factored as where is unitary.)
Proposition 9.3**.**
If is scattering stable and possesses a sums of squares decomposition as in (9.3) which in addition satisfies (9.4), then satisfies (9.1) where may be chosen to be symmetric.
Symmetry in the sums of squares formulas does not characterize saturated polynomials.
Example 9.4**.**
Let —a non-saturated polynomial. Then, and (9.3) holds with
[TABLE]
where and is the reflection at degree of this one variable polynomial. Evidently, .
It may be possible to use the characterization of all sums of squares decompositions (9.3) given in [GK] to characterize which have decompositions satisfying (9.4).
We now prove Proposition 9.3. Unfortunately, the only way we see to give a comprehensible proof is to rehash a number of standard arguments (including the proof of (9.1)).
Proof of Proposition 9.3.
Initially we do not need (9.4).
Equation (9.3) can be polarized to the following form
[TABLE]
by the polarization theorem for holomorphic functions. We now use what is called a lurking isometry argument. Let . Define
[TABLE]
Then, (9.5) rearranges into . The map
[TABLE]
extends to a well-defined linear isometry from the span of the elements on the left to the span of the elements on the right (as varies over ). It turns out that and this implies the map above actually extends uniquely to a unitary. This follows from the construction of in [GKpnoz]. However, as this fact is difficult to retrieve from [GKpnoz] without introducing too much machinery we proceed without it. The map (9.6) can always be extended to some unitary; we would like to show that if satisfy (9.4) then we can extend to a symmetric unitary.
So, suppose (9.4) holds and notice that , with the reflection performed at the degree . We introduce the orthogonal complements of the spans of the left and right sides in (9.6)
[TABLE]
Notice that iff because we can reflect the equation to obtain . Let be an orthonormal basis for . Then, is an orthonormal basis for . We can then extend the map (9.6) to all of by mapping and extending linearly. Note that we are not saying for a general . We get an unitary matrix with the property
[TABLE]
Applying the reflection operation at the degree and conjugation reveals
[TABLE]
Therefore, .
Write where is ; the sizes of are then determined. Letting we have
[TABLE]
where is given in (9.2). The second line implies which implies via the first line. ∎
10. Acknowledgments
I would like to thank Mike Jury, John McCarthy, and James Pascoe for useful discussions. Thanks to Pascoe and Klep for disproving a conjectured generalization of Theorem 6.1.
References
