Dual space

From testwiki
Revision as of 21:59, 15 January 2025 by imported>Xxalex1234 xX (โ†’Injection into the double-dual)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)
Jump to navigation Jump to search

Template:Short description Template:Use American English

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 constants.

The dual space as defined above is defined for all vector spaces, and to avoid ambiguity may also be called the Template:Em. When defined for a topological vector space, there is a subspace of the dual space, corresponding to continuous linear functionals, called the continuous dual space.

Dual vector spaces find application in many branches of mathematics that use vector spaces, such as in tensor analysis with finite-dimensional vector spaces. When applied to vector spaces of functions (which are typically infinite-dimensional), dual spaces are used to describe measures, distributions, and Hilbert spaces. Consequently, the dual space is an important concept in functional analysis.

Early terms for dual include polarer Raum [Hahn 1927], espace conjuguรฉ, adjoint space [Alaoglu 1940], and transponierter Raum [Schauder 1930] and [Banach 1932]. The term dual is due to Bourbaki 1938.Template:Sfn

Algebraic dual space

Given any vector space V over a field F, the (algebraic) dual space V*[1] (alternatively denoted by V[2] or V[3][4])[nb 1] is defined as the set of all linear maps φ:VF (linear functionals). Since linear maps are vector space homomorphisms, the dual space may be denoted hom(V,F).[2] The dual space V* itself becomes a vector space over F when equipped with an addition and scalar multiplication satisfying:

(φ+ψ)(x)=φ(x)+ψ(x)(aφ)(x)=a(φ(x))

for all φ,ψV*, xV, and aF.

Elements of the algebraic dual space V* are sometimes called covectors, one-forms, or linear forms.

The pairing of a functional φ in the dual space V* and an element x of V is sometimes denoted by a bracket: φ(x)=[x,φ][5] or φ(x)=x,φ.[6] This pairing defines a nondegenerate bilinear mapping[nb 2] ,:V×V*F called the natural pairing.

Finite-dimensional case

Template:See also If V is finite-dimensional, then V* has the same dimension as V. Given a basis {๐ž1,,๐žn} in V, it is possible to construct a specific basis in V*, called the dual basis. This dual basis is a set {๐ž1,,๐žn} of linear functionals on V, defined by the relation

๐ži(c1๐ž1++cn๐žn)=ci,i=1,,n

for any choice of coefficients ciF. In particular, letting in turn each one of those coefficients be equal to one and the other coefficients zero, gives the system of equations

๐ži(๐žj)=δji

where δji is the Kronecker delta symbol. This property is referred to as the bi-orthogonality property.

Template:Collapse top Consider {๐ž1,,๐žn} the basis of V. Let {๐ž1,,๐žn} be defined as the following:

๐ži(c1๐ž1++cn๐žn)=ci,i=1,,n.

These are a basis of V* because:

  1. The ๐ži,i=1,2,,n, are linear functionals, which map x,yV such as x=α1๐ž1++αn๐žn and y=β1๐ž1++βn๐žn to scalars ๐ži(x)=αi and ๐ži(y)=βi. Then also, x+λy=(α1+λβ1)๐ž1++(αn+λβn)๐žn and ๐ži(x+λy)=αi+λβi=๐ži(x)+λ๐ži(y). Therefore, ๐žiV* for i=1,2,,n.
  2. Suppose λ1๐ž1++λn๐žn=0V*. Applying this functional on the basis vectors of V successively, lead us to λ1=λ2==λn=0 (The functional applied in ๐ži results in λi). Therefore, {๐ž1,,๐žn} is linearly independent on V*.
  3. Lastly, consider gV*. Then
g(x)=g(α1๐ž1++αn๐žn)=α1g(๐ž1)++αng(๐žn)=๐ž1(x)g(๐ž1)++๐žn(x)g(๐žn)

and {๐ž1,,๐žn} generates V*. Hence, it is a basis of V*. Template:Collapse bottom

For example, if V is โ„2, let its basis be chosen as {๐ž1=(1/2,1/2),๐ž2=(0,1)}. The basis vectors are not orthogonal to each other. Then, ๐ž1 and ๐ž2 are one-forms (functions that map a vector to a scalar) such that ๐ž1(๐ž1)=1, ๐ž1(๐ž2)=0, ๐ž2(๐ž1)=0, and ๐ž2(๐ž2)=1. (Note: The superscript here is the index, not an exponent.) This system of equations can be expressed using matrix notation as

