Dual bases

One more word before embarking on the proofs of the important theorems. The concept of dual space was defined without any reference to coordinate systems; a glance at the following proofs will show a superabundance of coordinate systems. We wish to point out that this phenomenon is inevitable; we shall be establishing results concerning dimension, and dimension is the one concept (so far) whose very definition is given in terms of a basis.

Theorem 1. If 𝒱 is an n-dimensional vector space, if { x 1 , , x n } is a basis in 𝒱 , and if { α 1 , , α n } is any set of n scalars, then there is one and only one linear functional y on 𝒱 such that [ x i , y ] = α i for i = 1 , , n .

Proof. Every x in 𝒱 may be written in the form x = ξ 1 x 1 + + ξ n x n in one and only one way; if y is any linear functional, then [ x , y ] = ξ 1 [ x 1 , y ] + + ξ n [ x n , y ] . From this relation the uniqueness of y is clear; if [ x i , y ] = α i , then the value of [ x , y ] is determined, for every x , by [ x , y ] = i ξ i α i . The argument can also be turned around; if we define y by [ x , y ] = ξ 1 α 1 + + ξ n α n , then y is indeed a linear functional, and [ x i , y ] = α i . ◻

Theorem 2. If 𝒱 is an n -dimensional vector space and if 𝒳 = { x 1 , , x n } is a basis in 𝒱 , then there is a uniquely determined basis \mathcal{X}^{\prime} in \mathcal{V}^{\prime} , \mathcal{X}^{\prime}=\{y_{1}, \ldots, y_{n}\} , with the property that [ x i , y j ] = δ i j . Consequently the dual space of an n -dimensional space is n -dimensional.

The basis \mathcal{X}^{\prime} is called the dual basis of 𝒳 .

Proof. It follows from Theorem 1 that, for each j = 1 , , n , a unique y j in \mathcal{V}^{\prime} can be found so that [ x i , y j ] = δ i j ; we have only to prove that the set \mathcal{X}^{\prime}=\{y_{1}, \ldots, y_{n}\} is a basis in \mathcal{V}^{\prime} .

In the first place, \mathcal{X}^{\prime} is a linearly independent set, for if we had α 1 y 1 + + α n y n = 0 , in other words, if [ x , α 1 y 1 + + α n y n ] = α 1 [ x , y 1 ] + + α n [ x , y n ] = 0 for all x , then we should have, for x = x i ,

0 = j α j [ x i , y j ] = j α j δ i j = α i .  

In the second place, every y in \mathcal{V}^{\prime} is a linear combination of y 1 , , y n . To prove this, write [ x i , y ] = α i ; then, for x = i ξ i x i , we have [ x , y ] = ξ 1 α 1 + + ξ n α n .  

On the other hand [ x , y j ] = i ξ i [ x i , y j ] = ξ j  

so that, substituting in the preceding equation, we get

\begin{align} {[x, y] } & =\alpha_{1}[x, y_{1}]+\cdots+\alpha_{n}[x, y_{n}] \\ & =[x, \alpha_{1} y_{1}+\cdots+\alpha_{n} y_{n}] \end{align}

Consequently y = α 1 y 1 + + α n y n , and the proof of the theorem is complete. ◻

We shall need also the following easy consequence of Theorem 2.

Theorem 3. If u and v are any two different vectors of the n -dimensional vector space 𝒱 , then there exists a linear functional y on 𝒱 such that [ u , y ] [ v , y ] ; or equivalently, to any non-zero vector x in 𝒱 there corresponds a y in \mathcal{V}^\prime such that [ x , y ] 0 .

Proof. That the two statements in the theorem are indeed equivalent is seen by considering x = u v . We shall, accordingly, prove the latter statement only.

Let 𝒳 = { x 1 , , x n } be any basis in 𝒱 , and let \mathcal{X}^{\prime}=\{y_{1}, \ldots, y_{n}\} be the dual basis in \mathcal{V}^{\prime} . If x = i ξ i x i , then (as above) [ x , y j ] = ξ j . Hence if [ x , y ] = 0 for all y , and, in particular, if [ x , y j ] = 0 for j = 1 , , n , then x = 0 . ◻