Section VS  Vector Spaces

From A First Course in Linear Algebra
Version 2.23
© 2004.
Licensed under the GNU Free Documentation License.
http://linear.ups.edu/

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.

Subsection VS: Vector Spaces

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

Definition VS
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 ℂ if the following ten properties hold.

• AC Additive Closure
  If u,\kern 1.95872pt v ∈ V , then u + v ∈ V .
• SC Scalar Closure
  If α ∈ {ℂ}^{} and u ∈ V , then αu ∈ V .
• C Commutativity
  If u,\kern 1.95872pt v ∈ V , then u + v = v + u.
• AA Additive Associativity
  If u,\kern 1.95872pt v,\kern 1.95872pt w ∈ V , then u + \left (v + w\right ) = \left (u + v\right ) + w.
• Z Zero Vector
  There is a vector, 0, called the zero vector, such that u + 0 = u for all u ∈ V .
• AI Additive Inverses
  If u ∈ V , then there exists a vector −u ∈ V so that u + (−u) = 0.
• SMA Scalar Multiplication Associativity
  If α,\kern 1.95872pt β ∈ {ℂ}^{} and u ∈ V , then α(βu) = (αβ)u.
• DVA Distributivity across Vector Addition
  If α ∈ {ℂ}^{} and u,\kern 1.95872pt v ∈ V , then α(u + v) = αu + αv.
• DSA Distributivity across Scalar Addition
  If α,\kern 1.95872pt β ∈ {ℂ}^{} and u ∈ V , then (α + β)u = αu + βu.
• O One
  If u ∈ V , then 1u = 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 Subsection VS.EVS.

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 Definition VS 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 Example CVS).

