Mathematical origami

Template:Short description

 File:Origami Phoenix.JPG
The discipline of origami or paper folding has received a considerable amount of mathematical study. Fields of interest include a given paper model's flat-foldability (whether the model can be flattened without damaging it), and the use of paper folds to solve up-to cubic mathematical equations. The discipline is often pursued by the use of washi paper.

## History

Template:Also
In 1893, Indian civil servant T. Sundara Rao published *Geometric Exercises in Paper Folding* which used paper folding to demonstrate proofs of geometrical constructions. This work was inspired by the use of origami in the kindergarten system. Rao demonstrated an approximate trisection of angles and implied construction of a cube root was impossible.

 File:Group1-Origami The Beloch Fold.png
In 1936 Margharita P. Beloch showed that use of the 'Beloch fold', later used in the sixth of the Huzita–Hatori axioms, allowed the general cubic equation to be solved using origami.

In 1949, R C Yeates' book "Geometric Methods" described three allowed constructions corresponding to the first, second, and fifth of the Huzita–Hatori axioms.

The Yoshizawa–Randlett system of instruction by diagram was introduced in 1961.

 File:Miura-Ori CP.svg
In 1980 was reported a construction which enabled an angle to be trisected. Trisections are impossible under Euclidean rules.

Also in 1980, Koryo Miura and Masamori Sakamaki demonstrated a novel map-folding technique whereby the folds are made in a prescribed parallelogram pattern, which allows the map to be expandable without any right-angle folds in the conventional manner. Their pattern allows the fold lines to be interdependent, and hence the map can be unpacked in one motion by pulling on its opposite ends, and likewise folded by pushing the two ends together. No unduly complicated series of movements are required, and folded *Miura-ori* can be packed into a very compact shape. In 1985 Miura reported a method of packaging and deployment of large membranes in outer space, and as late as 2012 this technique had become standard operating procedure for orbital vehicles.

 File:Group1-Origami Doubling the Cube .png
In 1986, Messer reported a construction by which one could double the cube, which is impossible with Euclidean constructions.

The first complete statement of the seven axioms of origami by French folder and mathematician Jacques Justin was written in 1986, but were overlooked until the first six were rediscovered by Humiaki Huzita in 1989. The first International Meeting of Origami Science and Technology (now known as the International Conference on Origami in Science, Math, and Education) was held in 1989 in Ferrara, Italy. At this meeting, a construction was given by Scimemi for the regular heptagon.

Around 1990, Robert J. Lang and others first attempted to write computer code that would solve origami problems.

 File:Maekawas Theorem.svg
In 1996, Marshall Bern and Barry Hayes showed to be an NP-complete problem the assignation of a crease pattern of mountain and valley folds in order to produce a flat origami structure starting from a flat sheet of paper.

In 1999, a theorem due to Haga provided constructions used to divide the side of a square into rational fractions.

In 2001, among other more mathematical results Britney Gallivan folded first a bedsheet then a sheet of gold foil in half 12 times, contrary to the belief that paper of any size could be folded at most eight times.

In 2002, Belcastro and Hull brought to the theoretical origami the language of affine transformations, with an extension from

R

{\displaystyle R}

2 to

R

{\displaystyle R}

3 in only the case of single-vertex construction.

In 2002, Alperin solved Alhazen's problem of spherical optics. In the same paper, Alperin showed a construction for a regular heptagon. In 2004, was proven algorithmically the fold pattern for a regular heptagon. Bisections and trisections were used by Alperin in 2005 for the same construction.

In 2009, Alperin and Lang extended the theoretical origami to rational equations of arbitrary degree, with the concept of manifold creases. This work was a formal extension of Lang's unpublished 2004 demonstration of angle quintisection.

## Pure origami

### Flat folding

 File:Lang rule one.png
 File:Lang rule three.png
The construction of origami models is sometimes shown as crease patterns. The major question about such crease patterns is whether a given crease pattern can be folded to a flat model, and if so, how to fold them; this is an NP-complete problem. Related problems when the creases are orthogonal are called map folding problems. There are three mathematical rules for producing flat-foldable origami crease patterns:

1. Maekawa's theorem: at any vertex the number of valley and mountain folds always differ by two.
It follows from this that every vertex has an even number of creases, and therefore also the regions between the creases can be colored with two colors.
2. Kawasaki's theorem: at any vertex, the sum of all the odd angles adds up to 180 degrees, as do the even.
3. A sheet can never penetrate a fold.

