|
Definition of Vector Space |
The first chapter began by introducing Gauss’ method and finished with a fair understanding, keyed on the Linear Combination Lemma, of how it finds the solution set of a linear system. Gauss’ method systematically takes linear combinations of the rows. With that insight, we now move to a general study of linear combinations. We need a setting for this study.
At times in the first chapter, we’ve combined vectors from But, if having the results apply to many spaces at once is
advantageous then sticking only to We want the results about linear combinations to apply anywhere that linear combinations are sensible. We shall call any such set a vector space. Our results, instead of being phrased as ‘’Whenever we have a collection in which we can sensibly take linear combinations …’‘, will be stated as In any vector space …. Such a statement describes at once what happens in many spaces. The step up in abstraction from studying a single space at a time to studying a class of spaces can be hard to make. To understand its advantages, consider this analogy. Imagine that the government made laws one person at a time: Leslie Jones can’t jay walk. That would be a bad idea; statements have the virtue of economy when they apply to many cases at once. Or, suppose that they ruled, ‘’Kim Ke must stop when passing the scene of an accident.’‘ Contrast that with, ‘’Any doctor must stop when passing the scene of an accident.’‘ More general statements, in some ways, are clearer. Definition of Vector SpaceWe shall study structures with two operations, an addition and a scalar multiplication, that are subject to some simple conditions. We will reflect more on the conditions later, but on first reading notice how reasonable they are. For instance, surely any operation that can be called an addition (e.g., column vector addition, row vector addition, or real number addition) will satisfy all the conditions in~(1) below. « | Table of Contents | » |