Vector space

Template:Short description Template:Distinguish Template:Redirect

Vector addition and scalar multiplication: a vector Template:Math (blue) is added to another vector Template:Math (red, upper illustration). Below, Template:Math is stretched by a factor of 2, yielding the sum Template:Math.

In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, can be added together and multiplied ("scaled") by numbers called scalars. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. Real vector spaces and complex vector spaces are kinds of vector spaces based on different kinds of scalars: real numbers and complex numbers. Scalars can also be, more generally, elements of any field.

Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities (such as forces and velocity) that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrices, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear equations.

Vector spaces are characterized by their dimension, which, roughly speaking, specifies the number of independent directions in the space. This means that, for two vector spaces over a given field and with the same dimension, the properties that depend only on the vector-space structure are exactly the same (technically the vector spaces are isomorphic). A vector space is finite-dimensional if its dimension is a natural number. Otherwise, it is infinite-dimensional, and its dimension is an infinite cardinal. Finite-dimensional vector spaces occur naturally in geometry and related areas. Infinite-dimensional vector spaces occur in many areas of mathematics. For example, polynomial rings are countably infinite-dimensional vector spaces, and many function spaces have the cardinality of the continuum as a dimension.

Many vector spaces that are considered in mathematics are also endowed with other structures. This is the case of algebras, which include field extensions, polynomial rings, associative algebras and Lie algebras. This is also the case of topological vector spaces, which include function spaces, inner product spaces, normed spaces, Hilbert spaces and Banach spaces.

Template:Algebraic structures

Definition and basic propertiesEdit

In this article, vectors are represented in boldface to distinguish them from scalars.<ref group=nb>It is also common, especially in physics, to denote vectors with an arrow on top: <math>\vec v.</math> It is also common, especially in higher mathematics, to not use any typographical method for distinguishing vectors from other mathematical objects.</ref>Template:Sfn

A vector space over a field Template:Mvar is a non-empty set Template:Mvar together with a binary operation and a binary function that satisfy the eight axioms listed below. In this context, the elements of Template:Mvar are commonly called vectors, and the elements of Template:Mvar are called scalars.Template:Sfn

The binary operation, called vector addition or simply addition assigns to any two vectors Template:Math and Template:Math in Template:Mvar a third vector in Template:Mvar which is commonly written as Template:Math, and called the sum of these two vectors.

The binary function, called scalar multiplication, assigns to any scalar Template:Mvar in Template:Mvar and any vector Template:Math in Template:Mvar another vector in Template:Mvar, which is denoted Template:Math.<ref group=nb>Scalar multiplication is not to be confused with the scalar product, which is an additional operation on some specific vector spaces, called inner product spaces. Scalar multiplication is the multiplication of a vector by a scalar that produces a vector, while the scalar product is a multiplication of two vectors that produces a scalar.</ref>

To have a vector space, the eight following axioms must be satisfied for every Template:Math, Template:Math and Template:Math in Template:Mvar, and Template:Mvar and Template:Mvar in Template:Mvar.Template:Sfn

Axiom	Statement
Associativity of vector addition	Template:Math
Commutativity of vector addition	Template:Math
Identity element of vector addition	There exists an element Template:Math, called the zero vector, such that Template:Math for all Template:Math.
Inverse elements of vector addition	For every Template:Math, there exists an element Template:Math, called the additive inverse of Template:Math, such that Template:Math.
Compatibility of scalar multiplication with field multiplication	Template:Math <ref group=nb>This axiom is not an associative property, since it refers to two different operations, scalar multiplication and field multiplication. So, it is independent from the associativity of field multiplication, which is assumed by field axioms.</ref>
Identity element of scalar multiplication	Template:Math, where Template:Math denotes the multiplicative identity in Template:Mvar.
Distributivity of scalar multiplication with respect to vector addition	Template:Math
Distributivity of scalar multiplication with respect to field addition	Template:Math

When the scalar field is the real numbers, the vector space is called a real vector space, and when the scalar field is the complex numbers, the vector space is called a complex vector space.Template:Sfn These two cases are the most common ones, but vector spaces with scalars in an arbitrary field Template:Mvar are also commonly considered. Such a vector space is called an Template:Nowrapvector space or a vector space over Template:Mvar.Template:Sfnm

An equivalent definition of a vector space can be given, which is much more concise but less elementary: the first four axioms (related to vector addition) say that a vector space is an abelian group under addition, and the four remaining axioms (related to the scalar multiplication) say that this operation defines a ring homomorphism from the field Template:Math into the endomorphism ring of this group.Template:Sfn

Subtraction of two vectors can be defined as <math display=block>\mathbf{v} - \mathbf{w} = \mathbf{v} + (-\mathbf{w}).</math>

Direct consequences of the axioms include that, for every <math>s\in F</math> and <math>\mathbf v\in V,</math> one has

<math>0\mathbf v = \mathbf 0,</math>
<math>s\mathbf 0=\mathbf 0,</math>
<math>(-1)\mathbf v = -\mathbf v,</math>
<math>s\mathbf v = \mathbf 0</math> implies <math>s=0</math> or <math>\mathbf v= \mathbf 0.</math>

Even more concisely, a vector space is a module over a field.Template:Sfn

Bases, vector coordinates, and subspacesEdit

File:Vector components and base change.svg

A vector Template:Math in Template:Math (blue) expressed in terms of different bases: using the standard basis of Template:Math: Template:Math (black), and using a different, non-orthogonal basis: Template:Math (red).

