One cut removes one arc
Assumes A cut is a licence and The loop is not the tangle.
A cut that removes no paper is a cut along an existing crease: the two panels that met along it are still there, still the same size, and the only thing that has changed is that they are no longer joined. In this collection’s terms one edge stops carrying a letter and becomes a raw edge, and everything downstream follows by itself — a vertex at either end now has paper on one side only, so it stops being an interior vertex and every condition being evaluated there stops applying.
A cut is a licence counted what that buys in letterings, and the answer is a great deal. Cutting a crease with an interior vertex at each end releases two vertices from every condition in the subject, and it halves the number of pieces the pattern’s folding set breaks into — so the cut does not merely add letterings, it joins pieces that no local change could get between.
There is a second question about the same operation and the two answers point in opposite directions.
The repair that suggests itself
A crease pattern’s letters can contradict themselves: each crease fixes which of its two panels lies above the other, and a chain of panels each of which must lie below the next is a proof that no order exists. The tangle that chain lies in is most of a tessellation patch, and between forty and sixty-two per cent of the pattern’s arrows run inside it.
A cut removes exactly one of those arrows. It is the smallest change to the layer relation anybody can name — smaller than moving a crease, smaller than changing a letter, since changing a letter reverses an arrow rather than deleting it.
So try it. Every crease, one at a time, on four patches.
Sixteen of four hundred and seventy-four, and the four hundred and fifty-eight are not failures to repair. They are sheets that no longer have a folded state at all.
Why the sheet stops placing
The panels of a flat-folded pattern are put where they go by composing reflections. Start anywhere, walk to a neighbouring panel across a crease, and reflect; walk again and reflect again. Where a panel ends up is the product of the reflections along the path, and the whole thing is only consistent because every other path to the same panel gives the same answer.
Cut a crease and that walk loses a step. The two panels it joined are still adjacent — they still share an edge — but crossing that edge is no longer a fold, so nothing about it says where the far panel goes. The paper is free to swing there.
That freedom is exactly what a cut is for: it is why one cut buys a sheet things a fold cannot, and why a slit lets paper reach configurations no crease pattern reaches. It is also why a cut sheet is not a flat folded state in the sense the layer relation is defined on. There is no single arrangement of panels to order; there is a family of them.
The machinery refuses such a sheet rather than ordering an object that is not determined, and it refuses it by noticing that the panels no longer close: composed one way the far panel lands here, composed another it lands there, and the disagreement is of order one rather than of order a quadrillionth.
It is worth noticing that this is the same refusal the collection has met from the other direction. The placement check exists because a pattern whose panels do not close is not a folded state and ordering one would be ordering something that does not exist. It was written against tessellation patches whose construction was wrong, and it turns out to be the thing that stops a cut being treated as a small edit.
The creases that cannot be cut are the ones that matter
The sixteen surviving cuts have a property in common, and it is the finding.
Every one of them is a cut at a crease reaching the sheet’s edge. Not one cut of a crease with an interior vertex at each end — a buried crease — leaves a sheet whose panels place. On the square patch, where sixty of the eighty-four creases are buried, that removes sixty of the candidates before anything else is considered.
And the buried creases are where the contradiction is. The letters a local move cannot reach are exactly the buried ones, and the arrows inside the tangle number fifty-two of eighty-four on the square patch against sixty buried creases — so the arrows a repair would have to reach are overwhelmingly on creases a cut cannot touch without destroying the sheet.
That is a considerably sharper statement than the cut does not help. The operation’s reach and the fault’s location are complementary: a cut works at the rim, and the fault is not at the rim.
The sixteen that survive are worth a sentence too, since sixteen is not nothing. They are cuts at creases with an end on the rim — a slit from the edge inward, in effect — and after them the patch still places because the freedom the cut introduces happens to be pinned by the rest of the pattern: the far panel has another route to it that is still all reflections. Whether that happens depends on where in the patch the crease is rather than on anything about the crease itself, which is why it is fourteen creases on one patch and none on another.
The two vertices a cut releases
There is one more asymmetry between the two accountings and it explains the rest of them.
Cutting a buried crease releases two interior vertices. Each of them had paper on both sides and four conditions being evaluated there; after the cut each has paper on one side only, and the conditions stop applying. That is the source of everything generous the operation does in the space of letterings: two fewer constrained points means a great many more admissible labellings, and the pieces of the folding set merge because the buried crease is no longer buried.
The layer relation does not care about vertices at all. Its arrows are one per crease and its chains are chains of panels; releasing a vertex changes nothing it reads, except by deleting the one arrow. So the operation’s whole benefit is spent in a currency the contradiction is not denominated in.
The generosity is exactly a factor of eight
The two accountings can be priced against each other, and pricing them turns the disagreement from a qualitative one into an arithmetic one.
A pattern with creases and interior vertices admits about letterings: two to the crease count, divided by four at each vertex, since Maekawa halves and the smallest-sector lemma halves again.
Cut a buried crease. The crease count falls by one and the interior vertex count falls by two, so the admissible count becomes
Exactly eight times as many letterings, from one cut. The lost crease costs a factor of two and the two released vertices buy sixteen.
And it is only available where it destroys the sheet
Now do the same for the cuts that survive.
A crease with one end on the rim releases one interior vertex, so the count goes as — a factor of two. A crease with both ends on the rim releases none, and the count halves.
So the three kinds of cut are worth eight, two and a half, and the sweep says the first kind always destroys the folded state while the other two sometimes do not.
The operation’s entire generosity lives on the creases it cannot be applied to. That is a sharper version of the essay’s conclusion than “the benefit is spent in the wrong currency”: the benefit is a factor of eight, it is exactly the benefit a designer would want, and it is available only at the price of the object.
The sixteen survivors are therefore worth two apiece at best, against sixty candidates worth eight that cannot be taken. Sixteen cuts buying a factor of two each, on patches whose consistent letterings are one draw in eight, is a repair that does not move the number it would need to move.
It also explains the shape of the sweep’s result without needing the sweep. Every crease worth eight is buried by definition — a factor of sixteen requires two interior vertices — and every buried crease takes two panels’ worth of placement with it. The two properties are the same property, so no amount of searching the crease list could have turned up a cut that was both generous and safe.
Two accountings of one operation
Put the two measurements side by side and the disagreement is the point.
In letterings, a cut of a buried crease is generous. It releases two vertices, halves the piece count of the folding set, and joins regions of the space that were unreachable from one another. It is the largest single change to the combinatorics available.
In layers, the same cut is not a change at all. It removes one arrow and takes the folded state with it, so the question the arrow was part of stops being askable.
Neither accounting is wrong; they are about different objects. The first is about the space of labellings a pattern admits, which is combinatorial and knows nothing about where the paper goes. The second is about one labelling’s folded state, which is geometric and is destroyed by the freedom the first is celebrating.
The lesson is the general one about operations that look small: small has to be measured against the thing being preserved, and a cut preserves the crease pattern while destroying the folded state. A cut is not local made the same point about a different consequence.
What a folder would find
The account above is entirely about what a checker can compute, and the thing on the table behaves the same way, which is worth saying because it is not obvious.
Take a patch that has been printed, cut one of its interior creases with a knife, and try to fold it. The pattern is unchanged everywhere else. What has changed is that at one place the paper can be moved without moving anything else — the two panels can slide past one another, or rotate, or lie in either order — and the sheet no longer has a folded form. It has a range of them, and which one a folder ends up with depends on how they held it.
That is not a repair to a fold. It is a different object, and the reason this collection prints no cuts on its ordinary patterns is precisely that the thing a reader is meant to hold together is determined by the crease pattern alone.
What would count as a repair
Three operations are available against a contradiction, and now they can be ranked properly.
Change a letter. This reverses one arrow rather than deleting it, and it keeps the folded state — the panels still place, because a mountain and a valley reflect across the same line. It is the only one of the three that leaves the object intact. Its problem is that a single flip almost always breaks a vertex condition, so the change that is legal is a pair of flips at a shared vertex, and on a tessellation patch there are almost none of those: of two hundred and sixteen candidate pairs on the square patch, none is legal.
Cut a crease. Removes one arrow, and the folded state with it, on every buried crease.
Reletter entirely. Draw a different admissible labelling from scratch. This is the only one that works, and on the square patch about one draw in eight produces a labelling with no contradiction anywhere.
There is no path of small changes from a bad labelling to a good one. That is not a failure to look hard enough — it is what the freeze on the move graph means, and the cut was the last remaining candidate for a small change.
How many cuts would be enough
The question the sweep does not answer is how many cuts it would take, and there is a reason it cannot be answered the way it is posed.
Removing arrows until a directed graph has no circle in it is a well-defined thing to want and a hard thing to compute — on the square patch it would mean deleting some subset of the fifty-two arrows inside the tangle, and finding the smallest such subset is not something a sweep gets to. But the harder obstacle is upstream: after the first cut there is no folded state, so there is no second graph to remove an arrow from. The sequence stops at one.
That is not a limitation of this collection’s machinery. It is a statement about what a cut sheet is. The layer relation is defined on a determinate folded object; cutting produces an indeterminate one; and the honest thing to report is a refusal rather than a number obtained by pretending the freedom is not there.
There is a version of the question that does have an answer, and it belongs to a different subject. Cutting the sheet into separate pieces and folding each is always possible and always trivial — the limit is a pattern cut along every crease, which is fifty-two loose panels — so the interesting quantity would be the fewest cuts leaving the sheet in one piece and the panels ordered. Nothing here computes it, and stating what it would be a question about is as far as this goes.
The operation that does keep the folded state
For completeness: there is a change to a pattern that removes an arrow and leaves the folded state intact, and it is not a cut.
Reversing a letter keeps everything geometric. A mountain and a valley reflect across the same line, so the panels land in exactly the same places and the placement is untouched; what changes is the direction of that crease’s arrow. So a letter flip is a genuinely minimal edit to the layer relation — it reverses one arrow rather than deleting it, and reversing an arrow can break a chain.
Its problem is elsewhere. A single flip almost always breaks Maekawa at both ends of the crease, so the legal move is a pair of flips at a shared interior vertex, and on a tessellation patch there are none: of two hundred and sixteen candidate pairs on the square patch, not one leaves every vertex condition satisfied.
So the two candidate small changes fail in complementary ways. The letter flip preserves the object and is not available; the cut is available and does not preserve the object.
Where cutting does help
None of this says cutting is useless against layer problems in general. It says it cannot be used as a minimal repair to a pattern one intends to keep as a flat folded object.
Used deliberately it does something the folding cannot. A cut that reaches the edge changes the sheet’s boundary rather than adding one, and a sheet with a slit from the rim has a folded state where the uncut sheet had none — a ring with three creases across it is exactly that case, and one cut from the hole to the rim gives it a folded state with no crease moved and no letter changed.
The difference between that case and this one is which object the cut is asked to preserve. There, the sheet had no folded state and the cut created the freedom that let one exist. Here, the sheet has a determinate placement and the cut destroys it.
So the two answers are consistent after all, and the rule that reconciles them is short. A cut adds freedom. Freedom is what a sheet with no folded state needs and what a sheet with a contradictory one does not — the contradictory sheet has a perfectly good placement and a bad set of letters, and adding freedom to the placement leaves the letters exactly where they were.
Named alongside this one
Essays reaching for the same objects. Nobody chose these; they are what the concept index makes visible.
- The file records no verdict assignment · crease pattern · folded state · layer ordering
- The letters a crumple was given assignment · crease pattern · folded state · layer ordering
- A contradiction is even assignment · folded state · layer ordering
- A population that cannot fail assignment · crease pattern · layer ordering
- A tree cannot argue assignment · crease pattern · layer ordering
- Consistent is not foldable assignment · folded state · layer ordering
What links here
Every essay whose body links to this one.
The objects this essay names
Each one links to every other essay that touches it.
AssignmentBuried creaseCrease patternDegrees of freedomFolded stateKirigamiLayer orderingRepair