# fcla / src / section-VS.xml

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 
Vector Spaces

In this section we present a formal definition of a vector space, which will lead to an extra increment of abstraction. Once defined, we study its most basic properties.

Vector Spaces

Here is one of the two most important definitions in the entire course.

Vector Space

Suppose that $V$ is a set upon which we have defined two operations: (1) vector addition, which combines two elements of $V$ and is denoted by +, and (2) scalar multiplication, which combines a complex number with an element of $V$ and is denoted by juxtaposition. Then $V$, along with the two operations, is a vector space over $\complexes$ if the following ten properties hold. Additive Closure If $\vect{u},\,\vect{v}\in V$, then $\vect{u}+\vect{v}\in V$. Scalar Closure If $\alpha\in\complex{\null}$ and $\vect{u}\in V$, then $\alpha\vect{u}\in V$. Commutativity If $\vect{u},\,\vect{v}\in V$, then $\vect{u}+\vect{v}=\vect{v}+\vect{u}$. Additive Associativity If $\vect{u},\,\vect{v},\,\vect{w}\in V$, then $\vect{u}+\left(\vect{v}+\vect{w}\right)=\left(\vect{u}+\vect{v}\right)+\vect{w}$. Zero Vector There is a vector, $\zerovector$, called the zero vector, such that $\vect{u}+\zerovector=\vect{u}$ for all $\vect{u}\in V$. Additive Inverses If $\vect{u}\in V$, then there exists a vector $\vect{-u}\in V$ so that $\vect{u}+ (\vect{-u})=\zerovector$. Scalar Multiplication Associativity If $\alpha,\,\beta\in\complex{\null}$ and $\vect{u}\in V$, then $\alpha(\beta\vect{u})=(\alpha\beta)\vect{u}$. Distributivity across Vector Addition If $\alpha\in\complex{\null}$ and $\vect{u},\,\vect{v}\in V$, then $\alpha(\vect{u}+\vect{v})=\alpha\vect{u}+\alpha\vect{v}$. Distributivity across Scalar Addition If $\alpha,\,\beta\in\complex{\null}$ and $\vect{u}\in V$, then $(\alpha+\beta)\vect{u}=\alpha\vect{u}+\beta\vect{u}$. One If $\vect{u}\in V$, then $1\vect{u}=\vect{u}$.

The objects in $V$ are called vectors, no matter what else they might really be, simply by virtue of being elements of a vector space.

Now, there are several important observations to make. Many of these will be easier to understand on a second or third reading, and especially after carefully studying the examples in .

An axiom is often a self-evident truth. Something so fundamental that we all agree it is true and accept it without proof. Typically, it would be the logical underpinning that we would begin to build theorems upon. Some might refer to the ten properties of as axioms, implying that a vector space is a very natural object and the ten properties are the essence of a vector space. We will instead emphasize that we will begin with a definition of a vector space. After studying the remainder of this chapter, you might return here and remind yourself how all our forthcoming theorems and definitions rest on this foundation.

As we will see shortly, the objects in $V$ can be anything, even though we will call them vectors. We have been working with vectors frequently, but we should stress here that these have so far just been column vectors scalars arranged in a columnar list of fixed length. In a similar vein, you have used the symbol + for many years to represent the addition of numbers (scalars). We have extended its use to the addition of column vectors and to the addition of matrices, and now we are going to recycle it even further and let it denote vector addition in any possible vector space. So when describing a new vector space, we will have to define exactly what + is. Similar comments apply to scalar multiplication. Conversely, we can define our operations any way we like, so long as the ten properties are fulfilled (see ).

In , the scalars do not have to be complex numbers. They can come from what are called in more advanced mathematics, fields (see for more on these objects). Examples of fields are the set of complex numbers, the set of real numbers, the set of rational numbers, and even the finite set of binary numbers, $\set{0,\,1}$. There are many, many others. In this case we would call $V$ a vector space over (the field) $F$.

