06.09.2021 Views

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

9.1. <strong>Algebra</strong>ic Considerations 459<br />

• We first show that M 2,3 is closed under scalar multiplication. That is, we show that cA a2×3matrix.<br />

[ ]<br />

a11 a<br />

cA = c 12 a 13<br />

a 21 a 22 a 23<br />

[ ]<br />

ca11 ca<br />

=<br />

12 ca 13<br />

ca 21 ca 22 ca 23<br />

This is a 2 × 3matrix<strong>in</strong>M 2,3 which proves that the set is closed under scalar multiplication.<br />

• The rema<strong>in</strong><strong>in</strong>g axioms of scalar multiplication follow from properties of scalar multiplication of<br />

matrices. Therefore M 2,3 satisfies the axioms of scalar multiplication.<br />

In conclusion, M 2,3 satisfies the required axioms and is a vector space.<br />

♠<br />

While here we proved that the set of all 2 × 3 matrices is a vector space, there is noth<strong>in</strong>g special about<br />

this choice of matrix size. In fact if we <strong>in</strong>stead consider M m,n ,thesetofallm × n matrices, then M m,n is a<br />

vector space under the operations of matrix addition and scalar multiplication.<br />

We now exam<strong>in</strong>e an example of a set that does not satisfy all of the above axioms, and is therefore not<br />

a vector space.<br />

Example 9.7: Not a Vector Space<br />

Let V denote the set of 2 × 3 matrices. Let addition <strong>in</strong> V be def<strong>in</strong>ed by A + B = A for matrices A,B<br />

<strong>in</strong> V. Let scalar multiplication <strong>in</strong> V be the usual scalar multiplication of matrices. Show that V is<br />

not a vector space.<br />

Solution. In order to show that V is not a vector space, it suffices to f<strong>in</strong>d only one axiom which is not<br />

satisfied. We will beg<strong>in</strong> by exam<strong>in</strong><strong>in</strong>g the axioms for addition until one is found which does not hold. Let<br />

A,B be matrices <strong>in</strong> V .<br />

• We first want to check if addition is closed. Consider A + B. By the def<strong>in</strong>ition of addition <strong>in</strong> the<br />

example, we have that A + B = A. S<strong>in</strong>ceA is a 2 × 3 matrix, it follows that the sum A + B is <strong>in</strong> V,<br />

and V is closed under addition.<br />

• We now wish to check if addition is commutative. That is, we want to check if A + B = B + A for<br />

all choices of A and B <strong>in</strong> V . From the def<strong>in</strong>ition of addition, we have that A + B = A and B + A = B.<br />

Therefore, we can f<strong>in</strong>d A, B <strong>in</strong> V such that these sums are not equal. One example is<br />

A =<br />

[ 1 0 0<br />

0 0 0<br />

Us<strong>in</strong>g the operation def<strong>in</strong>ed by A + B = A, wehave<br />

]<br />

,B =<br />

[ 0 0 0<br />

1 0 0<br />

A + B = A<br />

[ ]<br />

1 0 0<br />

=<br />

0 0 0<br />

]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!