Vectors and Vector Spaces: The Basics

⚡ Key Takeaways

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.

💡 The Core Insight

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 αu+βv\alpha\mathbf{u} + \beta\mathbf{v}.

Formal Statement

DefinitionField

A field FF is a set with two operations ++ and ⋅\cdot in which addition and multiplication are associative and commutative, both have identities (00 and 11, with 0≠10\neq 1), every element has an additive inverse, every nonzero element has a multiplicative inverse, and multiplication distributes over addition. The canonical examples are R\mathbb{R} (real numbers), C\mathbb{C} (complex numbers), and Q\mathbb{Q} (rationals). Scalars are drawn from FF.

DefinitionVector Space

A vector space over a field FF is a set VV together with two maps,

1
+:V×V→V,⋅:F×V→V,\quad +: V\times V \to V, \qquad \cdot: F\times V \to V,

Derivation hint: closure is built into the codomain VV — adding/scaling vectors must produce vectors. such that for all u,v,w∈V\mathbf{u},\mathbf{v},\mathbf{w}\in V and all α,β∈F\alpha,\beta\in F the following eight axioms hold:

2
(u+v)+w=u+(v+w)(additive associativity)\quad (\mathbf{u}+\mathbf{v})+\mathbf{w} = \mathbf{u}+(\mathbf{v}+\mathbf{w}) \quad\text{(additive associativity)}

Derivation hint: grouping of sums is irrelevant; lets us write u+v+w\mathbf{u}+\mathbf{v}+\mathbf{w} unambiguously.

3
u+v=v+u(commutativity)\quad \mathbf{u}+\mathbf{v} = \mathbf{v}+\mathbf{u} \quad\text{(commutativity)}

Derivation hint: order of addition does not matter; VV is an abelian group under ++.

4
∃ 0∈V: v+0=v(zero vector)\quad \exists\,\mathbf{0}\in V:\ \mathbf{v}+\mathbf{0}=\mathbf{v} \quad\text{(zero vector)}

Derivation hint: a single neutral element; uniqueness is a theorem, not an axiom.

5
∀ v ∃ (−v): v+(−v)=0(additive inverses)\quad \forall\,\mathbf{v}\ \exists\,(-\mathbf{v}):\ \mathbf{v}+(-\mathbf{v})=\mathbf{0} \quad\text{(additive inverses)}

Derivation hint: every vector can be "undone"; subtraction is defined as u−v:=u+(−v)\mathbf{u}-\mathbf{v}:=\mathbf{u}+(-\mathbf{v}).

6
α(u+v)=αu+αv(distributivity over vector sums)\quad \alpha(\mathbf{u}+\mathbf{v}) = \alpha\mathbf{u}+\alpha\mathbf{v} \quad\text{(distributivity over vector sums)}

Derivation hint: scaling a sum scales each part.

7
(α+β)v=αv+βv(distributivity over scalar sums)\quad (\alpha+\beta)\mathbf{v} = \alpha\mathbf{v}+\beta\mathbf{v} \quad\text{(distributivity over scalar sums)}

Derivation hint: this and [6] are the two distinct distributive laws; both are needed.

8
\quad \alpha(\beta\mathbf{v}) = (\alpha\beta)\mathbf{v},\qquad 1\,\mathbf{v}=\mathbf{v} \quad\text{(compatibility & unital)}

Derivation hint: scalar multiplication is compatible with field multiplication, and the field's 11 acts trivially. Elements of VV are vectors; elements of FF are scalars.

TheoremElementary Consequences

In any vector space: (a) the zero vector is unique; (b) additive inverses are unique; (c) 0 v=00\,\mathbf{v}=\mathbf{0} for every v\mathbf{v}; (d) α 0=0\alpha\,\mathbf{0}=\mathbf{0} for every scalar α\alpha; (e) (−1)v=−v(-1)\mathbf{v}=-\mathbf{v}; (f) if αv=0\alpha\mathbf{v}=\mathbf{0} then α=0\alpha=0 or v=0\mathbf{v}=\mathbf{0}.

DefinitionSubspace

A nonempty subset W⊆VW\subseteq V is a subspace if it is closed under addition and scalar multiplication; equivalently, WW is a subspace iff 0∈W\mathbf{0}\in W and αu+βv∈W\alpha\mathbf{u}+\beta\mathbf{v}\in W for all u,v∈W\mathbf{u},\mathbf{v}\in W, α,β∈F\alpha,\beta\in F. A subspace is itself a vector space.

DefinitionSpan, Independence, Basis, Dimension

The span of S={v1,…,vk}S=\{\mathbf{v}_1,\dots,\mathbf{v}_k\} is the set of all linear combinations:

9
span⁡(S)={∑i=1kαivi:αi∈F}.\quad \operatorname{span}(S)=\Big\{\textstyle\sum_{i=1}^{k}\alpha_i\mathbf{v}_i : \alpha_i\in F\Big\}.

Derivation hint: closure under ++ and ⋅\cdot makes this the smallest subspace containing SS. The set SS is linearly independent if

