MATH 204 ALL UNITS

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/52

encourage image

There's no tags or description

Looks like no tags are added yet.

53 Terms

1
New cards

pivots

the first non-zero entry in a row when a matrix is in row-echelon form (REF)

2
New cards

Any all-zero rows

have to be at the bottom

3
New cards

RREF rules (Reduced row echelon form)

  1. each 1st non zero entry is 1

  2. each pivot is the only non zero # in its column

  3. pivots move right as you go down the matrix

  4. Any all-zero rows have to be at the bottom


4
New cards

Row Echelon Form (REF) rules

rules 2, 3, and 4 of RREF

5
New cards

Rank of a matrix

# of non-all zero rows after RREF, written as rank(A) if matrix A

6
New cards

Coefficient matrix

( coefficients of variables in eqs)

7
New cards

Augmented matrix

( coefficients | constants )

8
New cards

constant and coefficient 2x=5

constant is 5, coeff is 2

9
New cards

Elementary row operations

  1. Swap rows (R1←>R2)

  2. Multiply a row by a constant (R2 → 3*R2)

  3. Add a multiple of one row to another row (R3 → R3+(-2)*R1)


10
New cards

Gaussian Elimination (RREF)

Goal: create leading 1s with zeroes above n below them (you can only use Elementary Row Operations)

11
New cards

Free variable

a variable whose column has no pivot after row reduction

12
New cards

whenever there is a free variable

there is infinite solutions to the system of eqs as long as there is no contradiction (ex: (000|3) is a contradiction)

13
New cards

one solution

independent, one pivot for every variable

14
New cards

no solution

inconsistent, there is a contradiction

15
New cards

inf solutions

dependent, at least one free variable in the system and no contradiction

16
New cards

steps at the end of RREF

  1. check rows for pivots, if you have (0101|2) the 2nd 1 is NOT a pivot

  2. check columns for free variables (there can be more than 1)


17
New cards

m

rows

18
New cards

n

columns

19
New cards

aij

entry in row i, column j

20
New cards

square matrix

matrix w/same # rows and columns

21
New cards

matrices can only be added/subtracted if

theyre the same size

22
New cards

matrix multiplication

  1. row of 1st matrix * column of 2nd matrix → AB=( #1 row * #1 column) + (#2 row * #2 column)

  2. you cn multiply if A=m*r | B=r*n

  3. A*B does not = B*A, dont reverse matrices


23
New cards

Trace

(tr(A) for matrix A), add the #s on the main diagonal, only works for square matrix

24
New cards

Transpose

  1. (A^T for matrix A), switch rows and columns

  2. (A*B)^T = B^T * A^T


25
New cards

Zero matrix

  1. all entries are zero

  2. even tho A+0=A and A-A=0, A*B=0 does NOT mean A=0 or B=0


26
New cards

Identity matrix (I)

1st on the main diagonal and zeroes everywhere else

27
New cards

if the det(A)=0

there is no inverse for matrix A

28
New cards

if the det(A) !=0

there is an Inverse for matrix A

29
New cards

Elementary Matrix is

what you get when you perform ONE row operation on an identity matrix

30
New cards

Invertible Matrix Theorem rules

  1. A is invertible

  2. RREF(A) = I

  3. Ax=0 has only trivial solutions (all variables=0)

  4. Ax=b has one solution for every b

  5. A can be written as a product of Elementary Matrices


31
New cards

Cofactor formula

Cij = (-1)^(i+j) * det(Aij)

32
New cards

Properties of determinants

  1. det(A^T) = det(A)

  2. det(AB) = det(A) *det(B)

  3. det(A^-1) = 1 / det(A)

  4. det(k*A) = k^n * det(A) → n from nxn matrix number

  5. det(In) = 1 → Identity matrix, n is nxn again

  6. det(A^m) = [det(A)]^m

  7. det( k A^m) = k^n * [det(A)]^m

  8. ur doing this stuff to the matrix (ex: multiplying matrix A by k)


33
New cards

properties of inverses

  1. (AB)^-1 = (B^-1) *(A^-1)

  2. (A^T) = (A^-1)^T

  3. (k*A)^-1 = 1/k * A^-1 (k ≠0)


34
New cards

diagonal matrices

every entry outside of the main diagonal is zero

35
New cards

Upper triangular matrix

all entries below the main diagonal are zero

36
New cards

Lower triangular matrix

all entries above the main diagonal are zero

37
New cards

determinant of diagonal matrices

multiply all the numbers on the main diagonal

38
New cards

determinant of triangular matrices

same method as determinant of diagonal matrices

39
New cards

effect of swapping two rows on Determinant of Elementary matrices

changes the sign (±) of the determinant for each swap

40
New cards

effect of multiplying a row by a # on the Determinant of Elementary matrices

det(E) = k ( k is number u multiply by)

41
New cards

effect of Adding a multiple of 1 row to another row on the Determinant of Elementary matrices

determinant doesn’t change

42
New cards

effect of swapping two rows on the determinant of square matrix

changes the sign (±) of the determinant for each swap

43
New cards

effect of multiplying one row by a # on the determinant of square matrix

det(B) = det(A) * k

44
New cards

effect of Adding a multiple of one row to another row on the determinant of square matrix

determinant doesn’t change

45
New cards

u*v < 0

obtuse, theta>90

46
New cards

u*v = 0

right angle, theta = 90

47
New cards

u*v > 0

acute, theta<90

48
New cards

proj a (u)

[ (u*a)/(a*a) ] *a

49
New cards

splitting a vector into perpendicular parts

  1. u = w1 +w2

  2. w1 = proj a (u)

  3. w2 = u - proj a (u)

  4. w1*w2 = 0


50
New cards

For a square system, a nonzero determinant

guarantees exactly one solution

51
New cards

matrix multiplication dimension rule

(m*n)(n*p) = (m*p)

left→ rows

right→ columns

52
New cards

angle eq w vectors

theta = cos^-1 [ (u * v) / ( ||u|| *||v|| ) ]

53
New cards

sin²() + cos²()

1