Dual spaces and the Fenchel conjugate
Posted on:
Dual spaces lie at the core of linear algebra and allows us to formally reason about the concept of duality in mathematics. Duality shows up naturally and elegantly in measure theory, functional analysis, and mathematical optimization. In this post, I have tried to learn and explore the nature of duality via Dual spaces, its interpretation in general linear algebra, all of which was motivated by the so called convex conjugate, or the Fenchel conjugate in mathematical optimization.
For the sake of abstractness and general applicability, we will consider that we are in a general field which for example can be , etc. Our space of vectors, is the vector space , which in general can be subspace of for some for example.
Dual spaces
Dual space - The dual space of the vector space , is the set of all linear transformations from to denoted as .
Linear functionals - An element of is called a linear functional, which takes in a vector , and outputs an element in .
Note that if , then is also in for and would be defined as for all . Let us look at a few examples :
- If is the space of all univariate polynomial over the field with degree , then defined as , is a linear functional contained in .
- If be the space of all real matrices of size , then defined as , is a linear functional contained in .
- If is the space of all real valued continuous functions on , then defined as , is a linear functional contained in . This function essentially outputs the 2nd Fourier coefficient of its input function.
Dual basis
Let be a finite dimensional vector space, and be a basis of . Therefore, to determine the action of any linear functional , it is enough to know its action on the basis vectors , i.e., it is enough to know what are.
Dual basis - If is finite dimensional and is a basis of , then , the set of functionals defined by , is the corresponding basis of also known as a dual basis of .
To verify that is indeed a basis of , we just need to check the following
- is a linearly independent set of linear functionals, i.e., if for some set , then , where is the functional. To verify this, we just need to check this condition for all the basis elements of , , which gives us , and implies that establishing the linear independence of the set .
- spans , i.e., for any , we have some set of elements such that . To check this, we evaluate on basis vectors for , which gives us , or, . Therefore, if is in the span of , then it must be the case that the coefficients satisfy . Now, if , then to show that , it is enough to show that they agree on the basis vectors of , that is . This is simply true by the construction of , therefore spans .
This establishes that is indeed a basis of , and any can be decomposed into the basis of as
where is the basis of . The existence of dual basis and the relation with also shows that and are isomorphic.
Transpose
The existence of the dual basis helps us define the concept of transpose in linear algebra which is extensively used in application.
Transpose - Let be a linear transformation from the vector space to the vector space , then is a linear transformation from to that takes in a linear functional , and outputs another linear functional defined as .
Theorem - Let be a linear transformation from vector space to vector space . Let and be the basis of and respectively, and and be the basis of and respectively. Let be the matrix which transforms a vector in to a vector in . Then .
The matrix of takes in an element of represented in its basis , and outputs an element in represented in its basis . Therefore, it is sufficient to represent every element in in the basis of . Since any vector in can be expressed as a linear combination of the basis vectors as we proved earlier, we have
Therefore, the -th element of the matrix is . Now, the elements of the matrix are the representations of the basis vectors of , in the basis vectors of . Therefore we have,
Which finally gives us
and shows us that the -th element of the matrix is nothing but the -th element of , which implies that the matrix .
Double Dual
If is a vector space, then its dual space is also a vector space. We can again define the set of all linear transformations from to as its dual space , which makes it the double dual space of . Unlike where we needed to define basis, there is an elegant way to go from to via an injective map . If , and acts on a linear functional and evaluates at returning an element in the field , i.e.,
Theorem - If is a vector space of finite dimension, then is an isomorphism. First, we show that is linear. If , , and , then
Next, we show that is one to one. Suppose , the zero functional, then . Let , then for some . Therefore, if , then
For , we get . This implies that . Since , we have that is one to one and therefore an isomorphism. The isomorphism between and , , allows us to map each element in to a unique element in .
The infinite sequence of dual spaces
We can continue thinking about the dual of the parent space and there always will exist an isomorphism between alternate dual spaces. Formally, Let us denote for all where is a finite dimensional vector space. Let be the isomorphism between and . Then, in general define for when is odd, and for when is an even natural number, with , and . Then by the property of these isomorphisms we have
when is odd, and
when is an even natural number. However, note that and are the same quantities in , the difference lies in the order of application of these linear functionals, which makes them the dual representation of each other.
Application to Fenchel conjugate
With this formalization, one can reason about the mathematical object, Fenchel conjugate in an elegant way. Let us first define what a Fenchel conjugate of a function is.
Fenchel conjugate - Let be the dual space of , and denote the dual pairing between the two vector spaces. For a function , its convex conjugate is defined as
For a differentiable function , we have from the Taylor’s expansion that is a linear functional for all , and therefore lies in the dual space . If is the convex conjugate of , we have that is an element in for all . Since there exists a natural isomorphism between and which is the evaluation map, this in particular gives us .
Leave a Comment