Linear Algebra - Ranks and dimension

In summary, the nullspace for A is Sp{(0, 3, -1, 2, 1),(4, -2, 1, 4, 0)} and the nullity of B is 1. The Attempt at a Solution so I now that the nullity is 2 and so \rho(A)=3 and because of that 4\leq \rho(B)\leq 5 but I don't know how to prove that AB\neq 0Can you find an x such that ABx\neq 0?? That is: can you find an x such that Bx is not contained in the nullspace of A?Thanks for the reply. the null space of A is Sp[(
  • #1
BitterX
36
0

Homework Statement


given two matrices A, B of 5x5 order:
[itex]\rho(A)<\rho(B)[/itex]

the nullspace for A is [itex]Sp{(0, 3, -1, 2, 1),(4, -2, 1, 4, 0)}[/itex]
prove that
[itex]AB\neq 0[/itex]

Homework Equations


[itex]\rho(A)=n- \rho(P_a)[/itex]

The Attempt at a Solution


so I now that the nullity is 2 and so [itex]\rho(A)=3[/itex]
and because of that [itex]4\leq \rho(B)\leq 5[/itex]

but I don't know how to prove that [itex]AB\neq 0[/itex]
 
Physics news on Phys.org
  • #2
Can you find an x such that [itex]ABx\neq 0[/itex]?? That is: can you find an x such that Bx is not contained in the nullspace of A?
 
  • #3
Thanks for the reply
the null space of A is [itex]Sp[(1,0,0,0,0),(0,1,0,0,0)][/itex]
the nullity of B is 1 but it can be either Sp(1,0,0,0,0) or Sp(0,0,0,0,1) etc. or am I wrong?
I guess I am because this way it can be contained in the null space of A or not, and there's no way to determine. let's say that the null space of B is Sp(0,0,1,0,0) so it's not contained in the null space of A,

and let's call it [itex]Bx=(0,0,s,0,0) |s \in \mathbb{F}[/itex]
so I just say that

[itex]ABx = (0,0,a_{33}s,a_{43}s,a_{53}s)[/itex]

and if AB was 0 for every x it would have been (0,0,0,0,0)?
if so how can I determine if Bx is contained in Ax or not?
Thanks again!
 
  • #4
BitterX said:
the null space of A is [itex]Sp[(1,0,0,0,0),(0,1,0,0,0)][/itex]

No, it's not.

the nullity of B is 1

No, it's not.

What made you think that?
 
  • #5
I guess I'm wrong, let me tell you what my train of thought was:

I took the original null space given, put it in a matrix and got to that, that's the basis of the
null space.
so the nullity is 2, and then rank(A) is 3 (because it's a 5x5 matrix)
because rank(B)>rank(A) , rank(B) is either 4 or 5. and it's nullity is 1 or 0.

I thought about a different way to prove it, but I need to prove that nullspace A, nullspace B,
are subspaces of nullspace AB.

if so: [itex]nullity(AB)=nullity(A)+nullity(B)-nullity(A\cap B)[/itex]

which means:
[itex]nullity(AB)\leq nullity(A)+nullity(B)[/itex]

because we know the nullity of both A and B (assuming I'm right)
[itex]nullity(AB)\leq 3[/itex]
using the rank nullity theorem:

[itex]\rho(AB)=n-nullity(AB)[/itex]

[itex]\rho(AB) \geq 2[/itex]

what do you think?
 

FAQ: Linear Algebra - Ranks and dimension

What is the rank of a matrix?

The rank of a matrix is the maximum number of linearly independent rows or columns in the matrix. It represents the dimension of the vector space spanned by the rows or columns of the matrix.

How is the rank of a matrix related to its dimensions?

The rank of a matrix cannot exceed the number of rows or columns in the matrix. Thus, the rank of a matrix is always less than or equal to the minimum of its row and column dimensions.

What does it mean for a matrix to have full rank?

A matrix is said to have full rank if its rank is equal to the minimum of its row and column dimensions. In other words, all of its rows and columns are linearly independent and the matrix spans its entire vector space.

Can a matrix with a higher rank be reduced to a matrix with a lower rank?

No, the rank of a matrix cannot be reduced. It is an intrinsic property of the matrix and is not affected by elementary row or column operations.

How is the rank of a matrix related to its determinant?

The rank of a matrix is equal to the number of non-zero eigenvalues of the matrix. Therefore, a matrix with a non-zero determinant has full rank, while a matrix with a zero determinant has a rank of 0.

Back
Top