Abstract
In this paper, methods for the algebraic decision problem of mechanical theorem proving in elementary geometry are described on the basis of some elimination procedures for polynomial systems. The methods can determine whether or not a geometric theorem is generically true and whether it is true or false for each of the components including degenerate ones, with projection and irreducible decomposition. Theorems which have been proved using an implementation of the methods in Maple include the Simson Theorem, Butterfly Theorem, Secant Theorem, Feuerbach Theorem, Steiner Theorem, Steiner-Lehmus Theorem, Morely Theorem and Thébault-Taylor Theorem, of which some are taken as illustrative examples in the paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Carrà Ferro and G. Gallo, A procedure to prove geometrical statements, in:Proc. AAECC-5, Lecture Notes in Comp. Sci. 356(1987)141–150.
S.C. Chou,Mechanical Geometry Theorem Proving (Reidel, Dordrecht/Boston/Lancaster/Tokyo, 1988).
S.C. Chou and X.S. Gao, A class of geometry statements of constructive type and geometry theorem proving, Technical Report TR-89-37, Department of Computer Sciences, University of Texas at Austin, USA (1989).
S.C. Chou and X.S. Gao, Ritt-Wu's decomposition algorithm and geometry theorem proving, in:Proc. CADE-10, Lecture Notes in Comp. Sci. 449(1990)207–220.
S.C. Chou and J.G. Yang, On the algrebraic formulation of certain geometry statements and mechanical geometry theorem proving, Algorithmica 4(1989)237–262.
X.S. Gao, Transcendental functions and mechanical theorem proving in elementary geometries, J. Automated Reasoning 6(1990)403–417.
S. Hu and D.M. Wang, Fast factorization of polynomials over rational number field or its extension fields, Kexue Tongbao 31(1986)150–156.
M. Kalkbrener, A generalized Euclidean algorithm for geometry theorem proving, Technical Report 92-15, MSI, Cornell University, USA (1992).
D. Kapur, Using Gröbner bases to reason about geometry problems, J. Symbolic Comp. 2(1986)399–408.
D. Kapur, A refutational approach to geometry theorem proving, Artificial Intelligence 37(1988)61–93.
D. Kapur and H.K. Wan, Refutational proofs of geometry theorems via characteristic set computation, in:Proc. ISSAC '90, Tokyo, Japan, 1990, pp. 277–284.
H.P. Ko, Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle, Artificial Intelligence 37(1988)95–122.
H.P. Ko and S.C. Chou, Polynomial triangulation for pseudo common divisors, Technical Report 85CRD242, General Electric Company, USA (1985).
B. Kutzler and S. Stifter, On the application of Buchberger's algorithm to automated geometry theorem proving, J. Symbolic Comp. 2(1986)389–397.
J.F. Ritt,Differential Algebra (Amer. Math. Soc., New York, 1950).
A. Seidenberg, Some remarks on Hilbert's Nullstellensatz, Arch. Math. 7(1956)235–240.
A. Seidenberg, An elimination theory for differential algebra, Univ. California Publ. Math. (N.S.) 3(2)(1956)31–66.
D.M. Wang, On Wu's method for proving constructive geometric theorems, in:Proc. IJCAI-89, Detroit, Michigan, 1989, pp. 419–424.
D.M. Wang, Reasoning about geometric problems using algebraic methods, in:Proc. Medlar 24-Month Workshop, Grenoble, 1991 (DOC, Imperial College, University of London, UK).
D.M. Wang, A method for factorizing multlvariate polynomials over successive algebraic extension fields, Preprint, RISC-LINZ, Johannes Kepler University, Austria (1992).
D.M. Wang, An elimination method based on Seidenberg's theory and its application, in:Computational Algebraic Geometry, Progress in Mathematics 109 (Birkhäuser, Boston, 1993) pp. 301–328.
D.M. Wang, An elimination method for polynomial systems, J. Symbolic Comp. 16(1993) 83–114.
D.M. Wang, Algebraic factoring and geometry theorem proving, in:Proc. CADE-12, Lecture Notes in Comp. Sci. 814(1994)386–400.
D.M. Wang and X.S. Gao, Geometry theorems proved mechanically using Wu's method — Part on Euclidean geometry, MM Research Preprints 2, Academia Sinica, China (1987) pp. 75–106.
F. Winkler, Gröbner bases in geometry theorem proving and simplest degeneracy conditions, Mathematica Pannonica 1(1990)15–32.
W.T. Wu, On the decision problem and the mechanization of theorem-proving in elementary geometry, Sci. Sinica 21(1978)159–172. Also in: Automated theorem proving after 25 years, Contemp. Math. 29(1984)213–234.
W.T. Wu, Basic principles of mechanical theorem proving in elementary geometries, J. Sys. Sci. Math. Sci. 4(1984)207–235; J. Automated Reasoning 2(1986)221–252.
W.T. Wu, On reducibility problems in mechanical theorem proving of elementary geometries, Chinese Quart. J. Math. 2(1987)1–20.
W.T. Wu, On a projection theorem of quasi-varieties in elimination theory, Chinese Ann. Math. Ser. B 11(2)(1990)220–226.
W.T. Wu,Mechanical Theorem Proving in Geometries: Basic Principles, translated from Chinese by X. Jin and D. Wang (Springer, Wien/New York, 1994).
L. Yang and J.Z. Zhang, Searching dependency between algebraic equations: An algorithm applied to automated reasoning, MM Research Preprints 7(1992)105–114.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, D. Elimination procedures for mechanical theorem proving in geometry. Ann Math Artif Intell 13, 1–24 (1995). https://doi.org/10.1007/BF01531321
Issue Date:
DOI: https://doi.org/10.1007/BF01531321