Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
96 views1 page

Vector Spaces: Nullspace & Column Space

The document discusses the concepts of nullspace and column space in vector spaces, highlighting the basis for the nullspace and the relationship between the column space of a matrix A and its row space. It explains that the dimension of the column space equals the rank of the matrix, and that the pivot columns of both A and its row echelon form U provide a basis for the column space. The document emphasizes the important theorem that the row rank equals the column rank, indicating that the number of independent columns matches the number of independent rows.

Uploaded by

raqibapp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
96 views1 page

Vector Spaces: Nullspace & Column Space

The document discusses the concepts of nullspace and column space in vector spaces, highlighting the basis for the nullspace and the relationship between the column space of a matrix A and its row space. It explains that the dimension of the column space equals the rank of the matrix, and that the pivot columns of both A and its row echelon form U provide a basis for the column space. The document emphasizes the important theorem that the row rank equals the column rank, indicating that the number of independent columns matches the number of independent rows.

Uploaded by

raqibapp
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

118 Chapter 2 Vector Spaces

The basis for the nullspace is



3 1
v = 1 1 v = 0 0

Special solutions x1 = ; x2 = .
y = 0 0 y = 1 1
0 1
Any combination c1 x1 + c2 x2 has c1 as its v component, and c2 as its y component. The
only way to have c1 x1 +c2 x2 = 0 is to have c1 = c2 = 0, so these vectors are independent.
They also span the nullspace; the complete solution is vx1 + yx2 . Thus the n r = 4 2
vectors are a basis.
The nullspace is also called the kernel of A, and its dimension n r is the nullity.

1. The column space of A The column space is sometimes called the range. This
is consistent with the usual idea of the range, as the set of all possible values f (x); x is
in the domain and f (x) is in the range. In our case the function is f (x) = Ax. Its domain
consists of all x in Rn ; its range is all possible vectors Ax, which is the column space.
(In an earlier edition of this book we called it R(A).)
Our problem is to find bases for the column spaces of U and A. Those spaces are
different (just look at the matrices!) but their dimensions are the same.
The first and third columns of U are a basis for its column space. They are the
columns with pivots. Every other column is a combination of those two. Furthermore,
the same is true of the original Aeven though its columns are different. The pivot
columns of A are a basis for its column space. The second column is three times
the first, just as in U. The fourth column equals (column 3) (column 1). The same
nullspace is telling us those dependencies.
The reason is this: Ax = 0 exactly when Ux = 0. The two systems are equivalent and
have the same solutions. The fourth column of U was also (column 3) (column 1).
Every linear dependence Ax = 0 among the columns of A is matched by a dependence
Ux = 0 among the columns of U, with exactly the same coefficients. If a set of columns
of A is independent, then so are the corresponding columns of U, and vice versa.
To find a basis for the column space C (A), we use what is already done for U. The
r columns containing pivots are a basis for the column space of U. We will pick those
same r columns in A:
2O The dimension of the column space C (A) equals the rank r, which also
equals the dimension of the row space: The number of independent columns
equals the number of independent rows. A basis for C (A) is formed by the r
columns of A that correspond, in U, to the columns containing pivots.
The row space and the column space have the same dimension r! This is one of
the most important theorems in linear algebra. It is often abbreviated as row rank =
column rank. It expresses a result that, for a random 10 by 12 matrix, is not at all

You might also like