Absolutely Convex Set
   HOME

TheInfoList



OR:

In
mathematics Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a
subset In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are ...
''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 In mathematics, the intersection of two or more objects is another object consisting of everything that is contained in all of the objects simultaneously. For example, in Euclidean geometry, when two lines in a plane are not parallel, their i ...
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 scalar 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, + \cdots + , a_n, \leq , c, then a_1 S + \cdots + a_n S \subseteq c S.
  5. for any scalars a_1, \ldots, a_n, if , a_1, + \cdots + , a_n, \leq 1 then a_1 S + \cdots + a_n S \subseteq S.
The smallest convex (respectively, balanced) subset of X containing a given set is called the
convex hull In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space ...
(respectively, the balanced hull) of that set and is denoted by \operatorname S (respectively, \operatorname 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 S or \operatorname S and it is equal to each of the following sets:
  1. \operatorname (\operatorname S), which is the convex hull of the
    balanced hull In linear algebra and related areas of mathematics a balanced set, circled set or disk in a vector space (over a field \mathbb with an absolute value function , \cdot , ) is a set S such that a S \subseteq S for all scalars a satisfying , a, ...
    of S; thus, \operatorname S = \operatorname (\operatorname S). * In general, \operatorname S \neq \operatorname (\operatorname S) is possible, even in
    finite dimensional In mathematics, the dimension of a vector space ''V'' is the cardinality (i.e., the number of vectors) of a basis of ''V'' over its base field. p. 44, ยง2.36 It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to dis ...
    vector spaces.
  2. the intersection of all disks containing S.
  3. \left\.


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 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_ \) D. The absolutely convex hull of a
bounded set :''"Bounded" and "boundary" are distinct concepts; for the latter see boundary (topology). A circle in isolation is a boundaryless bounded set, while the half plane is unbounded yet has a boundary. In mathematical analysis and related areas of mat ...
in a locally convex topological vector space is again bounded. If D is a bounded disk in a TVS X and if x_ = \left(x_i\right)_^ is a sequence in D, then the partial sums s_ = \left(s_n\right)_^ are Cauchy, where for all n, s_n := \sum_^n 2^ x_i. In particular, if in addition D is a sequentially complete subset of X, then this series s_ 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 \operatorname (\operatorname S) ~\subseteq~ \operatorname S ~=~ \operatorname (\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 S \subseteq \operatorname T which implies \operatorname (\operatorname S) = \operatorname S = \operatorname (\operatorname S).


Examples

Although \operatorname S = \operatorname (\operatorname 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 S \neq \operatorname (\operatorname S) let X be the real vector space \R^2 and let S := \. Then \operatorname (\operatorname S) is a strict subset of \operatorname 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 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 S must contain both S and -S = \, where since \operatorname S is also convex, it must consequently contain the solid square \operatorname ((-S) \cup S), which for this particular example happens to also be balanced so that \operatorname S = \operatorname ((-S) \cup S)). However, \operatorname (S) is equal to the horizontal closed line segment between the two points in S so that \operatorname (\operatorname 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 triangle In geometry, an isosceles triangle () is a triangle that has two sides of equal length. Sometimes it is specified as having ''exactly'' two sides of equal length, and sometimes as having ''at least'' two sides of equal length, the latter versio ...
s: one whose vertices are the origin together with S and the other triangle whose vertices are the origin together with - S = \. This non-convex filled "hour-glass" \operatorname (\operatorname S) is a proper subset of the filled square \operatorname S = \operatorname (\operatorname 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: #
Subadditivity In mathematics, subadditivity is a property of a function that states, roughly, that evaluating the function for the sum of two elements of the domain always returns something less than or equal to the sum of the function's values at each element. ...
/ Triangle inequality: q(x + y) \leq q(x) + q(y) for all x, y \in X. # 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_ , f(t), ^p d t used to define the
Lp space In mathematics, the spaces are function spaces defined using a natural generalization of the Norm (mathematics)#p-norm, -norm for finite-dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue , although ...
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 Boundedness or bounded may refer to: Economics * Bounded rationality, the idea that human rationality in decision-making is bounded by the available information, the cognitive limitations, and the time available to make the decision * Bounded e ...
p-convex neighborhood of the origin.


See also

* * * * * * * * , for vectors in physics *


References


Bibliography

* * * * {{Convex analysis and variational analysis Abstract algebra Convex analysis Convex geometry Group theory Linear algebra