Math 313 Review Flashcards
Homogeneous system
System is homogenous if can be written Ax=0
Trivial solution
Solution where x=0
Nontrivial solution
For Ax=0 if the equation has at least one free variable
Matrix Equation Theorem
- For each b in R^m, the equation Ax=b has a solution
- Each b in R^m is a linear combination of the columns of A.
- The columns of A span R^m
- A has a pivot position in every row
Span of vectors
If augmented matrix has a zero row, it is within the span. If it becomes consistent, then it is linear independent and not in the span
Existence and uniqueness theorem
LInear system is consistent if we don’t get a row where 0=x.
Consistent systems
Have a unique solution with no free variables
Have infinite solution if it has one free variable
Pivot position
Entry in matrix that has leading 1 in RREF
Pivot column
Column of A that has a pivot position
Echelon form
- All nonzero rows are above any rows with zeros
- Each leading entry of row is in a column to the right of leading entry row above it
- All entries in a column below leading entry are zeros
Reduced row echelon form
- Echelon Form
- Leading entry in each nonzero row is 1
- Each leading 1 is the only nonzero entry in its column
Consistent
System with at least one solution
Inconsistent
System with no solutions
Linear dependence
If a set contains more vectors than there are entries, the set is linearly dependent. For example, 4 vectors with only 3 entries.
T: R^n -> R^m
One-to-one, m >=n
Onto R^m, m<= n