A vector space is composed of three objects, a set and two operations. Some would explicitly state in the definition that $V$ must be a non-empty set, but we can infer this from , since the set cannot be empty and contain a vector that behaves as the zero vector. Also, we usually use the same symbol for both the set and the vector space itself. Do not let this convenience fool you into thinking the operations are secondary!

This discussion has either convinced you that we are really embarking on a new level of abstraction, or they have seemed cryptic, mysterious or nonsensical. You might want to return to this section in a few days and give it another read then. In any case, let's look at some concrete examples now.

Examples of Vector Spaces

Our aim in this subsection is to give you a storehouse of examples to work with, to become comfortable with the ten vector space properties and to convince you that the multitude of examples justifies (at least initially) making such a broad definition as . Some of our claims will be justified by reference to previous theorems, we will prove some facts from scratch, and we will do one non-trivial example completely. In other places, our usual thoroughness will be neglected, so grab paper and pencil and play along.

The vector space $\complex{m}$

Set: $\complex{m}$, all column vectors of size $m$, .

Equality: Entry-wise, .

Scalar Multiplication: The usual scalar multiplication, given in .

Does this set with these operations fulfill the ten properties? Yes. And by design all we need to do is quote . That was easy.

The vector space of matrices, $M_{mn}$

Set: $M_{mn}$, the set of all matrices of size $m\times n$ and entries from $\complex{\null}$, .

Equality: Entry-wise, .

Scalar Multiplication: The usual scalar multiplication, given in .

Does this set with these operations fulfill the ten properties? Yes. And all we need to do is quote . Another easy one (by design).

So, the set of all matrices of a fixed size forms a vector space. That entitles us to call a matrix a vector, since a matrix is an element of a vector space. For example, if $A,\,B\in M_{3,4}$ then we call $A$ and $B$ vectors, and we even use our previous notation for column vectors to refer to $A$ and $B$. So we could legitimately write expressions like \vect{u}+\vect{v}=A+B=B+A=\vect{v}+\vect{u} This could lead to some confusion, but it is not too great a danger. But it is worth comment.

The previous two examples may be less than satisfying. We made all the relevant definitions long ago. And the required verifications were all handled by quoting old theorems. However, it is important to consider these two examples first. We have been studying vectors and matrices carefully (, ), and both objects, along with their operations, have certain properties in common, as you may have noticed in comparing with . Indeed, it is these two theorems that motivate us to formulate the abstract definition of a vector space, . Now, should we prove some general theorems about vector spaces (as we will shortly in ), we can instantly apply the conclusions to both $\complex{m}$ and $M_{mn}$. Notice too how we have taken six definitions and two theorems and reduced them down to two examples. With greater generalization and abstraction our old ideas get downgraded in stature.

Let us look at some more examples, now considering some new vector spaces.

The vector space of polynomials, $P_n$

Set: $P_n$, the set of all polynomials of degree $n$ or less in the variable $x$ with coefficients from $\complex{\null}$.

Equality:

Scalar Multiplication: \alpha(a_0+a_1x+a_2x^2+\cdots+a_nx^n)=(\alpha a_0)+(\alpha a_1)x+(\alpha a_2)x^2+\cdots+(\alpha a_n)x^n

This set, with these operations, will fulfill the ten properties, though we will not work all the details here. However, we will make a few comments and prove one of the properties. First, the zero vector () is what you might expect, and you can check that it has the required property. \zerovector=0+0x+0x^2+\cdots+0x^n

The additive inverse () is also no surprise, though consider how we have chosen to write it. -\left(a_0+a_1x+a_2x^2+\cdots+a_nx^n\right)=(-a_0)+(-a_1)x+(-a_2)x^2+\cdots+(-a_n)x^n

Now let's prove the associativity of vector addition (). This is a bit tedious, though necessary. Throughout, the plus sign (+) does triple-duty. You might ask yourself what each plus sign represents as you work through this proof.

Notice how it is the application of the associativity of the (old) addition of complex numbers in the middle of this chain of equalities that makes the whole proof happen. The remainder is successive applications of our (new) definition of vector (polynomial) addition. Proving the remainder of the ten properties is similar in style and tedium. You might try proving the commutativity of vector addition (), or one of the distributivity properties (, ).

