# Vector space

(Redirected from Complex vector space)
Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is stretched by a factor of 2, yielding the sum v + 2w.

A vector space (also called a linear space) is a collection of objects called vectors, which may be added together and multiplied ("scaled") by numbers, called scalars. Scalars are often taken to be real numbers, but there are also vector spaces with scalar multiplication by complex numbers, rational numbers, or generally any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called axioms, listed below.[clarification needed]

Euclidean vectors are an example of a vector space. They represent physical quantities such as forces: any two forces (of the same type) can be added to yield a third, and the multiplication of a force vector by a real multiplier is another force vector. In the same vein, but in a more geometric sense, vectors representing displacements in the plane or in three-dimensional space also form vector spaces. Vectors in vector spaces do not necessarily have to be arrow-like objects as they appear in the mentioned examples: vectors are regarded as abstract mathematical objects with particular properties, which in some cases can be visualized as arrows.

Vector spaces are the subject of linear algebra and are well characterized by their dimension, which, roughly speaking, specifies the number of independent directions in the space. Infinite-dimensional vector spaces arise naturally in mathematical analysis, as function spaces, whose vectors are functions. These vector spaces are generally endowed with additional structure, which may be a topology, allowing the consideration of issues of proximity and continuity. Among these topologies, those that are defined by a norm or inner product are more commonly used, as having a notion of distance between two vectors. This is particularly the case of Banach spaces and Hilbert spaces, which are fundamental in mathematical analysis.

Historically, the first ideas leading to vector spaces can be traced back as far as the 17th century's analytic geometry, matrices, systems of linear equations, and Euclidean vectors. The modern, more abstract treatment, first formulated by Giuseppe Peano in 1888, encompasses more general objects than Euclidean space, but much of the theory can be seen as an extension of classical geometric ideas like lines, planes and their higher-dimensional analogs.

Today, vector spaces are applied throughout mathematics, science and engineering. They are the appropriate linear-algebraic notion to deal with systems of linear equations. They offer a framework for Fourier expansion, which is employed in image compression routines, and they provide an environment that can be used for solution techniques for partial differential equations. Furthermore, vector spaces furnish an abstract, coordinate-free way of dealing with geometrical and physical objects such as tensors. This in turn allows the examination of local properties of manifolds by linearization techniques. Vector spaces may be generalized in several ways, leading to more advanced notions in geometry and abstract algebra.

## Introduction and definition

The concept of vector space will first be explained by describing two particular examples:

### First example: arrows in the plane

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. Given any two such arrows, v and w, 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 v + w. 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 a, the arrow that has the same direction as v, but is dilated or shrunk by multiplying its length by a, is called multiplication of v by a. It is denoted av. When a is negative, av is defined as the arrow pointing in the opposite direction, instead.

The following shows a few examples: if a = 2, the resulting vector aw has the same direction as w, but is stretched to the double length of w (right image below). Equivalently, 2w is the sum w + w. Moreover, (−1)v = −v has the opposite direction and the same length as v (blue vector pointing down in the right image).

### Second example: ordered pairs of numbers

A second key example of a vector space is provided by pairs of real numbers x and y. (The order of the components x and y is significant, so such a pair is also called an ordered pair.) Such a pair is written as (x, y). The sum of two such pairs and multiplication of a pair with a number is defined as follows:

(x1, y1) + (x2, y2) = (x1 + x2, y1 + y2)

and

a (x, y) = (ax, ay).

The first example above reduces to this one if the arrows are represented by the pair of Cartesian coordinates of their end points.

### Definition

In this article, vectors are represented in boldface to distinguish them from scalars.[nb 1]

A vector space over a field F is a set V together with two operations that satisfy the eight axioms listed below.

• The first operation, called vector addition or simply addition + : V × VV, takes any two vectors v and w and assigns to them a third vector which is commonly written as v + w, and called the sum of these two vectors. (Note that the resultant vector is also an element of the set V ).
• The second operation, called scalar multiplication · : F × VV， takes any scalar a and any vector v and gives another vector av. (Similarly, the vector av is an element of the set V).

Elements of V are commonly called vectors. Elements of F are commonly called scalars.

In the two examples above, the field is the field of the real numbers and the set of the vectors consists of the planar arrows with fixed starting point and of pairs of real numbers, respectively.

To qualify as a vector space, the set V and the operations of addition and multiplication must adhere to a number of requirements called axioms.[1] In the list below, let u, v and w be arbitrary vectors in V, and a and b scalars in F.

Axiom Meaning
Associativity of addition u + (v + w) = (u + v) + w
Commutativity of addition u + v = v + u
Identity element of addition There exists an element 0V, called the zero vector, such that v + 0 = v for all vV.
Inverse elements of addition For every vV, there exists an element vV, called the additive inverse of v, such that v + (−v) = 0.
Compatibility of scalar multiplication with field multiplication a(bv) = (ab)v [nb 2]
Identity element of scalar multiplication 1v = v, where 1 denotes the multiplicative identity in F.
Distributivity of scalar multiplication with respect to vector addition   a(u + v) = au + av
Distributivity of scalar multiplication with respect to field addition (a + b)v = av + bv

These axioms generalize properties of the vectors introduced in the above examples. Indeed, the result of addition of two ordered pairs (as in the second example above) does not depend on the order of the summands:

(xv, yv) + (xw, yw) = (xw, yw) + (xv, yv).

Likewise, in the geometric example of vectors as arrows, v + w = w + v since the parallelogram defining the sum of the vectors is independent of the order of the vectors. All other axioms can be checked in a similar manner in both examples. Thus, by disregarding the concrete nature of the particular type of vectors, the definition incorporates these two and many more examples in one notion of vector space.

Subtraction of two vectors and division by a (non-zero) scalar can be defined as

{\displaystyle {\begin{aligned}\mathbf {v} -\mathbf {w} &=\mathbf {v} +(-\mathbf {w} )\\{\frac {\mathbf {v} }{a}}&={\frac {1}{a}}\mathbf {v} \end{aligned}}} .

When the scalar field F is the real numbers R, the vector space is called a real vector space. When the scalar field is the complex numbers C, the vector space is called a complex vector space. These two cases are the ones used most often in engineering. The general definition of a vector space allows scalars to be elements of any fixed field F. The notion is then known as an F-vector spaces or a vector space over F. A field is, essentially, a set of numbers possessing addition, subtraction, multiplication and division operations.[nb 3] For example, rational numbers form a field.

