TheoremBase

Multiplicativity gives det(A)det(A−1)det(A)det(A^{-1}) = det(In)det(I_n) = 1, which yields det A nonzero and the formula for det(A−1)det(A^{-1}); conversely, a non-invertible A has a nonzero kernel vector, which is a dependence of the rows of the transpose, so det A = det(AT)det(A^T) = 0.

Proof

Each result cited is universally quantified over the data in its own statement. We work in Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices.

A product formula. Let AA be invertible. By Inverse Matrix and Invertible Real Square Matrix §invertible, AA has exactly one inverse, denoted A−1∈Mn(R)A^{-1}\in\mathcal{M}_{n}(\mathbb{R}), and AA−1=InAA^{-1}=I_{n} by Inverse Matrix and Invertible Real Square Matrix §inverse. Hence, by The Determinant is Multiplicative §multiplicative with A−1A^{-1} in place of BB, and by Rules for the Determinant: Rows, Scalar Multiples and the Transpose §identity,

det⁡A⋅det⁡(A−1)=det⁡(AA−1)=det⁡In=1.(1)\det A\cdot\det(A^{-1})=\det(AA^{-1})=\det I_{n}=1.\tag{1}

Clause invertible, only if. Let AA be invertible. If det⁡A=0\det A=0, then (1) gives 1=0⋅det⁡(A−1)=01=0\cdot\det(A^{-1})=0, which is false, since 0≠10\neq1 in the field R\mathbb{R} (Fields §field). Hence det⁡A≠0\det A\neq0.

Clause invertible, if. Let det⁡A≠0\det A\neq0, and suppose that AA is not invertible. Conditions Criteria for Invertibility of a Square Real Matrix §trivial-kernel and Criteria for Invertibility of a Square Real Matrix §invertible are equivalent by that theorem, and the latter fails, so the former fails: there is x∈Rnx\in\mathbb{R}^{n} with Ax=0Ax=0, the origin, and x≠0x\neq0. The transpose A⊤A^{\top} lies in Mn(R)\mathcal{M}_{n}(\mathbb{R}) and (A⊤)ij=Aji(A^{\top})_{ij}=A_{ji} for all i,j∈[n]i,j\in[n], by Transpose of a Real Matrix §transpose. The origin is the constant map with value 00 by Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations §origin, so all its components are 00. Hence, for every j∈[n]j\in[n], by Matrix-Vector Product §product,

∑i=1nxi(A⊤)ij=∑i=1nAjixi=(Ax)j=0.\sum_{i=1}^{n}x_{i}(A^{\top})_{ij}=\sum_{i=1}^{n}A_{ji}x_{i}=(Ax)_{j}=0.

By Rules for the Determinant: Rows, Scalar Multiples and the Transpose §dependent-rows applied to A⊤A^{\top} in place of AA, det⁡(A⊤)=0\det(A^{\top})=0, and then det⁡A=det⁡(A⊤)=0\det A=\det(A^{\top})=0 by Rules for the Determinant: Rows, Scalar Multiples and the Transpose §transpose. This contradicts det⁡A≠0\det A\neq0; so AA is invertible.

Clause inverse. Let AA be invertible; then det⁡A≠0\det A\neq0 by clause invertible. By (1), det⁡(A−1)\det(A^{-1}) is an element z∈Rz\in\mathbb{R} with det⁡A⋅z=1\det A\cdot z=1; the only such zz is the reciprocal of det⁡A\det A, by Negatives, Differences, Reciprocals and Quotients §reciprocal. Hence det⁡(A−1)=(det⁡A)−1=1/det⁡A\det(A^{-1})=(\det A)^{-1}=1/\det A.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…