PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] Weyl-Minkowski theorem (Theorem)
Theorem (Weyl-Minkowski)   A subset of Euclidean space is a convex polytope if and only if it is a bounded polyhedron.

Bibliography

1
Minkowski, H. Allgemeine Lehrsätze über die konvexe Polyeder, Nachr. Ges. Wiss., Göttingen, 1897, 198-219.
2
Weyl, H. Elementare Theorie der konvexen Polyeder, Comment. Math. Helvetici, 1935, 7
3
Ziegler, G., Lectures on polytopes, Springer-Verlag, 1997.



Anyone with an account can edit this entry. Please help improve it!

"Weyl-Minkowski theorem" is owned by mps.
(view preamble)

View style:

Other names:  Weyl--Minkowski theorem

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: bounded polyhedron, polytope, convex, Euclidean space, subset
There is 1 reference to this entry.

This is version 3 of Weyl-Minkowski theorem, born on 2007-04-25, modified 2007-04-25.
Object id is 9262, canonical name is WeylMinkowskiTheorem.
Accessed 902 times total.

Classification:
AMS MSC52B40 (Convex and discrete geometry :: Polytopes and polyhedra :: Matroids )

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)