Overview
A vector space is a set V with two operations (addition and scalar multiplication) that satisfy specific axioms. Vector spaces generalize the properties of Rn.
Definition
A vector space over a field F (usually R) is a set V with:
- Addition: V×V→V
- Scalar multiplication: F×V→V
Vector Space Axioms
| Axiom | Property |
|---|
| A1 | u+v=v+u (commutativity) |
| A2 | (u+v)+w=u+(v+w) (associativity) |
| A3 | ∃0∈V:v+0=v (identity) |
| A4 | ∃−v∈V:v+(−v)=0 (inverse) |
| S1 | c(u+v)=cu+cv |
| S2 | (c+d)v=cv+dv |
| S3 | c(dv)=(cd)v |
| S4 | 1v=v |
Common Examples
Rn - n-dimensional Real Space
The set of all n-tuples of real numbers:
Rn={(x1,x2,…,xn):xi∈R}
Polynomials Pn
The set of polynomials of degree ≤n:
Pn={a0+a1x+a2x2+⋯+anxn:ai∈R}
Matrices Mm×n
The set of m×n matrices with real entries.
Functions
The set of continuous functions on an interval.
Closure Properties
A vector space must be closed under:
Addition Closure
If u,v∈V, then u+v∈V
Scalar Multiplication Closure
If v∈V and c∈F, then cv∈V
Verifying a Vector Space
To verify V is a vector space:
- Check closure under addition
- Check closure under scalar multiplication
- Verify all 8 axioms hold
Example: Verification
Verify R2 is a vector space
Let u=(u1,u2), v=(v1,v2)∈R2, c,d∈R
- Closure (addition): u+v=(u1+v1,u2+v2)∈R2 ✓
- Closure (scalar): cu=(cu1,cu2)∈R2 ✓
- Identity: 0=(0,0) satisfies u+0=u ✓
- Inverse: −u=(−u1,−u2) satisfies u+(−u)=0 ✓
- All axioms hold by properties of real numbers ✓
Non-Examples
The following are NOT vector spaces:
- Positive real numbers under usual addition (no additive inverse)
- Polynomials of exactly degree n (not closed under addition)
- The set {0,1} under usual addition (1+1=2∈/{0,1})
Properties of Vector Spaces
For any vector space V:
- 0v=0 for any v∈V
- c0=0 for any scalar c
- (−1)v=−v
- If cv=0, then c=0 or v=0