Automated Geometric Theorem Proving, Clifford Bracket Algebra and Clifford Expansions
We report some of our recent progress on using Clifford bracket algebra to simplify automated geometric theorem-proving via the homogeneous model, and on systematic expansions of Clifford expressions with the purpose of finding the shortest expansions. With such simplification and expansion techniques, we are able to finish some pure geometric computation tasks that are too difficult for other algebraic methods to finish even with the aid of a good PC, and we get better results through a readable procedure.
KeywordsAutomated theorem-proving Clifford algebra bracket algebra invariant theory geometric computation.
Mathematics Subject Classification (2000)51K05 14L24 15A66 15A72
Unable to display preview. Download preview PDF.
- R. Ablamowicz. CLIFFORD, Maple package http://www.math.tntech.edu/rafal
- P. Bravi and A. Brini. Remarks on Invariant Geometric Calculus, Cayley-Grassmann Algebras and Geometric Clifford Algebras. Manuscript.Google Scholar
- E. Caianiello. Combinatorics and Renormalization in Quantum Field Theory. Benjamin, Reading, MA, 1973.Google Scholar
- H. Crapo and J. Richter-Gebert. Automatic Proving of Geometric Theorems. In: Invariant Methods in Discrete and Computational Geometry, N. White (ed.), pp. 107–139, Kluwer Academic Publishers, 1994.Google Scholar
- H. Li. New Explorations in Automated Theorem Proving in Geometries, Ph. D. dissertation, Peking Univ., Beijing, 1994.Google Scholar
- H. Li, D. Hestenes and A. Rockwood. Generalized Homogeneous Coordinates for Computational Geometry. In Geometric Computing with Clifford Algebras, G. Sommer (ed.), pp. 27–60, Springer, Heidelberg, 2001.Google Scholar
- W. T. Wu. Basic Principles of Mechanical Theorem Proving in Geometries,Volume I: Part of Elementary Geometries. Science Press, Beijing 1984; Springer 1994.Google Scholar