The vector space of infinite sequences

Set: $\complex{\infty}=\setparts{(c_0,\,c_1,\,c_2,\,c_3,\,\ldots)}{c_i\in\complex{\null},\ i\in\mathbb{N}}$.

Equality: (c_0,\,c_1,\,c_2,\,\ldots)=(d_0,\,d_1,\,d_2,\,\ldots)\text{ if and only if }c_i=d_i\text{ for all }i\geq 0

Scalar Multiplication: \alpha (c_0,\,c_1,\,c_2,\,c_3,\,\ldots)=(\alpha c_0,\,\alpha c_1,\,\alpha c_2,\,\alpha c_3,\,\ldots)

This should remind you of the vector space $\complex{m}$, though now our lists of scalars are written horizontally with commas as delimiters and they are allowed to be infinite in length. What does the zero vector look like ()? Additive inverses ()? Can you prove the associativity of vector addition ()?

The vector space of functions

Let $X$ be any set.

Set: $F=\setparts{f}{f:X\rightarrow\complex{\null}}$.

Equality: $f=g$ if and only if $f(x)=g(x)$ for all $x\in X$.

Vector Addition: $f+g$ is the function with outputs defined by $(f+g)(x)=f(x)+g(x)$.

Scalar Multiplication: $\alpha f$ is the function with outputs defined by $(\alpha f)(x)=\alpha f(x)$.

So this is the set of all functions of one variable that take elements of the set $X$ to a complex number. You might have studied functions of one variable that take a real number to a real number, and that might be a more natural set to use as $X$. But since we are allowing our scalars to be complex numbers, we need to specify that the range of our functions is the complex numbers. Study carefully how the definitions of the operation are made, and think about the different uses of + and juxtaposition. As an example of what is required when verifying that this is a vector space, consider that the zero vector () is the function $z$ whose definition is $z(x)=0$ for every input $x\in X$.

Vector spaces of functions are very important in mathematics and physics, where the field of scalars may be the real numbers, so the ranges of the functions can in turn also be the set of real numbers.

Here's a unique example.

The singleton vector space

Set: $Z=\set{\vect{z}}$.

Equality: Huh?

Vector Addition: $\vect{z}+\vect{z}=\vect{z}$.

Scalar Multiplication: $\alpha\vect{z}=\vect{z}$.

This should look pretty wild. First, just what is $\vect{z}$? Column vector, matrix, polynomial, sequence, function? Mineral, plant, or animal? We aren't saying! $\vect{z}$ just is. And we have definitions of vector addition and scalar multiplication that are sufficient for an occurrence of either that may come along.

Our only concern is if this set, along with the definitions of two operations, fulfills the ten properties of . Let's check associativity of vector addition (). For all $\vect{u},\,\vect{v},\,\vect{w}\in Z$, \vect{u}+(\vect{v}+\vect{w})

What is the zero vector in this vector space ()? With only one element in the set, we do not have much choice. Is $\vect{z}=\zerovector$? It appears that $\vect{z}$ behaves like the zero vector should, so it gets the title. Maybe now the definition of this vector space does not seem so bizarre. It is a set whose only element is the element that behaves like the zero vector, so that lone element is the zero vector.

Perhaps some of the above definitions and verifications seem obvious or like splitting hairs, but the next example should convince you that they are necessary. We will study this one carefully. Ready? Check your preconceptions at the door.

The crazy vector space

Set: $C=\setparts{(x_1,\,x_2)}{x_1,\,x_2\in\complex{\null}}$.

Vector Addition: $(x_1,\,x_2)+(y_1,\,y_2)=(x_1+y_1+1,\,x_2+y_2+1)$.

Scalar Multiplication: $\alpha(x_1,\,x_2)=(\alpha x_1+\alpha-1,\,\alpha x_2+\alpha-1)$.

