A complete one-state error–delay law for asymmetric three-node routing
We determine the complete minimax error versus peak angular delay law for rational-inner passive routing of degree at most one at three asymmetric boundary nodes, with one exceptional orthogonal target and two repeated targets. The result supplies both exact branches, the positivity transition, positive lower certificates, and an attaining two-port construction. We then invert the law: a prescribed chordal error determines the minimum delay through one uniquely isolated cubic root with an explicit positivity constraint, or an elementary expression in the active regime. Constant and degree-one branches, the jump at unit peak delay, the transition target and the unattainability of zero error at finite delay are included. Exact rational and symbolic certificates distinguish the continuum proof from supplementary numerical constructions. The result concerns a dimensionless one-state, three-node model and does not claim general circuit-component synthesis or higher-degree optimality.