5.3 The Double Dual

In a finite-dimensional space, the dual basis gives an isomorphism $V \cong V^{*}$ , sending $\mathbf{v}_i$ to $\varphi_i$ . But that isomorphism depends on the basis: change the basis and the same vector goes to a different functional. Nothing stops us from taking duals twice. The dual $V^{*}$ is a vector space, so it has a dual of its own, $V^{**}$ , and two chosen bases give $V \cong V^{*} \cong V^{**}$ . This section shows that the composite isomorphism $V \to V^{**}$ needs no choice at all: it is built from evaluation alone. We use it to make one meaning of the word “natural” precise, and to prove that a subspace can be recovered from its annihilator. At the end we see that in infinite dimension the construction still makes sense, but it is no longer an isomorphism.

5.3.1. Measuring the measurements

We have studied a space $V$ and its space of measurements $V^{*} = \mathcal{L}(V, F)$ (Definition 5.1.2). The next object is the space of measurements of $V^{*}$ .

Look at the expression $\varphi(\mathbf{v})$ , with $\varphi \in V^{*}$ and $\mathbf{v} \in V$ . It has two inputs. If we fix $\varphi$ and let $\mathbf{v}$ vary, we get the functional $\varphi$ itself. If we fix $\mathbf{v}$ and let $\varphi$ vary, we get a rule that takes a functional and returns a number. For example, take $\mathbf{v} = (3, -1) \in \mathbb{R}^2$ . A functional on $\mathbb{R}^2$ is $\varphi(x, y) = ax + by$ for unique $a, b$ (Theorem 5.1.1), and the rule returns $\varphi(3, -1) = 3a - b$ . So the fixed vector $(3, -1)$ measures each measurement. This rule appears every time we test a vector against functionals, so it deserves a name.

A vector measures a functional by letting the functional act on it.

Definition 5.3.1 (Double Dual and Evaluation Map)

Let $V$ be a vector space over $F$ . The double dual of $V$ is $V^{**} \mathrel{:=} (V^{*})^{*}$ , the space of linear functionals on $V^{*}$ .

For $\mathbf{v} \in V$ , evaluation at $\mathbf{v}$ is the function $\operatorname{ev}_{\mathbf{v}} \colon V^{*} \to F, \qquad \operatorname{ev}_{\mathbf{v}}(\varphi) \mathrel{:=} \varphi(\mathbf{v}).$ The evaluation map of $V$ is $\operatorname{ev}_V \colon V \to V^{**}, \qquad \mathbf{v} \mapsto \operatorname{ev}_{\mathbf{v}}.$ When only one space is in play we write $\operatorname{ev}$ for $\operatorname{ev}_V$ .

In words, clause by clause:

$V^{**}$ consists of linear maps $V^{*} \to F$ . Its elements take a whole functional as input.
$\operatorname{ev}_{\mathbf{v}}$ is defined on $V^{*}$ , not on $V$ . The vector $\mathbf{v}$ is fixed once and for all; the variable is $\varphi$ .
The evaluation map sends each vector $\mathbf{v}$ to the function $\operatorname{ev}_{\mathbf{v}}$ . A bold subscript $\operatorname{ev}_{\mathbf{v}}$ is a single element of $V^{**}$ ; an italic capital $\operatorname{ev}_V$ is the whole map.

Well-definedness. The definition claims that $\operatorname{ev}_{\mathbf{v}} \in V^{**}$ , so we must check that $\operatorname{ev}_{\mathbf{v}}$ is linear. The operations on $V^{*} = \mathcal{L}(V, F)$ are pointwise (Definition 2.4.1). So for $\varphi, \psi \in V^{*}$ and $a, b \in F$ , $\operatorname{ev}_{\mathbf{v}}(a\varphi + b\psi) = (a\varphi + b\psi)(\mathbf{v}) = a\varphi(\mathbf{v}) + b\psi(\mathbf{v}) = a\operatorname{ev}_{\mathbf{v}}(\varphi) + b\operatorname{ev}_{\mathbf{v}}(\psi).$ Notice what the definition did not use: no basis, no coordinates, no choice of any kind. Only $\mathbf{v}$ and the meaning of “functional” appear.

Example (Evaluation in Three Spaces)

(a) Let $V = F^n$ . Describe $\operatorname{ev}_{\mathbf{x}}$ for $\mathbf{x} \in F^n$ in terms of row vectors.
(b) Let $V = \mathbb{R}[x]_{\le 2}$ , and let $(\varphi_0, \varphi_1, \varphi_2)$ be the dual basis of $(1, x, x^2)$ , so that $\varphi_k(p)$ is the coefficient of $x^k$ in $p$ (Example (Dual Bases in $\mathbb{R}[x]_{\le 2}$ )). Compute $\operatorname{ev}_{x^2}$ on $\varphi_0, \varphi_1, \varphi_2$ and on the functional $\varepsilon_3(p) = p(3)$ . Which element of $V^{**}$ is $\operatorname{ev}_{x^2}$ ?
(c) Describe $\operatorname{ev}_{\mathbf{0}}$ , and the evaluation map of $V = \{\mathbf{0}\}$ .

Solution.

(a) By Theorem 5.1.1, every $\varphi \in (F^n)^{*}$ has the form $\varphi(\mathbf{y}) = \mathbf{a}^{\top}\mathbf{y}$ for a unique $\mathbf{a} \in F^n$ . So $\operatorname{ev}_{\mathbf{x}}(\varphi) = \mathbf{a}^{\top}\mathbf{x}$ : the vector $\mathbf{x}$ measures the row $\mathbf{a}^{\top}$ by standing to its right in the product. The same product $\mathbf{a}^{\top}\mathbf{x}$ is read as “ $\mathbf{a}^{\top}$ measures $\mathbf{x}$ ” or “ $\mathbf{x}$ measures $\mathbf{a}^{\top}$ ”, depending on which factor we hold fixed.
(b) $\operatorname{ev}_{x^2}(\varphi_k) = \varphi_k(x^2)$ , the coefficient of $x^k$ in $x^2$ . So the values on $\varphi_0, \varphi_1, \varphi_2$ are $0, 0, 1$ . Also $\operatorname{ev}_{x^2}(\varepsilon_3) = \varepsilon_3(x^2) = 9$ . A linear functional on $V^{*}$ is determined by its values on the basis $(\varphi_0, \varphi_1, \varphi_2)$ of $V^{*}$ (Theorem 2.1.5). The values $0, 0, 1$ say that $\operatorname{ev}_{x^2}$ is the third vector of the dual basis of $(\varphi_0, \varphi_1, \varphi_2)$ (Theorem 5.1.3). In the same way, $\operatorname{ev}_1$ and $\operatorname{ev}_x$ are the first and second vectors of that dual basis. We will see that this is no accident.
(c) $\operatorname{ev}_{\mathbf{0}}(\varphi) = \varphi(\mathbf{0}) = 0$ for every $\varphi$ , because a linear map sends $\mathbf{0}$ to $0$ (Theorem 2.1.1). So $\operatorname{ev}_{\mathbf{0}}$ is the zero functional on $V^{*}$ . If $V = \{\mathbf{0}\}$ , the only functional on $V$ is the zero functional, so $V^{*} = \{0\}$ and $V^{**} = \{0\}$ , and $\operatorname{ev}_V$ is the only map $\{\mathbf{0}\} \to \{0\}$ . This degenerate case is a first sign that $\operatorname{ev}$ loses nothing: the only vector it sends to zero is $\mathbf{0}$ .

