Convex and discrete geometry Definition
Convex independence
Builds on Vector spaceConvex hull
Definition
Let be a real vector space, let be a set, and let be a family of points of . The family is convexly independent if, for every subset and every , where denotes the convex hull. A subset is in convex position if the family is convexly independent, that is, if no lies in .
Remarks
Example: the points , , , of are in convex position. Each of them is a vertex of the unit square, and no vertex is a convex combination of the other three. For instance, the other three points satisfy , so all their convex combinations do, while does not. The other vertices are handled by symmetry.
Non-example: add the point . It equals , so it lies in the convex hull of the other points.
A convexly independent family is injective, because with puts in the hull of . A finite set is in convex position if and only if every point of is an extreme point of , that is, a vertex of the polytope . Affinely independent families are convexly independent, but not conversely: the four corners of a square are affinely dependent.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex hull concept
- Vector space concept
- Convex independence definition
Further reading
About this page
| Tag | PZ8KRWR8RT |
|---|---|
| URI | m2://PZ8KRWR8RT |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52A20, 52C35 |
| Defines | Convex independence |
| Uses | Vector space, 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.