\section{Setting and main theorem}\label{u:sec:setting} Let $E$ be a finite index set of reactions. For $e\in E$ let $y_e,y'_e\in\R^d_{\ge0}$ be its source and target complex and $\nu_e=y'_e-y_e$ its reaction vector. Parallel reactions, self-loops ($\nu_e=0$) and the empty family are permitted. Put \[ S=\spanR_{\R}\{\nu_e:e\in E\},\qquad P_c=(c+S)\cap\U\quad(c\in\U). \] For $x\in\U$ and $y\in\R^d_{\ge0}$ write $x^{y}=\exp(\sum_i y_i\log x_i)$, the usual monomial when $y$ has natural coordinates. \begin{definition}[Ordinary endotacticity]\label{u:def:endo} The network is \emph{endotactic} if for every $r\in\R^d$ and every $e\in E$, \begin{equation}\label{u:eq:endo} r\cdot\nu_e<0\quad\Longrightarrow\quad \exists\,j\in E:\quad r\cdot\nu_j>0\ \text{ and }\ r\cdot y_j0$ for every $r$ and $\vartheta(0)=1/2$; no continuity of $\vartheta$ is assumed or true. \begin{lemma}[Affine approximation with discontinuous tolerance]\label{u:lem:affine} There are a nonempty finite label set $I$, slopes $r_\ell\in[-1,1]^d$ ($\ell\in I$) independent of $h$, offsets $b_\ell(h)\in\R$ defined for small $h>0$, and $h_g\in(0,1)$ such that, whenever $00 . \end{equation} Let $x=h^{q}\in B_h$ with $0|r\cdot v|/2\ge H . \end{equation} Since $x^{y}=h^{q\cdot y}$ and $0H$. Here $y,z$ are any complexes of the network. The positive gap $H$ belongs to the fixed finite slope family; exact zero comparisons are omitted from its definition. \section{Endotactic drift and the convex plateau}\label{u:sec:drift} Call a slope $r$ \emph{neutral} if $r\cdot\nu_e=0$ for every $e$, that is, $r\perp S$. \begin{lemma}[One witness below all adverse sources]\label{u:lem:witness} Let $r$ be nonneutral. There is $j\in E$ with $r\cdot\nu_j>0$ and $r\cdot y_j0$ and $r\cdot y_j0$, and there is no inequality to check. \end{proof} For each nonneutral slope $r=r_\ell$ of the fixed family choose such a witness $j=j(\ell)$ and set \[ \alpha_r=\underline k_{j}\,(r\cdot\nu_{j})>0,\qquad \beta_r=\sum_{e:\,r\cdot\nu_e<0}\overline k_e\,|r\cdot\nu_e|\ \ge0 . \] Let $k\in\B$, $00$ be the least of their $\alpha_r$. Then for $00 \qquad\text{for every nonneutral label $\ell$ active at $x$.} \end{equation} A neutral slope has $r\cdot f_k(x)=0$ identically. If every slope is neutral the strict statements below are vacuous and any $\delta_h>0$ may be used. All choices so far depend on the network and $\B$ only. \paragraph{The plateau at a class representative.} Now fix $c\in\U$. Choose $h_c\in(0,h_g)$, depending on $c$, so that $\norm{\log c/\log h}_\inftyH$; hence every slope active at $c$ is zero. Pick such a label and put $M_h=F_h(c)$. Its branch is the constant $M_h$, so $F_h\le M_h$ on all of $\R^d$, and every other constant branch is $\ge M_h$. Define the \emph{plateau} \begin{equation}\label{u:eq:plateau} C_h=\{x\in\R^d:F_h(x)=M_h\}=\bigcap_{\ell\in I}\{x:r_\ell\cdot x+b_\ell(h)\ge M_h\}, \end{equation} a closed convex polyhedron containing $c$. \begin{lemma}[Compact plateau and classwise strict drift]\label{u:lem:plateau} For every $00$ with $A\eta\le\rho$ and $L\eta<1$, the Picard map \[ (\mathcal Tu)(t)=x_0+\int_s^t f_{k(v)}(u(v))\,dv\qquad(t\in[s,s+\eta]) \] sends continuous paths in the ball to continuous paths in the ball and is a contraction; its fixed point is an integral solution, hence absolutely continuous and a solution of the equation almost everywhere, and any two solutions agree on $[s,s+\eta]$ by the same estimate. Repeating the construction yields a unique maximal positive solution, and all its integral increments lie in the closed subspace $S$, so it stays in the affine class $c+S$ as long as it exists. Let $x$ be a solution segment in $B_h$ and put $g(t)=F_h(x(t))$. The minimum of finitely many affine functions is Lipschitz with constant at most $d$ in the maximum norm, so $g$ is absolutely continuous on every compact interval. At almost every $t$ the curve, $g$, and each branch composition $t\mapsto r_\ell\cdot x(t)+b_\ell(h)$ are differentiable and the equation holds. If $\ell$ is active at such a $t$, the nonnegative differentiable function (branch minus envelope) vanishes at $t$, so its derivative there is zero and $g'(t)=r_\ell\cdot f_{k(t)}(x(t))$. This handles ties among active branches without selecting one. Hence, while $x(t)\in P_c\cap B_h$, \begin{equation}\label{u:eq:acdrift} g'(t)\ge0\quad\text{a.e.},\qquad g'(t)\ge\delta_h\quad\text{a.e. on }\{t:g(t)0$ and let an admissible history satisfy $k(t+\tau)=k(t)$ for almost every $t\ge0$. Then there is a positive solution with $x(t+\tau)=x(t)$ for all $t\ge0$, taking all its values in $K$. \end{corollary} \begin{proof} The time-$\tau$ map $\Phi_\tau(z)=x_z(\tau)$ sends $K$ to itself by invariance and is continuous by Proposition~\ref{u:prop:dependence}. Brouwer's fixed-point theorem, applied in the affine hull of the nonempty compact convex set $K$, gives $z\in K$ with $\Phi_\tau(z)=z$. The shifted curve $t\mapsto x_z(t+\tau)$ is absolutely continuous on compact intervals, starts at $z$, and satisfies the equation almost everywhere because translation preserves null sets and the coefficients agree almost everywhere; by uniqueness it equals $x_z$. \end{proof} \begin{corollary}[Autonomous equilibria]\label{u:cor:equilibrium} For every constant $k\in\B$, every positive stoichiometric class of an endotactic network contains a positive equilibrium of $f_k$. \end{corollary} \begin{proof} Write $f=f_k$ and $\Phi_s$ for its flow. For $\tau_n=1/(n+1)$, Brouwer gives $z_n\in K$ with $\Phi_{\tau_n}(z_n)=z_n$; pass to a subsequence $z_n\to z_*\in K$. With $A$ a bound for $\norm f$ on $K$, $\norm{\Phi_s(z_n)-z_n}\le As$ for $0\le s\le\tau_n$, so these short arcs converge uniformly to $z_*$, and uniform continuity of $f$ on $K$ gives \[ 0=\frac{\Phi_{\tau_n}(z_n)-z_n}{\tau_n}=\frac1{\tau_n}\int_0^{\tau_n}f(\Phi_s(z_n))\,ds \longrightarrow f(z_*). \] \end{proof} A fixed point of a single time-$\tau$ map could lie on a periodic orbit; the shrinking times are needed. The permanence-plus-Brouwer route to equilibria has a two-species antecedent in \cite[Remark~6.2]{CraciunNazarovPantea2013}; here it is available at the general endotactic scope. \begin{corollary}[Bounded multiplicative modulation]\label{u:cor:modulation} If $k_e(t)=\bar k_e\theta_e(t)$ with $\bar k_e>0$ and measurable $0<\underline\theta_e\le\theta_e(t)\le\overline\theta_e<\infty$, then Theorem~\ref{u:thm:main} applies with $\underline k_e=\bar k_e\underline\theta_e$ and $\overline k_e=\bar k_e\overline\theta_e$. No slow-variation, switching-rate or independence assumption is involved. \end{corollary} \begin{proposition}[State feedback with local hypotheses]\label{u:prop:feedback} Let $k:[0,\infty)\times\U\to\B$ be jointly measurable and such that the closed-loop field $(t,x)\mapsto f_{k(t,x)}(x)$ is bounded and Lipschitz in $x$ on every compact positive box, uniformly in $t$. Then every positive initial state has a unique global positive closed-loop solution, $K$ is invariant for it, and the deadline $T_Q$ of Theorem~\ref{u:thm:main} applies to closed-loop solutions from $Q$. \end{proposition} \begin{proof} The closed-loop field satisfies the Carath\'eodory conditions, so a local solution exists and is unique. Along it, the evaluated history $t\mapsto k(t,x(t))$ is measurable with values in $\B$, so the trapping argument of Section~\ref{u:sec:trapping} applies to the local solution and confines it to a compact positive plateau; the field bound then gives a limit at any finite maximal time and local existence continues the solution. Only after global existence is established is the evaluated history a global admissible history, to which Theorem~\ref{u:thm:main} applies; its bounds and the starting plateau do not depend on the feedback law. \end{proof} \section{A quantitative three-species example}\label{u:sec:example} Consider the nondimensional system \begin{equation}\label{u:eq:fixture} \dot a=c\,(k_1-k_2a^2),\qquad \dot b=ab\,(k_3-k_4b^2),\qquad \dot c=bc\,(k_5-k_6c^2),\qquad \tfrac12\le k_i(t)\le2, \end{equation} with six independent measurable coefficients. It is the mass-action system of the six reactions of Figure~\ref{u:fig:network}. \begin{figure}[ht] \centering \renewcommand{\arraystretch}{1.45} \begin{tabular}{ccc} $C\xrightarrow{k_1}A+C$ & $A+B\xrightarrow{k_3}A+2B$ & $B+C\xrightarrow{k_5}B+2C$\\ $2A+C\xrightarrow{k_2}A+C$ & $A+3B\xrightarrow{k_4}A+2B$ & $B+3C\xrightarrow{k_6}B+2C$ \end{tabular} \caption{Three inward reaction pairs with terminal targets. Each column has sources $u$ and $u+2v$ and common target $u+v$, with $v=e_A,e_B,e_C$ respectively. For the direction $r=(0,1,0)$ the globally lowest sources are the neutral ones in the first column.} \label{u:fig:network} \end{figure} \subsection{Structural classification}\label{u:sec:classification} For a pair $u\to u+v$, $u+2v\to u+v$ and a direction $r$: if $r\cdot v>0$ the first reaction is a forward witness with source $u$ below the adverse source $u+2v$; if $r\cdot v<0$ the roles are reversed; if $r\cdot v=0$ neither reaction is adverse. Hence each pair, and their union, is endotactic in every real direction. The reaction vectors are $\pm e_A,\pm e_B,\pm e_C$, so $S=\R^3$ and the positive class is the whole open orthant. At $r=(0,1,0)$ the globally lowest sources $C$ and $2A+C$ are neutral while the forward witness $A+B$ starts at level $1$, so the network is not strongly endotactic. Each target is terminal, so the network is not weakly reversible. It has nine complexes, three linkage classes, rank $3$ and deficiency $9-3-3=3$; the displayed reaction graph is acyclic and cannot be complex balanced at positive rates, since a terminal target receives positive influx and has no outflux (this concerns the displayed realization; dynamically equivalent realizations are not excluded here). Full rank excludes any nonzero linear conservation law. \subsection{Invariant boxes}\label{u:sec:boxes} For a positive initial state put \begin{equation}\label{u:eq:startup} m=\min(a_0,b_0,c_0,1/2),\qquad M=\max(a_0,b_0,c_0,2). \end{equation} The box $[m,M]^3$ is invariant for every admissible history: on a lower face of a coordinate the bracket in its equation is at least $1/2-2m^2\ge0$, on an upper face at most $2-M^2/2\le0$, and the remaining factors are positive. To make this a rigorous almost-everywhere argument even with weak face signs, clamp the state to the box, construct the bounded Lipschitz integral solution of the clamped field, and note that the positive part of the distance of each coordinate to its interval is absolutely continuous with nonpositive derivative a.e. where positive and zero derivative a.e. where zero; starting from zero it stays zero, so the clamped solution solves~\eqref{u:eq:fixture} and uniqueness proves invariance. The same face signs, now strict ($9/50>0$ and $-9/8<0$), make the operating box $[2/5,5/2]^3$ invariant. Enlarging the operating box beyond $[1/2,2]^3$ matters: with $k_1=1/2$, $k_2=2$ and $a_0<1/2$ the first coordinate approaches $1/2$ from below without reaching it in finite time. \subsection{Clocks and scalar comparisons}\label{u:sec:comparisons} Assume $(a_0,b_0,c_0)\in[1/10,10]^3$; by invariance all three coordinates stay in $[1/10,10]$. Each coordinate has an \emph{operational clock} \[ \sigma_a(t)=\int_0^t c(s)\,ds,\qquad \sigma_b(t)=\int_0^t a(s)\,ds,\qquad \sigma_c(t)=\int_0^t b(s)\,ds, \] an absolutely continuous nondecreasing function whose derivative is the prefactor of the corresponding equation. The startup box bounds every clock speed below by $1/10$: $\sigma(t)\ge t/10$ for each clock. \paragraph{The first coordinate (conventional).} Since $\sigma_a$ is locally bi-Lipschitz with $\sigma_a'\ge1/10$, the substitution $t\mapsto\sigma_a$ is valid for absolutely continuous equations and preserves the almost-everywhere statements. In the clock $\sigma=\sigma_a$, \[ \tfrac12-2a^2\ \le\ \frac{da}{d\sigma}\ \le\ 2-\tfrac12a^2\qquad\text{a.e.} \] The Riccati comparison equations $a'=\frac12-2a^2$ from $a(0)=1/10$ and $a'=2-\frac12a^2$ from $a(0)=10$ have the solutions $\frac12\tanh(\sigma+\atanh\frac15)$ and $2\cothh(\sigma+\atanh\frac15)$, and the positive-part argument with a local Lipschitz bound (valid for measurable coefficients) gives \begin{equation}\label{u:eq:aenvelopes} \tfrac12\tanh\bigl(\sigma+\atanh\tfrac15\bigr)\le a\le2\cothh\bigl(\sigma+\atanh\tfrac15\bigr). \end{equation} Both $a\ge2/5$ and $a\le5/2$ hold once $\sigma\ge\atanh\frac45-\atanh\frac15=\frac12\log6$, hence for all \begin{equation}\label{u:eq:Ta} t\ \ge\ T_a:=5\log6\ <\ 9, \end{equation} and they persist because the comparison envelopes move inward. The rounding $5\log6<9$ is the exact inequality $e^{9/5}>\sum_{j=0}^{6}(9/5)^j/j!=7542629/1250000>6$. \paragraph{The second and third coordinates (clocked linear comparison).} Let $u\in\{b,c\}$ with clock $\sigma\in\{\sigma_b,\sigma_c\}$ and coefficients $(k_+,k_-)\in\{(k_3,k_4),(k_5,k_6)\}$, so that $u'=\sigma'u(k_+-k_-u^2)$ almost everywhere. Because $u$ is confined to $[1/10,10]$ and $v\mapsto v^{-2}$ is Lipschitz there, $z=u^{-2}$ is absolutely continuous, and by the chain rule, for almost every $t$, \begin{equation}\label{u:eq:zode} z'=-2u^{-3}u'=\sigma'\bigl(-2k_+z+2k_-\bigr),\qquad\text{so}\qquad \sigma'(1-4z)\ \le\ z'\ \le\ \sigma'(4-z), \end{equation} using $k_+\ge1/2$, $k_-\le2$, $z>0$ and $\sigma'\ge0$. The relevant comparison is stated in the clock directly, without changing the time variable. \begin{lemma}[Clocked linear comparison]\label{u:lem:clocked} Let $z,\sigma:[0,T]\to\R$ be absolutely continuous, $\beta\in\R$, and suppose $z'(t)\le\sigma'(t)\bigl(\beta-z(t)\bigr)$ for almost every $t\in[0,T]$. Then \[ z(T)\ \le\ \beta+\bigl(z(0)-\beta\bigr)e^{-(\sigma(T)-\sigma(0))}. \] The symmetric statement with $\ge$ holds for a lower bound. \end{lemma} \begin{proof} $\sigma$ is continuous, hence bounded by some $M$ on $[0,T]$, and $\exp$ is Lipschitz on $(-\infty,M]$; so $w=e^{\sigma}(z-\beta)$ is absolutely continuous as a product of absolutely continuous functions. Almost everywhere $w'=e^{\sigma}\bigl(\sigma'(z-\beta)+z'\bigr)\le0$. Integrating, $w(T)\le w(0)$, which is the claim after division by $e^{\sigma(T)}>0$. \end{proof} This lemma, including the composition step and the integration, is verified in Lean (\lean{ac_clocked_linear_upper}; the constant-speed case is \lean{ac_linear_upper}). Applied to~\eqref{u:eq:zode} with $z(0)=u_0^{-2}\in[1/100,100]$: \begin{equation}\label{u:eq:zenvelopes} \tfrac14-\tfrac{6}{25}e^{-4\sigma(t)}\ \le\ z(t)\ \le\ 4+96\,e^{-\sigma(t)}\qquad(t\ge0). \end{equation} The upper bound on $z$ is a \emph{lower} bound on $u$: $u\ge2/5$ as soon as $\sigma(t)\ge\log(128/3)$, and persistently so because $\sigma$ is nondecreasing. The lower bound gives $u\le5/2$ as soon as $\sigma(t)\ge\frac14\log(8/3)$. \subsection{Two certified deadlines}\label{u:sec:deadlines} With the uniform clock floor $\sigma(t)\ge t/10$ alone, \eqref{u:eq:zenvelopes} gives $u\ge2/5$ for $t\ge T_*:=10\log(128/3)$ and $u\le5/2$ for $t\ge\frac52\log(8/3)$; together with~\eqref{u:eq:Ta} this is the one-stage certificate. \begin{proposition}[One-stage certificate]\label{u:prop:38} Every solution of~\eqref{u:eq:fixture} from $[1/10,10]^3$ lies in $[2/5,5/2]^3$ for every $t\ge T_*=10\log(128/3)$, and $T_*<38$. \end{proposition} \begin{proof} All deadlines in the preceding paragraph are at most $T_*$ since $5\log6\ \frac{128}{3}, \end{equation} so $\log(128/3)<19/5$ and $T_*<38$. \end{proof} The one-stage bound of Proposition~\ref{u:prop:38} wastes the fact that the first coordinate recovers early. Once $a\ge2/5$, the clock $\sigma_b$ runs at speed at least $2/5$, and once $b\ge2/5$, so does $\sigma_c$. Feeding these floors back in sequence gives a staged certificate; the order matters, since assuming all three floors from the start would be circular. \begin{theorem}[Staged certificate]\label{u:thm:staged} Every solution of~\eqref{u:eq:fixture} from $[1/10,10]^3$ under every admissible history satisfies \[ a(t)\in[\tfrac25,\tfrac52]\ \ (t\ge9),\qquad b(t)\in[\tfrac25,\tfrac52]\ \ (t\ge\tfrac{65}{4}),\qquad c(t)\in[\tfrac25,\tfrac52]\ \ (t\ge\tfrac{347}{16}). \] In particular every such solution lies in $[0.4,2.5]^3$ for all $t\ge347/16=21.6875$, hence for all $t\ge22$. \end{theorem} \begin{proof} \emph{Upper bounds.} By~\eqref{u:eq:Ta}, $a\le5/2$ for $t\ge9$. For $u\in\{b,c\}$ the lower half of~\eqref{u:eq:zenvelopes} with $\sigma\ge t/10$ gives $z\ge4/25$, i.e.\ $u\le5/2$, for $t\ge\frac52\log(8/3)$, and $\frac52\log(8/3)<\frac52<9$ since $8/32/5$ for all $t\ge65/4$. \emph{Stage $c$.} Now $\sigma_c'=b\ge1/10$ a.e.\ on $[0,65/4]$ and $\sigma_c'\ge2/5$ a.e.\ on $[65/4,\infty)$, so for $t\ge65/4$ \[ \sigma_c(t)\ \ge\ \frac{65}{40}+\frac25\Bigl(t-\frac{65}{4}\Bigr), \] which equals $19/5$ at $t=347/16$. The same comparison gives $c(t)>2/5$ for all $t\ge347/16$. Finally $347/16<22$. \end{proof} The two clock identities $\frac9{10}+\frac25(\frac{65}4-9)=\frac{19}5$ and $\frac{65}{40}+\frac25(\frac{347}{16}-\frac{65}4)=\frac{19}5$ are exact. Keeping the exact stage times instead of rounding gives $T_a=5\log6$, $T_b=\frac34T_a+\frac52\log\frac{128}{3}$ and $T_c=\frac34T_b+\frac52\log\frac{128}3$, approximately $8.959$, $16.103$ and $21.461$; neither this nor $347/16$ is claimed optimal. Table~\ref{u:tab:times} summarizes the deadlines. \begin{table}[ht] \centering \begin{tabular}{llll} \toprule Requirement & Deadline (exact) & Decimal & Rounded, certified\\ \midrule $a\in[2/5,5/2]$ & $5\log6$ & $8.95880$ & $9$\\ $b,c\le5/2$ & $\tfrac52\log(8/3)$ & $2.45207$ & $9$\\ $b,c\ge2/5$, one stage & $10\log(128/3)$ & $37.53418$ & $38$\\ $b\ge2/5$, staged & $\tfrac34\,5\log6+\tfrac52\log(128/3)$ & $16.10264$ & $65/4=16.25$\\ $c\ge2/5$, staged & $\tfrac34T_b+\tfrac52\log(128/3)$ & $21.46053$ & $347/16=21.6875$\\ \bottomrule \end{tabular} \caption{Sufficient recovery deadlines in nondimensional time, uniform over all measurable histories in $[1/2,2]^6$ and all startups in $[1/10,10]^3$. The decimal column only evaluates the exact formulas; the certified column uses the rational roundings proved in Lean.} \label{u:tab:times} \end{table} Figure~\ref{u:fig:trajectories} shows illustrative trajectories under three declared rate schedules; every sampled state after $347/16$ lies in the operating box, as Theorem~\ref{u:thm:staged} requires, and the pictures show how far from tight the deadline is for these particular histories. \begin{figure}[ht] \centering \includegraphics[width=\linewidth]{figures/operating_trajectories.pdf} \caption{Illustrative trajectories under three declared schedules. The shaded strip is the proved operating interval $[0.4,2.5]$ for each coordinate and the dashed line is the staged deadline $347/16$. Colours distinguish $a,b,c$; line styles distinguish the four startups $(0.1,0.1,0.1)$ (solid), $(10,10,10)$ (dashed), $(0.1,10,0.1)$ (dotted) and $(10,0.1,10)$ (dash-dotted). Constant rates are $(0.5,2,0.5,2,0.5,2)$; periodic rates are $k_i(t)=1.25+0.75\sin(2\pi t/8+(i-1)\pi/3)$; switching rates are $0.5$ when $(\lfloor t/2\rfloor+i-1)\bmod3=0$ and $2$ otherwise, integrated segment by segment at the exact switching times (SciPy LSODA, relative tolerance $10^{-9}$, absolute tolerance $10^{-11}$). } \label{u:fig:trajectories} \end{figure} \subsection{Dimensions and physical reading}\label{u:sec:dimensions} Let $A=X_*a$, $B=X_*b$, $C=X_*c$ and $t_{\rm phys}=t_*t$ for declared positive reference scales. The corresponding physical effective model is \[ \dot A=C(\kappa_1-\kappa_2A^2),\qquad \dot B=AB(\kappa_3-\kappa_4B^2),\qquad \dot C=BC(\kappa_5-\kappa_6C^2), \] with $k_1=t_*\kappa_1$, $k_2=t_*X_*^2\kappa_2$, $(k_3,k_5)=t_*X_*(\kappa_3,\kappa_5)$ and $(k_4,k_6)=t_*X_*^3(\kappa_4,\kappa_6)$. The $\kappa_i$ carry different units ($\kappa_1$: time$^{-1}$; $\kappa_2$: concentration$^{-2}$time$^{-1}$; $\kappa_3,\kappa_5$: concentration$^{-1}$time$^{-1}$; $\kappa_4,\kappa_6$: concentration$^{-3}$time$^{-1}$), so the common dimensionless box $[1/2,2]^6$ is an assumption on scaled coefficients, not a statement that unlike physical constants share a numerical range; whether useful $X_*,t_*$ exist for given measured ranges must be checked case by case. The physical startup and operating boxes are $[0.1X_*,10X_*]^3$ and $[0.4X_*,2.5X_*]^3$, and the deadline is $22t_*$. Calibrating $t_*$ requires physical rate data. The reduced full-rank system is an open, driven effective model. One mass-balanced bookkeeping realization replaces the forward reactions by $F_A+C\to A+C$, $F_B+A+B\to A+2B$, $F_C+B+C\to B+2C$ and the backward ones by $2A+C\to A+C+W_A$, $A+3B\to A+2B+W_B$, $B+3C\to B+2C+W_C$, with maintained feed reservoirs $F_\bullet$ and removed waste $W_\bullet$ absorbed into the effective coefficients. This realization supplies open-system bookkeeping for effective cooperative kinetics; its physical use requires specifying the maintained reservoirs and the detailed reaction mechanisms. \subsection{Limits of the fixed-box hypothesis and transition to Part II}\label{u:sec:limits} The positive rate box fixes both a lower and an upper bound. For the endotactic pair $A\rightleftarrows2A$ with $k_+(t)=k_-(t)=e^{-t}$, the operational clock has finite total length and the logistic solution satisfies $a(t)\le e\,a_0$; arbitrarily small startups therefore never reach a common positive floor. For $0\rightleftarrows A$ with birth rate $1+t$ and death rate $1$, the equation $a'=1+t-a$ has unbounded solutions. Part~\ref{part:reverse} keeps the rates autonomous and strictly positive for each $\eps>0$, while allowing their lower bounds to degenerate across a parameter family. The resulting questions are quantitative: how the absorbing concentration scales change, and how long an inventory can take to recover. Both use the shared geometry and absorption argument.