Here is a non-example by minimal change. On $V = \mathbb{R}^2$ , replace $\operatorname{ev}_{\mathbf{v}}$ by $q_{\mathbf{v}}(\varphi) \mathrel{:=} \varphi(\mathbf{v})^2$ . It is still a function $V^{*} \to \mathbb{R}$ , and it is still built without any choice. But take $\mathbf{v} = (1, 0)$ and $\varphi(x, y) = x$ . Then $q_{\mathbf{v}}(2\varphi) = 2^2 = 4$ , while $2q_{\mathbf{v}}(\varphi) = 2$ . The clause that fails is linearity on $V^{*}$ , so $q_{\mathbf{v}} \notin V^{**}$ .

Why this definition. Given only a vector $\mathbf{v}$ and a functional $\varphi$ , the one number we can form without choosing anything is $\varphi(\mathbf{v})$ ; anything else, such as $\varphi(\mathbf{v})^2$ , is built from it and usually breaks linearity. The pointwise operations of Definition 2.4.1 are exactly what make $\varphi \mapsto \varphi(\mathbf{v})$ linear. The name “double dual” is literal: it is the dual of the dual.

Warning. Two different “evaluations”. On $V = \mathbb{R}[x]_{\le 2}$ , the functional $\varepsilon_3 \colon p \mapsto p(3)$ lies in $V^{*}$ : it evaluates polynomials at a number. The element $\operatorname{ev}_p \colon \varphi \mapsto \varphi(p)$ lies in $V^{**}$ : it evaluates functionals at a polynomial. They meet in one number, $\operatorname{ev}_p(\varepsilon_3) = p(3) = \varepsilon_3(p)$ , read from opposite sides. Also, $\operatorname{ev}_{\mathbf{v}}$ is not the vector $\mathbf{v}$ : it is a function on $V^{*}$ .

Quick check. Let $\mathbf{v} = (1, 2) \in \mathbb{R}^2$ . Compute $\operatorname{ev}_{\mathbf{v}}(\varphi)$ for $\varphi(x, y) = 3x - y$ . Is there a non-zero $\psi \in (\mathbb{R}^2)^{*}$ with $\operatorname{ev}_{\mathbf{v}}(\psi) = 0$ ?

Solution. $\operatorname{ev}_{\mathbf{v}}(\varphi) = \varphi(1, 2) = 3 - 2 = 1$ . Yes: $\psi(x, y) = 2x - y$ is non-zero and $\psi(1, 2) = 0$ . A single $\operatorname{ev}_{\mathbf{v}}$ kills many functionals; what the next theorem says is that for $\mathbf{v} \neq \mathbf{0}$ it does not kill all of them.

5.3.2. The evaluation map never loses information

The first result says that $\operatorname{ev}$ is a linear map, and that it is injective in every vector space, of any dimension.

Theorem 5.3.1 (The Evaluation Map Is Linear and Injective)

Let $V$ be any vector space over $F$ . Then the evaluation map $\operatorname{ev}_V \colon V \to V^{**}$ is linear and injective.

Idea. Linearity is an identity between two elements of $V^{**}$ , that is, between two functions on $V^{*}$ ; compare them at an arbitrary $\varphi$ . For injectivity, use the kernel test. If $\operatorname{ev}_{\mathbf{v}} = 0$ , then every functional vanishes at $\mathbf{v}$ . This is the signature move of the chapter: to show a vector is zero, test it against every functional. In finite dimension Theorem 5.1.5 does the job. In general we repeat its proof with the Basis Extension Theorem for arbitrary spaces.

Proof. Linear. Let $\mathbf{u}, \mathbf{v} \in V$ and $a, b \in F$ . For every $\varphi \in V^{*}$ , since $\varphi$ is linear and the operations on $V^{**}$ are pointwise (Definition 2.4.1), $\operatorname{ev}_{a\mathbf{u} + b\mathbf{v}}(\varphi) = \varphi(a\mathbf{u} + b\mathbf{v}) = a\varphi(\mathbf{u}) + b\varphi(\mathbf{v}) = (a\operatorname{ev}_{\mathbf{u}} + b\operatorname{ev}_{\mathbf{v}})(\varphi).$ Two functions on $V^{*}$ that agree at every $\varphi$ are equal, so $\operatorname{ev}_{a\mathbf{u} + b\mathbf{v}} = a\operatorname{ev}_{\mathbf{u}} + b\operatorname{ev}_{\mathbf{v}}$ .

Injective. By Theorem 2.2.3 it suffices to show that $\operatorname{ev}_{\mathbf{v}} = 0$ implies $\mathbf{v} = \mathbf{0}$ . We prove the contrapositive. Let $\mathbf{v} \neq \mathbf{0}$ . If $V$ is finite-dimensional, Theorem 5.1.5 (a) gives $\varphi \in V^{*}$ with $\varphi(\mathbf{v}) = 1$ . In general, $\{\mathbf{v}\}$ is linearly independent, so by Theorem 1.8.2 there is a basis $B$ of $V$ with $\mathbf{v} \in B$ . By Theorem 2.1.6, which allows infinite bases, there is a linear map $\varphi \colon V \to F$ with $\varphi(\mathbf{v}) = 1$ and $\varphi(\mathbf{b}) = 0$ for every $\mathbf{b} \in B \setminus \{\mathbf{v}\}$ . In either case $\varphi \in V^{*}$ and $\operatorname{ev}_{\mathbf{v}}(\varphi) = \varphi(\mathbf{v}) = 1 \neq 0$ , so $\operatorname{ev}_{\mathbf{v}} \neq 0$ . This proves that $\operatorname{ev}_V$ is injective.

In infinite dimension the proof repeats the remark after Theorem 5.1.5, and Zorn’s Lemma enters through Theorem 1.8.2. In finite dimension no choice principle is needed.

So every vector $\mathbf{v}$ is completely remembered by the list of all its measurements $\varphi(\mathbf{v})$ . In finite dimension a count turns “injective” into “bijective”.

