WorksMathematics
A Universal -Vertex Origami Torus Triangulation
Abstract
An origami torus is a piecewise affine isometric embedding of a flat torus into . We prove that every flat torus is realized as an -vertex origami torus based on the triangulation with degree sequence . This provides an -vertex universal triangulation for origami tori.
Introduction
The Main Result
A flat torus is a quotient of the form , where is a lattice of translations of . The lattice is called the lattice of . A triangulation of a flat torus is a decomposition of into finitely many triangles, such that every two triangles are either disjoint, or share one vertex, or share one edge.
Two triangulations and , respectively of flat tori and , are combinatorially equivalent if there is a homeomorphism which affinely maps each triangle of to a triangle of . The equivalence class of is called its combinatorial type. We will sometimes blur the distinction between a triangulation and its combinatorial type. There are 7 different combinatorial types of 8-vertex triangulations of tori. Figure 1.1 below shows the 8-vertex triangulations and . We are naming these particular triangulations by their degree sequence. In each of these two cases, the degree sequence determines the combinatorial type.
Figure 1.1. The triangulations and .
An origami torus is an embedded topological torus in that is made by fitting together finitely many triangles so that the cone angle around each vertex is . Equivalently, an origami torus is the image of a piecewise affine isometric embedding of a flat torus . This is to say that has a triangulation such that the restriction of to each triangle of is an isometric affine map. (The specific triangulation is part of the data.) We call a lattice realized by if there exists an origami torus associated to the lattice and the combinatorial type . We call a combinatorial type universal if every lattice is realized by . Here is our main result.
Theorem 1.1 (Universality). is universal.
The Universality Theorem says that there is a single 8-vertex combinatorial type out of which you can build an origami torus of any shape you like. Our construction yields 2 continuous families of 8-vertex origami tori based on which together realize all shapes. We do not know if a single continuous family suffices, but see Remark 3.3. Here 8 is as good as it gets: In [2028] it is proved that 7-vertex origami tori do not exist. See also [2029]. Figure 1.2 below shows a representative example of one of our tori.

