Row equivalence matrix
Dependencies:
- Row equivalence of matrices
- Elementary row operation is matrix pre-multiplication
- Matrix multiplication is associative
- Inverse of product
Let $A$ be row-equivalent to $B$. Then there exists an invertible matrix $R$ such that $B = RA$.
Proof
There exists a sequence of elementary row operations which transforms $A$ to $B$. Let $R_1, R_2, \ldots, R_p$ be the matrices associated with those operations. Let $R = R_pR_{p-1}\ldots R_2R_1$. Since each $R_i$ is invertible, $R$ is also invertible and $R^{-1} = (R_pR_{p-1}\ldots R_2R_1)^{-1} = R_1^{-1}R_2^{-1}\ldots R_p^{-1}$.
Since $B$ is obtained by applying the operations $R_1, R_2, \ldots, R_p$, \[ B = R_p(\ldots(R_2(R_1(A)))\ldots) = RA \] by associativity of matrix multiplication
Dependency for:
- RREF([A|I]) = [I|inv(A)] iff A is invertible
- Full-rank square matrix is invertible
- Equations with row equivalent matrices have the same solution set
Info:
- Depth: 6
- Number of transitive dependencies: 17
Transitive dependencies:
- /sets-and-relations/equivalence-relation
- Group
- Ring
- Polynomial
- Integral Domain
- Comparing coefficients of a polynomial with disjoint variables
- Field
- Semiring
- Matrix
- Matrix multiplication is associative
- Elementary row operation
- Every elementary row operation has a unique inverse
- Row equivalence of matrices
- Identity matrix
- Inverse of a matrix
- Inverse of product
- Elementary row operation is matrix pre-multiplication