Symbolic Geometric Reasoning with Advanced Invariant Algebras

  • Hongbo LiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9582)


In symbolic geometric reasoning, the output of an algebraic method is expected to be geometrically interpretable, and the size of the middle steps is expected to be sufficiently small for computational efficiency. Invariant algebras often perform well in meeting the two expectations for relatively simple geometric problems. For example in classical geometry, symbolic manipulations based on basic invariants such as squared distances, areas and volumes often have great performance in generating readable proofs. For more complicated geometric problems, the basic invariants are still insufficient and may not generate geometrically meaningful results.

An advanced invariant is a monomial in an “advanced algebra”, and can be expanded into a polynomial of basic invariants that are also included in the algebra. In projective incidence geometry, Grassmann-Cayley algebra and Cayley bracket algebra are an advanced algebra in which the basic invariants are determinants of homogeneous coordinates of points, and the advanced invariants are Cayley brackets. In Euclidean conformal geometry, Conformal Geometric Algebra and null bracket algebra are an advanced algebra where the basic invariants are squared distances between points and and signed volumes of simplexes, and the advanced invariants are Clifford brackets.

This paper introduces the above advanced invariant algebras together with their applications in automated geometric theorem proving. These algebras are capable of generating extremely short and readable proofs. For projective incidence theorems, the proofs generated are usually two-termed in that the conclusion expression maintains two-termed during symbolic manipulations. For Euclidean geometry, the proofs generated are mostly one-termed or two-termed.


Grassmann-Cayley algebra Cayley bracket algebra Conformal Geometric Algebra Null bracket algebra Automated geometric theorem proving 


  1. 1.
    Blumenthal, L.M.: Theory and Applications of Distance Geometry. Cambridge University Press, Cambridge (1953)zbMATHGoogle Scholar
  2. 2.
    Bokowski, J., Sturmfels, B.: Computational Synthetic Geometry. LNM, vol. 1355. Springer, Heidelberg (1989)zbMATHGoogle Scholar
  3. 3.
    Buchberger, B.: Application of Gröbner basis in non-linear computational geometry. In: Rice, J. (ed.) Scientific Software. Springer, New York (1988)Google Scholar
  4. 4.
    Chou, S.C., Gao, X.S., Zhang, J.Z.: Machine Proofs in Geometry. World Scientific, Singapore (1994)zbMATHGoogle Scholar
  5. 5.
    Crapo, H., Richter-Gebert, J.: Automatic proving of geometric theorems. In: White, N. (ed.) Invariant Methods in Discrete and Computational Geometry, pp. 107–139. Kluwer, Dordrecht (1994)Google Scholar
  6. 6.
    Hestenes, D., Sobczyk, G.: Clifford Algebra to Geometric Calculus. Kluwer, Dordrecht (1984)CrossRefzbMATHGoogle Scholar
  7. 7.
    Li, H.: New Explorations of Automated Theorem Proving in Geometries. Ph.D. Thesis, Peking University, Beijing (1994)Google Scholar
  8. 8.
    Li, H.: Vectorial equation-solving for mechanical geometry theorem proving. J. Autom. Reasoning 25, 83–121 (2000)CrossRefzbMATHGoogle Scholar
  9. 9.
    Li, H., Hestenes, D., Rockwood, A.: Generalized homogeneous coordinates for computational geometry. In: Sommer, G. (ed.) Geometric Computing with Clifford Algebras, pp. 27–60. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Li, H., Wu, Y.: Automated short proof generation in projective geometry with cayley and bracket algebras I. Incidence geometry. J. Symbolic Comput. 36(5), 717–762 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Li, H.: A recipe for symbolic geometric computing: long geometric product, BREEFS and clifford factorization. In: Brown, C.W. (ed.) Proceedings of the ISSAC 2007, pp. 261–268. ACM, New York (2007)Google Scholar
  12. 12.
    Li, H.: Invariant Algebras and Geometric Reasoning. World Scientific, Singapore (2008)CrossRefzbMATHGoogle Scholar
  13. 13.
    Li, H., Huang, L., Liu, Y.: Normalization of quaternionic polynomials. arxiv: 1301.5338v1 [math.RA] (2013)
  14. 14.
    Li, H.: Normalization of Polynomials in Algebraic Invariants of Three-Dimensional Orthogonal Geometry. arxiv: 1302.7194v1 [cs.SC] (2013)
  15. 15.
    Li, H., Shao, C., Huang, L., Liu, Y.: Reduction among bracket polynomials. In: Proceedings of the ISSAC 2014, pp. 304–311. ACM Press (2014)Google Scholar
  16. 16.
    Li, H., Huang, L., Shao, C., Dong, L.: Three-Dimensional Projective Geometry with Geometric Algebra. arxiv: 1507.06634v1 [math.MG] (2015)
  17. 17.
    Liu, Y.: Normalization of Quaternionic-Variable Polynomials, Ph.D. Dissertation, AMSS, Chinese Academy of Sciences, May 2015Google Scholar
  18. 18.
    Mourrain, B., Stolfi, N.: Computational symbolic geometry. In: White, N.L. (ed.) Invariant Methods in Discrete and Computational Geometry, pp. 107–139. D. Reidel, Dordrecht (1995)CrossRefGoogle Scholar
  19. 19.
    White, N.: Multilinear Cayley factorization. J. Symbolic Comput. 11, 421–438 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Winkler, F.: Gröbner bases in geometry theorem proving and simplest degeneracy conditions. Math. Pannonica 1(1), 15–32 (1990)zbMATHGoogle Scholar
  21. 21.
    Wu, W.T.: Basics Principles of Mechanical Theorem Proving in Geometries I: Part of Elementary Geometries. Science Press, Beijing (1984). Springer, Wien (1994)Google Scholar
  22. 22.
    Young, A.: The Collected Papers of Alfred Young, 1873–1940. University of Toronto Press, Toronto (1977)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Key Laboratory of Mathematics MechanizationAcademy of Mathematics and Systems Science, Chinese Academy of SciencesBeijingChina

Personalised recommendations