LeoMath

Foundations of linear algebra · Section 1 of 5

Vectors

Axioms of a vector space; bases and coordinates.

about 7 min

Start from a problem

Problem

Arrows in the plane, polynomials, matrices, continuous functions: their addition and scaling obey exactly the same rules. Proving the "same" theorem separately for each kind of object is wasted work.

We need a definition that depends only on the rules of the operations, not on what the objects "are". Then one proof holds everywhere.

Observe

Arrows in the plane can be added (tip to tail) and stretched (scalar multiplication). So can polynomials. So can 2×2 matrices, continuous functions, sequences…

These objects look completely different, yet the rules obeyed by their addition and scaling are identical: addition commutes and associates, scaling distributes, there is a zero, there are negatives.

Conjecture

If a theorem uses only these rules, then whenever it holds for arrows it holds for polynomials, matrices and functions too. So it pays to isolate those rules, name every object satisfying them, and study only the name.

Definition

Definition 1.1Vector space

Let V be a set with an addition u+v and a real scalar multiplication cv such that for all u,v,w∈V and a,b∈ℝ:

  1. u+v=v+u;
  2. (u+v)+w=u+(v+w);
  3. there is 0∈V with v+0=v;
  4. each v has −v with v+(−v)=0;
  5. a(u+v)=au+av;
  6. (a+b)v=av+bv;
  7. (ab)v=a(bv);
  8. 1v=v.

Then V is a (real) vector space and its elements are vectors.

ℝ2, ℝn, polynomials of degree at most n, all m×n matrices, continuous functions on [0,1]: all vector spaces. The exercises contain a non-example: polynomials of degree exactly 2 are not, since x2+(−x2+x) has degree 1 and leaves the set.

Definition 1.2Linear combination, span, independence

A linear combination of v1,…,vk is c1v1+⋯+ckvk. The set of all of them is span⁡(v1,…,vk). If c1v1+⋯+ckvk=0 only for c1=⋯=ck=0, the vectors are linearly independent.

Independence means no vector is redundant: none can be built from the others.

Definition 1.3Basis and dimension

If v1,…,vn are independent and span⁡(v1,…,vn)=V, they form a basis of V. The number of vectors in a basis is the dimension dim⁡V.

For dimension to make sense we must prove that any two bases have the same size.

Theorems and proofs

Theorem 1.1Uniqueness of coordinates

If v1,…,vn is a basis of V, every v∈V can be written uniquely as v=c1v1+⋯+cnvn. The tuple (c1,…,cn) is the coordinate vector of v in this basis.

Proof

Existence is spanning. For uniqueness, if v=∑civi=∑divi then ∑(ci−di)vi=0, so ci=di by independence.

This theorem is the entire justification for the word "coordinates". Once a basis is fixed, every vector in any vector space corresponds to one list of numbers, a point of ℝn.

See it in the plane. Drag b1,b2: the light blue skewed grid is their whole-number combinations, and the coordinates (c1,c2) of v say "go c1 steps along b1, then c2 steps along b2". Change the basis: does v move, do its coordinates change? When b1,b2 are collinear, do coordinates still exist, and are they unique?

Interactive experimentBases and coordinates
  • b₁
  • b₂
  • vector v
  • coordinate grid of b₁, b₂
v=c1b1+c2b2standard coordinates (1, 2)coordinates in b₁, b₂ 1, 2area of the parallelogram on b₁, b₂ 1
Arrow keys move

What did you observe?Play first, then answer. Read the explanation only after you have thought it through.

  1. 1.Press “Skewed basis”. v has not moved; its coordinates were (1, 2). What are they now? Which depends on the basis, the vector or its coordinates?
  2. 2.Press “Nearly collinear” and move v one small step with the arrow keys. Do the coordinates change more or less than v moved? Why?
  3. 3.Press “Collinear”. Can v still be written as c₁b₁ + c₂b₂? What happens if you drag v onto that line?
Theorem 1.2Dimension is well defined

Any two finite bases of a vector space have the same number of elements.

Proof

It suffices to show: if u1,…,um are independent and v1,…,vn span V, then m≤n (swap the roles to get equality).

Exchange argument. u1∈span⁡(v1,…,vn); write u1=∑aivi. Since u1≠0 some ai≠0, say a1. Then v1 is a combination of u1,v2,…,vn, so these still span V. Now expand u2 in this new spanning set; some vj (j≥2) must have nonzero coefficient, otherwise u2∈span⁡(u1), contradicting independence. Replace that vj by u2. Continue. Each step trades one v for one u, and the v's cannot run out before the u's do (or some uk would lie in the span of earlier u's). Hence m≤n.

Common mistake

Linear independence is not "no two are collinear". (1,0,1),(0,1,1),(1,1,2) are pairwise non-collinear yet dependent, since the third is the sum of the first two. The definition is about the whole family having only the trivial zero combination; it must be checked all at once. For just two vectors, dependence is exactly collinearity (the experiment's "Collinear"); from three on, checking pairs is not enough.

Application

ApplicationWhy pictures in ℝ² speak for every 2-dimensional space

Any two-dimensional vector space, once a basis is chosen, corresponds one-to-one with ℝ2, with addition and scaling preserved. So every picture drawn in the plane in Linear maps is true for every two-dimensional space, whether its vectors are arrows, linear polynomials, or solutions of a second-order linear differential equation.

Remark

A vector is not "a quantity with magnitude and direction"; that is one concrete picture valid in ℝ2,ℝ3. A vector is an element of a vector space, and a vector space is defined by eight axioms. Defining things by the rules their operations obey, rather than by what they "are", is the basic move of all of algebra.

Exercises

0 of 2 done

1
What is the dimension of the subspace of ℝ3 spanned by (1,0,1),(0,1,1),(1,1,2)?

Enter the exact value; a fraction such as 1/3 is fine.

2
Under the usual operations, which of these is not a vector space?
Answer to exercise 2

Discussion

Found a mistake, have a question or a suggestion? You can also write to 620026600@qq.com

No comments yet. Share your understanding, ask a question, or point out an error on this page.

Log in to join the discussion