Now, the first thing I hear you say is You can't do that! And my response is, Oh yes, I can! I am free to define my set and my operations any way I please. They may not look natural, or even useful, but we will now verify that they provide us with another example of a vector space. And that is enough. If you are adventurous, you might try first checking some of the properties yourself. What is the zero vector? Additive inverses? Can you prove associativity? Ready, here we go.

, : The result of each operation is a pair of complex numbers, so these two closure properties are fulfilled.

:

:

: The zero vector is $\zerovector=(-1,\,-1)$. Now I hear you say, No, no, that can't be, it must be $(0,\,0)$!. Indulge me for a moment and let us check my proposal. \vect{u}+\zerovector=(x_1,\,x_2)+(-1,\,-1)=(x_1+(-1)+1,\,x_2+(-1)+1)=(x_1,\,x_2)=\vect{u} Feeling better? Or worse?

: For each vector, $\vect{u}$, we must locate an additive inverse, $\vect{-u}$. Here it is, $-(x_1,\,x_2)=(-x_1-2,\,-x_2-2)$. As odd as it may look, I hope you are withholding judgment. Check:

: \alpha(\beta\vect{u})

: If you have hung on so far, here's where it gets even wilder. In the next two properties we mix and mash the two operations.

:

: After all that, this one is easy, but no less pleasing. 1\vect{u}=1(x_1,\,x_2)=(x_1+1-1,\,x_2+1-1)=(x_1,\,x_2)=\vect{u}

That's it, $C$ is a vector space, as crazy as that may seem.

Notice that in the case of the zero vector and additive inverses, we only had to propose possibilities and then verify that they were the correct choices. You might try to discover how you would arrive at these choices, though you should understand why the process of discovering them is not a necessary component of the proof itself.

Vector Space Properties

has provided us with an abundance of examples of vector spaces, most of them containing useful and interesting mathematical objects along with natural operations. In this subsection we will prove some general properties of vector spaces. Some of these results will again seem obvious, but it is important to understand why it is necessary to state and prove them. A typical hypothesis will be Let $V$ be a vector space. From this we may assume the ten properties of , and nothing more. It's like starting over, as we learn about what can happen in this new algebra we are learning. But the power of this careful approach is that we can apply these theorems to any vector space we encounter those in the previous examples, or new ones we have not yet contemplated. Or perhaps new ones that nobody has ever contemplated. We will illustrate some of these results with examples from the crazy vector space (), but mostly we are stating theorems and doing proofs. These proofs do not get too involved, but are not trivial either, so these are good theorems to try proving yourself before you study the proof given here. (See .)

First we show that there is just one zero vector. Notice that the properties only require there to be at least one, and say nothing about there possibly being more. That is because we can use the ten properties of a vector space () to learn that there can never be more than one. To require that this extra condition be stated as an eleventh property would make the definition of a vector space more complicated than it needs to be.

Zero Vector is Unique

Suppose that $V$ is a vector space. The zero vector, $\zerovector$, is unique.

To prove uniqueness, a standard technique is to suppose the existence of two objects (). So let $\zerovector_1$ and $\zerovector_2$ be two zero vectors in $V$. Then \zerovector_1 \text{ for $\zerovector_2$}\\ \text{}\\ \text{ for $\zerovector_1$}

This proves the uniqueness since the two zero vectors are really the same.

Suppose that $V$ is a vector space. For each $\vect{u}\in V$, the additive inverse, $\vect{-u}$, is unique.

To prove uniqueness, a standard technique is to suppose the existence of two objects (). So let $\vect{-u}_1$ and $\vect{-u}_2$ be two additive inverses for $\vect{u}$. Then \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}

So the two additive inverses are really the same.

As obvious as the next three theorems appear, nowhere have we guaranteed that the zero scalar, scalar multiplication and the zero vector all interact this way. Until we have proved it, anyway.

Zero Scalar in Scalar Multiplication

Suppose that $V$ is a vector space and $\vect{u}\in V$. Then $0\vect{u}=\zerovector$.

Notice that $0$ is a scalar, $\vect{u}$ is a vector, so says $0\vect{u}$ is again a vector. As such, $0\vect{u}$ has an additive inverse, $-(0\vect{u})$ by . 0\vect{u} \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}

