PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
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: Very high
polytope (Definition)

A polytope is the convex hull of finitely many points in Euclidean space. A polytope constructed in this way is the convex hull of its vertices and is called a $\mathcal{V}$ -polytope. An $\mathcal{H}$ -polytope is a bounded intersection of upper halfspaces. By the Weyl-Minkowski theorem, these descriptions are equivalent, that is, every $\mathcal{V}$ -polytope is an $\mathcal{H}$ -polytope, and vice versa. This shows that our intuition, based on the study of low-dimensional polytopes, that one can describe a polytope either by its vertices or by its facets is essentially correct.

The dimension of $P$ is the smallest $d$ such that $P$ can be embedded in $\mathbb{R}^d$ . A $d$ -dimensional polytope is also called a $d$ -polytope.

A face of a polytope is the intersection of the polytope with a supporting hyperplane. Intuitively, a supporting hyperplane is a hyperplane that ``just touches'' the polytope, as though the polytope were just about to pass through the hyperplane. Note that this intuitive picture does not cover the case of the empty face, where the supporting hyperplane does not touch the polytope at all, or the fact that a polytope is a face of itself. The faces of a polytope, when partially ordered by set inclusion, form a geometric lattice, called the face lattice of the polytope.

The Euler polyhedron formula, which states that if a $3$ -polytope has $V$ vertices, $E$ edges, and $F$ faces, then $$ V - E + F = 2, $$ has a generalization to all $d$ -polytopes. Let $(f_{-1}=1, f_0, \dots, f_{d-1}, f_d = 1)$ be the f-vector of a $d$ -polytope $P$ , so $f_i$ is the number of $i$ -dimensional faces of $P$ . Then these numbers satsify the Euler-Poincaré-Schläfli formula: \begin{equation} \sum_{i=-1}^d (-1)^i f_i = 0. \end{equation}This is the first of many relations among entries of the f-vector satisfied by all polytopes. These relations are called the Dehn-Sommerville relations. Any poset which satisfies these relations is Eulerian, so the face lattice of any polytope is Eulerian.

Bibliography

1
Bayer, M. and L. Billera, Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets, Invent. Math. 79 (1985), no. 1, 143-157.
2
Bayer, M. and A. Klapper, A new index for polytopes, Discrete Comput. Geom. 6 (1991), no. 1, 33-47.
3
Minkowski, H. Allgemeine Lehrsätze über die konvexe Polyeder, Nachr. Ges. Wiss., Göttingen, 1897, 198-219.
4
Weyl, H. Elementare Theorie der konvexen Polyeder, Comment. Math. Helvetici, 1935, 7
5
Ziegler, G., Lectures on polytopes, Springer-Verlag, 1997.




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

"polytope" is owned by mps. [ full author list (2) ]
(view preamble | get metadata)

View style:

See Also: polyhedron, Poincaré formula, Euler's polyhedron theorem

Also defines:  V-polytope, H-polytope, d-polytope, dimension
Keywords:  polytope, face lattice, graded poset

Attachments:
Weyl-Minkowski theorem (Theorem) by mps
f-vector (Definition) by mps
Log in to rate this entry.
(view current ratings)

Cross-references: poset, number, f-vector, edges, Euler polyhedron, geometric lattice, set inclusion, cover, pass through, hyperplane, supporting hyperplane, face, equivalent, Weyl--Minkowski theorem, intersection, bounded, vertices, Euclidean space, points, convex hull
There are 61 references to this entry.

This is version 23 of polytope, born on 2004-02-03, modified 2007-06-12.
Object id is 5544, canonical name is Polytope.
Accessed 10741 times total.

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

Pending Errata and Addenda
None.
[ View all 6 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)