Polar Set
   HOME

TheInfoList



OR:

In functional and
convex analysis Convex analysis is the branch of mathematics devoted to the study of properties of convex functions and convex sets, often with applications in convex optimization, convex minimization, a subdomain of optimization (mathematics), optimization theor ...
, and related disciplines of
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, the polar set A^ is a special convex set associated to any subset A of a
vector space In mathematics and physics, a vector space (also called a linear space) is a set (mathematics), set whose elements, often called vector (mathematics and physics), ''vectors'', can be added together and multiplied ("scaled") by numbers called sc ...
X, lying in the
dual space In mathematics, any vector space ''V'' has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on ''V,'' together with the vector space structure of pointwise addition and scalar multiplication by cons ...
X^. The bipolar of a subset is the polar of A^\circ, but lies in X (not X^).


Definitions

There are at least three competing definitions of the polar of a set, originating in projective geometry and convex analysis. In each case, the definition describes a duality between certain subsets of a pairing of vector spaces \langle X, Y \rangle over the real or complex numbers (X and Y are often
topological vector space In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
s (TVSs)). If X is a vector space over the field \mathbb then unless indicated otherwise, Y will usually, but not always, be some vector space of
linear functional In mathematics, a linear form (also known as a linear functional, a one-form, or a covector) is a linear mapIn some texts the roles are reversed and vectors are defined as linear maps from covectors to scalars from a vector space to its field of ...
s on X and the dual pairing \langle \cdot, \cdot \rangle : X \times Y \to \mathbb will be the bilinear () defined by \langle x, f \rangle := f(x). If X is a
topological vector space In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
then the space Y will usually, but not always, be the continuous dual space of X, in which case the dual pairing will again be the evaluation map. Denote the closed ball of radius r \geq 0 centered at the origin in the underlying scalar field \mathbb of X by B_r := B_r^ := \.


Functional analytic definition


Absolute polar

Suppose that \langle X, Y \rangle is a
pairing In mathematics, a pairing is an ''R''- bilinear map from the Cartesian product of two ''R''- modules, where the underlying ring ''R'' is commutative. Definition Let ''R'' be a commutative ring with unit, and let ''M'', ''N'' and ''L'' be '' ...
. The polar or absolute polar of a subset A of X is the set: \begin A^ :=& \left\ ~~~~&& \\ .7ex =& \left\ ~~~~&& \text , \langle A, y \rangle, := \ \\ .7ex =& \left\ ~~~~&& \text B_1 := \.\\ .7ex\end where \langle A, y \rangle := \ denotes the
image An image or picture is a visual representation. An image can be Two-dimensional space, two-dimensional, such as a drawing, painting, or photograph, or Three-dimensional space, three-dimensional, such as a carving or sculpture. Images may be di ...
of the set A under the map \langle \cdot, y \rangle : X \to \mathbb defined by x \mapsto \langle x, y \rangle. If \operatorname A denotes the convex balanced hull of A, which by definition is the smallest
convex Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
and balanced subset of X that contains A, then A^ = operatorname A\circ. This is an affine shift of the geometric definition; it has the useful characterization that the functional-analytic polar of the unit ball (in X) is precisely the unit ball (in Y). The prepolar or absolute prepolar of a subset B of Y is the set: ^ B := \left\ = \ Very often, the prepolar of a subset B of Y is also called the polar or absolute polar of B and denoted by B^; in practice, this reuse of notation and of the word "polar" rarely causes any issues (such as ambiguity) and many authors do not even use the word "prepolar". The bipolar of a subset A of X, often denoted by A^, is the set ^\left(A^\right); that is, A^ := ^\left(A^\right) = \left\.


Real polar

The real polar of a subset A of X is the set: A^r := \left\ and the real prepolar of a subset B of Y is the set: ^r B := \left\. As with the absolute prepolar, the real prepolar is usually called the real polar and is also denoted by B^r. It's important to note that some authors (e.g. chaefer 1999 define "polar" to mean "real polar" (rather than "absolute polar", as is done in this article) and use the notation A^ for it (rather than the notation A^r that is used in this article and in arici 2011. The real bipolar of a subset A of X, sometimes denoted by A^, is the set ^\left(A^r\right); it is equal to the \sigma(X, Y)-closure of the
convex hull In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, ...
of A \cup \. For a subset A of X, A^r is convex, \sigma(Y, X)-closed, and contains A^. In general, it is possible that A^ \neq A^r but equality will hold if A is balanced. Furthermore, A^ = \left(\operatorname \left(A^\right)\right) where \operatorname \left(A^\right) denotes the balanced hull of A^r.