Figure 1.2. A flattened origami torus, inflated then corrected
History and Context
The Universality Theorem is the culmination of a series of results about origami tori, some quite recent.
In 1960, Y. Burago and V. Zalgaller [1960] give the first construction of origami tori.
In 1995, Y. Burago and V. Zalgaller [1995] prove that every lattice is realized by some combinatorial type.
In 2020, T. Tsuboi [T] gives explicit constructions which realize every lattice as an origami torus called a diplotorus (For the rectangular lattices one needs a modified construction.) P. Arnoux, S. Lelièvre, and A. Málaga [2027] give an independent proof of the same result. The construction requires infinitely many combinatorial types. Diplotori were discovered by U. Brehm [1978] in 1978. See also [2016 §6].
In 2023, F. Lazarus and F. Tallerie [2024] give a universal triangulation having 1217 vertices. Their paper also has an excellent discussion of the various attempts made to realize all lattices as origami tori.
In 2025, R.E.S. [2028] constructs an 8-vertex origami torus and proves that a 7-vertex origami torus does not exist. See also [2029]. The 8-vertex origami tori in [2028] and [2029], called pup tents, have combinatorial type and are symmetric with respect to order 2 rotation about the -axis.
In 2025, P.G.D. and R.E.S. [2025] prove that a lattice is realized by a pup tent provided that it is neither rectangular nor sharp rhombic. A lattice is rectangular if it is generated by a pair of perpendicular vectors and sharp rhombic if it is generated by a pair of equal-length vectors which make an angle of at most with each other. When the angle is you get the famous hexagonal lattice. Thus, almost every lattice is realized by a pup tent. In [2025] the authors speculate that perhaps the remaining lattices can be realized by 8-vertex origami tori without 2-fold symmetry.
In 2026, F. Lander [2026] proves that the square lattice is realized by and the hex lattice is realized by . These origami tori have no symmetries.
The result in [2026] grew out of some experiments that F.L. and S.T. did in the summer of 2026. These authors made a poster for R.E.S.’s birthday conference and, in an exciting development, their software could realize some rectangular and sharp rhombic lattices. Upon further experimentation, F.L. and S.T. discovered that the folding pattern used to realize the hexagonal lattice from turned out to be extremely robust. This fact led to the Universality Theorem.
Proof Strategy and Organization
Writing down explicit origami tori seems quite difficult, partly because there are too many choices to make. The idea that emerged in [2025], and was used again in [2026], is to work instead on the boundary of the space of origami tori, where faces collapse together and so make some of these choices for us. The most collapsed examples lie entirely in a plane; we find these first and then push them back inside. Here we carry this out for and every lattice. In § 2 we give a geometric account of the strategy, ending in a proposition that reduces the proof to finitely many checks. We verify these checks in three steps.
Step 1: We give an explicit rational parametrization of a 5-dimensional family of flattened origami tori: flat tori which lie entirely in the plane! Within it we find two 2-parameter families which together realize every modulus. We do this in § 3.
Step 2: For each family we give a single vertical lift, the same heights for every member, which is embedded throughout. We call this inflating, and we do it in § 4.
Step 3: We check that horizontal motions can correct the cone angles and the modulus, so that Proposition 2.2 promotes each (inflated) flattened origami torus to an origami torus of the same modulus. We do this in in § 5.
The two families came out of extending the searches performed in [2026]. On several occasions we need certain polynomials not to vanish on certain domains. To keep the story clean, we leave the description of these certification techniques to § 7. Figure 1.2 shows the three step process which produces our examples.
Computer Calculations
We perform our calculations in Mathematica [W]. These calculations are all fairly short and easy to reproduce. One file contains everything. Here are two places to get the file.
http://www.math.brown.edu/~res/Java/UniversalityProof
https://github.com/FabianLander/universal-8-vertex-origami-torus-triangulation
Artificial Intelligence Use
We used Artificial Intelligence in a moderate way. The conceptual framework for the proof is ours, and evolved from the papers [2028], [2025], and [2026]. At various stages, ChatGPT 5.6 implemented some of our search algorithms and optimized some of our code. Perhaps needless to say, the AI also helped format equations, provide references, and proofread the paper. Also, we mention that ChatGPT had an excellent idea for simplifying the angle-derivative formulas for the Jacobian calculation in § 5.
Acknowledgements
R.E.S. would like to thank the I.H.E.S. for their support, in the form of the Gretchen and Barry Mazur Chair, during the writing of this paper.
Producing Origami Tori
We now describe the method we use to produce origami tori, following [2025] and [2026]: we construct degenerate example and then inflate them. In this paper, our degenerate examples are “completely flattened”: they lie in the plane.
Looking on the Boundary
Fix the triangulation , though the idea is general. A polyhedral torus of type is determined by its 8 vertices in , so these tori form the open subset of where no triangle is degenerate. The origami tori are its flat, embedded members, , where is the open set of embedded tori and is the set of intrinsically flat tori, whose triangle angles sum to at each vertex.
Origami tori are quite hard to produce: although 8-vertex origami tori are known to exist [2028], [2025], [2026], none is known in closed form. The two sets of constraints are hard in different ways. Embeddedness is an open condition, so embedded tori can at least be found by sampling, though they are rare: for our triangulation they make up approximately 0.009% of all tori.3 Flatness is a system of equations: every cone angle must be exactly . Sampling will never find a flat torus; they must instead be constructed by solving a nonlinear system exactly, which means making many choices. One way forward is to impose extra conditions that make some of these choices for us. But the resulting tori must still land in , which is small. The idea is to draw the extra conditions from itself.
Turning some of the inequalities of embeddedness into equalities puts us on the boundary of . This boundary is stratified by how embeddedness fails: a vertex can touch a face, an edge can lie in a face, faces can coincide, and each further contact imposes more conditions. Carried to the end, this suggests a natural family: tori whose triangles have all collapsed into a single plane, which we take to be . We call these planar tori, write for the space of them, and call the flat ones flattened origami tori.
Planarity gives us enough structure to hold on to. In space, a triangle can rotate about an edge through a whole circle of dihedral angles; in the plane, it is either folded over or not. Once we choose which triangles are folded over, the only remaining condition is that the folding closes up around each vertex and each loop of the torus. These are easy equations in the Euclidean group of the plane, and in § 3 we give explicit solutions for across all of moduli space.
Inflating from the Boundary
We took the equations for planar tori from the boundary , but some solutions may not lie in . A simple sufficient condition for a planar torus to lie in is this: If some vertical lift , giving the vertices heights , is embedded, then so are the scaled lifts , which converge to as .
If is also flat, it sits in right at the edge of , and origami tori should lie just inside. To reach them, we push a little way into , to . This leaves , so we correct by moving the vertices horizontally, parallel to the plane, by some that brings us back to . The following result assures us that the correction does not push us back out of .
Lemma 2.1. Let be a planar torus such that is embedded. Then there is such that is embedded for every and every horizontal motion with .
Proof. The vertical scaling is an affine bijection of , and it sends to . Since embeddedness is open, is embedded once is small enough. ♠
This is a lot of room: as the lifted torus collapses onto the plane, yet it tolerates horizontal motions of a fixed size. So any horizontal correction that tends to with eventually fits inside it. For flatness, the implicit function theorem supplies such a correction whenever horizontal motions can adjust the cone angles at . But nothing in this argument is special to cone angles. The same reasoning inflates while keeping fixed any quantity that depends smoothly on the vertices, provided horizontal motions can adjust it at .
Proposition 2.2 Let be a planar torus and a smooth map from a neighborhood of to . Suppose that
has an embedded vertical lift ;
restricted to is a submersion at .
Then there are embedded tori arbitrarily close to with the same value of .
Proof. By hypothesis 2 there are horizontal vectors with the standard basis of . Let
Then and is the identity at , so the implicit function theorem gives a smooth with and for small . The horizontal motion tends to with , so by Lemma 2.1 the torus is embedded for small , and it has the same value of as . ♠
Proposition 2.2 provides easily checkable conditions that let us promote a planar torus with the properties we want to an inflated torus with the same properties. In this paper we want origami tori whose modulus we know exactly. So we must control both the cone angles and the modulus, and in §5 we take to record both. This makes Proposition 2.2 the engine of the paper, and the rest of the paper checks its hypotheses.
The Flattened Tori
The Families
Universality requires an origami torus for every lattice. Scaling in takes origami tori to origami tori, and a lattice and its mirror image give isometric tori, so it is enough to realize one lattice in each class up to scaling and reflection. Every such class contains for some in
the closed triangle in , which is half of the standard fundamental domain for the modular group. So for each we need a flattened origami torus with lattice satisfying the hypotheses of Proposition 2.2.
Since is a continuum, we work with families of flattened tori with lattice , depending smoothly on ; along a family, each hypothesis of Proposition 2.2 becomes a statement about functions of , checked over a whole region at once. A few families whose regions cover then suffice.
Our families come from fixing how the torus folds. When a torus is folded into the plane, each triangle lands either face up or face down, so every planar torus has a folding pattern, recording which triangles are reversed. For a fixed pattern, the flattened origami tori are found by solving the equations that make the folding close up. For the Universality Theorem we need only a single folding pattern, shown in Figure 3.1. We spoil the story and give the formulas right away. They form a 5-parameter family of flattened origami tori, with parameters and . Fixing as functions of in two ways then gives two families, which together cover .
Figure 3.1. The square torus and its flattened origami realization.
Each member has two planar pictures: the flat torus before folding, described by vertices and their lattice translates, and its folded image, described by vertices . The folding maps corresponding triangles isometrically. We begin with the folded vertices.
The Flattened Origami Torus: Here are the points of the corresponding flattened origami torus . With the auxiliary variable , they are
The Flat Torus: We will describe 16 triangles. We get a tiling of by taking the orbit of these triangles under the action of the lattice defined above. The quotient then gives us our 8-vertex triangulation of the flat torus . Here are the triangles
Here and . We have for , and
Preliminary Isometric Mapping: Let denote the th triangle above. We call the set the fundamental triangles. Let denote the corresponding triangle whose vertices are the points. Let be the piecewise affine map from the one set of 16 triangles to the other.
Lemma 3.1 is an isometry on each of the 16 triangles.
Proof: For each of the 16 triangles, one checks that the three squared edge lengths of and of agree; these are rational functions of , , , , , so this is a direct symbolic computation. We do this exactly with the file UniversalityProof. ♠
Remark 3.2 For , there are some algebraic constraints on the fiber which suffice to ensure that the triangles above have positive area:
We will never need to check or work with these constraints.
Remark 3.3 By the constraint , when and when . So a continuous family over all of must pass through , where , and there it seems impossible to add heights that give an embedded lift. This is why we cover with two families.
The Two Families: We now pick out two subfamilies, parametrized by the modulus , whose domains together cover :
Domain 1 , Family 1: ,
Domain 2 , Family 2: .
Both formulas make sense for in an open neighborhood of their domains: the denominators never vanish there.
These choices of family give the vertices above simple coordinates. Every first coordinate is linear in , and every second coordinate is a rational function , where is at most quadratic and is constant. This greatly simplifies the polynomials in our checks: the triangle areas (Lemma 3.4), the volumes of § 4 (Lemma 4.1), and the Jacobian (Lemma 5.3).
In § 3.2 we check that the members of the two families are flattened origami tori; this is all the proof needs. In § 3.3 we show how one can derive these formulas from the folding pattern.
Checking the Families Are Flattened Origami Tori
The left side of Figure 3.1 shows the member of Family 1 at . The right side shows the flattened origami torus built one triangle at a time, in an ordering that is compatible with our corresponding lift. Figure 3.2 does the same thing for the somewhat randomly chosen member of Family 2. (It would be more mathematically satisfying to show the picture for the hex torus, but the picture does not look that good: two of the vertices are quite close together.) The coloring convention in both figures is as follows. Fixing an orientation of , light triangles keep their orientation and dark ones are reversed. Read down the left column of the table in § 3.1 and then the right, with + for kept and − for reversed, our folding pattern is + − − + + + + + − + − − − − +−.
Figure 3.2. The torus of modulus and its flattened origami realization.
In both figures, the sixteen triangles form a polygon whose boundary edges are paired by the lattice: pairs the edges 42 and 25 on the left with those on the right, pairs 43 and 35 on the bottom with those on the top, and pairs the two edges 45. The table shows that these pairings hold for every member, not only the two pictured: for instance, triangles 145 and 465 share the edge 45, shifted by .
Lemma 3.4 Let .
For all parameters in a suitably chosen open neighborhood of Domain , every triangle in Family has positive area.
Throughout a connected open neighborhood of Domain , gives a flattened origami torus .
Proof: (1) Twice the signed area of a triangle is the determinant of two of its edge vectors, so we must show that these sixteen determinants do not vanish. UniversalityProof certifies this exactly via strip dominance (§ 7), on each family’s domain.
One may also check this by hand. As the vertex coordinates are simple (§ 3.1), so are these determinants: each has the form , so times it is , linear in . Here Lemma 7.1 reduces each triangle to a pair of sign checks, for two at most quadratic polynomials on the family’s domain, and all of them hold. This open condition persists in an open neighborhood of Domain .
(2) Let and . We have a map which is an isometry on each triangle, by Lemma 3.1. For each of the figures we plotted above, is an embedded solid polygon and the three elements of pair the sides of . Let be the quotient of by this side-pairing. is a topological torus. Because the side-pairings are translations, we have the familiar result that is a flat torus. This picture persists for an open set of parameters in Domain , for .
We let be some connected open neighborhood of Domain for which (1) holds. Then (1) tells us that the triangles retain their orientations and never degenerate in . Also, all the angles vary analytically. Hence, if we form the abstract topological space by gluing together the triangles in the same pattern as we do when we know that is embedded, we get a topological torus whose cone angles vary analytically. Since these cone angles equal on an open set, they are always . Hence, our torus is always a flat torus. (The expert reader may enjoy proving the unnecessary fact that is always an embedded polygon and a fundamental domain for .) Furthermore, respects all the gluings needed to make and therefore gives us a flattened origami torus throughout for each choice of .
Producing Families by Folding
In this subsection, which is not needed for the proof, we derive the formulas in § 3.1 from our folding pattern. There are very many folding patterns, for each triangulation, and ours has several properties that let the proof go through; we explain how we found it in § 6.
Let be any flattened origami torus with our folding pattern, where is isometric on each triangle of its intrinsic flat torus . An edge is a crease if its two triangles have opposite signs. Two triangles of the same sign sharing an edge are moved by the same isometry. So if we cut the universal cover of along the creases into islands, then , lifted to , moves each island by a single isometry, and the isometries of two islands meeting along a crease differ by the reflection in it. For our folding pattern the creases cut into ten islands , up to translation by the lattice.
Figure 3.3 below shows these islands, drawn in the universal cover and shaded according to their orientation as in Figure 2.1 and 2.2. More precisely, the folding keeps the orientation of the light triangles and reverses the orientation of the dark ones. Our subtle shading in the figure is designed to distinguish the 16 fundamental triangles from their images under the lattice action. We also note one additional bookkeeping feature of Figure 3.3: A shaded vertex labeled is the translate of by the indicated vector.

