A program to create new geometry proof problems

In a previous paper Todd (Submitted to AMAI, 2022), linear systems corresponding to sets of angle bisector conditions are analyzed. In a system which is not full rank, one bisector condition can be derived from the others. In that paper, we describe methods for finding such rank deficient linear systems. The vector angle bisector relationship may be interpreted geometrically in a number of ways: as an angle bisector, as a reflection, as an isosceles triangle, or as a circle chord. A rank deficient linear system may be interpreted as a geometry theorem by mapping each vector angle bisector relationship onto one of these geometrical representations. In Todd (Submitted to AMAI, 2022) we illustrate the step from linear system to geometry theorem with a number of by-hand constructed examples. In this paper, we present an algorithm which automatically generates a geometry theorem from a starting point of a linear system of the type identified in Todd (Submitted to AMAI, 2022). Both statement and diagram of the new theorem are generated by the algorithm. Our implementation creates a simple text description of the new theorem and utilizes the Mathematica GeometricScene to form a diagram.