1. Preliminaries [04QN]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
1. Preliminaries
1.1. Balanced polyhedra
Definition 1.
A subset is called a proper rational polyhedral complex (or just a polyhedral complex in this paper) if it can be presented as a finite union of closed sets in called cells with the following properties.
- •
Each cell is a closed convex (possibly semi-infinite) polyhedron. The dimension of the cell is, by definition, the dimension of its affine spun, the smallest affine subspace of which contains it. We call a cell of dimension a -cell.
- •
The slope of the affine spun of each cell is rational. I.e. the linear subspace of parallel to the affine spun is defined over .
- •
The boundary (i.e. the boundary in the corresponding affine spun) of a -cell is a union of -cells.
- •
Different open cells (i.e. the interiors of the cells in the corresponding affine spuns) do not intersect.
Informally speaking, a proper polyhedral complex in is a cellular space where each cell is a convex polyhedron with a rational slope and where some cells are allowed to go to infinity.
As usual, the dimension of is the maximal dimension of its cells.
Definition 2.
A polyhedral -complex is called weighted if there is a natural number , called weight, prescribed to each of its -cell . (Of course, any polyhedral complex can be considered as a weighted polyhedral complex by prescribing 1 to each -cell.)
Let be a weighted polyhedral -complex. Note that its complement consists of a finite union of connected components. Let be an -cell.
Recall that by Definition 1 the -cell has a rational slope in . Therefore, it defines an integer covector
up to its sign. Here are the characteristic properties of .
- •
The kernel of is parallel to .
- •
is a primitive (i.e. non-divisible) integer covector .
Furthermore, even the sign of becomes well-defined once we co-orient .
Polyhedral complexes that appear in this paper have the following additional property.
Definition 3.
A weighted polyhedral -complex is called balanced if for every -cell the following condition holds. Let be the -cells adjacent to . A choice of a rotational direction about defines a coherent co-orientation on these -cells. The balancing condition is

Example 1.
Consider the function
This is a convex piecewise-linear function . We define the primitive complex as the corner locus of , i.e. the set of points where is not smooth is .
Note that is a balanced proper polyhedral complex in . Its -cells are formed by the points where at least of the functions achieve the value of . In fact, it is easy to see that topologically is the cone over the -skeleton of the -simplex. The fact that is balanced follows from Proposition 1.2.

The following example is a generalization of the previous one. As the following propositions show, it is the fundamental example of balanced polyhedra.
Example 2.
Let be a finite set and let be any function. Let be the convex hull of . We associate the following polyhedral complex to .
Take the Legendre transform of
Here and is their scalar product. Since the maximum is taken over a finite set, the result is a convex piecewise-linear function. We define as the corner locus of (recall that this is the set of points where is not smooth).
Recall that a polyhedron in is called lattice if all its vertices belong to . A subdivision of a polyhedron into smaller polyhedra is called lattice if all the polyhedra of the subdivision are lattice.
Proposition 1.1.
The set from Example 2 is a proper rational polyhedral complex dual to a certain lattice subdivision of .
Proof.
We start by associating to a certain lattice subdivision of . Let be the overgraph of , i.e. the set of vertical rays upwards in starting at the points of the graph of . The convex hull of is a semi-infinite closed polyhedral domain. The projections of its finite faces to form the subdivision .
We claim that is a polyhedral complex dual to . Namely, a -dimensional polyhedron in , , gives a -cell of . This cell is compact iff .
This claim follows from the duality property of the Legendre transform. Consider the function whose graph is is given by the lower boundary of the convex hull of . If is convex then the function extends and is defined on the whole polyhedron , not just on its lattice points. It is a convex piecewise-linear function. The Legendre transform of coincides with the Legendre transform of . (In fact the function can be defined by applying the Legendre transform to twice.) By duality, the graph of has the facets en lieu of the vertices of the graph of and so on. ∎
Note that is naturally weighted. Indeed, an -cell comes as a corner between the graphs of two integer linear functions. The difference between these functions is an integer covector . We define as the maximum integer divisor of .
Proposition 1.2.
The weighted polyhedral complex is balanced.
Proof.
The proposition easily follows from the definition of the covectors for the -cells adjacent to an -cell . ∎
Remark 1.3.
Note that several different functions define the same complex by the construction of Example 2. Here is the list of ambiguities.
- (1)
Let be a function different with by a constant. Then .
- (2)
Let , where and is defined by . Then .
- (3)
Let be such that its convex hull coincides with , the convex hull of . Let (resp. ) be the maximal convex function such that (resp. ). Suppose that . Then .
The following proposition shows that Example 2 is fundamental.
Proposition 1.4.
Proof.
First we define a convex piecewise-linear function whose corner locus is and then choose a function such that is the Legendre transform of . Note that the finiteness condition in Definition 1 implies that there are finitely many connected components in .
We define the function inductively. Choose any connected component of as a “reference component”. Define . Suppose that is a component of such that there exists an adjacent component where is already defined.
Let be the -cell of of separating from . Let be the covector associated to (recall that the weight of is incorporated into ) with the co-orientation directed from to . Let be the linear function extending . We define . By the balancing condition the result does not depend on the choice of the adjacent component where is already defined.
To define we take the Legendre transform of . This amounts to associating each component a point equal to the gradient of and setting . Thus, the number of elements of the set is equal to the number of components of .
The ambiguity Remark 1.3.3 comes from taking the Legendre transform of non-convex functions . It coincides with the Legendre transform of the underlying convex function . (In fact, nothing changes if we assume that is defined on the whole by letting for .) The ambiguities Remark 1.3.1 and 1.3.2 come from the ambiguity in assigning a linear function for . ∎
Corollary 1.5.
To any -dimensional balanced polyhedral complex one may associate a convex lattice polyhedron (defined up to translation) and a lattice subdivision of .

