TheoremBase

Row Properties of the Determinant

Statement

Let nn be a natural number, let [n][n] be the initial segment determined by nn, and let R\mathbb{R} be the set of real numbers with the operations and the order ≤\le of its ordered field structure. Let AA be a real n×nn\times n matrix, with entry notation as there. Let SnS_{n} be the set of permutations of [n][n], with the identity id\mathrm{id} and the composition of Permutations of an Initial Segment Form a Group under Composition, and let sgn\mathrm{sgn} be the sign, with the properties recorded in The Sign of a Permutation is Multiplicative.

The determinant det⁡A\det A is that of Determinant of a Real Square Matrix. In the formula defining it, the sum over σ∈Sn\sigma\in S_{n} is the sum over a finite index set of Sum over a Finite Index Set, the set SnS_{n} being nonempty and finite by claim 4 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets, and the product of the entries A1σ(1),…,Anσ(n)A_{1\sigma(1)},\dots,A_{n\sigma(n)} is the finite product over [n][n], so that

det⁡A=∑σ∈Snsgn(σ)∏i=1nAi σ(i).\det A=\sum_{\sigma\in S_{n}}\mathrm{sgn}(\sigma)\prod_{i=1}^{n}A_{i\,\sigma(i)}.

Sums with a numerical index range are the finite sums of R\mathbb{R}, powers are those of Natural Number Power of an Element of a Field, the identity matrix InI_{n} is that of Identity Matrix, the scalar multiple μA\mu A is that of Scalar Multiple of a Real Matrix, and the transpose A⊤A^{\top} is that of Transpose of a Real Matrix.

Then the following hold.

1. (Identity matrix) det⁡In=1\det I_{n}=1.

2. (Linearity in one row) Let i∈[n]i\in[n], let mm be a natural number, let UU be a real m×nm\times n matrix, and let cc be an mm-tuple of real numbers, with components clc_{l}, such that

Aij=∑l=1mcl Uljfor every j∈[n].A_{ij}=\sum_{l=1}^{m}c_{l}\,U_{lj}\qquad\text{for every }j\in[n].

For l∈[m]l\in[m] let A(l)A^{(l)} be the real n×nn\times n matrix with Aij(l)=UljA^{(l)}_{ij}=U_{lj} for every j∈[n]j\in[n] and Akj(l)=AkjA^{(l)}_{kj}=A_{kj} for every k∈[n]k\in[n] with k≠ik\ne i and every j∈[n]j\in[n]. Then

det⁡A=∑l=1mcl det⁡A(l).\det A=\sum_{l=1}^{m}c_{l}\,\det A^{(l)}.

3. (Permuting the rows) Let π∈Sn\pi\in S_{n} and let AπA_{\pi} be the real n×nn\times n matrix with (Aπ)ij=Aπ(i) j(A_{\pi})_{ij}=A_{\pi(i)\,j} for all i,j∈[n]i,j\in[n]. Then

det⁡Aπ=sgn(π) det⁡A.\det A_{\pi}=\mathrm{sgn}(\pi)\,\det A.

4. (Two equal rows) If p,q∈[n]p,q\in[n] satisfy p≠qp\ne q and Apj=AqjA_{pj}=A_{qj} for every j∈[n]j\in[n], then det⁡A=0\det A=0.

5. (A zero row) If i∈[n]i\in[n] satisfies Aij=0A_{ij}=0 for every j∈[n]j\in[n], then det⁡A=0\det A=0.

6. (Dependent rows) If xx is an nn-tuple of real numbers, with components xix_{i}, such that xk≠0x_{k}\ne0 for at least one k∈[n]k\in[n] and

∑i=1nxi Aij=0for every j∈[n],\sum_{i=1}^{n}x_{i}\,A_{ij}=0\qquad\text{for every }j\in[n],

then det⁡A=0\det A=0.

7. (Scalar multiples) det⁡(μA)=μndet⁡A\det(\mu A)=\mu^{n}\det A for every μ∈R\mu\in\mathbb{R}.

8. (Transpose) det⁡(A⊤)=det⁡A\det\bigl(A^{\top}\bigr)=\det A.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…