[e11e12e21e22][e11e21e12e22]=[1001].

Solving for the unknown values in the first matrix shows the dual basis to be {๐ž1=(2,0),๐ž2=(1,1)}. Because ๐ž1 and ๐ž2 are functionals, they can be rewritten as ๐ž1(x,y)=2x and ๐ž2(x,y)=x+y.

In general, when V is โ„n, if E=[๐ž1||๐žn] is a matrix whose columns are the basis vectors and E^=[๐ž1||๐žn] is a matrix whose columns are the dual basis vectors, then

E^TE=In,

where In is the identity matrix of order n. The biorthogonality property of these two basis sets allows any point ๐ฑV to be represented as

๐ฑ=i๐ฑ,๐ži๐ži=i๐ฑ,๐ži๐ži,

even when the basis vectors are not orthogonal to each other. Strictly speaking, the above statement only makes sense once the inner product , and the corresponding duality pairing are introduced, as described below in Template:Section link.

In particular, โ„n can be interpreted as the space of columns of n real numbers, its dual space is typically written as the space of rows of n real numbers. Such a row acts on โ„n as a linear functional by ordinary matrix multiplication. This is because a functional maps every n-vector x into a real number y. Then, seeing this functional as a matrix M, and x as an n×1 matrix, and y a 1×1 matrix (trivially, a real number) respectively, if Mx=y then, by dimension reasons, M must be a 1×n matrix; that is, M must be a row vector.

If V consists of the space of geometrical vectors in the plane, then the level curves of an element of V* form a family of parallel lines in V, because the range is 1-dimensional, so that every point in the range is a multiple of any one nonzero element. So an element of V* can be intuitively thought of as a particular family of parallel lines covering the plane. To compute the value of a functional on a given vector, it suffices to determine which of the lines the vector lies on. Informally, this "counts" how many lines the vector crosses. More generally, if V is a vector space of any dimension, then the level sets of a linear functional in V* are parallel hyperplanes in V, and the action of a linear functional on a vector can be visualized in terms of these hyperplanes.[7]

Infinite-dimensional case

If V is not finite-dimensional but has a basis[nb 3] ๐žα indexed by an infinite set A, then the same construction as in the finite-dimensional case yields linearly independent elements ๐žα (αA) of the dual space, but they will not form a basis.

For instance, consider the space โ„, whose elements are those sequences of real numbers that contain only finitely many non-zero entries, which has a basis indexed by the natural numbers โ„•. For iโ„•, ๐ži is the sequence consisting of all zeroes except in the i-th position, which is 1. The dual space of โ„ is (isomorphic to) โ„โ„•, the space of all sequences of real numbers: each real sequence (an) defines a function where the element (xn) of โ„ is sent to the number

nanxn,

which is a finite sum because there are only finitely many nonzero xn. The dimension of โ„ is countably infinite, whereas โ„โ„• does not have a countable basis.

This observation generalizes to any[nb 3] infinite-dimensional vector space V over any field F: a choice of basis {๐žα:αA} identifies V with the space (FA)0 of functions f:AF such that fα=f(α) is nonzero for only finitely many αA, where such a function f is identified with the vector

αAfα๐žα

in V (the sum is finite by the assumption on f, and any vV may be written uniquely in this way by the definition of the basis).

The dual space of V may then be identified with the space FA of all functions from A to F: a linear functional T on V is uniquely determined by the values θα=T(๐žα) it takes on the basis of V, and any function θ:AF (with θ(α)=θα) defines a linear functional T on V by

T(αAfα๐žα)=αAfαT(eα)=αAfαθα.

Again, the sum is finite because fα is nonzero for only finitely many α.

The set (FA)0 may be identified (essentially by definition) with the direct sum of infinitely many copies of F (viewed as a 1-dimensional vector space over itself) indexed by A, i.e. there are linear isomorphisms

V(FA)0αAF.

On the other hand, FA is (again by definition), the direct product of infinitely many copies of F indexed by A, and so the identification

V*(αAF)*αAF*αAFFA

is a special case of a general result relating direct sums (of modules) to direct products.

