Convex series

Suppose that S is a subset of X and ${\displaystyle \sum _{i=1}^{\infty }r_{i}x_{i}}$ is a convex series in X.

• If all ${\displaystyle x_{1},x_{2},\ldots }$ belong to S then the convex series ${\displaystyle \sum _{i=1}^{\infty }r_{i}x_{i}}$ is called a convex series with elements of S.
• If the set ${\displaystyle \{x_{1},x_{2},\ldots \}}$ is von Neumann bounded then the series called a b-convex series.
• The convex series ${\displaystyle \sum _{i=1}^{\infty }r_{i}x_{i}}$ is said to be convergent if the sequence of partial sums ${\displaystyle \left(\sum _{i=1}^{n}r_{i}x_{i}\right)_{n=1}^{\infty }}$ converges in X to some element of X, which is called the convex series' sum.
• The convex series is called Cauchy if ${\displaystyle \sum _{i=1}^{\infty }r_{i}x_{i}}$ is a Cauchy series, which by definition means that the sequence of partial sums ${\displaystyle \left(\sum _{i=1}^{n}r_{i}x_{i}\right)_{n=1}^{\infty }}$ is a Cauchy sequence.

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:

• cs-closed 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 or lcs-closed 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 ${\displaystyle X\times 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 if any convergent b-series with elements of S has its sum in S.
• lower ideally convex or li-convex 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 ${\displaystyle X\times 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 if any Cauchy convex series with elements of S is convergent and its sum is in S.
• bcs-complete 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.

The following notation and notions are used, where ${\displaystyle {\mathcal {R}}:X\rightrightarrows Y}$ and ${\displaystyle {\mathcal {S}}:Y\rightrightarrows Z}$ are multifunctions and ${\displaystyle S\subseteq X}$ is a non-empty subset of a topological vector space X:

• The graph of ${\displaystyle {\mathcal {R}}}$ is ${\displaystyle \operatorname {gr} {\mathcal {R}}:=\left\{(x,y)\in X\times Y:y\in {\mathcal {R}}(x)\right\}.}$
• ${\displaystyle {\mathcal {R}}}$ 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 ${\displaystyle {\mathcal {R}}}$ in ${\displaystyle X\times Y.}$
  • Note that ${\displaystyle {\mathcal {R}}}$ is convex if and only if for all ${\displaystyle x_{0},x_{1}\in X}$ and all ${\displaystyle r\in [0,1]}$, ${\displaystyle r{\mathcal {R}}\left(x_{0}\right)+(1-r){\mathcal {R}}\left(x_{1}\right)\subseteq {\mathcal {R}}\left(rx_{0}+(1-r)x_{1}\right).}$
• The inverse of ${\displaystyle {\mathcal {R}}}$ is the multifunction ${\displaystyle {\mathcal {R}}^{-1}:Y\rightrightarrows X}$ defined by ${\displaystyle {\mathcal {R}}^{-1}(y):=\left\{x\in X:y\in {\mathcal {R}}(x)\right\}}$. For any subset ${\displaystyle B\subseteq Y}$, ${\displaystyle {\mathcal {R}}^{-1}(B):=\cup _{y\in B}{\mathcal {R}}^{-1}(y).}$
• The domain of ${\displaystyle {\mathcal {R}}}$ is ${\displaystyle \operatorname {Dom} {\mathcal {R}}:=\left\{x\in X:{\mathcal {R}}(x)\neq \emptyset \right\}.}$
• The image of ${\displaystyle {\mathcal {R}}}$ is ${\displaystyle \operatorname {Im} {\mathcal {R}}:=\cup _{x\in X}{\mathcal {R}}(x)}$. For any subset ${\displaystyle A\subseteq X}$, ${\displaystyle {\mathcal {R}}(A):=\cup _{x\in A}{\mathcal {R}}(x).}$
• The composition ${\displaystyle {\mathcal {S}}\circ {\mathcal {R}}:X\rightrightarrows Z}$ is defined by ${\displaystyle \left({\mathcal {S}}\circ {\mathcal {R}}\right)(x):=\cup _{y\in {\mathcal {R}}(x)}{\mathcal {S}}(y)}$ for each ${\displaystyle x\in X.}$

Let X,Y, and Z be topological vector spaces, ${\displaystyle S\subseteq X}$, ${\displaystyle T\subseteq Y}$, and ${\displaystyle A\subseteq X\times Y.}$ The following implications hold:

complete ${\displaystyle \implies }$ cs-complete ${\displaystyle \implies }$ cs-closed ${\displaystyle \implies }$ lower cs-closed (lcs-closed) and ideally convex.

lower cs-closed (lcs-closed) or ideally convex ${\displaystyle \implies }$ lower ideally convex (li-convex) ${\displaystyle \implies }$ convex.

(Hx) ${\displaystyle \implies }$ (Hwx) ${\displaystyle \implies }$ convex.

The converse implications do not hold in general.

If X is complete then,

1. S is cs-complete (resp. bcs-complete) if and only if S is cs-closed (resp. 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 ${\displaystyle B\subseteq X\times Y\times Z}$ and ${\displaystyle y\in 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 ${\displaystyle \operatorname {Pr} _{X}(A)}$ is bounded then,

1. If A satisfies (Hx) then ${\displaystyle \operatorname {Pr} _{X}(A)}$ is cs-closed.
2. If A satisfies (Hwx) then ${\displaystyle \operatorname {Pr} _{X}(A)}$ is ideally convex.

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 ${\displaystyle \operatorname {int} S=\operatorname {int} \left(\operatorname {cl} S\right).}$

Let X be a Fréchet space, Y be a topological vector spaces, ${\displaystyle A\subseteq X\times Y}$, and ${\displaystyle \operatorname {Pr} _{Y}:X\times Y\to Y}$ be the canonical projection. If A is lower ideally convex (resp. lower cs-closed) then the same is true of ${\displaystyle \operatorname {Pr} _{Y}(A).}$

If X is a barreled first countable space and if ${\displaystyle C\subseteq X}$ then:

1. If C is lower ideally convex then ${\displaystyle C^{i}=\operatorname {int} C}$, where ${\displaystyle C^{i}:=\operatorname {aint} _{X}C}$ denotes the algebraic interior of C in X.
2. If C is ideally convex then ${\displaystyle C^{i}=\operatorname {int} C=\operatorname {int} \left(\operatorname {cl} C\right)=\left(\operatorname {cl} C\right)^{i}.}$

• Ursescu theorem

• Zalinescu, C (2002). Convex analysis in general vector spaces. River Edge, N.J. London: World Scientific. ISBN 981-238-067-1. OCLC 285163112.CS1 maint: ref=harv (link)
• Baggs, Ivan (1974). "Functions with a closed graph". Proceedings of the American Mathematical Society. 43 (2): 439–442. doi:10.1090/S0002-9939-1974-0334132-8. ISSN 0002-9939.