Optimal Affinity Beyond Gross Stoichiometry
Abstract
Despons, De Decker and Lacoste showed that for a tightly coupled mass-action autocatalytic network whose overall reaction consumes and produces copies of the controlled autocatalyst, the thermodynamic affinity at which the production flux is maximal equals for generalized Type I networks, is at least for the class of non-intersecting networks, and they conjectured that the lower bound holds in general. We show that the conjecture is false. A two-species, two-reaction reversible network with an invertible stoichiometric matrix, a possible detailed-balance state and a unique global production maximum has . The mechanism is recycling: a reaction that returns part of its product response to an already active reaction coordinate dilutes the gross amplification. We then identify the exact response-level replacement of the gross ratio. With the response matrix built from the reactant and product complex matrices, and the integer production mode, the capacity over the forward-response cone is the greatest lower bound of over all represented optima, and the gross bound holds at this level exactly when . An explicit family of networks with has and realizes every value in at a unique global maximum, so no uniform positive gap survives; a three-reaction network with zero-diagonal response matrix shows that elementary self-return is not necessary for failure. Our main positive result is that the relaxation is tight at the level of nondegenerate local optima: for square sources with nonnegative response matrix, control-accessible cone and a response-routing digraph with a unique terminal strong component, every point of the forward-response cone is the response profile of an actual positive mass-action network at a regular stationary branch with a nondegenerate strict local production maximum, so the response capacity equals the strict-local kinetic capacity. The proof factors the current Jacobian through a response Laplacian that is diagonally similar to for a row-stochastic routing matrix , uses a rooted maximum principle to make the kernel one-dimensional, removes it by the control gauge, builds the branch by the inverse function theorem, and proves negative curvature through an exact left-null identity that expresses the normalized curvature as a stationary-weighted average of response products. Interior minimizers of satisfy a prescribed-marginal matrix-scaling identity. Global optimality needs more than response data: we give a tangent-gap certificate and an infinite two-reaction family with unique global maxima, and exact two-core examples show that direction and complex-level compatibility of interacting cores do not imply a common kinetic realization. All principal theorems are compiled in Lean 4 against Mathlib with no unproved declarations.