Convex and discrete geometry Definition
Convex cone
Builds on Vector spaceConvex set
Definition
Let be a real vector space. A subset is a convex cone if for all and all real numbers and ,
Remarks
Equivalently, is closed under addition and under multiplication by positive scalars. Equivalently again, is convex and for all and .
Example: the nonnegative orthant . If have nonnegative coordinates and , then each coordinate is nonnegative.
Non-example: the closed unit disc in is convex, but lies in it and does not.
Conventions differ: many authors also allow , so that every nonempty convex cone contains . A convex cone that contains is called a pointed cone in some texts. The same definition works over any ordered field in place of .
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 set concept
- Vector space concept
- Convex cone definition
Further reading
About this page
| Tag | HJXA140M0C |
|---|---|
| URI | m2://HJXA140M0C |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52A20, 46A55 |
| Defines | Convex cone |
| Uses | Vector space, Convex set |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- 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.