In contrast to the intuition stemming from vectors in the plane and higher-dimensional cases, there is, in general vector spaces, no notion of nearness, angles or distances. To deal with such matters, particular types of vector spaces are introduced; see below.[clarification needed]

### Alternative formulations and elementary consequences

Vector addition and scalar multiplication are operations, satisfying the closure property: u + v and av are in V for all a in F, and u, v in V. Some older sources mention these properties as separate axioms.[2]

In the parlance of abstract algebra, the first four axioms are equivalent to requiring the set of vectors to be an abelian group under addition. The remaining axioms give this group an F-module structure. In other words, there is a ring homomorphism f from the field F into the endomorphism ring of the group of vectors. Then scalar multiplication av is defined as (f(a))(v).[3]

There are a number of direct consequences of the vector space axioms. Some of them derive from elementary group theory, applied to the additive group of vectors: for example, the zero vector 0 of V and the additive inverse v of any vector v are unique. Further properties follow by employing also the distributive law for the scalar multiplication, for example av equals 0 if and only if a equals 0 or v equals 0.

## History

Vector spaces stem from affine geometry via the introduction of coordinates in the plane or three-dimensional space. Around 1636, Descartes and Fermat founded analytic geometry by equating solutions to an equation of two variables with points on a plane curve.[4] In 1804, to achieve geometric solutions without using coordinates, Bolzano introduced certain operations on points, lines and planes, which are predecessors of vectors.[5] His work was then used in the conception of barycentric coordinates by Möbius in 1827.[6] In 1828 C. V. Mourey suggested the existence of an algebra surpassing not only ordinary algebra but also two-dimensional algebra created by him searching a geometrical interpretation of complex numbers.[7]

The definition of vectors was founded on Bellavitis' notion of the bipoint, an oriented segment of which one end is the origin and the other a target, then further elaborated with the presentation of complex numbers by Argand and Hamilton and the introduction of quaternions and biquaternions by the latter.[8] They are elements in R2, R4, and R8; their treatment as linear combinations can be traced back to Laguerre in 1867, who also defined systems of linear equations.

In 1857, Cayley introduced matrix notation, which allows for a 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.[9] In his work, the concepts of linear independence and dimension, as well as scalar products, are present. In fact, Grassmann's 1844 work extended a vector space of n dimensions to one of 2n dimensions by consideration of 2-vectors ${\displaystyle u\wedge v}$  and 3-vectors ${\displaystyle u\wedge v\wedge w}$  called multivectors. This extension, called multilinear algebra, is governed by the rules of exterior algebra. Peano was the first to give the modern definition of vector spaces and linear maps in 1888.[10]

An important development of vector spaces is due to the construction of function spaces by Lebesgue. This was later formalized by Banach and Hilbert, around 1920.[11] 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.[12] Vector spaces, including infinite-dimensional ones, then became a firmly established notion, and many mathematical branches started making use of this concept.

## Examples

### Coordinate spaces

The simplest example of a vector space over a field F is the field itself, equipped with its standard addition and multiplication. More generally, all n-tuples (sequences of length n)

(a1, a2, ..., an)

of elements of F form a vector space that is usually denoted Fn and called a coordinate space.[13] The case n = 1 is the above-mentioned simplest example, in which the field F is also regarded as a vector space over itself. The case F = R and n = 2 was discussed in the introduction above.

### Complex numbers and other field extensions

The set of complex numbers C, i.e., numbers that can be written in the form x + iy for real numbers x and y where i is the imaginary unit, form a vector space over the reals with the usual addition and multiplication: (x + iy) + (a + ib) = (x + a) + i(y + b) and c ⋅ (x + iy) = (cx) + i(cy) for real numbers x, y, a, b and c. The various axioms of a vector space follow from the fact that the same rules hold for complex number arithmetic.

In fact, the example of complex numbers is essentially the same (i.e., it is isomorphic) to the vector space of ordered pairs of real numbers mentioned above: if we think of the complex number x + i y as representing the ordered pair (x, y) in the complex plane then we see that the rules for sum and scalar product 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 F containing a smaller field E is an E-vector space, by the given multiplication and addition operations of F.[14] For example, the complex numbers are a vector space over R, and the field extension ${\displaystyle \mathbf {Q} (i{\sqrt {5}})}$  is a vector space over Q.

### Function spaces

Addition of functions: The sum of the sine and the exponential function is ${\displaystyle \sin +\exp :\mathbb {R} \to \mathbb {R} }$  with ${\displaystyle (\sin +\exp )(x)=\sin(x)+\exp(x)}$

Functions from any fixed set Ω to a field F also form vector spaces, by performing addition and scalar multiplication pointwise. That is, the sum of two functions f and g is the function (f + g) given by

(f + g)(w) = f(w) + g(w),

and similarly for multiplication. Such function spaces occur in many geometric situations, when Ω is the real line or an interval, or other subsets of R. 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.[15] Therefore, the set of such functions are vector spaces. They are studied in greater detail using the methods of functional analysis, see below.[clarification needed] Algebraic constraints also yield vector spaces: the vector space F[x] is given by polynomial functions:

f(x) = r0 + r1x + ... + rn−1xn−1 + rnxn, where the coefficients r0, ..., rn are in F.[16]

### Linear equations

Systems of homogeneous linear equations are closely tied to vector spaces.[17] For example, the solutions of

 a + 3b + c = 0 4a + 2b + 2c = 0

are given by triples with arbitrary a, b = a/2, and c = −5a/2. 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

Ax = 0,

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

f′′(x) + 2f′(x) + f(x) = 0

yields f(x) = a ex + bx ex, where a and b are arbitrary constants, and ex is the natural exponential function.

## Basis and dimension

A vector v in R2 (blue) expressed in terms of different bases: using the standard basis of R2 v = xe1 + ye2 (black), and using a different, non-orthogonal basis: v = f1 + f2 (red).

Bases allow one to represent vectors by a sequence of scalars called coordinates or components. A basis is a (finite or infinite) set B = {bi}iI of vectors bi, for convenience often indexed by some index set I, that spans the whole space and is linearly independent. "Spanning the whole space" means that any vector v can be expressed as a finite sum (called a linear combination) of the basis elements:

${\displaystyle \mathbf {v} =a_{1}\mathbf {b} _{i_{1}}+a_{2}\mathbf {b} _{i_{2}}+\cdots +a_{n}\mathbf {b} _{i_{n}},}$