Theorem 5.3.2 (The Double Dual Isomorphism)

Let $V$ be a finite-dimensional vector space over $F$ . Then the evaluation map $\operatorname{ev}_V \colon V \to V^{**}$ is an isomorphism. Moreover, if $\mathcal{B} = (\mathbf{v}_1, \dots, \mathbf{v}_n)$ is a basis of $V$ with dual basis $\mathcal{B}^{*} = (\varphi_1, \dots, \varphi_n)$ , then $(\operatorname{ev}_{\mathbf{v}_1}, \dots, \operatorname{ev}_{\mathbf{v}_n})$ is the dual basis of $\mathcal{B}^{*}$ .

Idea. Count instead of check. The dual basis has as many vectors as the basis, so $\dim V^{*} = \dim V$ , and the same holds one level up. An injective linear map between spaces of the same finite dimension is bijective. For the second statement, “dual basis” is the condition $\theta_i(\varphi_j) = \delta_{ij}$ , and for $\theta_i = \operatorname{ev}_{\mathbf{v}_i}$ that condition is the definition of $\varphi_j$ read backwards.

Proof. Let $n = \dim V$ . By Corollary 5.1.4, $V^{*}$ is finite-dimensional with $\dim V^{*} = n$ , and applying it again to $V^{*}$ gives $\dim V^{**} = n$ . By Theorem 5.3.1, $\operatorname{ev}_V$ is linear and injective. Since $\dim V = \dim V^{**}$ is finite, Corollary 2.3.2 (e) shows that $\operatorname{ev}_V$ is bijective, hence an isomorphism (Definition 2.5.2).

For the second statement, $\operatorname{ev}_{\mathbf{v}_i}(\varphi_j) = \varphi_j(\mathbf{v}_i) = \delta_{ji} = \delta_{ij}$ for all $i, j$ , by the definition of the dual basis. By the uniqueness in Theorem 5.1.3 (a), applied to the basis $\mathcal{B}^{*}$ of $V^{*}$ , the dual basis of $\mathcal{B}^{*}$ (Definition 5.1.3) is the only list $(\theta_1, \dots, \theta_n)$ in $V^{**}$ with $\theta_i(\varphi_j) = \delta_{ij}$ . Hence it is $(\operatorname{ev}_{\mathbf{v}_1}, \dots, \operatorname{ev}_{\mathbf{v}_n})$ , as claimed.

The theorem says: every linear functional on $V^{*}$ is evaluation at exactly one vector. To find the vector, read off its coordinates from the values on a dual basis. For instance, on $V = \mathbb{R}[x]_{\le 2}$ with the coefficient functionals $\varphi_0, \varphi_1, \varphi_2$ of Example (Evaluation in Three Spaces), let $\theta \in V^{**}$ be the functional with $\theta(\varphi_0) = 2$ , $\theta(\varphi_1) = 0$ , $\theta(\varphi_2) = -1$ . By the second statement, $\theta = 2\operatorname{ev}_1 - \operatorname{ev}_{x^2} = \operatorname{ev}_{2 - x^2}$ , since both sides agree on the basis $(\varphi_0, \varphi_1, \varphi_2)$ and $\operatorname{ev}$ is linear. So, for example, $\theta(\varepsilon_2) = \varepsilon_2(2 - x^2) = -2$ , where $\varepsilon_2(p) = p(2)$ . Part (b) of Example (Evaluation in Three Spaces) was the case $\theta = \operatorname{ev}_{x^2}$ .

5.3.3. What “natural” means

Both $V \cong V^{*}$ and $V \cong V^{**}$ hold in finite dimension, and both follow from counting dimensions. Yet they are very different isomorphisms. The difference is whether a choice is needed.

The isomorphism $V \to V^{*}$ depends on the basis. For a basis $\mathcal{B} = (\mathbf{v}_1, \dots, \mathbf{v}_n)$ of $V$ , let $\Theta_{\mathcal{B}} \colon V \to V^{*}$ be the linear map with $\Theta_{\mathcal{B}}(\mathbf{v}_i) = \varphi_i$ (Theorem 2.1.5). It sends a basis to a basis, so it is an isomorphism, by the argument in the proof of Theorem 2.5.4. Now take $V = \mathbb{R}$ , a space of dimension $1$ . With the basis $(1)$ , the dual basis is $\varphi(t) = t$ , and $\Theta_{(1)}(1)$ is $t \mapsto t$ . With the basis $(2)$ , the dual basis is $\varphi(t) = t/2$ , since that is the functional sending $2$ to $1$ . So $\Theta_{(2)}(2) = (t \mapsto t/2)$ , and by linearity $\Theta_{(2)}(1) = \tfrac12\Theta_{(2)}(2)$ is $t \mapsto t/4$ . The same vector $1$ goes to two different functionals. Every basis is as good as any other, so none of these isomorphisms is preferred.

The isomorphism $V \to V^{**}$ does not. Build it the same way, choosing bases twice. First $\Theta_{\mathcal{B}} \colon V \to V^{*}$ sends $\mathbf{v}_i \mapsto \varphi_i$ . Then, using the basis $\mathcal{B}^{*}$ of $V^{*}$ , the map $\Theta_{\mathcal{B}^{*}} \colon V^{*} \to V^{**}$ sends each $\varphi_i$ to the $i$ -th vector of the dual basis of $\mathcal{B}^{*}$ . By Theorem 5.3.2, that vector is $\operatorname{ev}_{\mathbf{v}_i}$ . So the composite $\Theta_{\mathcal{B}^{*}}\Theta_{\mathcal{B}}$ sends $\mathbf{v}_i \mapsto \operatorname{ev}_{\mathbf{v}_i}$ for every $i$ . The linear map $\operatorname{ev}_V$ does the same, so by the uniqueness part of Theorem 2.1.5, $\Theta_{\mathcal{B}^{*}}\,\Theta_{\mathcal{B}} = \operatorname{ev}_V \qquad \text{for every basis } \mathcal{B} \text{ of } V.$ Each factor depends on $\mathcal{B}$ , but the composite does not: the two choices cancel. This is the first meaning of natural: an isomorphism is natural if it can be defined without choosing anything, and $\operatorname{ev}_V$ is defined by the formula $\operatorname{ev}_{\mathbf{v}}(\varphi) = \varphi(\mathbf{v})$ alone.

There is a second, sharper meaning. A choice-free construction should be compatible with every linear map: if $T \colon V \to W$ , then first applying $T$ and then identifying $W$ with $W^{**}$ should agree with first identifying $V$ with $V^{**}$ and then applying “the map that $T$ induces on double duals”. To state this we need to know how a linear map acts on functionals. That is the dual map, the subject of the next section, where we prove that $\operatorname{ev}$ is compatible with every linear map, and see that no family of isomorphisms $V \to V^{*}$ can be.

