Row equivalence is sameness of row space
ProvedHefferonLinAlg.row_equivalent_iff_same_row_spaceechelon-formlinear-algebrarow-space
Two matrices and over a field are row equivalent — that is, for some invertible — if and only if the span of the rows of equals the span of the rows of . This is where Chapter One's Linear Combination Lemma arrives: row reduction changes the rows but never the subspace they span, and that invariant is complete, which is what makes reduced echelon form a genuine canonical form for row equivalence.
Preamble
import Mathlib open Matrix
Formal statement
namespace HefferonLinAlg
theorem row_equivalent_iff_same_row_space
{K : Type*} [Field K] {m n : ℕ} (A B : Matrix (Fin m) (Fin n) K) :
(∃ M : Matrix (Fin m) (Fin m) K, IsUnit M.det ∧ B = M * A) ↔
Submodule.span K (Set.range A) = Submodule.span K (Set.range B) := by
sorry
end HefferonLinAlgSource
Jim Hefferon, *Linear Algebra*, Saint Michael's College, 2020 printing, Chapter One, Section III.2 and Chapter Two, Section III.3, Lemma 3.5 / Theorem 3.7, pp. 66-74, 146-153