10
∑i=1kαivi=0 ⟹ α1=⋯=αk=0.\quad \sum_{i=1}^{k}\alpha_i\mathbf{v}_i=\mathbf{0}\ \Longrightarrow\ \alpha_1=\cdots=\alpha_k=0.

Derivation hint: the only way to write 0\mathbf{0} is the trivial way; no vector is redundant. A basis is a linearly independent spanning set. The dimension dim⁡V\dim V is the cardinality of any basis (well-defined by the theorem below).

TheoremDimension Theorem / Basis Invariance

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 dim⁡V\dim V is well-defined. If dim⁡V=n<∞\dim V = n < \infty, then any spanning set has ≥n\geq n elements, any independent set has ≤n\leq n elements, and any independent set of exactly nn vectors is automatically a basis.

Why It Holds / Derivation

ProofUniqueness of zero and that 0v=00\mathbf{v}=\mathbf{0}

Step 1 (zero is unique). Suppose 0\mathbf{0} and 0′\mathbf{0}' both satisfy axiom [4]. Then 0=0+0′=0′+0=0′\mathbf{0} = \mathbf{0}+\mathbf{0}' = \mathbf{0}'+\mathbf{0} = \mathbf{0}', using [4] for 0′\mathbf{0}', then commutativity [3], then [4] for 0\mathbf{0}. So 0=0′\mathbf{0}=\mathbf{0}'.

Step 2 (0 v=00\,\mathbf{v}=\mathbf{0}). Using distributivity [7] with α=β=0\alpha=\beta=0:

0 v=(0+0)v=0 v+0 v.0\,\mathbf{v}=(0+0)\mathbf{v}=0\,\mathbf{v}+0\,\mathbf{v}.

Add −(0 v)-(0\,\mathbf{v}) (which exists by [5]) to both sides and use [2],[4],[5]:

0=0 v+(−(0 v))=0 v.\mathbf{0} = 0\,\mathbf{v}+\big(-(0\,\mathbf{v})\big) = 0\,\mathbf{v}.

Step 3 ((−1)v=−v(-1)\mathbf{v}=-\mathbf{v}). By [7] and Step 2, v+(−1)v=1v+(−1)v=(1+(−1))v=0v=0\mathbf{v}+(-1)\mathbf{v} = 1\mathbf{v}+(-1)\mathbf{v} = (1+(-1))\mathbf{v} = 0\mathbf{v}=\mathbf{0}. By uniqueness of inverses, (−1)v=−v(-1)\mathbf{v}=-\mathbf{v}. ■\blacksquare

∎
ProofBasis invariance via the Steinitz Exchange Lemma

Lemma (Exchange). If {v1,…,vm}\{\mathbf{v}_1,\dots,\mathbf{v}_m\} spans VV and {w1,…,wn}\{\mathbf{w}_1,\dots,\mathbf{w}_n\} is linearly independent, then n≤mn\le m, and one may replace nn of the v\mathbf{v}'s by the w\mathbf{w}'s while still spanning.

Step 1. Since the v\mathbf{v}'s span, write w1=∑iαivi\mathbf{w}_1=\sum_i \alpha_i\mathbf{v}_i. Some αj≠0\alpha_j\neq 0 (else w1=0\mathbf{w}_1=\mathbf{0}, contradicting independence). Solve for vj\mathbf{v}_j in terms of w1\mathbf{w}_1 and the other v\mathbf{v}'s; the new set still spans.