If a vector space is not finite-dimensional, then its (algebraic) dual space is always of larger dimension (as a cardinal number) than the original vector space. This is in contrast to the case of the continuous dual space, discussed below, which may be isomorphic to the original vector space even if the latter is infinite-dimensional.

The proof of this inequality between dimensions results from the following.

If V is an infinite-dimensional F-vector space, the arithmetical properties of cardinal numbers implies that

dim(V)=|A|<|F||A|=|V|=max(|dim(V)|,|F|),

where cardinalities are denoted as absolute values. For proving that dim(V)<dim(V*), it suffices to prove that |F||dim(V)|, which can be done with an argument similar to Cantor's diagonal argument.[8] The exact dimension of the dual is given by the Erdล‘sโ€“Kaplansky theorem.

Bilinear products and dual spaces

If V is finite-dimensional, then V is isomorphic to Vโˆ—. But there is in general no natural isomorphism between these two spaces.[9] Any bilinear form Template:Math on V gives a mapping of V into its dual space via

vv,

where the right hand side is defined as the functional on V taking each Template:Math to Template:Math. In other words, the bilinear form determines a linear mapping

Φ,:VV*

defined by

[Φ,(v),w]=v,w.

If the bilinear form is nondegenerate, then this is an isomorphism onto a subspace of Vโˆ—. If V is finite-dimensional, then this is an isomorphism onto all of Vโˆ—. Conversely, any isomorphism Φ from V to a subspace of Vโˆ— (resp., all of Vโˆ— if V is finite dimensional) defines a unique nondegenerate bilinear form Template:Math on V by

v,wΦ=(Φ(v))(w)=[Φ(v),w].

Thus there is a one-to-one correspondence between isomorphisms of V to a subspace of (resp., all of) Vโˆ— and nondegenerate bilinear forms on V.

If the vector space V is over the complex field, then sometimes it is more natural to consider sesquilinear forms instead of bilinear forms. In that case, a given sesquilinear form Template:Math determines an isomorphism of V with the complex conjugate of the dual space

Φ,:VV*.

The conjugate of the dual space V* can be identified with the set of all additive complex-valued functionals Template:Math such that

f(αv)=αf(v).

Injection into the double-dual

There is a natural homomorphism Ψ from V into the double dual V**=hom(V*,F), defined by (Ψ(v))(φ)=φ(v) for all vV,φV*. In other words, if evv:V*F is the evaluation map defined by φφ(v), then Ψ:VV** is defined as the map vevv. This map Ψ is always injective;[nb 3] and it is always an isomorphism if V is finite-dimensional.[10] Indeed, the isomorphism of a finite-dimensional vector space with its double dual is an archetypal example of a natural isomorphism. Infinite-dimensional Hilbert spaces are not isomorphic to their algebraic double duals, but instead to their continuous double duals.

Transpose of a linear map

Template:Main If Template:Math is a linear map, then the transpose (or dual) Template:Math is defined by

f*(φ)=φf

for every φW*. The resulting functional f*(φ) in V* is called the pullback of φ along f.

The following identity holds for all φW* and vV:

[f*(φ),v]=[φ,f(v)],

where the bracket [ยท,ยท] on the left is the natural pairing of V with its dual space, and that on the right is the natural pairing of W with its dual. This identity characterizes the transpose,[11] and is formally similar to the definition of the adjoint.

The assignment Template:Math produces an injective linear map between the space of linear operators from V to W and the space of linear operators from WTemplate:I sup to VTemplate:I sup; this homomorphism is an isomorphism if and only if W is finite-dimensional. If Template:Math then the space of linear maps is actually an algebra under composition of maps, and the assignment is then an antihomomorphism of algebras, meaning that Template:Math. In the language of category theory, taking the dual of vector spaces and the transpose of linear maps is therefore a contravariant functor from the category of vector spaces over F to itself. It is possible to identify (fTemplate:I sup)Template:Sup with f using the natural injection into the double dual.

If the linear map f is represented by the matrix A with respect to two bases of V and W, then fTemplate:I sup is represented by the transpose matrix AT with respect to the dual bases of WTemplate:I sup and VTemplate:I sup, hence the name. Alternatively, as f is represented by A acting on the left on column vectors, fTemplate:I sup is represented by the same matrix acting on the right on row vectors. These points of view are related by the canonical inner product on Rn, which identifies the space of column vectors with the dual space of row vectors.

