Shephard's problem

From testwiki
Revision as of 19:09, 19 July 2024 by imported>LaundryPizza03 (added Category:Geometry problems using HotCat)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:No footnotes 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?Template:Sfn

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 Template:Pik : 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

Vk(πk(K))Vk(πk(L)) for all 1k<nVn(K)Vn(L).

Vk(Template:Pik(K)) is sometimes known as the brightness of K and the function Vk o Template:Pik 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.Template:SfnTemplate:Sfn The solution of Shephard's problem requires Minkowski's first inequality for convex bodies and the notion of projection bodies of convex bodies.

See also

Notes

Template:Reflist

References