The products, the summands and the determinant map come from maps on pairs (matrix, permutation) and the maps given by iterated operations over a finite set; the matrices , A[i<-u] and ,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.
Each result cited is universally quantified over the data in its own statement. The number and the matrix are arbitrary, so every clause proved below holds for every and every .
Preliminaries. For , the elements of are the maps , with , 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 are the maps , with , by Euclidean Space : n-Tuples of Real Numbers with Their Componentwise Operations §space and Euclidean Space : n-Tuples of Real Numbers with Their Componentwise Operations §membership; and the elements of are the bijections , 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 . For , , so is a map , and its product over the finite set lies in . Hence , , is a map, and the only one with these values.
Clause determinant. For , is the only map with the values of clause terms with in place of , and is its sum over the finite set . Hence , , is a map, and the only one with these values. Since was arbitrary, this clause holds with every element of in place of .
Clause row-reindexing. Let . For , , so is a map , that is an element of , and the only one with these entries.
Clause row-replacement. Let and . By Maps Defined by Cases §cases, with the sets and , the property that the first component of is , and the expressions and , there is exactly one with for all and for all with . This is .
Clause deletion. Let . Then , so by The Index Map Skipping One Element of [n] §difference applied with . For , is a map by The Deletion Index Map §deletion-index. Let . For , , so is a map , that is an element of , and the only one with these entries.
Clause adjugate. Let , so that as in clause deletion, and is the map of clause determinant with in place of . For , is, by clause deletion, the only element of with the entries given there, so , and with . Hence is a map , that is an element of , and the only one with these entries.
Loading…