Abstract
We prove assorted properties of matrices over \({\mathbb{Z}_{2}}\), and outline the complexity of the concepts required to prove these properties. The goal of this line of research is to establish the proof complexity of matrix algebra. It also presents a different approach to linear algebra: one that is formal, consisting in algebraic manipulations according to the axioms of a ring, rather than the traditional semantic approach via linear transformations.
Similar content being viewed by others
References
Albert A.A.: Symmetric and alternating matrices in an arbitrary field, i. Trans. Am. Math. Soc. 43(3), 386–436 (1938)
Brualdi R.A., Ryser H.J.: Combinatorial Matrix Theory. Cambridge University Press, Cambridge (1991)
Cook, S., Fontes, L.: Formal theories for linear algebra. In: Presented at the Federated Logic Conference (2010)
Cobb S.M.: On powers of matrices with elements in the field of integers modulo 2. Math. Gazette 42(342), 267–271 (1958)
Filmus, Y.: Range of symmetric matrices over GF(2). Unpublished note, University of Toronto, January (2010)
MacWilliams J.: Orthogonal matrices over finite fields. Am. Math. Mon. 76(2), 152–164 (1969)
Montgomery, P.L.: A block Lanczos algorithm for finding dependencies over GF(2). In: EUROCRYPT pp. 106–120 (1995)
Ryser H.J.: Matrices of zeros and ones. Bull. Am. Math. Soc. 66(6), 442–464 (1960)
Soltys M., Cook S.A.: The complexity of derivations of matrix identities. Ann. Pure Appl. Logic 130(1–3), 277–323 (2004)
Soltys M.: Extended frege and Gaussian elimination. Bull. Sect. Logic 31(4), 1–17 (2002)
Thapen N., Soltys M.: Weak theories of linear algebra. Arch. Math. Logic 44(2), 195–208 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Soltys, M. Proving properties of matrices over \({\mathbb{Z}_{2}}\) . Arch. Math. Logic 51, 535–551 (2012). https://doi.org/10.1007/s00153-012-0280-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-012-0280-0