Definition of Cone and Convex Cone
Definition 1
Cone
A cone is defined in a vector space as a subset that satisfies the following for all scalars and :
Flat Cone and Salient Cone
If cone satisfies for some non-zero vector , it is called a flat cone. If not, it is called a salient cone.
Convex Cone
A cone that satisfies the following for all scalars and is called a convex cone:
Pointed Cone and Blunt Cone
A convex cone that includes the zero vector is called a pointed cone. If not, it is called a blunt cone.
Explanation
According to the definition, all elements of a cone can be thought of as a collection of all vectors that can be scaled up or down from the zero vector , and the meaningful types of these vectors can be either finite or infinite without any abstract problem. For example, in Euclidean space, any half-line is a cone at , and the first quadrant is a cone at , which in fact is also a convex cone.
A cone being flat means, in simple terms, whether it has a subvector space with a dimension of at least . For instance, in , a line parallel to the -axis includes both a vector in the direction and the direction, making it a flat cone, which aligns with the intuition of a line stretching flatly within a plane. A cone being salient means it protrudes like a geometric cone.
That a convex cone is salient is equivalent to .
Theorem
Partial Ordering of Convex Cones
In pointed and salient convex cones , a partial order can be defined as follows:
Proof
To prove, we need to show that the relation is transitive, reflexive, and antisymmetric.
(Transitive)
(Reflexive) A cone being pointed means that the zero vector is included in .
(Antisymmetric) A cone being salient means that does not include the additive inverse of any vector . For a non-zero vector , cannot be its inverse, therefore, must hold.
■
See Also
- Convex Hull
- Finite Cone: In , it is a shape with a finite bound given for any non-.