Exam 2 Flashcards
Testing for row equivalence
Every matrix row equivalence class reduces to the same rref matrix.
Showing row operations to relate two matrices as row-equivalent
A = (α1, α2…)
Show that B = (β1=α1, β2=2α2… etc)
Echelon form definition
No non-zero row is a linear combination of any of the other rows.
Verify:
row1 /= (row2)c1 + (row3)c2 …+ (rowN)cN
A system of equations has ___ matrices associated with it.
3:
Coefficient matrix
Homogeneous matrix
Non-homogeneous matrix
Equivalent statements for:
A is nonsingular
A is nonsingular.
rref [A] = identity matrix.
The homogeneous system has one solution: the zero vector.
T/F: All nonsingular matrices are in the same row-equivalence class.
True.
Nonsingular means rref[A]= identity matrix
T/F: All NxN (square) matrices are in the same row equivalence class.
False
If two systems (“systems” includes “=d”, nonhomogeneous) have row equivalent matrices, do they have the same solution?
Yes
How many members can there be in a row equivalence class?
Either one (the zero matrix) or infinite.
Rules to determine if a set is a vector space.
Addition: u+v ε V
Scalar multiplication: rv ε V
Zero vector: 0 ε V
The improper subspaces of V
V itself and the trivial subspace (0)
Constructing a subset
Put some restriction on the vector space.
I.e. “such that…”
Constructing a subset that is a subspace of the vector space.
Put a restriction on the vector space “such that…” which abides by the rules of a space (addition, scalar multiplication, zero vector).
Equivalent statements:
S is a subspace of V
S is a subspace of V.
S is “closed” (valid) under linear combinations of any N of its vectors.
S is a subspace of V. Find all vectors that can be used in equivalent statements.
Parameterize the statement (free variables times vectors) so that S is the set of all linear combinations of those vectors