Absolutely convex set

From testwiki
Revision as of 10:38, 28 August 2024 by imported>Pbsouthwood (Adding local short description: "Convex and balanced set", overriding Wikidata description "convex and balanced set")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description 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

The light gray area is the absolutely convex hull of the cross.

A subset S of a real or complex vector space X is called a Template:Visible anchor and is said to be Template:Visible anchor, Template:Visible anchor, and Template:Visible anchor 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|1 then aS+bSS.
  3. for all scalars a,b, and c, if |a|+|b||c|, then aS+bScS.
  4. for any scalars a1,,an and c, if |a1|++|an||c| then a1S++anScS.
  5. for any scalars a1,,an, if |a1|++|an|1 then a1S++anSS.

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 coS (respectively, balS).

Similarly, the Template:Visible anchor, the Template:Visible anchor, and the Template:Visible anchor of a set S is defined to be the smallest disk (with respect to subset inclusion) containing S.Template:Sfn The disked hull of S will be denoted by diskS or cobalS and it is equal to each of the following sets:

  1. co(balS), which is the convex hull of the balanced hull of S; thus, cobalS=co(balS).
    • In general, cobalSbal(coS) is possible, even in finite dimensional vector spaces.
  2. the intersection of all disks containing S.
  3. {a1s1+ansn:n,s1,,snS, and a1,,an are scalars satisfying |a1|++|an|1}.

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 spanD=X.Template:Sfn

Properties

Template:See also

If S is an absorbing disk in a vector space X then there exists an absorbing disk E in X such that E+ES.Template:Sfn If D is a disk and r and s are scalars then sD=|s|D and (rD)(sD)=(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=(xi)i=1 is a sequence in D, then the partial sums s=(sn)n=1 are Cauchy, where for all n, sn:=i=1n2ixi.Template:Sfn 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 bal(coS)cobalS=co(balS), where the example below shows that this inclusion might be strict. However, for any subsets S,TX, if ST then cobalScobalT which implies cobal(coS)=cobalS=cobal(balS).

Examples

Although cobalS=co(balS), the convex balanced hull of S is Template:Em necessarily equal to the balanced hull of the convex hull of S.Template:Sfn For an example where cobalSbal(coS) let X be the real vector space 2 and let S:={(1,1),(1,1)}. Then bal(coS) is a strict subset of cobalS that is not even convex; in particular, this example also shows that the balanced hull of a convex set is Template:Em necessarily convex. The set cobalS 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 cobalS must contain both S and S={(1,1),(1,1)}, where since cobalS is also convex, it must consequently contain the solid square co((S)S), which for this particular example happens to also be balanced so that cobalS=co((S)S)). However, co(S) is equal to the horizontal closed line segment between the two points in S so that bal(coS) 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" bal(coS) is a proper subset of the filled square cobalS=co(balS).

Generalizations

Given a fixed real number 0<p1, a Template:Em is any subset C of a vector space X with the property that rc+sdC whenever c,dC and r,s0 are non-negative scalars satisfying rp+sp=1. It is called an Template:Em or a Template:Em if rc+sdC whenever c,dC and r,s are scalars satisfying |r|p+|s|p1.Template:Sfn

A Template:EmTemplate:Sfn is any non-negative function q:X that satisfies the following conditions:

  1. Subadditivity/Triangle inequality: q(x+y)q(x)+q(y) for all x,yX.
  2. Absolute homogeneity of degree p: q(sx)=|s|pq(x) for all xX 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)=|f(t)|pdt used to define the Lp space Lp() is a p-seminorm but not a seminorm.Template:Sfn

Given 0<p1, a topological vector space is Template:Em (meaning that its topology is induced by some p-seminorm) if and only if it has a bounded p-convex neighborhood of the origin.Template:Sfn

See also

Template:Wikibooks

References

Template:Reflist Template:Reflist

Bibliography

Template:Functional analysis Template:Topological vector spaces Template:Convex analysis and variational analysis