Intersection Bodies of Polytopes: Translations and Convexity

We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be extended to polynomials in variables $t\in \mathbb{R}^d$ within each region of the arrangement. In dimension $2$, we give a full characterization of those polygons such that their intersection body is convex. We give a partial characterization for general dimensions.


Introduction
In the field of convex geometry, intersection bodies have been widely studied from an analytical viewpoint, and mainly in the context of volume inequalities.Originally introduced by Lutwak [Lut88], they have played a significant role in solving the Busemann-Petty problem, which asks to compare the volume of two convex bodies based on the volumes of their linear sections [Gar94a; Gar94b; Kol98; GKS99; Zha99].Unlike its more famous counterparts, the projection body, the intersection body IK of a star body K is not invariant under affine translation.Furthermore, an intersection body can be both convex and non-convex.Convexity is certified Busemann's theorem [Bus49], which states that IK is convex if K is a convex body centered at the origin (i.e., K is centrally symmetric, where the center of symmetry is the origin), and this statement has been generalized to L p -intersection bodies [Ber09].On the other hand, given a convex body K ⊆ R d , there always exists some t ∈ R d such that I(K + t) is not convex [Gar06,Thm. 8.1.8].
The occurrence of non-convex intersection bodies has motivated considerations of various measures for capturing the magnitude of their non-convexity, leading to the study of p-convexity of intersection bodies both over the complex numbers and over the reals [KYZ11;HHW12].Another direction of research concerns an adaptation of the construction of intersection bodies in order to get convexity, which resolves in convex intersection bodies [MR11;Ste16].A different relative of intersection bodies is the cross-section body [Mar92;Mar94]; however, this starshaped set turned out to be non-convex as well, in the general case [Bre99].Summarizing, many of the positive results towards convexity in all these works concern intersection bodies of centrally symmetric star bodies.In contrast, we focus on affine translates, and consider objects which are not necessarily centrally symmetric.
The goal of this article is to investigate the behavior of intersection bodies of polytopes under translations, and to determine under which translations the intersection body is convex.In our previous work [BBMS22] we exhibit rich semialgebraic structures of intersection bodies of polytopes.However, in general, the intersection body IP of a polytope P is not a basic semialgebraic set, and there exists a central hyperplane arrangement which describes the regions in which the topological boundary of IP is defined by a fixed polynomial.Taking advantage of these combinatorial and semialgebraic structures opens up new possibilities to study the question of convexity in the present work.In particular, exploiting this semialgebraicity, we are able to characterize convexity by using elementary geometric arguments.
In this article we introduce an affine hyperplane arrangement associated to a fixed polytope P .We prove that for translation vectors t ∈ R d within a region of this arrangement the polynomials defining the boundary of I(P + t) can be extended to polynomials in t 1 , . . ., t d (Theorem 3.5).In dimension 2, we give a full characterization of those polygons with a convex intersection body.We give a partial characterization for general dimension.
Results.Let P be a full-dimensional polytope in R d .
(iii ) If IP is strictly convex then I(P + t) is strictly convex, for small translation vectors t.
A full classification of the 2-dimensional case is given in Theorem 4.4, and the remaining statements can be found in Proposition 5.4 and Remark 5.5.An example of a strictly convex intersection body is given in Example 5.6.
Overview.The article is structured as follows.In Section 2 we review the main concepts and notation from [BBMS22].In Section 3 we introduce an affine hyperplane arrangement and describe how it governs the behavior of IP under translation of P .We then turn to the characterization of convexity, where Section 4 concerns the 2-dimensional case, and Section 5 the case of general dimensions.
Acknowledgements.We are thankful to Christoph Hunkenschröder for posing a question during a seminar discussion which inspired this work.We thank Andreas Bernig and Jesús De Loera for inspiring conversations about intersection bodies and convexity.We thank Isabelle Shankar for helpful feedback that helped us improve our manuscript.We are thankful to the organizers of the conference "Geometry meets Combinatorics in Bielefeld", where most of our ideas fell into place.Marie-Charlotte Brandenburg was funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) -SPP 2298.

