Univalent positive polynomial maps and the equilibrium state of chemical networks of reversible binding reactions

We consider a map f=(f"1,...,f"n):R">="0^n->R">="0^n given for x=(x"1,...,x"n) byf"i(x)=x"[email protected]"i(x"i)[email protected][email protected]@[email protected]"ia"@ax^@a where I is a finite subset of Z">="0^n, a"@a is a constant in R">="0 for each @[email protected]?I, and @j"1,...,@j"n are differentiable order-preserving functions R">="0->R">"0. We prove that f is a bijection. Surjectivity arises as a consequence of the Brouwer Fixed-Point Theorem. For injectivity, we show that the Jacobian matrix of f is everywhere a P-matrix and we then apply the Gale-Nikaido Global Univalence Theorem. With @j"[email protected]"n=1, f is a positive polynomial map of interest in the study of chemical networks of reversible binding reactions. For these, we propose notions of elementary and composite species and of normal and complete networks. Many networks in pharmacology and other fields fall in these classes. We prove that their equilibrium states and detailed-balanced states coincide and are unique with respect to total concentrations of elementary species. The map f gives rise to an equation that has a unique solution which gives the equilibrium state. We also prove that concentrations always converge to the equilibrium state, thereby settling for complete networks the Global Attractor Conjecture, which affirms this property for the larger class of complex-balancing networks.