Welcome to dextri.com on July 6 2009.
This is an internet experiment running to monitor browsing habbits of individuals through wikipedia contents.

Talk:Rank (linear algebra)

From Wikipedia, the free encyclopedia

Jump to: navigation, search

I was rather surprised by the statement in the article that the rank "is usually denoted rk(A)". So I checked some books, with the following result:

  • Most books actually do not introduce a notation for the rank of a matrix.
  • Five books use rank A, namely Linear Algebra and Geometry by Bloom, Topics in Matrix Analysis by Horn and Johnson, Linear Algebra by Friedberg et al., Linear Algebra by Satiste, and Berkeley Problems in Mathematics by De Souza and Silv.
  • Three books use rk(A), namely Elements of Linear Algebra by Cohn, Linear Algebra by Jänich, and Linear Algebra by Kaye and Wilson.
  • Two books use r(A), namely Linear Programming by Hartley, and Linear Algebra with Applications by Scheich.

I changed the article accordingly. -- Jitse Niesen 23:44, 21 Aug 2003 (UTC)

wow there is only seven books in existence on this subject? ;) --LeakeyJee (talk) 13:14, 5 June 2008 (UTC)

Contents

[edit] Rank of the product of two matrices

The Rank (linear algebra) page states:

  • If B is an n-by-k matrix with rank n, then AB has the same rank as A.
  • If C is an l-by-m matrix with rank m, then CA has the same rank as A.

Does anyone have a proof (or reference to a proof) for this? Maybe it's obvious and I'm just not seeing it. Connelly 15:49, 7 September 2005 (UTC)

It's not that obvious. Sketch of the proof: Think of the matrices as linear transformations. If B is an n-by-k matrix with rank n, then the function x |-> Bx is surjective, hence the range of the function x |-> ABx is the same as the range of the function x |-> Ax, hence the ranks are equal. I'll see whether I can find a reference (rectangular matrices always confuse me). Let me know if you want me to elaborate. PS: Thanks for your edit to Hermitian matrix. -- Jitse Niesen (talk) 16:25, 7 September 2005 (UTC)
It follows from (0.4.5c) in Horn & Johnson, Matrix Analysis, which states (without proof): If A is m-by-n and B is n-by-k then
 \operatorname{rank} \, A + \operatorname{rank} \, B - n \le \operatorname{rank} \, AB \le \min \{ \operatorname{rank} \, A, \operatorname{rank} \, B \}.
If rank B = n, then this becomes rank A ≤ rank AB ≤ rank A. -- Jitse Niesen (talk) 19:49, 7 September 2005 (UTC)
Wow, thanks! I didn't expect a response so soon. Your proof works for me, but I'll check out the Matrix Analysis book too. I'm actually trying to show a more complex result, but I needed to check the validity of the Wikipedia statement first. I can post up your linear transformation proof on Wikipedia if you think that's a good idea (not really sure where to put it...maybe the Rank page or as a separate page linked to from Rank?). - Connelly 23:35, 7 September 2005 (UTC)
I think the proof would make a nice addition if it's kept short, because it explains the concept of rank and how to handle it. It's probably more important to mention the double inequality for rank AB (by the way, how hard would it be to prove that?). Generally, proofs on Wikipedia are a contentious issue and need to be considered on a case-by-case basis (how important is the proof and how much does it disrupt the flow of the article?). You can read a discussion about it on Wikipedia:WikiProject Mathematics/Proofs, which also has a proposal for putting proofs on a separate page. -- Jitse Niesen (talk) 12:16, 8 September 2005 (UTC)
There is a proof at http://books.google.com/books?id=5U6loPxlvQkC&printsec=frontcover at page 95. --Dagcilibili (talk) 18:50, 2 December 2008 (UTC)

[edit] Matrix rank definition with minor

Another definition of matrix rank:

The matrix A has rank r if it has a minor of size r which is different from zero and every minor of size r + 1 is equal to zero.

[edit] Ring question

The article says There are different generalisations of the concept of rank to matrices over arbitrary rings. In those generalisations, column rank, row rank, dimension of column space and dimension of row space of a matrix may be different from the others or may not exist. It doesn't distinguish between rings and commutative rings. Is it true that the generalisation to just commutative rings also has all of these issues? (it seems likely, and if it is true I think it would be useful to mention it since it would make the statement much stronger) A5 18:28, 19 March 2006 (UTC)

I realise this request is quite old now, but I also think that some more information on the definitions of rank for different classes of rings would be helpful. In my case, this is motivated by a need for information on which of these definitions cease to be equivalent for commutative rings with 1. —Preceding unsigned comment added by 128.40.159.177 (talk) 17:24, 15 July 2008 (UTC)

[edit] How about "rank deficient"

I think the page should mention the term "rank deficient". MusicScience 23:32, 12 January 2007 (UTC)

Term sounds familiar, and has the benefit of being self-explanatory. However, a quick Google search for 'intitle:"matrix algebra" "rank deficient"' finds only 7 distinct websites. Sources? References? Textbooks? -- JEBrown87544 18:19, 17 January 2007 (UTC)


--it would be helpful to show the relationship between rank and row space. -EH —Preceding unsigned comment added by 128.135.96.110 (talk)

[edit] Relation to condition number?

It seems like the rank is related to the condition number in that the rank describes the number of nonzero eigenvalues whereas the condition number describes the range of those eigenvalues. For practical purposes, if the eigenvalues, normalized by the largest, are (1.0, 0.9, 0.5, 1e-5, 1e-6), the rank is effectively three. Is there a page about this idea, relaxing the definition of "rank" to mean "very small eigenvalue"? Should condition number be in the see-also list on this page? —Ben FrantzDale (talk) 19:18, 20 October 2008 (UTC)

[edit] False statement

In the article it states that the rank of A is equal to the rank of A^T.A. This is clearly false. Take for example the column matrix (1 \\ 1) over the field of two elements. Then A^T.A = (0). It's true over the reals, and the given proof only works over the reals. - Dave Benson, Aberdeen, 15 Mar 2009 —Preceding unsigned comment added by 86.166.25.60 (talk) 08:15, 15 March 2009 (UTC)

Right. That list probably includes more properties that are only true over the reals or complex numbers. However, I don't have intuition for matrices over other fields, so I did'nt check them all. To be sure I added a bit at the start saying that we assume that the field is R or C. -- Jitse Niesen (talk) 14:08, 15 March 2009 (UTC)
Personal tools

Visit joltnews for the latest headlines
Visit bloit.com for company information
Geed Media does computer consulting on long island.
This page viewed times. See Logs