Quick check. In $V = \mathbb{R}$ with the basis $\mathcal{B} = (2)$ , compute $\Theta_{\mathcal{B}^{*}}\Theta_{\mathcal{B}}(1)$ as an element of $V^{**}$ , and evaluate it on $\psi(t) = 5t$ . Compare with $\operatorname{ev}_1(\psi)$ .

Solution. The dual basis of $\mathcal{B}$ is $\varphi_1(t) = t/2$ , so $\Theta_{\mathcal{B}}(1) = \tfrac12\Theta_{\mathcal{B}}(2) = \tfrac12\varphi_1$ . The dual basis of $\mathcal{B}^{*} = (\varphi_1)$ is the $\theta \in V^{**}$ with $\theta(\varphi_1) = 1$ , and $\operatorname{ev}_2(\varphi_1) = \varphi_1(2) = 1$ , so $\theta = \operatorname{ev}_2$ and $\Theta_{\mathcal{B}^{*}}(\varphi_1) = \operatorname{ev}_2$ . Hence $\Theta_{\mathcal{B}^{*}}\Theta_{\mathcal{B}}(1) = \tfrac12\operatorname{ev}_2 = \operatorname{ev}_1$ , using linearity of $\operatorname{ev}$ . On $\psi$ it gives $\operatorname{ev}_1(\psi) = \psi(1) = 5$ . The factor $\tfrac12$ from the first step and the factor $2$ hidden in $\operatorname{ev}_2$ cancel, exactly as the general computation predicts.

Remark. Because $\operatorname{ev}_V$ is natural, it is common to identify a finite-dimensional $V$ with $V^{**}$ , and to regard a vector $\mathbf{v}$ as the functional $\varphi \mapsto \varphi(\mathbf{v})$ on $V^{*}$ . We will do this only with an explicit “under the identification $\mathbf{v} \leftrightarrow \operatorname{ev}_{\mathbf{v}}$ ”, as in the next corollary.

5.3.4. Consequences in finite dimension

Throughout this subsection, $V$ is finite-dimensional. The isomorphism $\operatorname{ev}_V$ lets us run arguments about $V^{*}$ “one level up” and bring the answer back to $V$ .

The dual basis construction goes from a basis of $V$ to a basis of $V^{*}$ . Does every basis of $V^{*}$ arise this way? A list of $n$ independent measurements should be the coordinate functions of some basis, and the double dual shows it is.

Corollary 5.3.3 (Every Basis of the Dual Is a Dual Basis)

Let $V$ be a finite-dimensional vector space over $F$ , and let $(\psi_1, \dots, \psi_n)$ be a basis of $V^{*}$ . Then there is exactly one basis $(\mathbf{v}_1, \dots, \mathbf{v}_n)$ of $V$ whose dual basis is $(\psi_1, \dots, \psi_n)$ , that is, with $\psi_i(\mathbf{v}_j) = \delta_{ij} \qquad \text{for all } i, j.$

Idea. Go up one level, where the problem is already solved. The basis $(\psi_1, \dots, \psi_n)$ of $V^{*}$ has a dual basis $(\theta_1, \dots, \theta_n)$ in $V^{**}$ . Every $\theta_j$ is evaluation at some vector, because $\operatorname{ev}$ is onto. Those vectors are the answer, since $\theta_j(\psi_i) = \delta_{ij}$ says $\psi_i(\mathbf{v}_j) = \delta_{ij}$ . Uniqueness is a “test against functionals” argument.

Proof. Existence. Here $V^{*}$ is finite-dimensional (Corollary 5.1.4). By Theorem 5.1.3 applied to $V^{*}$ , there is a basis $(\theta_1, \dots, \theta_n)$ of $V^{**}$ with $\theta_j(\psi_i) = \delta_{ij}$ . By Theorem 5.3.2, $\operatorname{ev}_V$ is an isomorphism, so there are unique $\mathbf{v}_j \in V$ with $\operatorname{ev}_{\mathbf{v}_j} = \theta_j$ . Its inverse is an isomorphism (Theorem 2.5.3), so $(\mathbf{v}_1, \dots, \mathbf{v}_n)$ is a basis of $V$ by Theorem 2.5.2. For all $i, j$ , $\psi_i(\mathbf{v}_j) = \operatorname{ev}_{\mathbf{v}_j}(\psi_i) = \theta_j(\psi_i) = \delta_{ij}.$ By the uniqueness in Theorem 5.1.3 (a), the dual basis of $(\mathbf{v}_1, \dots, \mathbf{v}_n)$ is $(\psi_1, \dots, \psi_n)$ .

Uniqueness. Suppose $(\mathbf{u}_1, \dots, \mathbf{u}_n)$ is also a basis with $\psi_i(\mathbf{u}_j) = \delta_{ij}$ . Fix $j$ . Then $\psi_i(\mathbf{v}_j - \mathbf{u}_j) = \delta_{ij} - \delta_{ij} = 0$ for every $i$ . Every $\varphi \in V^{*}$ is a combination of the $\psi_i$ , so $\varphi(\mathbf{v}_j - \mathbf{u}_j) = 0$ for every $\varphi \in V^{*}$ . By Theorem 5.1.5 (b), $\mathbf{v}_j - \mathbf{u}_j = \mathbf{0}$ . Hence $\mathbf{u}_j = \mathbf{v}_j$ for every $j$ .

In coordinates this is a matrix inversion, the mirror image of Example (The Dual Basis Is Read Off the Inverse Matrix). There, a basis was given and its dual basis appeared as the rows of an inverse matrix. Here the functionals are given, and the basis appears as the columns of an inverse matrix.

Example (A Basis With Prescribed Dual Basis)

On $V = \mathbb{R}[x]_{\le 2}$ , consider the functionals $\psi_1(p) = p(0), \qquad \psi_2(p) = p(1), \qquad \psi_3(p) = p'(1).$ Show that $(\psi_1, \psi_2, \psi_3)$ is a basis of $V^{*}$ , and find the basis $(p_1, p_2, p_3)$ of $V$ whose dual basis it is.

