Reference articles on history, science, culture and more
Encyclopedia

Shephard's problem

In mathematics, Shephard's problem, is the following geometrical question asked by Geoffrey Colin Shephard in 1964: if K and L are centrally symmetric convex bodies in n-dimensional Euclidean space such that whenever K and L are projected onto a hyperplane, the volume of the projection of K is smaller than the volume of the projection of L, then does it follow that the volume of K is smaller than that of L?

In this case, "centrally symmetric" means that the reflection of K in the origin, K, is a translate of K, and similarly for L. If πk : Rn  Πk is a projection of Rn onto some k-dimensional hyperplane Πk (not necessarily a coordinate hyperplane) and Vk denotes k-dimensional volume, Shephard's problem is to determine the truth or falsity of the implication

V_{k}(\pi _{k}(K))\leq V_{k}(\pi _{k}(L)){\mbox{ for all }}1\leq k<n\implies V_{n}(K)\leq V_{n}(L).

Vk(πk(K)) is sometimes known as the brightness of K and the function Vk o πk as a (k-dimensional) brightness function.

In dimensions n = 1 and 2, the answer to Shephard's problem is "yes". In 1967, however, Petty and Schneider showed that the answer is "no" for every n  3. The solution of Shephard's problem requires Minkowski's first inequality for convex bodies and the notion of projection bodies of convex bodies.

Watch videos about Shephard's problemExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article Shephard's problem, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.