Bipolar theorem

From HandWiki
Short description: Theorem in convex analysis

In mathematics, the bipolar theorem is a theorem in functional analysis that characterizes the bipolar (that is, the polar of the polar) of a set. In convex analysis, the bipolar theorem refers to a necessary and sufficient conditions for a cone to be equal to its bipolar. The bipolar theorem can be seen as a special case of the Fenchel–Moreau theorem.[1]:76–77

Preliminaries

Main page: Polar set

Suppose that X is a topological vector space (TVS) with a continuous dual space X and let x,x:=x(x) for all xX and xX. The convex hull of a set A, denoted by coA, is the smallest convex set containing A. The convex balanced hull of a set A is the smallest convex balanced set containing A.

The polar of a subset AX is defined to be: A:={xX:supaA|a,x|1}. while the prepolar of a subset BX is: B:={xX:supxB|x,x|1}. The bipolar of a subset AX, often denoted by A is the set A:=(A)={xX:supxA|x,x|1}.

Statement in functional analysis

Let σ(X,X) denote the weak topology on X (that is, the weakest TVS topology on A making all linear functionals in X continuous).

The bipolar theorem:[2] The bipolar of a subset AX is equal to the σ(X,X)-closure of the convex balanced hull of A.

Statement in convex analysis

The bipolar theorem:[1]:54[3] For any nonempty cone A in some linear space X, the bipolar set A is given by:

A=cl(co{ra:r0,aA}).

Special case

A subset CX is a nonempty closed convex cone if and only if C++=C=C when C++=(C+)+, where A+ denotes the positive dual cone of a set A.[3][4] Or more generally, if C is a nonempty convex cone then the bipolar cone is given by C=clC.

Relation to the Fenchel–Moreau theorem

Let f(x):=δ(x|C)={0xCotherwise be the indicator function for a cone C. Then the convex conjugate, f*(x*)=δ(x*|C)=δ*(x*|C)=supxCx*,x is the support function for C, and f**(x)=δ(x|C). Therefore, C=C if and only if f=f**.[1]:54[4]

See also

  • Dual system
  • Fenchel–Moreau theorem – Mathematical theorem in convex analysis − A generalization of the bipolar theorem.
  • Polar set – Subset of all points that is bounded by some given point of a dual (in a dual pairing)

References

  1. 1.0 1.1 1.2 Borwein, Jonathan; Lewis, Adrian (2006). Convex Analysis and Nonlinear Optimization: Theory and Examples (2 ed.). Springer. ISBN 9780387295701. 
  2. Narici & Beckenstein 2011, pp. 225-273.
  3. 3.0 3.1 Boyd, Stephen P.; Vandenberghe, Lieven (2004) (pdf). Convex Optimization. Cambridge University Press. pp. 51–53. ISBN 9780521833783. https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf#page=65. Retrieved October 15, 2011. 
  4. 4.0 4.1 Rockafellar, R. Tyrrell (1997) [1970]. Convex Analysis. Princeton, NJ: Princeton University Press. pp. 121–125. ISBN 9780691015866. 

Bibliography