Solution. Write down a matrix. For $p = a + bx + cx^2$ , with $[p]_{\mathcal{E}} = (a, b, c)$ in $\mathcal{E} = (1, x, x^2)$ , $\psi_1(p) = a, \qquad \psi_2(p) = a + b + c, \qquad \psi_3(p) = b + 2c .$ So $\psi_i(p) = \mathbf{r}_i[p]_{\mathcal{E}}$ , where $\mathbf{r}_i$ is row $i$ of $\mathbf{A} = \begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 1 \\ 0 & 1 & 2 \end{pmatrix}.$ Translate the condition. Let $\mathbf{P}$ be the $3 \times 3$ matrix whose $j$ -th column is $[p_j]_{\mathcal{E}}$ . By Theorem 0.9.2, the $(i, j)$ entry of $\mathbf{A}\mathbf{P}$ is $\mathbf{r}_i[p_j]_{\mathcal{E}} = \psi_i(p_j)$ . So the condition $\psi_i(p_j) = \delta_{ij}$ says exactly $\mathbf{A}\mathbf{P} = \mathbf{I}_3$ .

Solve. Row reduction (Theorem 3.4.6) gives $\mathbf{A}^{-1} = \begin{pmatrix} 1 & 0 & 0 \\ -2 & 2 & -1 \\ 1 & -1 & 1 \end{pmatrix},$ and one checks $\mathbf{A}\mathbf{A}^{-1} = \mathbf{I}_3$ , so $\mathbf{A}$ is invertible by Theorem 3.4.5. Multiplying $\mathbf{A}\mathbf{P} = \mathbf{I}_3$ on the left by $\mathbf{A}^{-1}$ forces $\mathbf{P} = \mathbf{A}^{-1}$ . Since the columns of the invertible matrix $\mathbf{P}$ are independent, $(p_1, p_2, p_3)$ is a basis of $V$ (via the coordinate isomorphism, Corollary 2.5.5). By the uniqueness in Theorem 5.1.3 (a), its dual basis is $(\psi_1, \psi_2, \psi_3)$ , which in particular is a basis of $V^{*}$ . Reading the columns, $p_1 = 1 - 2x + x^2 = (1 - x)^2, \qquad p_2 = 2x - x^2, \qquad p_3 = x^2 - x .$ Check. $p_1(0) = 1$ , $p_1(1) = 0$ , $p_1'(1) = 0$ ; $p_2(0) = 0$ , $p_2(1) = 1$ , $p_2'(1) = 2 - 2 = 0$ ; $p_3(0) = 0$ , $p_3(1) = 0$ , $p_3'(1) = 1$ .

So every $p \in \mathbb{R}[x]_{\le 2}$ is $p = p(0)\,p_1 + p(1)\,p_2 + p'(1)\,p_3$ : the coordinates of $p$ in this basis are the three measurements.

The next consequence is the one we will use most. A subspace $U$ determines the set $U^{0}$ of functionals vanishing on it. Going back, the functionals in $U^{0}$ vanish together on some set of vectors, which contains $U$ . Is it exactly $U$ ?

Corollary 5.3.4 (The Annihilator of the Annihilator)

Let $V$ be a finite-dimensional vector space over $F$ , and let $U$ be a subspace of $V$ . Write $U^{00} \mathrel{:=} (U^{0})^{0} \subseteq V^{**}$ . Then $U^{00} = \operatorname{ev}_V(U) = \{ \operatorname{ev}_{\mathbf{u}} : \mathbf{u} \in U \}.$ So, under the identification $\mathbf{v} \leftrightarrow \operatorname{ev}_{\mathbf{v}}$ , we have $U^{00} = U$ . Equivalently, $U = \{ \mathbf{v} \in V : \varphi(\mathbf{v}) = 0 \text{ for every } \varphi \in U^{0} \}.$

Idea. One inclusion is a tautology: if $\mathbf{u} \in U$ and $\varphi$ kills $U$ , then $\operatorname{ev}_{\mathbf{u}}(\varphi) = \varphi(\mathbf{u}) = 0$ . For the other, count. The dimension formula applied twice, once in $V$ and once in $V^{*}$ , gives $\dim U^{00} = \dim U$ , and $\operatorname{ev}$ is injective, so $\dim \operatorname{ev}_V(U) = \dim U$ too. One inclusion plus equal dimension gives equality.

Proof. Let $n = \dim V$ , so $\dim V^{*} = n$ by Corollary 5.1.4.

Inclusion. Let $\mathbf{u} \in U$ . For every $\varphi \in U^{0}$ , $\operatorname{ev}_{\mathbf{u}}(\varphi) = \varphi(\mathbf{u}) = 0$ by Definition 5.2.1. Hence $\operatorname{ev}_{\mathbf{u}} \in (U^{0})^{0}$ , and $\operatorname{ev}_V(U) \subseteq U^{00}$ .

Dimensions. By Theorem 5.2.2 in $V$ , $\dim U^{0} = n - \dim U$ . By Theorem 5.2.2 in the $n$ -dimensional space $V^{*}$ , applied to its subspace $U^{0}$ , $\dim U^{00} = n - \dim U^{0} = n - (n - \dim U) = \dim U .$ The restriction of $\operatorname{ev}_V$ to $U$ is linear and injective (Theorem 5.3.1), so it is an isomorphism onto its image $\operatorname{ev}_V(U)$ , and $\dim \operatorname{ev}_V(U) = \dim U$ (Theorem 2.5.4). So $\operatorname{ev}_V(U)$ is a subspace of $U^{00}$ of the same finite dimension, and Theorem 1.6.8 gives $\operatorname{ev}_V(U) = U^{00}$ .

The equivalent form. Let $\mathbf{v} \in V$ . Then $\varphi(\mathbf{v}) = 0$ for every $\varphi \in U^{0}$ if and only if $\operatorname{ev}_{\mathbf{v}} \in U^{00} = \operatorname{ev}_V(U)$ , if and only if $\operatorname{ev}_{\mathbf{v}} = \operatorname{ev}_{\mathbf{u}}$ for some $\mathbf{u} \in U$ . Since $\operatorname{ev}_V$ is injective, this happens if and only if $\mathbf{v} \in U$ .

The last form says: a subspace is exactly the common zero set of the functionals that vanish on it. No vector outside $U$ sneaks through all the equations. In section 6 of this chapter this becomes the statement that every subspace of $F^n$ is the solution set of a homogeneous linear system. An immediate consequence is that the annihilator loses no information.

Corollary 5.3.5 (Subspaces Are Determined by Their Annihilators)

Let $V$ be a finite-dimensional vector space, and let $U$ and $W$ be subspaces of $V$ . Then $U = W$ if and only if $U^{0} = W^{0}$ .

Proof. $(\Rightarrow)$ is immediate. $(\Leftarrow)$ Suppose $U^{0} = W^{0}$ . By Corollary 5.3.4, $U = \{ \mathbf{v} : \varphi(\mathbf{v}) = 0 \text{ for all } \varphi \in U^{0} \} = \{ \mathbf{v} : \varphi(\mathbf{v}) = 0 \text{ for all } \varphi \in W^{0} \} = W$ .

