Polar set

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
See also polar set (potential theory).

In functional and convex analysis, related disciplines of mathematics, the polar set A° is a special convex set associated to any subset A of a vector space X lying in the dual space . The bipolar of a subset is the polar of A°, but lies in X (not ).

Definitions[edit]

There are at least three competing definitions of the polar of a set, originating in projective geometry and convex analysis.[1][citation needed] In each case, the definition describes a duality between certain subsets of a pairing of vector spacesX, Y⟩ over the real or complex numbers (X and Y are often topological vector spaces (TVSs)).

Functional analytic definition[edit]

Absolute polar[edit]

Suppose that is a pairing. The polar or absolute polar of a subset A of X is the set:

where .

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:

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 ; that is,

.

Real polar[edit]

The real polar of a subset A of X is the set:

and the real prepolar of a subset B of Y is the set:

.

As with the absolute prepolar, the real prepolar is usually called the real polar and is also denoted by Br.[2] It's important to note that some authors (e.g. [Schaefer 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 Ar that is used in this article and in [Narici 2011]).

The real bipolar of a subset A of X, sometimes denoted by Ar r, is the set ; it is equal to the 𝜎(X, Y)-closure of the convex hull of A ∪ { 0 }.[2]

For a subset A of X, Ar is convex, 𝜎(Y, X)-closed, and contains A°.[2] In general, it is possible that A° ≠ Ar but equality will hold if A is balanced. Furthermore, A = where bal(Ar) denotes the balanced hull of Ar.[2]

Competing definitions[edit]

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 their 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:

where the notation A|r| is not standard notation.

We now briefly discuss how these various definitions relate to one another and when they are equivalent.

We always have A° ⊆ A|r|Ar and if ⟨•, •⟩ is real-valued (or equivalently, if X and Y are vector spaces over ) then A° = A|r|.

If A is symmetric (i.e. -A = A or equivalently, -AA) then A|r| = Ar where if in addition ⟨•, •⟩ is real-valued then A° = A|r| = Ar.

If X and Y are vector spaces over (so that ⟨•, •⟩ is complex-valued) and if iAA (where note that this implies -A = A and iA = A), then