Paper exhibits zero Gaussian curvature at all points on its surface, and only folds naturally along lines of zero curvature. Curved surfaces that can't be flattened can be produced using a non-folded crease in the paper, as is easily done with wet paper or a fingernail.

Assigning a crease pattern mountain and valley folds in order to produce a flat model has been proven by Marshall Bern and Barry Hayes to be NP-complete. Further references and technical results are discussed in Part II of *Geometric Folding Algorithms*.

### Huzita–Justin axioms

Main article: Huzita–Hatori axioms

Some classical construction problems of geometry — namely trisecting an arbitrary angle or doubling the cube — are proven to be unsolvable using compass and straightedge, but can be solved using only a few paper folds. Paper fold strips can be constructed to solve equations up to degree 4. The Huzita–Justin axioms or Huzita–Hatori axioms are an important contribution to this field of study. These describe what can be constructed using a sequence of creases with at most two point or line alignments at once. Complete methods for solving all equations up to degree 4 by applying methods satisfying these axioms are discussed in detail in *Geometric Origami*.

## Constructions

As a result of origami study through the application of geometric principles, methods such as Haga's theorem have allowed paperfolders to accurately fold the side of a square into thirds, fifths, sevenths, and ninths. Other theorems and methods have allowed paperfolders to get other shapes from a square, such as equilateral triangles, pentagons, hexagons, and special rectangles such as the golden rectangle and the silver rectangle. Methods for folding most regular polygons up to and including the regular 19-gon have been developed. A regular *n*-gon can be constructed by paper folding if and only if *n* is a product of distinct Pierpont primes, powers of two, and powers of three.

### Haga's theorems

 File:Haga theorem 1.svg
The side of a square can be divided at an arbitrary rational fraction in a variety of ways. Haga's theorems say that a particular set of constructions can be used for such divisions. Surprisingly few folds are necessary to generate large odd fractions. For instance Template:Frac can be generated with three folds; first halve a side, then use Haga's theorem twice to produce first Template:Frac and then Template:Frac.

The accompanying diagram shows Haga's first theorem:

B
# Q

2
A
P

1
A
P

.

{\displaystyle BQ = \frac{2 AP}{1 + AP}.}

The function changing the length *AP* to *QC* is self inverse. Let *x* be *AP* then a number of other lengths are also rational functions of *x*. For example:

### A generalization of Haga's theorems

Haga's theorems are generalized as follows:

B
Q

C
Q

=

2
A
P

B
P

.

{\displaystyle \frac{BQ}{CQ} = \frac{2 AP}{BP}.}

Therefore BQ:CQ=k:1 implies AP:BP=k:2 for a positive real number k.

### Doubling the cube

 File:Delian origami.svg
The classical problem of doubling the cube can be solved using origami. This construction is due to Peter Messer: A square of paper is first creased into three equal strips as shown in the diagram. Then the bottom edge is positioned so the corner point P is on the top edge and the crease mark on the edge meets the other crease mark Q. The length PB will then be the cube root of 2 times the length of AP.

The edge with the crease mark is considered a marked straightedge, something which is not allowed in compass and straightedge constructions. Using a marked straightedge in this way is called a neusis construction in geometry.

### Trisecting an angle

 File:Origami Trisection of an angle.svg
Angle trisection is another of the classical problems that cannot be solved using a compass and unmarked ruler but can be solved using origami. This construction, which was reported in 1980, is due to Hisashi Abe. The angle CAB is trisected by making folds PP' and QQ' parallel to the base with QQ' halfway in between. Then point P is folded over to lie on line AC and at the same time point A is made to lie on line QQ' at A'. The angle A'AB is one third of the original angle CAB. This is because PAQ, A'AQ and A'AR are three congruent triangles. Aligning the two points on the two lines is another neusis construction as in the solution to doubling the cube.

## Related problems

The problem of rigid origami, treating the folds as hinges joining two flat, rigid surfaces, such as sheet metal, has great practical importance. For example, the Miura map fold is a rigid fold that has been used to deploy large solar panel arrays for space satellites.

The napkin folding problem is the problem of whether a square or rectangle of paper can be folded so the perimeter of the flat figure is greater than that of the original square.

The placement of a point on a curved fold in the pattern may require the solution of elliptic integrals. Curved origami allows the paper to form developable surfaces that are not flat. Wet-folding origami is a technique evolved by Yoshizawa that allows curved folds to create an even greater range of shapes of higher order complexity.

