Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Noncommutative partial convexity via $Γ$-convexity (1908.05949v1)

Published 16 Aug 2019 in math.FA

Abstract: Motivated by classical notions of partial convexity, biconvexity, and bilinear matrix inequalities, we investigate the theory of free sets that are defined by (low degree) noncommutative matrix polynomials with constrained terms. Given a tuple of symmetric polynomials $\Gamma$, a free set is called $\Gamma$-convex if it closed under isometric conjugation by isometries intertwining $\Gamma$. We establish an Effros-Winkler Hahn-Banach separation theorem for $\Gamma$-convex sets; they are delineated by linear pencils in the coordinates of $\Gamma$ and the variables $x$.

Summary

We haven't generated a summary for this paper yet.