# Definition:Rank (Linear Algebra)

## Definition

### Linear Transformation

Let $\phi$ be a linear transformation from one vector space to another.

Let the image of $\phi$ be finite-dimensional.

Then its dimension is called the **rank of $\phi$** and is denoted $\map \rho \phi$.

### Matrix

### Definition 1

Let $K$ be a field.

Let $\mathbf A$ be an $m \times n$ matrix over $K$.

Then the **rank** of $\mathbf A$, denoted $\map \rho {\mathbf A}$, is the dimension of the subspace of $K^m$ generated by the columns of $\mathbf A$.

That is, it is the dimension of the column space of $\mathbf A$.

### Definition 2

Let $K$ be a field.

Let $\mathbf A$ be an $m \times n$ matrix over $K$.

Let $\mathbf A$ be converted to echelon form $\mathbf B$.

Let $\mathbf B$ have exactly $k$ non-zero rows.

Then the **rank** of $\mathbf A$, denoted $\map \rho {\mathbf A}$, is $k$.

### Definition 3

Let $K$ be a field.

Let $\mathbf A$ be an $m \times n$ matrix over $K$.

The **rank** of $\mathbf A$, denoted $\map \rho {\mathbf A}$ is the largest number of elements in a linearly independent set of rows of $\mathbf A$.

This article is complete as far as it goes, but it could do with expansion.In particular: These definitions can be proved compatible (by viewing a matrix as a lin. transform., and maybe vice versa); such is a typical PW entry. Also, cf. Definition:Finite Rank OperatorYou can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{Expand}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |