2017
DOI: 10.1090/proc/13773
|View full text |Cite
|
Sign up to set email alerts
|

Positivstellensätze for noncommutative rational expressions

Abstract: We derive some Positivstellensatzë for noncommutative rational expressions from the Positivstellensatzë for noncommutative polynomials. Specifically, we show that if a noncommutative rational expression is positive on a polynomially convex set, then there is an algebraic certificate witnessing that fact. As in the case of noncommutative polynomials, our results are nicer when we additionally assume positivity on a convex set-that is, we obtain a so-called "perfect Positivstellensatz" on convex sets.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
8
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 11 publications
(12 reference statements)
1
8
0
Order By: Relevance
“…Subsequent developments ultimately led to a noncommutative version of the Positivstellensatz for semialgebraic sets. We refer interested readers to Pascoe (2018) for an overview of this topic.…”
Section: Noncommutative Positivstellensatzmentioning
confidence: 99%
“…Subsequent developments ultimately led to a noncommutative version of the Positivstellensatz for semialgebraic sets. We refer interested readers to Pascoe (2018) for an overview of this topic.…”
Section: Noncommutative Positivstellensatzmentioning
confidence: 99%
“…It is clear that extension of f to the new domain must still be given by the same formula as before. Either using the algorithms in [10,21] or by brute force, one can see that…”
Section: The Noncommutative Contextmentioning
confidence: 99%
“…We also point out that the case where R 1 = R d as a diagonal algebra and R 2 = R was explored in [22,19], and that the current work simplifies the proof of the main result of those works if we are willing to use the commutative Löwner theorem from [1] as a black box. Moreover, if we are given a rational expression, such as the Schur complement, on a nice finite dimensional operator system, such as a matrix algebra, one can apply the algorithms in [10] which make the rational convex Positivstellensatz [21] effective to check that a function is matrix monotone in our sense.…”
Section: The Noncommutative Contextmentioning
confidence: 99%
“…Given a monic Hermitian pencil = + 1 1 + • • • + , the associated free spectrahedron D( ) is the set of Hermitian tuples X satisfying the linear matrix inequality ( ) 0. Since every convex solution set of a noncommutative polynomial is a free spectrahedron [HM12], the following statement is called a rational convex Positivstellensatz, and it generalises its analogues in the polynomial context [HKM12] and regular rational context [Pas18].…”
Section: Introductionmentioning
confidence: 99%