ECCC-Report TR18-184https://eccc.weizmann.ac.il/report/2018/184Comments and Revisions published for TR18-184en-usFri, 13 Nov 2020 14:01:47 +0200
Revision 1
| Uniform, Integral and Feasible Proofs for the Determinant Identities |
Iddo Tzameret,
Stephen Cook
https://eccc.weizmann.ac.il/report/2018/184#revision1Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in Hrubes-Tzameret [SICOMP'15]. Specifically, we show that the multiplicativity of the determinant function and the Cayley-Hamilton theorem over the integers are provable in the bounded arithmetic theory $\mathbf{VNC}^2$; the latter is a first-order theory corresponding to the complexity class $\mathbf{NC}^2$ consisting of problems solvable by uniform families of polynomial-size circuits and $O(\log ^2 n)$-depth. This also establishes the existence of uniform polynomial-size propositional proofs operating with $\mathbf{NC}^2$-circuits of the basic determinant identities over the integers (previous propositional proofs hold only over the two element field).
Fri, 13 Nov 2020 14:01:47 +0200https://eccc.weizmann.ac.il/report/2018/184#revision1
Paper TR18-184
| Uniform, Integral and Feasible Proofs for the Determinant Identities |
Iddo Tzameret,
Stephen Cook
https://eccc.weizmann.ac.il/report/2018/184Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in Hrubes-Tzameret [SICOMP'15]. Specifically, we show that the multiplicativity of the determinant function and the Cayley-Hamilton theorem over the integers are provable in the bounded arithmetic theory $\mathbf{VNC}^2$; the latter is a first-order theory corresponding to the complexity class $\mathbf{NC}^2$ consisting of problems solvable by uniform families of polynomial-size circuits and $O(\log ^2 n)$-depth. This also establishes the existence of uniform polynomial-size $\mathbf{NC}^2$-Frege proofs of the basic determinant identities over the integers (previous propositional proofs hold only over the two element field).
Tue, 06 Nov 2018 00:20:40 +0200https://eccc.weizmann.ac.il/report/2018/184