The dual space consists of all linear functionals on —linear maps from to the base field. It's a "mirror" of that reveals deep structural insights.
The concept of duality pervades mathematics. In geometry, points and lines are dual; in logic, AND and OR are dual. Linear algebra's dual space captures this idea perfectly.
The distinction between "natural" and "unnatural" isomorphisms was formalized by Samuel Eilenberg and Saunders Mac Lane when they invented category theory in the 1940s. The natural isomorphism was one of the motivating examples!
A linear functional is the simplest type of linear map: it takes vectors to scalars.
A linear functional on a vector space over field is a linear map .
Equivalently, satisfies:
A nonzero linear functional defines a family of parallel hyperplanes:
The kernel is the hyperplane through the origin. Since is nonzero and surjective onto , we have (codimension 1).
The dual space of is the vector space of all linear functionals on :
If is a finite-dimensional vector space over , then:
We have . The dimension formula for gives:
For finite-dimensional : (as vector spaces).
While , there is no canonical isomorphism! To construct an isomorphism, you must choose a basis. Different bases give different isomorphisms.
Given a basis of , we can construct a corresponding basis of called the dual basis.
Let be a basis of . The dual basis of is defined by:
The dual basis is indeed a basis for .
Existence: For each , define by specifying its values on the basis:. By the extension theorem, this uniquely defines a linear functional.
Linear independence: Suppose . Apply both sides to :
So all , proving linear independence.
Spanning: Let . For any :
So , proving spanning.
The dual basis extracts coordinates! If , then:
So picks out the -th coordinate of with respect to the basis .
Problem: Find the dual basis to in .
Solution: Let and .
We need with:
Writing :
and , so .
Answer: ,
The double dual has a special relationship with .
The double dual of is:
For each , define by:
This is a linear functional on , so .
The map defined by is:
This isomorphism is natural—it doesn't depend on any choices.
Linearity: For and :
Similarly for scalar multiplication.
Injectivity: Suppose , i.e., . This means for all .
If , extend to a basis and define with . This contradicts . So .
Surjectivity (finite dim): . Since is injective and dimensions match, is surjective.
The isomorphism is defined by the same formula for all vector spaces. No basis choice is needed. In contrast, requires choosing a basis.
This is formalized in category theory: is a natural transformation.
Annihilators provide a correspondence between subspaces of and subspaces of .
Let be a subspace. The annihilator of is:
is a subspace of .
For finite-dimensional with subspace :
Extend a basis of to a basis of .
Let be the dual basis.
Then iff for all .
Writing :
So , which has dimension .
Problem: Let . Find .
Solution:
iff .
So , giving .
Answer:
✓
Under the natural identification :
Every linear map induces a map between the dual spaces in the opposite direction.
Let be linear. The dual map (or transpose) is:
That is, for all .
For linear maps and scalar :
For :
If is represented by matrix (with respect to bases and ), then is represented by (with respect to dual bases and ).
This is why is sometimes called the transpose of .
Problem: Let be differentiation. Describe .
Solution:
For and :
If (integration), then:
Problem: Let be an matrix. How is related to ?
Solution:
Identify via the dot product.
Then iff for all rows .
This means , so .
Result:
Problem: Find the dual basis to in .
Solution:
Need with .
Write (Taylor coefficients).
Solving the system:
does NOT mean they're equal! contains vectors, contains linear functionals. They're different types of objects.
If , then goes the opposite direction! This reversal is essential and easy to forget.
is natural (canonical), but is NOT. Don't assume there's a "preferred" isomorphism between and .
In infinite dimensions, can be much larger than ! The natural map is still injective but may not be surjective.
,
naturally via
Problem 1
Let and . Find and describe its dual basis.
Problem 2
Prove that if , then .
Problem 3
Show that and .
Problem 4
If is surjective, prove is injective.
Problem 5
Let be a basis of . Find the basis of dual to this.
Problem 6
Show that the trace map is the unique (up to scalar) linear functional that vanishes on all commutators .
Problem: On , define , , . Are these linearly independent?
Solution:
Notice (by additivity of integrals over intervals).
So .
Answer: No, they are linearly dependent.
Problem: Let be a projection (). What is ?
Solution:
So is also a projection!
and .
Problem: Two functionals have the same kernel. What can we conclude?
Solution:
If and both are nonzero, then both kernels are hyperplanes of the same dimension.
Since , the quotient is 1-dimensional.
Both and factor through this quotient, so:
Answer: for some nonzero .
Problem: For nonzero , find .
Solution:
Any vanishes on , so .
This forces for some .
Answer:
An inner product on gives a canonical isomorphism:
This is called the Riesz representation theorem in infinite dimensions.
In Dirac notation:
The cotangent space at a point of a manifold is the dual of the tangent space.
Linear programming has a dual problem involving:
This extends to convex optimization (Lagrange duality).
For any subspace :
Define by .
This is well-defined: if , then , so .
Injectivity: If , then for all , so .
Surjectivity: Any lifts to where .
The maps and (in the other direction) are mutually inverse bijections between:
This is an order-reversing correspondence (inclusion ↔ reverse inclusion).
Taking duals is a contravariant functor:
The dual basis functionals extract coordinates. This makes very concrete.
Think of as all linear equations that satisfies. Each is a constraint.
Use and freely.
Always remember: gives (opposite direction!).
| Concept | Definition/Result |
|---|---|
| Dual space | |
| Dimension | |
| Dual basis | |
| Double dual | naturally |
| Annihilator dim | |
| Dual map | , |
| Rank preserved |
Problem: A Banach space is called reflexive if the natural map is surjective. Give an example of a non-reflexive Banach space.
Hint: Consider or .
Problem: Prove that by computing dimensions on both sides and showing inclusion.
Problem: Prove that naturally.
Hint: Define the isomorphism by restriction.
In projective geometry, there's a perfect duality:
A linear functional can be written as:
where . So is the "gradient" of a linear function.
The level sets are the hyperplanes perpendicular to this gradient.
The pairing between and is the bilinear map:
This is non-degenerate: if for all , then .
The concept of duality has ancient roots. In projective geometry, Gergonne and Poncelet (early 1800s) discovered the duality between points and lines.
Stefan Banach (1920s-30s) developed the theory of dual spaces in the infinite-dimensional setting, leading to the powerful Hahn-Banach theorem.
The categorical perspective—distinguishing natural from unnatural isomorphisms—was formalized by Eilenberg and Mac Lane in their 1945 paper "General Theory of Natural Equivalences," which founded category theory. The isomorphism was one of their key examples!
With dual spaces mastered, you're ready for:
Dual spaces may seem abstract, but they're essential in advanced mathematics—from differential geometry to quantum mechanics to optimization.
A linear map from V to the base field F. It assigns a scalar to each vector, linearly. Examples: evaluation at a point, integration, trace of a matrix.
The isomorphism V → V** via v ↦ ev_v doesn't depend on any choices—it's defined the same way for all vector spaces. But V → V* requires choosing a basis (or an inner product). 'Natural' means 'functorial' in category theory.
It gives coordinates! If {e₁,...,eₙ} is a basis and {e₁*,...,eₙ*} is dual, then v = Σeᵢ*(v)eᵢ. The functionals eᵢ* extract the i-th coordinate.
W⁰ consists of all linear constraints satisfied by W. If W is the solution space of Ax = 0, then W⁰ is spanned by the rows of A (in a sense).
V* can be much larger than V! The algebraic dual may not be useful; instead, we use continuous duals in functional analysis, where V* consists only of continuous linear functionals.
A nonzero linear functional φ defines a family of parallel hyperplanes: the level sets {v : φ(v) = c} for various constants c. The kernel φ⁻¹(0) is the hyperplane through the origin.
When we represent T by a matrix A with respect to chosen bases, the dual map T* is represented by the transpose Aᵀ with respect to the dual bases. This is why T* is sometimes called the 'transpose' of T.
For finite-dimensional V, the double annihilator (W⁰)⁰ in V** corresponds to W under the natural isomorphism V ≅ V**. So (W⁰)⁰ 'is' W in a precise sense.
Dual spaces are essential in: (1) defining coordinates, (2) linear programming and optimization (duality theory), (3) differential geometry (cotangent spaces), (4) quantum mechanics (bra-ket notation), (5) functional analysis.
Yes! For finite-dimensional V, every subspace U ⊆ V* equals W⁰ for some W ⊆ V. Specifically, U = (U⁰)⁰ where U⁰ is taken in V.