Convex and discrete geometry Definition
Vertex of a polytope
Builds on Convex polytopeFace of a convex setExtreme pointConvex hull
Definition
Let be a convex polytope. A vertex of is a face of of dimension , identified with the single point it contains. Equivalently, a point is a vertex if there is a vector such that for every with .
Remarks
Example: in the square , the point is a vertex. Take : then , and for every other point of .
Non-example: the point of the same square is not a vertex. For any , the points for small lie in , and is at least at one of them, so no singles it out.
The vertices of are exactly its extreme points. If is the set of vertices, then is the convex hull of , and every finite set whose convex hull is contains .
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex hull concept
- Convex polytope concept
- Extreme point concept
- Face of a convex set concept
- Vertex of a polytope definition
Further reading
About this page
| Tag | BETJYRCRJB |
|---|---|
| URI | m2://BETJYRCRJB |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52B05, 52B11 |
| Defines | Vertex of a polytope |
| Uses | Convex polytope, Face of a convex set, Extreme point, Convex hull |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.