AB = I implies BA = I
Dependencies:
- Identity matrix
- Rank of a homogenous system of linear equations
- Matrix multiplication is associative
- Full-rank square matrix is invertible
Let $A$ and $B$ be $n$ by $n$ matrices. If $AB = I$, then $BA = I$.
Proof
$BX = 0$ is a system of $n$ linear equations in $n$ variables.
\[ BX = 0 \implies A(BX) = A0 \implies (AB)X = 0 \implies IX = 0 \Rightarrow X = 0 \] Since $X = 0$ is the only solution to $BX = 0$, $\operatorname{rank}(B) = n$.
Since $\operatorname{rank}(B) = n$, $B$ is invertible. Therefore, every left inverse of $B$ is also a right inverse. Therefore, $BA = I$.
Dependency for:
Info:
- Depth: 10
- Number of transitive dependencies: 39
Transitive dependencies:
- /linear-algebra/vector-spaces/condition-for-subspace
- /linear-algebra/matrices/gauss-jordan-algo
- /sets-and-relations/equivalence-relation
- Group
- Ring
- Polynomial
- Integral Domain
- Comparing coefficients of a polynomial with disjoint variables
- Field
- Vector Space
- Linear independence
- Span
- Semiring
- Matrix
- Stacking
- System of linear equations
- Product of stacked matrices
- Matrix multiplication is associative
- Reduced Row Echelon Form (RREF)
- Matrices over a field form a vector space
- Row space
- Elementary row operation
- Every elementary row operation has a unique inverse
- Row equivalence of matrices
- Row equivalent matrices have the same row space
- RREF is unique
- Identity matrix
- Inverse of a matrix
- Inverse of product
- Elementary row operation is matrix pre-multiplication
- Row equivalence matrix
- Equations with row equivalent matrices have the same solution set
- Rank of a homogenous system of linear equations
- Rank of a matrix
- Basis of a vector space
- Linearly independent set is not bigger than a span
- Homogeneous linear equations with more variables than equations
- Full-rank square matrix in RREF is the identity matrix
- Full-rank square matrix is invertible