Polynomials In Noncommuting Variables Research Articles

Norms on complex matrices induced by random vectors

AbstractWe introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. As a consequence, we obtain a generalization of Hunter’s positivity theorem for the complete homogeneous symmetric polynomials.

Dimension-Free Entanglement Detection in Multipartite Werner States

Werner states are multipartite quantum states that are invariant under the diagonal conjugate action of the unitary group. This paper gives a complete characterization of their entanglement that is independent of the underlying local Hilbert space: for every entangled Werner state there exists a dimension-free entanglement witness. The construction of such a witness is formulated as an optimization problem. To solve it, two semidefinite programming hierarchies are introduced. The first one is derived using real algebraic geometry applied to positive polynomials in the entries of a Gram matrix, and is complete in the sense that for every entangled Werner state it converges to a witness. The second one is based on a sum-of-squares certificate for the positivity of trace polynomials in noncommuting variables, and is a relaxation that involves smaller semidefinite constraints.

Norms on complex matrices induced by complete homogeneous symmetric polynomials

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. Our norms enjoy many desirable analytic and algebraic properties, such as an elegant determinantal interpretation and the ability to distinguish certain graphs that other matrix norms cannot. Furthermore, they give rise to new dimension-independent tracial inequalities. Their potential merits further investigation.

Symmetric polynomials in free associative algebras

By a result of Margarete Wolf in 1936, we know that the algebra $K\langle X_d\rangle^{Sym(d)}$ of symmetric polynomials in noncommuting variables is not finitely generated. In 1984, Koryukin proved that if we equip the homogeneous component of degree $n$ with the additional action of $Sym(n)$ by permuting the positions of the variables, then the algebra of invariants $K\langle X_d\rangle^G$ of every reductive group $G$ is finitely generated. First, we make a short comparison between classical invariant theory of finite groups and its noncommutative counterpart. Then, we expose briefly the results of Wolf. Finally, we present the main result of our paper, which is, over a field of characteristic 0 or of characteristic $p>d$, the algebra $K\langle X_d\rangle^{Sym(d)}$ with the action of Koryukin is generated by the elementary symmetric polynomials.

Optimization Over Trace Polynomials

Motivated by recent progress in quantum information theory, this article aims at optimizing trace polynomials, i.e., polynomials in noncommuting variables and traces of their products. A novel Positivstellensatz certifying positivity of trace polynomials subject to trace constraints is presented, and a hierarchy of semidefinite relaxations converging monotonically to the optimum of a trace polynomial subject to tracial constraints is provided. This hierarchy can be seen as a tracial analog of the Pironio, Navascu\'es and Ac\'in scheme [New J. Phys., 2008] for optimization of noncommutative polynomials. The Gelfand-Naimark-Segal (GNS) construction is applied to extract optimizers of the trace optimization problem if flatness and extremality conditions are satisfied. These conditions are sufficient to obtain finite convergence of our hierarchy. The results obtained are applied to violations of polynomial Bell inequalities in quantum information theory. The main techniques used in this paper are inspired by real algebraic geometry, operator theory, and noncommutative algebra.

Sparse noncommutative polynomial optimization

This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxations for eigenvalue and trace optimization is provided. This hierarchy is a noncommutative analogue of results due to Lasserre [SIAM J. Optim. 17(3) (2006), pp. 822--843] and Waki et al. [SIAM J. Optim. 17(1) (2006), pp. 218--242]. The Gelfand-Naimark-Segal (GNS) construction is applied to extract optimizers if flatness and irreducibility conditions are satisfied. Among the main techniques used are amalgamation results from operator algebra. The theoretical results are utilized to compute lower bounds on minimal eigenvalue and trace of noncommutative polynomials from the literature.

Operator algebras of monomial ideals in noncommuting variables