(1)

where the ak are scalars, called the coordinates (or the components) of the vector v with respect to the basis B, and bik (k = 1, ..., n) elements of B. Linear independence means that the coordinates ak are uniquely determined for any vector in the vector space.

For example, the coordinate vectors e1 = (1, 0, ..., 0), e2 = (0, 1, 0, ..., 0), to en = (0, 0, ..., 0, 1), form a basis of Fn, called the standard basis, since any vector (x1, x2, ..., xn) can be uniquely expressed as a linear combination of these vectors:

(x1, x2, ..., xn) = x1(1, 0, ..., 0) + x2(0, 1, 0, ..., 0) + ... + xn(0, ..., 0, 1) = x1e1 + x2e2 + ... + xnen.

The corresponding coordinates x1, x2, ..., xn are just the Cartesian coordinates of the vector.

Every vector space has a basis. This follows from Zorn's lemma, an equivalent formulation of the Axiom of Choice.[18] Given the other axioms of Zermelo–Fraenkel set theory, the existence of bases is equivalent to the axiom of choice.[19] The ultrafilter lemma, which is weaker than the axiom of choice, implies that all bases of a given vector space have the same number of elements, or cardinality (cf. Dimension theorem for vector spaces).[20] It is called the dimension of the vector space, denoted by dim V. If the space is spanned by finitely many vectors, the above statements can be proven without such fundamental input from set theory.[21]

The dimension of the coordinate space Fn is n, by the basis exhibited above. The dimension of the polynomial ring F[x] introduced above[clarification needed] is countably infinite, a basis is given by 1, x, x2, ... A fortiori, the dimension of more general function spaces, such as the space of functions on some (bounded or unbounded) interval, is infinite.[nb 4] Under suitable regularity assumptions on the coefficients involved, the dimension of the solution space of a homogeneous ordinary differential equation equals the degree of the equation.[22] For example, the solution space for the above equation[clarification needed] is generated by ex and xex. These two functions are linearly independent over R, so the dimension of this space is two, as is the degree of the equation.

A field extension over the rationals Q can be thought of as a vector space over Q (by defining vector addition as field addition, defining scalar multiplication as field multiplication by elements of Q, and otherwise ignoring the field multiplication). The dimension (or degree) of the field extension Q(α) over Q depends on α. If α satisfies some polynomial equation

${\displaystyle q_{n}\alpha ^{n}+q_{n-1}\alpha ^{n-1}+\ldots +q_{0}=0}$

with rational coefficients qn, ..., q0 (in other words, if α is algebraic), the dimension is finite. More precisely, it equals the degree of the minimal polynomial having α as a root.[23] For example, the complex numbers C are a two-dimensional real vector space, generated by 1 and the imaginary unit i. The latter satisfies i2 + 1 = 0, an equation of degree two. Thus, C is a two-dimensional R-vector space (and, as any field, one-dimensional as a vector space over itself, C). If α is not algebraic, the dimension of Q(α) over Q is infinite. For instance, for α = π there is no such equation, in other words π is transcendental.[24]

## Linear maps and matrices

The relation of two vector spaces can be expressed by linear map or linear transformation. They are functions that reflect the vector space structure—i.e., they preserve sums and scalar multiplication:

${\displaystyle f(\mathbf {v} +\mathbf {w} )=f(\mathbf {v} )+f(\mathbf {w} )}$  and f(a · v) ${\displaystyle =}$  a · f(v) for all v and w in V, all a in F.[25]

An isomorphism is a linear map f : VW such that there exists an inverse map g : WV, which is a map such that the two possible compositions fg : WW and gf : VV are identity maps. Equivalently, f is both one-to-one (injective) and onto (surjective).[26] If there exists an isomorphism between V and W, the two spaces are said to be isomorphic; they are then essentially identical as vector spaces, since all identities holding in V are, via f, transported to similar ones in W, and vice versa via g.

Describing an arrow vector v by its coordinates x and y yields an isomorphism of vector spaces.

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

Linear maps VW between two vector spaces form a vector space HomF(V, W), also denoted L(V, W).[27] The space of linear maps from V to F is called the dual vector space, denoted V.[28] Via the injective natural map VV∗∗, any vector space can be embedded into its bidual; the map is an isomorphism if and only if the space is finite-dimensional.[29]

Once a basis of V is chosen, linear maps f : VW are completely determined by specifying the images of the basis vectors, because any element of V is expressed uniquely as a linear combination of them.[30] If dim V = dim W, a 1-to-1 correspondence between fixed bases of V and W gives rise to a linear map that maps any basis element of V to the corresponding basis element of W. It is an isomorphism, by its very definition.[31] Therefore, two vector spaces are isomorphic if their dimensions agree and vice versa. Another way to express this is that any vector space is completely classified (up to isomorphism) by its dimension, a single number. In particular, any n-dimensional F-vector space V is isomorphic to Fn. There is, however, no "canonical" or preferred isomorphism; actually an isomorphism φ : FnV is equivalent to the choice of a basis of V, by mapping the standard basis of Fn to V, via φ. The freedom of choosing a convenient basis is particularly useful in the infinite-dimensional context; see below.[clarification needed]

### Matrices

A typical matrix

Matrices are a useful notion to encode linear maps.[32] They are written as a rectangular array of scalars as in the image at the right. Any m-by-n matrix A gives rise to a linear map from Fn to Fm, by the following

${\displaystyle \mathbf {x} =(x_{1},x_{2},\cdots ,x_{n})\mapsto \left(\sum _{j=1}^{n}a_{1j}x_{j},\sum _{j=1}^{n}a_{2j}x_{j},\cdots ,\sum _{j=1}^{n}a_{mj}x_{j}\right)}$ , where ${\displaystyle \sum }$  denotes summation,

or, using the matrix multiplication of the matrix A with the coordinate vector x:

xAx.

Moreover, after choosing bases of V and W, any linear map f : VW is uniquely represented by a matrix via this assignment.[33]

The volume of this parallelepiped is the absolute value of the determinant of the 3-by-3 matrix formed by the vectors r1, r2, and r3.

The determinant det (A) of a square matrix A 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.[34] The linear transformation of Rn corresponding to a real n-by-n matrix is orientation preserving if and only if its determinant is positive.

### Eigenvalues and eigenvectors

