Serlo: EN: Introduction: Vector space

{{#invoke:Mathe für Nicht-Freaks/Seite|oben}}

We already know the vector spaces ${ℝ}^2$ and ${ℝ}^3$ from school. There we got to know them in the form coordinate systems. The concept of a vector space is much broader in mathematics. In the following, we will develop the abstract mathematical concept of vector space starting from the vector spaces known from school. They have a wide application in science, technology and data analysis.

The vector space ${ℝ}^n$

Datei:Definition Vektorraum - Mit Beispielen intuitiv erklärt und hergeleitet.webm

In ${ℝ}^2$ and ${ℝ}^3$ we know vectors in the form of points in the plane or in the space. Sometimes we also encounter arrows as representatives of vectors in the coordinate system. vectors can be described in ${ℝ}^2$ by two and in ${ℝ}^3$ by three coordinates. The following map shows for example the arrow representation of the vector $v=(2,1{)}^T$:

vector in ${ℝ}^2$ represented by an arrow

Often, however, three coordinates are not enough to represent all the desired information. This is shown by the following two examples:

We have seen from the examples that it can be useful to extend $ℝ$ by adding more dimensions to a general vector space ${ℝ}^n$. And there are many more examples! In the transition from ${ℝ}^2$ to ${ℝ}^3$ we can still vividly imagine that we increase the dimension by adding an independent direction. In higher dimensions we lack this geometric notion. However, we can imagine higher dimensional vector spaces very well in the tuple notation. An additional dimension can be achieved by adding another number. These numbers can all be chosen independently and we call them coordinates.

Generalization to $K^n$ Vorlage:Anker

So far we have created vector spaces by adding further dimensions to $ℝ$. Now we want to look at which properties of the real numbers are relevant for this and, based on this, generalize the vector space notion further. We are familiar with the rules of $ℝ$. We already know the vector addition and the scalar multiplication in ${ℝ}^2$ and in ${ℝ}^3$ and we can visualize these vividly.

• 
  Addition of two vectors im ${ℝ}^2$
• 
  scalar multiplication im ${ℝ}^2$

In the same way, however, we can also calculate in higher dimensions. Thus the sum of the vectors $v:=(-1,0,2,4{)}^T$ and $w:=(2,1,-1,0{)}^T\in {ℝ}^4$ is just given by summing up the entries:

The scalar multiplication of $v:={(0,3,-1,\frac{1}{2})}^T\in {ℝ}^4$ with some $\alpha :=2$ is done by multiplying all entries separately:

Just as in ${ℝ}^4$ we can proceed in general also in ${ℝ}^n$. Let us now consider which properties of $ℝ$ guarantee that a computation with vectors in ${ℝ}^n$ is possible. We see from above examples that scalar multiplication and addition of vectors in each component corresponds to multiplication and of addition in $ℝ$, respectively. Thus we compute in the first component of addition $-1+2=1$. Likewise we have that for scalar multiplication in the third component $2\cdot (-1)=-2$.

So the arithmetic in ${ℝ}^n$ is traced back to the addition and multiplication in $ℝ$. Here we have another possibility for abstraction. A set in which one can add and multiply as in the real numbers is called a field (and $ℝ$ is such a field). So it should be sufficient if the numbers of the vector tuple come from a field. Thus we can form a vector space from every general field $K$. So it also works for other fields like the rational numbers $\mathbb{Q}$ or the complex numbers $ℂ$. Analogous to the ${ℝ}^n$ we start with the field $K$ and build up a vector space $K^n$ by adding further "independent directions".

Relation to polynomials Vorlage:Anker

Above we used vectors of ${ℝ}^n$ in tuple notation to describe systems with $n$ units of information. We find the structure of computing with tuples elsewhere as well. Consider the polynomial of degree 2 (a quadratic polynomial), given by $f(x)=7x^2+3x-2=7\cdot x^2+3\cdot x^1+(-2)\cdot x^0$. We always sort the summands such that the exponents are ordered descending from the degree of the polynomial 2 to $0$. In doing so, we note that this polynomial has similarities to the vector $(7,3,-2{)}^T$. Here the first coefficient of the polynomial is in the first component of the vector and so on. Basically, the vector encodes the polynomial.

We can observe the same similarity between addition and scalar multiplication of polynomials on the one hand and the associated operations of vectors on the other. Let us take the polynomials $f:ℝ\to ℝ$ with $f(x)=7x^2+3x-2$ and $g:ℝ\to ℝ$ with $g(x)=x^2+6$ and the scalar $\rho =-1$. We can write the polynomials as tuples:

<section begin=polynom_vektor /> Vorlage:Einrücken <section end=polynom_vektor />

Now we calculate $f(x)+g(x)$ in both forms of representation: <section begin=polynom-vektor_1 /> Vorlage:Einrücken <section end=polynom-vektor_1 />

Also the multiplication of $f(x)$ with the factor $\rho$ corresponds with the respective calculation in the associated vector tuples:

<section begin=polynom-vektor_2 /> Vorlage:Einrücken <section end=polynom-vektor_2 />

Every second degree polynomial can be uniquely represented by a three-dimensional vector in the way described. Conversely, every three-dimensional vector uniquely describes a second-degree polynomial. Thus we find a bijective map between the set of second degree polynomials and the ${ℝ}^3$. Similarly, there exists a bijective map between third degree polynomials and the ${ℝ}^4$ and in general between polynomials of $n$-th degree and the ${ℝ}^{n+1}$.

So far we have allowed as coefficients for polynomials all real numbers. We can also consider polynomials whose coefficients are elements of $\mathbb{Q}$. Accordingly, the entries of the corresponding vector are rational numbers. polynomials $n$-th degrees with rational coefficients thus correspond to vectors from the vector space ${\mathbb{Q}}^{n+1}$. Actually, instead of $ℝ$ or $\mathbb{Q}$, any field is allowed.

General vector spaces in mathematics

We have found that we can calculate with polynomials of degree $n$ in the same way as with vectors of $K^{n+1}$. Thus, the set of polynomials of degree $n$ has a similar structure compared to $K^{n+1}$. However, when considering all polynomials, that is, polynomials of any degree, we reach our limits with the notion of the $K^n$. In this set the polynomials can have arbitrary large exponents:

To describe this set by tuples, we need infinitely many entries. The space of all polynomials includes infinitely many dimensions, while in $K^n$ we are limited to $n$ dimensions. Thus the set of all polynomials cannot be expressed by a set $K^n$. Nevertheless, polynomials and tuples have a common structure, as we have already seen. This allows a further step of abstraction: by summarizing this common structure in a definition, we can talk about tuples as well as polynomials and about other sets with these structures.

What is this common structure? The commonality of polynomials and of tuples is that they can be added and scaled and that both operations behave similarly on both sets. This is the common structure that vector spaces have: vectors are objects that can be added and scaled.

We have noted a structural difference between the $K^n$ and the vector space of all polynomials. However, they have in common that their elements can be added and scaled. Thus it seems obvious to consider this property of vectors as the defining property of an every vector space.

Up to now we have not considered which calculation rules apply to the addition and scalar multiplication of vectors in general vector spaces. In $ℝ$ we have the associative and commutative law as well as the distributive law and we know neutral and inverse elements concerning addition and multiplication. As we have seen above, arithmetic in ${ℝ}^n$ can be traced back to arithmetic in $ℝ$. Accordingly certain calculation rules of the real numbers transfer to the vector space ${ℝ}^n$ and analogously of every field $K$ to the $K^n$.

Deriving the definition of a vector space

The addition, scalar multiplication and all associated arithmetic laws provide the formal definition of the vector space. The starting point of our description of a vector space is a set $V$ containing all vectors of a vector space. In order for our vector space $V$ to contain at least one vector, we require that $V$ has to be non-empty. We have seen that the essential structure of a vector space is given by the arithmetic operations performed on it. So we need to formally describe addition and scalar multiplication on a vector space.

The additive structure of a vector space

We have already required that a vector space $V$ should be a non-empty set. Now we define via axioms what properties its additive structure must have. First, we note that an addition of vectors is an inner operation $⊞:V\times V\to V$. So it is a map where two vectors are mapped to another vector. The function value is the sum of the two input vectors.

We denote this map with the symbol $⊞$. So $⊞(v,w)$ is the sum of the two vectors $v$ and $w$. The notation $⊞(v,w)$ is analogous to the notation $f(v,w)$, where instead of "$f$" we write the symbol "$⊞$". Instead of the notation $⊞(v,w)$ the so-called infix notation $v⊞w$ is usually used, which we want to use in the following.

We use here the operation sign "$⊞$" to better distinguish between the vector addition and of addition of numbers "$+$", which we can first consider independently. In most textbooks, the symbol "$+$" is also used for vector addition. Whether the addition of vectors or of numbers is meant, must be inferred from the respective context.For convenience, we will also later use the symbol "$+$" instead of "$⊞$".

To show that the set $V$ is provided with an operation "$⊞$", we write $(V,⊞)$. However, in order for us to consider "$⊞$" as an addition, this operation must satisfy certain characteristic properties that we already know from the addition of numbers. These are:

A set with an operation satisfying the above five axioms is also called an abelian group .

The scalar multiplication

We have already defined which properties the addition of vectors must fulfil. The scalar multiplication of vectors is still missing. So that we can distinguish the scalar multiplication of the normal number multiplication, we use for it first the symbol "$⊡$". In textbooks the symbol "$\cdot$" is used instead of "$⊡$" or the dot is even omitted completely. Which operation is meant then, results from the context. We will use this notation later. The scalar multiplication maps a number (scaling factor) and a vector to another vector.

The notation $\rho ⊡v$ means that $v$ is stretched (or compressed) by $\rho$. It is obvious to define the scalar by $\rho \in ℝ$. However, we can still generalize this. All sets, in which one can add and multiply similarly to the real numbers, come into question as basic set for scaling factors. Such a set is called a field (missing) in mathematics.

The properties of scalar multiplication "$⊡$" are similar to those of multiplication of numbers. We now want to define scalar multiplication formally by axioms. As with of addition, a non-empty set $V$ is the starting point of the definition. In addition, we need a field $K$. The scalar multiplication is an outer operation $⊡:K\times V\to V$ satisfying the following properties:

In order to be able to scale vectors, we also need a field $K$ in the definition of a vector space. This field contains the scaling factors. Therefore, vector spaces $V$ are always defined over a field $K$. We say "$V$ is a vector space over $K$" or briefly "$V$ is a $K$-vector space" to express that the scaling factors for $V$ come from $K$.

Definition of a vector space

We can write down our considerations in a compressed way to get the formal definition of a vector space:

{{#lst:Serlo: EN: Vector space|Definition}}

{{#invoke:Mathe für Nicht-Freaks/Seite|unten}}