- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Volume 2013 (2013), Article ID 897320, 4 pages
Subdividing the Trefoil by Origami
Department of Mathematics, Case Western Reserve University, Cleveland, OH 44106-7058, USA
Received 7 November 2012; Accepted 21 November 2012
Academic Editor: Michel Planat
Copyright © 2013 Joel C. Langer and David A. Singer. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
In 2005, David Cox and Jerry Shurman proved that the curves they call -clovers can be subdivided into equal lengths (for certain values of ) by origami, in the cases where , 2, 3, and 4. In this paper, we expand their work to include the 6-clover.
1. Historical Background
From antiquity, it was known that regular polygons with sides could be constructed with compass and (unmarked) straightedge for of one of the forms , and . In 1801, Gauss showed that the list could be expanded to include powers of two times any product of distinct Fermat primes, primes of the form . He claimed to have a proof of the converse statement, but as Pierpont noted (, p.79), he never actually provided it. Pierpont gives an elementary proof (i.e., without Galois theory) in his paper.
In 1837, the French mathematician Pierre Wantzel resolved three celebrated ancient mathematical problems definitively, when he proved the impossibility of trisecting an arbitrary angle, duplicating the cube, or constructing a regular polygon with sides for values of other than those of Gauss using only a compass and (unmarked) straightedge.
Remarkably, these same constructions can be achieved by the technique of origami (paper folding). In fact, using origami, it is also possible to trisect angles, duplicate cubes, and generally construct roots of cubic equations. This was observed by Beloch in a publication in 1936 . An explication of Beloch’s work, including a survey of the history, can be found in .
Alternatively, with a marked straightedge, one can achieve the same result. Generalizing the notion of construction to include this or an equivalent tool and using Galois theory , the values of for which a regular polygon can be constructed consist of all numbers of the form where and are distinct primes of the form with , . Such primes are known as Pierpont primes.
Meanwhile, Abel showed in 1828 that the lemniscate can also be divided into pieces of equal length with straightedge and compass for the same values of as for the circle. See  for a modern proof of this result, including the converse; see also .
The 2005 paper of Cox and Shurman  expands the family of divisible curves to include the clover. The -clover is the plane curve defined by the polar equation: where is a positive integer. This is a subfamily of the sinusoidal or sinus spirals (, p.194). For , the curve is the cardioid; is the circle; is the clover; is the Bernoulli lemniscate. In their paper, they prove that these first four curves can be divided into arcs of equal length by origami (paper-folding) construction for certain values of , as follows.
Theorem 1 (see ). For any , the cardioid can be divided into arcs of equal length by straightedge and compass. The circle can be divided into equal lengths by origami if and only if where , and are distinct Pierpont primes. In the case of the lemniscate, the Pierpont primes must satisfy or . The clover can be divided into equal lengths by origami if and only if where , and are distinct Pierpont primes such that , , or .
There are only five Fermat primes known, but more than 4000 Pierpont primes have been found; as of June 2012, the largest known Pierpont prime is , which has 2117338 digits. (; 16th on the list of largest primes.) See  for up-to-date information.
In this paper, we observe that these results on origami construction can be extended to the case , the trefoil. See Figure 1.
Theorem 2. The trefoil can be divided into equal lengths by origami if and only if where , and are distinct Pierpont primes such that , , or .
Cox and Shurman define the m-clover function by ; here is the arclength, the radial distance from the origin, and is the length of one leaf of the -clover. The function is found by inverting the arclength integral: For and , these integrals are elementary. For and , these are elliptic integrals, and the corresponding -clover functions are elliptic functions. For , the integral is no longer an elliptic integral, and the corresponding clover function is not an elliptic function. However, is an elliptic function, and this turns out to be enough to prove Theorem 2.
Note. Practically all of the hard work can be found in , to which we refer the reader for the details of our arguments. For detailed information about Galois theory, especially its application to subdividing the lemniscate, see . A discussion of origami numbers can be found in .
2. Origami Constructibility
Viewing the plane as the complex numbers , the set of points which can be constructed by origami is the smallest subfield containing the rational numbers and closed under rational operations and under square roots and cube roots. If is a root of a polynomial of degree less than five with coefficients in , then itself is in . To subdivide a leaf of the trefoil into equal lengths, it suffices to show that the and coordinates of the division points are numbers in .
In their proof of the clover theorem, Cox and Shurman show that the values of the clover function lie in when with and where , and are distinct Pierpont primes such that , , or . This is the main fact we need to extend the result to the trefoil curve. If is in , then is also in , since satisfies the differential equation: Moreover, any rational expression in and is in .
3. The Trefoil Curve
The trefoil curve is given in polar coordinates by the equation The rectangular equation is
Thus, , and of course , from which we conclude the following.
Proposition 3. is origami constructible if and only if is origami constructible.
is origami constructible implies that is origami constructible.
From the polar coordinate formula, it is easy to derive the arclength formula in terms of (, p.686): Now, if we make the miraculous substitution then the following equations hold: Therefore, where
Proposition 4. is origami constructible if and only if is origami constructible.
Proof. If is in , then is the square root of an element of and, therefore, an element of . Conversely, if is in , then satisfies a cubic equation with coefficients in , so it is in .
The arclength parametrization of the curve can be derived using lines through the origin.
Letting , where is a parameter, we have and we may parametrize the curve by
If we then replace by , we have
Theorem 5. The coordinates of the arclength parametrization of the trefoil are rational expressions in the elliptic functions and .
4. Concluding Remarks
As is the case for the clover, also a leaf of the trefoil cannot be subdivided into, for example, three equal arcs using straightedge and compass. In fact, it can be shown that the circle of radius centered at the origin trisects each leaf of the trefoil. Construction of this circle amounts to the construction of the Delian number . In other words, the problem of trisecting one leaf of the trefoil is equivalent to the classical problem of duplication of the cube!
It is also worthwhile to note that the algebraic problem of division into equal pieces by radicals (i.e., solvability) was achieved for the circle by Gauss, for the lemniscate by Abel (with the help of Liouville after Abel’s untimely death), and likewise it holds for the clover and the trefoil.
- J. Pierpont, “On an undemonstrated theorem of the Disquisitiones Arithmetic,” Bulletin of the American Mathematical Society, vol. 2, no. 3, pp. 77–83, 1895.
- M. P. Beloch, “Sul metodo del ripiegamento della carta per la risouzione deiproblemi geometricic,” Periodico di Mathematiche Serie 4, vol. 16, pp. 104–108, 1936.
- T. C. Hull, “Solving cubics with creases: the work of Beloch and Lill,” American Mathematical Monthly, vol. 118, no. 4, pp. 307–315, 2011.
- D. A. Cox, Galois Theory, Pure and Applied Mathematics, John Wiley & Sons, Hoboken, NJ, USA, 2004.
- M. Rosen, “Abel's theorem on the lemniscate,” The American Mathematical Monthly, vol. 88, no. 6, pp. 387–395, 1981.
- V. Prasolov and Y. Solovyev, Elliptic Functions and Elliptic Integrals, vol. 170 of Translations of Mathematical Monographs, American Mathematical Society, Providence, RI, USA, 1997.
- D. A. Cox and J. Shurman, “Geometry and number theory on clovers,” American Mathematical Monthly, vol. 112, no. 8, pp. 682–704, 2005.
- C. Zwikker, The Advanced Geometry of Plane Curves and Their Applications, Dover, New York, NY, USA, 2005.
- C. Caldwell, Prime pages, http://primes.utm.edu/primes/lists/short.txt.
- N. J. A. Sloane, Ed., “The online encyclopedia of integer sequences,” http://oeis.org/A005109.
- R. C. Alperin, “A mathematical theory of origami constructions and numbers,” New York Journal of Mathematics, vol. 6, pp. 119–133, 2000.