Here's another theorem that looks like it should be obvious, but is still in need of a proof.

Zero Vector in Scalar Multiplication

Suppose that $V$ is a vector space and $\alpha\in\complex{\null}$. Then $\alpha\zerovector=\zerovector$.

Notice that $\alpha$ is a scalar, $\zerovector$ is a vector, so means $\alpha\zerovector$ is again a vector. As such, $\alpha\zerovector$ has an additive inverse, $-(\alpha\zerovector)$ by . \alpha\zerovector \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}

Here's another one that sure looks obvious. But understand that we have chosen to use certain notation because it makes the theorem's conclusion look so nice. The theorem is not true because the notation looks so good, it still needs a proof. If we had really wanted to make this point, we might have defined the additive inverse of $\vect{u}$ as $\vect{u}^\sharp$. Then we would have written the defining property, , as $\vect{u}+\vect{u}^\sharp=\zerovector$. This theorem would become $\vect{u}^\sharp=(-1)\vect{u}$. Not really quite as pretty, is it?

Suppose that $V$ is a vector space and $\vect{u}\in V$. Then $\vect{-u}=(-1)\vect{u}$.

\vect{-u} \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}

Because of this theorem, we can now write linear combinations like $6\vect{u}_1+(-4)\vect{u}_2$ as $6\vect{u}_1-4\vect{u}_2$, even though we have not formally defined an operation called vector subtraction.

Our next theorem is a bit different from several of the others in the list. Rather than making a declaration (the zero vector is unique) it is an implication (if, then) and so can be used in proofs to convert a vector equality into two possibilities, one a scalar equality and the other a vector equality. It should remind you of the situation for complex numbers. If $\alpha,\,\beta\in\complexes$ and $\alpha\beta=0$, then $\alpha=0$ or $\beta=0$. This critical property is the driving force behind using a factorization to solve a polynomial equation.

Scalar Multiplication Equals the Zero Vector

Suppose that $V$ is a vector space and $\alpha\in\complex{\null}$. If $\alpha\vect{u}=\zerovector$, then either $\alpha=0$ or $\vect{u}=\zerovector$.

We prove this theorem by breaking up the analysis into two cases. The first seems too trivial, and it is, but the logic of the argument is still legitimate.

Case 1. Suppose $\alpha=0$. In this case our conclusion is true (the first part of the either/or is true) and we are done. That was easy.

Case 2. Suppose $\alpha\neq 0$. \vect{u} \text{}\\ \text{}\\ \text{}

So in this case, the conclusion is true (the second part of the either/or is true) and we are done since the conclusion was true in each of the two cases.

Properties for the Crazy Vector Space

Several of the above theorems have interesting demonstrations when applied to the crazy vector space, $C$ (). We are not proving anything new here, or learning anything we did not know already about $C$. It is just plain fun to see how these general theorems apply in a specific instance. For most of our examples, the applications are obvious or trivial, but not with $C$.

Suppose $\vect{u}\in C$. Then, as given by , 0\vect{u}=0(x_1,\,x_2)=(0x_1+0-1,\,0x_2+0-1)=(-1,-1)=\zerovector And as given by , \alpha\zerovector Finally, as given by , (-1)\vect{u}

Recycling Definitions

When we say that $V$ is a vector space, we then know we have a set of objects (the vectors), but we also know we have been provided with two operations (vector addition and scalar multiplication) and these operations behave with these objects according to the ten properties of . One combines two vectors and produces a vector, the other takes a scalar and a vector, producing a vector as the result. So if $\vect{u}_1,\,\vect{u}_2,\,\vect{u}_3\in V$ then an expression like 5\vect{u}_1+7\vect{u}_2-13\vect{u}_3 would be unambiguous in any of the vector spaces we have discussed in this section. And the resulting object would be another vector in the vector space. If you were tempted to call the above expression a linear combination, you would be right. Four of the definitions that were central to our discussions in were stated in the context of vectors being column vectors, but were purposely kept broad enough that they could be applied in the context of any vector space. They only rely on the presence of scalars, vectors, vector addition and scalar multiplication to make sense. We will restate them shortly, unchanged, except that their titles and acronyms no longer refer to column vectors, and the hypothesis of being in a vector space has been added. Take the time now to look forward and review each one, and begin to form some connections to what we have done earlier and what we will be doing in subsequent sections and chapters. Specifically, compare the following pairs of definitions:
and
and
and
and