Endomorphisms, linear maps f : VV, are particularly important since in this case vectors v can be compared with their image under f, f(v). Any nonzero vector v satisfying λv = f(v), where λ is a scalar, is called an eigenvector of f with eigenvalue λ.[nb 5][35] Equivalently, v is an element of the kernel of the difference fλ · Id (where Id is the identity map VV). If V is finite-dimensional, this can be rephrased using determinants: f having eigenvalue λ is equivalent to

det(fλ · Id) = 0.

By spelling out the definition of the determinant, the expression on the left hand side can be seen to be a polynomial function in λ, called the characteristic polynomial of f.[36] If the field F is large enough to contain a zero of this polynomial (which automatically happens for F algebraically closed, such as F = C) any linear map has at least one eigenvector. The vector space V may or may not possess an eigenbasis, a basis consisting of eigenvectors. This phenomenon is governed by the Jordan canonical form of the map.[37][nb 6] The set of all eigenvectors corresponding to a particular eigenvalue of f forms a vector space known as the eigenspace corresponding to the eigenvalue (and f) in question. To achieve the spectral theorem, the corresponding statement in the infinite-dimensional case, the machinery of functional analysis is needed, see below.[clarification needed]

## Basic constructions

In addition to the above concrete examples, there are a number of standard linear algebraic constructions that yield vector spaces related to given ones. In addition to the definitions given below, they are also characterized by universal properties, which determine an object X by specifying the linear maps from X to any other vector space.

### Subspaces and quotient spaces

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

A nonempty subset W of a vector space V that is closed under addition and scalar multiplication (and therefore contains the 0-vector of V) is called a linear subspace of V, or simply a subspace of V, when the ambient space is unambiguously a vector space.[38][nb 7] Subspaces of V are vector spaces (over the same field) in their own right. The intersection of all subspaces containing a given set S of vectors is called its span, and it is the smallest subspace of V containing the set S. Expressed in terms of elements, the span is the subspace consisting of all the linear combinations of elements of S.[39]

A linear subspace of dimension 1 is a vector line. A linear subspace of dimension 2 is a vector plane. A linear subspace that contains all elements but one of a basis of the ambient space is a vector hyperplane. In a vector space of finite dimension n, a vector hyperplane is thus a subspace of dimension n – 1.

The counterpart to subspaces are quotient vector spaces.[40] Given any subspace WV, the quotient space V/W ("V modulo W") is defined as follows: as a set, it consists of v + W = {v + w : wW}, where v is an arbitrary vector in V. The sum of two such elements v1 + W and v2 + W is (v1 + v2) + W, and scalar multiplication is given by a · (v + W) = (a · v) + W. The key point in this definition is that v1 + W = v2 + W if and only if the difference of v1 and v2 lies in W.[nb 8] This way, the quotient space "forgets" information that is contained in the subspace W.

The kernel ker(f) of a linear map f : VW consists of vectors v that are mapped to 0 in W.[41] Both kernel and image im(f) = {f(v) : vV} are subspaces of V and W, respectively.[42] The existence of kernels and images is part of the statement that the category of vector spaces (over a fixed field F) is an abelian category, i.e. a corpus of mathematical objects and structure-preserving maps between them (a category) that behaves much like the category of abelian groups.[43] Because of this, many statements such as the first isomorphism theorem (also called rank–nullity theorem in matrix-related terms)

V / ker(f) ≡ im(f).

and the second and third isomorphism theorem can be formulated and proven in a way very similar to the corresponding statements for groups.

An important example is the kernel of a linear map xAx for some fixed matrix A, as above.[clarification needed] The kernel of this map is the subspace of vectors x such that Ax = 0, which is precisely the set of solutions to the system of homogeneous linear equations belonging to A. This concept also extends to linear differential equations

${\displaystyle a_{0}f+a_{1}{\frac {df}{dx}}+a_{2}{\frac {d^{2}f}{dx^{2}}}+\cdots +a_{n}{\frac {d^{n}f}{dx^{n}}}=0}$ , where the coefficients ai are functions in x, too.

In the corresponding map

${\displaystyle f\mapsto D(f)=\sum _{i=0}^{n}a_{i}{\frac {d^{i}f}{dx^{i}}}}$ ,

the derivatives of the function f appear linearly (as opposed to f′′(x)2, for example). Since differentiation is a linear procedure (i.e., (f + g)′ = f′ + g ′ and (c·f)′ = c·f for a constant c) this assignment is linear, called a linear differential operator. In particular, the solutions to the differential equation D(f) = 0 form a vector space (over R or C).

### Direct product and direct sum

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 ${\displaystyle \textstyle {\prod _{i\in I}V_{i}}}$  of a family of vector spaces Vi consists of the set of all tuples (vi)iI, which specify for each index i in some index set I an element vi of Vi.[44] Addition and scalar multiplication is performed componentwise. A variant of this construction is the direct sum ${\displaystyle \oplus _{i\in I}V_{i}}$  (also called coproduct and denoted ${\displaystyle \textstyle {\coprod _{i\in I}V_{i}}}$ ), where only tuples with finitely many nonzero vectors are allowed. If the index set I is finite, the two constructions agree, but in general they are different.

### Tensor product

The tensor product VF W, or simply VW, of two vector spaces V and W is one of the central notions of multilinear algebra which deals with extending notions such as linear maps to several variables. A map g : V × WX is called bilinear if g is linear in both variables v and w. That is to say, for fixed w the map vg(v, w) is linear in the sense above and likewise for fixed v.

The tensor product is a particular vector space that is a universal recipient of bilinear maps g, as follows. It is defined as the vector space consisting of finite (formal) sums of symbols called tensors

v1w1 + v2w2 + ... + vnwn,

subject to the rules

a · (vw) = (a · v) ⊗ w = v ⊗ (a · w), where a is a scalar,
(v1 + v2) ⊗ w = v1w + v2w, and
v ⊗ (w1 + w2) = vw1 + vw2.[45]

Commutative diagram depicting the universal property of the tensor product.

These rules ensure that the map f from the V × W to VW that maps a tuple (v, w) to vw is bilinear. The universality states that given any vector space X and any bilinear map g : V × WX, there exists a unique map u, shown in the diagram with a dotted arrow, whose composition with f equals g: u(vw) = g(v, w).[46] 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 structure

From the point of view of linear algebra, vector spaces are completely understood insofar as any vector space 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.

