Linear Algebra
Chapter 3/Vector Spaces

3.1Definition and Examples

Chapter 3 stops asking 'what is the answer' and starts asking 'what kind of object is the answer set'. A vector space is any set where you can add and scale sensibly — which lets one theorem cover , matrices, polynomials, and functions simultaneously.

What you must be able to do

  • A vector space needs closure under addition and scalar multiplication, plus the eight axioms.
  • The fastest disqualifier: if isn't in the set, it isn't a vector space.
  • Standard examples: , , , (degree less than ).
  • implies or — proved from the axioms, not assumed.
Definition · Vector space
A set with operations and scalar multiplication is a vector space if it is closed under both (C1: ; C2: ) and the following hold for all and scalars :
  1. 1
  2. 2
  3. 3There is with
  4. 4For each there is with
  5. 5
  6. 6
  7. 7
  8. 8
Shortcut
You will almost never verify all eight on an exam. The questions that matter ask you to disprove membership — and that always comes down to closure or the presence of . Look for a concrete counterexample first.

The examples you must recognise

SpaceElementsDimensionZero vector
Column -tuples
matricesThe zero matrix
Continuous functions on infiniteThe function
Polynomials of degree The zero polynomial
Note the convention: has dimension , with basis . Polynomials of degree exactly do not form a vector space.

Some consequences that follow from the axioms alone: ; forces ; and . Also, if then either or — a fact used constantly in independence arguments.

Worked example

A set that fails to be a vector space

0/3 steps
Is (the first quadrant) a vector space under the usual operations?

Check yourself

T / F
Every vector space contains a zero vector.
Q2
Which of these is not a vector space under the usual operations?