Competing definitions

The definition of the "polar" of a set is not universally agreed upon. Although this article defined "polar" to mean "absolute polar", some authors define "polar" to mean "real polar" and other authors use still other definitions. No matter how an author defines "polar", the notation A^ almost always represents choice of the definition (so the meaning of the notation A^ may vary from source to source). In particular, the polar of A is sometimes defined as: A^ := \left\ where the notation A^ is standard notation. We now briefly discuss how these various definitions relate to one another and when they are equivalent. It is always the case that A^ ~ \subseteq ~ A^ ~ \subseteq ~ A^r and if \langle \cdot, \cdot \rangle is real-valued (or equivalently, if X and Y are vector spaces over \R) then A^ = A^. If A is a symmetric set (that is, -A = A or equivalently, -A \subseteq A) then A^ = A^r where if in addition \langle \cdot, \cdot \rangle is real-valued then A^ = A^ = A^r. If X and Y are vector spaces over \C (so that \langle \cdot, \cdot \rangle is complex-valued) and if i A \subseteq A (where note that this implies -A = A and i A = A), then A^ \subseteq A^ = A^r \subseteq \left(\tfrac A\right)^ where if in addition e^ A \subseteq A for all real r then A^ = A^r. Thus for all of these definitions of the polar set of A to agree, it suffices that s A \subseteq A for all scalars s of unit length Since for all of these completing definitions of the polar set A^ to agree, if \langle \cdot, \cdot \rangle is real-valued then it suffices for A to be symmetric, while if \langle \cdot, \cdot \rangle is complex-valued then it suffices that e^ A \subseteq A for all real s. (where this is equivalent to s A = A for all unit length scalar s). In particular, all definitions of the polar of A agree when A is a balanced set (which is often, but not always, the case) so that often, which of these competing definitions is used is immaterial. However, these differences in the definitions of the "polar" of a set A do sometimes introduce subtle or important technical differences when A is not necessarily balanced.


Specialization for the canonical duality