A vector space may be given a partial order ≤, under which some vectors can be compared.[47] For example, n-dimensional real space Rn 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

f = f+f,

where f+ denotes the positive part of f and f the negative part.[48]

### Normed vector spaces and inner product spaces

"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 ${\displaystyle |\mathbf {v} |}$  and ${\displaystyle \langle \mathbf {v} ,\mathbf {w} \rangle }$ , respectively. The datum of an inner product entails that lengths of vectors can be defined too, by defining the associated norm ${\displaystyle |\mathbf {v} |:={\sqrt {\langle \mathbf {v} ,\mathbf {v} \rangle }}}$ . Vector spaces endowed with such data are known as normed vector spaces and inner product spaces, respectively.[49]

Coordinate space Fn can be equipped with the standard dot product:

${\displaystyle \langle \mathbf {x} ,\mathbf {y} \rangle =\mathbf {x} \cdot \mathbf {y} =x_{1}y_{1}+\cdots +x_{n}y_{n}.}$

In R2, this reflects the common notion of the angle between two vectors x and y, by the law of cosines:

${\displaystyle \mathbf {x} \cdot \mathbf {y} =\cos \left(\angle (\mathbf {x} ,\mathbf {y} )\right)\cdot |\mathbf {x} |\cdot |\mathbf {y} |.}$

Because of this, two vectors satisfying ${\displaystyle \langle \mathbf {x} ,\mathbf {y} \rangle =0}$  are called orthogonal. An important variant of the standard dot product is used in Minkowski space: R4 endowed with the Lorentz product

${\displaystyle \langle \mathbf {x} |\mathbf {y} \rangle =x_{1}y_{1}+x_{2}y_{2}+x_{3}y_{3}-x_{4}y_{4}.}$ [50]

In contrast to the standard dot product, it is not positive definite: ${\displaystyle \langle \mathbf {x} |\mathbf {x} \rangle }$  also takes negative values, for example for ${\displaystyle \mathbf {x} =(0,0,0,1)}$ . Singling out the fourth coordinate—corresponding to time, as opposed to three space-dimensions—makes it useful for the mathematical treatment of special relativity.

### Topological vector spaces

Convergence questions are treated by considering vector spaces V carrying a compatible topology, a structure that allows one to talk about elements being close to each other.[51][52] Compatible here means that addition and scalar multiplication have to be continuous maps. Roughly, if x and y in V, and a in F vary by a bounded amount, then so do x + y and ax.[nb 9] To make sense of specifying the amount a scalar changes, the field F also has to carry a topology in this context; a common choice are the reals or the complex numbers.

In such topological vector spaces one can consider series of vectors. The infinite sum

${\displaystyle \sum _{i=0}^{\infty }f_{i}}$

denotes the limit of the corresponding finite partial sums of the sequence (fi)iN of elements of V. For example, the fi could be (real or complex) functions belonging to some function space V, 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.

Unit "spheres" in R2 consist of plane vectors of norm 1. Depicted are the unit spheres in different p-norms, for p = 1, 2, and ∞. 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 [0,1], equipped with the topology of uniform convergence is not complete because any continuous function on [0,1] can be uniformly approximated by a sequence of polynomials, by the Weierstrass approximation theorem.[53] In contrast, the space of all continuous functions on [0,1] with the same topology is complete.[54] A norm gives rise to a topology by defining that a sequence of vectors vn converges to v if and only if

${\displaystyle {\text{lim}}_{n\rightarrow \infty }|\mathbf {v} _{n}-\mathbf {v} |=0.}$

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—focusses on infinite-dimensional vector spaces, since all norms on finite-dimensional topological vector spaces give rise to the same notion of convergence.[55] The image at the right shows the equivalence of the 1-norm and ∞-norm on R2: 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) VW, maps between topological vector spaces are required to be continuous.[56] In particular, the (topological) dual space V consists of continuous functionals VR (or to C). The fundamental Hahn–Banach theorem is concerned with separating subspaces of appropriate topological vector spaces by continuous functionals.[57]

#### Banach spaces

Banach spaces, introduced by Stefan Banach, are complete normed vector spaces.[58]

A first example is the vector space ${\displaystyle \ell ^{p}}$  consisting of infinite vectors with real entries ${\displaystyle \mathbf {x} =\left(x_{1},x_{2},\ldots ,x_{n},\ldots \right)}$  whose ${\displaystyle p}$ -norm ${\displaystyle (1\leq {p}\leq \infty )}$  given by

${\displaystyle \left\Vert \mathbf {x} \right\Vert _{p}:=\left(\sum _{i}\left\vert x_{i}\right\vert ^{p}\right)^{\frac {1}{p}}}$  for ${\displaystyle p<\infty }$    and   ${\displaystyle \left\Vert \mathbf {x} \right\Vert _{\infty }:={\text{sup}}_{i}\left\vert x_{i}\right\vert }$ .

The topologies on the infinite-dimensional space ${\displaystyle \ell ^{p}}$  are inequivalent for different ${\displaystyle p}$ . E.g. the sequence of vectors ${\displaystyle \mathbf {x} _{n}=\left(2^{-n},2^{-n},\ldots ,2^{-n},0,0,\ldots \right)}$ , i.e. the first ${\displaystyle 2^{n}}$  components are ${\displaystyle 2^{-n}}$ , the following ones are ${\displaystyle 0}$ , converges to the zero vector for ${\displaystyle p=\infty }$ , but does not for ${\displaystyle p=1}$ :

${\displaystyle \left\Vert \mathbf {x} _{n}\right\Vert _{_{\infty }}=\sup(2^{-n},0)=2^{-n}\rightarrow 0}$ , but ${\displaystyle \left\Vert \mathbf {x} _{n}\right\Vert _{1}=\sum _{i=1}^{2^{n}}2^{-n}=2^{n}\cdot 2^{-n}=1.}$

More generally than sequences of real numbers, functions ${\displaystyle f\colon \Omega \to \mathbb {R} }$  are endowed with a norm that replaces the above sum by the Lebesgue integral

${\displaystyle \left\Vert {f}\right\Vert _{p}:=\left(\int _{\Omega }\left\vert {f}\left(x\right)\right\vert ^{p}\,{d\mu \left(x\right)}\right)^{\frac {1}{p}}.}$

The space of integrable functions on a given domain ${\displaystyle \Omega }$  (for example an interval) satisfying ${\displaystyle \left\Vert {f}\right\Vert _{p}<\infty }$ , and equipped with this norm are called Lebesgue spaces, denoted ${\displaystyle L^{\;\!p}\left(\Omega \right)}$ .[nb 10]