Linear combination: Given a set Template:Mvar of elements of a Template:Mvar-vector space Template:Mvar, a linear combination of elements of Template:Mvar is an element of Template:Mvar of the form <math display=block> a_1 \mathbf{g}_1 + a_2 \mathbf{g}_2 + \cdots + a_k \mathbf{g}_k,</math> where <math>a_1, \ldots, a_k\in F</math> and <math>\mathbf{g}_1, \ldots, \mathbf{g}_k\in G.</math> The scalars <math>a_1, \ldots, a_k</math> are called the coefficients of the linear combination.Template:Sfn
Linear independence: The elements of a subset Template:Mvar of a Template:Mvar-vector space Template:Mvar are said to be linearly independent if no element of Template:Mvar can be written as a linear combination of the other elements of Template:Mvar. Equivalently, they are linearly independent if two linear combinations of elements of Template:Mvar define the same element of Template:Mvar if and only if they have the same coefficients. Also equivalently, they are linearly independent if a linear combination results in the zero vector if and only if all its coefficients are zero.Template:Sfn
Linear subspace: A linear subspace or vector subspace Template:Mvar of a vector space Template:Mvar is a non-empty subset of Template:Mvar that is closed under vector addition and scalar multiplication; that is, the sum of two elements of Template:Mvar and the product of an element of Template:Mvar by a scalar belong to Template:Mvar.Template:Sfn This implies that every linear combination of elements of Template:Mvar belongs to Template:Mvar. A linear subspace is a vector space for the induced addition and scalar multiplication; this means that the closure property implies that the axioms of a vector space are satisfied.Template:Sfn
The closure property also implies that every intersection of linear subspaces is a linear subspace.Template:Sfn
Linear span: Given a subset Template:Mvar of a vector space Template:Mvar, the linear span or simply the span of Template:Mvar is the smallest linear subspace of Template:Mvar that contains Template:Mvar, in the sense that it is the intersection of all linear subspaces that contain Template:Mvar. The span of Template:Mvar is also the set of all linear combinations of elements of Template:Mvar.
If Template:Mvar is the span of Template:Mvar, one says that Template:Mvar spans or generates Template:Mvar, and that Template:Mvar is a spanning set or a generating set of Template:Mvar.Template:Sfn
Basis and dimension: A subset of a vector space is a basis if its elements are linearly independent and span the vector space.Template:Sfnm Every vector space has at least one basis, or many in general (see Template:Slink).Template:Sfn Moreover, all bases of a vector space have the same cardinality, which is called the dimension of the vector space (see Dimension theorem for vector spaces).Template:Sfn This is a fundamental property of vector spaces, which is detailed in the remainder of the section.

Bases are a fundamental tool for the study of vector spaces, especially when the dimension is finite. In the infinite-dimensional case, the existence of infinite bases, often called Hamel bases, depends on the axiom of choice. It follows that, in general, no base can be explicitly described.Template:Sfn For example, the real numbers form an infinite-dimensional vector space over the rational numbers, for which no specific basis is known.

Consider a basis <math>(\mathbf{b}_1, \mathbf{b}_2 , \ldots, \mathbf{b}_n)</math> of a vector space Template:Mvar of dimension Template:Mvar over a field Template:Mvar. The definition of a basis implies that every <math>\mathbf v \in V</math> may be written <math display=block>\mathbf v = a_1 \mathbf b_1 + \cdots + a_n \mathbf b_n,</math> with <math>a_1,\dots, a_n</math> in Template:Mvar, and that this decomposition is unique. The scalars <math>a_1, \ldots, a_n</math> are called the coordinates of Template:Math on the basis. They are also said to be the coefficients of the decomposition of Template:Math on the basis. One also says that the Template:Mvar-tuple of the coordinates is the coordinate vector of Template:Math on the basis, since the set <math>F^n</math> of the Template:Mvar-tuples of elements of Template:Mvar is a vector space for componentwise addition and scalar multiplication, whose dimension is Template:Mvar.

The one-to-one correspondence between vectors and their coordinate vectors maps vector addition to vector addition and scalar multiplication to scalar multiplication. It is thus a vector space isomorphism, which allows translating reasonings and computations on vectors into reasonings and computations on their coordinates.Template:Sfn

HistoryEdit

Vector spaces stem from affine geometry, via the introduction of coordinates in the plane or three-dimensional space. Around 1636, French mathematicians René Descartes and Pierre de Fermat founded analytic geometry by identifying solutions to an equation of two variables with points on a plane curve.Template:Sfn To achieve geometric solutions without using coordinates, Bolzano introduced, in 1804, certain operations on points, lines, and planes, which are predecessors of vectors.Template:Sfn Template:Harvtxt introduced the notion of barycentric coordinates.Template:Sfn Template:Harvtxt introduced an equivalence relation on directed line segments that share the same length and direction which he called equipollence.Template:Sfn A Euclidean vector is then an equivalence class of that relation.Template:Sfn

Vectors were reconsidered with the presentation of complex numbers by Argand and Hamilton and the inception of quaternions by the latter.Template:Sfn They are elements in R² and R⁴; treating them using linear combinations goes back to Laguerre in 1867, who also defined systems of linear equations.

In 1857, Cayley introduced the matrix notation which allows for harmonization and simplification of linear maps. Around the same time, Grassmann studied the barycentric calculus initiated by Möbius. He envisaged sets of abstract objects endowed with operations.Template:Sfn In his work, the concepts of linear independence and dimension, as well as scalar products are present. Grassmann's 1844 work exceeds the framework of vector spaces as well since his considering multiplication led him to what are today called algebras. Italian mathematician Peano was the first to give the modern definition of vector spaces and linear maps in 1888,Template:Sfn although he called them "linear systems".Template:Sfn Peano's axiomatization allowed for vector spaces with infinite dimension, but Peano did not develop that theory further. In 1897, Salvatore Pincherle adopted Peano's axioms and made initial inroads into the theory of infinite-dimensional vector spaces.Template:Sfn

An important development of vector spaces is due to the construction of function spaces by Henri Lebesgue. This was later formalized by Banach and Hilbert, around 1920.Template:Sfn At that time, algebra and the new field of functional analysis began to interact, notably with key concepts such as spaces of p-integrable functions and Hilbert spaces.Template:Sfnm

ExamplesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

Arrows in the planeEdit

Template:Multiple image

The first example of a vector space consists of arrows in a fixed plane, starting at one fixed point. This is used in physics to describe forces or velocities.Template:Sfn Given any two such arrows, Template:Math and Template:Math, the parallelogram spanned by these two arrows contains one diagonal arrow that starts at the origin, too. This new arrow is called the sum of the two arrows, and is denoted Template:Math. In the special case of two arrows on the same line, their sum is the arrow on this line whose length is the sum or the difference of the lengths, depending on whether the arrows have the same direction. Another operation that can be done with arrows is scaling: given any positive real number Template:Math, the arrow that has the same direction as Template:Math, but is dilated or shrunk by multiplying its length by Template:Math, is called multiplication of Template:Math by Template:Math. It is denoted Template:Math. When Template:Math is negative, Template:Math is defined as the arrow pointing in the opposite direction instead.Template:Sfn

The following shows a few examples: if Template:Math, the resulting vector Template:Math has the same direction as Template:Math, but is stretched to the double length of Template:Math (the second image). Equivalently, Template:Math is the sum Template:Math. Moreover, Template:Math has the opposite direction and the same length as Template:Math (blue vector pointing down in the second image).

Ordered pairs of numbersEdit

A second key example of a vector space is provided by pairs of real numbers Template:Mvar and Template:Mvar. The order of the components Template:Mvar and Template:Mvar is significant, so such a pair is also called an ordered pair. Such a pair is written as Template:Math. The sum of two such pairs and the multiplication of a pair with a number is defined as follows:Template:Sfn <math display="block">

\begin{align}
(x_1 , y_1) + (x_2 , y_2) &= (x_1 + x_2, y_1 + y_2), \\
a(x, y) &= (ax, ay).

\end{align} </math>

