Difficulty: Intermediate | Prerequisites: Familiarity with ℝⁿ, basic set notation, the notion of a "function" or "operation" on a set
This is where MATH 416 shifts from computational (row-reducing matrices) to abstract. A vector space is the central object of study for the rest of the course. The definition given here is deliberately general: it applies to ℝⁿ, but also to spaces of polynomials, spaces of functions, spaces of matrices, and many others. Learning the eight axioms is not about memorising a list. It is about understanding what properties a set must have before the tools of linear algebra (span, basis, dimension, linear transformations) can be applied to it.
A vector space is a set V equipped with addition and scalar multiplication that satisfy eight axioms. These axioms guarantee that the algebraic machinery of linear algebra works. If even one axiom fails, V is not a vector space and the standard theorems do not apply.
Vector space
A set V together with two operations (addition and scalar multiplication) satisfying eight axioms listed below. The elements of V are called vectors, regardless of whether they look like arrows or columns of numbers.
Think of it as any collection of objects where you can add them together and scale them, and the results still behave "nicely."
Addition (vector addition)
An operation V × V → V that takes two elements u, v in V and produces a third element u + v, also in V.
In simple terms, adding two vectors always gives you another vector in the same set.
Scalar multiplication
An operation ℝ × V → V that takes a real number a and a vector u in V and produces a vector au in V.
In simple terms, scaling a vector by any real number keeps you inside the same set.
Zero vector (0̄)
A special element of V satisfying v + 0̄ = v for every v in V. Every vector space must contain exactly one zero vector.
Think of it as the "do nothing" element for addition.
Additive inverse
For each v in V, there is some w in V such that v + w = 0̄. This w is the additive inverse of v (often written −v).
In simple terms, every vector can be "cancelled out" by adding its opposite.
A vector space is a set V with two operations:
Addition: V × V → V, sending (u, v) to u + v
Scalar multiplication: ℝ × V → V, sending (a, u) to au
such that all eight of the following axioms hold.
Axioms for addition (1 through 4):
(1) Commutativity: u + v = v + u for all u, v ∈ V
(2) Associativity: (u + v) + w = u + (v + w) for all u, v, w ∈ V
(3) Existence of zero vector: There exists 0̄ ∈ V such that v + 0̄ = v for all v ∈ V
(4) Existence of additive inverses: For all v ∈ V, there exists w ∈ V such that v + w = 0̄
Axioms involving scalar multiplication (5 through 8):
(5) Multiplicative identity: 1v = v for all v ∈ V
(6) Compatibility of scalar multiplication: (ab)v = a(bv) for all a, b ∈ ℝ, v ∈ V
(7) Distributivity over vector addition: a(u + v) = au + av
(8) Distributivity over scalar addition: (a + b)v = av + bv
When asked to verify that a set is a vector space, you must check all eight axioms. When asked to show something is not a vector space, it is enough to find a single axiom that fails, along with a concrete counterexample.
A common verification strategy:
Define the proposed addition and scalar multiplication explicitly.
Check closure: does u + v stay in V? Does au stay in V? (Closure is implicit in the requirement that the operations map into V.)
Check each axiom, usually by direct computation.
There are no computational formulas here in the usual sense. The axioms themselves are the "formulas." For reference:
(1) u + v = v + u
(2) (u + v) + w = u + (v + w)
(3) ∃ 0̄ ∈ V : v + 0̄ = v ∀v
(4) ∀v ∈ V, ∃w ∈ V : v + w = 0̄
(5) 1v = v
(6) (ab)v = a(bv)
(7) a(u + v) = au + av
(8) (a + b)v = av + bv
The abstraction of vector spaces is what lets the same linear algebra toolkit apply across wildly different domains. Signal processing treats audio signals as vectors in a function space. Machine learning represents data points as vectors in high-dimensional ℝⁿ. Quantum mechanics describes the state of a system as a vector in a Hilbert space. In each case, the eight axioms hold, so all the standard theorems apply.
Students often assume "vector" means "column of numbers." In an abstract vector space, vectors can be polynomials, functions, matrices, or any objects satisfying the axioms.
Thinking that closure is a separate axiom. Closure is built into the definition of the operations (they map into V), but you still need to verify it when checking whether a proposed set and operations form a vector space.
Confusing the zero vector with the number 0. In ℝⁿ the zero vector is (0, 0, ..., 0). In the space of polynomials of degree at most n, the zero vector is the zero polynomial. The zero vector depends on the space.
Forgetting Axiom 5 (1v = v). This axiom looks trivial, but it rules out exotic scalar multiplications where scaling by 1 does something unexpected.
⚠️ "Prove that the following set is (or is not) a vector space" is a standard exam question. Know the eight axioms cold and be ready to verify or disprove them.
⚠️ When disproving, one counterexample to one axiom is enough. Pick the axiom that looks most likely to fail and construct a specific numerical example.
⚠️ Closure failures are the most common way to show something is not a vector space. Check whether adding two elements or scaling an element could land you outside the set.
⚠️ The axioms are numbered differently in different textbooks. Know them by content, not just by number.
True or false: Every vector space must contain a zero vector.
Fill in the blank: Axiom 6 says that scalar multiplication is ______ with respect to multiplication of scalars.
True or false: The set of all 2×2 matrices with the usual matrix addition and scalar multiplication forms a vector space.
Fill in the blank: To show a set is not a vector space, it suffices to find one ______ that fails.
True or false: In a vector space, the additive inverse of a vector v is always −1 · v.
Answers: 1. True (Axiom 3). 2. associative (or "compatible"). 3. True. 4. axiom (with a counterexample). 5. True (this can be proved from the axioms, and is a standard early exercise).
Q: State the definition of a vector space.
A: A vector space is a set V equipped with an addition operation V × V → V and a scalar multiplication operation ℝ × V → V satisfying eight axioms: commutativity and associativity of addition, existence of a zero vector, existence of additive inverses, the multiplicative identity property (1v = v), compatibility of scalar multiplication, and distributivity of scalar multiplication over both vector addition and scalar addition.
Q: Why is the set of all polynomials of degree exactly 3 (not "at most 3") unlikely to be a vector space under the usual operations?
A: Closure under addition fails. Adding two degree-3 polynomials can produce a polynomial of degree less than 3 if the leading terms cancel. For example, (x³ + x) + (−x³ + 2x) = 3x, which has degree 1, not 3.
Q: Which axiom does scalar multiplication by zero test?
A: It relates to Axiom 5 and the interaction between Axioms 3 and 8. From the axioms, you can prove that 0v = 0̄ for any v (where 0 on the left is the scalar zero and 0̄ on the right is the zero vector). This is a consequence, not a separate axiom.
Q: Suppose V = ℝ² with the usual addition but scalar multiplication defined as a(x, y) = (ax, 0). Is this a vector space?
A: No. Axiom 5 fails: 1 · (x, y) = (x, 0) ≠ (x, y) whenever y ≠ 0.
The vector space definition is the foundation for everything ahead in MATH 416. Subspaces, span, linear independence, basis, and dimension are all defined in terms of vector space axioms. Linear transformations are functions between vector spaces that respect addition and scalar multiplication. The eigenvalue theory at the end of the course also lives inside the vector space framework. Understanding the abstract definition now will make every subsequent topic more transparent.
Related Terms / Search Tags: vector space, vector space axioms, addition, scalar multiplication, zero vector, additive inverse, closure, commutativity, associativity, distributivity, abstract linear algebra, ℝⁿ, polynomial vector space, function space, MATH 416, Section 1.2