2.2. The proof of Lemma 2.1 [03D2]
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
2.2. The proof of Lemma 2.1
We will describe a coherent subdivisions of (alternatively ), which is isomorphic to . We hope that the method, which generalizes barycentric subdivisions, may find other applications in the future.
Definition.
Suppose that are polytopes such that is contained in the relative interior of some face of . Then the result of pulling is by definition the coherent subdivision of which is induced by the heights on , and on all faces of that do not contain .
The case is used in [GP88] in order to prove that the space between and can be triangulated without new vertices.
Figure 5: The pulling subdivision .
We can describe this subdivision combinatorially as follows. The faces of are all sets of the form for faces and with (including ) whose normal cones intersect in their relative interiors. That is, there should be a normal vector which is maximized over precisely on , and over precisely on . More generally, if is in the relative interior of a face of a polyhedral complex, then pulling will affect all faces that contain in the manner outlined above. If the original subdivision was coherent, then the pulling subdivision will remain coherent. This procedure generalizes the well studied pulling subdivisions where is a point [Grü67, § 5.2] or [Lee97].
We use these pullings in order to construct a generalized barycentric subdivisions below. We start with a purely combinatorial definition. For a poset , the poset/simplicial complex of chains in is denoted .
Definition.
Suppose is an order preserving, non-rank-increasing correspondence between the graded posets and . Define the barycentric subdivision of with respect to as the subposet
of the product poset .
If has only one element, this specializes to . In our applications, will be clear from the context, and will write instead.
One example of such a arises in the following situation. Say that a polytope is a Minkowski summand of the polytope , if there is an , and a polytope such that . This is true if and only if the normal fan of refines the normal fan of [Smi87]. So there is an order preserving, non-rank-decreasing correspondence on the level of the normal fans which turns into on the level of the face lattices.
Definition.
Suppose that is a Minkowski summand of . Define the barycentric subdivision of with respect to as follows. Start with , and proceed by decreasing dimension of faces . Pull the translate of the corresponding face of in the relative interior of .
The usual barycentric subdivision appears as the special case where is a point.
![[Uncaptioned image]](https://arxiv.org/html/math/0205321v1/bsd.png)
Figure 6: The barycentric subdivision of with respect to the corresponding face .
Combinatorially, the face lattice is given by . An element corresponds to the convex hull of the copies of within the ’s:
This polytope is the image under an affine embedding of the product of with an -simplex.
The notion generalizes to the situation of two polyhedral complexes with a realized order preserving, non-rank-increasing correspondence between their face posets. We will use this in Section 3.3 for the identity correspondence of .
Lemma 2.3.
There is a coherent subdivision of which is combinatorially isomorphic to the restriction to of the product subdivision .
Proof.
Here, is a Minkowski summand of . Let be a piecewise linear concave function with domains of linearity given by . Now induces another piecewise linear (non-concave) function on , which is in -direction on , and constant in -direction.
Figure 7: The function on .
The function is strictly concave wherever is non-concave, so that for large , the function will be concave. Its domains of linearity are products of simplices that correspond to simplices of times simplices of . ∎
Now Lemma 2.1 follows if we start from and in stead of and .