The first example above reduces to this example if an arrow is represented by a pair of Cartesian coordinates of its endpoint.

Coordinate spaceEdit

The simplest example of a vector space over a field Template:Math is the field Template:Math itself with its addition viewed as vector addition and its multiplication viewed as scalar multiplication. More generally, all [[tuple|Template:Math-tuples]] (sequences of length Template:Math) <math display=block>(a_1, a_2, \dots, a_n)</math> of elements Template:Math of Template:Math form a vector space that is usually denoted Template:Math and called a coordinate space.Template:Sfn The case Template:Math is the above-mentioned simplest example, in which the field Template:Math is also regarded as a vector space over itself. The case Template:Math and Template:Math (so R²) reduces to the previous example.

Complex numbers and other field extensionsEdit

The set of complex numbers Template:Math, numbers that can be written in the form Template:Math for real numbers Template:Math and Template:Math where Template:Math is the imaginary unit, form a vector space over the reals with the usual addition and multiplication: Template:Math and Template:Math for real numbers Template:Math, Template:Math, Template:Math, Template:Math and Template:Math. The various axioms of a vector space follow from the fact that the same rules hold for complex number arithmetic. The example of complex numbers is essentially the same as (that is, it is isomorphic to) the vector space of ordered pairs of real numbers mentioned above: if we think of the complex number Template:Math as representing the ordered pair Template:Math in the complex plane then we see that the rules for addition and scalar multiplication correspond exactly to those in the earlier example.

More generally, field extensions provide another class of examples of vector spaces, particularly in algebra and algebraic number theory: a field Template:Math containing a smaller field Template:Math is an Template:Math-vector space, by the given multiplication and addition operations of Template:Math.Template:Sfn For example, the complex numbers are a vector space over Template:Math, and the field extension <math>\mathbf{Q}(i\sqrt{5})</math> is a vector space over Template:Math.

Function spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Example for addition of functions.svg

Addition of functions: the sum of the sine and the exponential function is <math>\sin+\exp:\R\to\R</math> with <math>(\sin+\exp)(x)=\sin(x)+\exp(x)</math>.

Functions from any fixed set Template:Math to a field Template:Math also form vector spaces, by performing addition and scalar multiplication pointwise. That is, the sum of two functions Template:Math and Template:Math is the function <math>(f + g)</math> given by <math display=block>(f + g)(w) = f(w) + g(w),</math> and similarly for multiplication. Such function spaces occur in many geometric situations, when Template:Math is the real line or an interval, or other subsets of Template:Math. Many notions in topology and analysis, such as continuity, integrability or differentiability are well-behaved with respect to linearity: sums and scalar multiples of functions possessing such a property still have that property.Template:Sfn Therefore, the set of such functions are vector spaces, whose study belongs to functional analysis.

Linear equationsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Systems of homogeneous linear equations are closely tied to vector spaces.Template:Sfn For example, the solutions of <math display=block>\begin{alignat}{9}

 && a \,&&+\, 3 b \,&\, + &\,   & c & \,= 0 \\

4 && a \,&&+\, 2 b \,&\, + &\, 2 & c & \,= 0 \\ \end{alignat}</math> are given by triples with arbitrary <math>a,</math> <math>b = a / 2,</math> and <math>c = -5 a / 2.</math> They form a vector space: sums and scalar multiples of such triples still satisfy the same ratios of the three variables; thus they are solutions, too. Matrices can be used to condense multiple linear equations as above into one vector equation, namely

<math display=block>A \mathbf{x} = \mathbf{0},</math>

where <math>A = \begin{bmatrix} 1 & 3 & 1 \\ 4 & 2 & 2\end{bmatrix}</math> is the matrix containing the coefficients of the given equations, <math>\mathbf{x}</math> is the vector <math>(a, b, c),</math> <math>A \mathbf{x}</math> denotes the matrix product, and <math>\mathbf{0} = (0, 0)</math> is the zero vector. In a similar vein, the solutions of homogeneous linear differential equations form vector spaces. For example,

<math display=block>f^{\prime\prime}(x) + 2 f^\prime(x) + f(x) = 0</math>

yields <math>f(x) = a e^{-x} + b x e^{-x},</math> where <math>a</math> and <math>b</math> are arbitrary constants, and <math>e^x</math> is the natural exponential function.

Linear maps and matricesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} The relation of two vector spaces can be expressed by linear map or linear transformation. They are functions that reflect the vector space structure, that is, they preserve sums and scalar multiplication: <math display=block> \begin{align}

f(\mathbf{v} + \mathbf{w}) &= f(\mathbf{v}) + f(\mathbf{w}), \\ 
f(a \cdot \mathbf{v}) &= a \cdot f(\mathbf{v})

\end{align} </math> for all <math>\mathbf{v}</math> and <math>\mathbf{w}</math> in <math>V,</math> all <math>a</math> in <math>F.</math>Template:Sfn

An isomorphism is a linear map Template:Math such that there exists an inverse map Template:Math, which is a map such that the two possible compositions Template:Math and Template:Math are identity maps. Equivalently, Template:Math is both one-to-one (injective) and onto (surjective).Template:Sfn If there exists an isomorphism between Template:Math and Template:Math, the two spaces are said to be isomorphic; they are then essentially identical as vector spaces, since all identities holding in Template:Math are, via Template:Math, transported to similar ones in Template:Math, and vice versa via Template:Math.

File:Vector components.svg

Describing an arrow vector Template:Math by its coordinates Template:Math and Template:Math yields an isomorphism of vector spaces.

For example, the arrows in the plane and the ordered pairs of numbers vector spaces in the introduction above (see Template:Slink) are isomorphic: a planar arrow Template:Math departing at the origin of some (fixed) coordinate system can be expressed as an ordered pair by considering the Template:Math- and Template:Math-component of the arrow, as shown in the image at the right. Conversely, given a pair Template:Math, the arrow going by Template:Math to the right (or to the left, if Template:Math is negative), and Template:Math up (down, if Template:Math is negative) turns back the arrow Template:Math.Template:Sfn

Linear maps Template:Math between two vector spaces form a vector space Template:Math, also denoted Template:Math, or Template:Math.Template:Sfn The space of linear maps from Template:Math to Template:Math is called the dual vector space, denoted Template:Math.Template:Sfn Via the injective natural map Template:Math, any vector space can be embedded into its bidual; the map is an isomorphism if and only if the space is finite-dimensional.Template:Sfn

