2.1 Real Vector Spaces
Vectors! Vectors! Vectors Everywhere!
1Reading¶
Material related to this page, as well as additional exercises, can be found in ALA Ch. 2.1 and LAA 4.1.
2Learning Objectives¶
By the end of this page, you should know:
- the definition of a vector space
- examples of different vector spaces
- how to add and scale vectors
3Abstraction¶
A theme in mathematics is recognizing that seemingly unrelated settings, objects, or models, all share common properties. By viewing them at the right level of abstraction, they can all be reasoned about together in the same way. This is a very powerful way of thinking! This chapter will introduce the abstract notion of a vector space which unifies the seemignly disparate spaces of ordinary vectors, spaces of functions (such as polynomials, exponentials, and trigonometric functions), spaces of matrices, (infinite dimensional) linear operators (we will only briefly encounter these later in the course), and more under a common conceptual framework.
For many of you, this will be your first foray into “abstraction,” and it will take some time and effort to get used to these ideas. A good strategy is to make sure that you understand what the new concepts we introduce mean in the context of ordinary Euclidean space, and then work through how they might apply in more abstract spaces, like the space of polyomials, vector valued sampled signals over an interval, or symmetric matrices (yes, we will see that these are all examples of vector spaces!).
4Real Vector Spaces¶
We’ve so far relied on certain simple and intuitive algebraic properties of how matrices and vectors can be added together and scaled. We’ll try to formalize these ideas and then abstract/genearlize them next.
Let us consider the space of all real-values vectors, denoted by . Adding two vectors can be viewed geometrically through a parallelogram, and multiplication by a scalar is stretching/shrinking the vector by factor .
We aim to abstract the above properties so that we can add and scale generic “vectors” living in a “vector space”.
The two operations just tell us that if we start with vectors and real scalars , we are free to add scaled versions together and we will stay in the vector space , i.e., for any choices of and . The axioms that follow are a formalization of the properties we expect addition and multiplication to follow: these are true for ordinary numbers and ordinary vectors, and we want them to hold for generic vectors too. We will work through some familiar (and some not so familiar) examples soon, but we first highlight some additonal important properties that can be deduced from the axioms above.
Notice that these are all properties that obviously hold for ordinary numbers and ordinary vectors. The above says that these “rules” should also hold in our new abstract vector spaces.
In digital signal processing and applications such as communication, we work with sampled versions of the functions over the time interval so that we can store them on a computer. This is obtained by sampling at times , where τ is the sampling period, and is the number of samples taken over (we assume that τ is chosen so that is an integer).
This gives a vector of size :
So even though we started with a function defined over a continuous interval, after sampling it we end up with an ordinary vector of size . Hence, adding and scaling sampled functions is done in exactly the same way as in Example 1, but now the vectors and are interpreted as being samples from underlying functions and . Sampling the zero function gives the usual vector.
In summary, the space of functions sampled at the same time points over an interval is not only a vector space, but is in fact !
Let be the space of all doubly infinite sequences of numbers:
The sequences (4) can be interpreted as a signal sampled over an undefined interval, which appears in areas such as control theory, signal processing, biology, optics.
is also known as the space of discrete time signals.
If define
- addition as (element-wise), and
- scalar multiplication as (scale each entry), then the vector space axioms can be verified exactly as we dif for .
This is our first example of a vector space where the vectors are “not just an arrow in .” In fact, each vector has infinitely many elements! Nevertheless, we can still think of each vector as an “arrow” that adds and scales as shown in Figure 1.
Let’s venture further into unfamiliar territory!
Consider the space
consisting of all real polynomials of degree . The polynomial coefficients can be any real numbers. For example, is the set of all linear polynomials, since given any linear equation , setting and shows that . Under the usual definitions of polynomial addition and scalar multiplication:
- Addition:
- Scalar multiplication:
is a vector space. The vector space axioms can be checked to be satisfied because we addition and scaling is accomplished done by adding/scaling coefficients entrywise.
Addition and scaling of polynomials is very similar to how we add and scale ordinary vectors. This is not a coincidence at all! We will see why later!
We still need to define the zero vector here. In this case, it is the zero polynomial satisfying . Vectors in are polynomial functions and you should think of them as “arrows”, similar to ordinary vectors, living in the space of polynomials.
The space of degree polynomials is not a vector space. For example, consider and , both of degree 2, but that has degree 1! Hence, is defined as polynomials of degree so that we do not go out of the space when we add elements.
A scalar and the constant polynomial are different objects, even though they look similar! You should think of as an “arrow” in rather than as a scalar.
Our last example will be the most abstract example of a vector space we see today, and our first example of a function space. Let be an interval (a common choice is , the closed interval from 0 to 1). The function space is defined as the vector space whose elements are all real-valued function defined for all . The operations are
- Addition in the usual way for all
- Scalar multiplication
denotes the new function obtained by adding and . We define the value of at by . The vector elements here are , while the variable is not related to the vector space. The variable is used only to define how is computed from and . A useful trick is to not write out the argument when performing vector space operations.
4.1Example¶
Let and and set . Then, . To compute ,
From (8), the function is defined for all . Hence, .
If the above discussion is confusing, pretend that we are using sampled version and of and , respectively, but with very very (in fact infinitely) dense sampling. Adding gives me a new vector, just like adding gives me a new function.