Quotient spaces and annihilators

Let S be a subset of V. The annihilator of S in V*, denoted here S0, is the collection of linear functionals fV* such that [f,s]=0 for all sS. That is, S0 consists of all linear functionals f:VF such that the restriction to S vanishes: f|S=0. Within finite dimensional vector spaces, the annihilator is dual to (isomorphic to) the orthogonal complement.

The annihilator of a subset is itself a vector space. The annihilator of the zero vector is the whole dual space: {0}0=V*, and the annihilator of the whole space is just the zero covector: V0={0}V*. Furthermore, the assignment of an annihilator to a subset of V reverses inclusions, so that if {0}STV, then

{0}T0S0V*.

If A and B are two subsets of V then

A0+B0(AB)0.

If (Ai)iI is any family of subsets of V indexed by i belonging to some index set I, then

(iIAi)0=iIAi0.

In particular if A and B are subspaces of V then

(A+B)0=A0B0

and[nb 3]

(AB)0=A0+B0.

If V is finite-dimensional and W is a vector subspace, then

W00=W

after identifying W with its image in the second dual space under the double duality isomorphism VV**. In particular, forming the annihilator is a Galois connection on the lattice of subsets of a finite-dimensional vector space.

If W is a subspace of V then the quotient space V/W is a vector space in its own right, and so has a dual. By the first isomorphism theorem, a functional f:VF factors through V/W if and only if W is in the kernel of f. There is thus an isomorphism

(V/W)*W0.

As a particular consequence, if V is a direct sum of two subspaces A and B, then V* is a direct sum of A0 and B0.

Dimensional analysis

The dual space is analogous to a "negative"-dimensional space. Most simply, since a vector vV can be paired with a covector φV* by the natural pairing x,φ:=φ(x)F to obtain a scalar, a covector can "cancel" the dimension of a vector, similar to reducing a fraction. Thus while the direct sum VV* is a Template:Tmath-dimensional space (if Template:Tmath is Template:Tmath-dimensional), Template:Tmath behaves as an Template:Tmath-dimensional space, in the sense that its dimensions can be canceled against the dimensions of Template:Tmath. This is formalized by tensor contraction.

This arises in physics via dimensional analysis, where the dual space has inverse units.[12] Under the natural pairing, these units cancel, and the resulting scalar value is dimensionless, as expected. For example, in (continuous) Fourier analysis, or more broadly timeโ€“frequency analysis:[nb 4] given a one-dimensional vector space with a unit of time Template:Tmath, the dual space has units of frequency: occurrences per unit of time (units of Template:Tmath). For example, if time is measured in seconds, the corresponding dual unit is the inverse second: over the course of 3 seconds, an event that occurs 2 times per second occurs a total of 6 times, corresponding to 3s2s1=6. Similarly, if the primal space measures length, the dual space measures inverse length.

Continuous dual space

When dealing with topological vector spaces, the continuous linear functionals from the space into the base field ๐”ฝ=โ„‚ (or โ„) are particularly important. This gives rise to the notion of the "continuous dual space" or "topological dual" which is a linear subspace of the algebraic dual space V*, denoted by V. For any finite-dimensional normed vector space or topological vector space, such as Euclidean n-space, the continuous dual and the algebraic dual coincide. This is however false for any infinite-dimensional normed space, as shown by the example of discontinuous linear maps. Nevertheless, in the theory of topological vector spaces the terms "continuous dual space" and "topological dual space" are often replaced by "dual space".

For a topological vector space V its continuous dual space,[13] or topological dual space,[14] or just dual space[13][14][15][16] (in the sense of the theory of topological vector spaces) V is defined as the space of all continuous linear functionals φ:V๐”ฝ.

Important examples for continuous dual spaces are the space of compactly supported test functions ๐’Ÿ and its dual ๐’Ÿ, the space of arbitrary distributions (generalized functions); the space of arbitrary test functions โ„ฐ and its dual โ„ฐ, the space of compactly supported distributions; and the space of rapidly decreasing test functions ๐’ฎ, the Schwartz space, and its dual ๐’ฎ, the space of tempered distributions (slowly growing distributions) in the theory of generalized functions.

