Factorization of noncommutative polynomials and Nullstellens\"atze for the free algebra
J. William Helton, Igor Klep, Jurij Vol\v{c}i\v{c}

TL;DR
This paper establishes a class of Nullstellensatz results for noncommutative polynomials, linking polynomial factors to singularity sets and providing algebraic certificates without sums of squares, advancing the theory of free algebra nullstellensatz.
Contribution
It introduces a new Nullstellensatz for noncommutative polynomials that relates irreducible factors to singularity components, extending previous results with fewer hypotheses.
Findings
Irreducible factors correspond to components of singularity sets for large n
Nullstellensatz characterizes containment of zero sets via stable association of factors
Provides a Positivstellensatz for quadratic free semialgebraic sets
Abstract
This article gives a class of Nullstellens\"atze for noncommutative polynomials. The singularity set of a noncommutative polynomial is , where The first main theorem of this article shows that the irreducible factors of are in a natural bijective correspondence with irreducible components of for every sufficiently large . With each polynomial in and one also associates its real singularity set . A polynomial which depends on alone (no variables) will be called analytic. The main Nullstellensatz proved here is as follows: for analytic but for dependent on possibly both and , the containment is equivalent to each factor of being "stably associated" to a factor of or of . For…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Factorization of noncommutative polynomials
and Nullstellensätze for the free algebra
J. William Helton1
J. William Helton, Department of Mathematics, University of California San Diego
,
Igor Klep2
Igor Klep, Department of Mathematics, University of Ljubljana
and
Jurij Volčič3
Jurij Volčič, Department of Mathematics, Texas A&M University
Abstract.
This article gives a class of Nullstellensätze for noncommutative polynomials. The singularity set of a noncommutative polynomial is , where The first main theorem of this article shows that the irreducible factors of are in a natural bijective correspondence with irreducible components of for every sufficiently large .
With each polynomial in and one also associates its real singularity set . A polynomial which depends on alone (no variables) will be called analytic. The main Nullstellensatz proved here is as follows: for analytic but for dependent on possibly both and , the containment is equivalent to each factor of being “stably associated” to a factor of or of .
For perspective, classical Hilbert type Nullstellensätze typically apply only to analytic polynomials , while real Nullstellensätze typically require adjusting the functions by sums of squares of polynomials (sos). Since the above “algebraic certificate” does not involve a sos, it seems justified to think of this as the natural determinantal Hilbert Nullstellensatz. An earlier paper of the authors (Adv. Math. 331 (2018) 589–626) obtained such a theorem for special classes of analytic polynomials and . This paper requires few hypotheses and hopefully brings this type of Nullstellensatz to near final form.
Finally, the paper gives a Nullstellensatz for zeros of a hermitian polynomial , leading to a strong Positivstellensatz for quadratic free semialgebraic sets by the use of a slack variable.
Key words and phrases:
Noncommutative polynomial, Nullstellensatz, factorization, singularity locus, linear pencil, free algebra, Positivstellensatz
2010 Mathematics Subject Classification:
Primary 47A56, 15A22, 16U30; Secondary 13A50, 13J30, 15A69
1Supported by the NSF grant DMS 1500835.
2Supported by the Slovenian Research Agency grants J1-8132, N1-0057 and P1-0222, and partially supported by the Marsden Fund Council of the Royal Society of New Zealand.
3Supported by the Deutsche Forschungsgemeinschaft (DFG) Grant No. SCHW 1723/1-1.
1. Introduction
Hilbert’s Nullstellensatz is a fundamental result in classical algebraic geometry describing polynomials vanishing on a complex algebraic variety. It has been generalized or extended to various settings, including many noncommutative ones. For instance, Amitsur’s Nullstellensatz [Ami57] (see also [Pro66]) describes noncommutative polynomials vanishing on the common vanishing set of a given finite set of polynomials in a full matrix algebra. The papers [BK09, KŠ14] discuss vanishing traces of noncommutative polynomials, Cimprič [Cim19] considers Nullstellensatz questions involving polynomial partial differential operators, Salomon, Shalit and Shamovich [SSS18] give free noncommutative analytic Nullstellensätze, Reichstein and Vonessen [RV07] develop a framework for such questions in the context of rings with polynomial identities (see also [vOV81]), etc.
In a slightly different direction, the real Nullstellensatz and Positivstellensatz are pillars of real algebraic geometry [BCR98]. These too have seen a plethora of noncommutative extensions. For example, the articles [CHMN13, Oza16, Scm09] develop general frameworks, and these ideas yield various applications, see e.g. Positivstellensätze on quantum graphs [NT15], isometries [HMP04], convex semialgebraic sets [HKM12], and algebraic approaches to Connes’ embedding conjecture [Oza13].
In this article we prove new complex and real Nullstellensätze for the free algebra and provide a geometric interpretation for factorization of noncommutative polynomials [Coh06, BS15, BHL17]. The motivation for this work comes from the rapidly emerging areas of free analysis [AM16, K-VV14, SSS18, DK+] and free real algebraic geometry [Oza13, NT15, HKMV+] that study function theory on (semi)algebraic sets in the space of matrix tuples of all sizes. For noncommutative polynomials there are three major types of zeros. These are hard zeros [Ami57, SSS18], directional zeros [HM04, HMP07], and determinantal zeros [KV17, HKV18]. For each of these one hopes there will be a Hilbert type Nullstellensatz (treating inclusion of zero sets) and a real Nullstellensatz (treating “real” points in zero sets). For directional zeros, reasonably satisfying theorems along these lines exist; see [HMP07] for a Nullstellensatz and [CHMN13] for a real Nullstellensatz. This article concerns determinantal zeros in Sections 2 and 3, and hard zeros in Section 4.
Our algebraic certificates are a counterpart to Hilbert’s Nullstellensatz, and such theorems often carry direct applications to, say, semidefinite optimization and control theory [SIG98, BGM06]. Furthermore, we hope these results may be of interest to researchers in noncommutative algebra, matrix theory or polynomial identities.
1.1. Main results
Let be freely noncommuting variables. Elements of
[TABLE]
are noncommutative matrix polynomials. If and , then denotes the evaluation of at .
1.1.1. Complex Nullstellensätze
Our first main result gives a geometric interpretation of irreducibility in free algebras. We say that is full [Coh06, Section 0.1] if it cannot be factored as for and with . In the special case , a polynomial is full if and only if . Following [Coh06] we call an atom if is not invertible in and cannot be written as a product of non-invertible elements in . In particular, every atom is full. Every full matrix admits a complete factorization into atoms [Coh06, Proposition 3.2.9].
Theorem 2.9.
A matrix polynomial is an atom if and only if is an irreducible polynomial for all but finitely many .
This theorem leads to a geometric description of factorization in free algebras. The geometric objects we use are free singularity sets. For let
[TABLE]
be its free locus. In [HKV18, Theorem 4.3] it was shown that components of correspond to a factorization of in if is an invertible matrix. Theorem 2.12 below, a free analog of Hilbert’s Nullstellensatz, disposes of this assumption. Its proof is based on the aforementioned special case and novel techniques involving point-centered ampliations and representation theory.
To deal with the non-uniqueness of factorization in free algebras, Cohn introduced stable associativity [Coh06, Section 0.5]. Polynomials and are stably associated if there exist with and invertible such that
[TABLE]
Actually, if and are stably associated, one can always choose and [Coh06, Theorem 0.5.3]. In particular, for stable associativity becomes a question about matrices over . There is a straightforward procedure to generate all stably associated pairs, see [Coh06, Section 2.7].
Theorem 2.12 (Singulärstellensatz).
Let be full matrix polynomials. Then if and only if for some , every atomic factor of is stably associated to a factor of .
See Theorem 2.12 and Proposition 2.14 for the proof.
1.1.2. Real Nullstellensätze
We next turn our attention to the “real” setting with an involution. Let be formal adjoints to . The map extends to a unique involution on
[TABLE]
restricting to the conjugate transpose on . For we define its real free locus and the real free zero set:
[TABLE]
A matrix polynomial depending on but not on is called analytic. For such an we have .
Theorem 3.4 (Analytic Singulärstellensatz).
Let be analytic atoms in and a full matrix polynomial. Then if and only if there is such that or is stably associated to a factor of .
A straightforward extension of Theorem 3.4 where both are allowed to contain fails even if is hermitian, see Example 3.11. A natural class of for which the conclusion does hold are unsignatured matrix polynomials . A hermitian polynomial is unsignatured if there exist and such that are invertible and have different signatures.
Theorem 3.9 (Hermitian Singulärstellensatz).
Let be a full matrix polynomial and let be an unsignatured atom. Then if and only if is stably associated to a factor of .
A final main result is a Nullstellensatz for real free zero sets of polynomials with a distinguished quadratic term. As with the unsignatured hypothesis in Theorem 3.9 for real free loci, this was done under a certain definiteness assumption.
Theorem 4.5.
For a nonconstant hermitian assume . Let . Then if and only if .
As a consequence we obtain a necessary and sufficient Positivstellensatz for hereditary quadratic polynomials, by adding a slack variable.
Corollary 4.6.
Let be a nonconstant hermitian hereditary quadratic polynomial with , and let be an auxiliary variable. If , then if and only if
[TABLE]
for some with .
While previously known necessary and sufficient Positivstellensätze on free semialgebraic sets do not require a slack variable, they only hold if the underlying free semialgebraic set is either convex with a nonempty interior [HKM12] or given by quadratic equations, such as spherical isometries or tuples of unitaries [KVV17]. On the other hand, Corollary 4.6 is an example of a Positivstellensatz on a (possibly) non-convex free semialgebraic set with a nonempty interior.
1.1.3. Linear Gleichstellensatz
An affine matrix polynomial is traditionally called a linear pencil. It is indecomposable if it cannot be put in block triangular form with a left and right basis change, cf. Definition 2.5. One can effectively apply the above Nullstellensätze to indecomposable linear pencils , to get roughly: for some if and only if the the free loci of and coincide. This is true for complex zeros (Theorem 2.11), real zeros (Theorem 3.6) and in the context of the Hermitian Nullstellensatz, which requires extra conditions on zeros (Theorem 3.6).
1.1.4. Zero sets over the reals
When dealing with real matrix polynomials, it suffices to consider only their evaluations at tuples of real matrices. Namely, for each we have a -embedding induced by . Note that is unitarily equivalent to for each , where is the entry-wise complex conjugate of . Hence if , then is singular (resp. zero) if and only if is singular (resp. zero). Therefore one can replace free loci and free zero sets in the above theorems with their counterparts over when applied to real polynomials, which is usually the preferred setting in control theory and optimization.
Acknowledgments
The authors thank Scott McCullough for insightful discussions. The first two named authors thank the Mathematisches Forschungsinstitut Oberwolfach (MFO) for support through the “Research in Pairs” (RiP) program in 2017.
2. Factorization in a free algebra and free loci
This section has two main results. In Theorem 2.9 we prove that a matrix polynomial is an atom if and only if is eventually a reduced irreducible hypersurface. Theorem 2.12 shows that divides in the sense that every atomic factor of is stably associated to a factor of if and only if . These results are far-reaching generalizations of [HKV18, Theorems A, B] to matrix polynomials that eliminate the assumption of being invertible. The proofs here rely on representation theory and point-centered ampliations, whereas [HKV18] used invariant theory. For the sake of convenience and later sections we use as the base field, but all proofs work for an arbitrary algebraically closed field of characteristic 0.
For let be a tuple of generic matrices. That is, , where are independent commuting variables. We view the entries of as the coordinates of the affine space .
By [Coh06, Theorem 5.8.3], a full matrix is stably associated to a linear pencil of size such that
[TABLE]
have full rank. We call such an epic 111 In [Coh06] such is called monic, which we avoid since monic pencils in control theory and convexity usually refer to pencils with . pencil. We also say that is a linearization of . By the definition of stable associativity there is such that for all . Also, is full if and only if is full by [Coh06, Theorem 7.5.13]. Furthermore, is an atom if and only if is an atom by [Coh06, Proposition 0.5.2, Corollary 0.5.5 and Proposition 3.2.1].
Example 2.1**.**
If , then one can check that the pencil
[TABLE]
is a linearization of . While is epic, no linear combination of is invertible, which corresponds to vanishing on .
We next record facts about full and invertible matrices over that are scattered across the existing literature.
Lemma 2.2**.**
For the following are equivalent:
- (i)
* is full;* 2. (ii)
there are and such that ; 3. (iii)
there exists such that for every .
Furthermore, a full is not invertible in if and only if there exists such that is nonconstant for every .
Proof.
By [Coh06, Corollary 7.5.14], is full if and only if is invertible over the free skew field of noncommutative rational functions \mathbb{C}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}} (see Subsection 4.1 for further information about this skew field). The equivalence of (i) and (ii) now follows from the construction of \mathbb{C}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}} described in [K-VV12, Section 2]. On the other hand, (iii) is equivalent to (ii) by linearization and [DM17, Proposition 2.10].
If is invertible in , then is a product of polynomials, so is a nonzero constant. If is not invertible, then either is not full or has an atomic factor . If , then is not constant for large enough by the first part since is full. If , then there exists such that is nonconstant for all by [HKV18, Theorem 4.3]. ∎
2.1. Point-centered ampliations
Fix and let
[TABLE]
be freely noncommuting variables. For let
[TABLE]
be its point-centered ampliation at . In particular, if and is the zero tuple, then is up to a canonical shuffle equal to
[TABLE]
where is Kronecker’s product and are the standard matrix units. For applications of related ideas to noncommutative rational functions see [Vol18, PV].
In this subsection we prove that point ampliations preserve atoms. First we require two technical lemmas.
Lemma 2.3**.**
For sets we have
[TABLE]
Proof.
Follows by induction on using
[TABLE]
Lemma 2.4**.**
Let and satisfy . Assume there exist , and for such that
[TABLE]
have full rank and
[TABLE]
Then there exist , of full rank for some satisfying such that
[TABLE]
Proof.
Since the statement is trivial for , let . By assumption we have . For let be the projection onto the complement of in along . Analogously we define with respect to .
By Lemma 2.3 we have
[TABLE]
Let and . Then
[TABLE]
Therefore there exists such that or .
Suppose (the other cases are treated analogously). Then (2.2) implies
[TABLE]
Since , there exist and satisfying . By choosing linearly independent rows of and linearly independent columns of we obtain , of full rank such that (2.3) holds. ∎
Definition 2.5**.**
A linear pencil of size is indecomposable if there are no such that
[TABLE]
where the zero block is of size with .
Remark 2.6*.*
When restricted to monic pencils (), Definition 2.5 coincides with the one in [HKMV+] (while in [HKV18] such pencils were called irreducible): namely, a monic pencil is indecomposable if its coefficients admit no nontrivial common invariant subspace (or equivalently, generate the full matrix algebra). If is invertible, the new definition can be reduced to the old one since is indecomposable if and only if is indecomposable, and the latter is a monic pencil.
We will frequently use [Coh06, Theorem 5.8.8] stating that an epic pencil is an atom if and only if it is indecomposable.
Proposition 2.7**.**
Let be a matrix polynomial and . If is an atom, then is an atom.
Proof.
Let be an epic pencil that is stably associated to . Then is stably associated to for every and . Since stable associativity preserves atoms, is an atom and it suffices to show that every point-centered ampliation of is an atom. Furthermore, an affine change of variables preserves atoms, so it suffices to consider point-centered ampliations at for , where is the zero tuple in .
Let be an epic pencil of size . Then is an epic pencil of size and up to a basis change equal to (2.1). Suppose that is not an atom. Since it is epic, it is not indecomposable by [Coh06, Theorem 5.8.8], so there exist satisfying and such that
[TABLE]
where the zero block is of size . Let be the first block row of , and let be the last block column of . Then the assumptions of Lemma 2.4 are satisfied by (2.4) and (2.1). So there exist such that
[TABLE]
where the zero block is of size and . Therefore is not indecomposable and hence not an atom by [Coh06, Theorem 5.8.8]. ∎
2.2. Irreducibility
In this section we prove the main irreducibility result on free loci (Theorem 2.9). We start with an observation about the degrees of determinants of a matrix polynomial; for a related rank-stabilizing result see [DM17, Theorem 1.8].
Lemma 2.8**.**
Let be a full non-invertible matrix polynomial. Then there exist such that for all .
Proof.
For let . Since , we have
[TABLE]
for all . By Lemma 2.2 there exist and for such that . Then there exist such that
[TABLE]
for all by [HKV18, Lemma 3.1] and linearization. Choosing yields . Furthermore, for all we have
[TABLE]
by (2.5) and (2.6). On the other hand, every can be written as for some , so (2.5) implies
[TABLE]
Hence for all , and consequently . ∎
The next irreducibility theorem is one of the central results in this paper. It is the pillar of the Hilbert type Nullstellensätze that follow in Sections 2 and 3.
Theorem 2.9**.**
Let be a matrix polynomial. Then is an atom if and only if there is such that is an irreducible polynomial for every .
Proof.
Assume is not an atom. If is not full, then for all . If is invertible over , then is a nonzero constant for every . If is full and not invertible, then for some full non-invertible matrix polynomials . Then is a proper factorization for all sufficiently large by Lemma 2.2. This proves one implication of the theorem.
Now let be an atom. By Lemma 2.8 there exist such that for all . In particular, there is such that . Then is an atom by Proposition 2.7. Since , there exists such is an irreducible polynomial for every by [HKV18, Theorem 4.3]. Since an affine change of variables does not affect irreducibility, is also irreducible for every . By the definition of we then conclude that is irreducible for all .
Now let . Then for and . Suppose that for . By the choice of in the previous paragraph there is such that . Since the polynomial is irreducible, we can without loss of generality assume that evaluated at equals . Thus , and so .
By [HKV18, Lemma 2.1], is given by a pure trace polynomial; that is, there is a formal polynomial in traces of words over ,
[TABLE]
such that the degree of equals the degree of and . We also consider another pure trace polynomial
[TABLE]
Note that and . Hence is a pure trace identity for matrices which has degree . Therefore is the zero polynomial by [Pro76, Theorem 4.5]. Since , the trace polynomial is also zero, so is constant. Hence is irreducible for every . ∎
2.3. Complex Nullstellensatz
In this subsection we show that indecomposable pencils are determined by their free loci (Theorem 2.11), which then leads to the geometric reformulation of factorization in the free algebra (Theorem 2.12).
Consider the actions of and on given by . The following fact is probably well-known to specialists in invariant theory. We include a proof for the sake of completeness.
Lemma 2.10**.**
Let be of size . If is indecomposable, then the -orbit of in is Zariski closed, and the -stabilizer of is .
Proof.
Since is indecomposable, we have
[TABLE]
for every proper subspace in . If we view as a -dimensional representation
[TABLE]
of the -Kronecker quiver, then the previous observation implies that is -stable according to [Kin94, Definition 1.1 and Section 3]. By [Kin94, Proposition 3.1], stability of as a quiver representation is equivalent to stability of as a point in with the action of according to [Kin94, Definition 2.1]. Note that are precisely elements in that act trivially on . Therefore stability of implies
[TABLE]
so the stabilizer of equals . Furthermore, since is the commutator subgroup of , the -orbit of in is Zariski closed by [Shm07, Theorem 1(i)(iii)]. ∎
Theorem 2.11** (Linear Gleichstellensatz).**
Let and be indecomposable linear pencils of sizes and , respectively. Then if and only if and for some .
Proof.
By Theorem 2.9 there exists such that and are irreducible for all . By and irreducibility we see that and are equal up to a multiplicative constant for every . Thus there exists such that for all . After multiplying by we can therefore assume that
[TABLE]
Let and . Then
[TABLE]
for every and , and similarly for . By (2.9), the polynomials
[TABLE]
agree up to a factor of . However, since is indecomposable, the left-hand side of (2.10) is an irreducible polynomial in for large enough . Analogous conclusion holds for , so the polynomials in (2.11) are equal, and thus . Consequently, (2.9) and (2.10) imply
[TABLE]
Let us view and as elements of with the action of . Then for every -invariant polynomial function by (2.12) and Theorem [SvdB01, Theorem 2.3] or [DM17, Theorem 1.4]. Therefore the Zariski closures of -orbits of and coincide. But the orbits of and are closed by Lemma 2.10, so and lie in the same orbit. ∎
Theorem 2.12** (Singulärstellensatz).**
Let and be full matrix polynomials. Then if and only if every atomic factor of is stably associated to a factor of .
Proof.
It suffices to assume that is an atom. Let be a factorization of into atoms.
If is stably associated to , then there is such that for all , so .
Since are atoms, there exists such that and for are irreducible algebraic sets for every . Since
[TABLE]
we conclude that for every , for some . Hence there exists such that for infinitely many . Since embeds into via for every and any matrix polynomial , we have for all . Let and be the epic pencils that are stably associated to and . Then are atoms and thus indecomposable by [Coh06, Theorem 5.8.8]. Since , and are stably associated by Theorem 2.11. Therefore and are stably associated. ∎
Corollary 2.13**.**
Let be an atom and a full matrix polynomial. Then if and only if is a product of matrix polynomials each of which is stably associated to .
Finally, let us record the following observation about free loci, which implies the introductory version of Theorem 2.12 above, and will be used several times later in the text. While we usually think of free loci as analogs of hypersurfaces, their intersections do not behave as lower-dimensional varieties.
Proposition 2.14**.**
Let be matrix polynomials. If , then there exists such that .
Proof.
Suppose for . Hence there exist matrix tuples such that for ,
[TABLE]
If for some , then
[TABLE]
and so . Therefore . ∎
3. Real Nullstellensätze
In this section we prove two new real Nullstellensätze for the free algebra. In Theorem 3.4 we give a geometric condition for an analytic (no variables) matrix polynomial to be a factor of an arbitrary matrix polynomial . This result is under a natural assumption extended to arbitrary in Theorem 3.9. The proofs rely on preceding results in this paper and real algebraic geometry applied to the real structure on matrix tuples.
3.1. Real structure
For and let denote the involution-free evaluation of at given by and , and let denote the -evaluation at , where .
Fix . The map
[TABLE]
is conjugate-linear and involutive. Thus is a real structure on the complex space . Let be a complex algebraic set in . If preserves , then let denote the set of points in fixed by ,
[TABLE]
Then is a real algebraic set, also called the set of real points on .
Proposition 3.1**.**
Let be a complex algebraic set in . If is irreducible, preserves and contains a smooth point of , then is Zariski dense in .
Proof.
This is a special case of a more general statement about real points on a complex variety with a real structure, see e.g. [Bec82, Lemma 1.5] or [DE70, Theorem 4.9]. ∎
Recall the definition of the real free locus of from the introduction. To derive results about , we consider the (non-real) free locus of throughout this section in an involution-free way; that is, we “forget” the involutive relation between the variables and , and thus
[TABLE]
as a complex algebraic set in . If is hermitian, then is preserved by the real structure , and the real points of the free locus of are related to the real free locus of as follows:
[TABLE]
3.2. Analytic Nullstellensatz
Let ; such polynomials are called analytic. Although contains no , it is convenient to view it as a matrix over , and thus . Observe that the real structure on preserves
[TABLE]
since . The set of real points of this algebraic set is then
[TABLE]
Proposition 3.2**.**
Let be an atom. There exists such that for every , we have that is Zariski dense in .
The proof uses smooth points, hence involves derivatives and their properties. Let be another tuple of generic matrices. We view the entries of as the coordinates of the affine space .
Lemma 3.3**.**
For all ,
[TABLE]
Proof.
A consequence of the identity . ∎
Proof of Proposition 3.2.
By Theorem 2.9 there exists such that is irreducible for all . Now fix . Since is irreducible, there exists such that
[TABLE]
where denotes the gradient with respect to the variables . By Lemma 3.3 we also have
[TABLE]
The algebraic set is defined by and , and the Jacobian matrix of this pair has the form
[TABLE]
Then has rank 2 by (3.2) and (3.3), so is a smooth point of . Finally, is irreducible since it is a product of two irreducible hypersurfaces in ,
[TABLE]
The statement then follows by Proposition 3.1. ∎
Theorem 3.4** (Analytic Singulärstellensatz).**
Let be an atom and a full matrix. Then if and only if or is stably associated to a factor of .
Proof.
Only is non-trivial. If , then for all . By Proposition 3.2, is Zariski dense in for all large enough. Therefore for all large enough, and consequently for all . Therefore or by Proposition 2.14, so the conclusion follows by Theorem 2.12. ∎
As a corollary we obtain the following somewhat unexpected statement.
Corollary 3.5**.**
Let and for be full matrices. Then
[TABLE]
if and only if there exists such that each atomic factor of is stably associated to a factor of either or .
Proof.
If (3.4) holds, then as in the proof of Proposition 2.14 we see that for some . The rest is an immediate consequence of Theorem 3.4. ∎
Restricting Theorem 3.4 to linear pencils yields the following Gleichstellensatz.
Corollary 3.6**.**
Let be indecomposable linear pencils. If is analytic, then if and only if are of the same size and there exist such that or .
Proof.
Combine Theorems 2.11 and 3.4. ∎
3.3. Hermitian Nullstellensatz
In real algebraic geometry, an ideal is called real if consists precisely of polynomials vanishing on the real zero set of . Theorem 3.9 below is inspired by the characterization of real principal ideals [BCR98, Theorem 4.5.1]. Namely, if is irreducible, then is a real ideal if and only if changes sign. Recall that a hermitian matrix polynomial is called unsignatured if there exist and such that are invertible and have different signatures.
Remark 3.7*.*
If is positive (resp. negative) definite for some , then is unsignatured if and only if (resp. ) is not a sum of hermitian squares. There are also unsignatured polynomials that are never definite, for instance (because its trace is constantly 0). Another example of a non-unsignatured atom is
[TABLE]
Proposition 3.8**.**
Let be a hermitian polynomial, and such that and are invertible with different signatures. If is irreducible, then is Zariski dense in .
Proof.
As is endowed with the real structure , we can view
[TABLE]
as the corresponding real affine space. There exists such that for every with , the matrix is invertible with the same signature as . Let be an open ball of radius about , intersected by the affine subspace through that is perpendicular to , i.e.,
[TABLE]
Then is a semialgebraic set in of (real) dimension . Let be the convex hull of . If , then and have different signatures, so intersects the interior of the line segment between and . Moreover, by the choice of , every line through intersects at most once. Therefore we have a surjective map
[TABLE]
given by projections onto along the lines through . Then is clearly semialgebraic, so by [BCR98, Theorem 2.8.8]. Therefore its Zariski closure in (with real structure ) is a hypersurface by [BCR98, Proposition 2.8.2]. Since the latter is contained in the irreducible , we conclude that is Zariski dense in . ∎
Theorem 3.9** (Hermitian Singulärstellensatz).**
Let be a full matrix and let be an unsignatured hermitian atom. Then if and only if is stably associated to a factor of .
Proof.
Again only is non-trivial. By we have for all . Since is an unsignatured atom, is irreducible and is Zariski dense in for infinitely many by Proposition 3.8 and Theorem 2.9. Consequently for infinitely many , so and Theorem 2.12 applies. ∎
Similarly to Corollary 3.5, we can use a modified proof of Proposition 2.14 to obtain the following.
Corollary 3.10**.**
For let be unsignatured hermitian atoms and a full matrix. Then
[TABLE]
if and only if for some , is stably associated to a factor of .
Example 3.11**.**
Theorem 3.9 does not hold for arbitrary hermitian atoms . For example, if and , then but is not stably associated to . For another example, let be as in (3.5). Then and is invertible for every , so has a constant signature on for every . Moreover, is not invertible in , and is an atom. Hence and satisfy but is not stably associated to . For an algorithm checking whether the free real locus of a polynomial is empty, see [KPV17].
We conclude this section with a Linear Gleichstellensatz for hermitian indecomposable pencils. Since every hermitian monic pencil is unsignatured, the following corollary generalizes [KV17, Corollary 5.5] and preceding versions with operator-algebraic proofs [HKM13, Zal17, DDOSS17] to non-monic pencils.
Corollary 3.12** (Hermitian Linear Gleichstellensatz).**
Let be hermitian indecomposable linear pencils. If is unsignatured, then if and only if are of the same size and there exists such that .
Proof.
The implication is obvious, so we consider . Since and are atoms, is stably associated to by Theorem 3.9. Therefore are of the same size and for by Theorem 2.11. Since are hermitian, we also have . Therefore stabilizes , so by Lemma 2.10. Since and are hermitian, we have , so after rescaling we can choose . ∎
4. Null- and Positivstellensatz with hard zeros
In this section we present a new real Nullstellensatz for hard zeros as opposed to determinantal zeros discussed above. While the unsignatured condition above is too weak (at least for our techniques), a stronger unsignatured condition succeeds as is seen in Theorem 4.5. Its proof depends on basic commutative algebra and the technique of rational resolvable ideals developed in [KVV17]. Then, we use this in Corollary 4.6 to prove a Positivstellensatz (by using a slack variable) for domains defined by quadratic polynomials.
4.1. Background on rationally resolvable ideals
For an ideal let
[TABLE]
be its free zero set. If , then denotes the free zero set of the ideal generated by . We say that has the Nullstellensatz property if
[TABLE]
for all . This is a noncommutative analog of a radical ideal in classical algebraic geometry [Eis95, Section 1.6].
We recall rationally resolvable ideals from [KVV17]. The free algebra admits the universal skew field of fractions \mathbb{C}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}, the free skew field, whose elements are called noncommutative rational functions [Coh06, BR11, K-VV12]. For let , and fix a tuple with \mathbbm{r}_{i}\in\mathbb{C}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}\tilde{x}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}. The graph of is
[TABLE]
An ideal is
- (1)
formally rationally resolvable with rational resolvent if and the sets and generate the same ideal in the amalgamated product
[TABLE]
the subring of \mathbb{C}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}} generated by and \mathbb{C}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}\tilde{x}\mathchoice{\leavevmode\vtop{ \halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{ \halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}. 2. (2)
geometrically rationally resolvable with rational resolvent if and for every , implies .
Intuitively, (1) and (2) allude to relations that can be resolved in a rational manner, either in algebraic or geometric sense. The Nullstellensatz property and rational resolvability are related as follows.
Theorem 4.1** ([KVV17, Theorem 2.5 and Proposition 2.6]).**
Let be an ideal. If embeds into a skew field and is formally rationally resolvable with a rational resolvent containing no nested inverses, then is geometrically rationally resolvable and has the Nullstellensatz property.
Here, nested inverses refer to presentations of noncommutative rational functions; for example, cannot be presented without an inverse inside of an inverse, while admits a presentation without nested inverses. Finally, as in Subsection 3.1, we see that if is hermitian, the real structure preserves , and its real points are related to the real free zero set of from the introduction, .
4.2. A real Nullstellensatz for some free zero sets
The proof of Theorem 4.5 requires a lemma from commutative algebra and an embedding into a free skew field.
Lemma 4.2**.**
Let be such that , and consider
[TABLE]
Let be the union of irreducible components of for which and is not identically zero on any component of . Similarly, let be the union of irreducible components of such that and is not identically zero on any component of . Then and is irreducible.
Proof.
By assumption we have . It is clear that . Now let be a component in and suppose . Then contains a Zariski dense subset of points with . Fix such a point and let be arbitrary. Since , there clearly exists such that
[TABLE]
Therefore for every . Since algebraic sets in a complex affine space are closed with respect to the Euclidean topology, we get . Thus , a contradiction. Hence and therefore .
Let be the coordinate ring of . Then is not a zero divisor in by the definition of , and neither is by the previous paragraph. Therefore embeds into , where is the multiplicative set generated by . Let be the ideal in generated by the entries of . Then \mathbb{C}[\omega,\upsilon]\big{/}\sqrt{J} is the coordinate ring of and by the previous paragraph,
[TABLE]
since localization is exact [Eis95, Proposition 2.5] and commutes with the radical [Eis95, Proposition 2.2, Corollary 2.6 and Corollary 2.12]. Note that matrices are invertible over . Therefore the ideal in
[TABLE]
is generated by the entries of . By (4.1) we thus have , so is an integral domain and is irreducible. ∎
Let and be two freely noncommuting variables.
Lemma 4.3**.**
Let be nonconstant. Then the ideal in is formally rationally resolvable (by pairing with the resolvent ), and the quotient algebra embeds into a free skew field.
Proof.
First we claim that . For every element we have
[TABLE]
for and . Hence if , then is zero on for every . Since is Zariski dense in , we conclude that . Moreover, and clearly generate the same ideal in . Therefore the ideal is formally rationally resolvable with the rational resolvent . Consider the homomorphism
[TABLE]
defined by . Let be the set of words not containing as a sub-word and let . If is the canonical projection, then it is easy to see that is an isomorphism of vector spaces. On we define a degree function by setting , where is the number of ’s in , is the number of ’s in , and is the length of . We extend to a function by
[TABLE]
where is ordered lexicographically.
As a subalgebra of a free group algebra, admits a natural basis consisting of reduced words in . For each such word we define analogously as above, where is now the number of in . Similarly as above we obtain the extension .
Since the elements of are freely independent of and , by looking at the highest terms with respect to and one observes that
[TABLE]
for every . Therefore is injective, so is an embedding. Hence we are done because the free group algebra embeds into a free skew field (see e.g. [Coh06, Corollary 7.11.8]). ∎
Proposition 4.4**.**
Let be nonconstant and let . Then there exists such that
[TABLE]
for all implies . In particular, has the Nullstellensatz property.
Proof.
By Lemma 4.3 and Theorem 4.1, the ideal is geometrically rationally resolvable has the Nullstellensatz property. The existence of the bound then follows by [KVV17, Theorem 3.9]. ∎
Theorem 4.5**.**
For a nonconstant assume that for some . Let . Then if and only if .
Proof.
Let be such that for some and . Let be a -tuple of generic matrices, and two additional generic matrices. Then since is invertible. By Lemma 4.2 there exists a unique irreducible component of such that and are not identically 0 on .
Since is hermitian, inherits the real structure from . Note that the derivative of at with respect to equals , where are the standard matrix units. The Jacobian matrix of the system of equations at is then equal to
[TABLE]
Therefore is a nonsingular point of , so is Zariski dense in by Proposition 3.1. Because vanishes on , it also vanishes on . Since is the unique component of on which does not constantly vanish, we have
[TABLE]
for all . Since can be taken arbitrarily large, we have by Proposition 4.4. ∎
4.3. A Positivstellensatz for hereditary quadratic polynomials
Let be a hermitian hereditary quadratic polynomial. That is,
[TABLE]
where is a hermitian matrix, is the column vector consisting of the variables , and . Then if and only if is not a sum of (hermitian) squares (this is not true for more general polynomials, e.g., ).
Corollary 4.6**.**
Let be a nonconstant hermitian hereditary quadratic polynomial with , and let be an auxiliary noncommuting variable. If , then if and only if
[TABLE]
for some with .
Proof.
If , then , where is viewed as an element of . Since is also a quadratic hereditary polynomial, there exist with such that
[TABLE]
by [HMP04, Theorem 4.1 and Section 4.2.c] (or rather its version over ). Moreover, by Theorem 4.5.
Suppose (4.2) holds. Let be such that . If then and hence . ∎
Remark 4.7*.*
In general, does not imply that is of the form
[TABLE]
i.e., does not necessarily belong to the quadratic module generated by . An example with and for is a consequence of [D’AP09, Section 3.1]. Thus the slack variable of Corollary 4.6 is necessary.
Remark 4.8*.*
Corollary 4.6 is a rare example of an “if and only if” noncommutative Positivstellensatz. Another one appears in [HKM12] and applies to quadratic whose positivity set is convex. For such our Corollary 4.6 can be readily proved as a consequence of [HKM12, Theorem 1.1(1)].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[AM 16] J. Agler, J. E. Mc Carthy: The implicit function theorem and free algebraic sets , Trans. Amer. Math. Soc. 368 (2016) 3157–3175.
- 2[Ami 57] S. A. Amitsur: A generalization of Hilbert’s Nullstellensatz , Proc. Amer. Math. Soc. 8 (1957) 649–656.
- 3[BS 15] N. R. Baeth, D. Smertnig: Factorization theory: from commutative to noncommutative settings , J. Algebra 441 (2015) 475–551.
- 4[BGM 06] J. A. Ball, G. Groenewald, T. Malakorn: Bounded real lemma for structured noncommutative multidimensional linear systems and robust control , Multidimens. Syst. Signal Process. 17 (2006) 119–150.
- 5[Bec 82] E. Becker: Valuations and real places in the theory of formally real fields , Real algebraic geometry and quadratic forms (Rennes, 1981), 1–40, Lecture Notes in Math. 959, Springer, 1982.
- 6[BHL 17] J. P. Bell, A. Heinle, V. Levandovskyy: On noncommutative finite factorization domains , Trans. Amer. Math. Soc. 369 (2017) 2675–2695.
- 7[BR 11] J. Berstel, C. Reutenauer: Noncommutative rational series with applications , Encyclopedia of Mathematics and its Applications 137, Cambridge University Press, Cambridge, 2011.
- 8[BCR 98] J. Bochnak, M. Coste, M.-F. Roy: Real algebraic geometry , Results in Mathematics and Related Areas (3) 36, Springer-Verlag, Berlin, 1998.