Preliminaries
We will rely on methods and results which were developed in [BBMS22].In this section we review the most important concepts and results we are going to make use of.
Let P ⊆ R d be a convex polytope.The intersection body IP of P is the starshaped set Here, vol d−1 denotes the (d − 1)-dimensional Euclidean volume, and x ⊥ ⊆ R d denotes the linear hyperplane which is orthogonal to x ∈ R d , namely the set x ⊥ = {y ∈ R d | x, y = 0}.
To obtain meaningful results, we may thus assume that P ⊆ R d is a d-dimensional polytope throughout this article.The topological boundary of the intersection body IP is defined by the equation ∂IP = {x ∈ R d | ρ IP (x) = 1}.Since the radial function satisfies ρ IP (λx) = 1 λ ρ IP (x) for every λ > 0, it is completely determined by its restriction to the unit sphere.
The intersection body IP of a polytope is governed by the central hyperplane arrangement We denote the set of vertices of P by vert(P ), and the origin is denoted by 0 ∈ R d .An open chamber C of H(P ) is a connected component of R d \ H(P ).Given such a chamber C, all hyperplanes x ⊥ for x ∈ C intersect P in the interiors of a fixed set of edges.The radial function restricted to such a chamber is a quotient of polynomials where p C is divisible by x 2 .Therefore, the topological boundary ∂IP ∩ C is the zero-set of the (irreducible) polynomial p C x 2 − q C .We repeat a key argument in the proof of (1).Let x ∈ C and Q = P ∩ x ⊥ .The value ρ IP (x) is by definition the volume of Q.This computation is done by considering a triangulation T of the boundary of Q.We extend this to a covering of conv(Q, 0) by considering the set conv(∆, 0) for every simplex ∆ ∈ T such that 0 ∈ ∆.Note that if 0 ∈ P , then this induces a central triangulation of Q. Denoting v 1 , . . ., v d the vertices of a simplex ∆ ∈ T , the volume of conv(∆, 0) = conv(v 1 , . . ., v d , 0) is, up to a constant scaling factor, given by the determinant of the matrix where the vertices v i arise as intersection of x ⊥ with edges of P , i.e.,