The next corollary illustrates the strength of the balancing condition that we require just for the -cells. We do not use this corollary elsewhere in the paper.
Let be a vertex of and let be the edges adjacent to . Let , , be the primitive integer vectors in the direction of . Suppose that each is adjacent to exactly connected components of (note that this is a general position situation).
Corollary 1.6.
If is a balanced -complex then there exists a weight for , , such that
Proof.
By Proposition 1.4 comes as a corner locus of a convex piecewise-linear function on . Let , be the equations of the linear functions on the adjacent components of . Then are the vectors in normal to the linear portions of the graph of adjacent to .
The -version of the vector product associates a normal vector to other vectors in . We take all possible such products among and project them to . The result is the vectors which are multiples of . By linear algebra the sum of these vectors is zero. ∎
1.2. Maximal polyhedral complexes and their decomposition into primitive pieces
Definition 4.
Proposition 1.7.
The minimal positive volume of a lattice polyhedron in is . Any lattice polyhedron of volume can be identified with the standard simplex (see (1)) by an element of .
Here stands for the group of affine-linear transformations of whose rotation part belongs to .
Proof.
We may assume that our lattice polyhedron is a simplex, since otherwise we can triangulate it to smaller polyhedra. Fix one of its vertex and consider the integer vectors connecting it to other vertices. The volume of the simplex is equal to the determinant of the sublattice generated by these vectors divided by . ∎
Example 3.
Proposition 1.8.
Any dual -complex is the result of a translation of in .
Proof.
Such a complex is determined by a function , i.e. by numbers . Recall (see Example 2) that is the corner locus . If for all than . Adding the same real number to all numbers does not change . Changing by results in a translation by in the direction of . ∎
Remark 1.9.
Not for every there exists maximal dual -complex. E.g. a lattice simplex in , whose vertices are , , and , cannot be further subdivided. On the other hand, a maximal dual -complex is, of course, not unique.
Proposition 1.10.
If is a maximal dual -complex then is homotopy equivalent to the bouquet of copies of .
Proof.
Because of its maximality, the polyhedron is dual to a unimodular triangulation of . Such a triangulation cannot be further subdivided and therefore its vertices are all the lattice points of . Therefore, is homotopy equivalent to . ∎
Here is a way to canonically cut a maximal complex into standard-looking subsets . We define the cutting locus as the following simplicial complex that is partially dual to . The vertices of are the baricenters of all bounded -cells, from . The simplices of have the baricenters of positive-dimensional cells in the embedded towers as its vertices. Note that is a finite simplicial -complex.
Definition 5.
The connected components of are called the primitive pieces of . We denote them with . These open sets are parametrized by the vertices of or, equivalently, by the -simplices of the triangulation of .
Proposition 1.11.
For each there exists such that is an open set in the primitive complex from Example 1.
Proof.
This proposition also follows from the duality with a unimodular triangulation of . Let be a primitive piece. It corresponds to a simplex of volume in . There is an element of which takes this simplex to the standard simplex (see (1)). Then the image of by the adjoint to the inverse of this element is contained in a dual -complex. Such a complex is the result of a translation of by Proposition 1.8. ∎
Recall that a polyhedral complex is called generic at a point from an open -cell if there exists a neighborhood isomorphic to .
Thus, Proposition 1.10 implies that a maximal dual -complex is a generic polyhedron. In topology such polyhedra often appear as the so-called special spines of smooth manifolds. In the next section we see that can be compactified so as to become a spine of the polyhedron after puncturing it in the interior lattice points.
1.3. Toric varieties and compactification of balanced polyhedra
Consider the complex algebraic torus , where . It is a commutative Lie group under multiplication. The 2-form
| (2) |
is an invariant symplectic form on . There is an action of the real torus on by coordinatewise multiplication (we treat as the unit circle). The action of is Hamiltonian and thus we have a well-defined moment map (we refer to [1] for the general definition or to a textbook, e.g. [2])
| (3) |
Let be a convex polyhedron with integer (from ) vertices. Recall (see e.g. [4]) that there is a complex toric variety . One way to construct it is to consider the Veronese embedding defined by the linear system of monomials associated to . Here we associate to a point a monomial . We define as the closure of the image of the Veronese embedding. Note that the standard, Fubini-Study, symplectic form on the ambient space defines a symplectic form on (as long as the variety is non-singular). In particular, it gives a symplectic form on that invariant with respect to the action of . This gives us a moment map with respect to
The image of this embedding is the interior . The map can be compactified to the moment map .
The maps and both have the orbits of as their fibers. Thus, they define a natural reparametrization
Definition 6.
Let be an -dimensional balanced polyhedral complex. By Proposition 1.4 there is a convex lattice polyhedron dual to . We define , the compactification of , by taking the closure of in . We call the boundary of . For convenience from now on we identify and .
Proposition 1.12.
Let be a dual -complex and let be a -dimensional face. Then the intersection is a compactification of a dual -complex . If is maximal then is also maximal.
We prove this proposition simultaneously with the following proposition describing the behavior of near infinity. Recall that a supporting vector at a face is a vector such that reaches its maximum precisely over , where is the orthogonal projection in the direction of .
Proposition 1.13.
The complex from Proposition 1.12 can be obtained in the following way. Let be the linear -subspace parallel to the face . Let be a supporting vector at . For a sufficiently large we have .
Proof.
From the finiteness condition in Definition 1 we have that the complex does not depend on the choice of and as long as is supporting and is sufficiently large. The proof of Proposition 1.4 ensures that is a dual -complex. If is maximal then it is dual to a triangulation of into simplices of minimal volume. Such a triangulation induces a triangulation into simplices of minimal volume on the faces and thus is also maximal. ∎
If is a maximal dual -complex then it is generic everywhere except at the points of its boundary . The following proposition describes the local topology of near the boundary. It is a corollary of Proposition 1.12.
Proposition 1.14.
Suppose that is a maximal dual -complex. A point in has a neighborhood of one of the following types: , where . Here is the dimension of the open cell of which contains while is the dimension of the open face of which contains .
We call a point with such a neighborhood a -point of .
Remark 1.15.
The concept of generic polyhedron is closely related to that of special spine in Topology. We remind its definition. Let be a compact -manifold with boundary and be an -dimensional CW-complex such that its every open cell is smoothly embedded to . The complex is called a spine of if is a deformational retract of . The spine is called special if for any point from an open -cell there exists a neighborhood isomorphic to .
Note that if then all the triangulation vertices of a dual -polyhedron are from then is a spine of . In general, is a spine of the polyhedron minus a small neighborhood of the interior lattice points. Note that can be treated as a special spine of if we treat as a manifold with boundary and corners.
1.4. Stratified fibrations
Let and be smooth manifolds, be a lattice polyhedron of full dimension and be a maximal dual -complex.
Definition 7.
A smooth map is called a stratified -fibration if
- •
The restriction of to any open -cell is a trivial fibration with the fiber ;
- •
for each integer pair , there exists a smooth “model” map , where , such that any -point of has a neighborhood such that
is diffeomorphic to the model map. The model map depends only on and .
The map is called the -fiber degeneration; the fiber is called the -fiber of .
The following proposition is a direct corollary of Definition 7.
Proposition 1.16.
Let be a stratified fibration over the compactification of a maximal dual -polygon . For any open -cell of the restriction of to is a trivial fibration over with the fiber .
1.5. Hypersurfaces in toric varieties
Let be a Laurent polynomial
where and is a multi-index.
We recall that the Newton polyhedron of is the convex hull in of the set of all indices such that . Since by assumption is a polynomial this set is finite and is a bounded convex lattice polyhedron. We also call the Newton polyhedron of the hypersurface . According to [4] we call the image the amoeba of .
For the rest of the paper we assume that has a non-empty interior in . Otherwise after a suitable (multiplicative) change of coordinates the polynomial can be transformed to a polynomial in smaller number of variables.
Let be the complex toric variety (see e.g. [4]) associated to . We define as the closure of the hypersurface in . Taking the Newton polyhedron for is a canonical choice. Of course, we can take such compactification for any convex lattice -polyhedron , even if it was not the Newton polyhedron of . However the choice of the Newton polyhedron of as produces the best results as the next proposition shows. Recall that in the toric construction there is a -dimensional complex toric subvariety associated to any -dimensional face .
Proposition 1.18.
The hypersurface is disjoint from the points (i.e. the 0-dimensional toric varieties) corresponding to the vertices of , but intersects all the tori corresponding to any positive-dimensional face of .
Furthermore, this property characterizes in the following sense. Let be a convex lattice polyhedron in with a non-empty interior and be the closure of in . If a hypersurface is disjoint from the points corresponding to the vertices of but intersects all the tori corresponding to positive-dimensional faces of then .
Remark 1.19.
Note that even though is unique by this proposition, the polyhedron itself is not unique. The image of by a homothety with an integer coefficient for corresponds to the same toric variety.
Proof.
Proposition 1.18 follows from the following Lemma. ∎
Lemma 1.20.
Let be a face. The intersection coincides with the hypersurface cut on by the closure of the zero set of the following -truncation of the polynomial
Proof.
To prove the lemma it suffices to note that the monomials from have higher order of vanishing when . ∎
Remark 1.21.
The property of from Proposition 1.18 can be alternatively reformulated in terms of the moment map , see 1.3. The image is disjoint from the vertices of but intersects every positive-dimensional face of . According to [4] the image is called the compactified amoeba of . This restatement is equivalent to the property from Proposition 1.18, since for any face we have .
Example 4.
Let . Then is a hyperbola. The Newton polygon is a square and the corresponding toric surface is the hyperboloid .
Take now . The corresponding toric surface is . The images of under the associated moment maps are sketched on Figure 4.

