Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (anonymous):

What is the rank of a matrix?

OpenStudy (anonymous):

THe dimension of column space A

OpenStudy (anonymous):

In simple terms it's asking you how many pivot points are in the matrix.

OpenStudy (anonymous):

When you try to find the Column A you reduce to echelon form the matrix and find the pivot columns and those pivot columns make up Col A.

OpenStudy (anonymous):

Rank of a matrix is an integer \(n\ge 1 \) such that there is at least one minor of order n which is not singular and every minor greater than \( n \) is singular.

OpenStudy (anonymous):

Okay, how would you use this to determine whether a linear system with the given augmented matrix has a unique solution infinitly many solutions or no solutions?

OpenStudy (anonymous):

Well if you have a square matrix if the rank is equal to n then you have a unique solution.

OpenStudy (anonymous):

By using Rouché–Capelli theorem. http://en.wikipedia.org/wiki/Rouch%C3%A9%E2%80%93Capelli_theorem

OpenStudy (anonymous):

Never heard of that theorem weird.

OpenStudy (anonymous):

In simple words. You have a matrix A mXn . The matrix is unique if the Rank A=n The matrix is infinity if the Rank A<n For no solution you need more information.

OpenStudy (anonymous):

Can you give me more examples!

OpenStudy (anonymous):

M= 3 -2 0 1 | 1 1 2 -3 1 |-1 2 4 -6 2 | 0

OpenStudy (anonymous):

You are trying to find the Rank M?

OpenStudy (anonymous):

Or see if it has a unique or infinite solutions?

OpenStudy (anonymous):

Yes

OpenStudy (anonymous):

to see whether the linear system with the given augmented matrix has a unique solution infinitly many solutions or no solutions

OpenStudy (anonymous):

Well you don't really need to know rank in order to know the solution. Do you know how to reduce it to echelon form?

OpenStudy (anonymous):

yeah, but i need to know how to do it using the rank method so i know how to use it in general...

OpenStudy (anonymous):

Well the answer is no solution but you can't know that with simply using rank.

OpenStudy (anonymous):

okay, i see, thanks

OpenStudy (anonymous):

http://en.wikipedia.org/wiki/Rouch%C3%A9%E2%80%93Capelli_theorem see you can know if there is a unique solution or infinite but you can't know if there is no solution.

OpenStudy (anonymous):

if your teacher told you that you can know if there is no solution by knowing the rank of the matrix I suggest you challenge him/her =)

OpenStudy (anonymous):

lol, will do!

OpenStudy (anonymous):

Make sure you have your best troll face on when you do.

OpenStudy (anonymous):

Actually you can know, if a system is inconsistent (i.e., no solution exists) via rank of the coefficient matrices.

OpenStudy (anonymous):

Ref: http://www.math.tamu.edu/~fnarc/psfiles/rank2005.pdf

OpenStudy (anonymous):

I guess you can but like I said before I see no advantage in using Rank to know if an augmented matrix has a solution or not. Seems like a waste of work.

OpenStudy (anonymous):

Like for your example I can tell that there is no solution because the second row is a scalar multiple of the third and if you row reduce that you get a zero row for the matrix that equals a value which means no solution. Again I don't know the Rank and doing so will require more work,

OpenStudy (anonymous):

you said something else before and this is a very useful tool.

OpenStudy (anonymous):

@SockPuppet WOW! something just clicked in my head!!!

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!