maths.free › Linear Algebra › 4. Vector Spaces › Dimension
Dimension
Almost every vector space we have encountered has been infinite in size (an exception is ). But some are bigger and richer than others.
Dimension
Almost every vector space we have encountered has been infinite in size (an exception is ). But some are bigger and richer than others. Dimension, once suitably defined, will be a measure of the size of a vector space, and a useful tool for studying its properties. You probably already have a rough notion of what a mathematical definition of dimension might be try to forget these imprecise ideas and go with the new ones given here.
- What is the dimension of the vector space $P_6$, the set of all polynomials of degree 6 or less?
- How are the rank and nullity of a matrix related?
- full rank.
Dimension
This is a very simple definition, which belies its power. Grab a basis, any basis, and count up the number of vectors it contains. That is the dimension. However, this simplicity causes a problem. Given a vector space, you and I could each construct different bases remember that a vector space might have many bases. And what if your basis and my basis had different sizes? Applying we would arrive at different numbers! With our current knowledge about vector spaces, we would have to say that dimension is not well-defined. Fortunately, there is a theorem that will correct this problem.
In a strictly logical progression, the next two theorems would precede the definition of dimension. Many subsequent theorems will trace their lineage back to the following fundamental result.
Notice how the swap of the two summations is so much easier in the third step above, as opposed to all the rearranging and regrouping that takes place in the previous proof. And using only about half the space. And there are no ellipses ().
can be viewed as a generalization of . We know that $\complex{m}$ has a basis with $m$ vectors in it (), so it is a set of $m$ vectors that spans $\complex{m}$. By , any set of more than $m$ vectors from $\complex{m}$ will be linearly dependent. But this is exactly the conclusion we have in . Maybe this is not a total shock, as the proofs of both theorems rely heavily on . The beauty of is that it applies in any vector space. We illustrate the generality of this theorem, and hint at its power, in the next example.
Example: Linearly dependent set in $P_4$
In we showed that S=\set{x-2,\,x^2-4x+4,\,x^3-6x^2+12x-8,\,x^4-8x^3+24x^2-32x+16} is a spanning set for $W=\setparts{p(x)}{p\in P_4,\ p(2)=0}$. So we can apply to $W$ with $t=4$. Here is a set of five vectors from $W$, as you may check by verifying that each is a polynomial of degree 4 or less and has $x=2$ as a root, T&=\set{p_1,\,p_2,\,p_3,\,p_4,\,p_5}\subseteq W\\ &\ \\ p_1&=x^4-2x^3+2x^2-8x+8\\ p_2&=-x^3+6x^2-5x-6\\ p_3&=2x^4-5x^3+5x^2-7x+2\\ p_4&=-x^4+4x^3-7x^2+6x\\ p_5&=4x^3-9x^2+5x-6
By we conclude that $T$ is linearly dependent, with no further computations.
is indeed powerful, but our main purpose in proving it right now was to make sure that our definition of dimension () is well-defined. Here is the theorem.
tells us that if we find one finite basis in a vector space, then they all have the same size. This (finally) makes unambiguous.
Condensed — the full section is in Beezer, A First Course in Linear Algebra.
Dimension of Vector Spaces
We can now collect the dimension of some common, and not so common, vector spaces.
Example: Dimension of a subspace of $M_{22}$
It should now be plausible that Z=\setparts{\begin{bmatrix}a&b\\c&d\end{bmatrix}}{2a+b+3c+4d=0,\,-a+3b-5c-2d=0} is a subspace of the vector space $M_{22}$ (). (It is.) To find the dimension of $Z$ we must first find a basis, though any old basis will do.
First concentrate on the conditions relating $a,\,b,\,c$ and $d$. They form a homogeneous system of two equations in four variables with coefficient matrix \begin{bmatrix} 2 & 1 & 3 & 4\\ -1 & 3 & -5 & -2 \end{bmatrix}
We can row-reduce this matrix to obtain \begin{bmatrix} \leading{1} & 0 & 2 & 2\\ 0 & \leading{1} & -1 & 0 \end{bmatrix}
Rewrite the two equations represented by each row of this matrix, expressing the dependent variables ($a$ and $b$) in terms of the free variables ($c$ and $d$), and we obtain, a&=-2c-2d\\ b&=c
We can now write a typical entry of $Z$ strictly in terms of $c$ and $d$, and we can decompose the result, \begin{bmatrix}a&b\\c&d\end{bmatrix}= \begin{bmatrix}-2c-2d&c\\c&d\end{bmatrix}= \begin{bmatrix}-2c&c\\c&0\end{bmatrix}+ \begin{bmatrix}-2d&0\\0&d\end{bmatrix}= c\begin{bmatrix}-2&1\\1&0\end{bmatrix}+ d\begin{bmatrix}-2&0\\0&1\end{bmatrix}
This equation says that an arbitrary matrix in $Z$ can be written as a linear combination of the two vectors in S=\set{\begin{bmatrix}-2&1\\1&0\end{bmatrix},\,\begin{bmatrix}-2&0\\0&1\end{bmatrix}} so we know that Z=\spn{S}= \spn{\set{ \begin{bmatrix}-2&1\\1&0\end{bmatrix},\, \begin{bmatrix}-2&0\\0&1\end{bmatrix} }}
Are these two matrices (vectors) also linearly independent? Begin with a relation of linear dependence on $S$, a_1\begin{bmatrix}-2&1\\1&0\end{bmatrix}+ a_2\begin{bmatrix}-2&0\\0&1\end{bmatrix}&=\zeromatrix\\ \begin{bmatrix}-2a_1-2a_2&a_1\\a_1&a_2\end{bmatrix}&= \begin{bmatrix}0&0\\0&0\end{bmatrix}
From the equality of the two entries in the last row, we conclude that $a_1=0$, $a_2=0$. Thus the only possible relation of linear dependence is the trivial one, and therefore $S$ is linearly independent (). So $S$ is a basis for $Z$ (). Finally, we can conclude that $\dimension{Z}=2$ () since $S$ has two elements.
Condensed — the full section is in Beezer, A First Course in Linear Algebra.
Rank and Nullity of a Matrix
For any matrix, we have seen that we can associate several subspaces the null space (), the column space (), row space () and the left null space (). As vector spaces, each of these has a dimension, and for the null space and column space, they are important enough to warrant names.
Example: Rank and nullity of a matrix
Let us compute the rank and nullity of A=\begin{bmatrix} 2 & -4 & -1 & 3 & 2 & 1 & -4\\ 1 & -2 & 0 & 0 & 4 & 0 & 1\\ -2 & 4 & 1 & 0 & -5 & -4 & -8\\ 1 & -2 & 1 & 1 & 6 & 1 & -3\\ 2 & -4 & -1 & 1 & 4 & -2 & -1\\ -1 & 2 & 3 & -1 & 6 & 3 & -1 \end{bmatrix}
To do this, we will first row-reduce the matrix since that will help us determine bases for the null space and column space. \begin{bmatrix} \leading{1} & -2 & 0 & 0 & 4 & 0 & 1\\ 0 & 0 & \leading{1} & 0 & 3 & 0 & -2\\ 0 & 0 & 0 & \leading{1} & -1 & 0 & -3\\ 0 & 0 & 0 & 0 & 0 & \leading{1} & 1\\ 0 & 0 & 0 & 0 & 0 & 0 & 0\\ 0 & 0 & 0 & 0 & 0 & 0 & 0 \end{bmatrix}
From this row-equivalent matrix in reduced row-echelon form we record $D=\set{1,\,3,\,4,\,6}$ and $F=\set{2,\,5,\,7}$.
For each index in $D$, creates a single basis vector. In total the basis will have $4$ vectors, so the column space of $A$ will have dimension $4$ and we write $\rank{A}=4$.
For each index in $F$, creates a single basis vector. In total the basis will have $3$ vectors, so the null space of $A$ will have dimension $3$ and we write $\nullity{A}=3$.
There were no accidents or coincidences in the previous example with the row-reduced version of a matrix in hand, the rank and nullity are easy to compute.
Every archetype () that involves a matrix lists its rank and nullity. You may have noticed as you studied the archetypes that the larger the column space is the smaller the null space is. A simple corollary states this trade-off succinctly. (See .)
Condensed — the full section is in Beezer, A First Course in Linear Algebra.
Rank and Nullity of a Nonsingular Matrix
Let us take a look at the rank and nullity of a square matrix.
Example: Rank and nullity of a square matrix
The matrix E=\begin{bmatrix} 0 & 4 & -1 & 2 & 2 & 3 & 1\\ 2 & -2 & 1 & -1 & 0 & -4 & -3\\ -2 & -3 & 9 & -3 & 9 & -1 & 9\\ -3 & -4 & 9 & 4 & -1 & 6 & -2\\ -3 & -4 & 6 & -2 & 5 & 9 & -4\\ 9 & -3 & 8 & -2 & -4 & 2 & 4\\ 8 & 2 & 2 & 9 & 3 & 0 & 9 \end{bmatrix} is row-equivalent to the matrix in reduced row-echelon form, \begin{bmatrix} \leading{1} & 0 & 0 & 0 & 0 & 0 & 0\\ 0 & \leading{1} & 0 & 0 & 0 & 0 & 0\\ 0 & 0 & \leading{1} & 0 & 0 & 0 & 0\\ 0 & 0 & 0 & \leading{1} & 0 & 0 & 0\\ 0 & 0 & 0 & 0 & \leading{1} & 0 & 0\\ 0 & 0 & 0 & 0 & 0 & \leading{1} & 0\\ 0 & 0 & 0 & 0 & 0 & 0 & \leading{1} \end{bmatrix}
With $n=7$ columns and $r=7$ nonzero rows tells us the rank is $\rank{E}=7$ and the nullity is $\nullity{E}=7-7=0$.
The value of either the nullity or the rank are enough to characterize a nonsingular matrix.
With a new equivalence for a nonsingular matrix, we can update our list of equivalences () which now becomes a list requiring double digits to number.
Nonsingular Matrix Equivalences, Round 6Recycling the nonsingular matrix from we can use Sage to verify the two new equivalences of .
Condensed — the full section is in Beezer, A First Course in Linear Algebra.
Symbols used here
A rectangular array of numbers; a linear map.
x belongs to A; every element of A is in B.
Logical connectives.
Inequalities that allow equality; < and > exclude it.
A quantity with magnitude and direction; a column of numbers.
Scaling factor of area/volume under A; zero means singular.
The matrix that undoes A; A with rows and columns swapped.
The factor by which an eigenvector is stretched: Av = λv.
Σ u_i v_i; the length of v, √(v·v).
Questions people ask
What does a determinant mean geometrically?
It is the factor by which the matrix scales area (2×2) or volume (3×3), with a negative sign if orientation flips. Zero means the matrix flattens space and cannot be undone.
What is an eigenvector?
A direction the matrix does not turn — it only stretches it by the eigenvalue. Along eigenvectors a complicated matrix acts like multiplication by a number.
Why is matrix multiplication not commutative?
Because a matrix is a transformation and AB means "do B, then A". Rotating then reflecting is not the same as reflecting then rotating.
ພະຍາຍາມເອງ
Parts of this page are adapted from Beezer, A First Course in Linear Algebra (GFDL 1.2). Condensed and re-explained here; errors are ours.
ເພີ່ມເຕີມໃນ Linear Algebra
DeterminantsMatrix inverseEigenvalues and eigenvectorsMatrix multiplicationRow reductionVector spaces, span and linear independenceOrthogonality, projections and least squaresDiagonalisation and matrix powersLinear transformations and change of basis