These spaces are complete.[59] (If one uses the Riemann integral instead, the space is not complete, which may be seen as a justification for Lebesgue's integration theory.[nb 11]) Concretely this means that for any sequence of Lebesgue-integrable functions   ${\displaystyle f_{1},f_{2},\ldots ,f_{n},\ldots }$    with ${\displaystyle \left\Vert {f}_{n}\right\Vert _{p}<\infty }$ , satisfying the condition

${\displaystyle \lim _{k,\ n\to \infty }\int _{\Omega }\left\vert {f}_{k}(x)-{f}_{n}(x)\right\vert ^{p}\,{d\mu \left(x\right)}=0}$

there exists a function ${\displaystyle {f}\left(x\right)}$  belonging to the vector space ${\displaystyle L^{\;\!p}\left(\Omega \right)}$  such that

${\displaystyle \lim _{k\to \infty }\int _{\Omega }\left\vert {f}\left(x\right)-{f}_{k}\left(x\right)\right\vert ^{p}\,{d\mu \left(x\right)}=0.}$

Imposing boundedness conditions not only on the function, but also on its derivatives leads to Sobolev spaces.[60]

#### Hilbert spaces

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.[61] The Hilbert space L2(Ω), with inner product given by

${\displaystyle \langle f\ ,\ g\rangle =\int _{\Omega }f(x){\overline {g(x)}}\,dx,}$

where ${\displaystyle {\overline {g(x)}}}$  denotes the complex conjugate of g(x),[62][nb 12] is a key case.

By definition, in a Hilbert space any Cauchy sequence converges to a limit. Conversely, finding a sequence of functions fn with desirable properties that approximates a given limit function, is equally crucial. Early analysis, in the guise of the Taylor approximation, established an approximation of differentiable functions f by polynomials.[63] By the Stone–Weierstrass theorem, every continuous function on [a, b] can be approximated as closely as desired by a polynomial.[64] A similar approximation technique by trigonometric functions is commonly called Fourier expansion, and is much applied in engineering, see below.[clarification needed] 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 H, in the sense that the closure of their span (i.e., finite linear combinations and limits of those) is the whole space. Such a set of functions is called a basis of H, its cardinality is known as the Hilbert space dimension.[nb 13] Not only does the theorem exhibit suitable basis functions as sufficient for approximation purposes, but together with the Gram–Schmidt process, it enables one to construct a basis of orthogonal vectors.[65] 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.[66] 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.[67] 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.[68]

### Algebras over fields

A hyperbola, given by the equation xy = 1. The coordinate ring of functions on this hyperbola is given by R[x, y] / (x · y − 1), an infinite-dimensional vector space over R.

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.[69] Many algebras stem from functions on some geometrical object: since functions with values in a given field can be multiplied pointwise, these entities form algebras. The Stone–Weierstrass theorem, for example, relies on Banach algebras which are both Banach spaces and algebras.

Commutative algebra makes great use of rings of polynomials in one or several variables, introduced above.[clarification needed] Their multiplication is both commutative and associative. These rings and their quotients form the basis of algebraic geometry, because they are rings of functions of algebraic geometric objects.[70]

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

Examples include the vector space of n-by-n matrices, with [x, y] = xyyx, the commutator of two matrices, and R3, endowed with the cross product.

The tensor algebra T(V) is a formal way of adding products to any vector space V to obtain an algebra.[72] As a vector space, it is spanned by symbols, called simple tensors

v1v2 ⊗ ... ⊗ vn, where the degree n 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 above.[clarification needed] In general, there are no relations between v1v2 and v2v1. Forcing two such elements to be equal leads to the symmetric algebra, whereas forcing v1v2 = − v2v1 yields the exterior algebra.[73]

When a field, F is explicitly stated, a common term used is F-algebra.

## Applications

Vector spaces have many applications as they occur frequently in common circumstances, namely wherever functions with values in some field are involved. They provide a framework to deal with analytical and geometrical problems, or are used in the Fourier transform. This list is not exhaustive: many more applications exist, for example in optimization. The minimax theorem of game theory stating the existence of a unique payoff when all players play optimally can be formulated and proven using vector spaces methods.[74] Representation theory fruitfully transfers the good understanding of linear algebra and vector spaces to other mathematical domains such as group theory.[75]

### Distributions

A distribution (or generalized function) is a linear map assigning a number to each "test" function, typically a smooth function with compact support, in a continuous way: in the above[clarification needed] terminology the space of distributions is the (continuous) dual of the test function space.[76] The latter space is endowed with a topology that takes into account not only f itself, but also all its higher derivatives. A standard example is the result of integrating a test function f over some domain Ω:

${\displaystyle I(f)=\int _{\Omega }f(x)\,dx.}$

When Ω = {p}, the set consisting of a single point, this reduces to the Dirac distribution, denoted by δ, which associates to a test function f its value at the p: δ(f) = f(p). Distributions are a powerful instrument to solve differential equations. Since all standard analytic notions such as derivatives are linear, they extend naturally to the space of distributions. Therefore, the equation in question can be transferred to a distribution space, which is bigger than the underlying function space, so that more flexible methods are available for solving the equation. For example, Green's functions and fundamental solutions are usually distributions rather than proper functions, and can then be used to find solutions of the equation with prescribed boundary conditions. The found solution can then in some cases be proven to be actually a true function, and a solution to the original equation (e.g., using the Lax–Milgram theorem, a consequence of the Riesz representation theorem).[77]

### Fourier analysis

The heat equation describes the dissipation of physical properties over time, such as the decline of the temperature of a hot body placed in a colder environment (yellow depicts colder regions than red).

Resolving a periodic function into a sum of trigonometric functions forms a Fourier series, a technique much used in physics and engineering.[nb 14][78] The underlying vector space is usually the Hilbert space L2(0, 2π), for which the functions sin mx and cos mx (m an integer) form an orthogonal basis.[79] The Fourier expansion of an L2 function f is

${\displaystyle {\frac {a_{0}}{2}}+\sum _{m=1}^{\infty }\left[a_{m}\cos \left(mx\right)+b_{m}\sin \left(mx\right)\right].}$

The coefficients am and bm are called Fourier coefficients of f, and are calculated by the formulas[80]

${\displaystyle a_{m}={\frac {1}{\pi }}\int _{0}^{2\pi }f(t)\cos(mt)\,dt}$ , ${\displaystyle b_{m}={\frac {1}{\pi }}\int _{0}^{2\pi }f(t)\sin(mt)\,dt.}$

In physical terms the function is represented as a superposition of sine waves and the coefficients give information about the function's frequency spectrum.[81] A complex-number form of Fourier series is also commonly used.[80] The concrete formulae above are consequences of a more general mathematical duality called Pontryagin duality.[82] Applied to the group R, it yields the classical Fourier transform; an application in physics are reciprocal lattices, where the underlying group is a finite-dimensional real vector space endowed with the additional datum of a lattice encoding positions of atoms in crystals.[83]

Fourier series are used to solve boundary value problems in partial differential equations.[84] In 1822, Fourier first used this technique to solve the heat equation.[85] A discrete version of the Fourier series can be used in sampling applications where the function value is known only at a finite number of equally spaced points. In this case the Fourier series is finite and its value is equal to the sampled values at all points.[86] The set of coefficients is known as the discrete Fourier transform (DFT) of the given sample sequence. The DFT is one of the key tools of digital signal processing, a field whose applications include radar, speech encoding, image compression.[87] The JPEG image format is an application of the closely related discrete cosine transform.[88]

The fast Fourier transform is an algorithm for rapidly computing the discrete Fourier transform.[89] It is used not only for calculating the Fourier coefficients but, using the convolution theorem, also for computing the convolution of two finite sequences.[90] They in turn are applied in digital filters[91] and as a rapid multiplication algorithm for polynomials and large integers (Schönhage–Strassen algorithm).[92][93]

### Differential geometry

The tangent space to the 2-sphere at some point is the infinite plane touching the sphere in this point.

The tangent plane to a surface at a point is naturally a vector space whose origin is identified with the point of contact. The tangent plane is the best linear approximation, or linearization, of a surface at a point.[nb 15] Even in a three-dimensional Euclidean space, there is typically no natural way to prescribe a basis of the tangent plane, and so it is conceived of as an abstract vector space rather than a real coordinate space. The tangent space is the generalization to higher-dimensional differentiable manifolds.[94]

Riemannian manifolds are manifolds whose tangent spaces are endowed with a suitable inner product.[95] Derived therefrom, the Riemann curvature tensor encodes all curvatures of a manifold in one object, which finds applications in general relativity, for example, where the Einstein curvature tensor describes the matter and energy content of space-time.[96][97] The tangent space of a Lie group can be given naturally the structure of a Lie algebra and can be used to classify compact Lie groups.[98]

## Generalizations

### Vector bundles

A Möbius strip. Locally, it looks like U × R.

A vector bundle is a family of vector spaces parametrized continuously by a topological space X.[94] More precisely, a vector bundle over X is a topological space E equipped with a continuous map

π : EX

such that for every x in X, the fiber π−1(x) is a vector space. The case dim V = 1 is called a line bundle. For any vector space V, the projection X × VX makes the product X × V 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 π−1(U) is isomorphic[nb 16] to the trivial bundle U × VU. Despite their locally trivial character, vector bundles may (depending on the shape of the underlying space X) be "twisted" in the large (i.e., the bundle need not be (globally isomorphic to) the trivial bundle X × V). For example, the Möbius strip can be seen as a line bundle over the circle S1 (by identifying open intervals with the real line). It is, however, different from the cylinder S1 × R, because the latter is orientable whereas the former is not.[99]

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 S1 is globally isomorphic to S1 × R, since there is a global nonzero vector field on S1.[nb 17] In contrast, by the hairy ball theorem, there is no (tangent) vector field on the 2-sphere S2 which is everywhere nonzero.[100] K-theory studies the isomorphism classes of all vector bundles over some topological space.[101] 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.

### Modules

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.[102] 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 (i.e., 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.[103] 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 spaces

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

Roughly, affine spaces are vector spaces whose origins are not specified.[104] 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

V × VV, (v, a) ↦ a + v.

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 xW; this space is denoted by x + V (it is a coset of V in W) and consists of all vectors of the form x + v for vV. An important example is the space of solutions of a system of inhomogeneous linear equations

Ax = b

generalizing the homogeneous case b = 0 above.[clarification needed][105] The space of solutions is the affine subspace x + V 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.[106] Grassmannians and flag manifolds generalize this by parametrizing linear subspaces of fixed dimension k and flags of subspaces, respectively.

## Notes

1. ^ It is also common, especially in physics, to denote vectors with an arrow on top: v.
2. ^ This axiom and the next refer to two different operations: scalar multiplication: bv; and field multiplication: ab. They do not assert the associativity of either operation. More formally, scalar multiplication is a monoid action of the multiplicative monoid of the field F on the vector space V.
3. ^ Some authors (such as Brown 1991) restrict attention to the fields R or C, but most of the theory is unchanged for an arbitrary field.
4. ^ The indicator functions of intervals (of which there are infinitely many) are linearly independent, for example.
5. ^ The nomenclature derives from German "eigen", which means own or proper.
7. ^ 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.
8. ^ Some authors (such as Roman 2005) choose to start with this equivalence relation and derive the concrete shape of V/W from this.
9. ^ This requirement implies that the topology gives rise to a uniform structure, Bourbaki 1989, ch. II
10. ^ The triangle inequality for ${\displaystyle \left\Vert {f+g}\right\Vert _{p}\leq \left\Vert {f}\right\Vert _{p}+\left\Vert {g}\right\Vert _{p}}$  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.
11. ^ "Many functions in ${\displaystyle L^{2}}$  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 ${\displaystyle L^{2}}$  norm, and the orthogonal decomposition would not apply to them. This shows one of the advantages of Lebesgue integration.", Dudley 1989, §5.3, p. 125
12. ^ For p ≠2, Lp(Ω) is not a Hilbert space.
13. ^ A basis of a Hilbert space is not the same thing as a basis in the sense of linear algebra above.[clarification needed] For distinction, the latter is then called a Hamel basis.
14. ^ Although the Fourier series is periodic, the technique can be applied to any L2 function on an interval by considering the function to be continued periodically outside the interval. See Kreyszig 1988, p. 601
15. ^ That is to say (BSE-3 2001), the plane passing through the point of contact P such that the distance from a point P1 on the surface to the plane is infinitesimally small compared to the distance from P1 to P in the limit as P1 approaches P along the surface.
16. ^ That is, there is a homeomorphism from π−1(U) to V × U which restricts to linear isomorphisms between fibers.
17. ^ A line bundle, such as the tangent bundle of S1 is trivial if and only if there is a section that vanishes nowhere, see Husemoller 1994, Corollary 8.3. The sections of the tangent bundle are just vector fields.

## Citations

1. ^ Roman 2005, ch. 1, p. 27
2. ^ van der Waerden 1993, Ch. 19
3. ^ Bourbaki 1998, §II.1.1. Bourbaki calls the group homomorphisms f(a) homotheties.
4. ^ Bourbaki 1969, ch. "Algèbre linéaire et algèbre multilinéaire", pp. 78–91
5. ^ Bolzano 1804
6. ^ Möbius 1827
7. ^ Crowe, Michel J. (1994), A History of Vector Analysis: The Evolution of the Idea of a Vectorial System, Dover, p. 11 and 16, ISBN 978-0-486-67910-5
8. ^ Hamilton 1853
9. ^ Grassmann 1844
10. ^ Peano 1888, ch. IX
11. ^ Banach 1922
12. ^ Dorier 1995, Moore 1995
13. ^ Lang 1987, ch. I.1
14. ^ Lang 2002, ch. V.1
15. ^ e.g. Lang 1993, ch. XII.3., p. 335
16. ^ Lang 1987, ch. IX.1
17. ^ Lang 1987, ch. VI.3.
18. ^ Roman 2005, Theorem 1.9, p. 43
19. ^ Blass 1984
20. ^ Halpern 1966, pp. 670–673
21. ^ Artin 1991, Theorem 3.3.13
22. ^ Braun 1993, Th. 3.4.5, p. 291
23. ^ Stewart 1975, Proposition 4.3, p. 52
24. ^ Stewart 1975, Theorem 6.5, p. 74
25. ^ Roman 2005, ch. 2, p. 45
26. ^ Lang 1987, ch. IV.4, Corollary, p. 106
27. ^ Lang 1987, Example IV.2.6
28. ^ Lang 1987, ch. VI.6
29. ^ Halmos 1974, p. 28, Ex. 9
30. ^ Lang 1987, Theorem IV.2.1, p. 95
31. ^ Roman 2005, Th. 2.5 and 2.6, p. 49
32. ^ Lang 1987, ch. V.1
33. ^ Lang 1987, ch. V.3., Corollary, p. 106
34. ^ Lang 1987, Theorem VII.9.8, p. 198
35. ^ Roman 2005, ch. 8, p. 135–156
36. ^ Lang 1987, ch. IX.4
37. ^ Roman 2005, ch. 8, p. 140.
38. ^ Roman 2005, ch. 1, p. 29
39. ^ Roman 2005, ch. 1, p. 35
40. ^ Roman 2005, ch. 3, p. 64
41. ^ Lang 1987, ch. IV.3.
42. ^ Roman 2005, ch. 2, p. 48
43. ^ Mac Lane 1998
44. ^ Roman 2005, ch. 1, pp. 31–32
45. ^ Lang 2002, ch. XVI.1
47. ^ Schaefer & Wolff 1999, pp. 204–205
48. ^ Bourbaki 2004, ch. 2, p. 48
49. ^ Roman 2005, ch. 9
50. ^ Naber 2003, ch. 1.2
51. ^ Treves 1967
52. ^ Bourbaki 1987
53. ^ Kreyszig 1989, §4.11-5
54. ^ Kreyszig 1989, §1.5-5
55. ^ Choquet 1966, Proposition III.7.2
56. ^ Treves 1967, p. 34–36
57. ^ Lang 1983, Cor. 4.1.2, p. 69
58. ^ Treves 1967, ch. 11
59. ^ Treves 1967, Theorem 11.2, p. 102
60. ^ Evans 1998, ch. 5
61. ^ Treves 1967, ch. 12
62. ^ Dennery 1996, p.190
63. ^ Lang 1993, Th. XIII.6, p. 349
64. ^ Lang 1993, Th. III.1.1
65. ^ Choquet 1966, Lemma III.16.11
66. ^ Kreyszig 1999, Chapter 11
67. ^ Griffiths 1995, Chapter 1
68. ^ Lang 1993, ch. XVII.3
69. ^ Lang 2002, ch. III.1, p. 121
70. ^ Eisenbud 1995, ch. 1.6
72. ^ Lang 2002, ch. XVI.7
73. ^ Lang 2002, ch. XVI.8
74. ^ Luenberger 1997, §7.13
75. ^
76. ^ Lang 1993, Ch. XI.1
77. ^ Evans 1998, Th. 6.2.1
78. ^ Folland 1992, p. 349 ff
79. ^ Gasquet & Witomski 1999, p. 150
80. ^ a b Gasquet & Witomski 1999, §4.5
81. ^ Gasquet & Witomski 1999, p. 57
82. ^ Loomis 1953, Ch. VII
83. ^ Ashcroft & Mermin 1976, Ch. 5
84. ^ Kreyszig 1988, p. 667
85. ^ Fourier 1822
86. ^ Gasquet & Witomski 1999, p. 67
87. ^ Ifeachor & Jervis 2002, pp. 3–4, 11
88. ^ Wallace Feb 1992
89. ^ Ifeachor & Jervis 2002, p. 132
90. ^ Gasquet & Witomski 1999, §10.2
91. ^ Ifeachor & Jervis 2002, pp. 307–310
92. ^ Gasquet & Witomski 1999, §10.3
93. ^ Schönhage & Strassen 1971
94. ^ a b Spivak 1999, ch. 3
96. ^ Misner, Thorne & Wheeler 1973, ch. 1.8.7, p. 222 and ch. 2.13.5, p. 325
97. ^ Jost 2005, ch. 3.1
98. ^ Varadarajan 1974, ch. 4.3, Theorem 4.3.27
99. ^ Kreyszig 1991, §34, p. 108
100. ^ Eisenberg & Guy 1979
101. ^ Atiyah 1989
102. ^ Artin 1991, ch. 12
103. ^ Grillet, Pierre Antoine. Abstract algebra. Vol. 242. Springer Science & Business Media, 2007.
104. ^ Meyer 2000, Example 5.13.5, p. 436
105. ^ Meyer 2000, Exercise 5.13.15–17, p. 442
106. ^ Coxeter 1987