English

Gram-like matrix preserving extensions and completions of noncommutative polynomials

Optimization and Control 2025-06-30 v2 Commutative Algebra Algebraic Geometry Functional Analysis

Abstract

Given a positive noncommutative polynomial ff, equivalently a sum of Hermitian squares (SOHS), there exists a positive semidefinite Gram matrix that encrypts all the structural essence of ff. There are no available methods for extending a noncommutative polynomial to a SOHS keeping the Gram matrices unperturbed. As a remedy, we introduce an equally significant notion of Gram-like matrices and provide linear algebraic techniques to get the desired extensions. We further use positive semidefinite completion problem to get SOHS and provide criteria in terms of chordal graphs and 2-regular projective algebraic sets.

Keywords

Cite

@article{arxiv.2501.12063,
  title  = {Gram-like matrix preserving extensions and completions of noncommutative polynomials},
  author = {Arijit Mukherjee and Arindam Sutradhar},
  journal= {arXiv preprint arXiv:2501.12063},
  year   = {2025}
}

Comments

Section 3.2 have been rearranged. Necessary and sufficient condition for Gram-like matrix preserving extensions are added. All comments are welcome