For a collection of reproducing kernels k which includes those for the Hardy
space of the polydisk and ball and for the Bergman space, k is a complete Pick
kernel if and only if the multiplier algebra of the Hilbert space H^2(k)
associated to k has the Douglas property. Consequences for solving the operator
equation AX=Y are examined.
Given linear matrix inequalities (LMIs) L_1 and L_2, it is natural to ask:
(Q1) when does one dominate the other, that is, does L_1(X) PsD imply L_2(X)
PsD? (Q2) when do they have the same solution set? Such questions can be
NP-hard. This paper describes a natural relaxation of an LMI, based on
substituting matrices for the variables x_j. With this relaxation, the
domination questions (Q1) and (Q2) have elegant answers, indeed reduce to
constructible semidefinite programs. Assume there is an X such that L_1(X) and
L_2(X) are both PD, and suppose the positivity domain of L_1 is bounded.
The (matrical) solution set of a Linear Matrix Inequality (LMI) is a convex
basic non-commutative semi-algebraic set. The main theorem of this paper is a
converse, a result which has implications for both semidefinite programming and
systems engineering. For p(x) a non-commutative polynomial in free variables x=
(x1, ... xg) we can substitute a tuple of symmetric matrices X= (X1, ... Xg)
for x and obtain a matrix p(X). Assume p is symmetric with p(0) invertible, let
Ip denote the set {X: p(X) is an invertible matrix}, and let Dp denote the
component of Ip containing 0.