The maximum number of times an incompressible material can be folded has been derived. With each fold a certain amount of paper is lost to potential folding. The loss function for folding paper in half in a single direction was given to be

# L

π
t

6

(

2
n

4
)
(

2
n

−
1
)

{\displaystyle L=\tfrac{\pi t}{6} (2^n + 4)(2^n - 1)}

, where *L* is the minimum length of the paper (or other material), *t* is the material's thickness, and *n* is the number of folds possible. The distances *L* and *t* must be expressed in the same units, such as inches. This result was derived by Gallivan in 2001, who also folded a sheet of paper in half 12 times, contrary to the popular belief that paper of any size could be folded at most eight times. She also derived the equation for folding in alternate directions.

The fold-and-cut problem asks what shapes can be obtained by folding a piece of paper flat, and making a single straight complete cut. The solution, known as the fold-and-cut theorem, states that any shape with straight sides can be obtained.

A practical problem is how to fold a map so that it may be manipulated with minimal effort or movements. The Miura fold is a solution to the problem, and several others have been proposed.

## See also

Template:Commons category

* Flexagon
* Lill's method
* Napkin folding problem
* Map folding
* Regular paperfolding sequence (for example, the dragon curve)

## Further reading

* Demaine, Erik D., "Folding and Unfolding", PhD thesis, Department of Computer Science, University of Waterloo, 2001.
* Template:Cite book
* Template:Cite journal
* Template:Cite book
* Template:Cite book
* Dureisseix, David, "Folding optimal polygons from squares", *Mathematics Magazine* 79(4): 272–280, 2006. Template:Doi
* Dureisseix, David, "An Overview of Mechanisms and Patterns with Origami", *International Journal of Space Structures* 27(1): 1–14, 2012. Template:Doi

## External links

Template:Commons category

* Dr. Tom Hull. Origami Mathematics Page.
* Paper Folding Geometry at cut-the-knot
* Dividing a Segment into Equal Parts by Paper Folding at cut-the-knot
* Britney Gallivan has solved the Paper Folding Problem
* Overview of Origami Axioms

Template:Portal bar
Template:Mathematics of paper folding
Template:Mathematical art

es:Matemáticas del origami

1. ↑ 1.0 1.1 Template:Cite journal
2. ↑ Template:Cite book
3. ↑ Template:Cite book
4. ↑ Template:Cite book
5. ↑ Template:Cite book
6. ↑ 6.0 6.1 6.2 a comparison between straight edge and compass constructions and origami (1997).
7. ↑ Template:Citation. Reproduced in *British Origami*, 1981, and online at the British Origami Society web site.
8. ↑ Template:Citation
9. ↑ Template:Cite news
10. ↑ Template:Citation
11. ↑ 11.0 11.1 Template:Cite journal
12. ↑ Justin, Jacques, "Resolution par le pliage de l'equation du troisieme degre et applications geometriques", reprinted in *Proceedings of the First International Meeting of Origami Science and Technology*, H. Huzita ed. (1989), pp. 251–261.
13. ↑ Benedetto Scimemi, Regular Heptagon by Folding, Proceedings of Origami, Science and Technology, ed. H. Huzita., Ferrara, Italy, 1990
14. ↑ Template:Cite news
15. ↑ 15.0 15.1 Template:Cite conference
16. ↑ 16.0 16.1 Hatori, Koshiro. How to Divide the Side of Square Paper. Japan Origami Academic Society.
17. ↑ 17.0 17.1 K. Haga, Origamics, Part 1, Nippon Hyoron Sha, 1999 (in Japanese)
Template:MathWorld
19. ↑ 19.0 19.1 Template:Cite journal
20. ↑ Template:Cite journal
21. ↑ 21.0 21.1 Template:Cite book
22. ↑ Template:Cite book
23. ↑ Template:Cite journal
24. ↑ Template:Cite journal
25. ↑ 25.0 25.1 Template:Cite book
26. ↑ Angle Quintisection (2004).
27. ↑ Template:Cite book
28. ↑ Robert Lang folds way-new origami.
29. ↑ Template:Cite book
30. ↑ Tom Hull. Origami and Geometric Constructions.
Template:Cite book
32. ↑ Template:Cite journal
33. ↑ 33.0 33.1 Lang, Robert J (2008). From Flapping Birds to Space Telescopes: The Modern Science of Origami. Usenix Conference, Boston, MA.
34. ↑ Template:Cite book
35. ↑ Siggraph: "Curved Origami".
36. ↑ Template:Cite journal