Vectors and Vector Spaces: The Basics
A vector space is a set of objects ("vectors") that can be added together and scaled by numbers ("scalars") so that the familiar rules of arithmetic hold. Key result in words: any vector space is completely determined (up to relabeling) by a single number, its dimension, the size of any basis. Where it applies: linear algebra, geometry, physics, computer graphics, data science, quantum mechanics, differential equations. Who/when: the abstract axioms were crystallized by Giuseppe Peano (1888), building on Grassmann (1844) and Hamilton.
Forget what the objects "are." A vector space is defined entirely by what you are allowed to do with them: add two and scale one. Everything else — lines, planes, independence, dimension, coordinates — is forced by those two operations and their algebraic laws. Linearity is the whole subject: a vector space is the natural home of the operation .
Formal Statement
A field is a set with two operations and in which addition and multiplication are associative and commutative, both have identities ( and , with ), every element has an additive inverse, every nonzero element has a multiplicative inverse, and multiplication distributes over addition. The canonical examples are (real numbers), (complex numbers), and (rationals). Scalars are drawn from .
A vector space over a field is a set together with two maps,
Derivation hint: closure is built into the codomain — adding/scaling vectors must produce vectors. such that for all and all the following eight axioms hold:
Derivation hint: grouping of sums is irrelevant; lets us write unambiguously.
Derivation hint: order of addition does not matter; is an abelian group under .
Derivation hint: a single neutral element; uniqueness is a theorem, not an axiom.
Derivation hint: every vector can be "undone"; subtraction is defined as .
Derivation hint: scaling a sum scales each part.
Derivation hint: this and [6] are the two distinct distributive laws; both are needed.
Derivation hint: scalar multiplication is compatible with field multiplication, and the field's acts trivially. Elements of are vectors; elements of are scalars.
In any vector space: (a) the zero vector is unique; (b) additive inverses are unique; (c) for every ; (d) for every scalar ; (e) ; (f) if then or .
A nonempty subset is a subspace if it is closed under addition and scalar multiplication; equivalently, is a subspace iff and for all , . A subspace is itself a vector space.
The span of is the set of all linear combinations:
Derivation hint: closure under and makes this the smallest subspace containing . The set is linearly independent if
Derivation hint: the only way to write is the trivial way; no vector is redundant. A basis is a linearly independent spanning set. The dimension is the cardinality of any basis (well-defined by the theorem below).
Every vector space has a basis (assuming the axiom of choice for infinite-dimensional cases), and all bases of a given vector space have the same cardinality. Hence is well-defined. If , then any spanning set has elements, any independent set has elements, and any independent set of exactly vectors is automatically a basis.
Why It Holds / Derivation
Step 1 (zero is unique). Suppose and both satisfy axiom [4]. Then , using [4] for , then commutativity [3], then [4] for . So .
Step 2 (). Using distributivity [7] with :
Add (which exists by [5]) to both sides and use [2],[4],[5]:
Step 3 (). By [7] and Step 2, . By uniqueness of inverses, .
∎Lemma (Exchange). If spans and is linearly independent, then , and one may replace of the 's by the 's while still spanning.
Step 1. Since the 's span, write . Some (else , contradicting independence). Solve for in terms of and the other 's; the new set still spans.
Step 2. Iterate: at step express using the current spanning set . Independence of the 's guarantees a nonzero coefficient on some remaining , so a can be swapped out. This requires there to be a remaining at each step, forcing .
Step 3 (invariance). If and are both bases, apply the lemma twice: independent + spanning gives ; symmetrically . Hence .
∎The Italian logician and mathematician gave, in his 1888 book Calcolo geometrico secondo l'Ausdehnungslehre di H. Grassmann, the first fully axiomatic definition of a vector space over the reals — essentially the eight axioms above, including the abstract notion of a "linear system" of arbitrary (even infinite) dimension. He distilled Hermann Grassmann's dense 1844 Ausdehnungslehre into clean axioms decades before the language became standard. Peano is more famous for his axioms for the natural numbers, but his vector-space definition is strikingly modern and was largely ignored until the 1920s revival by Weyl and Banach.
Building Intuition
Picture an arrow anchored at the origin. Adding two arrows is the parallelogram (tip-to-tail) rule; scaling by stretches the arrow (), shrinks it (), or flips it (). The eight axioms are just the statement that this geometric arithmetic "behaves like numbers." A subspace is a flat object through the origin — a line, a plane — that is self-contained under these operations. A basis is a minimal set of arrows from which every other arrow can be reached by sliding and scaling; dimension counts how many independent directions you need. The deep point: even though polynomials, matrices, and audio signals look nothing like arrows, they obey the identical rules, so the picture transfers. Coordinates are nothing but the recipe (the coefficients ) that rebuilds a vector from the basis arrows.
Worked Examples
Given: , , in . Find and a basis.
Step 1. Notice , so is redundant. They are not independent: , a nontrivial relation.
Step 2. Test . Suppose :
From the first coordinate ; then . Independent.
Step 3. Two independent vectors span a plane, dimension 2.
Answer: (a plane through the origin in ).
Given: The set of all real solutions of . Show is a vector space and find its dimension.
Step 1 (subspace of ). If solve the equation, then for scalars :
So is closed under linear combinations and contains — it is a subspace, hence a vector space.
Step 2 (basis). Standard ODE theory gives the general solution . The functions are independent (their Wronskian is ) and span .
Answer: . A second-order linear ODE has a 2-dimensional solution space.
Common Misconceptions
"Vectors are arrows / lists of numbers." That is only one model. Polynomials, matrices, continuous functions, and infinite sequences are all genuine vectors. The axioms — not the appearance — decide. Also beware: the zero vector must lie in every subspace; a line not through the origin is not a subspace, because it fails closure and lacks . Finally, "dimension" counts basis vectors, not the number of coordinates you happen to write down — a plane in uses 3-tuples but has dimension 2.
Is (the unit disk) a subspace? No. It contains , but it fails scalar closure: yet . Closure under scaling forces a subspace to be unbounded (unless it is just ). Similarly (the union of both axes) contains and is closed under scaling but fails addition: has . Subspaces must pass all closure tests, not some.
Connections
Vector spaces are the objects on which Linear Transformations act; the structure-preserving maps between them are precisely linear maps, and choosing bases turns these into Matrices. Endowing a space with a dot product gives lengths and angles, leading to orthogonality and Gram-Schmidt Orthogonalization. The quotient of a space by a subspace yields Quotient Spaces, and the catalog of subspaces forms a lattice. Over , vector spaces underpin Eigenvalues and Eigenvectors and the spectral theorem. Infinite-dimensional vector spaces with a topology become Hilbert Spaces and Banach Spaces, the arena of functional analysis.
Real-World Applications
Historical Development
Subtleties & Limits
The clean theory above is for finite-dimensional spaces over a field. Subtleties multiply otherwise. (1) Proving that every vector space has a basis requires the Axiom of Choice (it is in fact equivalent to it); for infinite-dimensional spaces a basis (a Hamel basis) is non-constructive and typically uncountable, e.g. for over . (2) Over a general ring rather than a field, the analogue (a module) can fail to have a basis at all, and dimension need not be well-defined — the IBN (invariant basis number) property can fail. (3) In infinite dimensions, the algebraic Hamel basis is usually useless for analysis; one uses topological (Schauder) bases instead, raising open questions historically (the basis problem, resolved negatively by Enflo in 1973: there exist Banach spaces with no Schauder basis). These boundaries mark where "the basics" hand off to module theory and functional analysis.
See Also
Linear Transformations · Matrices · Basis and Dimension · Inner Product Spaces · Quotient Spaces · Eigenvalues and Eigenvectors · Modules over a Ring · Banach Spaces