6 research outputs found
Quasipolynomial size frege proofs of Frankl's Theorem on the trace of sets
We extend results of Bonet, Buss and Pitassi on Bondy's Theorem and of Nozaki, Arai and Arai on Bollobas' Theorem by proving that Frankl's Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parameter t, we prove that Frankl's Theorem has polynomial size AC(0)-Frege proofs from instances of the pigeonhole principle.Peer ReviewedPostprint (author's final draft
Witnessing matrix identities and proof complexity
We use results from the theory of algebras with polynomial identities (PI-algebras) to study the witness complexity of matrix identities. A matrix identity of [Formula: see text] matrices over a field [Formula: see text]is a non-commutative polynomial (f(x1, …, xn)) over [Formula: see text], such that [Formula: see text] vanishes on every [Formula: see text] matrix assignment to its variables. For every field [Formula: see text]of characteristic 0, every [Formula: see text] and every finite basis of [Formula: see text] matrix identities over [Formula: see text], we show there exists a family of matrix identities [Formula: see text], such that each [Formula: see text] has [Formula: see text] variables and requires at least [Formula: see text] many generators to generate, where the generators are substitution instances of elements from the basis. The lower bound argument uses fundamental results from PI-algebras together with a generalization of the arguments in [P. Hrubeš, How much commutativity is needed to prove polynomial identities? Electronic colloquium on computational complexity, ECCC, Report No.: TR11-088, June 2011].We apply this result in algebraic proof complexity, focusing on proof systems for polynomial identities (PI proofs) which operate with algebraic circuits and whose axioms are the polynomial-ring axioms [P. Hrubeš and I. Tzameret, The proof complexity of polynomial identities, in Proc. 24th Annual IEEE Conf. Computational Complexity, CCC 2009, 15–18 July 2009, Paris, France (2009), pp. 41–51; Short proofs for the determinant identities, SIAM J. Comput. 44(2) (2015) 340–383], and their subsystems. We identify a decrease in strength hierarchy of subsystems of PI proofs, in which the [Formula: see text]th level is a sound and complete proof system for proving [Formula: see text] matrix identities (over a given field). For each level [Formula: see text] in the hierarchy, we establish an [Formula: see text] lower bound on the number of proof-steps needed to prove certain identities.Finally, we present several concrete open problems about non-commutative algebraic circuits and speed-ups in proof complexity, whose solution would establish stronger size lower bounds on PI proofs of matrix identities, and beyond.</jats:p
Generating Matrix Identities and Proof Complexity
Motivated by the fundamental lower bounds questions in proof complexity, we
initiate the study of matrix identities as hard instances for strong proof
systems. A matrix identity of matrices over a field ,
is a non-commutative polynomial over such that
vanishes on every matrix assignment to its variables.
We focus on arithmetic proofs, which are proofs of polynomial identities
operating with arithmetic circuits and whose axioms are the polynomial-ring
axioms (these proofs serve as an algebraic analogue of the Extended Frege
propositional proof system; and over they constitute formally a
sub-system of Extended Frege [HT12]). We introduce a decreasing in strength
hierarchy of proof systems within arithmetic proofs, in which the th level
is a sound and complete proof system for proving matrix identities
(over a given field). For each level in the hierarchy, we establish a
proof-size lower bound in terms of the number of variables in the matrix
identity proved: we show the existence of a family of matrix identities
with variables, such that any proof of requires
number of lines. The lower bound argument uses fundamental results from the
theory of algebras with polynomial identities together with a generalization of
the arguments in [Hru11].
We then set out to study matrix identities as hard instances for (full)
arithmetic proofs. We present two conjectures, one about non-commutative
arithmetic circuit complexity and the other about proof complexity, under which
up to exponential-size lower bounds on arithmetic proofs (in terms of the
arithmetic circuit size of the identities proved) hold. Finally, we discuss the
applicability of our approach to strong propositional proof systems such as
Extended Frege.Comment: 46 pages, 1 figur