Algebraic dual space If X is any vector space then let X^ denote the algebraic dual space of X, which is the set of all
linear functionals In mathematics, a linear form (also known as a linear functional, a one-form, or a covector) is a linear mapIn some texts the roles are reversed and vectors are defined as linear maps from covectors to scalars from a vector space to its field (mat ...
on X. The vector space X^ is always a closed subset of the space \mathbb^X of all \mathbb-valued functions on X under the topology of pointwise convergence so when X^ is endowed with the subspace topology, then X^ becomes a Hausdorff complete locally convex
topological vector space In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
(TVS). For any subset A \subseteq X, let \begin A^ := A^ :=& \left\ && \\ .7ex =& \left\ ~~~~&& \text , f(A), := \ \\ .7ex =& \left\ ~~~&& \text B_1 := \.\\ .7ex\end If A \subseteq B \subseteq X are any subsets then B^ \subseteq A^ and A^ = operatorname A, where \operatorname A denotes the convex balanced hull of A. For any finite-dimensional vector subspace Y of X, let \tau_Y denote the
Euclidean topology In mathematics, and especially general topology, the Euclidean topology is the natural topology induced on n-dimensional Euclidean space \R^n by the Euclidean metric. Definition The Euclidean norm on \R^n is the non-negative function \, \cdot ...
on Y, which is the unique topology that makes Y into a Hausdorff topological vector space (TVS). If A_ denotes the union of all closures \operatorname_ (Y \cap A) as Y varies over all finite dimensional vector subspaces of X, then A^ = \left _\right (see this footnoteTo prove that A^ \subseteq \left _\right, let f \in A^. If Y is a finite-dimensional vector subspace of X then because f\big\vert_Y : \left(Y, \tau_Y\right) \to \mathbb is continuous (as is true of all linear functionals on a finite-dimensional Hausdorff TVS), it follows from f(A) \subseteq B_1 and B_1 being a closed set that f\left(\operatorname_ (Y \cap A)\right) = f\big\vert_Y \left(\operatorname_ (Y \cap A)\right) \subseteq \operatorname_(f(Y \cap A)) \subseteq \operatorname_ f(A) \subseteq \operatorname_ B_1 = B_1. The union of all such sets is consequently also a subset of B_1, which proves that f\left(A_\right) \subseteq B_1 and so f \in \left _\right. \blacksquare In general, if \tau is any TVS-topology on X then A_ \subseteq \operatorname_ A. for an explanation). If A is an absorbing subset of X then by the Banach–Alaoglu theorem, A^ is a weak-* compact subset of X^. If A \subseteq X is any non-empty subset of a vector space X and if Y is any vector space of linear functionals on X (that is, a vector subspace of the algebraic dual space of X) then the real-valued map :, \,\cdot\,, _A \;:\, Y \,\to\, \Reals defined by \left, x^\_A ~:=~ \sup \left, x^(A)\ ~:=~ \sup_ \left, x^(a)\ is a
seminorm In mathematics, particularly in functional analysis, a seminorm is like a Norm (mathematics), norm but need not be positive definite. Seminorms are intimately connected with convex sets: every seminorm is the Minkowski functional of some Absorbing ...
on Y. If A = \varnothing then by definition of the
supremum In mathematics, the infimum (abbreviated inf; : infima) of a subset S of a partially ordered set P is the greatest element in P that is less than or equal to each element of S, if such an element exists. If the infimum of S exists, it is unique, ...
, \, \sup \left, x^(A) \ = -\infty \, so that the map \, , \,\cdot\,, _ = -\infty \, defined above would not be real-valued and consequently, it would not be a seminorm. Continuous dual space Suppose that X is a
topological vector space In mathematics, a topological vector space (also called a linear topological space and commonly abbreviated TVS or t.v.s.) is one of the basic structures investigated in functional analysis. A topological vector space is a vector space that is als ...
(TVS) with continuous dual space X^. The important special case where Y := X^ and the brackets represent the canonical map: \left\langle x, x^ \right\rangle := x^(x) is now considered. The triple \left\langle X, X^ \right\rangle is the called the associated with X. The polar of a subset A \subseteq X with respect to this canonical pairing is: \begin A^ :=& \left\ ~~~~&& \text \left\langle a, x^ \right\rangle := x^(a) \\ .7ex =& \left\ ~~~~&& \text \left, x^(A)\ := \left\ \\ .7ex =& \left\ ~~~~&& \text B_1 := \.\\ .7ex\end For any subset A \subseteq X, A^ = \left operatorname_X A\right where \operatorname_X A denotes the closure of A in X. The Banach–Alaoglu theorem states that if A \subseteq X is a neighborhood of the origin in X then A^ = A^ and this polar set is a compact subset of the continuous dual space X^ when X^ is endowed with the weak-* topology (also known as the topology of pointwise convergence). If A satisfies s A \subseteq A for all scalars s of unit length then one may replace the absolute value signs by \operatorname (the real part operator) so that: \begin A^ = A^r :=& \left\ \\ .7ex =& \left\. \\ .7ex\end The prepolar of a subset B of Y = X^ is: ^ B := \left\ = \ If B satisfies s B \subseteq B for all scalars s of unit length then one may replace the absolute value signs with \operatorname so that: ^ B = \left\ = \ where B(x) := \left\. The bipolar theorem characterizes the bipolar of a subset of a topological vector space. If X is a normed space and S is the open or closed unit ball in X (or even any subset of the closed unit ball that contains the open unit ball) then S^ is the closed unit ball in the continuous dual space X^ when X^ is endowed with its canonical
dual norm In functional analysis, the dual norm is a measure of size for a continuous function, continuous linear function defined on a normed vector space. Definition Let X be a normed vector space with norm \, \cdot\, and let X^* denote its continuous d ...
.


Geometric definition for cones

The polar cone of a convex cone A \subseteq X is the set A^ := \left\ This definition gives a duality on points and hyperplanes, writing the latter as the intersection of two oppositely-oriented half-spaces. The polar hyperplane of a point x \in X is the locus \; the dual relationship for a hyperplane yields that hyperplane's polar point. Some authors (confusingly) call a dual cone the polar cone; we will not follow that convention in this article.


Properties

Unless stated otherwise, \langle X, Y \rangle will be a
pairing In mathematics, a pairing is an ''R''- bilinear map from the Cartesian product of two ''R''- modules, where the underlying ring ''R'' is commutative. Definition Let ''R'' be a commutative ring with unit, and let ''M'', ''N'' and ''L'' be '' ...
. The topology \sigma(Y, X) is the weak-* topology on Y while \sigma(X, Y) is the weak topology on X. For any set A, A^r denotes the real polar of A and A^ denotes the absolute polar of A. The term "polar" will refer to the polar. * The (absolute) polar of a set is
convex Convex or convexity may refer to: Science and technology * Convex lens, in optics Mathematics * Convex set, containing the whole line segment that joins points ** Convex polygon, a polygon which encloses a convex set of points ** Convex polytop ...
and balanced. * The real polar A^r of a subset A of X is convex but necessarily balanced; A^r will be balanced if A is balanced. * If s A \subseteq A for all scalars s of unit length then A^ = A^r. * A^ is closed in Y under the weak-*-topology on Y. * A subset S of X is weakly bounded (i.e. \sigma(X, Y)-bounded) if and only if S^ is absorbing in Y. * For a dual pair \langle X, X^ \rangle, where X is a TVS and X^ is its continuous dual space, if B \subseteq X is bounded then B^ is absorbing in X^. If X is locally convex and B^ is absorbing in X^ then B is bounded in X. Moreover, a subset S of X is weakly bounded if and only if S^ is absorbing in X^. * The bipolar A^ of a set A is the \sigma(X, Y)- closed convex hull of A \cup \, that is the smallest \sigma(X, Y)-closed and convex set containing both A and 0. ** Similarly, the bidual cone of a cone A is the \sigma(X, Y)-closed conic hull of A. * If \mathcal is a base at the origin for a TVS X then X^ = \bigcup_ \left(B^\right). * If X is a locally convex TVS then the polars (taken with respect to \left\langle X, X^ \right\rangle) of any 0-neighborhood base forms a fundamental family of equicontinuous subsets of X^ (i.e. given any bounded subset H of X^_, there exists a neighborhood S of the origin in X such that H \subseteq S^). ** Conversely, if X is a locally convex TVS then the polars (taken with respect to \langle X, X^ \rangle) of any fundamental family of equicontinuous subsets of X^ form a neighborhood base of the origin in X. * Let X be a TVS with a topology \tau. Then \tau is a locally convex TVS topology if and only if \tau is the topology of uniform convergence on the equicontinuous subsets of X^. The last two results explain why equicontinuous subsets of the continuous dual space play such a prominent role in the modern theory of functional analysis: because equicontinuous subsets encapsulate all information about the locally convex space X's original topology. Set relations * X^ = X^ = X^r = \ and \varnothing^ = \varnothing^ = \varnothing^r = Y. * For all scalars s \neq 0, (s A)^ = \tfrac \left(A^\right) and for all real t \neq 0, (t A)^ = \tfrac \left(A^\right) and (t A)^r = \tfrac \left(A^r\right). * A^ = A^. However, for the real polar we have A^ \subseteq A^r. * For any finite collection of sets A_1, \ldots, A_n, \left(A_1 \cap \cdots \cap A_n\right)^ = \left(A_1^\right) \cup \cdots \cup \left(A_n^\right). * If A \subseteq B then B^ \subseteq A^, B^r \subseteq A^r, and B^ \subseteq A^. ** An immediate corollary is that \bigcup_ \left(A_i^\right) \subseteq \left(\bigcap_ A_i\right)^; equality necessarily holds when I is finite and may fail to hold if I is infinite. * \bigcap_ \left(A_i^\right) = \left(\bigcup_ A_i\right)^ and \bigcap_ \left(A_i^r\right) = \left(\bigcup_ A_i\right)^r. * If C is a cone in X then C^ = \left\. * If \left(S_i\right)_ is a family of \sigma(X, Y)-closed subsets of X containing 0 \in X, then the real polar of \cap_ S_i is the closed convex hull of \cup_ \left(S_i^r\right). * If 0 \in A \cap B then A^ \cap B^ \subseteq 2 \left A + B)^\right\subseteq 2\left(A^ \cap B^\right). * For a closed convex cone C in a real vector space X, the polar cone is the polar of C; that is, C^ = \, where \sup_ \langle C, y \rangle := \sup_ \langle c, y \rangle.


See also

* * * * * *


Notes


References


Bibliography

* * * * * * * {{Functional analysis Functional analysis Linear functionals Topological vector spaces