Convex series

From HandWiki

In mathematics, particularly in functional analysis and convex analysis, a convex series is a series of the form ∑i=1∞rixi 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=1∞ri=1).

Types of Convex series

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

  • If all x1,x2,… belong to S then the convex series ∑i=1∞rixi is called a convex series with elements of S.
  • If the set {x1,x2,…} is a (von Neumann) bounded set then the series called a b-convex series.
  • The convex series ∑i=1∞rixi is said to be a convergent series if the sequence of partial sums (∑i=1nrixi)n=1∞ converges in X to some element of X, which is called the sum of the convex series.
  • The convex series is called Cauchy if ∑i=1∞rixi is a Cauchy series, which by definition means that the sequence of partial sums (∑i=1nrixi)n=1∞ is a Cauchy sequence.

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:

  • cs-closed set 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.
  • lower cs-closed set or a lcs-closed set 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).
  • ideally convex set if any convergent b-series with elements of S has its sum in S.
  • lower ideally convex set or a li-convex set 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.
  • cs-complete set if any Cauchy convex series with elements of S is convergent and its sum is in S.
  • bcs-complete set 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 x∈X then A is said to satisfy:[1]

  • Condition (Hx): Whenever ∑i=1∞ri(xi,yi) is a convex series with elements of A such that ∑i=1∞riyi is convergent in Y with sum y and ∑i=1∞rixi is Cauchy, then ∑i=1∞rixi is convergent in X and its sum x is such that (x,y)∈A.
  • Condition (Hwx): Whenever ∑i=1∞ri(xi,yi) is a b-convex series with elements of A such that ∑i=1∞riyi is convergent in Y with sum y and ∑i=1∞rixi is Cauchy, then ∑i=1∞rixi is convergent in X and its sum x is such that (x,y)∈A.
    • If X is locally convex then the statement "and ∑i=1∞rixi is Cauchy" may be removed from the definition of condition (Hwx).

Multifunctions

The following notation and notions are used, where ℛ:X⇉Y and 𝒮:Y⇉Z are multifunctions and S⊆X is a non-empty subset of a topological vector space X:

  • The graph of a multifunction of ℛ is the set gr⁡ℛ:={(x,y)∈X×Y:y∈ℛ(x)}.
  • ℛ is closed (respectively, cs-closed, lower cs-closed, convex, ideally convex, lower ideally convex, cs-complete, bcs-complete) if the same is true of the graph of ℛ in X×Y.
    • The multifunction ℛ is convex if and only if for all x0,x1∈X and all r∈[0,1], rℛ(x0)+(1−r)ℛ(x1)⊆ℛ(rx0+(1−r)x1).
  • The inverse of a multifunction ℛ is the multifunction ℛ−1:Y⇉X defined by ℛ−1(y):={x∈X:y∈ℛ(x)}. For any subset B⊆Y, ℛ−1(B):=∪y∈Bℛ−1(y).
  • The domain of a multifunction ℛ is Dom⁡ℛ:={x∈X:ℛ(x)≠∅}.
  • The image of a multifunction ℛ is Im⁡ℛ:=∪x∈Xℛ(x). For any subset A⊆X, ℛ(A):=∪x∈Aℛ(x).
  • The composition 𝒮∘ℛ:X⇉Z is defined by (𝒮∘ℛ)(x):=∪y∈ℛ(x)𝒮(y) for each x∈X.

Relationships

Let X,Y, and Z be topological vector spaces, S⊆X,T⊆Y, and A⊆X×Y. The following implications hold:

complete ⟹ cs-complete ⟹ cs-closed ⟹ lower cs-closed (lcs-closed) and ideally convex.
lower cs-closed (lcs-closed) or 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 B⊆X×Y×Z and y∈Y 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 ℛ:X⇉Y and 𝒮:Y⇉Z be multifunctions.

  • If S is a cs-closed (resp. ideally convex) subset of X then X0∩S 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 ℛ:X⇉Y are lower ideally convex (resp. lower cs-closed) then so is ℛ(A).
  • Suppose Y is a Fréchet space and ℛ2:X⇉Y is a multifunction. If ℛ,ℛ2,𝒮 are all lower ideally convex (resp. lower cs-closed) then so are ℛ+ℛ2:X⇉Y and 𝒮∘ℛ:X⇉Z.

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 int⁡S=int⁡(cl⁡S).

Let X be a Fréchet space, Y be a topological vector spaces, A⊆X×Y, and PrY:X×Y→Y 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 C⊆X then:

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

See also

  • Ursescu theorem – Generalization of closed graph, open mapping, and uniform boundedness theorem

Notes

  1. ↑ Zălinescu 2002, pp. 1–23.

References

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