Step 2. Iterate: at step kk express wk\mathbf{w}_k using the current spanning set {w1,…,wk−1,remaining v’s}\{\mathbf{w}_1,\dots,\mathbf{w}_{k-1},\text{remaining }\mathbf{v}\text{'s}\}. Independence of the w\mathbf{w}'s guarantees a nonzero coefficient on some remaining v\mathbf{v}, so a v\mathbf{v} can be swapped out. This requires there to be a remaining v\mathbf{v} at each step, forcing n≤mn\le m.

Step 3 (invariance). If B1B_1 and B2B_2 are both bases, apply the lemma twice: B2B_2 independent + B1B_1 spanning gives ∣B2∣≤∣B1∣|B_2|\le|B_1|; symmetrically ∣B1∣≤∣B2∣|B_1|\le|B_2|. Hence ∣B1∣=∣B2∣|B_1|=|B_2|. ■\blacksquare

∎
mathematician · Giuseppe Peano | 1858–1932

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

🧠 Intuition

Picture an arrow anchored at the origin. Adding two arrows is the parallelogram (tip-to-tail) rule; scaling by α\alpha stretches the arrow (∣α∣>1|\alpha|>1), shrinks it (∣α∣<1|\alpha|<1), or flips it (α<0\alpha<0). 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 αi\alpha_i) that rebuilds a vector from the basis arrows.

Figure
Vector addition by the parallelogram rule and the span of two vectors
x y O u v u + v span{u,v} fills the whole plane when u, v are independent

Worked Examples

ExampleChecking independence and finding a basis in R3\mathbb{R}^3

Given: v1=(1,2,3)\mathbf{v}_1=(1,2,3), v2=(2,4,6)\mathbf{v}_2=(2,4,6), v3=(0,1,1)\mathbf{v}_3=(0,1,1) in R3\mathbb{R}^3. Find dim⁡span⁡{v1,v2,v3}\dim\operatorname{span}\{\mathbf{v}_1,\mathbf{v}_2,\mathbf{v}_3\} and a basis.

Step 1. Notice v2=2v1\mathbf{v}_2 = 2\mathbf{v}_1, so v2\mathbf{v}_2 is redundant. They are not independent: 2v1−v2+0⋅v3=02\mathbf{v}_1 - \mathbf{v}_2 + 0\cdot\mathbf{v}_3 = \mathbf{0}, a nontrivial relation.

Step 2. Test {v1,v3}\{\mathbf{v}_1,\mathbf{v}_3\}. Suppose av1+bv3=0a\mathbf{v}_1+b\mathbf{v}_3=\mathbf{0}:

(a, 2a+b, 3a+b)=(0,0,0).(a,\,2a+b,\,3a+b)=(0,0,0).

From the first coordinate a=0a=0; then b=0b=0. Independent.

Step 3. Two independent vectors span a plane, dimension 2.

Answer: dim⁡=2, basis {(1,2,3),(0,1,1)}\boxed{\dim = 2,\ \text{basis } \{(1,2,3),(0,1,1)\}} (a plane through the origin in R3\mathbb{R}^3).

ExampleA function space: solutions of a differential equation

Given: The set VV of all real solutions of y′′+4y=0y'' + 4y = 0. Show VV is a vector space and find its dimension.

Step 1 (subspace of C∞(R)C^\infty(\mathbb{R})). If y1,y2y_1,y_2 solve the equation, then for scalars α,β\alpha,\beta:

(αy1+βy2)′′+4(αy1+βy2)=α(y1′′+4y1)+β(y2′′+4y2)=0+0=0.(\alpha y_1+\beta y_2)'' + 4(\alpha y_1+\beta y_2) = \alpha(y_1''+4y_1)+\beta(y_2''+4y_2)=0+0=0.

So VV is closed under linear combinations and contains y≡0y\equiv 0 — it is a subspace, hence a vector space.

Step 2 (basis). Standard ODE theory gives the general solution y=c1cos⁡2x+c2sin⁡2xy=c_1\cos 2x + c_2\sin 2x. The functions cos⁡2x, sin⁡2x\cos 2x,\ \sin 2x are independent (their Wronskian is 2≠02\neq 0) and span VV.

Answer: dim⁡V=2, basis {cos⁡2x, sin⁡2x}\boxed{\dim V = 2,\ \text{basis }\{\cos 2x,\ \sin 2x\}}. A second-order linear ODE has a 2-dimensional solution space.

Common Misconceptions

⚠️ Common mistake

"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 0\mathbf{0}. Finally, "dimension" counts basis vectors, not the number of coordinates you happen to write down — a plane in R3\mathbb{R}^3 uses 3-tuples but has dimension 2.

Counterexample

Is W={(x,y)∈R2:x2+y2≤1}W=\{(x,y)\in\mathbb{R}^2 : x^2+y^2\le 1\} (the unit disk) a subspace? No. It contains 0\mathbf{0}, but it fails scalar closure: (1,0)∈W(1,0)\in W yet 2⋅(1,0)=(2,0)∉W2\cdot(1,0)=(2,0)\notin W. Closure under scaling forces a subspace to be unbounded (unless it is just {0}\{\mathbf{0}\}). Similarly {(x,y):xy=0}\{(x,y):xy=0\} (the union of both axes) contains 0\mathbf{0} and is closed under scaling but fails addition: (1,0)+(0,1)=(1,1)(1,0)+(0,1)=(1,1) has xy=1≠0xy=1\neq 0. Subspaces must pass all closure tests, not some.

Connections

connection

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 C\mathbb{C}, 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

🔬 Where this appears

Historical Development

⏳ History
- 1827–1844 — Möbius & Grassmann: Möbius introduces barycentric coordinates; Hermann Grassmann's Ausdehnungslehre (1844) develops abstract nn-dimensional linear algebra, far ahead of its time and largely unread.
- 1843 — Hamilton: invents quaternions, an early algebraic system mixing scalar and vector parts; coins the word "vector."
- 1888 — Peano: gives the first axiomatic definition of a real vector space and of linear independence/dimension.
- 1880s–1901 — Gibbs & Heaviside: develop the modern vector calculus (dot and cross products) used in physics, derived from quaternions.
- 1918 — Weyl: in Raum, Zeit, Materie, uses axiomatic vector spaces in relativity and popularizes the abstract viewpoint.
- 1920s — Banach, Hahn, Wiener: extend the theory to infinite-dimensional normed spaces (Banach spaces), founding functional analysis.
- 1930s — van der Waerden & Bourbaki: Moderne Algebra (1930) and later Bourbaki cement vector spaces over arbitrary fields as a standard chapter of algebra.
- 1940s–present: vector spaces become foundational across pure and applied mathematics, physics, and computer science.

Subtleties & Limits

open-problem

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 R\mathbb{R} over Q\mathbb{Q}. (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