Gauss-Jordan Reduction
Pivoting to clear a whole column yields reduced echelon form, where the solution set can be read off directly, and defines row equivalence.
14 exercises
Exercise 1
Use Gauss-Jordan reduction to solve each system.
-
(a) (b) (c) (d)
Exercise 2
Do Gauss-Jordan reduction.
-
(a) (b)
Exercise 3
Find the reduced echelon form of each matrix.
-
(a) (b) (c) (d)
Exercise 4
Get the reduced echelon form of each.
-
(a) (b)
Exercise 5
Find each solution set by using Gauss-Jordan reduction and then reading off the parametrization.
Exercise 6
Give two distinct echelon form versions of this matrix.
Exercise 7
List the reduced echelon forms possible for each size.
-
(a) (b) (c) (d)
Exercise 8
What results from applying Gauss-Jordan reduction to a nonsingular matrix?
Exercise 9
Decide whether each relation is an equivalence on the set of matrices.
-
two matrices are related if they have the same entry in the first row and first column
-
two matrices are related if they have the same entry in the first row and first column, or the same entry in the second row and second column
Exercise 10
Consider the following relationship on the set of matrices: we say that is sum-what like if the sum of all of the entries in is the same as the sum of all the entries in . For instance, the zero matrix would be sum-what like the matrix whose first row had two sevens, and whose second row had two negative sevens. Prove or disprove that this is an equivalence relation on the set of matri…
Exercise 11
The proof of Lemma 1.5 contains a reference to the condition on the row combination operation.
-
Write down a matrix with nonzero entries, and show that the operation is not reversed by .
-
Expand the proof of that lemma to make explicit exactly where it uses the condition on combining.
Exercise 12
Consider the set of students in a class. Which of the following relationships are equivalence relations? Explain each answer in at least a sentence.
-
Two students are related if has taken at least as many math classes as .
-
Students are related if they have names that start with the same letter.
Exercise 13
Show that each of these is an equivalence on the set of matrices. Describe the equivalence classes.
-
Two matrices are related if they have the same product down the diagonal, that is, if the product of the entries in the upper left and lower right are equal.
-
Two matrices are related if they both have at least one entry that is a , or if neither does.
Exercise 14
Show that each is not an equivalence on the set of matrices.
-
Two matrices are related if .
-
Two matrices are related if the sum of their entries are within , that is, is related to if .
Adapted from Linear Algebra © 2016 Jim Hefferon. Licensed under CC BY-SA 3.0 US. Source: Linear Algebra. Imported at revision df2262e.