Quick check. Is Corollary 5.3.5 still true if $U$ and $W$ are allowed to be arbitrary subsets of $V$ ?

Solution. No. In $\mathbb{R}^2$ , take $U = \{(1, 0)\}$ and $W = \{(2, 0)\}$ . A functional $\varphi(x, y) = ax + by$ vanishes at $(1, 0)$ exactly when $a = 0$ , and at $(2, 0)$ exactly when $2a = 0$ , that is, again when $a = 0$ . So $U^{0} = W^{0}$ but $U \neq W$ . An annihilator only sees the span, $U^{0} = (\operatorname{span} U)^{0}$ (Theorem 5.2.3 (b)).

5.3.5. Infinite dimension: the evaluation map is not onto

Nothing in Definition 5.3.1 or Theorem 5.3.1 needed finite dimension. The count in Theorem 5.3.2 did.

Warning. $V \cong V^{**}$ through $\operatorname{ev}$ is a finite-dimensional fact. For $V = F[x]$ , the evaluation map is injective but not surjective: there is a linear functional on $F[x]^{*}$ that is not evaluation at any polynomial. The next example constructs one.

Example (A Functional on

F\lbrack x\rbrack^{*}

That Is Not an Evaluation)

Let $\varphi_k \in F[x]^{*}$ ( $k \in \mathbb{N}$ ) be the coordinate functionals, $\varphi_k(p) =$ the coefficient of $x^k$ in $p$ , and let $\varepsilon_1(p) = p(1)$ , as in Proposition 5.1.6. Show that there is $\theta \in F[x]^{**}$ with $\theta \neq \operatorname{ev}_p$ for every $p \in F[x]$ .

Solution. Step 1: $S = \{ \varphi_k : k \in \mathbb{N} \} \cup \{\varepsilon_1\}$ is linearly independent. By Proposition 5.1.6, the $\varphi_k$ form an independent set and $\varepsilon_1 \notin \operatorname{span}\{ \varphi_k : k \in \mathbb{N} \}$ . Let $L$ be a finite list of distinct elements of $S$ . If $\varepsilon_1$ is not in $L$ , then $L$ is independent. Otherwise, list $\varepsilon_1$ last; the others are independent and $\varepsilon_1$ is not in their span, so $L$ is independent by Lemma 1.5.3.

Step 2: build $\theta$ . By Theorem 1.8.2 there is a basis $B$ of $F[x]^{*}$ containing $S$ . By Theorem 2.1.6 for the (infinite) basis $B$ , there is a linear $\theta \colon F[x]^{*} \to F$ with $\theta(\varepsilon_1) = 1$ and $\theta(\beta) = 0$ for every $\beta \in B \setminus \{\varepsilon_1\}$ . In particular $\theta(\varphi_k) = 0$ for all $k$ .

Step 3: $\theta$ is not an evaluation. Suppose $\theta = \operatorname{ev}_p$ for some $p \in F[x]$ . Then for every $k$ , the coefficient of $x^k$ in $p$ is $\varphi_k(p) = \operatorname{ev}_p(\varphi_k) = \theta(\varphi_k) = 0$ . So $p = 0$ , and $\theta = \operatorname{ev}_0 = 0$ . This contradicts $\theta(\varepsilon_1) = 1$ . Hence $\theta \notin \operatorname{ev}(F[x])$ , and $\operatorname{ev}$ is not surjective.

The functional $\theta$ exists, but nobody can write it down: it comes from Zorn’s Lemma through Theorem 1.8.2. The deeper reason for the failure is size. $F[x]^{*}$ is so much bigger than $F[x]$ (Exercise (C4: How large is $F\lbrack x\rbrack^{*}$ ?) identifies it with the whole sequence space $F^{\mathbb{N}}$ ) that $F[x]^{**}$ is bigger still, and in fact no isomorphism $F[x] \cong F[x]^{**}$ exists at all, a statement about the sizes of bases that we do not prove. In finite dimension, sizes cannot grow, and the evaluation map is the perfect dictionary of Theorem 5.3.2.

5.3.6. Exercises

A. Check your understanding

Exercise (A1)

(a) Define $\operatorname{ev}_{\mathbf{v}}$ for $\mathbf{v} \in V$ , and the evaluation map $\operatorname{ev}_V$ . In which space does $\operatorname{ev}_{\mathbf{v}}$ live?
(b) State a hypothesis on $V$ under which $\operatorname{ev}_V$ is an isomorphism, and a space for which it is not.
(c) True or false: if $V$ is finite-dimensional and $\mathbf{v} \neq \mathbf{0}$ , then $\operatorname{ev}_{\mathbf{v}}(\varphi) \neq 0$ for every non-zero $\varphi \in V^{*}$ . Justify your answer.
(d) True or false: if $U$ and $W$ are subspaces of $\mathbb{R}^5$ with $U^{0} = W^{0}$ , then $U = W$ . Justify your answer.
(e) Name the method used to prove $U^{00} = \operatorname{ev}_V(U)$ in Corollary 5.3.4.

Solution.

(a) $\operatorname{ev}_{\mathbf{v}} \colon V^{*} \to F$ , $\operatorname{ev}_{\mathbf{v}}(\varphi) = \varphi(\mathbf{v})$ , and $\operatorname{ev}_V \colon V \to V^{**}$ , $\mathbf{v} \mapsto \operatorname{ev}_{\mathbf{v}}$ (Definition 5.3.1). $\operatorname{ev}_{\mathbf{v}}$ lives in $V^{**}$ .
(b) If $V$ is finite-dimensional, $\operatorname{ev}_V$ is an isomorphism (Theorem 5.3.2). For $V = F[x]$ it is not surjective (Example (A Functional on $F\lbrack x\rbrack^{*}$ That Is Not an Evaluation)).
(c) False. It says only that some $\varphi$ has $\varphi(\mathbf{v}) \neq 0$ (Theorem 5.3.1). In $\mathbb{R}^2$ , $\mathbf{v} = (1, 2)$ and $\varphi(x, y) = 2x - y \neq 0$ give $\operatorname{ev}_{\mathbf{v}}(\varphi) = 0$ .
(d) True, by Corollary 5.3.5, since $\mathbb{R}^5$ is finite-dimensional.
(e) One inclusion plus equal dimension: $\operatorname{ev}_V(U) \subseteq U^{00}$ directly, then $\dim U^{00} = \dim U = \dim \operatorname{ev}_V(U)$ from the dimension formula for annihilators (twice) and injectivity of $\operatorname{ev}$ , and Theorem 1.6.8.

B. Practice

Exercise (B1: A basis with a given dual basis)

