How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
For equal-sized matrices, row equivalence, equality of row spaces and equality of reduced row echelon forms are equivalent
Statement
For matrices , the following are equivalent:
- and are row equivalent;
- ;
- and have the same reduced row echelon form.
Facts & Assumptions
Given: Equal-sized matrices and over a field.
Every matrix has a unique reduced row echelon form within its row-equivalence class (Every finite matrix over a field is row equivalent to exactly one reduced row echelon matrix).
Row operations preserve row space (Row-equivalent matrices have the same row space and the same row rank).
The nonzero rows of an echelon form form a basis of its row space (The nonzero rows of a row echelon form form a basis of the original row space).
Every elementary row operation has an elementary inverse (Every elementary row operation has an elementary inverse, so row equivalence is an equivalence relation).
Proof
If and are row equivalent, [L2] gives equal row spaces, and reducing either one gives a reduced form in the same row-equivalence class, so [L1] gives the same RREF.
Suppose the row spaces are the same space . If the nonzero rows of an RREF have pivots , then [L3] expresses every nonzero uniquely as a linear combination of those rows. The first row with nonzero coefficient makes the leading position of equal to its pivot. Hence the pivot columns are exactly the possible leading positions of nonzero vectors in , so both RREFs have the same pivots. Corresponding nonzero rows have in the same pivot and in every other pivot column. Their difference lies in and vanishes at every possible leading position, so it is zero. The nonzero rows, and then the zero rows, agree.
If and have a common RREF, reverse the reduction from to that form using [L4] and concatenate it with the reduction from ; this gives a row reduction from to .
Depends on
- Every finite matrix over a field is row equivalent to exactly one reduced row echelon matrix
- Row-equivalent matrices have the same row space and the same row rank
- The nonzero rows of a row echelon form form a basis of the original row space
- Every elementary row operation has an elementary inverse, so row equivalence is an equivalence relation
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 29 results over 14 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- J. Hefferon, Linear Algebra, 4th ed., Ch. One, §III.2 and Ch. Three, §IV.4 (standard reference, not scraped)