Kawasaki's Theorem
   HOME

TheInfoList



OR:

Kawasaki's theorem or Kawasaki–Justin theorem is a
theorem In mathematics and formal logic, a theorem is a statement (logic), statement that has been Mathematical proof, proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to esta ...
in the
mathematics of paper folding 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 ...
that describes the
crease pattern Crease may refer to: * A line (geometry) or mark made by folding or doubling any pliable substance * Crease (band), American hard rock band that formed in Ft. Lauderdale, Florida in 1994 * Crease pattern, origami diagram type that consists of al ...
s with a single vertex that may be folded to form a flat figure. It states that the pattern is flat-foldable if and only if alternatingly adding and subtracting the angles of consecutive folds around the vertex gives an alternating sum of zero. Crease patterns with more than one vertex do not obey such a simple criterion, and are
NP-hard In computational complexity theory, a computational problem ''H'' is called NP-hard if, for every problem ''L'' which can be solved in non-deterministic polynomial-time, there is a polynomial-time reduction from ''L'' to ''H''. That is, assumi ...
to fold. The theorem is named after one of its discoverers,
Toshikazu Kawasaki is a Japanese paperfolder and origami theorist who is known for his geometrically innovative models. He is particularly famous for his series of fourfold symmetry "roses", all based on a twisting maneuver that allows the petals to seem to curl ...
. However, several others also contributed to its discovery, and it is sometimes called the Kawasaki–Justin theorem or Husimi's theorem after other contributors, Jacques Justin and
Kôdi Husimi Kōji Husimi (June 29, 1909 – May 8, 2008, ) was a Japanese theoretical physicist who served as the president of the Science Council of Japan.. Husimi trees in graph theory, the Husimi Q representation in quantum mechanics, and Husimi's theor ...
.The name "Yasuji Husimi" appearing in and sometimes associated with this theorem is a misreading of the kanji "康治" in Kôdi Husimi's name.


Statement

A one-vertex
crease pattern Crease may refer to: * A line (geometry) or mark made by folding or doubling any pliable substance * Crease (band), American hard rock band that formed in Ft. Lauderdale, Florida in 1994 * Crease pattern, origami diagram type that consists of al ...
consists of a set of
ray Ray or RAY may refer to: Fish * Ray (fish), any cartilaginous fish of the superorder Batoidea * Ray (fish fin anatomy), the bony or horny spine on ray-finned fish Science and mathematics * Half-line (geometry) or ray, half of a line split at an ...
s or creases drawn on a flat sheet of paper, all emanating from the same point interior to the sheet. (This point is called the vertex of the pattern.) Each crease must be folded, but the pattern does not specify whether the folds should be mountain folds or
valley fold A valley is an elongated low area often running between hills or mountains and typically containing a river or stream running from one end to the other. Most valleys are formed by erosion of the land surface by rivers or streams over a ve ...
s. The goal is to determine whether it is possible to fold the paper so that every crease is folded, no folds occur elsewhere, and the whole folded sheet of paper lies flat. To fold flat, the number of creases must be even. This follows, for instance, from Maekawa's theorem, which states that the number of mountain folds at a flat-folded vertex differs from the number of valley folds by exactly two folds. Therefore, suppose that a crease pattern consists of an even number of creases, and let be the consecutive angles between the creases around the vertex, in clockwise order, starting at any one of the angles. Then Kawasaki's theorem states that the crease pattern may be folded flat if and only if the alternating sum and difference of the angles adds to zero: : An equivalent way of stating the same condition is that, if the angles are partitioned into two alternating subsets, then the sum of the angles in either of the two subsets is exactly 180 degrees. However, this equivalent form applies only to a crease pattern on a flat piece of paper, whereas the alternating sum form of the condition remains valid for crease patterns on conical sheets of paper with nonzero
defect Defect or defects may refer to: Related to failure * Angular defect, in geometry * Birth defect, an abnormal condition present at birth * Crystallographic defect, in the crystal lattice of solid materials * Latent defect, in the law of the sale o ...
at the vertex.


Local and global flat-foldability

