Abstract
We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process of solving-computing-proving. The whole process is realized by a computational origami system being developed by us. During the computational origami construction, geometric constraints in symbolic and numeric representation are generated and accumulated. Those constraints are then transformed into algebraic relations, which in turn are used to prove the correctness of the construction. The automated proof required non-trivial amount of computer resources, and shows the necessity of networked services of mathematical software. This example is considered to be a case study for innovative mathematical knowledge management.
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
Alperin, R.C.: A Mathematical Theory of Origami Constructions and Numbers. New York Journal of Mathematics 6, 119–133 (2000)
Bogomolny, A.: Morley’s Miracle. ©1996-2005, http://www.cut-the-knot.org/triangle/Morley
Buchberger, B.: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes mathematicae 4(3), 374–383 (1970)
Buchberger, B., Dupre, C., Jebelean, T., Kriftner, F., Nakagawa, K., Văsaru, D.: The Theorema Project: A Progress Report. In: Kerber, M., Kohlhase, M. (eds.) Symbolic Computation and Automated Reasoning: The Calculemus-2000 Symposium, St. Andrews, Scotland, pp. 98–113 (August 6-7 2000)
Chen, T.L.: Proof of the impossibility of trisecting an angle with euclidean tools. Mathematics Magazine 39, 239–241 (1966)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 2nd edn. newblock Springer, Heidelberg (1997)
Ţepeneu, D., Ida, T.: MathGridLink-Connecting Mathematica to the Grid. In: Proceedings of the 6th International Mathematica Symposium (IMS 2004) (2004)
Fushimi, K.: Science of Origami. A supplement to Saiensu (in Japanese) (October 1980)
Geretschläger, R.: Geometric Constructions in Origami. Morikita Publishing Co. (2002) in Japanese, translation by Hidetoshi Fukagawa
Haga, K.: Origamics Part I: Fold a Square Piece of Paper and Make Geometrical Figures (in Japanese). Nihon Hyoronsha (1999)
Hatori, K.: K’s origami - fractional library - origami construction (2005), http://origami.ousaan.com/library/conste.html
Hull, T.: Origami and geometric constructions (2005), http://www.merrimack.edu/~thull/omfiles/geoconst.html
Huzita, H.: Axiomatic Development of Origami Geometry. In: Proceedings of the First International Meeting of Origami Science and Technology, pp. 143–158 (1989)
Ida, T., Buchberger, B.: Proving and Solving in Computational Origami. In: Analele Universitatii din Timisoara. Fasc. Special of Mathematica-Informatica, vol. XLI, pp. 247–263 (2003)
Ida, T., Takahashi, H., Ţepeneu, D., Marin, M.: Morley’s Theorem Revisited through Computational Origami. In: Proceedings of the 7th International Mathematica Symposium, IMS 2005 (2005)
Takahashi, H., Ţepeneu, D., Ida, T.: A System for Computational Origami progress report. In: Proceedings of the 6th International Mathematica Symposium (IMS 2004) (2004)
Wang, D.: Elimination Practice: Software Tools and Applications. Imperial College Press, London (2004)
Wu, W.T.: Basic principles of mechanical theorem proving in elementary geometry. Journal of Automated Reasoning 2, 221–252 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ida, T., Takahashi, H., Marin, M. (2006). Computational Origami of a Morley’s Triangle. In: Kohlhase, M. (eds) Mathematical Knowledge Management. MKM 2005. Lecture Notes in Computer Science(), vol 3863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618027_18
Download citation
DOI: https://doi.org/10.1007/11618027_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31430-1
Online ISBN: 978-3-540-31431-8
eBook Packages: Computer ScienceComputer Science (R0)