A vector space over ℝ is a set V with addition and scalar multiplication satisfying eight axioms: closure, associativity, commutativity, additive identity, additive inverses, distributivity, associativity of scalar multiplication, and scalar multiplicative identity. Examples include Rⁿ, polynomials of degree ≤ n, and continuous functions on [a,b].
You have worked with vectors in ℝⁿ — arrows in the plane or in three-dimensional space, added tip-to-tail and scaled by numbers. A vector space takes the key properties of ℝⁿ and turns them into axioms: a precise, minimal list of rules that any mathematical system must satisfy to deserve the name "vector space." This abstraction is one of the most powerful moves in all of mathematics.
The eight axioms divide into two groups. The first four govern vector addition: the sum of any two elements in V is again in V (closure); addition is commutative and associative; there is an additive identity (the zero vector); and every element has an additive inverse. The next four govern scalar multiplication: scaling an element gives another element in V; and scalar multiplication distributes over both vector addition and scalar addition in the expected ways. These axioms are not arbitrary — they capture exactly what is needed to do linear algebra.
Why does this matter? Consider polynomials of degree ≤ 2. You can add two such polynomials and stay within the set. You can multiply a polynomial by a real number and stay within the set. All eight axioms hold. So these polynomials form a vector space, even though they contain no "arrows." The same is true of continuous functions on an interval, of matrices of a fixed size, and of many other mathematical objects. Every theorem proved for abstract vector spaces applies to all of these at once.
A subtle but important point: the set of polynomials of *exactly* degree 3 is *not* a vector space. Add x³ + 1 and −x³ + x and you get x + 1 — a degree-1 polynomial, outside the set. This violates closure. The axioms are not merely convention; they identify what structure must be present for the whole framework to work. When a set fails even one axiom, the machinery of linear algebra breaks down for that set.
Once you have the concept of a vector space, you can ask the same structural questions about every example: What are the "independent" elements? What is the smallest set that "spans" the whole space? What is the dimension? These questions — answered by the concepts of basis and dimension — apply equally to ℝⁿ, polynomial spaces, and function spaces. The abstraction is what allows a single, unified theory to cover all of them.