Determinant of product is product of determinants
Dependencies:
- A matrix is full-rank iff its determinant is non-0
- Full-rank square matrix is invertible
- AB = I implies BA = I
- Full-rank square matrix in RREF is the identity matrix
- Elementary row operation is matrix pre-multiplication
- Matrix multiplication is associative
- Determinant of upper triangular matrix
Let $A$ and $B$ be $n$ by $n$ matrices. Then $|AB| = |A||B|$.
Proof
Case 1: $|A| = 0$
Assume $|AB| \neq 0$. \begin{align} & |AB| \neq 0 \\ &\Rightarrow \operatorname{rank}(AB) = n \\ &\Rightarrow (AB)^{-1} \textrm{ exists} \\ &\Rightarrow I = AB(AB)^{-1} \textrm{ exists} \\ &\Rightarrow B(AB)^{-1} \textrm{ is a right inverse of } A \\ &\Rightarrow A \textrm{ is invertible} \\ &\Rightarrow \operatorname{rank}(A) = n \\ &\Rightarrow |A| \neq 0 \\ &\Rightarrow \bot \end{align}
Therefore, $|AB| = 0 = |A||B|$.
Case 2: $|A| \neq 0$
\[ |A| \neq 0 \iff \operatorname{rank}(A) = n \iff \operatorname{RREF}(A) = I \]
Therefore, $A$ is row-equivalent to $I$. Let $[R_1, R_2, \ldots, R_p]$ be the sequence of matrices of the elementary row operations which convert $I$ to $A$. Let $[r_1, r_2, \ldots, r_p]$ be the determinant constants associated with those operations.
\begin{align} |AB| &= |R_p(R_{p-1}(\ldots(R_1(I))\ldots)) B| \\ &= |R_p(R_{p-1}(\ldots(R_1(B))\ldots))| \tag{Matrix multiplication is associative} \\ &= r_p(r_{p-1}(\ldots(r_1|B|)\ldots)) \\ &= (r_pr_{p-1}\ldots r_1)|B| \\ &= (r_pr_{p-1}\ldots r_1)|I||B| \tag{$I$ is upper-triangular, so $|I| = 1$} \\ &= (r_p(r_{p-1}(\ldots(r_1|I|)\ldots)))|B| \\ &= |(R_p(R_{p-1}(\ldots(R_1(I))\ldots)))||B| \\ &= |A||B| \end{align}
Dependency for:
Info:
- Depth: 11
- Number of transitive dependencies: 48
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
- 0x = 0 = x0
- Field
- Vector Space
- Linear independence
- Span
- A field is an integral domain
- Semiring
- Matrix
- Stacking
- System of linear equations
- Product of stacked matrices
- Matrix multiplication is associative
- Reduced Row Echelon Form (RREF)
- Submatrix
- Determinant
- Determinant of upper triangular matrix
- Swapping last 2 rows of a matrix negates its determinant
- Matrices over a field form a vector space
- Row space
- Elementary row operation
- Determinant after 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 matrix
- Basis of a vector space
- Linearly independent set is not bigger than a span
- Homogeneous linear equations with more variables than equations
- Rank of a homogenous system of linear equations
- Full-rank square matrix in RREF is the identity matrix
- A matrix is full-rank iff its determinant is non-0
- Full-rank square matrix is invertible
- AB = I implies BA = I