How to Determine if X Is a Vector Space- A Step‑by‑Step Guide
What Is a Vector Space?
A vector space is a set of objects called vectors, combined with two operations: addition and scalar multiplication. For the set to actually be a vector space, it must satisfy ten specific axioms. That's it. No magic, no hand-waving.
Most students waste time memorizing definitions. You don't need that. You need to understand the axioms and know how to check each one systematically.
The 10 Axioms You Must Check
Every vector space must satisfy these conditions. If even one fails, the set is not a vector space. Period.
- Closure under addition: Adding any two vectors in the set must produce another vector in the set.
- Commutativity of addition: u + v = v + u for all vectors.
- Associativity of addition: (u + v) + w = u + (v + w) for all vectors.
- Existence of additive identity: There exists a zero vector such that v + 0 = v.
- Existence of additive inverses: For every vector v, there exists -v such that v + (-v) = 0.
- Closure under scalar multiplication: Multiplying any vector by a scalar must produce a vector in the set.
- Distributivity of scalar multiplication over vector addition: c(u + v) = cu + cv.
- Distributivity of scalar multiplication over scalar addition: (c + d)v = cv + dv.
- Associativity of scalar multiplication: c(dv) = (cd)v.
- Multiplicative identity: 1v = v for all vectors.
The Step-by-Step Process
Here's how to actually determine if X is a vector space. Follow these steps in order. Don't skip ahead.
Step 1: Identify the Set and Its Operations
Before checking anything, you need to know exactly what set you're working with and what addition/scalar multiplication mean in that context. This matters more than most students realize.
Example: The set of 2×2 matrices is a vector space when you use standard matrix addition and scalar multiplication. But swap those operations for something else, and the answer changes instantly.
Step 2: Check Closure Properties First
Start with closure under addition and closure under scalar multiplication. These are the most common failure points. If either fails, you can stop. It's not a vector space.
Step 3: Verify the Zero Vector Exists
Find the additive identity for your set. Does it exist? Is it unique? For most "obvious" vector spaces like R^n, this is trivial. For stranger sets, this trips people up constantly.
Step 4: Confirm Additive Inverses
Every vector must have a corresponding inverse that lives in the set. This is where sets like "positive real numbers" fail as vector spaces under standard operations.
Step 5: Check the Remaining Axioms
If you've passed the first four steps, work through the distributive, associative, and identity properties. Usually these hold automatically if you've defined operations sensibly, but you still need to verify.
Common Examples: Vector Space or Not?
Nothing teaches better than concrete examples. Let's walk through the most common ones you'll encounter.
R^n — The Standard Example
The set of n-tuples of real numbers under standard addition and multiplication is a vector space. This is your baseline. Every other example either mirrors this or fails somewhere.
Polynomials of Degree ≤ n
The set of all polynomials with degree at most n forms a vector space. Addition of two such polynomials produces another polynomial of degree at most n. Scalars multiply coefficients without changing degree. The zero polynomial serves as the additive identity. Everything checks out.
Continuous Functions on [a,b]
The set C[a,b] of all continuous real-valued functions on the interval [a,b] is a vector space. Addition is pointwise addition, scalar multiplication is pointwise multiplication. The zero function is the additive identity. This one works because continuity is preserved under these operations.
R^+ — Positive Real Numbers
Here's one that trips people up. The set of positive real numbers is not a vector space under standard addition. Why? The sum of two positive numbers is positive, so closure passes. But the additive identity would need to be 0, and 0 isn't in the set.
You could redefine operations to make it work, but with standard operations, this fails.
Matrices with Specific Dimensions
The set of all m×n matrices is a vector space. Addition is matrix addition, scalar multiplication is matrix scalar multiplication. The zero matrix is the additive identity. Every matrix has its negative. This is straightforward.
Vector Space Comparison Table
| Set | Operations | Vector Space? | Failure Point (if any) |
|---|---|---|---|
| R^n | Standard | Yes | — |
| Polynomials (deg ≤ n) | Standard polynomial ops | Yes | — |
| All polynomials | Standard polynomial ops | Yes | — |
| Positive reals R^+ | Standard | No | No additive identity |
| 2×2 matrices | Matrix addition, scalar mult | Yes | — |
| Complex numbers C | Standard | Yes | — |
| Integers Z | Standard | No | No additive inverses |
| Continuous functions | Pointwise addition | Yes | — |
How to Actually Check: A Practical Example
Let's prove that the set of all ordered pairs (x, y) with the following operations is a vector space:
Addition: (x₁, y₁) + (x₂, y₂) = (x₁ + x₂, y₁ + y₂)
Scalar multiplication: c(x, y) = (cx, 0)
Checking Step by Step
Closure under addition: (x₁ + x₂, y₁ + y₂) is an ordered pair. ✓
Commutativity: (x₁ + x₂, y₁ + y₂) = (x₂ + x₁, y₂ + y₁). ✓
Associativity: ((x₁ + x₂) + x₃, (y₁ + y₂) + y₃) = (x₁ + (x₂ + x₃), y₁ + (y₂ + y₃)). ✓
Additive identity: Need (0, 0) such that (x, y) + (0, 0) = (x, y). Works. ✓
Additive inverses: Need (-x, -y) such that (x, y) + (-x, -y) = (0, 0). Works. ✓
Closure under scalar multiplication: c(x, y) = (cx, 0), which is an ordered pair. ✓
Distributivity over vector addition: c(x₁ + x₂, y₁ + y₂) = (c(x₁ + x₂), 0) = (cx₁ + cx₂, 0). Meanwhile, c(x₁, y₁) + c(x₂, y₂) = (cx₁, 0) + (cx₂, 0) = (cx₁ + cx₂, 0). ✓
Distributivity over scalar addition: (c + d)(x, y) = ((c + d)x, 0) = (cx + dx, 0). Meanwhile, c(x, y) + d(x, y) = (cx, 0) + (dx, 0) = (cx + dx, 0). ✓
Associativity of scalar multiplication: c(d(x, y)) = c(dx, 0) = (cdx, 0) = (cd)(x, y). ✓
Multiplicative identity: 1(x, y) = (1·x, 0) = (x, 0). But wait—1(x, y) should equal (x, y) for all vectors. Here, 1(x, y) = (x, 0), which is not equal to (x, y) unless y = 0. ✗
Result: Not a vector space. The scalar multiplication is defined poorly—it destroys the y-component. The multiplicative identity fails.
This example shows exactly why you check every axiom. You might think everything works, but one failure eliminates the entire structure.
Common Mistakes to Avoid
- Assuming standard operations: Always verify what addition and scalar multiplication mean for the given set. The same set can be a vector space one way and not another.
- Forgetting to check closure first: If closure fails, you've wasted time checking other axioms. Do closure checks first.
- Assuming the zero vector is obvious: For weird sets, the additive identity might not be what you expect. Find it explicitly.
- Getting sloppy with scalar fields: Some vector spaces use scalars from C instead of R. Know which field you're working with.
- Skipping the multiplicative identity: Students often forget to check that 1v = v. It's an axiom, not a given.
Quick Reference Checklist
When you're asked "Is X a vector space?", run through this mental list:
- What are the set, addition, and scalar multiplication?
- Does closure under addition hold?
- Does closure under scalar multiplication hold?
- Does an additive identity exist in the set?
- Does every element have an additive inverse in the set?
- Do the distributive properties hold?
- Do associativity properties hold?
- Does the multiplicative identity hold?
If you answered "yes" to all eight, you have a vector space. If any answer is "no" or "I don't know," dig deeper into that specific axiom.