Vectors in Rn are objects on which we define operations of addition (to each other) and multiplication by a scalar.
Other “objects” on which we can define the same operations:
Matrices: [adbecf]
Denoted as Mm×n with an order of m rows by n columns
Addition between 2 matrices works by adding corresponding entries into the resulting matrix. You can only add matrices of the same order
[adbecf]+[gjhkil]=[a+gd+jb+he+kc+if+l]
Multiplication works by multiplying each term by the scalar
n⋅[adbecf]=[a⋅nd⋅nb⋅ne⋅nc⋅nf⋅n]
Polynomials: anxn+an−1xn−1+an−2xn−2+⋯+a1x+a2 (“formal sum” of powers of variable x, each with a coefficient)
Degree of polynomial is the highest power of x
Addition and scalar multiplication works as expected
Functions:
Let f(x)=sinx and let g(x)=4ex.
Addition (f+g)(x)=sinx+4ex
Multiplication (c⋅f)(x)=c⋅f(x)=c⋅sinx
All of these are examples of abstract vector spaces.
Definition of Vector Space
A set V is called a vector space (and its elements are called vectors) if we can define on V operations of addition (⊕) and scalar multiplication (⊙) satisfying the following ten axioms:
Vector Space Axioms
10 All Important Axioms of Vector Spaces
Addition ⊕ is commutative
i.e. for u,v∈V:u⊕v=v⊕u
Addition ⊕ is associative
i.e. for u,v,w∈V:(u⊕v)⊕w=u⊕(v⊕w)
V is closed under addition
If u,v∈V then u⊕v∈V
There exists in V a zero vector denoted 0 such that ∀v∈V:v+0=v
∀v∈V∃v′ such that v⊕v′=0
e.g. in R2, if v=(5,−3) then v′=(−5,3)
V is closed under scalar mult.
i.e., if v∈V,c∈R then c⊙v∈V
For all v∈V and c1,c2∈R we have: (c1⋅c2)⊙v=c1⊙(c2⊙v)
∀v∈V:1⊙v=v
Distributive Law 1:
For any v,u∈V,c∈R:c⊙(v⊕u)=(c⊙v)⊕(c⊙u)
Distributive Law 2:
For any v∈V,c1,c2∈R:(c1+c2)⊙v=(c1⊙v)⊕(c2⊙v)
Common Vector Spaces:
Rn
Mm×n(R) = all matrices of order m×n(m,n∈N) with entries in R
Rn[x] = set of all polynomials in variable x with real coefficients and of degree ≤n.
Note: Not degree = n, because that wouldn’t be a vector space
But why are we doing this?
We can prove properties and define concepts just based on the axioms, and these properties/concepts will automatically apply ot all the examples of vector spaces.
Definition: Let V be a vector space. A subset U⊆V is a subspace of V (denoted U≤V) if U is itself a vector space under same operations ⊕,⊙ as defined in V.
Examples of subspaces of R2: U1=x-axis U2=y-axis U3=xy line
“Trivial” subspaces of R2:
(0,0)
All of R2
What axioms need to be checked to determine if U⊆V is a subspace?
U=∅
U is closed under ⊕
U is closed under ⊙
What are subspaces of R2?
{(0,0)}
All of R2
Any line through the origin (y=kx or y-axis)
Closure under addition:
(x1,kx1)+(x2,kx2)=(x1+x2,kx1+kx2)=(x1+x2,k(x1+x2))∈ line y=kx
(0,y1)+(0,y2)=(0,y1+y2)∈y-axis
Closure under scalar multiplication:
c⋅(x,kx)(cx,ckx)(cx,k(cx))==∈ line y=xk
c⋅(0,y)=(0,cy)∈y-axis
What are subspaces of R3?
{(0,0,0)}
Any line through origin
Any plane going through origin
All of R3
April 30 Lecture. Links to the board and the recording. [Incomplete] Coming soon to a PDF near you…
Checking if a subset is a subspace
U⊆V is a subspace of V (U≤V)iff
U=∅
U is closed under addition
U is closed under scalar multiplication See the board for examples, I can’t be bothered to type them all out.
Intersection and Union of Subspaces
Suppose U1,U2≤V. U1∩U2≤V is always true U1∪U2≤V is true ONLY if U1⊆U2 or U2⊆U1.
Definition:
Given a finite set S={v1,…,vk} in any vector space V, a linear combination of S is any vector of form u=c1v1+⋯+ckvk.
Span
Definition:
The span of a finite set of vectors S={v1,…,vk} is the set of all linear combinations of S.
For any finite set S⊆V,Span S≤V.
In fact, Span S is the smallest subspace of V containing every vector of S.
Definition:
A (finite, non-empty) set S⊆V is linearly independent if no vector in S is a Linear Combination of other vectors in S. Elaborated Definition:
A (finite, non-empty) set S⊆V is linearly independent if the following is true:
If c1v1+⋯+ckvk=0 then c1=⋯=ck=0. Example: S={(1,2,3,),(0,−1,4)}
Suppose: c1⋅(1,2,3)+c2⋅(0,−1,4)=(0,0,0)
That means that:
c1⋅1c1⋅2c1⋅3+c2⋅0+c2⋅−1+c2⋅4=0=0=0
Solving for c1,c2,c3, we will see that they all equal zero.
This is proof of linear independence. Example: S={(1,2,3),(−4,−8,−12)}
Suppose: c1⋅(1,2,3)+c2⋅(−4,−8,−12)=(0,0,0)
Extracting equations for c_1, c_2, c_3 will yield the following: 23c1−4c2c1−8c2c1−12c2=0=0=0
The second and third equations are both multiples of the first equation, so we can ignore them. we are left with c1=4c2, which has an infinite number of solutions. This means that S is linearly dependent.
In other words, S is linearly independent if the only linear combination of S equal to 0 is the trivial linear combination (i.e., all scalars are 0).
By this definition, S=0 is not independent, because if c⋅(0,0,0)=(0,0,0), then c need not be 0, can be any scalar.
Any other set of one vector is independent.
How to check if a set of vectors is Linearly Independent
Method to tell if S⊆Rn is independent:
Write vectors of S as columns in a matrix A
Consider A as a coefficient matrix of a homogeneous system, and solve
If the solution is unique, S is independent. If there are infinitely many solutions, S is dependent. If there are zero solutions, you messed something up.
Example with Rn: S1={(1,3,5),(2,4,6),(−1,1,3)}
To check if S1 is independent:
Suppose c1135+c2246+c3−113=000 (We wish to show: c1=c2=c3=0)
Extract equations for c1,c2,c3: 35c1+2c2−c3c1−4c2+c3c1+6c2+3c3=0=0=0
Solve system using coefficient matrix: 135246−113
There are two possibilities for a homogeneous system:
There is a unique solution (0,0,0), which means c1=c2=c3=0, which proves S to be independent.
There are infinitely many solutions, which means c1=c2=c3=0 is not true, which proves S to be dependent.
Solving the matrix as such…
135246−11310021−4−1−28⇒⇒R2→R2−3R1R3→R3−5R11002−2−4−148R2→−21R2R3→R3+4R2100210−1−20Infinite number of solutionsS is linearly dependent
Basis and Dimension
Definition:
A basis of a vector space V is a linearly independent set S which spansV. (i.e. Span(S)=V) Examples:
In R2,S1={(1,0),(0,1)}
This set is independent (easy to check)
This set spans R2:∀(a,b)∈R2:(a,b)=a(1,0)+b(0,1)
Therefore, S1 is a basis of R2
In R2,S1={(1,1),(−3,5)}
Independent? Neither is a multiple of the other, so yes.
Spanning? ∀(a,b)∈R2∃?c1,c2∈R∣(a,b)=c1(1,1)+c2(−3,5))
Yes (We’ll come back to this later.)
Therefore, S2 is a basis of R2
In R2,S3={(1,0),(0,1),(2,3)}→ spans, but isn’t independent
In R2,S4={(1,3)}→ independent, but doesn’t span
In R2,S5={(1,−1),(−3,3)}→ doesn’t span and isn’t independent Claims: Proofs omitted. See pp. 12, 13
If B={v1,…vn} is a basis of V, then any v∈V has a unique representation as a linear combination of B
If S⊆Rn,S={v1,…vn} (i.e., S is a set of n vectors in Rn) then S spans Rn iff S is independent.
Hence: it is enough to check one condition (independent or spanning) to determine if S is a basis