Redundant constraint — where it appears
Named by 47 essays across 13 fields — each of them below, with the objects they name alongside it.
Many loops, one freedom
A scissor lift, a folded sheet and a deployable ring are one small unit repeated thirty times, and three things change at once: the count of bodies becomes a parameter, mobility becomes the rank of a matrix, and a unit that moves can be rigid the moment it is joined to another of itself.
Each one moves, and together they do not
Take the pattern a Miura sheet folds along and move every interior vertex by a tenth of a panel. Every vertex still folds on its own — each is a spherical four-bar with a freedom of its own — and the four of them together fold to no angle at all, with a residual that starts at six millionths and never falls.
The mechanism Grübler says cannot move
Three parallel bars between two frames. Five links, six pins, and the criterion every engineering course teaches gives zero degrees of freedom — a structure. It is a mechanism, it is in drafting machines and locomotive coupling rods, and the formula cannot see why.
What a count cannot see
At ten links, 1,878 graphs satisfy Grübler's rule and 230 are mechanisms. The other 1,648 contain a subchain that is already a structure — and on 1,165 of them the count says one degree of freedom, the rank of the constraint Jacobian says one degree of freedom, and both are right about a mechanism that does not have ten links.
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 freedom that survives repetition
A Miura sheet has one freedom at four panels and one at a hundred and forty-four, and the count runs the other way: plus one, then nought, then minus three, minus fifteen, minus ninety-nine. The gap between them is exactly (n − 2) squared, which is a hundred repeated constraints on a sheet with one degree of freedom.
The seventh contact
Add a contact to a part that is already exactly constrained and it adds no rank, so it constrains nothing — and it is the only contact in the set that can fail to touch. For four legs on a floor the combination that constrains nothing is the alternating sum of the four, which is why a table rocks about a diagonal and never sideways.
Why the platform stays flat
A delta robot has three legs and three freedoms, and there is no obvious reason those freedoms should be the three translations rather than some mixture. The reason is a parallelogram in each leg, and the argument from there to "the platform cannot turn at all" is a constraint computation that takes six wrenches and a rank.
A constraint that has been said already
Every constraint matrix leaves two null spaces, and a mechanism only lives in one of them. The other is the set of combinations of constraints that come to nothing — and its dimension is exactly the amount by which the count is wrong, on a deployable ring, a Miura sheet and a framework with twelve bars and six joints.
One wheel on ice
A differential with one wheel stopped turns the other at exactly twice the cage, and the relation it imposes is satisfied the whole time — nothing has failed, nothing is confused, and the reason the car does not move is not in the kinematics. What is here is the other half: a locked axle is an overconstrained mechanism, and the sliding it produces is 2π times the track per circle driven, whatever the radius.
The contact that is free not to touch
A hexagon on five contacts holds, and taking one of the five away leaves the margin at 0.0914 — unchanged, to every figure. That contact constrains nothing the others were not already constraining, and what it actually does is become the one member of the set that is free not to touch, with the decision made by errors nobody controls.
The formula is repaired by the thing it replaced
Kutzbach's count is wrong about most of the mechanisms worth building, and every textbook gives the same repair — add back the constraints that were imposed twice. The repair works on every loop in these essays. It is also not a formula, because the number it adds cannot be read off the joint graph.
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.
Fragility has a direction
Tilt one axis of a Sarrus linkage out of true by a thousandth of a radian and it stops dead. Tilt the same axis of the same mechanism by two hundred times as much, in the other direction, and it drives through a full turn with nothing measurably wrong. Three orders of magnitude between two errors of the same size — and the direction that matters is the one the reciprocal screw system names.
It moves to first order and not at all
Two bars from one joint to two pinned ones, all three in line: the rank leaves a freedom pointing straight up, and lifting the joint stretches both bars. The obstruction is 1.414214, the walk travels a millionth of what it is asked to, and how far it gets is a property of the tolerance rather than of the mechanism.
The count was right and the name was wrong
The constraint field has checked Grübler's count against a Jacobian rank since the foundation, and the two disagree only where the geometry is special. Here is an assembly where they agree, where both are correct, and where the mechanism does not have the number of links it is described as having.
Why a hinge works
A door hinge with three knuckles is overconstrained — three axes imposed where one would do, and exactly parallel is a condition no bored hole has ever met. It works because the misfit is 0.507 times the error and the play in each knuckle is larger than that. The mechanisms these essays called unbuildable are built every day, and the thing that builds them is the clearance that was already there.
A bar between two midpoints
In a parallelogram the midpoints of two opposite sides are exactly one side apart, and in the crossed assembly they are not. One bar between them admits the first and refuses the second — and it is one redundant equation per parallelogram, added on purpose, on a site whose constraint field is otherwise about overconstraint arriving by accident.
The wheel that forbids nothing
Every wheel contributes the same row to the same matrix, and whether that row is a constraint on the vehicle or a statement about the wheel's own speed is decided by one factor of sin γ. At γ = 0 the vehicle may not move across the wheel; at 45° the row says nothing about the vehicle at all, and sideways costs exactly what forwards costs — to the last digit, and at no other angle.
Twelve bars and a symmetry
Six joints and twelve bars in space is Maxwell's count exactly: no mechanism, no redundancy, nothing spare. Place three pairs of the joints so that a half turn about one line exchanges them and it moves — a finite motion, walked with every bar held to five ten-thousand-billionths of its own length, on a framework the arithmetic calls a structure.
Every axis through one point
Bolt several rolling wheels to one rigid body and they impose one condition between them: every axle line must pass through a single point. The familiar steering formula falls out of it as a consequence rather than being quoted — cot δₒ − cot δᵢ = 0.574074 at a turn of six metres, of eight, of twelve and of twenty, on a track of 1.55 m and a wheelbase of 2.7.
One freedom and four hundred links
Braced, the machine compiled from a quintic has 1,249 equations in 1,096 unknowns and a Grübler count of minus a hundred and fifty-three. It turns. The rank of its constraint Jacobian is 1,095, so its mobility is one — and every one of the hundred and fifty-four surplus equations was added deliberately.
Six things a network is not
A count that is right about a difference and read as an answer, a nullity taken for a mobility, a flat state that cannot tell a mechanism from a structure, a scissor ring that closes nowhere, a vertex that folds while its sheet does not, and a null space computed with an instrument whose floor is above the answer. Six claims, each with the number that kills it.
What a pattern has to satisfy
Move an interior vertex of a crease pattern and the folded state generally stops existing. How many conditions the drawing has to meet is not a matter of taste: it is exactly the number of dependencies among the constraints, measured at one, four and nine on three sizes of sheet, and a hundred on a sheet of a hundred and forty-four panels.
What a fourth leg buys
Three leg lines fail to hold a platform when they meet at a point, which is one condition, so in every slice of the workspace the failures form a curve. Four lines fail only when all four meet at a point, which is two conditions, so the curve becomes isolated points. The fourth leg buys that and more, and it costs a machine that can no longer be assembled from any four motor angles.
The cell that repeats for ever
Take the size of a network to infinity and it stops being a parameter. What is left is one cell, six bars, and a question nobody has to ask about a finite assembly: does the pattern's period count as a body? A square grid is rigid if it does not and shears if it does, and so does the kagome.
A parallelogram a micron wrong
A parallelogram linkage sits exactly where two kinds of four-bar meet, so a parallelogram that has actually been made is always one of four other machines. Make one bar a micron wrong on a 300 mm frame and the input stops a tenth of a degree short of lying flat, or the output turns round there with an acceleration that grows as one over the square root of the error. A third bar turns the square root back into a misfit of one micron.
Which contact to make accurately
A hold turns a set of contact tolerances into one linear inequality, and the weights in it are the coefficients of the combination that cancels — a quarter each on a square held by four, and 0.144 to 0.424 on a hexagon held by five. Above that line the part goes in and below it there is no pose it can take at all: not badly located, not out of position, no fit.
Nine bars that ought to be rigid
Join each of three joints to each of three others and the nine bars leave no freedom, by the count and by the rank, wherever the joints are. Put one set on a line and the other on a line at right angles and the framework moves, all the way round a loop, with no bar repeating any other: take away any one of the nine and the motion is unchanged, take away any two and it gains a freedom. Tilt the lines by a degree and it still has a freedom by rank and cannot move at all.
Which diagonal rigidifies a grid
A three-by-three grid of squares needs five diagonals and eighty-one of the hundred and twenty-six ways of placing five will do. Which ones is not a rank question at all: it is whether a graph on the grid's columns and rows is connected, and eighty-one is the number of that graph's spanning trees.
A length error is undone by its own size
A parallelogram built a thousandth wrong loses its change point, and the two motions it could have chosen between end up a tenth of a radian apart — the square root of the error rather than the error. The radial play that joins them again is a thousandth exactly: not of that order, that number. It is the same number a third crank charges the same linkage in misfit, and no pin is worth more of it than any other.
The count says how many and not where
A kagome lattice has three joints and six bars in every cell and counts to exactly nothing, so a patch cut from it has as many mechanisms as its edge has lost bars: 5L − 5 for a rhombus of L cells a side, which the rank confirms at every size with no bar redundant. Straight or twisted, the number is the same. Where the mechanisms are is not: a straight patch keeps nearly half its edge weight in the middle, and a patch whose triangles are turned by 17° keeps a twentieth.
The right angle as a tolerance
Dixon's nine bars move only when their two lines are exactly perpendicular, and a framework built a degree off square has a freedom by rank and no motion at all. Give its joints clearance and it moves a bounded distance: the play each bar needs is proportional to the tilt and to the square of the travel, one constant serves every tilt, and all nine bars end up at that play exactly. Then it reaches its first crossing, where the push is as large as the motion ever makes it, and a hundredth of a push further costs fifty-eight times the law — square or not.
A contact turns and slides at once
A cam on its follower, a gear tooth or a pin in a slot takes one freedom away where a pin or a slide takes two, and it turns as well as slides. Give every joint of the four-bar, Watt's and Stephenson's chains a third label and there are 1,317 different chains. The rule that read slides off the graph extends to all of them, agreeing with the constraint rank on every one, and the two obvious shortcuts miss 36 and 769. What the graph cannot record is which way a contact's normal points — and on these chains that never matters, while a single stop added to a four-bar holds everywhere except through one point.
The error that is repeated
Thirty-two units cut on one setting of one machine are thirty-two copies of one error, not thirty-two draws from a distribution — so a tong's span is out by thirty-two times a unit's, not by the square root of thirty-two times it. The two estimates differ by a factor of 5.66, and the second one is the comforting one.
Every change point lies flat
A parallelogram a thousandth wrong is rejoined by a pin clearance of exactly a thousandth, at any of its four bearings. The obvious guess is that an ordinary change point — a linkage on one Grashof boundary with no equal bars — would need a clearance with a constant in front and would reveal which bearing is loose. It does neither, because every change point has its four joints on one line. What does acquire a constant is the angle: 2√(2bδ/c(g + a)) when the circuits separate, and a stall constant with no coupler or output in it at all.
A cable is half a brace
A square grid braced with rigid diagonals is rigid when a graph on its columns and rows is connected, so a three-by-three grid needs five braces and eighty-one sets of five will do. Brace it with cables instead, which pull and do not push, and each cable becomes one direction of an edge. The grid is rigid when that directed graph can get from every column and row to every other, which takes six cables, and only twelve of the 5,376 ways of placing six do it.
Twelve cables survive a slack one
A three-by-three grid braced with cables is rigid on six and never survives the loss of one while each cell holds a single cable. Let a cell hold two crossed and every one of the 262,144 fillings can be tried: none of eleven cables survives a slack one, thirty-six of twelve do, and the rule for which is a count at each row and column, two cables in and two out. That count is the whole rule on every grid narrower than four cells. At four by four it stops being enough, and a grid can meet it everywhere and still hang on a single cable.
A seventh leg opens the dead yaw
Six legs can never carry a paired Gough platform across its dead yaw without passing a singular pose, because their determinant changes sign there and every path crosses nought. Seven legs make no square matrix and have no determinant to change sign. They fail only where the twist the six leave free also does no work on the seventh, a second condition that paths miss. Placed well, a seventh leg holds the platform's smallest singular value near 0.029 through the dead yaw, above the six legs' own value ten degrees off it, on every one of a hundred random paths across. What it cannot do is lift the platform further than the six's next-weakest direction allows.
A spare is worth what its pretension leaves
Thirty-six ways of placing twelve cables on a three-by-three grid survive a slack one, and the count at each node cannot tell them apart. Their loads can. Pretensioned at its best, every one of them takes a load of about 1.1 times its largest pretension before a cable goes slack. Lose a cable and the pull it carried is shared out elastically, and what survives is between a quarter and a four-hundredth of that. A pretension chosen for the loss instead of for the intact grid lifts the worst case: to 0.32–0.40 on the Latin squares, 0.22–0.27 when four cells are crossed, and never above 0.096 when six are. The family to build is the Latin square, and even among Latin squares three kinds of spare are not equal.
A seventh leg must lean its own way
Seven legs on a Gough platform fail only where the twist the six leave free does no work on the seventh. Near the paired platform's dead yaw that set is decided by one angle: how far round the axis a leg's platform attachment sits from its base attachment. The six legs all lean 82.5° or 97.5°. A seventh at either lean joins them and is singular at every level position; a seventh at any other lean is singular at none. Tilted, the failing leans spread out from the six's, to 74.5°–107° at four degrees of tilt and 44.5°–137.5° at eight, and never reach the far side of the axis, where the best leg leans.
A third slide moves only through the crossing
Every point of a double slider's rolling circle runs on a line through the slides' crossing, so a rod can ride a third block on a third slide there, and a fourth and a fifth. The count gives nought, then minus one, then minus two; the rod turns freely every time, because each slide past the second is implied by the first two. Build the third slide slightly wrong and the count wins, in a way that depends on the error's kind: moved parallel, the rod turns freely inside the block's clearance and does not assemble outside it; turned by ε about the crossing, it moves only in two windows a turn, of 2·arcsin(c/(2r sin ε)) each, where the third pin passes through the crossing.
A seventh leg has no dead yaw of its own
Seven legs can only be singular where six already are, since a 7 × 6 matrix that loses rank takes every 6 × 6 minor with it. Level, over a whole turn of yaw and the whole workspace, the paired Gough platform's six legs are singular at two yaws only, the dead yaw and the yaw half a turn on, and at both a seventh leg fails exactly when it leans as the six do. The best seventh leg leans the other way at both, so it has no dead yaw of its own. Its singular set exists, and it hugs the six legs' dead yaws, but it comes in only at tilts of 15° and more.
A grid that loses two crosses every cell
To stay rigid when any two of its cables go slack, a cable-braced grid needs three arrows into and out of every row and column of cells. On three by three that is eighteen cables, both diagonals of every cell, and no placement of seventeen survives. On four by four it leaves 576 placements of 24, and for once the count is the whole rule. Pretensioned for the intact grid, 570 of them lose a cable outright to some pair of losses. Pretensioned for the pairs, all of them keep something, and the bracings with no empty cell keep the most, up to 0.198 of the largest pretension.
A fourth block can only take freedom away
A rod on a double slider can carry a third block on a third slide through the crossing and still turn, and a slide turned slightly wrong leaves it free only in two windows a turn. The hope was that a fourth block, at the point of the rolling circle opposite the third, would travel in opposition and cancel the error. It cannot, for two reasons. The opposite pin is the other end of a diameter: it runs on the perpendicular slide, a quarter of a turn out of phase, so its windows fall exactly between the third's. And whatever its place, a block only adds a condition the rod must also meet, so the rod's freedom is an intersection and can only shrink. With the double slider's own blocks exact, the third and the opposite fourth turned 0.0066 rad each lock the rod, where the third alone still moves at any error.
Fit every extra slide at one pose
A double slider's extra slide, turned slightly wrong, leaves its block free in a band of the slide centred on the point it was turned about, and the rod free in windows where the pin passes through that band. Turned about the crossing, a third and an opposite fourth block have their windows a quarter of a turn apart and lock the rod from 0.0066 rad. Set each slide through its own pin at one common pose of the rod and every error becomes a turn about the place its pin has then, so every window contains that pose and the rod can never lock, with two blocks or six. Each slide pivoted where it alone is freest does better while the errors are small and locks from between 0.02 and 0.05 rad, where the common pose 45° from either crossing comes within a tenth of the best pivots there are.
A piano hinge is not forty door hinges
A three-knuckle hinge works because the misfit its bore errors create is smaller than the play already in its pins. A piano hinge has forty knuckles and thirty-nine of them are redundant, so the obvious reading is that it needs thirteen times the play. It needs two and a half times, and it can never need more than the bore tolerance itself — because a rigid leaf has one axis and a line through the middle of the errors misses every bore by at most the largest of them.
Named alongside it
The objects these essays reach for when they reach for this one.
MobilityRankOverconstraintNetworkGrübler's criterionToleranceClearanceDesign ruleConstraintConstraint jacobianDegrees of freedomNull space