The Cheaper Topology

The connected components of a real algebraic curve are semi-algebraic sets — describable by boolean formulas over polynomial constraints. Computing these descriptions has applications in optical system design and robotics, where knowing which piece of a curve is connected to which other piece determines reachability and feasibility.

arXiv:2603.16283 designs an algorithm for computing semi-algebraic descriptions of connected components of real algebraic curves whose complexity is strictly less than the best known algorithm for computing an isotopic graph of the same curve.

An isotopic graph is a piecewise-linear approximation that preserves the curve’s topological type — the same number of components, the same connections, the same crossings. It is more information than you need if all you want is which components exist and how to describe them algebraically. The isotopic graph tells you the shape; the semi-algebraic description tells you the membership.

The complexity gap reveals an information-theoretic principle: describing membership in a topological feature is cheaper than describing the feature’s geometry. To know that a point belongs to a connected component, you do not need to know the component’s shape — only its algebraic characterization. The shape contains the membership but not vice versa, and the asymmetry is computationally exploitable.

The algorithm answers the question that applications actually ask. Optical design needs to know whether a configuration is on the same branch as another configuration, not what the branch looks like. The cheaper computation solves the real problem.