We study operator algebras arising from monomial ideals in the ring of polynomials in noncommuting variables, through the apparatus of subproduct systems and C*-correspondences. We provide a full comparison amongst the related operator algebras. For our analysis we isolate a partially defined dynamical system, to which we refer as the quantised dynamics of the monomial ideal. In addition we revisit several previously considered constructions. These include Matsumoto's subshift C*-algebras, as well as the tensor and the Pimsner algebras associated with dynamical systems or graphs. We sort out the various relations by giving concrete conditions and counterexamples that orientate the operator algebras of our context. It appears that the boundary C*-algebras do not arise as the quotient with the compact operators unconditionally. We establish a dichotomy to this effect by examining the resulting tensor algebras. We identify their boundary representations, we analyse their C*-envelopes, and we give criteria for hyperrigidity. Moreover we completely classify them in terms of the data provided by the monomial ideals. For tensor algebras of C*-correspondences and bounded isomorphisms this is achieved up to the level of local conjugacy (in the sense of Davidson and Roydor) for the quantised dynamics. For tensor algebras of subproduct systems and algebraic isomorphisms this is achieved up to the level of equality of monomial ideals modulo permutations of the variables. In the process we accomplish more in different directions. Most notably we show that tensor algebras form a complete invariant for isomorphic (resp. similar) subproduct systems of homogeneous ideals up to isometric (resp. bounded) isomorphisms. The results on local conjugacy are obtained via an alternative proof of the breakthrough result of Davidson and Katsoulis on piecewise conjugate systems. For our purposes we use appropriate compressions of the Fock representation. We then apply this alternative proof locally for the partially defined quantised dynamics. In this way we avoid the topological graphs machinery and pave the way for further applications. These include operator algebras of dynamical systems over commuting contractions or over row commuting contractions.

Rational sums of hermitian squares of free noncommutative polynomials

In this paper we consider polynomials in noncommuting variables that admit sum of hermitian squares and commutators decompositions. We recall algorithms for finding decompositions of this type that are based on semidefinite programming. The main part of the article investigates how to find such decomposition with rational coefficients if the original polynomial has rational coefficients. We show that the numerical evidence, obtained by the Gram matrix method and semidefinite programming, which is usually an almost feasible point, can be frequently tweaked to obtain an exact certificate using rational numbers. In the presence of Slater points, the Peyrl-Parrilo rounding and projecting method applies. On the other hand, in the absence of strict feasibility, a variant of the facial reduction is proposed to reduce the size of the semidefinite program and to enforce the existence of Slater points. All these methods are implemented in our open source computer algebra package NCSOStools. Throughout the paper many worked out examples are presented to illustrate our results.

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials

This paper presents an algorithm and its implementation in the software package NCSOStools for finding sums of Hermitian squares and commutators decompositions for polynomials in noncommuting variables. The algorithm is based on noncommutative analogs of the classical Gram matrix method and the Newton polytope method, which allows us to use semidefinite programming. Throughout the paper several examples are given illustrating the results.

A local-global principle for linear dependence of noncommutative polynomials

A set of polynomials in noncommuting variables is called locally linearly dependent if their evaluations at tuples of matrices are always linearly dependent. By a theorem of Camino, Helton, Skelton and Ye, a finite locally linearly dependent set of polynomials is linearly dependent. In this short note an alternative proof based on the theory of polynomial identities is given. The method of the proof yields generalizations to directional local linear dependence and evaluations in general algebras over fields of arbitrary characteristic. A main feature of the proof is that it makes it possible to deduce bounds on the size of the matrices where the (directional) local linear dependence needs to be tested in order to establish linear dependence.

NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials

NCSOStools is a Matlab toolbox for • symbolic computation with polynomials in noncommuting (NC) variables; • constructing and solving sum of Hermitian squares (with commutators) programs for polynomials in NC variables. It can be used in combination with semidefinite programming software, such as SeDuMi, SDPA or SDPT3, to solve these constructed programs. This paper provides an overview of the theoretical underpinning of the sum of Hermitian squares (with commutators) programs and provides a gentle introduction to the primary features of NCSOStools.

Invariant and Coinvariant Spaces for the Algebra of Symmetric Polynomials in Non-Commuting Variables

We analyze the structure of the algebra $\mathbb{K}\langle\mathbf{x}\rangle^{\mathfrak{S}_n}$ of symmetric polynomials in non-commuting variables in so far as it relates to $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$, its commutative counterpart. Using the "place-action" of the symmetric group, we are able to realize the latter as the invariant polynomials inside the former. We discover a tensor product decomposition of $\mathbb{K}\langle\mathbf{x}\rangle^{\mathfrak{S}_n}$ analogous to the classical theorems of Chevalley, Shephard-Todd on finite reflection groups. Résumé. Nous analysons la structure de l'algèbre $\mathbb{K}\langle\mathbf{x}\rangle^{\mathfrak{S}_n}$ des polynômes symétriques en des variables non-commutatives pour obtenir des analogues des résultats classiques concernant la structure de l'anneau $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ des polynômes symétriques en des variables commutatives. Plus précisément, au moyen de "l'action par positions", on réalise $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ comme sous-module de $\mathbb{K}\langle\mathbf{x}\rangle^{\mathfrak{S}_n}$. On découvre alors une nouvelle décomposition de $\mathbb{K}\langle\mathbf{x}\rangle^{\mathfrak{S}_n}$ comme produit tensorial, obtenant ainsi un analogues des théorèmes classiques de Chevalley et Shephard-Todd.

