You learn vector operations in Rⁿ, linear combinations, length and the dot product, then the ten axioms of a vector space and how to check whether a set (with standard or nonstandard operations) is a vector space.
So far we have worked with matrices as tables of numbers. This week we move to geometry and abstraction. First vectors in Rn: the n-dimensional version of the plane and space vectors you know. Then the big idea: the vector space. Any collection of objects that can be added and multiplied by numbers and that obeys certain rules (matrices, polynomials, functions) behaves like Rn. Everything in the second half of the semester (subspace, basis, dimension, linear transformation) is built on this definition.
Golden rules:
In Rn every operation is done component by component.
The question “is it a linear combination?” is really a question about a system: do Gaussian elimination.
To show something is not a vector space, one concrete example where a single axiom fails is enough.
With nonstandard operations, compute the zero vector; don’t assume it is (0,0).
Vectors in Rⁿ
Rn is the set of ordered lists of n real numbers: v=(v1,v2,…,vn). They can be written as rows or columns; in this course, when used with systems, columns are preferred.
The zero vector is 0=(0,…,0), and the additive inverse of u is −u=(−u1,…,−un).
Linear combinations
If w can be written as w=c1v1+c2v2+⋯+ckvk, it is a linear combination of the vi. To find it, treat the coefficients as unknowns and solve the system. The vectors become columns:
Example. Is (4,1,5) a combination of (1,0,1) and (1,1,2)?
b=1, a=3. Yes: (4,1,5)=3(1,0,1)+1(1,1,2). If we had asked the same question for (4,1,7), the last row would have been [00∣2]: not a combination.
Length and dot product
You will need these concepts in week 14 (orthogonal diagonalization), so meet them now:
Concept
Formula
Example u=(1,−2,3,0), v=(2,1,−1,4)
Dot product
u⋅v=∑uivi
2−2−3+0=−3
Norm (length)
∥u∥=u⋅u
1+4+9=14
Unit vector
u/∥u∥
141(1,−2,3,0)
Angle
cosθ=∥u∥∥v∥u⋅v
Orthogonal
u⋅v=0
Definition of a vector space
Let V be a nonempty set with an addition and a scalar multiplication defined on it. If the following ten axioms hold for all u,v,w∈V and all c,d∈R, then V is a vector space:
#
Axiom
Name
1
u+v∈V
closure under addition
2
u+v=v+u
commutativity
3
u+(v+w)=(u+v)+w
associativity
4
there is a 0∈V with u+0=u
zero vector
5
for every u there is −u∈V with u+(−u)=0
inverse
6
cu∈V
closure under scalar multiplication
7
c(u+v)=cu+cv
distributivity
8
(c+d)u=cu+du
distributivity
9
c(du)=(cd)u
associativity
10
1u=u
identity
The word “vector” no longer means an arrow: every element of V is a vector, and it can be a matrix or a polynomial.
Standard examples
Space
Elements
Zero vector
Rn
n-tuples
(0,…,0)
Mm,n
m×n matrices
zero matrix
Pn
polynomials of degree at mostn
zero polynomial
P
all polynomials
zero polynomial
C(−∞,∞)
all continuous functions
f(x)=0
In all of them the operations are the usual addition and multiplication by numbers. The axioms follow from the rules of the real numbers.
Sets that are not vector spaces
Usually closure (1 or 6) or the zero vector (4) fails:
Polynomials of degree exactly 2.x2+(−x2+x)=x, of degree 1. Not closed under addition.
Vectors in R2 whose first coordinate is nonnegative{(x,y):x≥0}. (−1)(1,0)=(−1,0) is not in the set.
Vectors with integer coordinates.21(1,0) is not in the set.
{(x,y):y=x+1}.(0,0) is not in the set, so there is no zero vector.
Nonstandard operations
On the exam, a familiar set is sometimes given strange operations. Strategy:
Check closure.
Find the zero vector by setting up an equation: u⊕z=u.
Find the inverse: u⊕u′=z.
Try the scalar axioms (7-10) with concrete numbers. If one fails, stop.
Example.R2, standard addition, but c⊙(x,y)=(cx,0). Axiom 10: 1⊙(1,1)=(1,0)=(1,1). Not a vector space. That the other nine axioms hold changes nothing.
PITFALL · assuming the zero vector is (0, 0). With the operation (x1,y1)⊕(x2,y2)=(x1+x2+1,y1+y2+1), (3,5)⊕(0,0)=(4,6)=(3,5). The zero vector is (−1,−1) (Q8). Compute before saying “there is no zero vector”.
Properties that follow from the axioms
In every vector space, whatever the operations are:
0v=0,c0=0,(−1)v=−v,cv=0⇒c=0 or v=0.
Also the zero vector is unique and the inverse of every vector is unique. These are proved from the axioms in a few lines (Q11).
Before the midterm: weeks 1-6 in one table
Topic
One sentence
Week
Gauss / Gauss-Jordan
reduce [A∣b] to REF / RREF; [0⋯0∣c=0] = no solution
1
Parameter k
last row f(k)z=g(k); examine the roots of f=0 separately
1
Matrix product
(m×n)(n×p); AB=BA; (AB)T=BTAT
2
Inverse
[A∣I]→[I∣A−1]; AX=B⇒X=A−1B
3
Determinant
make it triangular with additions; swap ×(−1), scaling ×c
4
Properties
det(cA)=cndetA, det(AB)=detAdetB
5
Adjoint, Cramer
adjA=[Cij]T; xi=detAi/detA
5
Vector space
10 axioms; if not, a single counterexample
6
Subspace (next week)
is 0 in it, is it closed under addition and scalars
7
Common mistakes
Wrong
Right
Looking for a linear combination by trial and error
Set up a system for the coefficients, do Gauss
Writing the vectors as rows of the augmented matrix
Vectors become columns
Taking the zero vector to be (0,0) with nonstandard operations
Solve the equation u⊕z=u
Saying “vector space” because one axiom holds
All ten axioms are needed
Trying to write a general argument for “it is not”
One numerical counterexample is enough
Thinking P2 is “degree exactly 2”
Degree at most 2
Thinking ∥v∥ is the sum of the components
Square root of the sum of squares
Test yourself
Exam-style questions. Solve them on paper first, then reveal the answer.
Is (1,2,4) a linear combination of (1,0,1) and (0,1,1)?
Show answer
No
a(1,0,1)+b(0,1,1)=(a,b,a+b). The first two components give a=1, b=2, but then the third component is 3=4. With the augmented matrix: a row [00∣1] appears, the system is inconsistent.
Question 5medium
Find ∥v∥ and the unit vector in the direction of v=(2,−1,2).
Show answer
∥v∥=3, (32,−31,32)
∥v∥=4+1+4=9=3. The unit vector is ∥v∥v=31(2,−1,2). Check: 94+1+4=1.
Question 6medium
Find the angle between u=(1,1,0) and v=(1,0,1).
Show answer
60∘ (π/3)
u⋅v=1+0+0=1, ∥u∥=∥v∥=2.cosθ=221=21, θ=60∘.
Question 7medium
Is R2 with standard addition and the scalar multiplication c⊙(x,y)=(cx,0) a vector space? If not, name an axiom that fails.
Show answer
No: 1⊙u=u fails
1⊙(1,1)=(1,0)=(1,1). The axiom "1u=u" fails. The axioms about addition hold (standard addition); the failure of a single axiom is enough.
Question 8hard
On R2 define (x1,y1)⊕(x2,y2)=(x1+x2+1,y1+y2+1). What is the zero vector for ⊕, and what is the additive inverse of (x,y)?
Show answer
Zero vector (−1,−1); inverse (−x−2,−y−2)
Zero vector z=(a,b): (x+a+1,y+b+1)=(x,y) for every (x,y). a=b=−1. Inverse (p,q): (x+p+1,y+q+1)=(−1,−1), so p=−x−2, q=−y−2. Trap: the zero vector here is not (0,0). Check: (3,5)⊕(−1,−1)=(3,5).
Question 9medium
Is the set of all polynomials of degree exactly 2 (with standard operations) a vector space?
Show answer
No
It is not closed under addition: x2 and −x2+1 have degree 2, but their sum is 1, of degree 0. Also the zero polynomial is not in the set. In contrast, polynomials of degree at most 2 (P2) form a vector space.
Question 10hard
Let V be the set of positive real numbers with x⊕y=xy and c⊙x=xc. Is V a vector space? If so, give its zero vector and the inverse of x.
Show answer
Yes; zero vector 1, inverse 1/x
Closure: the product of positive numbers and xc are positive. The zero vector is 1: x⊕1=x. The inverse is 1/x: x⊕x1=1. The scalar axioms are the exponent rules: c⊙(x⊕y)=(xy)c=xcyc, (c+d)⊙x=xc+d=xcxd, 1⊙x=x. All ten axioms hold.
Question 11easy
True or false: In every vector space, 0v=0 for every vector v.
Show answer
True
0v=(0+0)v=0v+0v. Add the inverse of 0v to both sides: 0=0v. This is a theorem that follows from the axioms; it holds in every vector space.
Question 12medium
Find scalars a,b,c with a(1,0,1)+b(1,1,0)+c(0,1,1)=(2,3,5).
Verification: Vector operations, dot products and squared norms were computed exactly in node with BigInt fractions; the linear combination questions were solved with the exact RREF; in the nonstandard-operation questions the zero vector, the inverse vector and the axioms were tested numerically at sample points (verify/MAT1041/06.mjs).
Review card
Rⁿ: ordered n-tuples (x1,...,xn). Addition and cu componentwise.
Linear combination: w = c1v1 + ... + ckvk. Does it exist? → solve the system [v1 ... vk | w].
Norm: ||v|| = √(v·v). Unit vector: v/||v||.
Dot product: u·v = u1v1 + ... + unvn. cos θ = u·v / (||u|| ||v||). u·v = 0 → orthogonal.
VECTOR SPACE: addition and scalar multiplication + 10 axioms.
Closure: u+v ∈ V, cu ∈ V.
Addition: commutative, associative, a zero vector exists, every u has an inverse.
Scalar: c(u+v)=cu+cv, (c+d)u=cu+du, c(du)=(cd)u, 1u=u.
Examples: Rⁿ, M_{m,n}, P_n (degree ≤ n), C(-∞,∞).
Not: polynomials of degree EXACTLY n, vectors with positive coordinates (with standard operations).
Nonstandard operations: COMPUTE the zero vector, it may not be (0,0).
Theorems: 0v = 0, c0 = 0, (-1)v = -v.
To say "not a vector space" ONE concrete counterexample is enough.