(a) Let $\psi_1(x, y) = 2x + y$ and $\psi_2(x, y) = x + y$ on $\mathbb{R}^2$ . Find the basis $(\mathbf{v}_1, \mathbf{v}_2)$ of $\mathbb{R}^2$ whose dual basis is $(\psi_1, \psi_2)$ .
(b) Let $\psi_1(p) = p(0)$ and $\psi_2(p) = \int_0^1 p(x)\,\mathrm{d} x$ on $\mathbb{R}[x]_{\le 1}$ . Find the basis $(p_1, p_2)$ of $\mathbb{R}[x]_{\le 1}$ whose dual basis is $(\psi_1, \psi_2)$ .

Solution.

(a) As in Example (A Basis With Prescribed Dual Basis), $\psi_i(\mathbf{v}) = \mathbf{r}_i\mathbf{v}$ with $\mathbf{r}_i$ the rows of $\mathbf{A} = \begin{pmatrix} 2 & 1 \\ 1 & 1 \end{pmatrix}$ , and the condition $\psi_i(\mathbf{v}_j) = \delta_{ij}$ says $\mathbf{A}\mathbf{P} = \mathbf{I}_2$ for $\mathbf{P} = \begin{pmatrix} \mathbf{v}_1 & \mathbf{v}_2 \end{pmatrix}$ . Here $2 \cdot 1 - 1 \cdot 1 = 1 \neq 0$ , so by Theorem 0.9.8 $\mathbf{A}^{-1} = \begin{pmatrix} 1 & -1 \\ -1 & 2 \end{pmatrix},$ $\mathbf{P} = \mathbf{A}^{-1}$ , so $\mathbf{v}_1 = (1, -1)$ and $\mathbf{v}_2 = (-1, 2)$ . These are independent (the columns of an invertible matrix), hence a basis. Check: $\psi_1(\mathbf{v}_1) = 1$ , $\psi_2(\mathbf{v}_1) = 0$ , $\psi_1(\mathbf{v}_2) = 0$ , $\psi_2(\mathbf{v}_2) = 1$ . By the uniqueness part of Theorem 5.1.3, the dual basis of $(\mathbf{v}_1, \mathbf{v}_2)$ is $(\psi_1, \psi_2)$ .
(b) For $p = a + bx$ , $\psi_1(p) = a$ and $\psi_2(p) = a + \tfrac12 b$ . So $\mathbf{A} = \begin{pmatrix} 1 & 0 \\ 1 & 1/2 \end{pmatrix}$ and $\mathbf{P} = \mathbf{A}^{-1} = \begin{pmatrix} 1 & 0 \\ -2 & 2 \end{pmatrix},$ whose columns are the coordinates of $p_1 = 1 - 2x$ and $p_2 = 2x$ in $(1, x)$ . Check: $p_1(0) = 1$ , $\int_0^1 (1 - 2x)\,\mathrm{d} x = 1 - 1 = 0$ , $p_2(0) = 0$ , $\int_0^1 2x\,\mathrm{d} x = 1$ . As in (a), $(p_1, p_2)$ is a basis with dual basis $(\psi_1, \psi_2)$ .

Exercise (B2:

U^{00} = U

for a line)

Let $U = \operatorname{span}\bigl((1, 2, -1)\bigr) \subseteq \mathbb{R}^3$ .

(a) Find a basis of $U^{0}$ .
(b) Find all $\mathbf{v} \in \mathbb{R}^3$ with $\varphi(\mathbf{v}) = 0$ for every $\varphi \in U^{0}$ , and check that the answer is $U$ .
(c) Hence verify that $U^{00} = \operatorname{ev}(U)$ , and confirm the dimension count.

Solution.

(a) A functional $\varphi(x, y, z) = ax + by + cz$ (Theorem 5.1.1) lies in $U^{0}$ iff it vanishes at $(1, 2, -1)$ (Theorem 5.2.3 (b)), that is, $a + 2b - c = 0$ . The solutions are $(a, b, c) = s(-2, 1, 0) + t(1, 0, 1)$ , so $\varphi_1(x, y, z) = 2x - y$ and $\varphi_2(x, y, z) = x + z$ span $U^{0}$ (we replaced $(-2, 1, 0)$ by its negative). They are independent, since neither is a multiple of the other, so $(\varphi_1, \varphi_2)$ is a basis of $U^{0}$ . This matches $\dim U^{0} = 3 - 1 = 2$ (Theorem 5.2.2).
(b) Every $\varphi \in U^{0}$ is a combination of $\varphi_1, \varphi_2$ , so $\varphi(\mathbf{v}) = 0$ for all $\varphi \in U^{0}$ iff $\varphi_1(\mathbf{v}) = \varphi_2(\mathbf{v}) = 0$ , that is, $2x - y = 0$ and $x + z = 0$ . With $x = t$ : $y = 2t$ , $z = -t$ , so $\mathbf{v} = t(1, 2, -1)$ . The set is exactly $U$ .
(c) Let $\theta \in U^{00} \subseteq (\mathbb{R}^3)^{**}$ . By Theorem 5.3.2, $\theta = \operatorname{ev}_{\mathbf{v}}$ for some $\mathbf{v}$ , and $\theta \in (U^{0})^{0}$ means $\varphi(\mathbf{v}) = 0$ for all $\varphi \in U^{0}$ . By (b), $\mathbf{v} \in U$ , so $U^{00} \subseteq \operatorname{ev}(U)$ ; the reverse inclusion is immediate from Definition 5.2.1. Dimensions: $\dim U^{00} = 3 - \dim U^{0} = 1 = \dim U$ .

Exercise (B3: Recognizing an evaluation)

Let $V = \mathbb{R}[x]_{\le 2}$ , with the coefficient functionals $\varphi_0, \varphi_1, \varphi_2$ of Example (Evaluation in Three Spaces). Let $\theta \in V^{**}$ be the linear functional with $\theta(\varphi_0) = 1$ , $\theta(\varphi_1) = -3$ , $\theta(\varphi_2) = 2$ . Find $p \in V$ with $\theta = \operatorname{ev}_p$ . Hence compute $\theta(\varepsilon_1)$ and $\theta(\psi)$ , where $\varepsilon_1(q) = q(1)$ and $\psi(q) = q'(0)$ .

Solution. By Theorem 5.3.2, $(\operatorname{ev}_1, \operatorname{ev}_x, \operatorname{ev}_{x^2})$ is the dual basis of $(\varphi_0, \varphi_1, \varphi_2)$ . Hence $\operatorname{ev}_1 - 3\operatorname{ev}_x + 2\operatorname{ev}_{x^2}$ takes the values $1, -3, 2$ on $\varphi_0, \varphi_1, \varphi_2$ . So does $\theta$ , and a linear functional is determined by its values on a basis (Theorem 2.1.5). Since $\operatorname{ev}$ is linear (Theorem 5.3.1), $\theta = \operatorname{ev}_1 - 3\operatorname{ev}_x + 2\operatorname{ev}_{x^2} = \operatorname{ev}_{p}, \qquad p = 1 - 3x + 2x^2 .$ Hence $\theta(\varepsilon_1) = \varepsilon_1(p) = 1 - 3 + 2 = 0$ and $\theta(\psi) = \psi(p) = p'(0) = -3$ .

