disked hull
   HOME

TheInfoList



OR:

In mathematics, a subset ''C'' of a
real Real may refer to: Currencies * Brazilian real (R$) * Central American Republic real * Mexican real * Portuguese real * Spanish real * Spanish colonial real Music Albums * ''Real'' (L'Arc-en-Ciel album) (2000) * ''Real'' (Bright album) (2010) ...
or
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
vector space In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called '' vectors'', may be added together and multiplied ("scaled") by numbers called ''scalars''. Scalars are often real numbers, but can ...
is said to be absolutely convex or disked if it is
convex Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
and
balanced In telecommunications and professional audio, a balanced line or balanced signal pair is a circuit consisting of two conductors of the same type, both of which have equal impedances along their lengths and equal impedances to ground and to other ci ...
(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 Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
    and
    balanced set 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, \ ...
    .
  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 Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
(respectively,
balanced In telecommunications and professional audio, a balanced line or balanced signal pair is a circuit consisting of two conductors of the same type, both of which have equal impedances along their lengths and equal impedances to ground and to other ci ...
) subset of X containing a given set is called the convex hull (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 Inclusion or Include may refer to: Sociology * Social inclusion, aims to create an environment that supports equal opportunity for individuals and groups that form a society. ** Inclusion (disability rights), promotion of people with disabiliti ...
) 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 of S; thus, \operatorname S = \operatorname (\operatorname S). * In general, \operatorname S \neq \operatorname (\operatorname S) is possible, even in finite dimensional 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 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 mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is calle ...
in D, then the partial sums s_ = \left(s_n\right)_^ are
Cauchy Baron Augustin-Louis Cauchy (, ; ; 21 August 178923 May 1857) was a French mathematician, engineer, and physicist who made pioneering contributions to several branches of mathematics, including mathematical analysis and continuum mechanics. He w ...
, 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 triangles: 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/
Triangle inequality In mathematics, the triangle inequality states that for any triangle, the sum of the lengths of any two sides must be greater than or equal to the length of the remaining side. This statement permits the inclusion of degenerate triangles, but ...
: 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
seminorm In mathematics, particularly in functional analysis, a seminorm is a vector space norm that need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some absorbing disk ...
s 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
seminorm In mathematics, particularly in functional analysis, a seminorm is a vector space norm that need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some absorbing disk ...
s. For example, whenever 0 < p < 1 then the map q(f) = \int_ , 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 In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
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 *


References


Bibliography

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