Gröbner Bases - Theory Refinement in the Mizar System

We argue that for building mathematical knowledge repositories a broad development of theories is of major importance. Organizing mathematical knowledge in theories is an obvious approach to cope with the immense number of topics, definitions, theorems, and proofs in a general repository that is not restricted to a special field. However, concrete mathematical objects are often reinterpreted as special instances of a general theory, in this way reusing and refining existing developments. We believe that in order to become widely accepted mathematical knowledge management systems have to adopt this flexibility and to provide collections of well-developed theories. As an example we describe the Mizar development of the theory of Grobner bases, a theory which is built upon the theory of polynomials, ring (ideal) theory, and the theory of rewriting systems. Here, polynomials are considered both as ring elements and elements of rewriting systems. Both theories (and polynomials) already have been formalized in Mizar and are therefore refined and reused. Our work also includes a number of theorems that, to our knowledge, have been proved mechanically for the first time.

[1]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[2]  William M. Farmer,et al.  IMPS: An interactive mathematical proof system , 1990, Journal of Automated Reasoning.

[3]  J. Harrison Formalized Mathematics , 1996 .

[4]  Alfred Tarski On well-ordered subsets of any set , 1939 .

[5]  E. W. Ng Symbolic and Algebraic Computation , 1979, Lecture Notes in Computer Science.

[6]  William M. Farmer,et al.  Little Theories , 1992, CADE.

[7]  Grzegorz Bancerek,et al.  On the structure of Mizar types , 2003, Mathematics, Logic and Computation @ ICALP.

[8]  Heinz Kredel,et al.  Gröbner Bases: A Computational Approach to Commutative Algebra , 1993 .

[9]  Bruno Buchberger,et al.  A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.

[10]  Laurent Théry,et al.  A Machine-Checked Implementation of Buchberger's Algorithm , 2001, Journal of Automated Reasoning.

[11]  B. Buchberger Gröbner Bases and Applications: Introduction to Gröbner Bases , 1998 .

[12]  B. Buchberger,et al.  Gröbner bases and applications , 1998 .

[13]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[14]  Piotr Rudnicki,et al.  Multivariate Polynomials with Arbitrary Number of Variables 1 , 2004 .

[15]  Ralf Fröberg,et al.  An introduction to Gröbner bases , 1997, Pure and applied mathematics.

[16]  Adam Grabowski,et al.  Rough Concept Analysis - Theory Development in the Mizar System , 2004, MKM.

[17]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[18]  José A. Alonso-Jiménez,et al.  Verified Computer Algebra in Acl2. Gröbner Bases Computation , 2004, AISC.

[19]  Martin D. Davis,et al.  Obvious Logical Inferences , 1981, IJCAI.

[20]  Grzegorz Bancerek,et al.  Reduction Relations , 2004 .

[21]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.

[22]  Herman Geuvers,et al.  C-CoRN, the Constructive Coq Repository at Nijmegen , 2004, MKM.

[23]  Piotr Rudnicki,et al.  Commutative Algebra in the Mizar System , 2001, J. Symb. Comput..