A° ⊆ A|r| = Ar ⊆ (1/2 A

where if in addition AA for all real r then A = Ar.[2]

Thus for all of these definitions of the polar set of A to agree, it suffices that sAA for all scalars s of unit length[nb 1] (where this is equivalent to sA = 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 difference 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[edit]

Suppose that X is a topological vector space (TVS) with continuous dual space . We consider the important special case where Y := and the brackets represent the canonical map (i.e. ). Thus is the canonical pairing.

The polar of a subset AX is:

If A satisfies sAA for all scalars s of unit length then one may replace the absolute value signs by (the real part operator) so that:

.

The prepolar of a subset B of is:

If B satisfies sBB for all scalars s of unit length then one may replace the absolute value signs with so that:

where B(x) := .

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 when is endowed with its canonical dual norm.

Geometric definition for cones[edit]

The polar cone of a convex cone AX is the set

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 xX is the locus ; the dual relationship for a hyperplane yields that hyperplane's polar point.[3][citation needed]

Some authors (confusingly) call a dual cone the polar cone; we will not follow that convention in this article.[4]

Properties[edit]

Unless stated otherwise, we henceforth assume that X, Y is a pairing. Note that 𝜎(Y, X) is the weak-* topology on Y while 𝜎(X, Y) is the weak topology on X. For any set A}, Ar denotes the real polar of A and A° denotes the absolute polar of A. By "polar" we mean the absolute polar.

  • The (absolute) polar of a set is convex and balanced.[5]
  • The real polar Ar of a subset A of X is convex but not necessarily balanced; Ar will be balanced if A is balanced.[6]
  • If sAA for all scalars s of unit length then A° = Ar.
  • A° is closed in Y under the weak-*-topology on Y.[3]
  • A subset S of X is weakly bounded (i.e. 𝜎(X, Y)-bounded) if and only if S° is absorbing in Y.[2]
  • For a dual pair (X, X'), where X is a TVS and X' is its continuous dual space, if BX is bounded then B° is absorbing in X'.[5] 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 𝜎(X, Y)-closed convex hull of A ∪ { 0 }, that is the smallest 𝜎(X, Y)-closed and convex set containing both A and 0.
    • Similarly, the bidual cone of a cone A is the 𝜎(X, Y)-closed conic hull of A.[7]
  • If is a base at the origin for a TVS X, then X' = B ∈ ℬ B°.[8]
  • If X is a locally convex TVS then the polars (taken with respect to ) of any 0-neighborhood base forms a fundamental family of equicontinuous subsets of X' (i.e. given any bounded subset H of , there exists a neighborhood S of 0 in X such that HS°).[6]
    • Conversely, if X is a locally convex TVS then the polars (taken with respect to X, X#) of any fundamental family of equicontinuous subsets of X' form a neighborhood base of the origin in X.[6]
  • Let X be a TVS with a topology 𝜏. Then 𝜏 is a locally convex TVS topology if and only if 𝜏 is the topology of uniform convergence on the equicontinuous subsets of X'.[6] 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
  • ∅° = ∅|r| = ∅r = X and X° = X|r| = Xr = { 0  }.[6]
  • For all scalars s ≠ 0, (sA)° = 1/s (A°) and for all real t ≠ 0,  (tA)|r| = 1/t (A|r|) and (tA)r = 1/t (Ar).
  • A°°° = A°. However, for the real polar we have Ar r rAr.[6]
  • For any finite collection of sets A1, ..., An,
    (A1) ∩ ··· ∩ An)°  =  (A1°) ∪ ··· ∪ (An°).
  • If AB then B° ⊆ A°, BrBr, and B|r|B|r|.
    • An immediate corollary is that ; equality necessarily holds when I is finite and may fail to hold if I is infinite.
  • and .
  • If C is a cone in X then C° = { yY : ⟨c, y⟩ = 0 for all cC}.[5]
  • If is a family of 𝜎(X, Y)-closed subsets of X containing 0 ∈ X, then the real polar of is the closed convex hull of .[6]
  • If 0 ∈ AB  then  A° ∩ B°  ⊆  2 [(A + B)°]  ⊆  2 (A° ∩ B°).[9]
  • For a closed convex cone C in a real vector space X, the polar cone is the polar of C; that is,
    C° = { yY : sup ⟨C, y⟩ ≤ 0 },
    that is, C° = { yY : sup { ⟨c, y⟩ : cC } ≤ 0}.[1]

See also[edit]

Notes[edit]

  1. ^ Since for all of these completing definitions of the polar set A° to agree, if ⟨•, •⟩ is real-valued then it suffices for A to be symmetric, while if ⟨•, •⟩ is complex-valued then it suffices that AA for all real s.

References[edit]

  1. ^ a b Aliprantis, C.D.; Border, K.C. (2007). Infinite Dimensional Analysis: A Hitchhiker's Guide (3 ed.). Springer. p. 215. doi:10.1007/3-540-29587-9. ISBN 978-3-540-32696-0.
  2. ^ a b c d e f Narici & Beckenstein 2011, pp. 225-273.
  3. ^ a b Zălinescu, C. (2002). Convex Analysis in General Vector Spaces. River Edge, NJ: World Scientific. pp. 7–8. ISBN 978-9812380678.
  4. ^ Rockafellar, T.R. (1970). Convex Analysis. Princeton University. pp. 121-8. ISBN 978-0-691-01586-6.
  5. ^ a b c Trèves 2006, pp. 195-201.
  6. ^ a b c d e f g Schaefer & Wolff 1999, pp. 123–128.
  7. ^ Niculescu, C.P.; Persson, Lars-Erik (2018). Convex Functions and Their Applications. CMS Books in Mathematics. Cham, Switzerland: Springer. pp. 94–5, 134–5. doi:10.1007/978-3-319-78337-6. ISBN 978-3-319-78337-6.
  8. ^ Narici & Beckenstein 2011, p. 472.
  9. ^ Jarchow 1981, pp. 148-150.

Bibliography[edit]