Machine Kinematics
solved, then drawn
Concept

Universality — where it appears

The result that every plane algebraic curve is traced, in a neighbourhood, by a point of some linkage. It closes the question of which curves a linkage can draw and says nothing about how large the linkage is or how much of the curve it covers.

Named by 6 essays across 3 fields — each of them below, with the objects they name alongside it.

What the machine draws, against where the polynomial vanishes. Two objects, found two ways. The thin line is the set where x^4 + 2x^2y^2 + y^4 − 1.2x^2 + 1.2y^2 is zero, walked over a grid with no mechanism involved. The marks are where the compiled machine's tracing point went, one per converged solve, over the 147 positions of its working arc. The machine's constraint set never mentions the polynomial, so evaluating it at each traced point is an independent check: the worst value over the whole arc is 3.7e-13. The arc is 1.30 radians of the driving angle and not the whole turn, and past that arc it draws something else.

A demand that is an equation

Every field on this site is handed its demand geometrically — three positions, a sampled path, a ratio at each angle — and hands back a mechanism that is right at those places and approximately right between them. This one is handed a polynomial, and the mechanism that comes back satisfies it everywhere it moves.

computing · Compute Every curve in the catalogue, compiled and counted. The bar count is not a formula: it is the number of bar constraints the compiled mechanism actually carries, asked of the object rather than predicted. A line costs five bars and a quintic four hundred and thirteen, which is the field's central number — exactness is paid for in size. The all-revolute column replaces the one prismatic pair that closes the chain with a Peaucellier cell, which costs seven bars whatever the curve, so it is more than half the machine on a line and a rounding error on a quintic. The last column is the polynomial evaluated at the traced point, worst over each machine's working arc.

Five bars for a line, four hundred for a quintic

Nine curves compiled and counted: a line at five bars, a circle at eleven, a lemniscate at fifty, a general quintic at four hundred and thirteen. The growth is a fourth power of the degree, and three quarters of the largest machine is not computing anything at all.

computing · Compute What each curve costs, in cosines. Every polynomial in the two arm angles is a constant plus a sum of terms A cos(mα + nβ + φ) with whole-number m and n, and the number of those terms is what a machine has to build. The count is not the degree and not the monomial count: a circle costs one term, a general line two, and a lemniscate — degree four — costs five, fewer than the cubic above it, because its symmetry cancels frequency pairs the cubic keeps. Each row's expansion was checked against a direct evaluation of its own polynomial at random angles, worst disagreement 1.8e-14.

Prescribing a curve rather than points

A four-bar can be made to pass through nine prescribed points and no more; past nine the problem is over-determined and the answer is an optimiser's. Prescribe the whole curve as an equation instead and there is no counting to do — but the mechanism that comes back has four hundred bars where the four-bar had four.

synthesis · Synthesis Bars against terms, over the whole catalogue. One mark per compiled machine. The bar count rises much faster than the term count, and the reason is the summing chain: term k has to have its direction carried to the k−1th vertex of the chain, one parallelogram per hop, so the carrying costs a translator for every pair of terms. Nine curves, from five bars to four hundred and thirteen, on a term count that goes from one to eighteen.

What universality is worth

The linkage exists, it is four hundred and thirteen bars, and it draws ten degrees of its curve. All three are true and only the first is in the theorem — which is the ordinary shape of a result about what exists, and the reason it was worth building one to find out.

computing · Compute Every way the same bars can be put together. The machine compiled from a rectangular hyperbola has 4 parallelograms, and a parallelogram's four bars also close as an antiparallelogram — so there are 16 ways to assemble it. One mark per way. 4 of them put the tracing point on the curve, 4 put it somewhere else, and 8 do not close at all. The ones that are wrong are not broken: they satisfy every bar to 9.6e-15 while the polynomial at their tracing point reads 1.5e-1. This is the gap in Kempe's original argument, and no tolerance on the closure could ever have found it.

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.

wrong · Misconception A rectangular hyperbola, compiled from a multiple of its equation. The machine compiled from p · (1 + x² + y²) for a rectangular hyperbola, with the translators — the parallelograms that carry a direction from where it is produced to where it is needed — in their own colour. The factor 1 + x² + y² is at least one at every real point, so every equation here vanishes on exactly the same curve. The machines do not agree: 20 bars at p, 75 bars at p · (1 + x² + y²), 144 bars at p · (1 + x² + y²)². This one solves 29 positions over an arc of 0.508 radians, and at every one of them the original polynomial reads 4.93e-14.

The price is on the equation

A line costs five bars. The same line, written as its own equation multiplied by a factor that is never zero, costs fifty — and the machine compiled from the longer equation draws the same line just as exactly. Every cost this field quotes belongs to a polynomial and not to a curve, and the cheapest equation of a given curve is a quantity nobody here has.

computing · Compute

Named alongside it

The objects these essays reach for when they reach for this one.

Compiled linkageCost modelWorking arcAlgebraic curveKinematic synthesisDegreeExact mechanismPrecision positionApproximate synthesisAssembly branchCoupler curveExistence proof

All concepts