The following example treats projective hypersurfaces.
Example 5.
Let be a projective hypersurface of degree not passing through the points . Then is given by a polynomial whose Newton polyhedron is
Vice versa, and the closure of in is .
1.6. Pairs-of-pants in higher dimensions
Definition 8.
Let be the union of the generic hyperplanes in . Let be the union of their -neighborhoods for a very small .
The complement is a manifold with boundary and corners. We call the -dimensional pair-of-pants. We call the -dimensional open pair-of-pants
Immediately we have the following proposition.
Proposition 1.22.
A pair-of-pants is a compact manifold with boundary. An open pair-of-pants is diffeomorphic to the pair-of-pants minus its boundary.
Remark 1.23.
Note that the choice of generic hyperplane in is unique up to the action of . Thus can be given a canonical complex structure.
Note that is diffeomorphic to the Riemann sphere punctured 3 times, while is diffeomorphic to a closed disk with 2 holes. Thus Definition 8 agrees with the classical, one-dimensional, pair-of-pants definition.
The following proposition describes a natural stratification of the boundary .
Proposition 1.24.
We have the following canonical decomposition of the boundary , where is a -dimensional smooth manifold such that each its connected component is a trivial -fibration over . Different parts do not intersect: , if , but the closure of contains for all . The number of connected components is .
Proof.
Connected components of the manifold can be obtained as the intersections of the boundaries of the -neighborhoods of different hyperplanes from . ∎