Properties

If Template:Mvar is a Hausdorff topological vector space (TVS), then the continuous dual space of Template:Mvar is identical to the continuous dual space of the completion of Template:Mvar.Template:Sfn

Topologies on the dual

Template:Main

There is a standard construction for introducing a topology on the continuous dual V of a topological vector space V. Fix a collection ๐’œ of bounded subsets of V. This gives the topology on V of uniform convergence on sets from ๐’œ, or what is the same thing, the topology generated by seminorms of the form

φA=supxA|φ(x)|,

where φ is a continuous linear functional on V, and A runs over the class ๐’œ.

This means that a net of functionals φi tends to a functional φ in V if and only if

 for all A๐’œφiφA=supxA|φi(x)φ(x)|i0.

Usually (but not necessarily) the class ๐’œ is supposed to satisfy the following conditions:

  • Each point x of V belongs to some set A๐’œ:
     for all xV there exists some A๐’œ such that xA.
  • Each two sets A๐’œ and B๐’œ are contained in some set C๐’œ:
     for all A,B๐’œ there exists some C๐’œ such that ABC.
  • ๐’œ is closed under the operation of multiplication by scalars:
     for all A๐’œ and all λ๐”ฝ such that λA๐’œ.

If these requirements are fulfilled then the corresponding topology on V is Hausdorff and the sets

UA={φV:φA<1}, for A๐’œ

form its local base.

Here are the three most important special cases.

  • The strong topology on V is the topology of uniform convergence on bounded subsets in V (so here ๐’œ can be chosen as the class of all bounded subsets in V).

If V is a normed vector space (for example, a Banach space or a Hilbert space) then the strong topology on V is normed (in fact a Banach space if the field of scalars is complete), with the norm

φ=supx1|φ(x)|.
  • The stereotype topology on V is the topology of uniform convergence on totally bounded sets in V (so here ๐’œ can be chosen as the class of all totally bounded subsets in V).
  • The weak topology on V is the topology of uniform convergence on finite subsets in V (so here ๐’œ can be chosen as the class of all finite subsets in V).

Each of these three choices of topology on V leads to a variant of reflexivity property for topological vector spaces:

  • If V is endowed with the strong topology, then the corresponding notion of reflexivity is the standard one: the spaces reflexive in this sense are just called reflexive.[17]
  • If V is endowed with the stereotype dual topology, then the corresponding reflexivity is presented in the theory of stereotype spaces: the spaces reflexive in this sense are called stereotype.
  • If V is endowed with the weak topology, then the corresponding reflexivity is presented in the theory of dual pairs:[18] the spaces reflexive in this sense are arbitrary (Hausdorff) locally convex spaces with the weak topology.[19]

Examples

Let 1 < p < โˆž be a real number and consider the Banach space โ„“ p of all sequences Template:Math for which

๐šp=(n=0|an|p)1p<.

Define the number q by Template:Math. Then the continuous dual of โ„“p is naturally identified with โ„“q: given an element φ(p), the corresponding element of Template:Math is the sequence (φ(๐žn)) where ๐žn denotes the sequence whose Template:Mvar-th term is 1 and all others are zero. Conversely, given an element Template:Math, the corresponding continuous linear functional φ on Template:Math is defined by

φ(๐›)=nanbn

