##  [Rank](/rank-0) 

 Definition

The rank of a matrix or linear transformation is the dimension of its image (column space), equivalently the maximum number of linearly independent columns or rows. It measures how many independent directions the map sends input vectors to.

 

 

 

 

 

 





## Principle

Principle

Rank quantifies linear independence of outputs; for a linear map V→W between finite-dimensional vector spaces, rank + nullity = dim(domain) (rank–nullity theorem).

 

 

 

 

 





## Demonstration

Demonstration

Matrix B = [[1,2,3],[2,4,6]] has rank 1 because the second row is twice the first; the column space is one-dimensional.

 

 

 

 

## Misapplication

Misapplication

Assuming the number of nonzero entries approximates rank, or treating row count as rank without row-reduction; or using rank computed over a ring where module theory complicates dimension.

 

 

 

 

 





## Consequence

Consequence

Rank determines solvability of linear systems (consistent solutions require right-hand side in column space), informs invertibility (full rank means invertible for square matrices), and controls degrees of freedom in linear models.

 

 

 

 

## Reversal

Reversal

The opposite notion emphasizes deficiency: corank or nullity measures lost dimensions; a full-rank map has trivial kernel, while low-rank approximations reduce dimensionality.

 

 

 

 

 





## Boundary

Boundary

Defined for linear maps between finite-dimensional vector spaces and via various generalizations (operator rank, tensor rank); over modules or infinite-dimensional spaces nuance is required and some equalities fail.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Competes with 'tensor rank' (minimal decomposition into simple tensors) and numeric heuristic 'effective rank' used in approximations; these notions coincide in simple finite-matrix contexts but diverge in higher-order or structured settings.

 

 

 

 

 





## Synthesis

Synthesis

Rank is the dimension of the image of a linear operator: a coordinate-independent count of independent output directions that, together with nullity, partitions domain dimension and governs solvability and invertibility properties in finite-dimensional linear algebra.