Concepts and definitions Flashcards
Learn all definitions and properities of concepts in Linear Algebra
f: x –> y is invertible if and only if
- for every y in Y there exists a unique x in X such that f(x) = y (this is bijection)
Subspace
- Contains the zero vector
- closure under scalar multiplication
- closure under addition
Definition of invertible
for f: R^n to R^m the function g: R^m to r^n is the inverse of f if
1. f * g(x) = x
2. g * f(x) = x
How to check invertible?
ad-bc != 0
how to calculate invertible
1/ad-bc * [d -b] [-c a]
Transpose properties
- (AT)*T = A
- (A+B)T = AT+BT
- (rA)T = r* AT
- A(BT) = BT* AT
Surjective (onto)
for every y in Y there exists at least one x in X such that f(x) = y or the image
Injective (one to one)
for any y in Y there exists at most one x in X such that f(x) = y
Bijection
for every y in Y there exists a unique x in X such that f(x) = y
Span
set of all possible linear combinations of the vectors
Basis of subspace
the minimum set of vectors that spans the subspace
1. spans R^n
2. linearly independent
nullspace of A
set of vectors x in R^n (column vectors) such that A * set equals the zero vector
column space of A
- set of all linear combinations of column vectors in A
- subspace of R^m (dependent on pivot columns, less than or equal to codomain)
- pivot columns of A form basis
dimension
of column vectors in any basis of H
rank
dimension of column space of A or number of pivot columns
Rank nullity theorem
if A^t has n columns, that rank(A) + dim(nul(A)) = n
Determinants
quantity determined by ad-bc, defined for matrices nxn, measure of distortion
Properties of Determinants
- det(A*B) equals det(A) * det(B)
- in A, row is scaled by k, det(B) = k* det(A)
- in A, two rows are swapped, det(B) = -det(A)
- in A, row is replaced by combination of another row, det(B) = det(A)
Area or volume of a parallelogram
find determinant
eigenvector v
if for some scalar lambda exists such that Av = lambdav
eigenvalue
exists if and only if:
1. some vector x exists such that Ax = lambdax
2. Av - lambdav = zero vector
3. Ax - (lambdaI)*x = zero vector
Eigenspace
Since we find the nullspace associated with the matrix (A-lambda*I) then we have found a subspace of A associated to lambda
length of a vector
sqrt(v1^2+ …. + vn^2)
distance from u to v
sqrt( (u1 - v1)^2 + ……. + (un - vn)^2)
dot product of u and v (vectors)
u^T * v
orthogonal (perpendicular)
when two vectors multiplied by dot product = 0
vector projection
proj of y onto u = (y*u)/length of u
Gram-Schmidt theorem (orthogonal basis)
a basis: span(v1 to vn) for subspace V such that i !=j, vi * vj = 0
triangular matrix
elements above or below diagonal are zero
diagonal matrix
elements above and below diagonal are zero
Image(f)
subset you do map to (surjective)
consistent or non-consistent
if RREF(A) has either 1 or many solutions, can be reduced down to a triangular form
finding an eigenvalue
det(A-lambda*I) = 0
checking an eigenvector
Av = lambdav, set vector with matrix and solve, if scalar multiple then yes
finding eigenvectors
(A-lambaI)x = 0, set adjust matrix to 0 and solve, find free variable vectors
finding a basis
(A-lambaI)x = 0, same thing as finding eigenvectors