All Linear Algebra Resources
Example Questions
Example Question #11 : Range And Null Space Of A Matrix
What is the largest possible rank of a  matrix?
None of the other answers
The rank is equal to the dimension of the row space and the column space (both spaces always have the same dimension). This matrix has seven rows and two columns, which means the largest possible number of vectors in a basis for the column space of a  matrix isÂ
, so this is the largest possible rank.
Example Question #12 : Range And Null Space Of A Matrix
What is the smallest possible nullity of a  matrix?
None of the other answers
According to the Rank + Nullity Theorem,Â
Since the matrix has  columns, we can rearrange the equation to get
So to make the nullity as small as possible, we need to make the rank as large as possible.
The rank is equal to the dimension of the row space and the column space (both spaces always have the same dimension). This matrix has three rows and five columns, which means the largest possible number of vectors in a basis for the row space of a  matrix isÂ
, so this is the largest possible rank.
Hence the smallest possible nullity is .
Example Question #302 : Operations And Properties
A matrix  with five rows and four columns has rank 3.
What is the nullity of ?
The sum of the rank and the nullity of any matrix is always equal to to the number of columns in the matrix. Therefore, a matrix with four columns and rank 3, such as , must have as its nullityÂ
.
Example Question #14 : Range And Null Space Of A Matrix
, the set of all continuous functions defined onÂ
, is a vector space under the usual rules of addition and scalar multiplication.
True or false: The set of all functions of the formÂ
,
where  is a real number, is a subspace ofÂ
.
False
True
True
A subset  of a vector space is a subspace of that vector space if and only if it meets two criteria. Both will be given and tested, lettingÂ
.
This can be rewritten as
One criterion for  to be a subspace is closure under addition; that is:
If , thenÂ
.
Let  as defined. Then for some realÂ
:
It follows that .
The second criterion for  to be a subspace is closure under scalar multiplication; that is:
If , thenÂ
Let  as defined. Then for some realÂ
:
It follows thatÂ
, as defined, is a subspace ofÂ
.
Example Question #12 : Range And Null Space Of A Matrix
, the set of all continuous functions defined onÂ
, is a vector space under the usual rules of addition and scalar multiplication.
True or false: The set of all functions of the formÂ
,
where  is a real number, is a subspace ofÂ
.
False
True
False
A subset  of a vector space can be proved to not be a subspace of the space by showing that the zero of the space is not inÂ
.Â
Let  be the subset in question, and letÂ
, the zero function, which is inÂ
. This cannot be expressed asÂ
 for anyÂ
. It if could then
, in which caseÂ
,
and
, in which caseÂ
.
By contradiction, .Â
 is not a subspace ofÂ
.
Example Question #13 : Range And Null Space Of A Matrix
, the set of all continuous functions defined onÂ
, is a vector space under the usual rules of addition and scalar multiplication.
True or false: The set of all functions of the formÂ
where  is a real number, is a subspace ofÂ
.
True
False
False
Let .
We can show through counterexample that this is not a subspace of .
Let . This is an element ofÂ
.
One condition for  to be a subspace of a vector space is closure under scalar multiplication. Multiply
 by scalarÂ
. The product is the functionÂ
.
.
This violates a criterion for a subspace, so  is not a subspace ofÂ
.
Â
Example Question #12 : Range And Null Space Of A Matrix
, the set of all continuous functions defined onÂ
, is a vector space under the usual rules of addition and scalar multiplication.
True or false: The set of all functions defined on  with inverses is a subspace ofÂ
.
False
True
False
Let  be the set of all functions
 onÂ
 such thatÂ
 is defined.Â
A sufficient condition for  to not be a subspace ofÂ
 is that the zero of the set - which here is the zero function
 - is not inÂ
.
 because the zero function - a constant function - does not have an inverse (Â
, violating a condition of an invertible function). It follows thatÂ
 is not a subspace of Â
.
Example Question #12 : Range And Null Space Of A Matrix
, the set of all continuous real-valued functions defined onÂ
, is a vector space under the usual rules of addition and scalar multiplication.Â
Let  be the set of all functions of the formÂ
True or false: Â is a subspace ofÂ
.
True
False
True
A set  is a subspace of a vector space if and only if two conditions hold, both of which are tested here.
The first condition is closure under addition - that is:
If , thenÂ
Let  as defined. Then for someÂ
,
Â
and
.
or
,
. The first condition is met.
Â
The second condition is closure under scalar multiplication - that is:
If  andÂ
 is a scalar, thenÂ
Let  as defined. Then for someÂ
,Â
For any scalar ,
,
and
. The second condition is met.Â
, as defined, is a subspace.
Example Question #19 : Range And Null Space Of A Matrix
, the set of all continuous real-valued functions defined onÂ
, is a vector space under the usual rules of addition and scalar multiplication.Â
Let  be the set of all functions of the formÂ
for some realÂ
True or false:Â Â is a subspace ofÂ
.
True
False
True
A set  is a subspace of a vector space if and only if two conditions hold, both of which are tested here.
The first condition is closure under addition - that is:
If , thenÂ
Let  as defined. Then for someÂ
,
and
ThenÂ
orÂ
or
. The first condition is met.
The second condition is closure under scalar multiplication - that is:
If  andÂ
 is a scalar, thenÂ
Let  as defined. Then for someÂ
,Â
For any scalar ,
or
. The second condition is met.Â
, as defined, is a subspace.
Â
Example Question #12 : Range And Null Space Of A Matrix
If  is anÂ
 matrix, find
Since a basis for the row space and the column space of a matrix have the same, number of vectors then their dimensions are the same, say .
By the rank-nullity theorem, we have , or same to say
.
.
Hence .
Finally, applying the rank-nullity theorem to the transpose of , we have
, or the same to say
.
 (The row space dimension ofÂ
 is the same as its transpose.)
.
Adding all four of our findings together gives us
.
Â
All Linear Algebra Resources
