Convex series

From testwiki
Jump to navigation Jump to search

Template:More footnotes

In mathematics, particularly in functional analysis and convex analysis, a Template:Em is a series of the form i=1rixi where x1,x2, are all elements of a topological vector space X, and all r1,r2, are non-negative real numbers that sum to 1 (that is, such that i=1ri=1).

Types of Convex series

Suppose that S is a subset of X and i=1rixi is a convex series in X.

Types of subsets

Convex series allow for the definition of special types of subsets that are well-behaved and useful with very good stability properties.

If S is a subset of a topological vector space X then S is said to be a:

  • Template:Visible anchor if any convergent convex series with elements of S has its (each) sum in S.
    • In this definition, X is not required to be Hausdorff, in which case the sum may not be unique. In any such case we require that every sum belong to S.
  • Template:Visible anchor or a Template:Visible anchor if there exists a Fréchet space Y such that S is equal to the projection onto X (via the canonical projection) of some cs-closed subset B of X×Y Every cs-closed set is lower cs-closed and every lower cs-closed set is lower ideally convex and convex (the converses are not true in general).
  • Template:Visible anchor if any convergent b-series with elements of S has its sum in S.
  • Template:Visible anchor or a Template:Visible anchor if there exists a Fréchet space Y such that S is equal to the projection onto X (via the canonical projection) of some ideally convex subset B of X×Y. Every ideally convex set is lower ideally convex. Every lower ideally convex set is convex but the converse is in general not true.
  • Template:Visible anchor if any Cauchy convex series with elements of S is convergent and its sum is in S.
  • Template:Visible anchor if any Cauchy b-convex series with elements of S is convergent and its sum is in S.

The empty set is convex, ideally convex, bcs-complete, cs-complete, and cs-closed.

Conditions (Hx) and (Hwx)

If X and Y are topological vector spaces, A is a subset of X×Y, and xX then A is said to satisfy:Template:Sfn

  • Template:Visible anchor: Whenever i=1ri(xi,yi) is a Template:Em with elements of A such that i=1riyi is convergent in Y with sum y and i=1rixi is Cauchy, then i=1rixi is convergent in X and its sum x is such that (x,y)A.
  • Template:Visible anchor: Whenever i=1ri(xi,yi) is a Template:Em with elements of A such that i=1riyi is convergent in Y with sum y and i=1rixi is Cauchy, then i=1rixi is convergent in X and its sum x is such that (x,y)A.
    • If X is locally convex then the statement "and i=1rixi is Cauchy" may be removed from the definition of condition (Hwx).

Multifunctions

The following notation and notions are used, where :XY and 𝒮:YZ are multifunctions and SX is a non-empty subset of a topological vector space X:

Relationships

Let X,Y, and Z be topological vector spaces, SX,TY, and AX×Y. The following implications hold:

complete cs-complete cs-closed lower cs-closed (lcs-closed) Template:Em ideally convex.
lower cs-closed (lcs-closed) Template:Em ideally convex lower ideally convex (li-convex) convex.
(Hx) (Hwx) convex.

The converse implications do not hold in general.

If X is complete then,

  1. S is cs-complete (respectively, bcs-complete) if and only if S is cs-closed (respectively, ideally convex).
  2. A satisfies (Hx) if and only if A is cs-closed.
  3. A satisfies (Hwx) if and only if A is ideally convex.

If Y is complete then,

  1. A satisfies (Hx) if and only if A is cs-complete.
  2. A satisfies (Hwx) if and only if A is bcs-complete.
  3. If BX×Y×Z and yY then:
    1. B satisfies (H(x, y)) if and only if B satisfies (Hx).
    2. B satisfies (Hw(x, y)) if and only if B satisfies (Hwx).

If X is locally convex and PrX(A) is bounded then,

  1. If A satisfies (Hx) then PrX(A) is cs-closed.
  2. If A satisfies (Hwx) then PrX(A) is ideally convex.

Preserved properties

Let X0 be a linear subspace of X. Let :XY and 𝒮:YZ be multifunctions.

  • If S is a cs-closed (resp. ideally convex) subset of X then X0S is also a cs-closed (resp. ideally convex) subset of X0.
  • If X is first countable then X0 is cs-closed (resp. cs-complete) if and only if X0 is closed (resp. complete); moreover, if X is locally convex then X0 is closed if and only if X0 is ideally convex.
  • S×T is cs-closed (resp. cs-complete, ideally convex, bcs-complete) in X×Y if and only if the same is true of both S in X and of T in Y.
  • The properties of being cs-closed, lower cs-closed, ideally convex, lower ideally convex, cs-complete, and bcs-complete are all preserved under isomorphisms of topological vector spaces.
  • The intersection of arbitrarily many cs-closed (resp. ideally convex) subsets of X has the same property.
  • The Cartesian product of cs-closed (resp. ideally convex) subsets of arbitrarily many topological vector spaces has that same property (in the product space endowed with the product topology).
  • The intersection of countably many lower ideally convex (resp. lower cs-closed) subsets of X has the same property.
  • The Cartesian product of lower ideally convex (resp. lower cs-closed) subsets of countably many topological vector spaces has that same property (in the product space endowed with the product topology).
  • Suppose X is a Fréchet space and the A and B are subsets. If A and B are lower ideally convex (resp. lower cs-closed) then so is A+B.
  • Suppose X is a Fréchet space and A is a subset of X. If A and :XY are lower ideally convex (resp. lower cs-closed) then so is (A).
  • Suppose Y is a Fréchet space and 2:XY is a multifunction. If ,2,𝒮 are all lower ideally convex (resp. lower cs-closed) then so are +2:XY and 𝒮:XZ.

Properties

If S be a non-empty convex subset of a topological vector space X then,

  1. If S is closed or open then S is cs-closed.
  2. If X is Hausdorff and finite dimensional then S is cs-closed.
  3. If X is first countable and S is ideally convex then intS=int(clS).

Let X be a Fréchet space, Y be a topological vector spaces, AX×Y, and PrY:X×YY be the canonical projection. If A is lower ideally convex (resp. lower cs-closed) then the same is true of PrY(A).

If X is a barreled first countable space and if CX then:

  1. If C is lower ideally convex then Ci=intC, where Ci:=aintXC denotes the algebraic interior of C in X.
  2. If C is ideally convex then Ci=intC=int(clC)=(clC)i.

See also

Notes

Template:Reflist Template:Reflist

References

Template:Functional analysis Template:Convex analysis and variational analysis Template:Analysis in topological vector spaces