Results 1 to 1 of 1

Thread: question involving matrix row column rank proof

  1. #1
    Member
    Joined
    Feb 2011
    Posts
    75

    question involving matrix row column rank proof

    Let A be an $\displaystyle m \times n$ matrix. If $\displaystyle k \leq m$ and $\displaystyle l \leq n$ , then a $\displaystyle k \times l$ matrix $\displaystyle B$ is said
    to be a submatrix of $\displaystyle A$, if$\displaystyle B$can be obtained from $\displaystyle A$ by deleting some set of $\displaystyle m-k$rows and $\displaystyle n-l$columns of $\displaystyle A$.
    if we define the determinantal rank of $\displaystyle A$ to be the largest $\displaystyle k$for which $\displaystyle A$ has a$\displaystyle k \times k$
    submatrix with non-zero determinant. Show that this is equal to the usual row or
    column rank of $\displaystyle A$.
    Last edited by mr fantastic; Mar 8th 2011 at 01:21 PM. Reason: Fixed a math tag.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: Oct 14th 2011, 08:59 PM
  2. Replies: 2
    Last Post: Feb 19th 2011, 06:57 AM
  3. Full Column rank of a partitioned matrix
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Oct 22nd 2009, 11:42 PM
  4. proof involving rank of a matrix
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Oct 20th 2009, 10:25 PM
  5. Short proof that rows-rank=column-rank?
    Posted in the Advanced Algebra Forum
    Replies: 6
    Last Post: Jun 26th 2009, 10:02 AM

Search Tags


/mathhelpforum @mathhelpforum