Abstract
We consider geometry theorems whose premises and statement comprise a set of bisector conditions. Each premise and the statement can be represented as the rows of a “bisector matrix”: one with three non zero elements per row, one element with value -2 and the others with value 1. The existence of a theorem corresponds to rank deficiency in this matrix. Our method of theorem discovery starts with identification of rank deficient bisector matrices. Some such matrices can be represented as graphs whose vertices correspond to matrix rows and whose edges correspond to matrix columns. We show that if a bisector matrix which can be represented as a graph is rank deficient, then the graph is bicubic. We give an algorithm for finding the rank deficient matrices for a Hamiltonian bicubic graph, and report on the results for graphs with 6,8,10 and 12 vertices. We discuss a method of deriving rank deficient bisector matrices with more than 2 non-zero elements. We extend the work to matrices containing rows corresponding to angle trisectors.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Data Availability
Not applicable.
Code Availability
Not applicable.
References
Botana, F., Hohenwarter, M., Janičić, P., Kovács, Z., Petrović, I., Recio, T., Weitzhofer, S.: Automated theorem proving in geogebra: Current achievements. J. Autom. Reason. 55(1), 39–59 (2015). https://doi.org/10.1007/s10817-015-9326-4
Botana, F., Kovács, Z., Recio, T.: Towards an automated geometer. In: International Conference on Artificial Intelligence and Symbolic Computation, pp. 215–220. Springer (2018). https://doi.org/10.1007/978-3-319-99957-9_15
Botana, F., Kovács, Z., Recio, T.: A mechanical geometer. Math. Comput. Sci. 15(4), 631–641 (2021). https://doi.org/10.1007/s11786-020-00497-7
Bussemaker, F., Cobeljic, S., Cvetkpvic, D.M., Seidel, J.J.: Computer investigation of cubic graphs (1976). T.H. Report 76-WSK-01, Department of Mathematics, Technological University Eindhoven, The Netherlands
Chou, S.C.: Mechanical geometry theorem proving. Springer, Dordrecht (1988). https://doi.org/10.1007/978-94-009-4037-6
Chou, S.C., Gao, X.S., Zhang, J.: Machine proofs in geometry: Automated production of readable proofs for geometry theorems. World Scientific, Singapore (1994). https://doi.org/10.1142/2196
Chou, S.C., Gao, X.S., Zhang, J.Z.: Automated generation of readable proofs with geometric invariants. J. Autom. Reason. 17(3), 325–347 (1996). https://doi.org/10.1007/BF00283133
Conway, J.: On morley’s trisector theorem. Math. Intell. 36(3), 3–3 (2014). https://doi.org/10.1007/s00283-014-9463-3
Gao, H., Goto, Y., Cheng, J.: A set of metrics for measuring interestingness of theorems in automated theorem finding by forward reasoning: a case study in nbg set theory. In: International Conference on Intelligent Science and Big Data Engineering, pp. 508–517. Springer (2015). https://doi.org/10.1007/978-3-319-23862-3_50
Gao, H., Li, J., Cheng, J.: Measuring interestingness of theorems in automated theorem finding by forward reasoning based on strong relevant logic. In: 2019 IEEE International Conference on Energy Internet (ICEI), pp. 356–361. IEEE (2019). https://doi.org/10.1109/ICEI.2019.00069
Karamzadeh, O.A.S.: Is the mystery of the morley’s trisector theorem resolved. In: Forum Geometricorum, vol. 18, pp. 297–306 (2018)
Kovács, Z.: Discovering geometry theorems in regular polygons. In: International Conference on Artificial Intelligence and Symbolic Computation, pp. 155–169. Springer (2018). https://doi.org/10.1007/978-3-319-99957-9_10
Kutzler, B., Stifter, S.: On the application of buchberger’s algorithm to automated geometry theorem proving. J. Symb. Comput. 2(4), 389–397 (1986). https://doi.org/10.1016/S0747-7171(86)80006-2
Read, R.C., Wilson, R.J.: An atlas of graphs, vol. 21. Clarendon Press, Oxford (1998)
Saunders, B.D.: Matrices with two nonzero entries per row. In: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pp. 323–330 (2015). https://doi.org/10.1145/2755996.2756679
Sloane, N.J., et al.: Sequences a006823/m1450 in the on-line encyclopedia of integer sequences. Published electronically at https://oeis.org (2018)
Todd, P.: A symbolic dynamic geometry system using the analytical geometry method. Math. Comput. Sci. 14(4), 693–726 (2020). https://doi.org/10.1007/s11786-020-00490-0
Wen-Tsun, W.: Basic principles of mechanical theorem proving in elementary geometries. J. Autom. Reason. 2(3), 221–252 (1986). https://doi.org/10.1007/BF02328447
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Ethics approval
Not applicable.
Consent to participate
Not applicable.
Consent for publication
Not applicable.
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Todd, P. Automated discovery of angle theorems. Ann Math Artif Intell 91, 753–778 (2023). https://doi.org/10.1007/s10472-023-09841-6
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-023-09841-6