Linear Algebra : Linear Algebra

Study concepts, example questions & explanations for Linear Algebra

varsity tutors app store varsity tutors android store

Example Questions

Example Question #42 : Matrices

Find the product .

Possible Answers:

 cannot be multiplied.

Correct answer:

 cannot be multiplied.

Explanation:

 If  is an  matrix and  is an  matrix, 

 can only be multiplied if , or the number of columns in  equals the number of rows in .  Otherwise there is a mismatch, and the two matrices can not be multiplied.   will be an  matrix

Since  is a  matrix and  is a  matrix,  so  cannot be multiplied. 

Example Question #731 : Linear Algebra

True or false:

 is an example of an idempotent matrix.

Possible Answers:

False

True

Correct answer:

True

Explanation:

 is an idempotent matrix, by definition, if . Multiply  by itself by multiplying rows by columns - multiplying elements in corresponding positions and adding the products:

.

, making  idempotent.

Example Question #732 : Linear Algebra

True or false:

 is an example of an idempotent matrix.

Possible Answers:

False

True

Correct answer:

False

Explanation:

 is an idempotent matrix, by definition, if . Multiply  by itself by multiplying rows by columns - multiplying elements in corresponding positions and adding the products:

, so  is not idempotent.

Example Question #733 : Linear Algebra

For any given value , how many  nonsingular idempotent matrices exist?

Possible Answers:

Zero

Infinitely many 

One

Two

Correct answer:

One

Explanation:

 is nonsingular, by definition, if it has an inverse - that is, if  exists.  is an idempotent matrix, by definition, if 

 

Premultiplying both sides of the equation by , we get

,

where  is the  identity matrix.

Matrix multiplication is associative, so 

.

Therefore, the only nonsingular idempotent matrix of a given dimension  is the identity.

Example Question #734 : Linear Algebra

Markov 2

The above diagram shows a board for a game of chance. A player moves according to the flip of a fair coin, depending on his current location. For example, if he is on the green square, he will move to the orange square if the coin comes up heads, and to the pink square if it comes up tails.

Construct a stochastic matrix that models this game, with the rows/columns representing, in order, the orange, pink, blue, and green squares. 

Possible Answers:

Correct answer:

Explanation:

Since the coin is fair, each outcome will come up with probability 0.5. Therefore, a player on orange end up on orange or pink with 0.5 probability each; a player on pink will end up on orange or blue with probability 0.5 each;  a player on blue will end up on pink or green with probability 0.5 each; and a player on green will end up on orange or pink with probability 0.5 each. The matrix that models this is

.

Example Question #735 : Linear Algebra

Markov 2

It is recommended that you use a calculator with matrix arithmetic capability for this problem.

The above diagram shows a board for a game of chance. A player moves according to the flip of a fair coin, depending on his current location. For example, if he is on the green square, he will move to the orange square if the coin comes up heads, and to the pink square if it comes up tails.

The player agrees to start on the pink square. Which square is he most likely to end up on after eight moves? 

Possible Answers:

Orange

Pink 

Green

Blue

Correct answer:

Orange

Explanation:

Since the coin is fair, each outcome will come up with probability 0.5. Therefore, a player on orange end up on orange or pink with 0.5 probability each; a player on pink will end up on orange or blue with probability 0.5 each;  a player on blue will end up on pink or green with probability 0.5 each; and a player on green will end up on orange or pink with probability 0.5 each. The matrix that models this is

.

The matrix that models the probabilities that the player will end up on a given square, given that he starts on a particular square, is , which through calculation is 

Since the player is starting on pink, examine the second column; the greatest entry is in the second row, which represents ending up on orange.

Example Question #51 : Matrix Matrix Product

True or false: A matrix whose determinant is neither 0 nor 1 cannot be an idempotent matrix.

Possible Answers:

False

True

Correct answer:

True

Explanation:

 is an idempotent matrix, by definition, if . Since the determinant of the product of two matrices is equal to the product of their determinants, it follows that

and, since 

 .

By transitivity, 

.

The only two numbers equal to their own squares are 0 and 1, so 

 or .

This makes the statement true.

Example Question #732 : Linear Algebra

.

Calculate .

Possible Answers:

 is undefined.

Correct answer:

Explanation:

, the conjugate transpose of , can be found by first taking the transpose of :

so

then changing each element to its complex conjugate:

Find the product  by multiplying the rows of  by the columns of ; that is, add the product of the terms in corresponding positions:

Example Question #732 : Linear Algebra

Calculate .

Possible Answers:

 is undefined.

Correct answer:

Explanation:

, the transpose of , is the result of switching the rows of  with the columns. 

so

Find the product  by multiplying the rows of  by the columns of ; that is, add the product of the terms in corresponding positions:

Example Question #731 : Linear Algebra

Always, sometimes, or never: .

Give the answer for both square and nonsquare matrices.

Possible Answers:

Square: Always 

Nonsquare: Sometimes

Square: Sometimes

Nonsquare: Sometimes

Square: Always 

Nonsquare: Never

Square: Sometimes

Nonsquare: Never

Square: Never

Nonsquare: Never

Correct answer:

Square: Sometimes

Nonsquare: Never

Explanation:

The statement cannot be true for nonsquare matrices. For  to be defined, the number of columns in  must be equal to the number of rows in ; for  to be defined, the reverse must hold. It follows that  and  must be  and  matrices, respectively.

The product of two matrices has the same number of rows as the former matrix and the same number of columns as the latter. Therefore,  is an  matrix and  is an  matrix. If , then  and  do not even have the same dimensions. Therefore,  is always false for nonsquare matrices.

We now show that  for some, but not all square matrices. If, it easily follows that , since . Now let 

 and .

The products are

and

. Since at least one case exists in which  and at least one case exists in which , the statement  is sometimes true for square matrices.

Learning Tools by Varsity Tutors