Properties Of Matrices with the same Column Space

Click For Summary
Matrices A and B with the same column space do not necessarily have the same columns, as different linear combinations can yield the same result. They must have the same rank since the rank is determined by the dimension of the column space. While they will have kernels of the same dimension due to the rank-nullity theorem, they do not necessarily share the same kernel, as demonstrated by examples of matrices with identical column spaces but different kernels. If matrix A is invertible, matrix B must also be invertible, as invertibility implies a full rank and thus a unique kernel. Understanding these properties is crucial for analyzing linear transformations and their implications in linear algebra.
rshalloo
Messages
48
Reaction score
0

Homework Statement


Suppose that A and B are 5 x 5 matrices with the same Column Space (image).
(a) Must they have the same columns?
(b) Must they have the same rank?
(c) Must they have kernels of the same dimension?
(d) Must they have the same kernel?
(e) If A is invertible, must B be invertible?
Justify each answer.

Homework Equations


Image/Column Space of A is the set of all vectors y of the form Ax=y for some vector x
Ax=y

The Attempt at a Solution



(a) No as when you multiply out the Ax for any A and x you get a set of linear combinations of x. ie first component of y = A11x1 +A12x2+...+A15x5
and 2 different linear combinations can be equal
(b) Yes? (don't know about this one its just a feeling)
(c) Yes because if the have the same Rank Then they must have same dimension of kernel and Rank+ dimension of Kernel = number of collumns
(d) Yes. well if the have the same collumn space for Ax=y for some x. But then Ax=0 for some x and so the have the same kernel
(e)Yes? (again just a feeling)

I'm just having a bit of trouble with this so any help would be much appreciated Cheers
 
Physics news on Phys.org
Think of it this way- if you apply matrix A to (1, 0, 0, 0, 0) you get its first column as a vector. If you apply matrix A to (0, 1, 0, 0, 0) you get its second column as a vector, etc. In other words, the columns are precisely the result of applying A to every basis vector in turn. That is the same as saying that the "column space" is precisely the subspace of R5 that A maps all of R5 into- it is the "range" of A. If two matrices have the same "column space" they have the same range- they map R5 into the same subspace. Also remember the "range-kernel" relation: the dimension of the kernel plus the dimension of the range is equal to the dimension of the domain space- here, 5. If two matrices have the same column space, they have the same ranges and so the same dimensions- their kernels then must have the same dimension.

They do NOT necessarily have the same kernels. For example, the matrix
\begin{bmatrix}1 & 0 \\ 0 & 0\end{bmatrix}
and
\begin{bmatrix}0 & 1 \\ 0 & 0\end{bmatrix}
obviously have the same column space but the kernel of the first is spanned by <1, 0> and of the second by <0, 1>. They have the same dimension but are different subspaces of R2.
 

Similar threads

  • · Replies 32 ·
2
Replies
32
Views
3K
Replies
17
Views
2K
  • · Replies 69 ·
3
Replies
69
Views
9K
Replies
1
Views
2K
  • · Replies 25 ·
Replies
25
Views
2K
  • · Replies 11 ·
Replies
11
Views
5K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
14
Views
6K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K