Abstract
Search methods provide short and human readable proofs, i.e. with few algebra, of most of the theorems of the Euclidean plane. They are less succesful and convincing for incidence theorems of projective geometry, which has received less attention up to now. This is due to the fact that basic notions, like angles and distances, which are relevant for Euclidean geometry, are no more relevant for projective geometry. This article suggests that search methods can also provide short and human readable proofs of incidence theorems of projective geometry with well chosen notions, rules or lemmas. This article proposes such lemmas, and show that they indeed permit to find by hand short proofs of some theorems of projective geometry.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apel, S., Richter-Gebert, J.: Cancellation patterns in automatic geometric theorem proving. Talk at ADG 2010, Munich, Germany (July 2010)
Chou, S.C., Gao, X.S., Zhang, J.Z.: Automated generation of readable proofs with geometric invariants, ii. theorem proving with full-angles. J. Automated Reasoning 17, 325–347 (1996)
Chou, S.-C., Gao, X.-S., Zhang, J.-Z.: A deductive database approach to automated geometry theorem proving and discovering. J. Autom. Reason. 25, 219–246 (2000)
Coxeter, H.: Projective Geometry. Springer, Heidelberg (1987)
Gao, X.-S.: Chapter 10: Search methods revisited. In: Gao, X.-S., Wang, D. (eds.) Mathematics Mechanization and Application, pp. 253–272. Academic Press (2000)
Gelernter, H.: Realization of a geometry theorem proving machine. In: IFIP Congress, pp. 273–281 (1959)
Gelernter, H.: Realization of a geometry-theorem proving machine. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning 1: Classical Papers on Computational Logic 1957-1966, pp. 99–122. Springer, Heidelberg (1983)
Gelernter, H., Hansen, J.R., Loveland, D.W.: Empirical explorations of the geometry-theorem proving machine. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning 1: Classical Papers on Computational Logic 1957-1966, pp. 140–150. Springer, Heidelberg (1983)
Magaud, N., Narboux, J., Schreck, P.: Formalizing Desargues’ theorem in Coq using ranks. In: Shin and Ossowski [16], pp. 1110–1115
Michelucci, D., Foufou, S.: Interrogating witnesses for geometric constraints solving. In: ACM Conf. Solid and Physical Modelling, San Francisco, pp. 343–348 (2009)
Michelucci, D., Schreck, P.: Incidence constraints: a combinatorial approach. Int. J. Comput. Geometry Appl. 16(5-6), 443–460 (2006)
Michelucci, D., Schreck, P., Thierry, S.E.B., Fünfzig, C., Génevaux, J.-D.: Using the witness method to detect rigid subsystems of geometric constraints in CAD. In: SPM 2010: Proceedings of the ACM Conference on Solid and Physical Modeling, Haïfa, Israël. ACM (September 2010)
Pouzergues, R.: Les hexamys, web document (2002) (in French)
Richter-Gebert, J.: Meditations on Ceva’s theorem. In: Davis, C., Ellers, E. (eds.) The Coxeter Legacy: Reflections and Projections, pp. 227–254. Fields Institute American Mathematical Society (2006)
Richter-Gebert, J.: Perspectives on Projective Geometry: A Guided Tour Through Real and Complex Geometry. Springer, Heidelberg (2011)
Shin, S.Y., Ossowski, S. (eds.): Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12. ACM (2009)
Wilson, S., Fleuriot, J.D.: Combining dynamic geometry, automated geometry theorem proving and diagrammatic proofs. In: Proceedings of the European Joint Conferences on Theory and Practice of Software (ETAPS) Satellite Workshop on User Interfaces for Theorem Provers (UITP), Edinburgh, UK (April 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michelucci, D. (2011). Some Lemmas to Hopefully Enable Search Methods to Find Short and Human Readable Proofs for Incidence Theorems of Projective Geometry. In: Schreck, P., Narboux, J., Richter-Gebert, J. (eds) Automated Deduction in Geometry. ADG 2010. Lecture Notes in Computer Science(), vol 6877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25070-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-25070-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25069-9
Online ISBN: 978-3-642-25070-5
eBook Packages: Computer ScienceComputer Science (R0)