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.
[1]
B. Sturmfels.
Computational Synthetic Geometry
,
1989
.
[2]
B. Mourrain,et al.
Computational Symbolic Geometry
,
1995
.
[3]
Hongbo Li,et al.
Vectorial Equations Solving for Mechanical Geometry Theorem Proving
,
2000,
Journal of Automated Reasoning.
[4]
Hongbo Li,et al.
Automated short proof generation for projective geometric theorems with Cayley and bracket algebras: II. Conic geometry
,
2003,
J. Symb. Comput..
[5]
Neil L. White,et al.
Multilinear Cayley Factorization
,
1991,
J. Symb. Comput..
[6]
Lei Huang,et al.
Reduction among bracket polynomials
,
2014,
ISSAC.
[7]
Leonard M. Blumenthal,et al.
Theory and applications of distance geometry
,
1954
.
[8]
Henry Crapo,et al.
Automatic Proving of Geometric Theorems
,
1995
.
[9]
Hongbo Li.
Invariant Algebras and Geometric Reasoning
,
2008
.
[10]
David Hestenes,et al.
Generalized homogeneous coordinates for computational geometry
,
2001
.
[11]
Wenjun Wu,et al.
Mechanical Theorem Proving in Geometries
,
1994,
Texts and Monographs in Symbolic Computation.
[12]
Yue Liu,et al.
Normalization of Quaternionic Polynomials
,
2013,
1301.5338.
[13]
Hongbo Li.
A recipe for symbolic geometric computing: long geometric product, BREEFS and Clifford factorization
,
2007,
ISSAC '07.