Concepts and definitions Flashcards

Learn all definitions and properities of concepts in Linear Algebra

1
Q

f: x –> y is invertible if and only if

A
  1. for every y in Y there exists a unique x in X such that f(x) = y (this is bijection)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Subspace

A
  1. Contains the zero vector
  2. closure under scalar multiplication
  3. closure under addition
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Definition of invertible

A

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 well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How to check invertible?

A

ad-bc != 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

how to calculate invertible

A

1/ad-bc * [d -b] [-c a]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Transpose properties

A
  1. (AT)*T = A
  2. (A+B)T = AT+BT
  3. (rA)T = r* AT
  4. A(BT) = BT* AT
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Surjective (onto)

A

for every y in Y there exists at least one x in X such that f(x) = y or the image

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Injective (one to one)

A

for any y in Y there exists at most one x in X such that f(x) = y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Bijection

A

for every y in Y there exists a unique x in X such that f(x) = y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Span

A

set of all possible linear combinations of the vectors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Basis of subspace

A

the minimum set of vectors that spans the subspace
1. spans R^n
2. linearly independent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

nullspace of A

A

set of vectors x in R^n (column vectors) such that A * set equals the zero vector

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

column space of A

A
  1. set of all linear combinations of column vectors in A
  2. subspace of R^m (dependent on pivot columns, less than or equal to codomain)
  3. pivot columns of A form basis
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

dimension

A

of column vectors in any basis of H

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

rank

A

dimension of column space of A or number of pivot columns

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Rank nullity theorem

A

if A^t has n columns, that rank(A) + dim(nul(A)) = n

17
Q

Determinants

A

quantity determined by ad-bc, defined for matrices nxn, measure of distortion

18
Q

Properties of Determinants

A
  1. det(A*B) equals det(A) * det(B)
  2. in A, row is scaled by k, det(B) = k* det(A)
  3. in A, two rows are swapped, det(B) = -det(A)
  4. in A, row is replaced by combination of another row, det(B) = det(A)
19
Q

Area or volume of a parallelogram

A

find determinant

20
Q

eigenvector v

A

if for some scalar lambda exists such that Av = lambdav

21
Q

eigenvalue

A

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

22
Q

Eigenspace

A

Since we find the nullspace associated with the matrix (A-lambda*I) then we have found a subspace of A associated to lambda

23
Q

length of a vector

A

sqrt(v1^2+ …. + vn^2)

24
Q

distance from u to v

A

sqrt( (u1 - v1)^2 + ……. + (un - vn)^2)

25
dot product of u and v (vectors)
u^T * v
26
orthogonal (perpendicular)
when two vectors multiplied by dot product = 0
27
vector projection
proj of y onto u = (y*u)/length of u
28
Gram-Schmidt theorem (orthogonal basis)
a basis: span(v1 to vn) for subspace V such that i !=j, vi * vj = 0
29
triangular matrix
elements above or below diagonal are zero
30
diagonal matrix
elements above and below diagonal are zero
31
Image(f)
subset you do map to (surjective)
32
consistent or non-consistent
if RREF(A) has either 1 or many solutions, can be reduced down to a triangular form
33
finding an eigenvalue
det(A-lambda*I) = 0
34
checking an eigenvector
A*v = lambda*v, set vector with matrix and solve, if scalar multiple then yes
35
finding eigenvectors
(A-lamba*I)*x = 0, set adjust matrix to 0 and solve, find free variable vectors
36
finding a basis
(A-lamba*I)*x = 0, same thing as finding eigenvectors