Linear Algebra - Rank

Card Puncher Data Processing

About

Ordinal Data - Rank function (Ranking) in linear algebra

The rank of a set S of vectors is the dimension of Span S written:

  • rank S

rank = dim Span

Any set of D-vectors has rank at most |D|.

If rank(S) = len(S) then the vectors are linearly dependent (otherwise you will get len(S) > rank (S)).

Matrix

For a linear function Matrix f(x) = <MATH> \text{dim lm f = dim Col A = rank A} </MATH> where:

Example

No empty set of vectors

The vectors [1, 0, 0], [0, 2, 0], [2, 4, 0] are linearly dependent. Therefore their rank is less than three. First two of these vectors form a basis for the span of all three, so the rank is two.

empty set of vectors

The vector space Span {[0, 0, 0]} is spanned by an empty set of vectors. Therefore the rank of {[0, 0, 0]} is zero





Discover More
Card Puncher Data Processing
Linear Algebra - (Gaussian|Common) Elimination

Method illustrated in Chapter Eight of a Chinese text, The Nine Chapters on the Mathematical Art, that was written roughly two thousand years ago. Rediscovered in Europe by Isaac Newton (England) and Michel...
Card Puncher Data Processing
Linear Algebra - Authentication Challenge

Password Authentication challenge Password is an n-vector over GF(2) Send: Computer sends random n-vector a Response: Human sends back . Repeated until Computer is convinced that Human knowns...
Card Puncher Data Processing
Linear Algebra - Dimension of a vector space

The dimension of a vector space V is the size of a basis for that vector space written: dim V. rank If U is a subspace of W then D1: (or ) and D2: if then Example: Suppose V = Span...
Card Puncher Data Processing
Linear Algebra - Matrix

The Traditional notion of a matrix is: a two-dimensional array a rectangular table of known or unknown numbers One simple role for a matrix: packing together a bunch of columns or rows Matrix...
Card Puncher Data Processing
Linear Algebra - Span of a Vector Space

The set of all linear combinations of some vectors v1,...,vn is called the span of these vectors and contains always the origin. Example: Let V = Span {[0, 0, 1], [2, 0, 1], [4, 1, 2]}. A vector belongs...



Share this page:
Follow us:
Task Runner