Absolutely convex set explained

In mathematics, a subset C of a real or complex vector 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

S of a real or complex vector space X is called a and is said to be , , and if any of the following equivalent conditions is satisfied:

1. S is a convex and balanced set.
2. for any scalars a and b, if |a| + |b| \leq 1 then a S + b S \subseteq S.
3. for all scalars a, b, and c, if |a| + |b| \leq |c|, then a S + b S \subseteq c S.
4. for any scalars a _{1,} \ldots, a _{n} and c, if |a _{1|} + … + |a _{n|} \leq |c| then a _{1} S + … + a _{n} S \subseteq c S.
5. for any scalars a _{1,} \ldots, a _{n,} if |a _{1|} + … + |a _{n|} \leq 1 then a _{1} S + … + a _{n} S \subseteq S.

The smallest convex (respectively, balanced) subset of

X containing a given set is called the convex hull (respectively, the balanced hull) of that set and is denoted by \operatorname{co} S (respectively, \operatorname{bal} S ).

Similarly, the , the , and the of a set

S is defined to be the smallest disk (with respect to subset inclusion) containing S. The disked hull of S will be denoted by \operatorname{disk} S or \operatorname{cobal} S and it is equal to each of the following sets:

1. \operatorname{co} (\operatorname{bal} S), which is the convex hull of the balanced hull of S ; thus, \operatorname{cobal} S = \operatorname{co} (\operatorname{bal} S).
   • In general,
   \operatorname{cobal} S ≠ \operatorname{bal} (\operatorname{co} S) is possible, even in finite dimensional vector spaces.
2. the intersection of all disks containing S.
3. \left\{a _{1} s _{1} + … a _{n} s _{n} ~:~ n \in \N, s _{1,} \ldots, s _{n} \in S, and a _{1,} \ldots, a _{n} arescalarssatisfying |a _{1|} + … + |a _{n|} \leq 1 \right\}.

Sufficient conditions

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

D is a disk in X, then D is absorbing in X if and only if \operatorname{span} D = X.

Properties

If

S is an absorbing disk in a vector space X then there exists an absorbing disk E in X such that E + E \subseteq S. If D is a disk and r and s are scalars then s D = |s| D and (r D) \cap (s D) = ( min \{|r|, |s|\}) D.

The absolutely convex hull of a bounded set in a locally convex topological vector space is again bounded.

If

D is a bounded disk in a TVS X and if x _{\bull} = \left(x _{i\right)} ^{inf ty} ^{i =1} is a sequence in D, then the partial sums s _{\bull} = \left(s _{n\right)} ^{inf ty} ^{n =1} are Cauchy, where for all n, s _{n} : = \sum ^{n} _{i =1} 2 ^{-i} x _{i.} In particular, if in addition D is a sequentially complete subset of X, then this series s _{\bull} converges in X to some point of D.

The convex balanced hull of

S contains both the convex hull of S and the balanced hull of S. Furthermore, it contains the balanced hull of the convex hull of S; thus $$\backslash operatorname\; (\backslash operatorname\; S)\; ~\backslash subseteq~\; \backslash operatorname\; S\; ~=~\; \backslash operatorname\; (\backslash operatorname\; S),$$where the example below shows that this inclusion might be strict. However, for any subsets S, T \subseteq X, if S \subseteq T then \operatorname{cobal} S \subseteq \operatorname{cobal} T which implies \operatorname{cobal} (\operatorname{co} S) = \operatorname{cobal} S = \operatorname{cobal} (\operatorname{bal} S).

Examples

Although

\operatorname{cobal} S = \operatorname{co} (\operatorname{bal} S), the convex balanced hull of S is necessarily equal to the balanced hull of the convex hull of S. For an example where \operatorname{cobal} S ≠ \operatorname{bal} (\operatorname{co} S) let X be the real vector space \R ^{2} and let S : = \{( -1 , 1 ), ( 1 , 1 )\}. Then \operatorname{bal} (\operatorname{co} S) is a strict subset of \operatorname{cobal} S that is not even convex; in particular, this example also shows that the balanced hull of a convex set is necessarily convex. The set \operatorname{cobal} S is equal to the closed and filled square in X with vertices ( -1 , 1 ), ( 1 , 1 ), ( -1 , -1 ), and ( 1 , -1 ) (this is because the balanced set \operatorname{cobal} S must contain both S and - S = \{( -1 , -1 ), ( 1 , -1 )\}, where since \operatorname{cobal} S is also convex, it must consequently contain the solid square \operatorname{co} (( - S) \cup S), which for this particular example happens to also be balanced so that \operatorname{cobal} S = \operatorname{co} (( - S) \cup S) ). However, \operatorname{co} (S) is equal to the horizontal closed line segment between the two points in S so that \operatorname{bal} (\operatorname{co} S) is instead a closed "hour glass shaped" subset that intersects the x -axis at exactly the origin and is the union of two closed and filled isosceles triangles: one whose vertices are the origin together with S and the other triangle whose vertices are the origin together with - S = \{( -1 , -1 ), ( 1 , -1 )\}. This non-convex filled "hour-glass" \operatorname{bal} (\operatorname{co} S) is a proper subset of the filled square \operatorname{cobal} S = \operatorname{co} (\operatorname{bal} S).

Generalizations

Given a fixed real number

0 < p \leq 1 , a is any subset C of a vector space X with the property that r c + s d \in C whenever c, d \in C and r, s \geq 0 are non-negative scalars satisfying r ^{p} + s ^{p} = 1 . It is called an or a if r c + s d \in C whenever c, d \in C and r, s are scalars satisfying |r| ^{p} + |s| ^{p} \leq 1 .

A is any non-negative function

q : X \to \R that satisfies the following conditions:

1. Subadditivity/Triangle inequality:

q(x + y) \leq q(x) + q(y) for all x, y \in X.

1. Absolute homogeneity of degree p :

q(s x) = |s| ^{p} q(x) for all x \in X and all scalars s.

This generalizes the definition of seminorms since a map is a seminorm if and only if it is a

1 -seminorm (using p : = 1 ). There exist p -seminorms that are not seminorms. For example, whenever 0 < p < 1 then the map q(f) = \int _{\R} |f(t)| ^{p} d t used to define the Lp space L _{p(\R)} is a p -seminorm but not a seminorm.

Given

0 < p \leq 1 , a topological vector space is (meaning that its topology is induced by some p -seminorm) if and only if it has a bounded p -convex neighborhood of the origin.

See also

• • • • • • • • , for vectors in physics

Bibliography

• Book: Robertson, A.P.. W.J. Robertson. Topological vector spaces. Cambridge Tracts in Mathematics. 53. 1964. Cambridge University Press. 4–6.