Lably
Skip to content

Dual system

Dual pair of vector spaces

  • 22 min read
  • 5 chapters

Related on Lably

Through Mathematics, Real number and Complex number

In mathematics, duality is the study of dual systems and is important in functional analysis. Duality plays crucial roles in quantum mechanics because it has extensive applications to the theory of Hilbert spaces.

Definition, notation, and conventions

Pairings

A pairing or pair over a field K is a triple (X,Y,b), which may also be denoted by b(X,Y), consisting of two vector spaces X and Y over K and a bilinear map b:X×Y→K called the bilinear map associated with the pairing, or more simply called the pairing's map or its bilinear form. The examples here only describe when K is either the real numbers R or the complex numbers C, but the mathematical theory is general.

For every x∈X, define b(x,⋅):Y→Ky↦b(x,y) and for every y∈Y, define b(⋅,y):X→Kx↦b(x,y). Every b(x,⋅) is a linear functional on Y and every b(⋅,y) is a linear functional on X. Therefore both b(X,⋅):={b(x,⋅):x∈X} and b(⋅,Y):={b(⋅,y):y∈Y}, form vector spaces of linear functionals.

It is common practice to write ⟨x,y⟩ instead of b(x,y), in which in some cases the pairing may be denoted by ⟨X,Y⟩ rather than (X,Y,⟨⋅,⋅⟩). However, this article will reserve the use of ⟨⋅,⋅⟩ for the canonical evaluation map (defined below) so as to avoid confusion for readers not familiar with this subject.

Dual pairings

A pairing (X,Y,b) is called a dual system, a dual pair, or a duality over K if the bilinear form b is non-degenerate, which means that it satisfies the following two separation axioms:

  1. Y separates (distinguishes) points of X: if x∈X is such that b(x,⋅)=0 then x=0; or equivalently, for all non-zero x∈X, the map b(x,⋅):Y→K is not identically 0 (i.e. there exists a y∈Y such that b(x,y)≠0 for each x∈X);
  2. X separates (distinguishes) points of Y: if y∈Y is such that b(⋅,y)=0 then y=0; or equivalently, for all non-zero y∈Y, the map b(⋅,y):X→K is not identically 0 (i.e. there exists an x∈X such that b(x,y)≠0 for each y∈Y).

In this case b is non-degenerate, and one can say that b places X and Y in duality (or, redundantly but explicitly, in separated duality), and b is called the duality pairing of the triple (X,Y,b).

Total subsets

A subset S of Y is called total if for every x∈X, b(x,s)=0 for all s∈S implies x=0. A total subset of X is defined analogously (see footnote). Thus X separates points of Y if and only if X is a total subset of X, and similarly for Y.

Orthogonality

The vectors x and y are orthogonal, written x⊥y, if b(x,y)=0. Two subsets R⊆X and S⊆Y are orthogonal, written R⊥S, if b(R,S)={0}; that is, if b(r,s)=0 for all r∈R and s∈S. The definition of a subset being orthogonal to a vector is defined analogously.

The orthogonal complement or annihilator of a subset R⊆X is R⊥:={y∈Y:R⊥y}:={y∈Y:b(R,y)={0}}Thus R is a total subset of X if and only if R⊥ equals {0}.

Polar sets

Given a triple (X,Y,b) defining a pairing over K, the absolute polar set or polar set of a subset A of X is the set:A∘:={y∈Y:supx∈A|b(x,y)|≤1}.Symmetrically, the absolute polar set or polar set of a subset B of Y is denoted by B∘ and defined by B∘:={x∈X:supy∈B|b(x,y)|≤1}.


To use bookkeeping that helps keep track of the anti-symmetry of the two sides of the duality, the absolute polar of a subset B of Y may also be called the absolute prepolar or prepolar of B and then may be denoted by ∘B.

The polar B∘ is necessarily a convex set containing 0∈Y where if B is balanced then so is B∘ and if B is a vector subspace of X then so too is B∘ a vector subspace of Y.

If A is a vector subspace of X, then A∘=A⊥ and this is also equal to the real polar of A. If A⊆X then the bipolar of A, denoted A∘∘, is the polar of the orthogonal complement of A, i.e., the set ∘(A⊥). Similarly, if B⊆Y then the bipolar of B is B∘∘:=(∘B)∘.

Dual definitions and results

Given a pairing (X,Y,b), define a new pairing (Y,X,d) where d(y,x):=b(x,y) for all x∈X and y∈Y.

There is a consistent theme in duality theory that any definition for a pairing (X,Y,b) has a corresponding dual definition for the pairing (Y,X,d).

Convention and Definition: Given any definition for a pairing (X,Y,b), one obtains a dual definition by applying it to the pairing (Y,X,d). These conventions also apply to theorems.

For instance, if "X distinguishes points of Y" (resp, "S is a total subset of Y") is defined as above, then this convention immediately produces the dual definition of "Y distinguishes points of X" (resp, "S is a total subset of X").

This following notation is almost ubiquitous and allows us to avoid assigning a symbol to d.

Convention and Notation: If a definition and its notation for a pairing (X,Y,b) depends on the order of X and Y (for example, the definition of the Mackey topology τ(X,Y,b) on X) then by switching the order of X and Y, then it is meant that definition applied to (Y,X,d) (continuing the same example, the topology τ(Y,X,b) would actually denote the topology τ(Y,X,d)).

For another example, once the weak topology on X is defined, denoted by σ(X,Y,b), then this dual definition would automatically be applied to the pairing (Y,X,d) so as to obtain the definition of the weak topology on Y, and this topology would be denoted by σ(Y,X,b) rather than σ(Y,X,d).

Identification of ( X , Y ) {\displaystyle (X,Y)} with ( Y , X ) {\displaystyle (Y,X)}

Although it is technically incorrect and an abuse of notation, this article will adhere to the nearly ubiquitous convention of treating a pairing (X,Y,b) interchangeably with (Y,X,d) and also of denoting (Y,X,d) by (Y,X,b).

Sign in to keep reading

4 more chapters are free with a Lably account.

More in From Lably lessons