Abstract
Automated theorem proving on inequalities is always considered as a difficult topic in the area of automated reasoning. The relevant algorithms depend fundamentally on real algebra and real geometry, and the computational complexity increases very quickly with the dimension, that is, the number of parameters. Some well-known algorithms are complete theoretically but inefficient in practice, which cannot verify non-trivial propositions in batches. A dimension-decreasing algorithm presented here can treat radicals efficiently and make the dimensions the lowest. Based upon this algorithm, a generic program called “BOTTEMA” was implemented on a personal computer. More than 1000 algebraic and geometric inequalities including hundreds of open problems have been verified in this way. This makes it possible to check a finite many inequalities instead of solving a global-optimization problem.
Similar content being viewed by others
References
Franklin J. Methods of Mathematical Economics. Springer-Verlag, New York, 1980, pp.222–223.
Tarski A. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 1951.
Seidenberg A. A new decision method for elementary algebra.Annals of Mathematics, 1954, 60: 365–371.
Collins G E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. InLecture Notes in Computer Science. Springer-Verlag, Berlin, 1975, 33: 134–183.
Wu W T. On the decision problem and the mechanization of theorem-proving in elementary geometry.Sci. Sinica, 1978, 21: 159–172.
Wu W T. Mechanical Theorem Proving in Geometries: Basic Principles. (translated from the Chinese by X. Jin and D. Wang), Springer, Wien New-York, 1994.
Chou S C. Mechanical Geometry Theorem Proving. D. Reidel Publishing Company, Amsterdam, 1988.
Wang D M. Elimination procedures for mechanical theorem proving in geometry.Ann. Math. Artif. Intell. 1995, 13: 1–24.
Kapur D. Automated geometric reasoning: Dixon resultants. Gröbner bases, and characteristic sets. Springer’s LNAI 1360, 1997, pp.1–36.
Buchberger B. Applications of Gröbner bases in non-liner computational geometry. InGeometric Reasoning, pp. 413–446. MIT Press, Cambridge, MA, 1989.
Buchberger B, Collins G E, Kutzler B. Algebraic methods for geometric reasoning.Annual Review of Computing Science, 1988, 3: 85–119.
Zhang J Z, Yang L, Deng M K. The parallel numerical method of mechanical theorem proving.Theoretical Computer Science, 1990, 74: 253–271.
Yang L, Zhang J Z, Li C Z. A prover for parallel numerical verification of a class of constructive geometry theorems. InProceedings of the 1992 International Workshop on Mathematics Mechanization, International Academic Publishers, 1992, pp.244–250.
Yang L, Zhang J Z, Hou X R. A criterion of dependency between algebraic equations and its applications. InProceedings of the 1992 International Workshop on Mathematics Mechanization, International Academic Publishers, 1992, pp.110–134.
Chou S C, Gao X S, Zhang J Z. Machine Proofs in Geometry. World Scientific Press, 1994.
Zhang J Z, Yang L, Gao X S, Chou S C. Automated generation of readable proofs in geometry.Chinese J. Computers 1995, 18(5): 380–393 (in Chinese).
Yang L, Gao X S, Chou S C, Zhang J Z. Automated production of readable proofs for theorems in non-Euclidean geometries. Springer’s LNAI 1360, 1997, pp.171–188.
Chou S C, Gao X S, Arnon D S. On the mechanical proof of geometry theorems involving inequalities.Advances in Computing Research, JAI Press Inc., 1992, 6: 139–181.
Chou S C, Gao X S, McPhee N. A combination of Ritt-Wu’s method and Collins’s method. InProc. of CADE-12, Springer-Verlag, 1994, pp.401–415.
W W T. On a finiteness theorem about problems involving inequalities.Sys. Sci. & Math. Scis., 1994, 7: 193–200.
W W T. On Global-Optimization Problems. InProc. ASCM’98 Lanzhou University Press, Lanzhou, 1998, pp.135–138.
Yang L, Hou X R, Zeng Z B. A complete discrimination system for polynomials.Science in China, Series E, 1996, 39(6): 628–646.
Yang L, Zhang J Z, Hou X R. Non-Linear Equation Systems and Automated Theorem Proving. (in Chinese), Shanghai Press of Science, Technology and Education, 1996, Shanghai.
Yang L, Xia B C Explicit criterion to determine the number of positive roots of a polynomial.MM Research Preprints, 1997, 15: 134–145.
Mitrinovic D S, Pecaric J E, Volenec V. Recent Advances in Geometric Inequalities. Kluwer Academic Publishers, 1989.
Yang L. Practical automated reasoning on inequalities: Generic programs for inequality proving and discovering. InProc. the Third Asian Technology Conference in Mathematics, Springer-Verlag, 1998, pp.24–35.
Yang L. A Dimension-Decreasing Algorithm with Generic Program for Automated Inequality Proving.High Technology Letters, (in Chinese), 1998 8(7): 20–25.
Bottema Oet al. Geometric Inequalities. Wolters-Noordhoff Publishing, Groningen, Netherland, 1969.
Yang L, Zhang J Z. Searching dependency between algebraic equations: An algorithm applied to automated reasoning. InArtificial Intelligence in Mathematics, Johnson J, McKee S, Vella A (eds.), Oxford Univ. Press, Oxford, 1994, pp.147–156.
Zhang J Z, Yang L, Hou X R. A criterion for dependency of algebraic equations with applications to automated theorem proving.Sci. China, Ser. A, 1994, 37: 547–554.
Janous W. Problem 1137.Crux Math. 1986, 12: 79, 177.
Shan Z. Geometric Inequality in China (ed.). Jiangsu Educational Publishing House, China, 1996. (in Chinese)
Kuang J C.Applied Inequalities (in Chinese). 2nd ed., Human Educational Publishing House, China, 1993.
Yang L, Zhang J Z, Zeng Z B. On the conjectures and computing for the first several Heilbronn’s numbers.Chin. Ann. Math., 1992, A 13(4): 439–451.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported in part by National ‘973’ Project of China and ‘95’ Key Project on Fundamental Research of Academia Sinica.
Yang Lu received his diploma in mathematics from Peking University in 1959. He is a Professor in computer science at Chengdu Institute of Computer Applications, Chinese Academy of Sciences. His major research interests include automated theorem proving, symbolic computation and intelligent software technology.
Rights and permissions
About this article
Cite this article
Yang, L. Recent advances in automated theorem proving on inequalities. J. Comput. Sci. & Technol. 14, 434–446 (1999). https://doi.org/10.1007/BF02948785
Issue Date:
DOI: https://doi.org/10.1007/BF02948785