# Vector Spaces

Picture a vector space: large and expansive with no ends in sight. Subtle tick-marks line the ether. There are an arbitrary number of dimensions; any finite number n will do (infinite-dimensional vector spaces make up a different field of study).

Picture a basis in this vector space: a set of vectors which demarcate the space. Points in the vector space are described through their coordinates with respect to a particular basis. Linear algebra vastly generalizes the coordinate system: the “axes” (basis vectors) may be arbitrary in number (as the space is arbitrary in dimension) and they need not be perpendicular nor of equal lengths. These basis vectors simply must be (a) linearly independent (or non-redundant) and (b) span the whole space. Any single vector on a line, or two non-colinear vectors on a plane, or three non-coplanar vectors in three-space, are linearly independent – they can’t be expressed as combinations of each other – and they are a spanning set – the whole space can be accessed through their combinations. Dimension, as it turns out, describes nothing more than the maximum possible number of linearly independent vectors – how many unique vectors might one introduce? or, equivalently, the minimum number of spanning vectors – how many must we add to span the whole space? Such a “minimum spanning set” is called a basis. Can you imagine a fourth vector that can’t be described through some sum the other three, or a space which requires four vectors to span? Then you have imagined the fourth dimension.

Picture a linear transformation: a function, or mapping, which takes each vector in the space and maps it to another vector. A mapping might project each vector in R³ onto the xy-plane; a mapping might rotate the entire space about an axis; a mapping might re-assign vectors wildly. These mappings, or “linear transformations”, operate by producing a new basis from the old; they assign, to each old basis vector e, a new basis vector f expressed uniquely in terms of a set of coordinates a with respect to the old basis vectors. These new coordinates – n² of them (n old-vector coordinates for each of the n new vectors) – are the bits of information required to fully describe our linear transformation. We assemble them in a matrix which uniquely represents the transformation.

$\begin{matrix} \vec{f_1} = a_{11}\vec{e_1} + a_{21}\vec{e_2} + \cdots + a_{n1}\vec{e_n} \\ \vec{f_2} = a_{12}\vec{e_1} + a_{22}\vec{e_2} + \cdots + a_{n2}\vec{e_n} \\ \hdotsfor{1} \\ \vec{f_n} = a_{1n}\vec{e_1} + a_{2n}\vec{e_2} + \cdots + a_{nn}\vec{e_n} \end{matrix} \quad \underrightarrow{arrange} \quad \begin{bmatrix} a_{11} & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} \end{bmatrix}$

Picture, somewhere in this twisting space, a single vector which does not jump wildly but, through some coalescence, simply changes its length. For these vectors, called eigenvectors, the transformation simply multiplies the vector by a scalar, changing its length by eigenvalue λ. In other words, each coordinate c becomes λc. How might we find these vectors? Using the rows of the matrix to describe the transformation of the coordinates, we seek a vector satisfying the relationship on the left; a quick subtraction yields the system on the right.

$\begin{matrix} c_1a_{11} + c_2a_{12} + \cdots + c_na_{1n} = \lambda c_1 \\ c_1a_{21} + c_2a_{22} + \cdots + c_na_{2n} = \lambda c_2 \\ \hdotsfor{1} \\ c_1a_{n1} + c_2a_{n2} + \cdots + c_na_{nn} = \lambda c_n \end{matrix} \quad \underrightarrow{subtract} \quad \begin{matrix} c_1(a_{11} - \lambda) + c_2a_{12} + \cdots + c_na_{1n} = 0 \\ c_1a_{21} + c_2(a_{22} - \lambda) + \cdots + c_na_{2n} = 0 \\ \hdotsfor{1} \\ c_1a_{n1} + c_2a_{n2} + \cdots + c_n(a_{nn} - \lambda) = 0 \end{matrix}$

