MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

It is known that given a set of Areas $A_f$ and normals $\vec{n}_f$ if $\sum_f A_f \vec{n}_f=0$ exist a unique convex polyhedron with given face areas and normals. (Minkowski theorem - See Alexandrov book on Convex Polyhedra).

Obviously here I'm identifying all the isometric polyhedra.

In principle with the same set of areas and normals one can build "others" polyhedra if we relax the convexity requirement.

What I want to prove is that in the collection of all the possible polyhedra one can build from a given set of Areas $A_f$ and normals $\vec{n}_f$ the convex one is the one with bigger volume.

Thank you for your help. Pietro

share|cite|improve this question
One could ask a more general question. Consider a measure on $S^2$, and suppose this is the push-forward of the area measure of a surface in $R^3$ under the Gauss map. Then one can ask whether a convex surface realizing this Gauss map measure will have larger volume than a non-convex surface with the same Gauss map measure. – Ian Agol Jul 5 '13 at 15:27
There is in fact an extension of Minkowski thm to non-convex polyhedra. See G.Y. Panina (MR1970337) and V. Alexandrov This does not really answer your question, but suggests a possibility that the claim might be false. – Igor Pak Jul 7 '13 at 6:18
up vote 3 down vote accepted

The convex polytope has the largest volume. This was proved in

K. Boroczky, I. Bárány, E. Makai Jr. & J. Pach: Maximal volume enclosed by plates and proof of the chessboard conjecture, Discrete Math. 69 (1986) 101–120.

For measures and convex bodies, a proof is provided by

Zhang, Gaoyong: The affine Sobolev inequality. J. Differential Geom. 53 (1999), no. 1, 183–202.

share|cite|improve this answer
thank you very much! – Pietro Dona' Jul 11 '13 at 20:45

I believe this was how Minkowski proved his theorem (he used a variational principle to show that the sought-after polyhedron maximizes volume). For the proof, see Aleksandrov's "Convex polyhedra", section 7.2

share|cite|improve this answer
That's not true! In the proof of Minkowski theorem there are no reference at all to non-convex stuffs! – Pietro Dona' Jul 5 '13 at 13:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.