Mathematical Theory Exploration in Theorema: Reduction Rings
In this paper we present the first-ever computer formalization of the theory of Gröbner bases in reduction rings in Theorema. Not only the formalization, but also the formal verification of all key results has already been fully completed by now; this, in particular, includes the generic implementation and correctness proof of Buchberger’s algorithm in reduction rings. Thanks to the seamless integration of proving and computing in Theorema, this implementation can now be used to compute Gröbner bases in various different domains directly within the system. Moreover, a substantial part of our formalization is made up solely by “elementary theories” such as sets, numbers and tuples that are themselves independent of reduction rings and may therefore be used as the foundations of future theory explorations in Theorema.
In addition, we also report on two general-purpose Theorema tools we developed for efficiently exploring mathematical theories: an interactive proving strategy and a “theory analyzer” that already proved extremely useful when creating large structured knowledge bases.
KeywordsGröbner bases Reduction rings Computer-supported theory exploration Automated reasoning Theorema
I thank the anonymous referees for their valuable remarks and suggestions.
This research was funded by the Austrian Science Fund (FWF): grant no. W1214-N15, project DK1.
- 4.Buchberger, B.: Gröbner Rings in Theorema: A Case Study in Functors and Categories. Technical report 2003–49, Johannes Kepler University Linz, Spezialforschungsbereich F013, November 2003Google Scholar
- 7.Maletzky, A.: Exploring reduction ring theory in theorema. Technical report 2016–06, Doctoral Program “Computational Mathematics”, Johannes Kepler University Linz, Austria, July 2015Google Scholar
- 8.Maletzky, A.: Verifying Buchberger’s algorithm in reduction rings. In: Jebelean, T., Wang, D. (eds.) Proceedings of PAS 2015 (Program Verification, Automated Debugging and Symbolic Computation, Beijing, China, 21–23 October 2015. arXiv:1604.08736
- 11.Robbiano, L.: Term orderings on the polynomial ring. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol. 204, pp. 513–517. Springer, Heidelberg (1985)Google Scholar
- 16.Wiesinger-Widi, M.: Gröbner Bases and Generalized Sylvester Matrices. Ph.D. Thesis, Johannes Kepler University Linz (2015). http://epub.jku.at/obvulihs/content/titleinfo/776913
- 17.Windsteiger, W.: Building up hierarchical mathematical domains using functors in theorema. In: Armando, A., Jebelean, T. (eds.) Proceedings of Calculemus 1999, Trento, Italy. ENTCS, vol. 23, pp. 401–419. Elsevier, Amsterdam (1999)Google Scholar
- 18.Windsteiger, W.: Theorema 2.0: a system for mathematical theory exploration. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 49–52. Springer, Heidelberg (2014)Google Scholar
- 19.Winkler, F., Buchberger, B.: A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm. In: Colloqium on Algebra, Combinatorics and Logic in Computer Science, pp. 849–869 (1983)Google Scholar