# Is the diameter of a centrally symmetric convex body realized by a pair of antipodal points?

Let $S \subset \mathbb{R}^n$ be the boundary of a centrally symmetric convex body and provide $S$ with the geodesic metric given by its embedding in Euclidean space (i.e., the distance between two points is the infinimum of the Euclidean lengths of all rectifiable curves on $S$ that join them).

Question. Is the diameter of $S$ realized by a pair of antipodal points?

I am curious about this question when the metric is the induced metric from euclidean space, but I'm mostly inetrested in the case of a polytope provided the graph metric on the 1-skeleton. In the discrete case I do not care too much about constants.

-
I edited the question, but the second part about the graph metric is still unclear to me. –  alvarezpaiva Apr 17 '14 at 15:04
By the "graph metric on the 1-skeleton", I take it you mean the metric on the graph formed by the edges. But this metric is not the restriction of the geodesic metric on the whole boundary, nor is the optimum for the full question necessarily realized by vertices (as noted by Noam Elkies for the cube). So the discrete question remains a little unclear to me. –  Dylan Thurston Apr 21 '14 at 11:07
Indeed, these two questions might be very different. Probably it wasn't very wise to write about both in the same MO post. The discrete metric is defined only on the vertex set of the polytope. Paths are restricted to walk on the $1$-skeleton and their length is given by the graph metric, i.e. the length of every edge is prescribed to be $1$ (no matter how far the corresponding vertices with respect to the Euclidean distance). @Dylan Thurston. –  Alfredo Hubard Apr 23 '14 at 18:33
Here @alvarezpaiva the previous comment should clarify the confusion. –  Alfredo Hubard Apr 23 '14 at 18:34

For $n=3$ this question was asked in 1996 by James Propp, conjecturing that the answer is Yes. (I got the reference from this page, which concerns the very special case of a rectangular box in ${\bf R}^3$; this is already a nontrivial problem, as Jim Propp noted, and the cuboid page reports calculations claimed to prove it in that case and to locate the diameter, which isn't always a pair of opposite corners.)

David Eppstein's Geometry Junkyard page that quotes Propp's 1996 conjecture also reproduces a 2002 e-mail from Costin Vilcu with a reference to his paper "On Two Conjectures of Steinhaus" (Geom. Ded. 79 (2000), 267-275), whose Proposition 6 (page 273) proves the $n=3$ conjecture.

Perhaps Costin Vilcu knows the current status of the problem for higher $n$. Even the case of rectangular boxes in ${\bf R}^4$ might still be open.

-

This answer a different questions than was intended. The intended question remains unanswered!

Suppose pair of points $x,y\in K$ attains the diameter. Then $d(x,y)=d(-x,-y)=\operatorname{diam}(K)$. The points $x,-x,y,-y$ are coplanar. Look inside that plane. Consider the parallelogram spanned by these four points. By the parallelogram law, $$d(x,-x)^2+d(y,-y)^2=2d(x,y)^2+2d(x,-y)^2\geq 2d(x,y)^2.$$ Hence, either $d(x,-x)$ or $d(y,-y)$ is least $\operatorname{diam}(K)$.

-
Hi Boris! sorry I was not very clar about what I meant by "induced metric from Euclidean space" I mean the infimal length of all rectifible curves that stay on the boundary of the convex body. Where the length of a curve is measured locally with the Euclidean metric, so if the body is smooth this is a Riemannian metric. –  Alfredo Hubard Apr 14 '14 at 14:13
@Alfredo, you should probably write it as $\operatorname{diam}(\partial K)$. –  Yoav Kallus Apr 14 '14 at 14:59
Aha, the intended question is much more interesting than the one I answered above. –  Boris Bukh Apr 14 '14 at 19:09

I am posting this on behalf of Costin Vîlcu (with whom I've had the pleasure of coauthoring). —J.O'Rourke

The posted problem in $\mathbb{R}^3$ was answered in:

Y. G. Nikonorov and Y. V. Nikonorov, The Intrinsic Diameter of the Surface of a Parallelepiped, Discrete Comput. Geom. 40 (2008), 504-527.

I (Costin) know nothing about a higher dimensional analogue.

For doubles of arbitrary dimensional simplices, a similar result is in

J. Itoh and C. Vîlcu, Farthest points and cut loci on some degenerate convex surfaces, J. Geom. 80 (2004), 106-120.

These authors,

K. Grove and P. Petersen, A radius sphere theorem, Inventiones Math. 112 (1993), 577-583,

show that the mapping $F$, associating to each point its set of farthest points, is single-valued and onto for any Alexandrov space with curvature bounded below by $1$ and with $\min_x \mathrm{dist} (x, F(x)) > \pi /2$.

-

This is more of a followup to Noam's answer. Vilcu had continued to work on the subject, see this paper by him, Rouyer and Itoh: https://www.evernote.com/shard/s24/sh/a5f3c60d-7c69-4a02-81db-e5721253977d/a51556c9763fe199c9981c13d950b97c

However, the most relevant papers seem to be those by Joel Rouyer (unfortunately my university does not subscribe to "Advances in Geometry", so I can't tell with certainty what he does...):

MR2660417 (2011g:52021) Reviewed Rouyer, Joël On antipodes on a convex polyhedron II. (English summary) Adv. Geom. 10 (2010), no. 3, 403–417. 52B10 (51M04 52A15) More links PDF Clipboard Journal Article Make Link

This paper is a sequel to the author's paper [Part I, Adv. Geom. 5 (2005), no. 4, 497–507; MR2174479 (2006h:52005)]. Steinhaus asked about convex surfaces for which every point has precisely one antipode and the antipodal map is an involution. It is open whether the boundary of a convex polyhedron in R3 can satisfy that condition. This paper gives several relevant results about antipodes on convex polyhedra. For example: If a convex polyhedron has a small enough angle at some vertex, then some point has at least two antipodes. For every convex polyhedron, the antipodal map is not a local isometry. If P is a centrally symmetric convex polyhedron, then there is a finite union G⊂P of algebraic arcs such that each point p∈P∖G has a single antipode, which is not −p; hence no centrally symmetric convex polyhedron satisfies Steinhaus's conditions. Reviewed by Margaret M. Bayer

-