for all Template:Math (see Hรถlder's inequality).

In a similar manner, the continuous dual of Template:Math is naturally identified with Template:Math (the space of bounded sequences). Furthermore, the continuous duals of the Banach spaces c (consisting of all convergent sequences, with the supremum norm) and c0 (the sequences converging to zero) are both naturally identified with Template:Math.

By the Riesz representation theorem, the continuous dual of a Hilbert space is again a Hilbert space which is anti-isomorphic to the original space. This gives rise to the braโ€“ket notation used by physicists in the mathematical formulation of quantum mechanics.

By the Rieszโ€“Markovโ€“Kakutani representation theorem, the continuous dual of certain spaces of continuous functions can be described using measures.

Transpose of a continuous linear map

Template:See also

If Template:Math is a continuous linear map between two topological vector spaces, then the (continuous) transpose Template:Math is defined by the same formula as before:

T(φ)=φT,φW.

The resulting functional Template:Math is in Template:Math. The assignment Template:Math produces a linear map between the space of continuous linear maps from V to W and the space of linear maps from Template:Math to Template:Math. When T and U are composable continuous linear maps, then

(UT)=TU.

When V and W are normed spaces, the norm of the transpose inTemplate:Math is equal to that of T in Template:Math. Several properties of transposition depend upon the Hahnโ€“Banach theorem. For example, the bounded linear map T has dense range if and only if the transpose Template:Math is injective.

When T is a compact linear map between two Banach spaces V and W, then the transpose Template:Math is compact. This can be proved using the Arzelร โ€“Ascoli theorem.

When V is a Hilbert space, there is an antilinear isomorphism iV from V onto its continuous dual Template:Math. For every bounded linear map T on V, the transpose and the adjoint operators are linked by

iVT*=TiV.

When T is a continuous linear map between two topological vector spaces V and W, then the transpose Template:Math is continuous when Template:Math and Template:Math are equipped with "compatible" topologies: for example, when for Template:Math and Template:Math, both duals Template:Math have the strong topology Template:Math of uniform convergence on bounded sets of X, or both have the weak-โˆ— topology Template:Math of pointwise convergence on X. The transpose Template:Math is continuous from Template:Math to Template:Math, or from Template:Math to Template:Math.

Annihilators

Assume that W is a closed linear subspace of a normed space V, and consider the annihilator of W in Template:Math,

W={φV:Wkerφ}.

Then, the dual of the quotient Template:Math can be identified with WโŠฅ, and the dual of W can be identified with the quotient Template:Math.[20] Indeed, let P denote the canonical surjection from V onto the quotient Template:Math; then, the transpose Template:Math is an isometric isomorphism from Template:Math into Template:Math, with range equal to WโŠฅ. If j denotes the injection map from W into V, then the kernel of the transpose Template:Math is the annihilator of W:

ker(j)=W

and it follows from the Hahnโ€“Banach theorem that Template:Math induces an isometric isomorphism Template:Math.

Further properties

If the dual of a normed space Template:Mvar is separable, then so is the space Template:Mvar itself. The converse is not true: for example, the space Template:Math is separable, but its dual Template:Math is not.

Double dual

This is a natural transformation of vector addition from a vector space to its double dual. Template:Math denotes the ordered pair of two vectors. The addition + sends x1 and x2 to Template:Math. The addition +โ€ฒ induced by the transformation can be defined as [Ψ(x1)+Ψ(x2)](φ)=φ(x1+x2)=φ(x) for any φ in the dual space.

In analogy with the case of the algebraic double dual, there is always a naturally defined continuous linear operator Template:Math from a normed space V into its continuous double dual Template:Math, defined by

Ψ(x)(φ)=φ(x),xV, φV.

As a consequence of the Hahnโ€“Banach theorem, this map is in fact an isometry, meaning Template:Math for all Template:Math. Normed spaces for which the map ฮจ is a bijection are called reflexive.

When V is a topological vector space then ฮจ(x) can still be defined by the same formula, for every Template:Math, however several difficulties arise. First, when V is not locally convex, the continuous dual may be equal to { 0 } and the map ฮจ trivial. However, if V is Hausdorff and locally convex, the map ฮจ is injective from V to the algebraic dual Template:Math of the continuous dual, again as a consequence of the Hahnโ€“Banach theorem.[nb 5]

Second, even in the locally convex setting, several natural vector space topologies can be defined on the continuous dual Template:Math, so that the continuous double dual Template:Math is not uniquely defined as a set. Saying that ฮจ maps from V to Template:Math, or in other words, that ฮจ(x) is continuous on Template:Math for every Template:Math, is a reasonable minimal requirement on the topology of Template:Math, namely that the evaluation mappings

φVφ(x),xV,

be continuous for the chosen topology on Template:Math. Further, there is still a choice of a topology on Template:Math, and continuity of ฮจ depends upon this choice. As a consequence, defining reflexivity in this framework is more involved than in the normed case.

See also

Notes

Template:Reflist

References

Template:Reflist

Bibliography

Template:Linear algebra Template:Functional analysis Template:Duality and spaces of linear maps


Cite error: <ref> tags exist for a group named "nb", but no corresponding <references group="nb"/> tag was found