Figure 2.1. Inflating from the boundary.

Figure 3.3. The islands and the sixteen triangles, drawn in the universal cover.
Our aim is to find all flattened origami tori with this folding pattern, up to similarity. Knowing how moves one island determines how it moves all the others, by crossing creases, so rather than start with and look for , we build both together, one island at a time. Normalize the lattice of to be generated by and with , and put . Then is determined by lifts of its vertices, which are our unknowns. The table in § 3.1 lists the sixteen triangles with the lifts of their vertices.
Composing with an isometry of the plane, we may take to be the identity on the island , and we write for the vertices of . Crossing creases then determines everywhere, and the only requirement is that it be well defined on : all copies of a vertex in must go to the same point. These closing conditions are the only equations to solve, and they are easy. Each says that a composition of reflections in creases sends one copy of a vertex to another copy . When it is a single reflection, the crease is the perpendicular bisector of and , so each point on it satisfies , which is linear in . For our folding pattern the conditions can be ordered so that each is linear in the unknowns not yet determined. So we can solve them one at a time, and the solutions form a family, rational in , and the choices left free.
We illustrate, through two examples, how the closing conditions are solved, starting from . The first example shows both how a condition determines unknowns and how a free parameter arises. Since is the identity on , for its vertices 0, 1, 2, 4, 5, 7. The island meets along the crease 17, so moves by the reflection in 17 (Figure 3.4). contains the copies and of the vertices 2 and 5, while contains and , so this reflection sends to and to . Thus 17 is the perpendicular bisector of and , a vertical line , and nothing determines : it is our first free choice. It places and on , and and on .