1. Comment on how the vector space $\complex{m}$ went from a theorem () to an example ().
2. In the crazy vector space, $C$, () compute the linear combination 2(3,\,4)+(-6)(1,\,2).
3. Suppose that $\alpha$ is a scalar and $\zerovector$ is the zero vector. Why should we prove anything as obvious as $\alpha\zerovector=\zerovector$ such as we did in ?
Define a possibly new vector space by beginning with the set and vector addition from $\complex{2}$ () but change the definition of scalar multiplication to Prove that the first nine properties required for a vector space hold, but does not hold.

This example shows us that we cannot expect to be able to derive as a consequence of assuming the first nine properties. In other words, we cannot slim down our list of properties by jettisoning the last one, and still have the same collection of objects qualify as vector spaces.
Let $V$ be the set $\complex{2}$ with the usual vector addition, but with scalar multiplication defined by \alpha \colvector{x\\y} = \colvector{\alpha y \\ \alpha x} Determine whether or not $V$ is a vector space with these operations. The set $\complex{2}$ with the proposed operations is not a vector space since is not valid. A counterexample is $1\colvector{3\\2 } = \colvector{2\\3}\ne\colvector{3\\2 }$, so in general, $1\vect{u}\ne\vect{u}$. Let $V$ be the set $\complex{2}$ with the usual scalar multiplication, but with vector addition defined by \colvector{x\\y} + \colvector{z\\w} = \colvector{y + w \\ x + z} Determine whether or not $V$ is a vector space with these operations. Let's consider the existence of a zero vector, as required by of a vector space. The regular zero vector fails : $\colvector{x\\y}+\colvector{0\\0} = \colvector{y\\x}\ne\colvector{x\\y}$ (remember that the property must hold for everymust be a non-empty set, be we vector, not just for some). Is there another vector that fills the role of the zero vector? Suppose that $\zerovector=\colvector{z_1\\z_2}$. Then for any vector $\colvector{x\\y}$, we have \colvector{x\\y}+\colvector{z_1 \\z_2} = \colvector{x\\y} so that $x = y + z_2$ and $y = x + z_1$. This means that $z_1 = y - x$ and $z_2 = x - y$. However, since $x$ and $y$ can be any complex numbers, there are no fixed complex numbers $z_1$ and $z_2$ that satisfy these equations. Thus, there is no zero vector, is not valid, and the set $\complex{2}$ with the proposed operations is not a vector space. Let $V$ be the set $M_{2,2}$ with the usual scalar multiplication, but with addition defined by $A + B = \zeromatrix_{2,2}$ for all $2 \times 2$ matrices $A$ and $B$. Determine whether or not $V$ is a vector space with these operations. Since scalar multiplication remains unchanged, we only need to consider the axioms that involve vector addition. Since every sum is the zero matrix, the first 4 properties hold easily. However, there is no zero vector in this set. Suppose that there was. Then there is a matrix $Z$ so that $A + Z = A$ for any $2\times 2$ matrix $A$. However, $A + Z = \zeromatrix_{2,2}$, which is in general not equal to $A$, so fails and this set is not a vector space. Let $V$ be the set $M_{2,2}$ with the usual addition, but with scalar multiplication defined by $\alpha A= \zeromatrix_{2,2}$ for all $2 \times 2$ matrices $A$ and scalars $\alpha$. Determine whether or not $V$ is a vector space with these operations. Since addition is unchanged, we only need to check the axioms involving scalar multiplication. The proposed scalar multiplication clearly fails : $1A = \zeromatrix_{2,2}\ne A$. Thus, the proposed set is not a vector space. Consider the following sets of $3 \times 3$ matrices, where the symbol $*$ indicates the position of an arbitrary complex number. Determine whether or not these sets form vector spaces with the usual operations of addition and scalar multiplication for matrices.
1. All matrices of the form $$2. All matrices of the form$$
3. All matrices of the form $$(These are the diagonal matrices.) 4. All matrices of the form$$ (These are the upper triangular matrices.)
There is something to notice here that will make our job much easier: Since each of these sets are comprised of $3\times 3$ matrices with the standard operations of addition and scalar multiplication of matrices, the last 8 properties will automatically hold. That is, we really only need to verify and .
• This set is not closed under either scalar multiplication or addition (fails and ). For example, is not a member of the proposed set.
• This set is closed under both scalar multiplication and addition, so this set is a vector space with the standard operation of addition and scalar multiplication.
• This set is closed under both scalar multiplication and addition, so this set is a vector space with the standard operation of addition and scalar multiplication.
• This set is closed under both scalar multiplication and addition, so this set is a vector space with the standard operation of addition and scalar multiplication.
Explain why we need to define the vector space $P_n$ as the set of all polynomials with degree up to and including $n$ instead of the more obvious set of all polynomials of degree exactly $n$. Hint: The set of all polynomials of degree exactly $n$ fails one of the closure properties of a vector space. Which one, and why? The set of integers is denoted $\mathbb{Z}$. Does the set $\mathbb{Z}^2 = \setparts{\colvector{m\\n}}{m,n\in\mathbb{Z}}$ with the operations of standard addition and scalar multiplication of vectors form a vector space? Additive closure will hold, but scalar closure will not. The best way to convince yourself of this is to construct a counterexample. Such as, $\frac{1}{2}\in\complexes$ and $\colvector{1\\0}\in\mathbb{Z}^2$, however $\frac{1}{2}\colvector{1\\0}=\colvector{\frac{1}{2}\\0}\not\in\mathbb{Z}^2$, which violates . So $\mathbb{Z}^2$ is not a vector space. Prove each of the ten properties of for each of the following examples of a vector space:\\ \\ \\ \\