Kawasaki's theorem, applied to each of the vertices of an arbitrary crease pattern, determines whether the crease pattern is locally flat-foldable, meaning that the part of the crease pattern near the vertex can be flat-folded. However, there exist crease patterns that are locally flat-foldable but that have no global flat folding that works for the whole crease pattern at once. conjectured that global flat-foldability could be tested by checking Kawasaki's theorem at each vertex of a crease pattern, and then also testing bipartiteness of an
undirected graph In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some sense "related". The objects are represented by abstractions called '' vertices'' (also call ...
associated with the crease pattern. However, this conjecture was disproven by , who showed that Hull's conditions are not sufficient. More strongly, Bern and Hayes showed that the problem of testing global flat-foldability is
NP-complete In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''. Somewhat more precisely, a problem is NP-complete when: # It is a decision problem, meaning that for any ...
.


Proof

To show that Kawasaki's condition necessarily holds for any flat-folded figure, it suffices to observe that, at each fold, the orientation of the paper is reversed. Thus, if the first crease in the flat-folded figure is placed in the plane parallel to the -axis, the next crease must be rotated from it by an angle of , the crease after that by an angle of (because the second angle has the reverse orientation from the first), etc. In order for the paper to meet back up with itself at the final angle, Kawasaki's condition must be met. Showing that the condition is also a
sufficient condition In logic and mathematics, necessity and sufficiency are terms used to describe a conditional or implicational relationship between two statements. For example, in the conditional statement: "If then ", is necessary for , because the truth of ...
is a matter of describing how to fold a given crease pattern so that it folds flat. That is, one must show how to choose whether to make mountain or valley folds, and in what order the flaps of paper should be arranged on top of each other. One way to do this is to choose a number such that the partial alternating sum : is as small as possible. Either and the partial sum is an
empty sum In mathematics, an empty sum, or nullary sum, is a summation where the number of terms is zero. The natural way to extend non-empty sums is to let the empty sum be the additive identity. Let a_1, a_2, a_3, ... be a sequence of numbers, and let ...
that is also zero, or for some nonzero choice of the partial sum is negative. Then, accordion fold the pattern, starting with angle and alternating between mountain and valley folds, placing each angular wedge of the paper below the previous folds. At each step until the final fold, an accordion fold of this type will never self-intersect. The choice of ensures that the first wedge sticks out to the left of all the other folded pieces of paper, allowing the final wedge to connect back up to it. An alternative proof of sufficiency can be used to show that there are many different flat foldings. Consider the smallest angle and the two creases on either side of it. Mountain-fold one of these two creases and valley-fold the other, choosing arbitrarily which fold to use for which crease. Then, glue the resulting flap of paper onto the remaining part of the crease pattern. The result of this gluing will be a crease pattern with two fewer creases, on a conical sheet of paper, that still satisfies Kawasaki's condition. Therefore, by
mathematical induction Mathematical induction is a method for mathematical proof, proving that a statement P(n) is true for every natural number n, that is, that the infinitely many cases P(0), P(1), P(2), P(3), \dots  all hold. This is done by first proving a ...
, repeating this process will eventually lead to a flat folding. The base case of the induction is a cone with only two creases and two equal-angle wedges, which can obviously be flat-folded by using a mountain fold for both creases. There are two ways to choose which folds to use in each step of this method, and each step eliminates two creases. Therefore, any crease pattern with creases that satisfies Kawasaki's condition has at least different choices of mountain and valley folds that all lead to valid flat foldings.


History

In the late 1970s,
Kôdi Husimi Kōji Husimi (June 29, 1909 – May 8, 2008, ) was a Japanese theoretical physicist who served as the president of the Science Council of Japan.. Husimi trees in graph theory, the Husimi Q representation in quantum mechanics, and Husimi's theor ...
and
David A. Huffman David Albert Huffman (August 9, 1925 – October 7, 1999) was an American pioneer in computer science, known for his Huffman coding. He was also one of the pioneers in the field of mathematical origami. Education Huffman earned his bachelor's d ...
independently observed that flat-folded figures with four creases have opposite angles adding to 180°, a special case of Kawasaki's theorem. Huffman included the result in a 1976 paper on curved creases, and Husimi published the four-crease theorem in a book on origami geometry with his wife Mitsue Husimi. The same result was published even earlier, in a pair of papers from 1966 by S. Murata that also included the six-crease case and the general case of Maekawa's theorem. The fact that crease patterns with arbitrarily many creases necessarily have alternating sums of angles adding to 180° was discovered by Kawasaki, by Stuart Robertson, and by Jacques Justin (again, independently of each other) in the late 1970s and early 1980s. Because of Justin's contribution to the problem, Kawasaki's theorem has also been called the Kawasaki–Justin theorem. The fact that this condition is sufficient—that is, that crease patterns with evenly many angles, alternatingly summing to 180° can always be flat-folded—may have been first stated by . Kawasaki himself has called the result Husimi's theorem, after Kôdi Husimi, and some other authors have followed this terminology as well. The name "Kawasaki's theorem" was first given to this result in ''Origami for the Connoisseur'' by
Kunihiko Kasahara (born 1941) is a Japanese origami master. He has made more than a hundred origami models, from simple lion masks to complex modular origami, such as a small stellated dodecahedron. He does not specialize in what is known as "super complex origam ...
and Toshie Takahama (Japan Publications, 1987). credits the lower bound of on the number of different flat-foldings of a crease pattern meeting the conditions of the theorem to independent work in the early 1990s by Azuma, Justin, and Ewins and Hull. Although Kawasaki's theorem completely describes the folding patterns that have flat-folded states, it does not describe the folding process needed to reach that state. For some (multi-vertex) folding patterns, it is necessary to curve or bend the paper while transforming it from a flat sheet to its flat-folded state, rather than keeping the rest of the paper flat and only changing the dihedral angles at each fold. For
rigid origami Rigid origami is a branch of origami which is concerned with folding structures using flat rigid sheets joined by hinges. That is, unlike in traditional origami, the panels of the paper cannot be bent during the folding process; they must remain ...
(a type of folding that keeps the surface flat except at its folds, suitable for hinged panels of rigid material rather than flexible paper), the condition of Kawasaki's theorem turns out to be sufficient for a single-vertex crease pattern to move from an unfolded state to a flat-folded state.


References


External links

* Mathematical theorems Paper folding {{Mathematics of paper folding