A note on the nonexistence of sum of squares certificates for the Bessis–Moussa–Villani conjecture

The algebraic reformulation of the Bessis–Moussa–Villani conjecture is equivalent to a family of dimension-free tracial inequalities involving positive semidefinite matrices. Sufficient conditions for these to hold in the form of algebraic identities involving polynomials in noncommuting variables have been given by Klep and Schweighofer [“Sums of Hermitian squares and the BMV conjecture,” J. Stat. Phys. 133, 739 (2008)]. Later the existence of these certificates has been settled for all but one case, which is resolved in this note.

Preserving Zeros of a Polynomial

We study nonlinear surjective mappings on ℳ n (𝔽) and its subsets, which preserve the zeros of some fixed polynomials in noncommuting variables.

Semidefinite programming and sums of hermitian squares of noncommutative polynomials

An algorithm for finding sums of hermitian squares decompositions for polynomials in noncommuting variables is presented. The algorithm is based on the “Newton chip method”, a noncommutative analog of the classical Newton polytope method, and semidefinite programming.

Sums of Hermitian Squares and the BMV Conjecture

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.

A characterization of the centroid of a prime ring

We characterize certain maps by their action on a fixed polynomial in noncommuting variables on algebras satisfying certaind-freeness condition. Consequently, a characterization of the centroid of a prime ring is obtained.

Invariant and coinvariant spaces for the algebra of symmetric polynomials in non-commuting variables

We analyze the structure of the algebra $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ of symmetric polynomials in non-commuting variables in so far as it relates to $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$, its commutative counterpart. Using the "place-action'' of the symmetric group, we are able to realize the latter as the invariant polynomials inside the former. We discover a tensor product decomposition of $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ analogous to the classical theorems of Chevalley, Shephard-Todd on finite reflection groups. In the case $|\mathbf{x}|= \infty$, our techniques simplify to a form readily generalized to many other familiar pairs of combinatorial Hopf algebras. Nous analysons la structure de l'algèbre $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ des polynômes symétriques en des variables non-commutatives pour obtenir des analogues des résultats classiques concernant la structure de l'anneau $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ des polynômes symétriques en des variables commutatives. Plus précisément, au moyen de "l'action par positions'', on réalise $\mathbb{K}[\mathbf{x}]^{\mathfrak{S}_n}$ comme sous-module de $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$. On découvre alors une nouvelle décomposition de $\mathbb{K}\langle \mathbf{x}\rangle^{\mathfrak{S}_n}$ comme produit tensoriel, obtenant ainsi un analogue des théorèmes classiques de Chevalley et Shephard-Todd. Dans le cas $|\mathbf{x}|= \infty$, nos techniques se simplifient en une forme aisément généralisables à beaucoup d'autres paires d'algèbres de Hopf familières.

Connes' embedding conjecture and sums of hermitian squares

We show that Connes' embedding conjecture on von Neumann algebras is equivalent to the existence of certain algebraic certificates for a polynomial in noncommuting variables to satisfy the following nonnegativity condition: The trace is nonnegative whenever self-adjoint contraction matrices of the same size are substituted for the variables. These algebraic certificates involve sums of hermitian squares and commutators. We prove that they always exist for a similar nonnegativity condition where elements of separable II 1 -factors are considered instead of matrices. Under the presence of Connes' conjecture, we derive degree bounds for the certificates.

A Nichtnegativstellensatz for polynomials in noncommuting variables

Let S⋃{f} be a set of symmetric polynomials in noncommuting variables. If f satisfies a polynomial identity Σihi*fhi = 1 + Σigi*sigi for some si ∈ S ⋃ {1}, then f is obviously nowhere negative semidefinite on the class of tuples of nonzero operators defined by the system of inequalities s ≥ 0 (s ∈ S). We prove the converse under the additional assumption that the quadratic module generated by S is Archimedean.