In Definition VS, the scalars do not have to be complex numbers. They can come from what are called in more advanced mathematics, “fields” (see Section F 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”, \left \{0,\kern 1.95872pt 1\right \}. 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, be we can infer this from Property Z, 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.

Subsection EVS: 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 Definition VS. 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.

Example VSCV
The vector space {ℂ}^{m}
Set: {ℂ}^{m}, all column vectors of size m, Definition VSCV.
Equality: Entry-wise, Definition CVE.
Vector Addition: The “usual” addition, given in Definition CVA.
Scalar Multiplication: The “usual” scalar multiplication, given in Definition CVSM.

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

Example VSM
The vector space of matrices, {M}_{mn}
Set: {M}_{mn}, the set of all matrices of size m × n and entries from {ℂ}^{}, Example VSM.
Equality: Entry-wise, Definition ME.
Vector Addition: The “usual” addition, given in Definition MA.
Scalar Multiplication: The “usual” scalar multiplication, given in Definition MSM.

Does this set with these operations fulfill the ten properties? Yes. And all we need to do is quote Theorem VSPM. 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,\kern 1.95872pt B ∈ {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

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 (Chapter V, Chapter M), and both objects, along with their operations, have certain properties in common, as you may have noticed in comparing Theorem VSPCV with Theorem VSPM. Indeed, it is these two theorems that motivate us to formulate the abstract definition of a vector space, Definition VS. Now, should we prove some general theorems about vector spaces (as we will shortly in Subsection VS.VSP), we can instantly apply the conclusions to both {ℂ}^{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.

Example VSP
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 {ℂ}^{}.
Equality:

Vector Addition:

Scalar Multiplication:

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 (Property Z) is what you might expect, and you can check that it has the required property.

The additive inverse (Property AI) is also no surprise, though consider how we have chosen to write it.

Now let’s prove the associativity of vector addition (Property AA). 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 (Property C), or one of the distributivity properties (Property DVA, Property DSA). ⊠

Example VSIS
The vector space of infinite sequences
Set: {ℂ}^{∞} = \left \{\left .({c}_{ 0},\kern 1.95872pt {c}_{1},\kern 1.95872pt {c}_{2},\kern 1.95872pt {c}_{3},\kern 1.95872pt \mathop{\mathop{…}})\right \vert {c}_{i} ∈ {ℂ}^{},\ i ∈ ℕ\right \}.
Equality:

Vector Addition:

Scalar Multiplication:

This should remind you of the vector space {ℂ}^{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 (Property Z)? Additive inverses (Property AI)? Can you prove the associativity of vector addition (Property AA)? ⊠

Example VSF
The vector space of functions
Let X be any set. Set: F = \left \{\left .f\right \vert f : X → {ℂ}^{}\right \}.
Equality: f = g if and only if f(x) = g(x) for all x ∈ X.
Vector Addition: f + g is the function with outputs defined by (f + g)(x) = f(x) + g(x).
Scalar Multiplication: αf is the function with outputs defined by (αf)(x) = α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 (Property Z) is the function z whose definition is z(x) = 0 for every input x ∈ 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.

Example VSS
The singleton vector space
Set: Z = \left \{z\right \}.
Equality: Huh?
Vector Addition: z + z = z.
Scalar Multiplication: αz = z.

This should look pretty wild. First, just what is z? Column vector, matrix, polynomial, sequence, function? Mineral, plant, or animal? We aren’t saying! 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 Definition VS. Let’s check associativity of vector addition (Property AA). For all u,\kern 1.95872pt v,\kern 1.95872pt w ∈ Z,

What is the zero vector in this vector space (Property Z)? With only one element in the set, we do not have much choice. Is z = 0? It appears that 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.

Example CVS
The crazy vector space
Set: C = \left \{\left .({x}_{1},\kern 1.95872pt {x}_{2})\right \vert {x}_{1},\kern 1.95872pt {x}_{2} ∈ {ℂ}^{}\right \}.
Vector Addition: ({x}_{1},\kern 1.95872pt {x}_{2}) + ({y}_{1},\kern 1.95872pt {y}_{2}) = ({x}_{1} + {y}_{1} + 1,\kern 1.95872pt {x}_{2} + {y}_{2} + 1).
Scalar Multiplication: α({x}_{1},\kern 1.95872pt {x}_{2}) = (α{x}_{1} + α − 1,\kern 1.95872pt α{x}_{2} + α − 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.

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

Property C:

Property AA:

Property Z: The zero vector is …0 = (−1,\kern 1.95872pt − 1). Now I hear you say, “No, no, that can’t be, it must be (0,\kern 1.95872pt 0)!” Indulge me for a moment and let us check my proposal.

Feeling better? Or worse?

Property AI: For each vector, u, we must locate an additive inverse, −u. Here it is, − ({x}_{1},\kern 1.95872pt {x}_{2}) = (−{x}_{1} − 2,\kern 1.95872pt − {x}_{2} − 2). As odd as it may look, I hope you are withholding judgment. Check:

Property SMA:

Property DVA: 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.

Property DSA:

Property O: After all that, this one is easy, but no less pleasing.

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. ⊠

Subsection VSP: Vector Space Properties

Subsection VS.EVS 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 Definition VS, and nothing more. Its 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 (Example CVS), 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 Technique P.)

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 (Definition VS) 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.

Theorem ZVU
Zero Vector is Unique
Suppose that V is a vector space. The zero vector, 0, is unique. □

Proof   To prove uniqueness, a standard technique is to suppose the existence of two objects (Technique U). So let {0}_{1} and {0}_{2} be two zero vectors in V . Then

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

Theorem AIU
Additive Inverses are Unique
Suppose that V is a vector space. For each u ∈ V , the additive inverse, −u, is unique. □

Proof   To prove uniqueness, a standard technique is to suppose the existence of two objects (Technique U). So let {−u}_{1} and {−u}_{2} be two additive inverses for u. Then

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.

Theorem ZSSM
Zero Scalar in Scalar Multiplication
Suppose that V is a vector space and u ∈ V . Then 0u = 0. □

Proof   Notice that 0 is a scalar, u is a vector, so Property SC says 0u is again a vector. As such, 0u has an additive inverse, − (0u) by Property AI.

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

Theorem ZVSM
Zero Vector in Scalar Multiplication
Suppose that V is a vector space and α ∈ {ℂ}^{}. Then α0 = 0. □

Proof   Notice that α is a scalar, 0 is a vector, so Property SC means α0 is again a vector. As such, α0 has an additive inverse, − (α0) by Property AI.

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 u as {u}^{♯}. Then we would have written the defining property, Property AI, as u + {u}^{♯} = 0. This theorem would become {u}^{♯} = (−1)u. Not really quite as pretty, is it?

Theorem AISM
Additive Inverses from Scalar Multiplication
Suppose that V is a vector space and u ∈ V . Then −u = (−1)u. □

Proof  

Because of this theorem, we can now write linear combinations like 6{u}_{1} + (−4){u}_{2}
as 6{u}_{1} − 4{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 α,\kern 1.95872pt β ∈ ℂ and αβ = 0, then α = 0 or β = 0. This critical property is the driving force behind using a factorization to solve a polynomial equation.

Theorem SMEZV
Scalar Multiplication Equals the Zero Vector
Suppose that V is a vector space and α ∈ {ℂ}^{}. If αu = 0, then either α = 0 or u = 0. □

Proof   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 α = 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 α\mathrel{≠}0.

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. ■

Example PCVS
Properties for the Crazy Vector Space
Several of the above theorems have interesting demonstrations when applied to the crazy vector space, C (Example CVS). 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 u ∈ C.
Then, as given by Theorem ZSSM,

And as given by Theorem ZVSM,

Finally, as given by Theorem AISM,

Subsection RD: 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 Definition VS. One combines two vectors and produces a vector, the other takes a scalar and a vector, producing a vector as the result. So if {u}_{1},\kern 1.95872pt {u}_{2},\kern 1.95872pt {u}_{3} ∈ V then an expression like

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 Chapter V 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:
Definition LCCV and Definition LC
Definition SSCV and Definition SS
Definition RLDCV and Definition RLD
Definition LICV and Definition LI

Subsection READ: Reading Questions

1. Comment on how the vector space {ℂ}^{m} went from a theorem (Theorem VSPCV) to an example (Example VSCV).
2. In the crazy vector space, C, (Example CVS) compute the linear combination

   2(3,\kern 1.95872pt 4) + (−6)(1,\kern 1.95872pt 2).

3. Suppose that α is a scalar and 0 is the zero vector. Why should we prove anything as obvious as α0 = 0 such as we did in Theorem ZVSM?

Subsection EXC: Exercises

M10 Define a possibly new vector space by beginning with the set and vector addition from {ℂ}^{2} (Example VSCV) but change the definition of scalar multiplication to

Prove that the first nine properties required for a vector space hold, but Property O does not hold.

This example shows us that we cannot expect to be able to derive Property O 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.  
Contributed by Robert Beezer

M11 Let V be the set {ℂ}^{2} with the usual vector addition, but with scalar multiplication defined by

Determine whether or not V is a vector space with these operations.  
Contributed by Chris Black Solution [880]

M12 Let V be the set {ℂ}^{2} with the usual scalar multiplication, but with vector addition defined by

Determine whether or not V is a vector space with these operations.  
Contributed by Chris Black Solution [880]

M13 Let V be the set {M}_{2,2} with the usual scalar multiplication, but with addition defined by A ⊕ B = {O}_{2,2} for all 2 × 2 matrices A and B. Determine whether or not V is a vector space with these operations.  
Contributed by Chris Black Solution [881]

M14 Let V be the set {M}_{2,2} with the usual addition, but with scalar multiplication defined by αA = {O}_{2,2} for all 2 × 2 matrices A and scalars α. Determine whether or not V is a vector space with these operations.  
Contributed by Chris Black Solution [881]

M15 Consider the following sets of 3 × 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 \left [\array{ ∗&∗&1\cr ∗&1 &∗ \cr 1&∗&∗} \right ]
2. All matrices of the form \left [\array{ ∗&0&∗\cr 0&∗ &0 \cr ∗&0&∗} \right ]
3. All matrices of the form \left [\array{ ∗&0&0\cr 0&∗ &0 \cr 0&0&∗} \right ] (These are the diagonal matrices.)
4. All matrices of the form \left [\array{ ∗&∗&∗\cr 0&∗ &∗ \cr 0&0&∗} \right ] (These are the upper triangular matrices.)

 
Contributed by Chris Black Solution [881]

M20 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.  
Contributed by Chris Black Solution [882]

M21 Does the set {ℤ}^{2} = \left \{\left .\left [\array{ m\cr n } \right ]\right \vert m,n ∈ ℤ\right \} with the operations of standard addition and multiplication of vectors form a vector space?  
Contributed by Chris Black Solution [882]

T10 Prove each of the ten properties of Definition VS for each of the following examples of a vector space:
Example VSP
Example VSIS
Example VSF
Example VSS  
Contributed by Robert Beezer

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.

T21 Suppose that V is a vector space, and u,\kern 1.95872pt v,\kern 1.95872pt w ∈ V . If w + u = w + v, then u = v.  
Contributed by Robert Beezer Solution [882]

T22 Suppose V is a vector space, u,\kern 1.95872pt v ∈ V and α is a nonzero scalar from {ℂ}^{}. If αu = αv, then u = v.  
Contributed by Robert Beezer Solution [883]

T23 Suppose V is a vector space, u\mathrel{≠}0 is a vector in V and α,\kern 1.95872pt β ∈ {ℂ}^{}. If αu = βu, then α = β.  
Contributed by Robert Beezer Solution [884]

T30 Suppose that V is a vector space and α ∈ ℂ is a scalar such that αx = x for every x ∈ V . Prove that α = 1. In other words, Property O is not duplicated for any other scalar but the “special” scalar, 1. (This question was suggested by James Gallagher.)  
Contributed by Robert Beezer Solution [884]

Subsection SOL: Solutions

M11 Contributed by Chris Black Statement [875]
The set {ℂ}^{2} with the proposed operations is not a vector space since Property O is not valid. A counterexample is 1\left [\array{ 3\cr 2 } \right ] = \left [\array{ 2\cr 3 } \right ]\mathrel{≠}\left [\array{ 3\cr 2 } \right ], so in general, 1u\mathrel{≠}u.

M12 Contributed by Chris Black Statement [876]
Let’s consider the existence of a zero vector, as required by Property Z of a vector space. The “regular” zero vector fails : \left [\array{ x\cr y } \right ]⊕\left [\array{ 0\cr 0 } \right ] = \left [\array{ y\cr x } \right ]\mathrel{≠}\left [\array{ x\cr y } \right ] (remember that the property must hold for every vector, not just for some). Is there another vector that fills the role of the zero vector? Suppose that 0 = \left [\array{ {z}_{1} \cr {z}_{2} } \right ]. Thenfor any vector \left [\array{ x\cr y } \right ], we have

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, Property Z is not valid, and the set {ℂ}^{2} with the proposed operations is not a vector space.

M13 Contributed by Chris Black Statement [876]
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 × 2 matrix A. However, A + Z = {O}_{2,2}, which is in general not equal to A, so Property Z fails and this set is not a vector space.

M14 Contributed by Chris Black Statement [877]
Since addition is unchanged, we only need to check the axioms involving scalar multiplication. The proposed scalar multiplication clearly fails Property O : 1A = {O}_{2,2}\mathrel{≠}A. Thus, the proposed set is not a vector space.

M15 Contributed by Chris Black Statement [877]
There is something to notice here that will make our job much easier: Since each of these sets are comprised of 3 × 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 Property AC and Property SC.

• This set is not closed under either scalar multiplication or addition (fails Property AC and Property SC). For example, 3\left [\array{ ∗&∗&1\cr ∗&1 &∗ \cr 1&∗&∗} \right ] = \left [\array{ ∗&∗&3\cr ∗&3 &∗ \cr 3&∗&∗} \right ] 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.

M20 Contributed by Chris Black Statement [878]
Hint: The set of all polynomials of degree exactly n fails one of the closure properties of a vector space. Which one, and why?

M21 Contributed by Robert Beezer Statement [878]
Additive closure will hold, but scalar closure will not. The best way to convince yourself of this is to construct a counterexample. Such as, {1\over 2} ∈ ℂ and \left [\array{ 1\cr 0 } \right ] ∈ {ℤ}^{2}, however {1\over 2}\left [\array{ 1\cr 0 } \right ] = \left [\array{ {1\over 2} \cr 0 } \right ]∉{ℤ}^{2}, which violates Property SC. So {ℤ}^{2} is not a vector space.

T21 Contributed by Robert Beezer Statement [878]

T22 Contributed by Robert Beezer Statement [878]

T23 Contributed by Robert Beezer Statement [879]

T30 Contributed by Robert Beezer Statement [879]
We have,

So by Theorem SMEZV we conclude that α − 1 = 0 or x = 0. However, since our hypothesis was for every x ∈ V , we are left with the first possibility and α = 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: Example VSS).