Vector space Created 2026-09-24 Updated 2026-10-14
A vector space over a field is a set equipped with vector addition and scalar multiplication satisfying the vector space axioms. Its vectors can represent directed displacements, lists of measurements, polynomials, or entire functions. The common structure is that adding two elements and multiplying an element by a scalar remain meaningful operations inside the same space.
For example, uses coordinatewise addition and scaling. Withwe have . Moving twice along and once along reaches the same vector as five horizontal and four vertical steps. The two descriptions refer to different bases of the same space. A basis makes such descriptions unique; a spanning set makes them possible.
The space of real polynomials of degree at most two has basis : the polynomial is the linear combination with coordinates . The zero vector here is the zero polynomial, and addition combines coefficients. A derivative is a linear map on this space; its matrix records how it acts on the three basis vectors. The same coordinate machinery therefore handles both geometric motion and operations on functions.
The choice of field matters. The complex numbers form a one-dimensional vector space over with basis , but a two-dimensional vector space over with basis . The question "how many independent directions?" has an answer only after the allowed scalars are specified. Likewise, polynomials of degree exactly two do not form a vector space: subtraction can remove the leading term, and the zero polynomial is absent.
The usefulness of the abstraction is that a linear map is determined by its values on a basis. Once those images are known, linear combinations give its action on every vector. The rank-nullity theorem relates the number of attainable outputs to the number of invisible input directions, while change of basis lets us choose coordinates suited to the problem. Eigenvectors, for example, choose directions on which repeated application of a linear operator becomes scalar multiplication.
A historical source is Hermann Grassmann's Die lineale Ausdehnungslehre (1844). Its full title advertises applications to other branches of mathematics, statics, mechanics, magnetism and crystallography; the original edition is digitized by ETH-Bibliothek. This gives an early setting for treating geometric quantities algebraically across different applications, rather than attributing the modern axiom list to that title alone.[ref]
https://www.e-rara.ch/zut/content/titleinfo/1169335. Grassmann, Die lineale Ausdehnungslehre, Leipzig, 1844; ETH-Bibliothek Rar 5128
Vector space bases from Zorn's lemma 2026-10-14
Every vector space over a field has a basis, assuming the axiom of choice. More generally, any linearly independent subset extends to a basis. This is an algebraic Hamel basis: each representation uses a finite linear combination, even when the basis is infinite.[ref]
Use the poset of linearly independent subsets containing :It is a set, being a subset of the power set of , and is nonempty because .
A short proof outline supplies both essential steps:
- For a nonempty chain in a partial order , put . Any finite linear relation in lies in one member of : among finitely many containing members, one contains the rest. Its linear independence makes every coefficient zero. Thus is an upper bound. For the empty chain in a partial order, use ; its empty union need not contain .
- Zorn's lemma gives a maximal element . If a vector lies outside its linear span, then is linearly independent: a linear relation with nonzero coefficient on would express in that linear span. This contradicts maximality, so is a spanning set and hence a basis.[ref]
Taking proves existence, including , whose basis is the empty set. The chain in a partial order need not be indexed by the natural numbers: only the finitely many members needed for a particular linear relation are compared. An arbitrary union of linearly independent sets can fail: and for a nonzero vector over the real numbers are each linearly independent, but their union is linearly dependent. The nesting of a chain in a partial order is what prevents this failure.