Now, things leap into the world of the strange and unknown. In linear algebra, there’s a special function called the determinant which has many special properties. For one, the determinant can be used to tell us whether, for a system of equations, there exists a solution which is non-trivial, i.e. there are coordinates satisfying the above right-side equation such that all the c’s are not equal to zero (if they were all zero, the system would be trivially satisfied). If the determinant equals zero, there exist non-trivial solutions. In other words, if we apply the determinant to the system of a‘s on the right, set it equal to zero, and solve for lambda, we will produce the lambdas which allow for non-trivial eigenvectors. We get a long polynomial, called the “characteristic polynomial”, over lambda:

$\text{det} \left( \begin{bmatrix} a_{11} - \lambda & a_{12} & \cdots & a_{1n} \\ a_{21} & a_{22} - \lambda & \cdots & a_{2n} \\ \vdots & \vdots & \ddots & \vdots \\ a_{n1} & a_{n2} & \cdots & a_{nn} - \lambda \end{bmatrix} \right) = (a_{11} - \lambda)(a_{22} - \lambda) \cdots (a_{n1})$

THE ROOTS OF THE CHARACTERISTIC POLYNOMIAL PRODUCE THE TRANSFORMATION’S EIGENVALUES. In other words, we’ve somehow moved from a rigid vector space of lines and dimensions to a flowing, curving polynomial of one variable, whose zeros signal special vectors in our linear transformation. How did we move from one world to the other? I will end with some extra “bonuses” – these might require some further thought for the marvelous insanity to sink in.

1. The characteristic polynomial of a particular linear transformation is independent of the choice of basis.
2. Because a odd-degree polynomial over the real numbers must have at least one root, any linear transformation over odd-dimensional space must have at least one eigenvector.
3. If the inner product (or dot product) of two vectors x and y is denoted by (x, y), then for every linear transformation A there exists a unique adjoint transformation A* such that (Ax, y) = (x, A*y). What is the relationship, algebraically as well as geometrically, between a linear transformation and its adjoint?
4. In the study of vector spaces over the complex numbers, two special types of linear transformation emerge: self-adjoint transformations, in which all of the eigenvalues are real (imaginary part 0) and the transformation simply stretches the space; and unitary transformations, in which all the eigenvalues have magnitude 1 (unit length on the complex plane) and the transformation simply rotates the space. Just as a complex number can be express in “trigonometric form” through a magnitude and an angle, an arbitrary linear transformation over the complex numbers can be decomposed into the product of a self-adjoint and a unitary transformation.

Happy thinking!

Advertisements

## 2 comments on “Vector Spaces”

1. Richard says:

Interesting material, yet again. You ask “how did we from one world to the other?” This question confuses me a little bit. You started off with a vector space containing arbitrary number of basis vectors then you considered all of the coordinates generated by performing various (even infinitely many?) linear transformations on these vectors, then you seem amazed that there should be values for the polynomial over the reals which allow for non trivial eigenvectors among the set of vectors generated by the linear transformations. I can see how considerations about how to imagine the fourth dimension based on a generalization of our imaginings of three dimensions could inspire an attempt to understand how one set of, as you say, smooth vectors could exist within the mesh of a more complicated vector space. But the mathematics guarantees this, you know how the linear transformations work, so I think you wanted to ask was how do we perform a sort of ‘mental’ or ‘visual’ linear transformation of our own so that we might imagine the fourth dimension; how do we get from one world to another? The 4 technical questions are interesting, but I don’t think there’s much I will add. Though I suspect technical point 3 may have applications in group theory.

• Ben says:

This was written quite a while ago, as you’re aware.

Lest I be misunderstood, I would stress that I intended no connection between the comment about the fourth dimension (which I took to demonstrate how the idea of a minimum spanning set might allow us to coherently deal with dimensions greater than those that we’re physically accustomed to) and the later comment about the characteristic polynomial.

I know how it works, as you suggest, so I’m not really asking “how”. I guess I found it interesting that a technique involving finding the zeros of a polynomial — which seems like it belongs in analysis — can assist us in a very different world, that of linear algebra.

The technical questions now seem a bit impossibly difficult for the lay reader, as I’m looking back. I might have gotten a bit ahead of myself there.