Definition of Terms
Section 1.2
Euclidean n-space: A space of all n-tuples of real numbers. Usually denoted as Rn
Vector: A quantity that has both direction and magnitude, usually for space from one point
relative to another
Linear Combination: Given vectors v1 , v2 , v3 ..., vk and scalars r1 , r2 , r3 ..., rk , the linear
combination of the vectors with the scalar coefficient is
r1 v1 + r2 v2 + ... + rk vk
Span of Vectors: All the possible linear combinations of the single vector v in Rn is the
span of v.
Magnitude or Norm of a vector: Length of the vector, use Pathtagrous
Three properties for the Magnitude or Norm of a vector:
Positivity: ||V|| 0 and ||V|| = 0 iff V = 0
Homogeneity ||rV|| = |r|||V||
Triangle Inequality
The Dot Product(Inner Product) of Two Vectors: let V ~ = [v1 , v2 ...Vn ] and W
~ =
n ~ ~
[w1 , w2 ...wn ] in R Then the dot product is V W = v1 w1 + v2 w2 ...vn wn
Unit Vectors Vectors with magnitudes = 1
~ and W
To Find the angle between two vectors V ~ is denoted by
~W
V ~
= arccos
||V || ||W ||
Section 1.3
Matrix: an ordered rectangular array of numbers, usually enclosed in parentheses or square
brackets
1 2 3 4 5
M = 3 4 5 6 7
8 9 10 11 12
1
Matrix Multiplication: let A = [aik ] be and m n matrix, and let B = [bkj ] and let n s
matrix. The matrix product AB is the m s matrix C = [cij ], where cij is the dot product
of the ith row vector of A and the jth column vector of B.
a11 a1n c11 c1j cms
b11 b1j b1s
ai1
AB = ain
=
ci1 cij cis
bn1 b1j bns
am1 amn cm1 cmj cms
Identity Matrix: Let I be the n n matrix [aij such that aii = 1 for 1 i n and aij = 0
for i 6= j such that AI = A and IB = B if A is any m n matrix and B is any n s matrix.
Matrix Addition: For matrices of the same size, the sum matrix C = [Cij ] is equal to:
cij = aij + bij
Section 1.4
Consistent Linear System: A linear system having one or more solutions is called a
consistent system. If it has no solutions, then its called an inconsistent system.
Solutions of Ax = b Assuming [A|b] [H|c], where Ax = b is a linear system and H is in
row-echelon form.
1. A linear system Ax = b is inconsistent iff the argumented matrix [H|c] has an entire
row of 0 in the left partition and an non-zero entry on the right.
2. If the linear system is consistent and H has a pivot at every single column, the system
has a unique solution.
3. If the linear system is consistent and some column of H have no pivot, the system has
infinite many solutions.
Gauss Reduction with Back Substitution Method: refers to the method of solving
the system Ax = b by making it REF and back to the equations
Elementary Matrix: An elementary matrix is the result of performing exactly one elemen-
tary row operation to an identity matrix. Example:
1 0 0 1 0 0
I1 = 0 1 0 I2 = 0 1 0
0 0 1 0 1 1
2
I1 and I2 are elementary matrices.
Section 1.5
Inverse of a Matrix: Matrix C will be an inverse of A iff CA = AC = I. Denoted as
C = A11
Uniqueness of an Inverse: Let A be an n n matrix. If C and D are matrices such taht
AC = DA = I, then C = D. In particular, if AC = CA = I, then C is the unique matrix
with this property2 .
Singular Matrix: Matrices that cannot be inverted
Section 1.6
Linearly Independent A set of vectors W is linearly independent if and only if c1 v1 +
c2 v2 + c3 v3...cn vn = 0 when vn represents the vectors in W and c1 = c2 = ... = cn = 0
In other words, no vectors in the set can be represented by any other vectors.
To solve for linear dependency find all possible values for each element in the zero vector
in terms of c, and then assume that all the elements are zero and solve for c to check
whether they can only be solved when c = 0
Basis of a Subspace: The basis of a subspace W is a set of vectors where W contains the
minimum amount of vectors to:
Extend though all the dimension of the subspace
To ensure all the vectors in the subspace to be a linear combination of vectors in W
Nullspace of a Matrix: Let A be a m n matrix, the nullspace of A is denoted as: N (A);
The set of all vectors N where any vector in N , ~x, A~x = 0
N = {~x Rn |A~x = 0}
Nullity: The amount of vectors that is in the basis of the nullspace (the number of free
variables in the system).
Rank of a Matrix: the number of linearly independent column/row vectors. Taken form
the minimum of the numbers of row/column
1
We never write A1 as 1
A
2
Proof on page 45