About four months ago, I posted a question on MathOverflow concerning a lemma in Richter-Gebert’s book Realization spaces of polytopes. Let me quickly explain the setup. We are dealing with semialgebraic sets in which are defined by polynomials with rational coefficients. A general semialgebraic set is defined by a Boolean combination of equations, inequations and (strict or weak) inequalities. If the only Boolean junction required to write the set is conjunction, then the set is basic and if, in addition, only equations and strict inequalities are required, it is primary basic.
Primary basic semialgebraic sets are (one possible choice of) building blocks for general semialgebraic sets and they are compactly specified by a polynomial system of the form for . On these sets one seeks a notion of equivalence which preserves multiple of their characteristics simultaneously, in particular the homotopy type and the algebraic number type, i.e., what is the smallest field extension over required to write down some point of the semialgebraic set? The definition of such a notion, called stable equivalence, in Richter-Gebert’s book is the subject of my question. Here it is:
Two primary basic semialgebraic sets and are rationally equivalent if there exists a homeomorphism between them which is in both directions defined by rational functions with rational coefficients. Next consider and let be its coordinate projection to the first coordinates. This is a stable projection if there exist polynomials which have degree 1 in the coordinates and such that we may recover from its projection via
The sets are stably equivalent if they are in the same class of the smallest equivalence relation which is generated by rational equivalence and stable projection. Richter-Gebert states in his Lemma 2.5.2 that stably equivalent sets have the same homotopy type and algebraic number type. This is pretty obvious for the rational equivalences. In the rest of this article, I will concentrate on the stable projection part of this claim.
You may be wondering why the polynomials need to be affine-linear in the coordinates which should be “recovered” from the projection . This is required to preserve the algebraic number type. Solving equations of higher degree, such as may increase this measure of algebraic complexity, while linear equations surely do not. The proof for the algebraic number type in the book is slightly wrong but easily fixable and the statement holds (if the equations are affine, then there need not be purely rational coordinates, as is claimed, for every but Cramer’s rule implies that their coordinates are in the field extension of generated by ). This is the reason for restricting to affine-linear equations. To prevent a lingering confusion at this point, let me clarify that the inequalities being affine-linear is not necessary for any argument presented here — they could be non-linear if needed.
Notice that in the above definition, every fiber is the relative interior of a polyhedron. For my dissertation, I needed to extend this machinery to fibers which are more general convex sets, namely spectrahedra (the intersections of affine-linear spaces of symmetric matrices with the cone of positive-semidefinite matrices) — in that case I need some non-linear inequalities. The problem: there is no proof given in the book for the homotopy equivalence claim from which I could start. This led to my MathOverflow question.
My initial hope was to find a general theorem in a topology textbook of the sort “this diagram chase constructs a section, therefore the two spaces are homotopy-equivalent” but that did not happen. In the sections of Hatcher’s Algebraic Topology dedicated to fiber bundles and fibrations I found theorems that say, when is contractible, then we essentially have a fiber bundle. But the idea behind a stable projection is different: we want to deduce from the fact that the fibers are uniformly defined (by the polynomials and ) and extremely simple (they are polyhedra, therefore convex and homotopically trivial with something as simple as straight line homotopies), that and should not differ in terms of homotopy. I discussed this view at length with my colleagues Andreas Kretschmer and Yuri Santos Rego for whose time and input I’m very thankful. This eventually led to the following simple counterexample to the claim in the book:
Consider . This set is the union of the -axis with the hyperbola . Its projection onto the -coordinate is the entire real line and the definition of already proves that this projection is stable, because there is one equation defining in terms of which has degree 1 in . But the line is path-connected whereas is not: for , the unique coordinate with tends to while with , this tends to . At , all give a point in the fiber , but this does not path-connect the two branches of the hyperbola in the affine plane. Two spaces which differ in their path-connectedness cannot be homotopy-equivalent.
This counterexample can be “homogenized” to
so that its fibers are defined by homogeneous linear forms in . The space and its projection still differ in path-connectedness and therefore are a counterexample to homotopy equivalence under the slightly more restricted definition of stable projection in the article by Richter-Gebert and Ziegler: Realization spaces of 4-polytopes are universal.
In the months following that discovery I think I obtained a fairly good understanding of why the definition in Richter-Gebert’s book fails to give homotopy equivalence and what can be done to fix it. This is in no small part thanks to resources pointed out by Richter-Gebert about earlier attempts to give a satisfying notion of stable equivalence, including his own variants of the definition. These are described in the last section. Before that, I want to give a few technical remarks and proof snippets from my perspective as a topology pedestrian.
Let us assume that and are primary basic semialgebraic sets, is the projection of and it is stable in the sense that , where I’m leaving the precise restrictions on and unstated for the moment. But let’s assume that they are polynomials and that each fiber is a convex set.
The most natural approach to proving homotopy equivalence of the set to its stable projection is to obtain a covering of it by local sections for the projection . That is, for every a small neighborhood around and a continuous map such that is the identity.
To show that this is sufficient for homotopy equivalence, let me recite some basic facts about the topology on semialgebraic sets. These facts can be pieced together from general results found among the first 40 pages of Bredon’s book Topology and geometry. Consider a primary basic semialgebraic set with its induced euclidean topology. This is surely a second-countable Hausdorff space because its ambient is. It is locally closed (immediate from its defining polynomials) and locally compact which implies that it is paracompact. This in turn ensures the existence of subordinate partitions of unity to any open covering.
In a paracompact space, we may assume that has been thinned out to a locally finite cover indexed by a subset . Then, we obtain functions which partition unity on and such that the support of is confined to a closed set inside . This allows us to define a global section That this summation is finite follows from the local finiteness of the partition of unity. It is well-defined because vanishes outside of the domain of due to the subordination of the ’s. The function is continuous because and are continuous. Lastly, the sum is a convex combination of over finitely many . By definition satisfies and . Since the fiber is convex, this convex combination remains inside it. Thus is a section of .
As an aside: By standard analysis constructions, we can even demand smooth on the open neighborhood of . Hence, the differentiability properties of depend entirely on how smooth we are able to make the local sections , but in the following I want to focus on the existence of continuous local sections only. You are invited to keep this in mind for the time when local sections are constructed.
Having the global section of , it is easy to recognize that , which is a homeomorphic copy of inside of , is in fact a strong deformation retract of : since the fibers over are convex sets, straight-line homotopies retract onto . All we needed the section for was to choose a “representative point” continuously for every fiber of on . The homotopy itself is then very easy. This yields homotopy equivalence from local sections.
However, not every homotopy equivalence allows for the existence of local sections. Consider the semialgebraic set :
This space is homeomorphic to a line . Its projection onto the -axis is the line as well. Thus, we have homotopy equivalence but a local section at does not exist because is almost everywhere the graph of a discontinuous function around .
Let’s see what the problem is with obtaining local sections in our setting. Fix and we may fix a point . The goal is to extend this particular solution to the system and continuously to a small neighborhood of . Locally, the strict inequalities make no problems at all, so we concentrate on the equations . Now it simplifies the situation to assume that they are linear in and write them as a system where is a matrix whose entries are polynomials in and is a column vector of that sort. This system may be square, under- or overdetermined.
The parametrized family of matrices has a generic rank in the affine space . Let be any point in and consider a minimal spanning set of columns of . Their number is the rank and for them to be linearly independent means that there is a square submatrix in this collection of columns whose determinant does not vanish. Consider this same subdeterminant of as a polynomial in . Since it does not vanish for some , its zero locus is a lower-dimensional variety and thus the rank of is at least outside of this locus. This shows that the maximum rank of any particular , , is in fact the rank attained by almost everywhere. In every sufficiently small neighborhood of , the rank of can only increase (if it does increase, that means is one of those special points in the vanishing locus of a determinant) — equivalently, the dimension of the solution space to the homogeneous equations can only decrease. This holds on every irreducible real algebraic variety in place of (the generic rank might be lower than on the entire space but that lower rank will be attained almost everywhere), but it is not necessarily true on primary semialgebraic sets.
Brushing that issue aside, if the rank is locally constant, that is, the generic rank is attained on every single point inside an open neighborhood of any chosen , then local sections are easy to construct by applying Cramer’s rule to the full-rank square submatrix examined in the previous paragraph: the particular solution extends to a unique surface of solutions for the systems around . A problem arises only at those points where the generic rank rises in every neighborhood. This is precisely the failure mode of the above counterexample at .
After these detailed preparations, we are ready to see notions of stable projection which preserve homotopy type.
As argued in the previous section, if Richter-Gebert’s definition of stable projection would be strengthened to require that the fiber polyhedra have the same dimension locally around every point of , then we obtain local and, by convexity and partitions of unity, a global section.
Suppose that the fibers in a stable projection are convex and are described either by (non-linear) strict inequalities or by linear equations in . In the case of strict inequalities, local sections obviously exist because around a given point any close enough to can just use by continuity of the strict inequalities. In the case of only linear equations, we have the global section . If you can decompose your projection into a sequence of such simple projections, homotopy equivalence follows.
The hyperbola counterexample above uses only a single affine equation in , so even if inequalities and equations are separated in the definition, affine equations are not admissible.
In their fantastic book Computational synthetic geometry, Section 6.3, Bokowski and Sturmfels give a concise definition of stable equivalence while discussing the universality theorem of Mnëv which was brand new at the time. Two semialgebraic sets and are stably equivalent according to Bokowski and Sturmfels if there exists a locally biregular homeomorphism such that . In this setup, rational equivalence and stable projection have been fused into one concept represented by the map . The homotopy equivalence of and is obvious: is just which is a deformation retract of and this is in turn homeomorphic to .
Günzel in The universal partition theorem for oriented matroids has a very similar definition of equivalence. He is interested in differential-geometric features, so the restriction to polynomials is dropped. The space is replaced by a smooth manifold under a diffeomorphism . As far as I can see, the manifold is not claimed to be contractible, so that this does not necessarily entail homotopy equivalence of and . But if is contractible, then the proof is as easy as above. In any case, this product with a smooth manifold is probably the preservance of the “singularity structure” mentioned in Richter-Gebert and Ziegler’s bulletin cited above. This claim does not appear in the book version of the lemma.
In my own work about a universality theorem for Gaussian conditional independence models, I wanted to recover homotopy and algebraic number type as well as algorithmic complexity which is why I favor maps defined globally by polynomials instead of locally, as in Bokowski-Sturmfels. In addition, I found Richter-Gebert’s view of uniformly varying fibers more convenient in proofs than having this map around a product with .
What I really needed for my spectrahedral fibers were affine-linear equalities in which were shown above to cause problems if the dimension of the solution space can vary. In my case, this could be cured by always having zero-dimensional linear spaces in the definition of the fibers. In fact, the definition of stable projection I use in my thesis is this: must be recoverable from as all satisfying , and , where and are arbitrary rational functions such that all fibers are convex. The only equations are direct assignments of rational functions in to a subset of the lost coordinates. This may seem like a serious limitation but the Shor normal form, which plays an important role in the universality theorem for 4-polytopes as well, still works with affine assignments and convex fibers only. The existence of local sections is immediate and since the fibers are convex, the previous arguments for the existence of a global section apply.
My verdict on this issue is that the fibers need to have constant dimension. Convexity, unexpectedly, plays a large role in the proofs I presented, as they rely on a partition of unity to paste local sections together.
This was a long article which resulted from reading some amazing papers from the 90s and many long discussions with my colleagues in Magdeburg. I think I’ve gained a solid understanding of the problem and possible fixes. The exposition of this topic had a month or two more delay than they should have had because my thesis submission, the move to Leipzig and new projects took precedence. And it is still not over. I am in contact with Jürgen Richter-Gebert about the problem in his book and we are looking to establish a reading group with the aim of publishing a correction note in due time.