Translations and Affine Hyperplane Arrangements
Let P ⊆ R d be a polytope.In this section we consider how the intersection body of P + t transforms under variation of t ∈ R d .Recall from Section 2 that the combinatorial structure of the boundary of I(P + t) is described by the central hyperplane arrangement H(P + t).We thus begin by studying the behavior of this hyperplane arrangement under translation of P .For this, we introduce a new affine hyperplane arrangement L (P ), which captures the essence of H(P + t) under variation of t.We show that within a region R of L (P ) the polynomials describing the boundary of I(P + t), for t ∈ R, can be extended to polynomials in the variables t 1 , . . ., t d .
Let P ⊆ R d be a polytope and let vert(P ) be the set of its vertices.Denote by H v = v ⊥ ⊆ R d the hyperplane though the origin that is orthogonal to a vertex v ∈ vert(P ).As described in the previous section, the collection of all such hyperplanes forms a central hyperplane arrangement H(P ) in R d .For each such hyperplane we define its positive and negative side as We now choose a translation vector t ∈ R d and consider the vertices {v + t | v ∈ vert(P )} of the translated polytope P + t.The hyperplane arrangement H(P + t) is given by the hyperplanes (v + t) ⊥ , where v ranges over the vertices of P .The hyperplane H v+t can be obtained from H v by a rotation r v,t : ||v+t|| , and thus We label each maximal chamber C of H(P + t) with a sign vector s(C) ∈ {+, −} vert(P +t) indexed by the vertices w = v + t of P + t, where The set {s(C) | C maximal chamber of H(P + t)} describes the chirotope or signed cocircuits of the underlying oriented matroid of the hyperplane arrangement [GOT18, Chapter 6.2.3].
. Since e + t is an edge of P + t if and only if e is an edge of P , the claim follows.
We consider the affine hyperplane arrangement We emphasize that there are two hyperplane arrangements in R d which which we consider simultaneously.We have the central hyperplane arrangement H(P + t), which depends on the choice of t, and subdivides R d into open d-dimensional cones, which we call chambers of H(P + t).On the other hand, we have the affine hyperplane arrangement L (P ), which subdivides R d into open d-dimensional components, which we call regions of L (P ).Note that L (P + t) = L (P ) − t by construction.
Example 3.3.Let P be the triangle from Example 3.1.The affine line arrangement L (P ) is shown in Figure 2. Note that the translation vectors t = t 0 , t 1 , t 2 all lie in different regions of the arrangement, despite the fact that the signed cocircuits of H(P + t 1 ) and H(P + t 2 ) agree, as displayed in Figure 1.In the following we show that L (P ) captures the characteristics of H(P + t) under variation of t.More precisely, we show that within a region R of L (P ) the polynomials describing the boundary of I(P + t), for t ∈ R, can be extended to polynomials in t 1 , . . ., t d .
Proposition 3.4.Let P ⊆ R d be a polytope and R be an open region of L (P ).Then the set of signed cocircuits of H(P + t) is fixed for all t ∈ R.
Proof.Let v 1 , . . ., v d be affinely independent vertices of P .By construction of L (P ), R does not intersect A = aff(−v 1 , . . ., −v d ), i.e., R is strictly contained in one side of this hyperplane.Without loss of generality, we assume R ⊆ A + .The points w k = v k + t, for k = 1, . . ., d, are linearly independent vertices of P +t for all t ∈ R d \A.Hence, the subarrangement of H(P +t) consisting of hyperplanes w ⊥ 1 , . . ., w ⊥ d is a simplicial arrangement which dissects R d into 2 d open chambers, where each chamber is the image of an orthant of R d under the linear map f defined by e i → w i for all i = 1, . . ., d.Note that the signed cocircuits are fixed for every t ∈ A + .We now consider H(P + t) as common refinement of all subarrangements formed by d hyperplanes with linearly independent normals.The signed cocircuit of a chamber of H(P + t) is uniquely determined by the signed cocircuits of all subarrangements, and the cocircuits of the subarrangements are fixed for all t ∈ R. Thus, the cocircuits of H(P + t) are fixed for all t ∈ R.
Theorem 3.5.Let R be an open region of L (P ), t ∈ R, and let C t be an open chamber of H(P + t).Then the radial function ρ I(P +t) | Ct of I(P + t) restricted to the chamber C t and for t ∈ R is a polynomial in the variables t 1 , . . ., t d of degree at most d − 1.
Proof.By Proposition 3.4, for a fixed region R the set of signed cocircuits of H(P +t) is fixed.Lemma 3.2 then implies that given a region R, t ∈ R, and a chamber C t of H(P + t), for any vector x ∈ C t the set of edges of P + t which intersect x ⊥ is fixed.Let Q = P ∩ x ⊥ , for a certain x ∈ C t , and let T be a triangulation of ∂Q, as explained in Section 2. Let ∆ ∈ T be a maximal simplex with vertices v 1 , . . ., v d−1 such that 0 ∈ ∆ and, for each i = 1, . . ., d − 1, let a i , b i ∈ vert(P ) such that v i = conv(a i + t, b i + t) ∩ x ⊥ .The volume of the d-dimensional simplex conv(∆, 0) is, up to a multiplicative factor of ±1 x (d−1)!, the determinant of the matrix The determinant of this matrix is a polynomial in the variables t 1 , . . ., t d of degree at most d − 1.Since the volume of Q can be computed as the claim follows.
Example 3.6.Figure 3 shows the continuous deformation of the intersection body I(P + t) of the unit square P = [−1, 1] 2 under translation by t ∈ R 2 within each bounded region of the affine line arrangement L (P ).

