75 research outputs found

    The matricial relaxation of a linear matrix inequality

    Full text link
    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. For our "matrix variable" relaxation a positive answer to (Q1) is equivalent to the existence of matrices V_j such that L_2(x)=V_1^* L_1(x) V_1 + ... + V_k^* L_1(x) V_k. As for (Q2) we show that, up to redundancy, L_1 and L_2 are unitarily equivalent. Such algebraic certificates are typically called Positivstellensaetze and the above are examples of such for linear polynomials. The paper goes on to derive a cleaner and more powerful Putinar-type Positivstellensatz for polynomials positive on a bounded set of the form {X | L(X) PsD}. An observation at the core of the paper is that the relaxed LMI domination problem is equivalent to a classical problem. Namely, the problem of determining if a linear map from a subspace of matrices to a matrix algebra is "completely positive".Comment: v1: 34 pages, v2: 41 pages; supplementary material is available in the source file, or see http://srag.fmf.uni-lj.si

    Computer simplification of formulas in linear systems theory

    Full text link

    Maximal quadratic modules on *-rings

    Full text link
    We generalize the notion of and results on maximal proper quadratic modules from commutative unital rings to \ast-rings and discuss the relation of this generalization to recent developments in noncommutative real algebraic geometry. The simplest example of a maximal proper quadratic module is the cone of all positive semidefinite complex matrices of a fixed dimension. We show that the support of a maximal proper quadratic module is the symmetric part of a prime \ast-ideal, that every maximal proper quadratic module in a Noetherian \ast-ring comes from a maximal proper quadratic module in a simple artinian ring with involution and that maximal proper quadratic modules satisfy an intersection theorem. As an application we obtain the following extension of Schm\" udgen's Strict Positivstellensatz for the Weyl algebra: Let cc be an element of the Weyl algebra W(d)\mathcal{W}(d) which is not negative semidefinite in the Schr\" odinger representation. It is shown that under some conditions there exists an integer kk and elements r1,...,rkW(d)r_1,...,r_k \in \mathcal{W}(d) such that j=1krjcrj\sum_{j=1}^k r_j c r_j^\ast is a finite sum of hermitian squares. This result is not a proper generalization however because we don't have the bound kdk \le d.Comment: 11 page

    Sums of hermitian squares and the BMV conjecture

    Full text link
    Recently Lieb and Seiringer showed that the Bessis-Moussa-Villani conjecture from quantum physics can be restated in the following purely algebraic way: The sum of all words in two positive semidefinite matrices where the number of each of the two letters is fixed is always a matrix with nonnegative trace. We show that this statement holds if the words are of length at most 13. This has previously been known only up to length 7. In our proof, we establish a connection to sums of hermitian squares of polynomials in noncommuting variables and to semidefinite programming. As a by-product we obtain an example of a real polynomial in two noncommuting variables having nonnegative trace on all symmetric matrices of the same size, yet not being a sum of hermitian squares and commutators.Comment: 21 pages; minor changes; a companion Mathematica notebook is now available in the source fil

    On the class SI of J-contractive functions intertwining solutions of linear differential equations

    Get PDF
    In the PhD thesis of the second author under the supervision of the third author was defined the class SI of J-contractive functions, depending on a parameter and arising as transfer functions of overdetermined conservative 2D systems invariant in one direction. In this paper we extend and solve in the class SI, a number of problems originally set for the class SC of functions contractive in the open right-half plane, and unitary on the imaginary line with respect to some preassigned signature matrix J. The problems we consider include the Schur algorithm, the partial realization problem and the Nevanlinna-Pick interpolation problem. The arguments rely on a correspondence between elements in a given subclass of SI and elements in SC. Another important tool in the arguments is a new result pertaining to the classical tangential Schur algorithm.Comment: 46 page

    Sign patterns for chemical reaction networks

    Full text link
    Most differential equations found in chemical reaction networks (CRNs) have the form dx/dt=f(x)=Sv(x)dx/dt=f(x)= Sv(x), where xx lies in the nonnegative orthant, where SS is a real matrix (the stoichiometric matrix) and vv is a column vector consisting of real-valued functions having a special relationship to SS. Our main interest will be in the Jacobian matrix, f(x)f'(x), of f(x)f(x), in particular in whether or not each entry f(x)ijf'(x)_{ij} has the same sign for all xx in the orthant, i.e., the Jacobian respects a sign pattern. In other words species xjx_j always acts on species xix_i in an inhibitory way or its action is always excitatory. In Helton, Klep, Gomez we gave necessary and sufficient conditions on the species-reaction graph naturally associated to SS which guarantee that the Jacobian of the associated CRN has a sign pattern. In this paper, given SS we give a construction which adds certain rows and columns to SS, thereby producing a stoichiometric matrix S^\widehat S corresponding to a new CRN with some added species and reactions. The Jacobian for this CRN based on S^\hat S has a sign pattern. The equilibria for the SS and the S^\hat S based CRN are in exact one to one correspondence with each equilibrium ee for the original CRN gotten from an equilibrium e^\hat e for the new CRN by removing its added species. In our construction of a new CRN we are allowed to choose rate constants for the added reactions and if we choose them large enough the equilibrium e^\hat e is locally asymptotically stable if and only if the equilibrium ee is locally asymptotically stable. Further properties of the construction are shown, such as those pertaining to conserved quantities and to how the deficiencies of the two CRNs compare.Comment: 23 page

    A convex polynomial that is not sos-convex

    Full text link
    A multivariate polynomial p(x)=p(x1,...,xn)p(x)=p(x_1,...,x_n) is sos-convex if its Hessian H(x)H(x) can be factored as H(x)=MT(x)M(x)H(x)= M^T(x) M(x) with a possibly nonsquare polynomial matrix M(x)M(x). It is easy to see that sos-convexity is a sufficient condition for convexity of p(x)p(x). Moreover, the problem of deciding sos-convexity of a polynomial can be cast as the feasibility of a semidefinite program, which can be solved efficiently. Motivated by this computational tractability, it has been recently speculated whether sos-convexity is also a necessary condition for convexity of polynomials. In this paper, we give a negative answer to this question by presenting an explicit example of a trivariate homogeneous polynomial of degree eight that is convex but not sos-convex. Interestingly, our example is found with software using sum of squares programming techniques and the duality theory of semidefinite optimization. As a byproduct of our numerical procedure, we obtain a simple method for searching over a restricted family of nonnegative polynomials that are not sums of squares.Comment: 15 page

    Applications of Hilbert Module Approach to Multivariable Operator Theory

    Full text link
    A commuting nn-tuple (T1,,Tn)(T_1, \ldots, T_n) of bounded linear operators on a Hilbert space \clh associate a Hilbert module H\mathcal{H} over C[z1,,zn]\mathbb{C}[z_1, \ldots, z_n] in the following sense: C[z1,,zn]×HH,(p,h)p(T1,,Tn)h,\mathbb{C}[z_1, \ldots, z_n] \times \mathcal{H} \rightarrow \mathcal{H}, \quad \quad (p, h) \mapsto p(T_1, \ldots, T_n)h,where pC[z1,,zn]p \in \mathbb{C}[z_1, \ldots, z_n] and hHh \in \mathcal{H}. A companion survey provides an introduction to the theory of Hilbert modules and some (Hilbert) module point of view to multivariable operator theory. The purpose of this survey is to emphasize algebraic and geometric aspects of Hilbert module approach to operator theory and to survey several applications of the theory of Hilbert modules in multivariable operator theory. The topics which are studied include: generalized canonical models and Cowen-Douglas class, dilations and factorization of reproducing kernel Hilbert spaces, a class of simple submodules and quotient modules of the Hardy modules over polydisc, commutant lifting theorem, similarity and free Hilbert modules, left invertible multipliers, inner resolutions, essentially normal Hilbert modules, localizations of free resolutions and rigidity phenomenon. This article is a companion paper to "An Introduction to Hilbert Module Approach to Multivariable Operator Theory".Comment: 46 pages. This is a companion paper to arXiv:1308.6103. To appear in Handbook of Operator Theory, Springe
    corecore