C. Going deeper

Exercise (C1: Subspaces of

V

and of

V^{*}

)

Let $V$ be a finite-dimensional vector space over $F$ . Prove that $U \mapsto U^{0}$ is a bijection from the set of subspaces of $V$ to the set of subspaces of $V^{*}$ , and that it reverses inclusions in both directions: $U \subseteq W$ if and only if $W^{0} \subseteq U^{0}$ .

Hint: for surjectivity, given a subspace $X \subseteq V^{*}$ , consider $U = \{ \mathbf{v} \in V : \varphi(\mathbf{v}) = 0 \text{ for all } \varphi \in X \}$ .

Solution. Let $n = \dim V = \dim V^{*}$ (Corollary 5.1.4). By Proposition 5.2.1, $U^{0}$ is a subspace of $V^{*}$ , so the map is well defined.

Injective. This is Corollary 5.3.5.

Inclusions. If $U \subseteq W$ , then $W^{0} \subseteq U^{0}$ by Theorem 5.2.3 (a). Conversely, suppose $W^{0} \subseteq U^{0}$ , and let $\mathbf{u} \in U$ . Every $\varphi \in W^{0}$ lies in $U^{0}$ , so $\varphi(\mathbf{u}) = 0$ . By Corollary 5.3.4 (the equivalent form, for $W$ ), $\mathbf{u} \in W$ . Hence $U \subseteq W$ .

Surjective. Let $X$ be a subspace of $V^{*}$ , and let $U = \{ \mathbf{v} \in V : \varphi(\mathbf{v}) = 0 \text{ for all } \varphi \in X \}$ . For $\mathbf{v} \in V$ , $\mathbf{v} \in U$ iff $\operatorname{ev}_{\mathbf{v}}(\varphi) = 0$ for all $\varphi \in X$ iff $\operatorname{ev}_{\mathbf{v}} \in X^{0}$ , where $X^{0} \subseteq V^{**}$ . So $U = \operatorname{ev}_V^{-1}(X^{0})$ , and since $\operatorname{ev}_V$ is an isomorphism (Theorem 5.3.2), $U$ is a subspace and $\operatorname{ev}_V$ restricts to an isomorphism $U \to X^{0}$ . By Theorem 5.2.2 in $V^{*}$ , $\dim U = \dim X^{0} = n - \dim X$ . By definition of $U$ , every $\varphi \in X$ vanishes on $U$ , so $X \subseteq U^{0}$ . By Theorem 5.2.2 in $V$ , $\dim U^{0} = n - \dim U = \dim X$ . By Theorem 1.6.8, $X = U^{0}$ . This proves the claim.

Exercise (C2: Spans cut out by equations)

Let $V$ be finite-dimensional and $S \subseteq V$ any subset.

(a) Prove that $\{ \mathbf{v} \in V : \varphi(\mathbf{v}) = 0 \text{ for every } \varphi \in S^{0} \} = \operatorname{span}(S)$ .
(b) Deduce: a vector $\mathbf{v}$ lies in $\operatorname{span}(S)$ if and only if every functional that vanishes on $S$ vanishes at $\mathbf{v}$ .
(c) Show by an example that (a) can fail if “ $\operatorname{span}(S)$ ” is replaced by “ $S$ ”.

Solution.

(a) $\operatorname{span}(S)$ is a subspace (Theorem 1.3.1), and $S^{0} = (\operatorname{span} S)^{0}$ by Theorem 5.2.3 (b). Applying Corollary 5.3.4 to $U = \operatorname{span}(S)$ , $\{ \mathbf{v} : \varphi(\mathbf{v}) = 0 \ \forall \varphi \in S^{0} \} = \{ \mathbf{v} : \varphi(\mathbf{v}) = 0 \ \forall \varphi \in (\operatorname{span} S)^{0} \} = \operatorname{span}(S).$
(b) This is (a) read for a single vector $\mathbf{v}$ .
(c) Take $S = \{(1, 0)\} \subseteq \mathbb{R}^2$ . Then $S^{0}$ consists of the functionals $(x, y) \mapsto by$ , and their common zero set is the whole $x$ -axis, which contains $(2, 0) \notin S$ .

Exercise (C3: Where finite dimension is needed)

Let $V = F[x]$ , let $\varphi_k$ and $\varepsilon_1$ be as in Example (A Functional on $F\lbrack x\rbrack^{*}$ That Is Not an Evaluation), and let $X = \operatorname{span}\{ \varphi_k : k \in \mathbb{N} \} \subseteq V^{*}$ .

(a) Show that $\{ p \in F[x] : \varphi(p) = 0 \text{ for all } \varphi \in X \} = \{0\}$ .
(b) Deduce that $X \neq U^{0}$ for every subspace $U$ of $F[x]$ . So the map $U \mapsto U^{0}$ of Exercise (C1: Subspaces of $V$ and of $V^{*}$ ) is not surjective for $F[x]$ .
(c) Which step of the solution of Exercise (C1: Subspaces of $V$ and of $V^{*}$ ) fails here?

Solution.

(a) If $\varphi(p) = 0$ for all $\varphi \in X$ , then in particular $\varphi_k(p) = 0$ for every $k$ , so every coefficient of $p$ is $0$ and $p = 0$ . Conversely $\varphi(0) = 0$ for every $\varphi$ .
(b) Suppose $X = U^{0}$ . Every $\varphi \in X = U^{0}$ vanishes on $U$ , so $U \subseteq \{ p : \varphi(p) = 0 \ \forall \varphi \in X \} = \{0\}$ by (a). Hence $U = \{0\}$ and $U^{0} = V^{*}$ (every functional vanishes at $0$ ). But $\varepsilon_1 \in V^{*}$ and $\varepsilon_1 \notin X$ , by Proposition 5.1.6. So $X \neq V^{*} = U^{0}$ , a contradiction.
(c) The dimension count. In Exercise (C1: Subspaces of $V$ and of $V^{*}$ ) we used that $\operatorname{ev}_V$ is onto and that $\dim U + \dim U^{0} = \dim V$ to force $X = U^{0}$ from $X \subseteq U^{0}$ . Here $U = \{0\}$ and $X \subsetneq U^{0} = V^{*}$ : the inclusion holds, but there is no finite dimension to compare, and a proper subspace of an infinite-dimensional space can be “as large as” the whole space.