Math 2.0

definition

Row equivalence

Definition

Let FF be a field and let AA and BB be m×nm \times n matrices over FF. The matrix AA is row equivalent to BB when there is a finite sequence of elementary row operations that changes AA into BB.

Remarks

Row equivalence is an equivalence relation, because each elementary row operation has an inverse operation. The matrices AA and BB are row equivalent if and only if B=PAB = PA for an invertible m×mm \times m matrix PP. Each matrix is row equivalent to exactly one matrix in reduced row echelon form. Row equivalent matrices have the same row space and the same null space.

Explanations

L1 human

Two matrices are row equivalent when row operations can turn one into the other. If they are augmented matrices of two systems, then the two systems have the same solutions. Row reduction replaces a matrix by a simpler row equivalent matrix.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Matrix definition
  2. Elementary row operations definition
  3. Row equivalence definition

Sources

  1. Web https://en.wikipedia.org/wiki/Row_equivalence, lead section