Bipolar theorem

From Wikipedia, the free encyclopedia

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

Preliminaries

Script error: No such module "Labelled list hatnote".

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 X making all linear functionals in X continuous).

The bipolar theorem:Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. 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]Template:Rp[2] 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.[2][3] 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]Template:Rp[3]

See also

References

Page Template:Reflist/styles.css has no content.

  1. ^ a b c Page Module:Citation/CS1/styles.css has no content.Borwein, Jonathan; Lewis, Adrian (2006). Convex Analysis and Nonlinear Optimization: Theory and Examples (2 ed.). Springer. ISBN 9780387295701.
  2. ^ a b Page Module:Citation/CS1/styles.css has no content.Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. pp. 51–53. ISBN 9780521833783. Retrieved October 15, 2011.
  3. ^ a b Page Module:Citation/CS1/styles.css has no content.Rockafellar, R. Tyrrell (1997) [1970]. Convex Analysis. Princeton, NJ: Princeton University Press. pp. 121–125. ISBN 9780691015866.

Bibliography

Template:Duality and spaces of linear maps Template:Topological vector spaces