Convexity in Dimension 2
For each fixed region R of the affine line arrangement L (P ), Theorem 3.5 implies that, as we move t ∈ R continuously, the intersection body I(P + t) deforms continuously as well.We now characterize under which circumstances the intersection body of a polygon is convex.Note that IP cannot be convex if the origin lies outside of P or is a vertex of P (the argument for general dimensions will be given in Remark 5.1).We thus consider the distinct cases of when the origin lies in the interior of P , and when the origin lies in the interior of an edge.Figure 3 indicates that in the case of the square, the intersection body of P + t is convex for precisely 5 translation vectors: the center of symmetry, as well as the midpoints of the four edges.In Theorem 4.4 we show that the number of such translation vectors is always finite, and that parallelograms maximize this number.
The goal of this section is to give a characterization of polygons whose intersection bodies are convex.In the following Propositions 4.1 and 4.2 we consider polygons with the origin in the interior, and characterize the geometry of the boundary of IP .More precisely, we will see that the chambers in which IP is convex correspond to pairs of parallel edges of P , and that the polynomials defining the boundary of IP are linear in this case.
Proposition 4.1.Let P ⊆ R 2 be a polygon.Let C be a chamber of H(P ), and consider x ∈ C. We denote by v 1 (x), v 2 (x) the points of intersection Then the polynomial defining ∂IP in the chamber C is linear if and only if the segments conv (a 1 , b 1 ) and conv (a 2 , b 2 ) are parallel.
Proof.We want to prove that {x ∈ We compute the length of conv(v 1 (x), v 2 (x)), or equivalently of conv(0, v 1 (x) − v 2 (x)).We do this via the area of the triangle with vertices 0, v 1 (x) − v 2 (x) and x x 2 .Hence, the radial function can be computed by the determinantal expression x .
We compute the radial function explicitly.First, The boundary ∂P ∩ C is given by the set of points x ∈ C such that ρ IP | C (x) = 1, i.e., the points which satisfy assuming that the determinant in the left hand side is positive in C (otherwise it gets multiplied by −1).This determinant is a cubic polynomial in x, which by [BBMS22, Prop.5.5] is divisible by x 2 .Hence, the left hand side of (2) is a homogeneous linear polynomial in x.It divides the right hand side if and only if (b 2 − a 2 ) = κ(b 1 − a 1 ) for some κ ∈ R, i.e., if the the two edges conv (a i , b i ) are parallel.In this case (2) is a linear equation, and hence the curve defined by (2) is a line; otherwise it is a conic, passing through the origin.
Proposition 4.2.Let P ⊆ R 2 be polygon with the origin in its interior.If there exists a line through the origin which intersects ∂P in two non-parallel edges, then IP is not convex.
Proof.Let C be a chamber of of H(P ) such that x ⊥ intersects two non-parallel edges 1 , 2 of P .Consider u a , u b ∈ C ∩ S 1 .As shown in Figure 4, we denote for some positive real numbers α, β > 0. Since 1 and 2 are not parallel, we have α = β.We can choose a, b such that u a = 1 a ( a 2 −a 1 ) and Thus, the boundary points of IP in directions u a , u b are respectively.Consider the midpoint a+b 2 ∈ 1 and let u a+b be the unit vector in C orthogonal to a + b (and thus also to a+b 2 ).Then Let q = conv (p a , p b ) ∩ cone (u a+b ), as in Figure 4. We want to prove that IP ∩ C is not convex, by showing that q > p a+b .Indeed, we can compute that and therefore Since α = β, this expression is strictly positive, and so q ∈ IP .This proves that p a , p b ∈ IP , but the segment conv (p a , p b ) is not contained in IP .Hence, IP is not convex.
The proof of Proposition 4.2 in a picture.Left: the lines orthogonal to u a , u b , u a+b and their intersections with the edges 1 , 2 of P .Right: the points p a , p b , p a+b ∈ ∂IP , and the point q ∈ conv (p a , p b ), but q ∈ IP .
We are now ready to move towards a full classification of convexity of intersection bodies of polygons for any translation.Note that if P is centrally symmetric, then the convexity of P and the description of IP follow from the following classical statement.
Theorem 4.3 ([Gar06, Theorem 8.1.4]).Let K ⊆ R 2 be a centrally symmetric convex body centered at the origin.Then IK = r π 2 (2K), where r π 2 is a counter-clockwise rotation by π 2 .Our goal is to classify also the cases in which P is not centrally symmetric and centered at the origin.We now prove the main result of this section.
Theorem 4.4.Let P ⊆ R 2 be a polygon.Then IP is a convex body if and only if P = −P .
Proof.As noted in Remark 5.1, IP is not convex if the origin lies in R 2 \ P , or if the origin is a vertex of P .We are left to analyze the cases in which the origin lies in the interior of P or in the interior of an edge of P .
We first consider the case in which the origin lies in the interior of P and show that IP is convex if and only if P = −P .If P = −P , then Theorem 4.3 implies that IP is convex.Assume now that IP is convex, and the origin lies in the interior of P .Then C ∩ IP is convex for every chamber C of H(P ).In particular, by Proposition 4.2, every line u ⊥ , u ∈ S 1 , which does not intersect a vertex of P intersects ∂P in the interior of two parallel edges.Hence, the edges of P come in pairs of parallel edges.We rotate u ∈ S 1 continuously.Whenever u ⊥ crosses a vertex of one edge, it must also cross a vertex in the parallel edge, since otherwise this results in a pair of non-parallel edges.This implies that for every vertex v of P , there exists a vertex w of P such that w = −λv for some λ > 0. Since all edges are pairwise parallel, this positive scalar λ is the same for all vertices.Therefore, we also get that v = −λw, which implies that λ = 1.Hence, P = −P .Consider now the case in which the origin lies in the interior of an edge of P with normal vector e ∈ R 2 .Thus, ρ IP (x) = 1 2 ρ I(P ∪−P ) (x) for all x ∈ R 2 \ Re and ρ IP (e) > 1 2 ρ I(P ∪−P ) (e).Here, Re denotes the line spanned by e.Since the origin lies in the interior of the star body P ∪ −P , its radial function is continuous, which implies that also 1 2 ρ I(P ∪−P ) is continuous.Hence, ρ IP is discontinuous, and therefore IP is not convex.
Remark 4.5.The last case of the proof of Theorem 4.4 can be made more precise.Using the notion of chordal symmetral from [Gar06, Chapter 5.1], we deduce that 1 2 I(P ∪ −P ) = P ∪ −P.
Therefore, I(P ∪ −P ) is convex if and only if P ∪ −P is convex.This is the case if and only if the origin is the midpoint of an edge and the sum of the angles adjacent to this edge is at most π.Using elementary properties of the sums of interior and exterior angles of polygons, it can be shown that a polygon admits at most 4 such edges, and equality is realized exactly when P is a parallelogram.Figure 5 shows a collection of examples of polygons, together with the possible positions of the origin on such edges.In this case, the argument from the proof of Theorem 4.4 implies that the Euclidean closure of IP \ Re is convex.Here, Re denotes the line spanned by e.
We close this section by pointing out that many arguments made in this section do not generalize to higher dimensions: In contrast to Propositions 4.1 and 4.2, in higher dimensions there exist convex pieces IP ∩ C which are not linear.Furthermore, the identification with the chordal symmetral body, as in Remark 4.5, does not hold in general.However, these insights in the 2-dimensional case will turn out to be essential for arguments on the general case in the following section.

Convexity in Higher Dimensions
We devote this section to discuss the convexity of intersection bodies of polytopes of dimension d > 2. We make use of the results obtained in Section 4 to show that, similar to the 2dimensional case, the intersection body of a d-dimensional parallelepiped is convex if and only if the origin is its center of symmetry.In contrast, we give a sufficient condition under which there are infinitely many positions of the origin for which the intersection body of a given polytope is (strictly) convex.
Remark 5.1.To obtain an intersection body IP which is convex, the origin must lie in the interior of P .If the origin lies in the interior of a facet, the argument from Theorem 4.4 applies analogously, i.e., ρ IP (x) = 1 2 ρ I(P ∪−P ) (x) for all x ∈ R 2 except for the two normals of the facet, for which a strict inequality holds.Hence, ρ IP is discontinuous, and therefore IP is not convex.If the origin lies on a lower-dimensional face F , there exists a hyperplane x ⊥ such that P ∩ x ⊥ = F and thus the radial function of IP in direction x has value 0. The set of such x is a cone V = C ∪ −C, where C ⊂ R d is a convex pointed cone.Then, given x ∈ C, there exist x 1 , x 2 ∈ R d \ V such that x is a convex combination of x 1 and x 2 .Since ρ IP (x) = 0, the segment with extrema ρ IP (x 1 ) x 1 and ρ IP (x 2 ) x 2 is not entirely contained in the intersection body IP , but its extrema are.
The next result connects the intersection body of a convex body to the intersection body of a prism over the given convex body.
Proposition 5.2.Let L ⊆ R d−1 be a convex body and Proof.Let u = ( u, 0) ∈ H and consider its orthogonal complement u ⊥ ⊆ R d , which in this case can be interpreted as We can therefore compute the radial function of IK as (3) This gives a quadratic condition in ρ I(K+t) , which is continuous in t.Therefore, if (3) holds for IK, it holds also for I(K + t) with t ∈ B ε (0), for some ε > 0.
The next example shows that strictly convex intersection bodies of polytopes as in Remark 5.5 do indeed exist.
Example 5.6.The intersection body of the 3-dimensional centrally symmetric icosahedron P is strictly convex.Indeed, using HomotopyContinuation.jl [BT18] one can check that the algebraic varieties that define the boundary of IP do not contain lines (this is expected, since the generic quintic and sextic surface in 3-dimensional space do not contain lines).Moreover, because of the central symmetry, the intersection body is convex.Hence, it is strictly convex.This intersection body is displayed in [BBMS22, Figure 1], and our computations can be verified using the code on MathRepo [BBMS21].
To summarize, we have studied the admissible positions of the origin with respect to a fulldimensional polytope P , such that IP is convex.For d = 2 we have shown that the set of admissible positions is precisely the center of symmetry (if it exists).In higher dimensions it is sometimes infinite, as for the icosahedron, but other times only a single point, as for a cube.We note that proving non-convexity is a much easier task then proving convexity, as the first can be achieved by showing the non-convexity of a small curve on the boundary, while convexity is a global condition.A possible approach to tackle this problem in the case of polytopes might be studying the curvature of the algebraic hypersurfaces defining the boundary of the intersection body, as in [BRW22].
Another interesting direction of research concerns the topology of the set of admissible positions.We collect here some open questions.

Questions:
1.If the set of admissible positions of P is finite, what is its cardinality?2. If the set of admissible positions of P is infinite, how many connected components does it have?What is the dimension of these connected components?
3. If IP is convex but not strictly convex, does this imply P = −P ?
4. What are the conditions on P that make IP strictly convex?

Figure 1 :
Figure 1: The hyperplane arrangements of P + t from Example 3.1.

Figure 2 :
Figure 2: The arrangement L (P ) of the triangle from Examples 3.1 and 3.3.

Figure 3 :
Figure 3: The arrangement L (P ) of affine lines for P = [−1, 1] 2 , in black, together with I(P + t) for different choices of t, in red, as in Example 3.6.

Figure 5 :
Figure5: Examples of positions of the origin (orange bullet) in which IP is almost convex, as described in Remark 4.5.From left to right: a parallelogram, an acute triangle, a diamond shape, a panettone shape, and a centrally symmetric polygon (which has no admissible positions).
We begin by showing that the signed cocircuit s(C) of a chamber C fully determines the set of edges of P which are intersected by x ⊥ for any x ∈ C. Lemma 3.2.Let P ⊆ R d be a polytope and let t ∈ R d .Let C be a maximal open chamber of H(P ), and C t be a maximal open chamber of H(P + t) such that s(C) = s(C t ), i.e., their signed cocircuits agree.Given x ∈ C, x t ∈ C t consider E = {e ⊆ P | e is an edge of P, x ⊥ ∩ e = ∅}, E t = {e t ⊆ P + t | e t is an edge of P + t, x ⊥ t ∩ e t = ∅}.Then E t = {e + t | e ∈ E}.Proof.Let e = conv (v 1 , v 2 ) ∈ E be an edge of P .Since x ⊥ ∩ e = ∅, we have that v 1 , v 2 lie on different sides of x ⊥ .Equivalently, we have s(C) v 1 = −s(C) v 2 , and without loss of generality s(C) v 1 = +.Thus, x ∈ H + v 1 ∩ H − v 2 .Since H(P + t) is obtained from H(P ) by rotating the hyperplanes individually, and s