TheoremBase

The products, the summands tAt_A and the determinant map come from maps on pairs (matrix, permutation) and the maps given by iterated operations over a finite set; the matrices AfA^f, A[i<-u] and A(iA^(i,j) are maps given by expressions or by cases, and the adjugate entries use the deleted matrices as a defined set symbol with a predicative defining formula; uniqueness follows from equality of maps by their values.

Proof

Each result cited is universally quantified over the data in its own statement. The number n∈Nn\in\mathbb{N} and the matrix A∈Mn(R)A\in\mathcal{M}_{n}(\mathbb{R}) are arbitrary, so every clause proved below holds for every n∈Nn\in\mathbb{N} and every A∈Mn(R)A\in\mathcal{M}_{n}(\mathbb{R}).

Preliminaries. For q∈Nq\in\mathbb{N}, the elements of Mq(R)\mathcal{M}_{q}(\mathbb{R}) are the maps [q]×[q]→R[q]\times[q]\to\mathbb{R}, with Bij=B((i,j))B_{ij}=B((i,j)), by Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations §matrices and Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations §entries; the elements of Rn\mathbb{R}^{n} are the maps u:[n]→Ru:[n]\to\mathbb{R}, with uj=u(j)u_{j}=u(j), by Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations §space and Euclidean Space Rn\mathbb{R}^n: n-Tuples of Real Numbers with Their Componentwise Operations §membership; and the elements of SnS_{n} are the bijections [n]→[n][n]\to[n], by Permutations of a Set and the Set of Permutations of [n] §membership. Every map and every matrix formed below is given by an expression in its values or entries, which lie in the stated target, so it exists and is the only map with these values, as in Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices §maps and Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices §predicativity.

Clause terms. Let σ∈Sn\sigma\in S_{n}. For i∈[n]i\in[n], σ(i)∈[n]\sigma(i)\in[n], so i↦Aiσ(i)i\mapsto A_{i\sigma(i)} is a map [n]→R[n]\to\mathbb{R}, and its product over the finite set [n][n] lies in R\mathbb{R}. Hence tA:Sn→Rt_{A}:S_{n}\to\mathbb{R}, σ↦sgn⁡(σ)∏i∈[n]Aiσ(i)\sigma\mapsto\operatorname{sgn}(\sigma)\prod_{i\in[n]}A_{i\sigma(i)}, is a map, and the only one with these values.

Clause determinant. For B∈Mn(R)B\in\mathcal{M}_{n}(\mathbb{R}), tBt_{B} is the only map with the values of clause terms with BB in place of AA, and ∑σ∈SntB(σ)∈R\sum_{\sigma\in S_{n}}t_{B}(\sigma)\in\mathbb{R} is its sum over the finite set SnS_{n}. Hence Dn:Mn(R)→RD_{n}:\mathcal{M}_{n}(\mathbb{R})\to\mathbb{R}, B↦∑σ∈SntB(σ)B\mapsto\sum_{\sigma\in S_{n}}t_{B}(\sigma), is a map, and the only one with these values. Since n∈Nn\in\mathbb{N} was arbitrary, this clause holds with every element of N\mathbb{N} in place of nn.

Clause row-reindexing. Let f:[n]→[n]f:[n]\to[n]. For i,j∈[n]i,j\in[n], f(i)∈[n]f(i)\in[n], so (i,j)↦Af(i)j(i,j)\mapsto A_{f(i)j} is a map [n]×[n]→R[n]\times[n]\to\mathbb{R}, that is an element AfA^{f} of Mn(R)\mathcal{M}_{n}(\mathbb{R}), and the only one with these entries.

Clause row-replacement. Let i∈[n]i\in[n] and u∈Rnu\in\mathbb{R}^{n}. By Maps Defined by Cases §cases, with the sets [n]×[n][n]\times[n] and R\mathbb{R}, the property that the first component of z=(k,j)z=(k,j) is ii, and the expressions uju_{j} and AkjA_{kj}, there is exactly one C∈Mn(R)C\in\mathcal{M}_{n}(\mathbb{R}) with Cij=ujC_{ij}=u_{j} for all j∈[n]j\in[n] and Ckj=AkjC_{kj}=A_{kj} for all j,k∈[n]j,k\in[n] with k≠ik\neq i. This CC is A[i←u]A[i\leftarrow u].

Clause deletion. Let 2≤n2\le n. Then 1∈[n]1\in[n], so n−1∈Nn-1\in\mathbb{N} by The Index Map Skipping One Element of [n] §difference applied with i=1i=1. For i∈[n]i\in[n], si:[n−1]→[n]s_{i}:[n-1]\to[n] is a map by The Deletion Index Map §deletion-index. Let i,j∈[n]i,j\in[n]. For k,l∈[n−1]k,l\in[n-1], (si(k),sj(l))∈[n]×[n](s_{i}(k),s_{j}(l))\in[n]\times[n], so (k,l)↦Asi(k)sj(l)(k,l)\mapsto A_{s_{i}(k)s_{j}(l)} is a map [n−1]×[n−1]→R[n-1]\times[n-1]\to\mathbb{R}, that is an element A(i,j)A^{(i,j)} of Mn−1(R)\mathcal{M}_{n-1}(\mathbb{R}), and the only one with these entries.

Clause adjugate. Let 2≤n2\le n, so that n−1∈Nn-1\in\mathbb{N} as in clause deletion, and Dn−1:Mn−1(R)→RD_{n-1}:\mathcal{M}_{n-1}(\mathbb{R})\to\mathbb{R} is the map of clause determinant with n−1n-1 in place of nn. For i,j∈[n]i,j\in[n], A(j,i)A^{(j,i)} is, by clause deletion, the only element of Mn−1(R)\mathcal{M}_{n-1}(\mathbb{R}) with the entries given there, so Dn−1(A(j,i))∈RD_{n-1}(A^{(j,i)})\in\mathbb{R}, and (−1)j+i∈R(-1)^{j+i}\in\mathbb{R} with j+i∈N0j+i\in\mathbb{N}_{0}. Hence (i,j)↦(−1)j+iDn−1(A(j,i))(i,j)\mapsto(-1)^{j+i}D_{n-1}(A^{(j,i)}) is a map [n]×[n]→R[n]\times[n]\to\mathbb{R}, that is an element BB of Mn(R)\mathcal{M}_{n}(\mathbb{R}), and the only one with these entries.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…