Definitions
R
n
unit vector
line in R
n (parametric form)
hyperplane in R
n (cartesian or normal form)
linear combination of vectors
dot product of vectors
orthogonal (or perpendicular) vectors
angle between (non-zero) vectors
elementary row operations
echelon and reduced echelon matrices, pivot
rank of a matrix
singular, non-singular matrices
elementary matrices
inverses and one-sided inverses of matrices
transpose
symmetric matrix
Basic Computations
operations on scalars, vectors and matrices
matrix reduction
solving systems of linear equations
translating problems involving lines, planes, curve fitting, linear
combinations and matrix equations to systems of linear equations
passing between cartesian and parametric representatios of lines and plance
projections and angles between vectors
computing inverses of matrices
Conceptual understanding
existence and uniquenes of solutions to Ax=b
good and bad features of vector and matrix operations, especially multiplication
matrices of projections, reflections and rotations in R
2
Study Guide and Worksheet for Test 2
The basic concepts of this chapter are:
linear combination, subspace, span (noun and verb), linear dependence,
basis, dimension, orthogonal complement, row space, column space, null
space, rank, vector space.
Fill in the blanks.
a) Let A be an m x n matrix of rank r. The columns of A are independent if _____. The cols of A span R
n if _____. The cols of A are a basis for R
m if _____.
b) A linearly independent set in R
4 cannot have more than _____ vectors.
c) Two distinct vectors in R
4 which cannot together be part of a basis for R
4 are __________.
True or False ?
a) The vector (2,3,0,1) can be expressed as a linear combination of (1,0,0,0) and (0,1,0,1).
b) The solution set of 2x+y-z=0 is a subspace of R
3.
c) The solution set of 2x+y-z=5 is a subspace of R
3.
d) If v
1, v
2, v
3 are dependent vectors, then there are c
1,c
2,c
3 in R so that c
1v
1+c
2v
2+c
3v
3=0 and |c
1|+|c
2|+c
3|>0.
e) Any three vectors in R
7 are independent.
f) A set which spans R
3 can contain 5 vectors.
g) The set S:={(x,y,z) | x+y=z } is a subspace of R
3.
h) The set S:={(x,y,z) | x
2+y
2=z
2 } is a subspace of R
3.
i) The set S:={(x,y,z) | x
2+y
2+z
2 = 0 } is a subspace of R
3.
j) There is a set of 5 vectors in R
7 which is independent.
k) Any set of 4 vectors in R
4 which is independent forms a basis for R
4.
l) There is a 3-dimensional subspace of R
5.
List of Topics for Third Hour Test (typed by Ms. Stagg)
Section4.1
Projection onto a subspace V.
subspace V of Rⁿ
orthogonal complement V┴
V+V┴ = Rⁿ, V∩V┴ = {0}
relation to matrices: R(A) and N(A) are orthogonal complements of each other
ProjVb is closest member of V to b
methods for computing projections
as in Chapter 1 when V is one-dimensional
via bases for V, V┴
via normal equations
computing projection onto V┴ first
applications to data fitting
Section 4.2
orthogonal, orthonormal bases
their advantages in computing coordinates, projections
Gram-Schmidt Process
Section 4.3: Linear Transformations
definition
relation to matrices
examples of linear transformations in R²: projections, rotations, reflections
examples of linear transformation on spaces of functions.
standard matrix of a linear transformation from Rn to Rm
matrix of a linear transformation relative to a basis
kernels & images
Section 5.2 : Determinants
definition for 2x2 matrices
characterizing properties [effect of row operations]
definition for n x n matrices by above
Other properties
det (AB)=(det A)(det B)
det (AT)=det A
det A=0 ↔ A is singular
computation by row operations
shortcut for upper/lower triangular matrices
Section 5.3
Computation via expansion by cofactors
Sections 6.1, 6.2 & 6.3: Diagonalization
definition of eigenvalues, eigenvectors & eigenspaces
characteristic polynomial and finding eigenvalues
eigenvectors corresponding to distinct eigenvalues are independent
finding a basis for E(λ) = null[A-λI]
definition of diagonalizable matrix, linear transformation
criteria for diagonalizability
equations AP = PD ; A= PDPֿ¹
application to computing powers of A
application to word problems