Once a basis of Template:Math is chosen, linear maps Template:Math are completely determined by specifying the images of the basis vectors, because any element of Template:Math is expressed uniquely as a linear combination of them.Template:Sfn If Template:Math, a 1-to-1 correspondence between fixed bases of Template:Math and Template:Math gives rise to a linear map that maps any basis element of Template:Math to the corresponding basis element of Template:Math. It is an isomorphism, by its very definition.Template:Sfn Therefore, two vector spaces over a given field are isomorphic if their dimensions agree and vice versa. Another way to express this is that any vector space over a given field is completely classified (up to isomorphism) by its dimension, a single number. In particular, any n-dimensional Template:Math-vector space Template:Math is isomorphic to Template:Math. However, there is no "canonical" or preferred isomorphism; an isomorphism Template:Math is equivalent to the choice of a basis of Template:Math, by mapping the standard basis of Template:Math to Template:Math, via Template:Math.

MatricesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Matrix.svg

A typical matrix

Matrices are a useful notion to encode linear maps.Template:Sfn They are written as a rectangular array of scalars as in the image at the right. Any Template:Math-by-Template:Math matrix <math>A</math> gives rise to a linear map from Template:Math to Template:Math, by the following <math display=block>\mathbf x = (x_1, x_2, \ldots, x_n) \mapsto \left(\sum_{j=1}^n a_{1j}x_j, \sum_{j=1}^n a_{2j}x_j, \ldots, \sum_{j=1}^n a_{mj}x_j \right),</math> where <math display="inline">\sum</math> denotes summation, or by using the matrix multiplication of the matrix <math>A</math> with the coordinate vector <math>\mathbf{x}</math>:

<math display=block>\mathbf{x} \mapsto A \mathbf{x}.</math>

Moreover, after choosing bases of Template:Math and Template:Math, any linear map Template:Math is uniquely represented by a matrix via this assignment.Template:Sfn

File:Determinant parallelepiped.svg

The volume of this parallelepiped is the absolute value of the determinant of the 3-by-3 matrix formed by the vectors Template:Math, Template:Math, and Template:Math.

The determinant Template:Math of a square matrix Template:Math is a scalar that tells whether the associated map is an isomorphism or not: to be so it is sufficient and necessary that the determinant is nonzero.Template:Sfn The linear transformation of Template:Math corresponding to a real n-by-n matrix is orientation preserving if and only if its determinant is positive.

Eigenvalues and eigenvectorsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Endomorphisms, linear maps Template:Math, are particularly important since in this case vectors Template:Math can be compared with their image under Template:Math, Template:Math. Any nonzero vector Template:Math satisfying Template:Math, where Template:Math is a scalar, is called an eigenvector of Template:Math with eigenvalue Template:Math.Template:Sfn Equivalently, Template:Math is an element of the kernel of the difference Template:Math (where Id is the identity map Template:Math. If Template:Math is finite-dimensional, this can be rephrased using determinants: Template:Math having eigenvalue Template:Math is equivalent to <math display=block>\det(f - \lambda \cdot \operatorname{Id}) = 0.</math> By spelling out the definition of the determinant, the expression on the left hand side can be seen to be a polynomial function in Template:Math, called the characteristic polynomial of Template:Math.Template:Sfn If the field Template:Math is large enough to contain a zero of this polynomial (which automatically happens for Template:Math algebraically closed, such as Template:Math) any linear map has at least one eigenvector. The vector space Template:Math may or may not possess an eigenbasis, a basis consisting of eigenvectors. This phenomenon is governed by the Jordan canonical form of the map.Template:Sfn The set of all eigenvectors corresponding to a particular eigenvalue of Template:Math forms a vector space known as the eigenspace corresponding to the eigenvalue (and Template:Math) in question.

Basic constructionsEdit

In addition to the above concrete examples, there are a number of standard linear algebraic constructions that yield vector spaces related to given ones.

Subspaces and quotient spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Linear subspaces with shading.svg

A line passing through the origin (blue, thick) in Template:Math is a linear subspace. It is the intersection of two planes (green and yellow).

A nonempty subset <math>W</math> of a vector space <math>V</math> that is closed under addition and scalar multiplication (and therefore contains the <math>\mathbf{0}</math>-vector of <math>V</math>) is called a linear subspace of <math> V </math>, or simply a subspace of <math> V </math>, when the ambient space is unambiguously a vector space.Template:Sfn<ref group=nb>This is typically the case when a vector space is also considered as an affine space. In this case, a linear subspace contains the zero vector, while an affine subspace does not necessarily contain it.</ref> Subspaces of <math>V</math> are vector spaces (over the same field) in their own right. The intersection of all subspaces containing a given set <math>S</math> of vectors is called its span, and it is the smallest subspace of <math>V</math> containing the set <math>S</math>. Expressed in terms of elements, the span is the subspace consisting of all the linear combinations of elements of <math>S</math>.Template:Sfn

Template:AnchorLinear subspace of dimension 1 and 2 are referred to as a line (also vector line), and a plane respectively. If W is an n-dimensional vector space, any subspace of dimension 1 less, i.e., of dimension <math>n-1</math> is called a hyperplane.Template:Sfn

The counterpart to subspaces are quotient vector spaces.Template:Sfn Given any subspace <math>W \subseteq V</math>, the quotient space <math>V / W</math> ("<math>V</math> modulo <math>W</math>") is defined as follows: as a set, it consists of <math display="block">\mathbf{v} + W = \{\mathbf{v} + \mathbf{w} : \mathbf{w} \in W\},</math> where <math>\mathbf{v}</math> is an arbitrary vector in <math>V</math>. The sum of two such elements <math>\mathbf{v}_1 + W</math> and <math>\mathbf{v}_2 + W</math> is <math>\left(\mathbf{v}_1 + \mathbf{v}_2\right) + W</math>, and scalar multiplication is given by <math>a \cdot (\mathbf{v} + W) = (a \cdot \mathbf{v}) + W</math>. The key point in this definition is that <math>\mathbf{v}_1 + W = \mathbf{v}_2 + W</math> if and only if the difference of <math>\mathbf{v}_1</math> and <math>\mathbf{v}_2</math> lies in <math>W</math>.<ref group=nb>Some authors, such as Template:Harvtxt, choose to start with this equivalence relation and derive the concrete shape of <math>V / W</math> from this.</ref> This way, the quotient space "forgets" information that is contained in the subspace <math>W</math>.

The kernel <math>\ker(f)</math> of a linear map <math>f : V \to W</math> consists of vectors <math>\mathbf{v}</math> that are mapped to <math>\mathbf{0}</math> in <math>W</math>.Template:Sfn The kernel and the image <math>\operatorname{im}(f) = \{f(\mathbf{v}) : \mathbf{v} \in V\}</math> are subspaces of <math>V</math> and <math>W</math>, respectively.Template:Sfn

An important example is the kernel of a linear map <math>\mathbf{x} \mapsto A \mathbf{x}</math> for some fixed matrix <math>A</math>. The kernel of this map is the subspace of vectors <math>\mathbf{x}</math> such that <math>A \mathbf{x} = \mathbf{0}</math>, which is precisely the set of solutions to the system of homogeneous linear equations belonging to <math>A</math>. This concept also extends to linear differential equations <math display=block>a_0 f + a_1 \frac{d f}{d x} + a_2 \frac{d^2 f}{d x^2} + \cdots + a_n \frac{d^n f}{d x^n} = 0,</math> where the coefficients <math>a_i</math> are functions in <math>x,</math> too. In the corresponding map <math display=block>f \mapsto D(f) = \sum_{i=0}^n a_i \frac{d^i f}{d x^i},</math> the derivatives of the function <math>f</math> appear linearly (as opposed to <math>f^{\prime\prime}(x)^2</math>, for example). Since differentiation is a linear procedure (that is, <math>(f + g)^\prime = f^\prime + g^\prime</math> and <math>(c \cdot f)^\prime = c \cdot f^\prime</math> for a constant <math>c</math>) this assignment is linear, called a linear differential operator. In particular, the solutions to the differential equation <math>D(f) = 0</math> form a vector space (over Template:Math or Template:Math).Template:Sfn

The existence of kernels and images is part of the statement that the category of vector spaces (over a fixed field <math>F</math>) is an abelian category, that is, a corpus of mathematical objects and structure-preserving maps between them (a category) that behaves much like the category of abelian groups.Template:Sfn Because of this, many statements such as the first isomorphism theorem (also called rank–nullity theorem in matrix-related terms) <math display=block>V / \ker(f) \; \equiv \; \operatorname{im}(f)</math> and the second and third isomorphism theorem can be formulated and proven in a way very similar to the corresponding statements for groups.

Direct product and direct sumEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} The direct product of vector spaces and the direct sum of vector spaces are two ways of combining an indexed family of vector spaces into a new vector space.