Figure 3.4. (a) , , , unfolded. (b) Fold across 17. (c) Fold across 02.
Crossing into along the crease 02 works the same way (Figure 3.4c): the reflection in 02 must send to , so 02, which passes through , is perpendicular to , and this pins down on . The rest goes the same way once is placed freely, which gives our other two choices: its first coordinate and its second coordinate, which we parametrize by . Comparing with then fixes and , comparing with fixes , the islands and fix and , and , and add no new equations. Three free choices is what one expects: up to similarity, eight points in the plane have 12 degrees of freedom, and flatness imposes 7 independent conditions, leaving the modulus and three more.
Working out all the closing conditions in this way led to the formulas of §3.1 for the vertices of . The flat torus is given by the lifts . Since is the identity on , for the vertices 0, 1, 2, 4, 5, 7 of . The other two vertices lie on islands moved by a single reflection: on , reflected in the crease 01, and on , reflected in the crease 17. This gives the formulas for and .
The Lifting Property
Hypothesis 1 of Proposition 2.2 asks for an embedded vertical lift. For each family we propose one set of heights for every member:
| Family 1 | 0 | 0 | 0 | 977 | ||||
| Family 2 | 0 | 0 | 0 | 1430 |
If has vertices , the vertical lift has vertices . To see that it is embedded, we must check that no two of its triangles meet except along a common edge or vertex. We do this in two steps: we check that the lift is embedded at a single modulus, and then that nothing changes across the family.
Throughout we use tetrahedra. Any four vertices span a tetrahedron, and the sign of its volume records their relative position: on which side of the plane through three of them the fourth one lies. We first show that none of these 70 volumes vanishes on the domain, so their signs are constant across the family. We then explain how the signs certify embeddedness.
Lemma 4.1 For both families and every modulus in the domain, no four vertices of the lift are coplanar, that is, they are in general position.
Proof: For each quadruple of vertices we must show that
does not vanish on Domain . This is certified in UniversalityProof using the tweaked method of strip dominance from § 7.
One may also check this by hand. The columns of are differences of -, - and -coordinates, so by § 3.1, multiplying the middle column by and expanding along it gives
For each of the 70 determinants, Lemma 7.1 then reduces nonvanishing to the signs of and , two polynomials of degree at most two, on the family’s domain. All these checks hold. ♠
Lemma 4.2 Suppose that the vertices of a polyhedral torus are in general position, and that every edge is disjoint from every triangle with which it shares no vertices. Then the torus is embedded.
Proof: We show that any two triangles and intersect precisely in their common vertices and edge. If and share an edge, their planes are distinct by general position. Hence they intersect exactly along their common edge. Now suppose and do not share an edge. If they have an unwanted intersection, some edge of one triangle must intersect the other triangle outside their common vertices. An edge having a vertex in common with the other triangle cannot do this: by general position, it intersects the plane of that triangle only at the common vertex. Thus the unwanted intersection must involve an edge and a triangle with no vertices in common. This contradicts our hypothesis. ♠
Next we test whether a segment is disjoint from a triangle . Deleting from the list leaves the vertices of a tetrahedron. Let be its signed volume, with the points taken in increasing order. We assume the five points are in general position.
Lemma 4.3 and are disjoint provided .
Proof: Let denote the signed volume of the tetrahedron with vertices listed in the order . If and have the same sign, then lies strictly on one side of the plane containing . This gives disjointness. If intersects , then , and have the same sign. Since , and , this fails if or . ♠
Corollary 4.4 For both families and every modulus in the domain, the lift is embedded.
Proof: There are 138 pairs where is an edge and a triangle of with no common vertex. By Lemmas 4.1 and 4.2, is embedded if all of them satisfy the criterion of Lemma 4.3. Using the file UniversalityProof we check this at in Family 1 and at in Family 2 (Figure 3.1 and Figure 3.2). Each in the criterion is the volume of four lifted vertices, so by Lemma 4.1 it never vanishes on the domain. Since the domain is connected, its sign is constant there, and the criterion holds throughout. ♠
Remark 4.5 Constant heights that work for a whole family are not automatic: we searched for them alongside the choice of family. At a single modulus the checks above take a computer almost no time, so candidate heights are easy to test at many moduli. Even so, they are delicate: changing a single height by usually breaks the argument. See §6.
Universality
The Map
By §4, each of our flattened origami tori has an embedded vertical lift, so it can be inflated. Proposition 2.2 assures us we can keep the values of any smooth map fixed during inflation, provided it is a submersion on the planar tori at our starting point. So we build a to suit our purpose, recording both the cone angles and the modulus of polyhedral tori.
For a polyhedral torus, let be the cone angle at the vertex , the sum of the angles of the triangles meeting there, and let be its angle deficit. Each angle of a nondegenerate triangle is a smooth function of its edge lengths, so the are smooth functions on the space of polyhedral tori. By Gauss–Bonnet, the eight deficits of a torus sum to zero. So a polyhedral torus is flat exactly when vanish, and we record these seven deficits as .
There is one subtlety: the modulus is only defined for flat tori, but Proposition 2.2 needs on a neighborhood of , which contains tori that are not flat. The modulus of a flat torus is read off from its development into the plane: the holonomy along two generating loops is a pair of translations, and the modulus is their ratio. Other tori are cone surfaces, and technically the developing map is only defined on the universal cover of the punctured surface we get by removing the cone points. However, we can define a kind of pseudo modulus, sufficient for our purposes, by choosing (once and for all) flat annuli bounding each generating loop and then defining the holonomy relative to these annuli.
Lemma 5.1 Developing along a fixed choice of annuli defines a smooth function of the edge lengths, on an open set of polyhedral tori containing , which equals the modulus on .
Proof. When we lift these annuli to the universal cover of we get strips along which we can properly define the developing map. In the universal cover, choose a vertex , a triangle containing , and their translates , by and , by . For each , choose a strip of triangles from to , each sharing an edge with the next (Figure 5.1 shows our choice).
Figure 5.1. The modulus defined by strip development.
Given a polyhedral torus, develop each strip into the plane. Place by a fixed rule, for instance with at the origin, a fixed edge of at along the positive -axis, and on the side given by the orientation of the torus. Then attach each subsequent triangle along its shared edge, on the opposite side. Each placement is determined by the edge lengths and depends smoothly on them, because the triangles are nondegenerate. So, identifying with ,
is a smooth function of the edge lengths wherever the denominator is nonzero. When the torus is flat, the two strips are part of its development, so the differences are its holonomy translations, up to a common rotation, and is the modulus. In particular the denominator is nonzero on , and so on an open set containing it, where is the required function.
Figure 5.1 shows our choice of strips, and also illustrates our construction of this pseudo modulus. The strips for , with at vertex 1 and (dark), and the edge 17 vertical:
from to , and
from to . They are developed for the square torus (left) and for a nearby torus that is not flat (right).
Set , a smooth map from a neighborhood of each to . Near , the tori with are exactly the flat tori of modulus : means flat, and on flat tori is the modulus.
To apply Proposition 2.2 we must show that restricted to is a submersion at . Along our families the modulus part is automatic, so this reduces to a statement about alone:
Lemma 5.2 Let be a smooth family of flattened origami tori of modulus , for in an open set containing . If restricted to is a submersion at , then so is restricted to .
Proof: Since each is planar, the velocities and at are horizontal. Since and , we have
By hypothesis there are horizontal vectors with the standard basis of . On these nine vectors the derivative of has the block form
which is invertible. So maps the horizontal vectors onto .
Completing the Proof
By Lemma 5.2, it remains to show that restricted to is a submersion at each . In fact the first coordinates of vertices already suffice. Given , let move each vertex of by for , leaving vertex 7 fixed, and for Family set
We show that does not vanish.
Writing , is a rational function of and , even though the angles themselves are not. The angle between vectors and is
This formula is far from rational, but its derivatives are, for example
Taking and in the order given by the orientation of the torus, is the sign of the triangle in our folding pattern. The vertex coordinates of our flattened tori are rational functions of and , so each such derivative is too. The entries of are sums of these derivatives, and is a polynomial in the entries, so is rational in and . Its denominators are squared edge lengths , which are positive because our triangles are nondegenerate (Lemma 3.4), so is defined on all of Domain .
Lemma 5.3. The function does not vanish on Domain .
Proof. This is certified in UniversalityProof using the tweaked method of strip dominance from § 7. Alternatively, with a computer algebra system one may verify that the numerator of in lowest terms factors as
where is a nonzero constant, , , and and are polynomials of degree 5 and 3. For example, for Family 1,
On Domain , both and are positive. By Lemma 7.1, the remaining factor is nonzero because the quintic and the cubic are both positive for Family 1 and both negative for Family 2. ♠
This completes the proof of the Universality Theorem. Indeed, let . Since our two domains cover , lies in one of them, say Domain , and , the flattened origami torus of Family with modulus , satisfies both hypotheses of Proposition 2.2. Hypothesis 1 holds because its lift is embedded (Corollary 4.4). Hypothesis 2 holds by Lemma 5.2 applied to Family , since restricted to is a submersion at by Lemma 5.3. So by Proposition 2.2 there are embedded tori near with , that is, origami tori modeled on with modulus . As this holds for every , is universal by § 3.1.
Remark 5.4. These same computations serve a more geometric proof, which needs no smooth extension of the modulus. By Lemma 5.3, near our family the flat tori form a 17-dimensional manifold , and since , the modulus is a submersion there, with 15-dimensional fibers. Vertical motions of a planar torus change the edge lengths only to second order, so the lift is tangent to the fiber through , and stays within of it, while the embeddedness determinants of § 4 grow linearly in . So a curve in the fiber leaving with velocity differs from the lift by , and is embedded for small : an origami torus of modulus .
How We Found the Family
As described in § 1.2, our family grew out of numerical experiments by F.L. and S.T., which searched all seven 8-vertex triangulations and found many approximate origami tori. F.L. took tori with moduli very near the square and hexagonal lattices, drove them numerically onto those lattices, and then down into the plane, keeping them flat with fixed modulus. This did not always work, but when it did, it produced flattened tori with simple incidences; on the hexagonal one, for instance, the vertices 0, 2, 4, 5, 6 lie on a circle [2026 §6.1]. Imposing these incidences as exact equations gave the exact flattened tori of [2026].
F.L.’s incidences generalized to families of flattened tori along vertical rays in . Trying to explain the incidences, we found their source: they are what it takes for the folding to close up in the Euclidean group of the plane. Solving these equations step by step, as in § 3.3, gives the full family of flattened tori with a given folding pattern. The family of F.L.’s square example does not reach the hexagonal lattice, but that of his hexagonal example covers . It is the family of this paper.
Families that cover seem to be rare. Up to symmetry, the seven 8-vertex triangulations have 67,645 folding patterns, and three simple conditions rule out all but 2,940. The signed angles of the triangles around each vertex must sum to 0 or , which constrains how many triangles can be face up. No island may wrap around the torus, since moves it by a single isometry. And every vertex must lie on a crease, since the cone angle at a vertex inside an island cannot change under horizontal motions, so restricted to cannot be a submersion. For the remaining 2,940 patterns, we attempted to solve the folding equations numerically at many moduli. In the end, only 18 appeared to fold up across all of .
The existence of an embedded vertical lift is also quite restrictive: for universality, even a single modulus where it fails rules a pattern out. At a given flattened torus, the conditions describing embedded lifts cut out an open cone, and when this is nonempty it is usually easy to numerically exhibit a point. So either a pattern lifted quickly, and we moved on to other moduli, or it failed at many hundreds of flattened tori of one modulus, and we discarded it. Only two patterns survived: the pattern of F.L.’s hexagonal torus, on , and one on .
These two were our candidates for universality, and for both we then confirmed everything exactly. To keep the polynomial checks simple, we restrict to 2-dimensional sections over , taking , , to be functions of , so that every polynomial is in and rather than five variables. We chose the sections and the heights together, by trial and error: we tried many candidate sections, and for each searched for heights that work along the whole section. The closer the sections and heights are to constant, the lower the degrees of the polynomials in the final checks.
On the vertex coordinates are simple (§ 3.1), so the polynomials have low degree and every check reduces to one in a single variable. On they are much more complicated, and even the simplest sections we know lead to polynomials that are irreducibly multivariable and of high degree: the lift proof rests on the signs of 131 irreducible polynomials in two variables, of degree up to 10 in one and 4 in the other, and the Jacobian has irreducible factors of degrees and , the latter with 220 terms. So we wrote the paper around the simpler one.
Polynomial Checks
Covering with families promoted the pointwise numerical checks required by Proposition 2.2 to familywise polynomial checks: each says that some polynomial in and does not vanish on a strip . Our two families were chosen so that each check comes down to a polynomial of the form (§ 6), which is linear in along each vertical line, and Lemma 7.1 below reduces it to checks on polynomials in alone. We also describe a second method, strip dominance, which is the one used by the file UniversalityProof. It needs none of this structure: it applies directly to the rational functions in our lemmas, without first putting them in this form, and certifies each check exactly.
Lemma 7.1 Let be an interval and , with and polynomials. Suppose that for every ,
, and
is either zero or has the same sign as .
Then has no zero on .
Proof: Fix . In the vertical line through is the ray , and along it is linear in , with slope . At the bottom of the ray its value is , and the slope is zero or has the same sign, so never vanishes on the ray. ♠
We now describe the general-purpose method. Its basic tool is a sign test for polynomials on the region .
Strip Dominance: Given a polynomial we define
Then on if , and on if , since
We call strip dominant if for one choice of sign
A strip dominant does not vanish on . More generally, does not vanish on if and are strip dominant; we call this the tweaked criterion.
Rational Parametrization: To apply this to a strip , which is bounded below by an arc of the unit circle, we change coordinates to turn it into . As goes from to , the point
runs along the unit circle from to , with rational coefficients. We choose rationals with
so that the arc from to lies over , and rescale it to by . Then
maps onto the part of above this arc, which contains the strip. We use and for Family 1, which covers , and and for Family 2, which covers . The choice of is extremely tight: just left of , at , the lift of Family 2 stops being embedded.
Certificate: Given a rational function , we write with and integer polynomials in and , and check that each of and satisfies the strip dominance criterion or its tweaked version. Then neither vanishes on , so is defined and nonzero on .
References
- [1960][BZ1] Y. D. Burago and V. A. Zalgaller, Polyhedral realizations of developments (in Russian) Vestnik Leningrad Univ. 15, pp 66–80 (1960)
- [1978][Br] U. Brehm, Oberwolfach report (1978)
- [1995][BZ2] Y. D. Burago and V. A. Zalgaller, Isometric piecewise-linear embeddings of two-dimensional manifolds with a polyhedral metric into R³, Algebra i Analiz 7(3), pp 76–95 (1995). English translation: St. Petersburg Math. J. 7(3), pp 369–385 (1996).
- [2016][Se] H. Segerman, Visualizing Mathematics with 3D Printing, Johns Hopkins U. Press (2016)DOI
- [2024][LT] F. Lazarus, F. Tallerie, A Universal Triangulation for Flat Tori, Discrete and Computational Geometry 71 (2024) pp 278–307arxiv.org/abs/2203.05496
- [2025][DS] P. G. Doyle and R. E. Schwartz, Collapsibility and Near Universality for Vertex Minimal Paper Tori, arXiv:2510.12623 (2025)arxiv.org/abs/2510.12623
- [2026][L] F. Lander, The Two Most Symmetric Flat Tori as Eight-Vertex Paper Tori, arXiv:2609.10703 (2026)arxiv.org/abs/2609.10703
- [2027][ALM] P. Arnoux, S. Lelièvre, A. Málaga, Diplotori: a family of polyhedral flat tori. in preparation
- [2028][S1] R. E. Schwartz, Vertex Minimal Paper Tori, arXiv 2507.14998 (2025)arxiv.org/abs/2507.14998
- [2029][S2] R. E. Schwartz, The Most Efficient Origami Torus, P.N.A.S. 123 (21) (2026)DOI



