In mathematics, a subsetC of a real or complexvector space is said to be absolutely convex or disked if it is convex and balanced (some people use the term "circled" instead of "balanced"), in which case it is called a disk.
The disked hull or the absolute convex hull of a set is the intersection of all disks containing that set.
Definition
A subset of a real or complex vector space is called a disk and is said to be disked, absolutely convex, and convex balanced if any of the following equivalent conditions is satisfied:
The smallest convex (respectively, balanced) subset of containing a given set is called the convex hull (respectively, the balanced hull) of that set and is denoted by (respectively, ).
Similarly, the disked hull, the absolute convex hull, and the convex balanced hull of a set is defined to be the smallest disk (with respect to subset inclusion) containing [1]
The disked hull of will be denoted by or and it is equal to each of the following sets:
which is the convex hull of the balanced hull of ; thus,
The intersection of arbitrarily many absolutely convex sets is again absolutely convex; however, unions of absolutely convex sets need not be absolutely convex anymore.
If is a disk in then is absorbing in if and only if [2]
If is a bounded disk in a TVS and if is a sequence in then the partial sums are Cauchy, where for all [4] In particular, if in addition is a sequentially complete subset of then this series converges in to some point of
The convex balanced hull of contains both the convex hull of and the balanced hull of Furthermore, it contains the balanced hull of the convex hull of thus
where the example below shows that this inclusion might be strict.
However, for any subsets if then which implies
Examples
Although the convex balanced hull of is not necessarily equal to the balanced hull of the convex hull of [1]
For an example where let be the real vector space and let
Then is a strict subset of that is not even convex;
in particular, this example also shows that the balanced hull of a convex set is not necessarily convex.
The set is equal to the closed and filled square in with vertices and (this is because the balanced set must contain both and where since is also convex, it must consequently contain the solid square which for this particular example happens to also be balanced so that ). However, is equal to the horizontal closed line segment between the two points in so that is instead a closed "hour glass shaped" subset that intersects the -axis at exactly the origin and is the union of two closed and filled isosceles triangles: one whose vertices are the origin together with and the other triangle whose vertices are the origin together with This non-convex filled "hour-glass" is a proper subset of the filled square
Generalizations
Given a fixed real number a -convex set is any subset of a vector space with the property that whenever and are non-negative scalars satisfying
It is called an absolutely -convex set or a -disk if whenever and are scalars satisfying [5]
A -seminorm[6] is any non-negative function that satisfies the following conditions:
This generalizes the definition of seminorms since a map is a seminorm if and only if it is a -seminorm (using ).
There exist -seminorms that are not seminorms. For example, whenever then the map used to define the Lp space is a -seminorm but not a seminorm.[6]
Given a topological vector space is -seminormable (meaning that its topology is induced by some -seminorm) if and only if it has a bounded-convex neighborhood of the origin.[5]