The direct product <math>\textstyle{\prod_{i \in I} V_i}</math> of a family of vector spaces <math>V_i</math> consists of the set of all tuples <math>\left(\mathbf{v}_i\right)_{i \in I}</math>, which specify for each index <math>i</math> in some index set <math>I</math> an element <math>\mathbf{v}_i</math> of <math>V_i</math>.Template:Sfn Addition and scalar multiplication is performed componentwise. A variant of this construction is the direct sum <math display="inline">\bigoplus_{i \in I} V_i</math> (also called coproduct and denoted <math display="inline">\coprod_{i \in I}V_i</math>), where only tuples with finitely many nonzero vectors are allowed. If the index set <math>I</math> is finite, the two constructions agree, but in general they are different.

Tensor productEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} The tensor product <math>V \otimes_F W,</math> or simply <math>V \otimes W,</math> of two vector spaces <math>V</math> and <math>W</math> is one of the central notions of multilinear algebra which deals with extending notions such as linear maps to several variables. A map <math>g : V \times W \to X</math> from the Cartesian product <math>V \times W</math> is called bilinear if <math>g</math> is linear in both variables <math>\mathbf{v}</math> and <math>\mathbf{w}.</math> That is to say, for fixed <math>\mathbf{w}</math> the map <math>\mathbf{v} \mapsto g(\mathbf{v}, \mathbf{w})</math> is linear in the sense above and likewise for fixed <math>\mathbf{v}.</math>

File:Universal tensor prod.svg

Commutative diagram depicting the universal property of the tensor product

The tensor product is a particular vector space that is a universal recipient of bilinear maps <math>g,</math> as follows. It is defined as the vector space consisting of finite (formal) sums of symbols called tensors <math display=block>\mathbf{v}_1 \otimes \mathbf{w}_1 + \mathbf{v}_2 \otimes \mathbf{w}_2 + \cdots + \mathbf{v}_n \otimes \mathbf{w}_n,</math> subject to the rulesTemplate:Sfn <math display=block>\begin{alignat}{6} a \cdot (\mathbf{v} \otimes \mathbf{w}) ~&=~ (a \cdot \mathbf{v}) \otimes \mathbf{w} ~=~ \mathbf{v} \otimes (a \cdot \mathbf{w}), && ~~\text{ where } a \text{ is a scalar} \\ (\mathbf{v}_1 + \mathbf{v}_2) \otimes \mathbf{w} ~&=~ \mathbf{v}_1 \otimes \mathbf{w} + \mathbf{v}_2 \otimes \mathbf{w} && \\ \mathbf{v} \otimes (\mathbf{w}_1 + \mathbf{w}_2) ~&=~ \mathbf{v} \otimes \mathbf{w}_1 + \mathbf{v} \otimes \mathbf{w}_2. && \\ \end{alignat}</math> These rules ensure that the map <math>f</math> from the <math>V \times W</math> to <math>V \otimes W</math> that maps a tuple <math>(\mathbf{v}, \mathbf{w})</math> to <math>\mathbf{v} \otimes \mathbf{w}</math> is bilinear. The universality states that given any vector space <math>X</math> and any bilinear map <math>g : V \times W \to X,</math> there exists a unique map <math>u,</math> shown in the diagram with a dotted arrow, whose composition with <math>f</math> equals <math>g:</math> <math>u(\mathbf{v} \otimes \mathbf{w}) = g(\mathbf{v}, \mathbf{w}).</math><ref>Template:Harvtxt, Th. 14.3. See also Yoneda lemma.</ref> This is called the universal property of the tensor product, an instance of the method—much used in advanced abstract algebra—to indirectly define objects by specifying maps from or to this object.

Vector spaces with additional structureEdit

From the point of view of linear algebra, vector spaces are completely understood insofar as any vector space over a given field is characterized, up to isomorphism, by its dimension. However, vector spaces per se do not offer a framework to deal with the question—crucial to analysis—whether a sequence of functions converges to another function. Likewise, linear algebra is not adapted to deal with infinite series, since the addition operation allows only finitely many terms to be added. Therefore, the needs of functional analysis require considering additional structures.Template:Sfn

A vector space may be given a partial order <math>\,\leq,\,</math> under which some vectors can be compared.Template:Sfn For example, <math>n</math>-dimensional real space <math>\mathbf{R}^n</math> can be ordered by comparing its vectors componentwise. Ordered vector spaces, for example Riesz spaces, are fundamental to Lebesgue integration, which relies on the ability to express a function as a difference of two positive functions <math display=block>f = f^+ - f^-.</math> where <math>f^+</math> denotes the positive part of <math>f</math> and <math>f^-</math> the negative part.Template:Sfn

Normed vector spaces and inner product spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} "Measuring" vectors is done by specifying a norm, a datum which measures lengths of vectors, or by an inner product, which measures angles between vectors. Norms and inner products are denoted <math>| \mathbf v|</math> and Template:Nowrap respectively. The datum of an inner product entails that lengths of vectors can be defined too, by defining the associated norm Template:Nowrap Vector spaces endowed with such data are known as normed vector spaces and inner product spaces, respectively.Template:Sfn

