definition
the rank of a matrix is the maximum number of independent vectors within any axes.
example
here , rank is .
express a column as a linear weighted combination (LWC) of another
as a LWC of and
then
as a LWC of and
then
as a LWC of and
and are on the same line, they are collinear, thus they can never be combined to obtain
a row as a linear weighted combination (LWC) of another
as a LWC of and
then
as a LWC of and
then
as a LWC of and
then
what is happening?
dependency—as rank of which it is the complement—is a property of the whole set of vectors that constitute a matrix.
the column set contains two collinear columns, and their relationship is apparent—even more because in the example it’s an integer relationship, whereas in the rows set the dependency is more subtle, because it is distributed between the three row vectors.
in the column set one column can not be expressed as a combination of the other two, which being collinear can move only within the line they both span and can be reciprocally be instead expressed as a multiple of the other;
in the row set there’s no single row that can be expressed as a multiple of another, but all three can in turn be expressed by a combination of the other two.
the dependency is thus an inherent property of the matrix that can express itself as various relationships between the row and column vectors.