The next three problems suggest that under the right situations we can cancel. In practice, these techniques should be avoided in other proofs. Prove each of the following statements.

Suppose that $V$ is a vector space, and $\vect{u},\,\vect{v},\,\vect{w}\in V$. If $\vect{w}+\vect{u}=\vect{w}+\vect{v}$, then $\vect{u}=\vect{v}$. \vect{u} \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{}\\ \text{} Suppose $V$ is a vector space, $\vect{u},\,\vect{v}\in V$ and $\alpha$ is a nonzero scalar from $\complex{\null}$. If $\alpha\vect{u}=\alpha\vect{v}$, then $\vect{u}=\vect{v}$. \vect{u} \text{}\\ \text{}\\ \text{}\\ \text{} Suppose $V$ is a vector space, $\vect{u}\neq\zerovector$ is a vector in $V$ and $\alpha,\,\beta\in\complex{\null}$. If $\alpha\vect{u}=\beta\vect{u}$, then $\alpha=\beta$. \zerovector \text{}\\ \text{}\\ \text{}\\ \text{}\\ By hypothesis, $\vect{u}\neq\zerovector$, so implies Suppose that $V$ is a vector space and $\alpha\in\complexes$ is a scalar such that $\alpha\vect{x}=\vect{x}$ for every $\vect{x}\in V$. Prove that $\alpha = 1$. In other words, is not duplicated for any other scalar but the special scalar, 1. (This question was suggested by James Gallagher.) We have, \zerovector \text{}\\ \text{}\\ \text{} So by we conclude that $\alpha-1=0$ or $\vect{x}=\zerovector$. However, since our hypothesis was for every $\vect{x}\in V$, we are left with the first possibility and $\alpha=1$.

There is one flaw in the proof above, and as stated, the problem is not correct either. Can you spot the flaw and as a result correct the problem statement? (Hint: ).