Proving properties of matrices over \({\mathbb{Z}_{2}}\) (Q453198): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00153-012-0280-0 / rank
Normal rank
 
Property / review text
 
This article examines properties of matrices of \(\mathbb{Z}_2\). By proving several matrix properties in weak theories of linear algebra the paper presents a formal approach to linear algebra based on algebraic manipulations according to the ring axioms. This line of research contributes to the programme of reverse mathematics in that it identifies very weak logical theories capable of formalising linear algebra. The second and main motivation for this research comes from proof complexity where the matrix identities \(AB=I \to BA=I\) had been suggested to yield hard candidate formulas for Frege systems. However, after publication of the article under review, \textit{P. Hrubeš} and \textit{I. Tzameret} have shown that these formulas admit quasipolynomial-size Frege proofs [``Short proofs for the determinant identities'', in: Proceedings of the 44th symposium on theory of computing, STOC '12. New York, NY: ACM Press. 193--212 (2012; \url{doi:10.1145/2213977.2213998})]. Still no non-trivial lower bounds are known for Frege systems, and this is one of the major open problems in proof complexity.
Property / review text: This article examines properties of matrices of \(\mathbb{Z}_2\). By proving several matrix properties in weak theories of linear algebra the paper presents a formal approach to linear algebra based on algebraic manipulations according to the ring axioms. This line of research contributes to the programme of reverse mathematics in that it identifies very weak logical theories capable of formalising linear algebra. The second and main motivation for this research comes from proof complexity where the matrix identities \(AB=I \to BA=I\) had been suggested to yield hard candidate formulas for Frege systems. However, after publication of the article under review, \textit{P. Hrubeš} and \textit{I. Tzameret} have shown that these formulas admit quasipolynomial-size Frege proofs [``Short proofs for the determinant identities'', in: Proceedings of the 44th symposium on theory of computing, STOC '12. New York, NY: ACM Press. 193--212 (2012; \url{doi:10.1145/2213977.2213998})]. Still no non-trivial lower bounds are known for Frege systems, and this is one of the major open problems in proof complexity. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Olaf Beyersdorff / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15B33 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6083828 / rank
 
Normal rank
Property / zbMATH Keywords
 
proof complexity
Property / zbMATH Keywords: proof complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
matrix identities
Property / zbMATH Keywords: matrix identities / rank
 
Normal rank
Property / zbMATH Keywords
 
extended Frege systems
Property / zbMATH Keywords: extended Frege systems / rank
 
Normal rank
Property / zbMATH Keywords
 
reverse mathematics
Property / zbMATH Keywords: reverse mathematics / rank
 
Normal rank
Property / zbMATH Keywords
 
Frege systems
Property / zbMATH Keywords: Frege systems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00153-012-0280-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982052585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric and Alternate Matrices in An Arbitrary Field, I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Theories for Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Powers of Matrices with Elements in the Field of Integers Modulo 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Matrices Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices of zeros and ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proof complexity of linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4438100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak theories of linear algebra / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00153-012-0280-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:09, 9 December 2024

scientific article
Language Label Description Also known as
English
Proving properties of matrices over \({\mathbb{Z}_{2}}\)
scientific article

    Statements

    Proving properties of matrices over \({\mathbb{Z}_{2}}\) (English)
    0 references
    0 references
    18 September 2012
    0 references
    This article examines properties of matrices of \(\mathbb{Z}_2\). By proving several matrix properties in weak theories of linear algebra the paper presents a formal approach to linear algebra based on algebraic manipulations according to the ring axioms. This line of research contributes to the programme of reverse mathematics in that it identifies very weak logical theories capable of formalising linear algebra. The second and main motivation for this research comes from proof complexity where the matrix identities \(AB=I \to BA=I\) had been suggested to yield hard candidate formulas for Frege systems. However, after publication of the article under review, \textit{P. Hrubeš} and \textit{I. Tzameret} have shown that these formulas admit quasipolynomial-size Frege proofs [``Short proofs for the determinant identities'', in: Proceedings of the 44th symposium on theory of computing, STOC '12. New York, NY: ACM Press. 193--212 (2012; \url{doi:10.1145/2213977.2213998})]. Still no non-trivial lower bounds are known for Frege systems, and this is one of the major open problems in proof complexity.
    0 references
    proof complexity
    0 references
    matrix identities
    0 references
    extended Frege systems
    0 references
    reverse mathematics
    0 references
    Frege systems
    0 references

    Identifiers