Matrix Rank

Linear Algebra

Intro: We row-reduce to echelon/RREF, count pivot positions, and identify dependent columns. Works for rectangular matrices.

Worked example

FAQs

Rectangular matrices?

Yes. Rank is at most min(m,n) for an m×n matrix.


How do pivots relate to independence?

Pivot columns (in the original matrix) form a linearly independent set; non-pivot columns are linear combinations of pivot columns.


Does scaling a row change rank?

No. Elementary row operations (swap, scale by nonzero, add multiple of a row to another) preserve rank.


Rank and solutions?

For Ax=b, compare rank(A) and rank([A|b]): equal ranks → consistent; if rank(A)=rank([A|b])=n, unique solution; if equal but < n, infinitely many; if unequal, inconsistent.


Why choose Mathix?

Matrix rank

Related