Linear Algebra : Operations and Properties

Study concepts, example questions & explanations for Linear Algebra

varsity tutors app store varsity tutors android store

Example Questions

1 2 46 47 48 49 50 51 52 54 Next →

Example Question #48 : Linear Mapping

is the set of all two-by-two matrices.

Define the linear mapping as follows:

True or false: is one-to-one and onto.

Possible Answers:

False; is onto but not one-to-one 

False; is neither one-to-one nor onto

True

False; is one-to-one but not onto

Correct answer:

True

Explanation:

The domain and the codomain of are identical, so is one to one if and only if it is onto. It suffices to test either condition; so it will be determined whether is onto.

is onto if, for each , there exists such that . Let

Then, if

,

then

.

is onto; it follows that is also one-to-one.

Example Question #49 : Linear Mapping

is the set of all two-by-two matrices.

Define the mapping as follows:

True or false: is a linear mapping.

Possible Answers:

True

False

Correct answer:

True

Explanation:

is a linear mapping if two conditions hold:

Additivity:

For all

 Homogeneity:

For all  and scalar ,

 

First, test for additivity.

Let

Then

 and ,

and

.

 

Additivity is satisfied.

 

Now test for homogeneity. Let be a scalar. Then

.

Homogeneity is satisfied.

is a linear mapping.

Example Question #42 : Linear Mapping

is the set of all polynomials of finite degree in .

Define mapping  as follows:

True or false: is a linear mapping.

Possible Answers:

False

True

Correct answer:

False

Explanation:

is a linear mapping if two conditions hold:

Additivity:

For all 

 Homogeneity:

For all  and scalar ,

 

Homogeneity can be disproved through counterexample.

Let and ..

Then

,

and

However

,

so homogeneity does not hold in general. is not a linear mapping.

Example Question #51 : Linear Mapping

 is the set of all two-by-one matrices - that is, the set of all column matrices with two entries.

Let . Define a linear mapping  as follows:

.

True or false: is one-to-one and onto.

Possible Answers:

False;  is one-to-one but not onto

False;  is onto but not one-to-one

False;  is neither one-to-one nor onto

True

Correct answer:

False;  is neither one-to-one nor onto

Explanation:

The domain and the codomain of are identical, so is one to one if and only if it is onto.

A necessary and sufficient condition for to be one-to-one is that the kernel of be . In  , the zero element is , and this condition states that if

, then

Thus, we can prove that is not one-to-one - and not onto - by finding a nonzero column matrix  such that .

Set . Then

There is at least one nonzero column matrix in the kernel of , so is not one-to-one or onto.

Example Question #52 : Linear Mapping

 is the set of all polynomials of finite degree in .

Define a linear mapping as follows:

.

True or false: is a one-to-one and onto linear mapping.

Possible Answers:

False: is onto but not one-to-one.

False: is neither one-to-one nor onto.

True

False: is one-to-one but not onto.

Correct answer:

False: is onto but not one-to-one.

Explanation:

The domain and the codomain are both of infinite dimension, so it is possible for be one-to-one, onto, both, or neither.

is one-to-one if and only if

 implies .

Let and

Then

 and .

Since

, but , is not one-to-one.

Now let , where finitely many are nonzero.If

,

then

is therefore onto.

1 2 46 47 48 49 50 51 52 54 Next →
Learning Tools by Varsity Tutors