Hubbry Logo
logo
Convex cone
Community hub

Convex cone

logo
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something to knowledge base
Hub AI

Convex cone AI simulator

(@Convex cone_simulator)

Convex cone

In linear algebra, a cone—sometimes called a linear cone to distinguish it from other sorts of cones—is a subset of a real vector space that is closed under positive scalar multiplication; that is, is a cone if implies for every positive scalar . This is a broad generalization of the standard cone in Euclidean space.

A convex cone is a cone that is also closed under addition, or, equivalently, a subset of a vector space that is closed under linear combinations with positive coefficients. It follows that convex cones are convex sets.

The definition of a convex cone makes sense in a vector space over any ordered field, although the field of real numbers is used most often.

A subset of a vector space is a cone if implies for every . Here refers to (strict) positivity in the scalar field.

Some other authors require or even . Some require a cone to be convex and/or satisfy .

The conical hull of a set is defined as the smallest convex cone that contains . Therefore, it need not be the smallest cone that contains .

Wedge may refer to what we call cones (when "cone" is reserved for something stronger), or just to a subset of them, depending on the author.

A subset of a vector space over an ordered field is a cone (or sometimes called a linear cone) if for each in and positive scalar in , the product is in . Note that some authors define cone with the scalar ranging over all non-negative scalars (rather than all positive scalars, which does not include 0). Some authors even require , thus excluding the empty set.

See all
subset of a vector space closed under positive linear combinations
User Avatar
No comments yet.