The Double Dual and Natural Isomorphism
Suppose someone hands you a finite-dimensional vector space . They claim is isomorphic to its dual space . They also claim is isomorphic to its dual space . Both claims are true, but they are not the same kind of true. The first isomorphism requires you to choose a basis of (or an inner product). Change the basis and the map changes with it. The second isomorphism, , requires no choice at all. It is built from the bare structure of as a vector space. It uses nothing but the definition of "linear functional." This distinction between a choice-dependent isomorphism and a canonical one is one of the most important conceptual refinements in linear algebra. The double dual is the cleanest place to see it. The idea matters because it separates two different senses in which two spaces can be "the same." Every finite-dimensional space of dimension is isomorphic to . It is also isomorphic to its dual, and to its double dual. Dimension-counting alone guarantees this. But an isomorphism that depends on an arbitrary choice of basis carries no intrinsic meaning. Relabel the basis vectors and the isomorphism relabels with them. A natural isomorphism, by contrast, is defined by a single formula. That formula works simultaneously for every vector space in sight. It also commutes with every linear map between such spaces. The double dual embedding is the paradigm example of this phenomenon. It is the historical origin of the term "natural transformation" in category theory. The big picture is this: to each vector we can associate a linear functional on . That functional is simply "evaluate at ." This gives a linear map . It is defined with no reference to any basis whatsoever. When is finite-dimensional, turns out to be an isomorphism. So and are not merely abstractly isomorphic. They are identified by a specific, canonical, basis-free map. This lets working mathematicians treat and as literally the same space. This convention is used constantly in functional analysis, differential geometry, and representation theory. This article gives the precise definition of the canonical embedding. It proves in full detail that it is linear, injective, and (in finite dimensions) surjective. It contrasts this sharply with the non-canonical isomorphism . It also shows exactly what fails when is infinite-dimensional. Along the way we build the intuition needed to recognize naturality. This intuition helps whenever it appears elsewhere in linear algebra.
- The map , , is defined with no choice of basis.
- is always linear and injective, for every vector space over any field.
- If , then too, so injectivity plus dimension-counting forces to be an isomorphism.
- The isomorphism (via a chosen basis and its dual basis) is not natural: it depends on the basis and does not commute with all linear maps.
- In infinite dimensions is injective but never surjective, so and are genuinely different spaces.
- Key idea: naturality means "defined by one formula, for all spaces at once, with no arbitrary choices" — and the double dual embedding is the model case of this idea.
Where this lives today
The canonical double-dual embedding is far more than a curiosity of pure linear algebra; it is a structural template reused throughout mathematics. In functional analysis, a normed space is called reflexive when the analogous evaluation map (built using continuous, rather than all, linear functionals) is a bijection; Hilbert spaces and spaces for are reflexive, while and are not, and the failure of reflexivity governs deep results about weak compactness and the existence of minimizers in optimization problems. In differential geometry, the double dual identification underlies the standard convention that a tangent vector at a point can be regarded as a linear functional on covectors — indeed as a "directional derivative" operator — with no arbitrary choice of coordinates, which is essential to defining tensors invariantly. In category theory and theoretical computer science, the double-dual map is the motivating example used to teach the definition of a natural transformation, a concept now central to the semantics of functional programming languages (via the Curry–Howard correspondence and parametric polymorphism, where "naturality" corresponds to functions that behave uniformly across all types). In representation theory, natural maps like are used to identify a representation with its double dual representation coherently across an entire category of modules, which matters when constructing invariant pairings and traces. Even in numerical linear algebra, the conceptual habit of tracking which isomorphisms are basis-dependent (like coordinate maps to ) versus basis-independent (like ) helps explain why certain algorithms are coordinate-free while others are not, guiding when a change of basis silently changes an answer.
Ask the tutor: Can you show me why no natural (basis-free) isomorphism can exist, using the naturality square the way it was used for ?
Let be a vector space over a field . Its dual space is
and its double dual is , the space of linear functionals on . For each , define by
The canonical map (or canonical embedding, or evaluation map) is
No basis of , no basis of , and no additional structure (inner product, ordering, etc.) is used anywhere in this definition — it depends only on the vector space axioms and the definition of a linear functional.
Intuition
Think of a vector not as a static arrow but as a machine for testing linear functionals: feed it any , and it outputs the number . This "testing" operation is itself linear in — scale and the output scales, add two functionals and the outputs add — so the assignment is a genuine element of . The map just packages " as a tester" into a single object. The reason this differs fundamentally from the isomorphism is that constructing 's elements from 's elements ordinarily requires a basis: given a basis of , one builds the dual basis and declares . Change the basis of to , and the corresponding "isomorphism" sends to a completely different functional. There is no way to single out one particular isomorphism using only the vector space structure of — any such choice secretly encodes a basis (or, in the presence of extra structure, an inner product). By contrast, requires zero choices. It is the same formula whether you use the standard basis, a rotated basis, or no basis at all. This is what "natural" means: a single rule, uniform across all vector spaces and all linear maps between them, that produces the isomorphism automatically.
Let be a vector space over a field , and let be the canonical map defined by . 1. is a well-defined linear map. 2. is injective, for every vector space (no finite-dimensionality needed). 3. If , then is an isomorphism, i.e. it is also surjective. 4. (Naturality) For every linear map between vector spaces, letting denote the double transpose of , we have
where are the canonical maps of and respectively.
We prove each part in turn. Throughout, recall from The Dual Space and Dual Bases that is the vector space of linear functionals , with addition and scalar multiplication defined pointwise: and .
(1) is well-defined and linear. First we check that for each fixed , the map is itself linear, so that as claimed. For and :
Both equalities are immediate from the definition of pointwise addition and scaling on . Hence is linear, so , and is well-defined as a function . Next we check itself is linear. For , , and any :
using linearity of for the second equality and the definition of addition in for the last. Since this holds for every , the functionals and agree on all of , hence are equal as elements of : . Similarly,
for all , so . Thus is linear.
(2) is injective for every . We use the standard technique: show the kernel is trivial. Suppose satisfies , i.e. for every . We must show . Suppose toward a contradiction that . Then is a linearly independent subset of (a single nonzero vector is always linearly independent, since with forces ). By the basis extension theorem (a consequence of the fact that every linearly independent set extends to a basis, valid for arbitrary — possibly infinite-dimensional — vector spaces via Zorn's Lemma when needed), we may extend to a basis of containing . Define on the basis by setting and for every other basis vector , then extend linearly to all of . This is a valid definition of a linear functional because a linear map out of is uniquely and freely determined by its values on a basis. By construction and , contradicting , which required for all . This contradiction shows . Hence , so is injective (using the standard fact that a linear map is injective if and only if its kernel is trivial).
(3) If , then is surjective, hence an isomorphism. From The Dual Space and Dual Bases we use the fact that for a finite-dimensional space with , the dual space satisfies as well (constructed via the dual basis of any basis of ). Applying this fact twice: , and then applying it again to the space in place of gives . So . By part (2), is injective. We invoke the standard linear algebra fact (from Isomorphisms and Isomorphic Vector Spaces) that an injective linear map between finite-dimensional spaces of equal dimension is automatically surjective, hence an isomorphism. (Proof of that fact: the rank–nullity theorem gives ; injectivity gives , so , meaning the image of is a subspace of with full dimension, hence equals .) Therefore is bijective and linear, i.e. an isomorphism.
(4) Naturality square commutes. Let be linear. Recall the transpose (or dual map) is defined by for ; this is linear because composition with the fixed linear map is linear in . Applying the same construction to itself gives the double transpose
We must show for every , i.e. that these two elements of agree as functionals on . Fix and ; we evaluate both sides at . Left side:
directly from the definition of applied to the vector . Right side:
where the first equality unwinds the definition of applied to , the second is function composition, the third is the definition of , and the fourth is the definition of applied to . Both sides equal for every , so the two functionals and agree on all of and are therefore equal as elements of . Since was arbitrary, as maps .
∎Worked examples
Example 1: Explicit computation of in , with an asymmetric basis of . Let with standard basis . Consider the (deliberately non-standard, asymmetric) basis of given by
One checks these are linearly independent (their coefficient matrix has determinant ), so is a basis of . Let denote the dual basis of associated to , i.e. . Take the vector . We compute two ways. Direct evaluation. By definition for any . In particular:
Expressing in the dual basis of . Since and is a basis of , we can write for unique scalars . Evaluating both sides at and using gives . So
This confirms concretely that is a genuine, computable element of — not an abstract placeholder — and that its coordinates in the dual-of-dual basis are just the values , exactly as the definition promises. Note also that the coordinate vector of in the basis is different from the coordinate vector of in the basis — the numbers change because the bases differ, but this has no bearing on the fact that itself was defined without reference to any basis at all. The formula never mentioned or ; we only introduced them to display coordinates.
Example 2: Why is not natural — a basis-change computation that breaks any fixed formula. Let . Fix the standard basis with dual basis , and define the isomorphism by , (extended linearly), i.e. . Now change basis: let with , (an asymmetric, non-orthogonal choice). This is indeed a basis since the change-of-basis matrix is invertible. Compute the dual basis directly from , . Writing : we need and , giving . Writing : we need and , giving , so . Define the "basis isomorphism" using instead: , . Let's evaluate both and on the same vector :
These are different functionals: but ; check instead at : while . Since , . So . Thus for the same vector : the "isomorphism to the dual" genuinely depends on which basis is used to construct it, confirming there is no way to write a single basis-free formula for an isomorphism analogous to . Contrast this with , where the formula gave the same answer regardless of which auxiliary basis we used to display coordinates in Example 1 — that is precisely the content of naturality.
The theorem's part (3) requires . We exhibit an infinite-dimensional for which is injective (as always, by part (2)) but not surjective, so via — and in fact at all, since one can show in a suitable cardinal sense. Let , the space of all sequences of scalars with only finitely many nonzero terms (i.e. the space of finitely-supported sequences), with pointwise addition and scaling. This is an infinite-dimensional vector space with basis , where has a in position and zeros elsewhere; every element of is a finite linear combination of the .
Claim: is naturally identified with the space of all sequences (no finiteness restriction). Given any , define the sequence ; conversely given any sequence (with no restriction — infinitely many may be nonzero), define where are the (finitely many nonzero) coordinates of the input vector; this sum is always finite because the input has finite support, so is well-defined and linear on all of . This correspondence is a bijection between and , and one checks it is linear, giving . Now consider the element defined as follows. Using the identification above, every corresponds to a sequence ; define
Actually, to keep defined on all of (not just finitely-supported functionals) and manifestly linear, we instead argue abstractly, which is cleaner and fully rigorous:
Abstract argument that is not surjective. Suppose, for contradiction, that were surjective. Since is always injective (part 2 of the theorem, which used no finite-dimensionality), surjectivity would make a bijection, hence as vector spaces, forcing them to have bases of the same cardinality. But has a countably infinite basis , so has countable dimension. Meanwhile (all sequences, shown above), and a standard cardinality argument (a Cantor diagonal-type argument, the same one showing the set of all subsets of is uncountable) shows has uncountable dimension as an -vector space whenever is a nontrivial field. (Sketch: if had a countable spanning set, one could encode all subsets of via their indicator sequences as elements of the span of countably many vectors over a fixed field, which — via a linear-algebraic dimension count over the countable field extension generated by the coefficients — leads to a cardinality contradiction; the essential fact, proved rigorously in general vector space theory, is that an infinite-dimensional vector space satisfies , a theorem due to Erdős–Kaplansky.) Applying the same fact once more to in place of : since is infinite-dimensional (uncountable dimension), . In particular (as cardinals), so , contradicting what surjectivity of would have given us. Hence cannot be surjective. This shows precisely what breaks without finite-dimensionality: remains an injective, natural linear map — the proof of part (2) used no dimension hypothesis — but it can never be surjective when is infinite-dimensional, because is always "too big." The map embeds into as a proper subspace; this is exactly the starting point for the theory of reflexive spaces in functional analysis, where one asks (with topological constraints added) whether a suitably restricted double-dual map is a bijection.
Scope, edge cases & common traps
| Situation | What happens | Why |
|---|---|---|
| is a natural isomorphism | injective (any ) + equal finite dimensions bijective | |
| is injective but never surjective | (Erdős–Kaplansky) | |
| , finite-dim | True, but only after choosing a basis | different bases give genuinely different isomorphisms (Example 2) |
| any field | Theorem holds verbatim | proof uses only vector space axioms, no analysis/field-specific facts |
| Confusing with "the" iso | Common error | maps , a different space, and needs no choice; is a different, choice-dependent map |
The mathematician behind it
Origins · 1 minHassler Whitney and Samuel Eilenberg (context) with Saunders Mac Lane and how this was discovered
The precise notion of a "natural transformation," of which the canonical embedding is the founding example, was crystallized by Samuel Eilenberg and Saunders Mac Lane in their 1945 paper General Theory of Natural Equivalences. They observed that mathematicians had long been distinguishing, informally, between isomorphisms that "just happen to exist by dimension count" and isomorphisms given by a uniform, choice-free formula — and that the double-dual embedding was the cleanest instance forcing this distinction into the open. Their paper is often credited as the origin of category theory itself, and the double dual map remains the textbook first example used to explain what a natural transformation is.
Why isn't the isomorphism also called "natural"?
Because no formula for it avoids choosing extra data. Any linear isomorphism can be described by sending a basis of to the corresponding dual basis , but changing the basis changes , as Example 2 shows explicitly with two different bases producing different images for the same vector. There is a theorem (not proved here) that no formula built solely from the vector space axioms of can produce a canonical isomorphism that works uniformly for all spaces and commutes with all linear maps — essentially because and transform "oppositely" under linear maps (covariant vs. contravariant), so no natural transformation between the identity functor and the dual functor exists in general.
Does depend on the field , e.g. does it work over or finite fields?
Yes, works over any field , with no changes to the definition or proof. The proof of linearity uses only the vector space axioms and the pointwise operations on ; the proof of injectivity uses basis extension, valid over any field; and the proof of surjectivity in finite dimensions uses only and rank–nullity, both field-independent facts. The theorem is stated and proved for a general field throughout this article, and no step invokes properties special to or (such as completeness or complex conjugation).
Is related to the identification of with its double dual in the theory of tensors?
Yes — in fact, the identification via is exactly what licenses the common convention that a vector can be regarded as a -tensor acting on covectors. When defining tensor products and multilinear maps, one frequently needs to treat elements of as functionals on rather than the reverse; the canonical embedding is precisely the justification for doing so without any loss of information (since is injective) and without ambiguity (since is basis-independent). In finite dimensions this identification is complete, since is also surjective.
If is an isomorphism in finite dimensions, does that mean and are literally equal, not just isomorphic?
Strictly speaking they remain formally distinct sets — consists of functionals on , while consists of whatever objects 's elements are — but because is a specific, canonical, natural isomorphism (rather than one of the many arbitrary isomorphisms guaranteed by equal dimension), mathematicians routinely treat and as "the same" and drop the distinction, writing where formally one means . This convention is safe precisely because is natural: it does not matter which auxiliary constructions (bases, other maps) are used elsewhere in an argument, since commutes with all of them by the naturality identity in part (4) of the theorem.
Why does the proof of injectivity need to extend to a basis — couldn't we just use rank-nullity on ?
Rank–nullity requires finite dimensionality (or at least a well-defined notion of dimension arithmetic) to conclude anything about the kernel from a dimension count, but part (2) of the theorem is proved for arbitrary, possibly infinite-dimensional . The basis-extension argument, by contrast, works in every vector space (using Zorn's Lemma to guarantee bases exist and can be extended in the infinite-dimensional case), and directly exhibits a functional distinguishing from . This makes injectivity of a completely general fact, independent of dimension, which is essential for correctly stating the counterexample about infinite-dimensional spaces.
Does naturality mean commutes with every possible function , or only linear ones?
Only linear maps. The naturality square in part (4) of the theorem is proved specifically for linear , because the double transpose is only defined when (hence ) is linear. For a general (non-linear) function , there is no analogue of or as linear maps between dual spaces, so the naturality statement simply does not apply; naturality is a statement about how interacts with the entire category of vector spaces and linear maps, not with arbitrary set functions.