Abstract
We consider geometric theorems that can be stated constructively by introducing points, while each newly introduced point may be represented in terms of the previously constructed points using Clifford algebraic operators. To prove a concrete theorem, one first substitutes the expressions of the dependent points into the conclusion Clifford polynomial to obtain an expression that involves only the free points and parameters. A term-rewriting system is developed that can simplify such an expression to 0, and thus prove the theorem. A large class of theorems can be proved effectively in this coordinate-free manner. This paper describes the method in detail and reports on our preliminary experiments.
Supported by CEC under Reactive LTR Project 21914 (CUMULI) and a project of LIAMA.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ablamowicz, R., Lounesto, P., Parra J. M.: Clifford algebras with numeric and symbolic computations. BirkhÄuser, Boston (1996).
Balbiani, P., Fariñas del Cerro, L.: Affine geometry of collinearity and conditional term rewriting. In: Proc. French Spring School Theor. Comput. Sci. (Font-romeu, May 17–21, 1993), LNCS 909, pp. 196–213 (1995).
Chou, S.-C: Mechanical geometry theorem proving. Reidel, Dordrecht (1988).
Chou, S.-C., Schelter, W. F.: Proving geometry theorems with rewrite rules. J. Automat. Reason. 2: 253–273 (1986).
Chou, S.-C., Gao, X.-S., Zhang, J.-Z.: Automated geometry theorem proving by vector calculation. In: Proc. ISSAC '93 (Kiev, July 6–8, 1993), pp. 284–291.
Chou, S.-C., Gao, X.-S., Zhang, J.-Z.: Machine proofs in geometry. World Scientific, Singapore (1994).
Contejean, E., Marché, C., Rabehasaina, L.: Rewrite systems for natural, integral and rational arithmetic. Technical report, L.R.I., Université de Paris-Sud, France (1997).
Fèvre, S.: Integration of reasoning and algebraic calculus in geometry. In: Automated deduction in geometry (D. Wang et al., eds.), LNAI 1360, pp. 218–234 (1998).
Havel, T. F.: Some examples of the use of distances as coordinates for Euclidean geometry. J. Symb. Comput. 11: 579–593 (1991).
Hestenes, D., Sobczyk, G.: Clifford algebra to geometric calculus. Reidel, Dordrecht (1984).
Kapur, D.: Using Gröbner bases to reason about geometry problems. J. Symb. Comput. 2: 399–408 (1986).
Kapur, D., Saxena, T., Yang, L.: Algebraic and geometric reasoning using Dixon resultants. In: Proc. ISSAC '94 (Oxford, July 20–22, 1994), pp. 99–107.
Kutzler, B., Stifter, S.: On the application of Buchberger's algorithm to automated geometry theorem proving. J. Symb. Comput. 2: 389–397 (1986).
Li, H.: New explorations on mechanical theorem proving of geometries. Ph.D thesis, Beijing University, China (1994).
Li, H., Cheng, M.-t.: Proving theorems in elementary geometry with Clifford algebraic method. Chinese Math. Progress 26: 357–371 (1997).
Marché, C.: Normalized rewriting: An alternative to rewriting modulo a set of equations. J. Symb. Comput. 3: 253–288 (1996).
Richter-Gebert, J.: Mechanical theorem proving in projective geometry. Ann. Math. Artif. Intell. 13: 139–172 (1995).
Stifter, S.: Geometry theorem proving in vector spaces by means of Gröbner bases. In: Proc. ISSAC '93 (Kiev, July 6–8, 1993), pp. 301–310.
Wang, D.: Elimination procedures for mechanical theorem proving in geometry. Ann. Math. Artif. Intell. 13: 1–24 (1995).
Wang, D.: Clifford algebraic calculus for geometric reasoning with application to computer vision. In: Automated deduction in geometry (D. Wang et al., eds.), LNAI 1360, pp. 115–140 (1998).
Wu, W.-t.: Basic principles of mechanical theorem proving in elementary geometries. J. Syst. Sci. Math. Sci. 4: 207–235 (1984).
Wu, W.-t.: Mechanical theorem proving in geometries: Basic principles. Springer, Wien (1994).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fèvre, S., Wang, D. (1998). Proving geometric theorems using clifford algebra and rewrite rules. In: Kirchner, C., Kirchner, H. (eds) Automated Deduction — CADE-15. CADE 1998. Lecture Notes in Computer Science, vol 1421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054242
Download citation
DOI: https://doi.org/10.1007/BFb0054242
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64675-4
Online ISBN: 978-3-540-69110-5
eBook Packages: Springer Book Archive