Linear Algebra : Operations and Properties

Study concepts, example questions & explanations for Linear Algebra

varsity tutors app store varsity tutors android store

Example Questions

Example Question #491 : Operations And Properties

Let f be a homomorphism from  to . Can f be 1-to-1?

(Hint: look at the dimension of the domain and co-domain)

Possible Answers:

Not enough information

Yes

No

Correct answer:

No

Explanation:

No, f can not be 1-to-1. The reason is because the domain has dimension 3 but the co-domain has dimension of 2. A mapping can not be 1-to-1 when the the dimension of the domain is greater than the dimension of the co-domain.

Example Question #492 : Operations And Properties

Often we can get information about a mapping by simply knowing the dimension of the domain and codomain.

Let f be a mapping from   to . Can f be onto?

(Hint look at the dimension of the domain and codomain)

Possible Answers:

Not enough information

Yes

No

Correct answer:

No

Explanation:

No, f cannot be onto. The reason is because the dimension of the domain (2) is less than the dimension of the codomain(3).

 

For a function to be onto, the dimension of the domain must be less than or equal to the dimension of the codomain.

Example Question #1 : Linear Mapping

The previous two problems showed how the dimension of the domain and codomain can be used to predict if it is possible for the mapping to be 1-to-1 or onto. Now we'll apply that knowledge to isomorphism.

Let f be a mapping such that . Also the vector space V has dimension 4 and the vector space W has dimension 8. What property of isomorphism can f NOT satisify.

Possible Answers:

t-to-1

Preserve vector addition

Preserve scalar multiplication

Onto

Correct answer:

Onto

Explanation:

f cannot be onto. The reason is because the domain, V, has a dimension less than the dimension of the codomain, W.

 

f can be 1-to-1 since the dimension of V is less-than-or-equal to the dimension of W. However, just because f can be 1-to-1 based off its dimension does not mean it is guaranteed. 

 

f preserves both vector addition and scalar multiplication because it was stated to be a homomorphism in the problem statemenet. The definition of a homomorphism is a mapping that preserves both vector addition and scalar multiplication.

Example Question #491 : Operations And Properties

Let f be a mapping such that where is the vector space of polynomials up to the term. (ie polynomials of the form )

 

Let f be defined such that

Is f a homomorphism?

Possible Answers:

Yes

No, because both scalar multiplication and vector addition is not preserved

No, because scalar multiplication is not preserved

No because vector addition is not preserved

Correct answer:

Yes

Explanation:

f is a homomorphism because it preserves both vector addition and scalar multiplication.

 

To show this we need to prove both statements

Proof f preserves vector addition

Let u and v be arbitrary vectors in with the form and

Consider . Applying the definition of f we get

This is the same thing as

 Hence, f preserves vector addition because

 

Proof f preserves scalar multiplication

 Let u be an arbitrary vector in with the form and let k be an arbitrary real constant. 

Consider

This is the same thing we get if we consider


Hence f preserves scalar multiplication because for all vectors u and scalars k.

Example Question #491 : Operations And Properties

Let f be a mapping such that where is the vector space of polynomials up to the term. (ie polynomials of the form )

 

Let f be defined such that

Is f an isomorphism?

(Hint: The last problem we showed this particular f is a homomorphism)

Possible Answers:

No, f doesn't preserve vector addition and scalar multiplication

Yes

No, f is not 1-to-1

No, f is not onto

Correct answer:

No, f is not onto

Explanation:

f is not onto. This is because not every vector in is in the image of f. For example, the vector is not in the image of f. Hence, f is not onto.

 

We could also see this quicker by looking at the dimension of the domain and codomain. The domain has dimension 2 and the codomain has dimension 3. A mapping can't be onto and have a domain with a lower dimension than the codomain.

 

Finally, we know f preserves vector addition and scalar multiplication because it is a homomorphism.

Example Question #871 : Linear Algebra

Consider the mapping  such that .

What is the the null space of ?

Possible Answers:

The vector

The line

Correct answer:

The vector

Explanation:

To find the null space consider the equation

This gives a system of equations

The only solution to this system is 

Thus the null space consists of the single vector

 

Example Question #14 : Linear Mapping

An important quantity for a linear map is the dimension of its image. This is called the rank.

Consider the mapping  such that .

What is the the rank of ?

Possible Answers:

Correct answer:

Explanation:

To find the rank of , we first find the image of . The image of  is any vector of form  where a is any real number. This is a line in . Therefore the image of  is a 1 dimensional subspace. Thus the answer is 1.

Example Question #491 : Operations And Properties

Consider the mapping  such that .

What is the the rank of ?

Possible Answers:

Correct answer:

Explanation:

The image is the space spanned by the vectors  and . The image has a basis of  vectors. Therefore the image has dimension .  Thus the rank is .

Example Question #871 : Linear Algebra

The dimension of the domain can be used to learn about the dimension of the null space and the rank of a linear map. 

Let  be a linear map such that . What is the maximum possible rank of .

Possible Answers:

Correct answer:

Explanation:

The maximum possible rank of a function is the dimension of the domain. The domain of  is . Therefore the maximum possible rank of  is .

Example Question #17 : Linear Mapping

The dimension of the domain can be used to learn about the dimension of the null space and the rank of a linear map. 

Let  be a linear map such that . What is the maximum dimension of the null space of ?

Possible Answers:

2

3

0

1

4

Correct answer:

2

Explanation:

The null space is the subspace such that  maps to the zero vector in the codomain. The largest possible null space is when the entire domain goes to the zero vector. The domain of  is  . Therefore the largest possible null space would be   which has a dimension of . Thus the largest possible dimension for the null space is .

Learning Tools by Varsity Tutors