Chapter 4 Flashcards
How is a vector space defined?
A ( real ) vector space is a nonemty set V together with two operations, addition and scalar multiplication, that satisfy the following list of axioms.
For all vectors, u, v, w are in V and scalars c and d are real numbers:
1) ( u + v ) is in V (closed under addition)
2) u + v = v + u
3) ( u + v ) + w = u + ( v + w )
4) There is a zero vector in V such that
0 + u = u
5) for each u in V, there is a -u in V such that u + (-u) = 0
6) cu is in V (closed under scalar multiplication)
7) c(u + v) = cu + cv
8) (c + d)u = cu + du
9) (cd)u = c(du)
10) 1*u = u
What are the properties of a vector space?
Let V be a vector space. Then the following hold: i) The zero vector 0 is unique ii) For each vector u in V, -u is unique iii) For each vector u in V, (0 vector) *u = 0 vector iv)For each scalar c is a real number, c*( 0 vector ) = ( 0 vector ) v) For each vector u in V, -u = -1(u)
How is a subspace defined?
A subset H of the vector space B is called a subspace of V if
a) the zero vector is in H
b) for any vectors u, v in H, u+v is also in H
c) for each vector u in H and each scalar c is a real number, c*u is in H
Interesting properties of a subspace
Any subset H of a vector space V that satisfies the properties of a subspace is itself a vector space using the same operations as V
What are subspaces of any vector space V?
The following are subspaces of any vector space V:
1) { zero vector}
2) V itself
3) Span{ v1, v2, … vn}, where v1, … , vn are vectors in V
What are the special subspaces of a vector space V when V is related to a matrix A?
Let A be an m x n matrix. The null space of A, denoted Nul A, is the set of solutions to Ax = 0. The column space of A, denoted Col A, is the set of all linear combinations of the columns of A.
In other words:
Nul A = { x is an element of R^n such that
Ax = 0}
Col A = Span{a1, a2, … , an} where ai is the ith column of A
Col A = { b is an element of R^m such that
b = Ax is consistent}
How are linear transformations defined in terms of vector spaces?
Let V, W be (real) vector spaces. A linear transformation from V to W is a function (transformation) T: V -> W such that
i) T(u + v) = T(u) + T(v) for all u, v in V
ii) T(cu) = cT(u) for all u in V and all c is a real number
What is the alternate terminology for Nul A and Col A when thinking in terms of linear transformation?
Let T(x) = Ax, where A is an m x n matrix, and T transforms from vector space V to vector space W
Nul A = subset of the domain that maps to the zero vector (pre-image of 0)
Nul A = kernel of T
Nul A is a subspace of V
Col A = subset of codomain that is mapped onto
Col A = range of T
Col A is a subspace of W
How is a basis defined?
Let H be a subspace of the vector space V. The set {b1, … , bp} in H is a basis for Hif
i) {b1, … , bp} is linearly independent
ii) H = Span{b1, … , bp}
What is the spanning set theorem?
Let H be a subspace of V, where H = Span{v1, … , vp}
a) If some vk is a linear combination of the others, then the set formed by removing vk from {v1, … , vp} still spans H
b) If H does not equal {zero vector}, some subset of {v1, … , vp} is a basis for H
Theorem 4.6
The pivot columns of a matrix A form a basis for Col A
Theorem 4.7 - The unique representation theorem
Let B = {b1, … , bn} be a basis for a vector space V. Then for each vector x in V, there exists a unique set of scalars c1, c2, … , cn such that:
x = c1b1 + … + cnbn
How is coordinate mapping defined?
Suppose B = {b1, b2, b3, … , bn} is a basis for V and a vector x is in V. The coordinates of x relative to the basis B ( or the B-coordinates of x) are the weights c1, c2, … , cn such that x = c1b1 + … + cnbn
If c1, c2, … , cn are the B-coordinates of x, then the vector in R^n:
[x]_B = [c1; c2; … cn]
is the coordinate vector of x (relative to B), or the B-coordinate vector of x. The mapping x -> [x]_B is the coordinate mapping (determined by B)
Theorem 4.8
Let B = {b1, … , bn} be a basis for a vector space V. Then the coordinate mapping from x to [x]_B is a one-to-one linear transformation from V onto R^n.
Theorem 4.9
Let V be a vector space with basis B = {b1, … , bn}. Then any set in V with more than n elements must be linearly dependent.