Coordinate space <math>F^n</math> can be equipped with the standard dot product: <math display=block>\lang \mathbf x , \mathbf y \rang = \mathbf x \cdot \mathbf y = x_1 y_1 + \cdots + x_n y_n.</math> In <math>\mathbf{R}^2,</math> this reflects the common notion of the angle between two vectors <math>\mathbf{x}</math> and <math>\mathbf{y},</math> by the law of cosines: <math display=block>\mathbf x \cdot \mathbf y = \cos\left(\angle (\mathbf x, \mathbf y)\right) \cdot |\mathbf x| \cdot |\mathbf y|.</math> Because of this, two vectors satisfying <math>\lang \mathbf x , \mathbf y \rang = 0</math> are called orthogonal. An important variant of the standard dot product is used in Minkowski space: <math>\mathbf{R}^4</math> endowed with the Lorentz productTemplate:Sfn <math display=block>\lang \mathbf x | \mathbf y \rang = x_1 y_1 + x_2 y_2 + x_3 y_3 - x_4 y_4.</math> In contrast to the standard dot product, it is not positive definite: <math>\lang \mathbf x | \mathbf x \rang</math> also takes negative values, for example, for <math>\mathbf x = (0, 0, 0, 1).</math> Singling out the fourth coordinate—corresponding to time, as opposed to three space-dimensions—makes it useful for the mathematical treatment of special relativity. Note that in other conventions time is often written as the first, or "zeroeth" component so that the Lorentz product is written <math display=block>\lang \mathbf x | \mathbf y \rang = - x_0 y_0+x_1 y_1 + x_2 y_2 + x_3 y_3.</math>

Topological vector spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Convergence questions are treated by considering vector spaces <math>V</math> carrying a compatible topology, a structure that allows one to talk about elements being close to each other.Template:Sfnm Compatible here means that addition and scalar multiplication have to be continuous maps. Roughly, if <math>\mathbf{x}</math> and <math>\mathbf{y}</math> in <math>V</math>, and <math>a</math> in <math>F</math> vary by a bounded amount, then so do <math>\mathbf{x} + \mathbf{y}</math> and <math>a \mathbf{x}.</math><ref group=nb>This requirement implies that the topology gives rise to a uniform structure, Template:Harvtxt, loc = ch. II.</ref> To make sense of specifying the amount a scalar changes, the field <math>F</math> also has to carry a topology in this context; a common choice is the reals or the complex numbers.

In such topological vector spaces one can consider series of vectors. The infinite sum <math display=block>\sum_{i=1}^\infty f_i ~=~ \lim_{n \to \infty} f_1 + \cdots + f_n</math> denotes the limit of the corresponding finite partial sums of the sequence <math>f_1, f_2, \ldots</math> of elements of <math>V.</math> For example, the <math>f_i</math> could be (real or complex) functions belonging to some function space <math>V,</math> in which case the series is a function series. The mode of convergence of the series depends on the topology imposed on the function space. In such cases, pointwise convergence and uniform convergence are two prominent examples.Template:Sfn

File:Vector norms2.svg

Unit "spheres" in <math>\mathbf{R}^2</math> consist of plane vectors of norm 1. Depicted are the unit spheres in different <math>p</math>-norms, for <math>p = 1, 2,</math> and <math>\infty.</math> The bigger diamond depicts points of 1-norm equal to 2.

A way to ensure the existence of limits of certain infinite series is to restrict attention to spaces where any Cauchy sequence has a limit; such a vector space is called complete. Roughly, a vector space is complete provided that it contains all necessary limits. For example, the vector space of polynomials on the unit interval <math>[0, 1],</math> equipped with the topology of uniform convergence is not complete because any continuous function on <math>[0, 1]</math> can be uniformly approximated by a sequence of polynomials, by the Weierstrass approximation theorem.<ref>Template:Harvnb</ref> In contrast, the space of all continuous functions on <math>[0, 1]</math> with the same topology is complete.<ref>Template:Harvnb</ref> A norm gives rise to a topology by defining that a sequence of vectors <math>\mathbf{v}_n</math> converges to <math>\mathbf{v}</math> if and only if <math display=block>\lim_{n \to \infty} |\mathbf v_n - \mathbf v| = 0.</math> Banach and Hilbert spaces are complete topological vector spaces whose topologies are given, respectively, by a norm and an inner product. Their study—a key piece of functional analysis—focuses on infinite-dimensional vector spaces, since all norms on finite-dimensional topological vector spaces give rise to the same notion of convergence.Template:Sfn The image at the right shows the equivalence of the <math>1</math>-norm and <math>\infty</math>-norm on <math>\mathbf{R}^2:</math> as the unit "balls" enclose each other, a sequence converges to zero in one norm if and only if it so does in the other norm. In the infinite-dimensional case, however, there will generally be inequivalent topologies, which makes the study of topological vector spaces richer than that of vector spaces without additional data.

From a conceptual point of view, all notions related to topological vector spaces should match the topology. For example, instead of considering all linear maps (also called functionals) <math>V \to W,</math> maps between topological vector spaces are required to be continuous.Template:Sfn In particular, the (topological) dual space <math>V^*</math> consists of continuous functionals <math>V \to \mathbf{R}</math> (or to <math>\mathbf{C}</math>). The fundamental Hahn–Banach theorem is concerned with separating subspaces of appropriate topological vector spaces by continuous functionals.Template:Sfn

Banach spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Banach spaces, introduced by Stefan Banach, are complete normed vector spaces.Template:Sfn

A first example is the vector space <math>\ell^p</math> consisting of infinite vectors with real entries <math>\mathbf{x} = \left(x_1, x_2, \ldots, x_n, \ldots\right)</math> whose <math>p</math>-norm <math>(1 \leq p \leq \infty)</math> given by <math display=block>\|\mathbf{x}\|_\infty := \sup_i |x_i| \qquad \text{ for } p = \infty, \text{ and }</math> <math display=block>\|\mathbf{x}\|_p := \left(\sum_i |x_i|^p\right)^\frac{1}{p} \qquad \text{ for } p < \infty.</math>

The topologies on the infinite-dimensional space <math>\ell^p</math> are inequivalent for different <math>p.</math> For example, the sequence of vectors <math>\mathbf{x}_n = \left(2^{-n}, 2^{-n}, \ldots, 2^{-n}, 0, 0, \ldots\right),</math> in which the first <math>2^n</math> components are <math>2^{-n}</math> and the following ones are <math>0,</math> converges to the zero vector for <math>p = \infty,</math> but does not for <math>p = 1:</math> <math display=block>\|\mathbf{x}_n\|_\infty = \sup (2^{-n}, 0) = 2^{-n} \to 0,</math> but <math display=block>\|\mathbf{x}_n\|_1 = \sum_{i=1}^{2^n} 2^{-n} = 2^n \cdot 2^{-n} = 1.</math>

