Loop closure — where it appears
Named by 20 essays across 9 fields — each of them below, with the objects they name alongside it.
The chain that does not close
Every mechanism on this site so far has been a loop, and a loop is why a configuration here is a solve. An arm has no loop. Its pose is a product of six transforms, evaluated, with nothing to converge and nothing to refuse — and the difficulty does not disappear, it moves to the other end of the problem.
Four bars and four pins
The smallest interesting machine there is. Four lengths decide everything about it — which link can turn all the way round, how hard it pushes, where it stops and whether it can be assembled at all — and every one of those is a number that falls out of a solve rather than a judgement about a drawing.
Two circles, four answers
A four-bar with its crank held still is two circles, and two circles meet twice. Bézout's theorem says four. The two missing answers are not a rounding error and are not special to these link lengths — they are the same two points for every pair of circles ever drawn, and they are the beginning of a way of counting that has so far been done by hand.
Same links, same pins, different machines
Watt's six-bar and Stephenson's have six links, seven pins, four binary links and two ternary ones. Every count anybody can make on them agrees. They are different chains, they give two mechanisms and three, and the difference is whether the two ternary links share a pin.
The loops are in the graph
Before a network is a mechanism it is a graph, and the one quantity that can be read straight off a drawing is how many independent loops it has: edges less nodes plus one. Grübler's count is that arithmetic and nothing else — which is why it is right about a tong at every size and says a deployable ring cannot open.
Bennett, and the condition that moves it
A spatial four-bar is immobile by every count there is, and generically it cannot even be assembled at more than isolated configurations. Bennett found the one relation between four lengths and two twists that makes it turn through a full revolution — and break the relation by two parts in a thousand and most of the travel is gone.
The solver was refusing a quarter of the sweep
Four numbers in this site's Jacobian had the wrong sign, from the foundation phase until now. Every picture it ever drew was correct, because a wrong derivative does not move a converged answer — it just makes Newton crawl, until the stall rule declares the position unreachable. The symptom was a sweep quietly returning fewer frames than it asked for, and no gate in the fleet has a rule against that.
The machine, compiled
Twenty bars, twenty joints, and one degree of freedom. Every position is a converged solve on thirty-five equations, none of which mentions the polynomial — and the polynomial at the tracing point reads 1.3 × 10⁻¹⁴ across the whole working arc.
The ring that closes at every size
Two bent bars pinned at their kinks hold the angle between their connection lines at 135.000000° whatever you do to them, and two straight ones hold it at nothing. That is the whole difference between a scissor chain that grows in a line and a ring of eight that opens and shuts — and the count says the ring cannot move.
Two to the power of the dyads
How many ways a mechanism can be assembled at a given input angle is a count of configurations, and it is predicted here by a graph: two circles per pair of links, so two to the power of the number of pairs. The prediction came back four for Watt's chain and the count came back eight, and the four extra had a link turned inside out.
What has to be solved together
Hold a link, turn a neighbour, and the rest of a mechanism comes apart into the smallest sets that can be positioned one after another. Every set of two links is two circles meeting — a quadratic, two branches, no solver. A set of four is a system, and this site's Newton solve stops being a convenience.
Four that a compass cannot reach
Twelve of the sixteen eight-link chains can be positioned two links at a time, from at least one choice of frame and input. Four cannot be positioned that way from any of their twenty choices — and at ten links ninety of the two hundred and thirty are in the same position.
The proof drew more than the curve
Sixteen ways to assemble one linkage. Eight of them close. Four put the tracing point on the curve and four put it somewhere else — at a closure residual of 9.6 × 10⁻¹⁵, which is the same floor the right ones reach. No tolerance on the closure could ever have told them apart.
In space there is one chain
A body in space has six freedoms and a revolute joint takes five, so a mobility of one needs (6n−7)/5 joints — an integer only when the link count leaves a remainder of two on division by five. At seven links every link is binary, the graph is a single seven-cycle, and there is exactly one spatial chain.
Pin the tool and it is a loop
Hold an arm's tool still and the open chain becomes a closed one, which this site has known how to count since its first field. Kutzbach's criterion says a pinned six-joint arm is a structure. At each of its three singularities the measurement says it can still move — the site's founding finding, arrived at from the far end of its own subject.
Where the machine stops being the function
Drive a reflector through the angle at which its rhombus flattens and it comes out computing something else. Nothing breaks: every bar is the length it was, the closure residual stays at 8 × 10⁻¹⁴, and the machine goes on turning. That is why every compiled machine in this field works over an arc and not a turn — the quintic's over a tenth of a radian.
The chain has no lengths
Every number in this field survives multiplying every link by a different scale factor, because there are no lengths to scale. Which is also the statement of what a census cannot decide — and the sixteen eight-link chains, each given one arbitrary set of dimensions and driven, produce a chart in which nothing belongs to the chains.
Six things a compiled linkage is not
A closure residual read as a verdict, a theorem read as a design, an exact answer read as an accurate one, a degree read as a cost, a construction read as a search, and a neighbourhood read as a turn. Six claims, each of them what a careful person would say, each answered with a number.
An arm is a tree
The serial field's chains are the ones that never close, and as graphs they are trees. There are 106 distinct arrangements of ten links joined that way, and exactly one of them is the straight arm every essay in the field has drawn — the other 105 branch.
Where the shortest loops are
A tolerance stack-up goes round a loop, and every link the loop passes through is a dimension in it. Two eight-link chains with the same links, the same pins and the same number of loops can need twelve link lengths in their shortest independent set or fifteen — decided by the graph, before any dimension is chosen.
Named alongside it
The objects these essays reach for when they reach for this one.
MobilityAssembly branchKinematic chainType synthesisCanonical formCompiled linkageDegrees of freedomAssur groupConstraintDyadInversionKutzbach's criterion