More generally than sequences of real numbers, functions <math>f : \Omega \to \Reals</math> are endowed with a norm that replaces the above sum by the Lebesgue integral <math display=block>\|f\|_p := \left(\int_{\Omega} |f(x)|^p \, {d\mu(x)}\right)^\frac{1}{p}.</math>

The space of integrable functions on a given domain <math>\Omega</math> (for example an interval) satisfying <math>\|f\|_p < \infty,</math> and equipped with this norm are called Lebesgue spaces, denoted <math>L^{\;\!p}(\Omega).</math><ref group="nb">The triangle inequality for <math>\|f + g\|_p \leq \|f\|_p + \|g\|_p</math> is provided by the Minkowski inequality. For technical reasons, in the context of functions one has to identify functions that agree almost everywhere to get a norm, and not only a seminorm.</ref>

These spaces are complete.Template:Sfn (If one uses the Riemann integral instead, the space is Template:Em complete, which may be seen as a justification for Lebesgue's integration theory.<ref group="nb"> "Many functions in <math>L^2</math> of Lebesgue measure, being unbounded, cannot be integrated with the classical Riemann integral. So spaces of Riemann integrable functions would not be complete in the <math>L^2</math> norm, and the orthogonal decomposition would not apply to them. This shows one of the advantages of Lebesgue integration.", Template:Harvtxt, §5.3, p. 125.</ref>) Concretely this means that for any sequence of Lebesgue-integrable functions <math>f_1, f_2, \ldots, f_n, \ldots</math> with <math>\|f_n\|_p < \infty,</math> satisfying the condition <math display=block>\lim_{k,\ n \to \infty} \int_{\Omega} \left|f_k(x) - f_n(x)\right|^p \, {d\mu(x)} = 0</math> there exists a function <math>f(x)</math> belonging to the vector space <math>L^{\;\!p}(\Omega)</math> such that <math display=block>\lim_{k \to \infty} \int_{\Omega} \left|f(x) - f_k(x)\right|^p \, {d\mu(x)} = 0.</math>

Imposing boundedness conditions not only on the function, but also on its derivatives leads to Sobolev spaces.Template:Sfn

Hilbert spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Periodic identity function.gif

The succeeding snapshots show summation of 1 to 5 terms in approximating a periodic function (blue) by finite sum of sine functions (red).

Complete inner product spaces are known as Hilbert spaces, in honor of David Hilbert.Template:Sfn The Hilbert space <math>L^2(\Omega),</math> with inner product given by <math display=block>\langle f\ , \ g \rangle = \int_\Omega f(x) \overline{g(x)} \, dx,</math> where <math>\overline{g(x)}</math> denotes the complex conjugate of <math>g(x),</math>Template:Sfn<ref group=nb>For <math>p \neq 2,</math> <math>L^p(\Omega)</math> is not a Hilbert space.</ref> is a key case.

By definition, in a Hilbert space, any Cauchy sequence converges to a limit. Conversely, finding a sequence of functions <math>f_n</math> with desirable properties that approximate a given limit function is equally crucial. Early analysis, in the guise of the Taylor approximation, established an approximation of differentiable functions <math>f</math> by polynomials.Template:Sfn By the Stone–Weierstrass theorem, every continuous function on <math>[a, b]</math> can be approximated as closely as desired by a polynomial.Template:Sfn A similar approximation technique by trigonometric functions is commonly called Fourier expansion, and is much applied in engineering. More generally, and more conceptually, the theorem yields a simple description of what "basic functions", or, in abstract Hilbert spaces, what basic vectors suffice to generate a Hilbert space <math>H,</math> in the sense that the closure of their span (that is, finite linear combinations and limits of those) is the whole space. Such a set of functions is called a basis of <math>H,</math> its cardinality is known as the Hilbert space dimension.<ref group=nb>A basis of a Hilbert space is not the same thing as a basis of a linear algebra. For distinction, a linear algebra basis for a Hilbert space is called a Hamel basis.</ref> Not only does the theorem exhibit suitable basis functions as sufficient for approximation purposes, but also together with the Gram–Schmidt process, it enables one to construct a basis of orthogonal vectors.Template:Sfn Such orthogonal bases are the Hilbert space generalization of the coordinate axes in finite-dimensional Euclidean space.

The solutions to various differential equations can be interpreted in terms of Hilbert spaces. For example, a great many fields in physics and engineering lead to such equations, and frequently solutions with particular physical properties are used as basis functions, often orthogonal.Template:Sfn As an example from physics, the time-dependent Schrödinger equation in quantum mechanics describes the change of physical properties in time by means of a partial differential equation, whose solutions are called wavefunctions.Template:Sfn Definite values for physical properties such as energy, or momentum, correspond to eigenvalues of a certain (linear) differential operator and the associated wavefunctions are called eigenstates. The spectral theorem decomposes a linear compact operator acting on functions in terms of these eigenfunctions and their eigenvalues.Template:Sfn

Algebras over fieldsEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Rectangular hyperbola.svg

A hyperbola, given by the equation <math>x \cdot y = 1.</math> The coordinate ring of functions on this hyperbola is given by <math>\mathbf{R}[x, y] / (x \cdot y - 1),</math> an infinite-dimensional vector space over <math>\mathbf{R}.</math>

General vector spaces do not possess a multiplication between vectors. A vector space equipped with an additional bilinear operator defining the multiplication of two vectors is an algebra over a field (or F-algebra if the field F is specified).Template:Sfn

For example, the set of all polynomials <math>p(t)</math> forms an algebra known as the polynomial ring: using that the sum of two polynomials is a polynomial, they form a vector space; they form an algebra since the product of two polynomials is again a polynomial. Rings of polynomials (in several variables) and their quotients form the basis of algebraic geometry, because they are rings of functions of algebraic geometric objects.Template:Sfn

Another crucial example are Lie algebras, which are neither commutative nor associative, but the failure to be so is limited by the constraints (<math>[x, y]</math> denotes the product of <math>x</math> and <math>y</math>):

<math>[x, y] = - [y, x]</math> (anticommutativity), and
<math>[x, [y, z]] + [y, [z, x]] + [z, [x, y]] = 0</math> (Jacobi identity).Template:Sfn

Examples include the vector space of <math>n</math>-by-<math>n</math> matrices, with <math>[x, y] = x y - y x,</math> the commutator of two matrices, and <math>\mathbf{R}^3,</math> endowed with the cross product.

The tensor algebra <math>\operatorname{T}(V)</math> is a formal way of adding products to any vector space <math>V</math> to obtain an algebra.Template:Sfn As a vector space, it is spanned by symbols, called simple tensors <math display=block>\mathbf{v}_1 \otimes \mathbf{v}_2 \otimes \cdots \otimes \mathbf{v}_n,</math> where the degree <math>n</math> varies. The multiplication is given by concatenating such symbols, imposing the distributive law under addition, and requiring that scalar multiplication commute with the tensor product ⊗, much the same way as with the tensor product of two vector spaces introduced in the above section on tensor products. In general, there are no relations between <math>\mathbf{v}_1 \otimes \mathbf{v}_2</math> and <math>\mathbf{v}_2 \otimes \mathbf{v}_1.</math> Forcing two such elements to be equal leads to the symmetric algebra, whereas forcing <math>\mathbf{v}_1 \otimes \mathbf{v}_2 = - \mathbf{v}_2 \otimes \mathbf{v}_1</math> yields the exterior algebra.Template:Sfn

Related structuresEdit

Vector bundlesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Mobius strip illus.svg

A Möbius strip. Locally, it looks like Template:Math.

A vector bundle is a family of vector spaces parametrized continuously by a topological space X.Template:Sfn More precisely, a vector bundle over X is a topological space E equipped with a continuous map <math display=block>\pi : E \to X</math> such that for every x in X, the fiber π⁻¹(x) is a vector space. The case dim Template:Math is called a line bundle. For any vector space V, the projection Template:Math makes the product Template:Math into a "trivial" vector bundle. Vector bundles over X are required to be locally a product of X and some (fixed) vector space V: for every x in X, there is a neighborhood U of x such that the restriction of π to π⁻¹(U) is isomorphic<ref group=nb>That is, there is a homeomorphism from π⁻¹(U) to Template:Math which restricts to linear isomorphisms between fibers.</ref> to the trivial bundle Template:Math. Despite their locally trivial character, vector bundles may (depending on the shape of the underlying space X) be "twisted" in the large (that is, the bundle need not be (globally isomorphic to) the trivial bundle Template:Math). For example, the Möbius strip can be seen as a line bundle over the circle S¹ (by identifying open intervals with the real line). It is, however, different from the cylinder Template:Math, because the latter is orientable whereas the former is not.Template:Sfn

Properties of certain vector bundles provide information about the underlying topological space. For example, the tangent bundle consists of the collection of tangent spaces parametrized by the points of a differentiable manifold. The tangent bundle of the circle S¹ is globally isomorphic to Template:Math, since there is a global nonzero vector field on S¹.<ref group=nb>A line bundle, such as the tangent bundle of S¹ is trivial if and only if there is a section that vanishes nowhere, see Template:Harvtxt, Corollary 8.3. The sections of the tangent bundle are just vector fields.</ref> In contrast, by the hairy ball theorem, there is no (tangent) vector field on the 2-sphere S² which is everywhere nonzero.Template:Sfn K-theory studies the isomorphism classes of all vector bundles over some topological space.Template:Sfn In addition to deepening topological and geometrical insight, it has purely algebraic consequences, such as the classification of finite-dimensional real division algebras: R, C, the quaternions H and the octonions O.

The cotangent bundle of a differentiable manifold consists, at every point of the manifold, of the dual of the tangent space, the cotangent space. Sections of that bundle are known as differential one-forms.

ModulesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Modules are to rings what vector spaces are to fields: the same axioms, applied to a ring R instead of a field F, yield modules.Template:Sfn The theory of modules, compared to that of vector spaces, is complicated by the presence of ring elements that do not have multiplicative inverses. For example, modules need not have bases, as the Z-module (that is, abelian group) Z/2Z shows; those modules that do (including all vector spaces) are known as free modules. Nevertheless, a vector space can be compactly defined as a module over a ring which is a field, with the elements being called vectors. Some authors use the term vector space to mean modules over a division ring.Template:Sfn The algebro-geometric interpretation of commutative rings via their spectrum allows the development of concepts such as locally free modules, the algebraic counterpart to vector bundles.

Affine and projective spacesEdit

{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}

File:Affine subspace.svg

An affine plane (light blue) in R³. It is a two-dimensional subspace shifted by a vector x (red).

Roughly, affine spaces are vector spaces whose origins are not specified.Template:Sfn More precisely, an affine space is a set with a free transitive vector space action. In particular, a vector space is an affine space over itself, by the map <math display=block>V \times V \to W, \; (\mathbf{v}, \mathbf{a}) \mapsto \mathbf{a} + \mathbf{v}.</math> If W is a vector space, then an affine subspace is a subset of W obtained by translating a linear subspace V by a fixed vector Template:Math; this space is denoted by Template:Math (it is a coset of V in W) and consists of all vectors of the form Template:Math for Template:Math An important example is the space of solutions of a system of inhomogeneous linear equations <math display=block>A \mathbf{v} = \mathbf{b}</math> generalizing the homogeneous case discussed in the above section on linear equations, which can be found by setting <math>\mathbf{b} = \mathbf{0}</math> in this equation.Template:Sfn The space of solutions is the affine subspace Template:Math where x is a particular solution of the equation, and V is the space of solutions of the homogeneous equation (the nullspace of A).

The set of one-dimensional subspaces of a fixed finite-dimensional vector space V is known as projective space; it may be used to formalize the idea of parallel lines intersecting at infinity.Template:Sfn Grassmannians and flag manifolds generalize this by parametrizing linear subspaces of fixed dimension k and flags of subspaces, respectively.

NotesEdit

Template:Reflist

CitationsEdit

Template:Reflist

ReferencesEdit

External linksEdit

Template:Sister project Template:Sister project

Template:Springer

{{#invoke:Navbox|navbox}} Template:Authority control

Template:Good article

Vector space

Definition and basic propertiesEdit

Bases, vector coordinates, and subspacesEdit

HistoryEdit

ExamplesEdit

Arrows in the planeEdit

Ordered pairs of numbersEdit

Coordinate spaceEdit

Complex numbers and other field extensionsEdit

Function spacesEdit

Linear equationsEdit

Linear maps and matricesEdit

MatricesEdit

Eigenvalues and eigenvectorsEdit

Basic constructionsEdit

Subspaces and quotient spacesEdit

Direct product and direct sumEdit

Tensor productEdit

Vector spaces with additional structureEdit

Normed vector spaces and inner product spacesEdit

Topological vector spacesEdit

Banach spacesEdit

Hilbert spacesEdit

Algebras over fieldsEdit

Related structuresEdit

Vector bundlesEdit

ModulesEdit

Affine and projective spacesEdit

NotesEdit

CitationsEdit

ReferencesEdit

AlgebraEdit

AnalysisEdit

Historical referencesEdit

Further referencesEdit

External linksEdit