OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

§1 (setting): Continuity and differentiation requirements for trajectories with prescribed initial data

Finite networks and their mass-action solutions.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Concentration dynamics depends on a finite directed graph of complexes and a constant rate for each reaction. The initial value problem concerns trajectories on a finite forward interval or on the whole nonnegative time axis.

The Definition

Definition 1. Let d∈ℕd\in\mathbb N be the number of species. A chemical reaction network N=(C,E)N=(C,E) on dd species consists of a finite set CC of complexes and a finite set EE of directed reactions between distinct complexes, as in (1): C⊂ℕd,|C|<∞,E⊂{(y,z)∈C×C:y≠z},|E|<∞.C\subset\mathbb N^d,\qquad |C|<\infty,\qquad E\subset\{(y,z)\in C\times C:y\ne z\},\qquad |E|<\infty.(1)✦ A reaction ee of NN is an ordered pair of complexes belonging to EE, as in (2): e=(y,z)∈E.e=(y,z)\in E.(2)✦ The reaction relation y→zy\to z for complexes y,z∈ℕdy,z\in\mathbb N^d is the relation specified by (3): y→z⇔(y,z)∈E.y\to z\quad\Longleftrightarrow\quad (y,z)\in E.(3)✦ The network NN is weakly reversible if every reaction has a directed return path of positive length, as in (4): for each (y,z)∈E,there are n≥1 and y0,…,yn∈C with y0=z,yn=y,yj−1→yj(1≤j≤n).\text{for each }(y,z)\in E,\quad \text{there are }n\ge1\text{ and }y_0,\ldots,y_n\in C \text{ with }y_0=z,\ y_n=y,\ y_{j-1}\to y_j\ (1\le j\le n).(4)✦

For a state x∈ℝdx\in\mathbb R^d and a complex y∈ℕdy\in\mathbb N^d, the mass-action monomial xyx^y is the product in (5): xy=∏i=1dxiyi.x^y=\prod_{i=1}^d x_i^{y_i}.(5)✦ For a constant rate assignment κ:E→ℝ\kappa:E\to\mathbb R, the mass-action vector field f:ℝd→ℝdf:\mathbb R^d\to\mathbb R^d is the map in (6): f(x)=∑y→zκy→zxy(z−y).f(x)=\sum_{y\to z}\kappa_{y\to z}\,x^y(z-y).(6)✦ A positive reaction rate assignment κ\kappa on EE is a constant rate assignment satisfying κy→z>0\kappa_{y\to z}>0 for every reaction y→zy\to z. A positive concentration state x∈ℝdx\in\mathbb R^d is a vector satisfying (7): xi>0(1≤i≤d).x_i>0\qquad(1\le i\le d).(7)✦

Let x0∈ℝdx_0\in\mathbb R^d be an initial state. A global forward solution from x0x_0 is a trajectory x:ℝ→ℝdx:\mathbb R\to\mathbb R^d satisfying (8), with the ordinary two-sided derivative also required at t=0t=0: x(0)=x0,ẋ(t)=f(x(t))for every t≥0.x(0)=x_0,\qquad \dot x(t)=f(x(t))\quad\text{for every }t\ge0.(8)✦ For T∈ℝT\in\mathbb R, a forward solution on [0,T][0,T] from x0x_0 is a trajectory x:ℝ→ℝdx:\mathbb R\to\mathbb R^d satisfying (9): x(0)=x0,x|[0,T] is continuous,ẋ(t)=f(x(t))for every 0<t<T.x(0)=x_0,\qquad x|_{[0,T]}\text{ is continuous},\qquad \dot x(t)=f(x(t))\quad\text{for every }0<t<T.(9)✦

What Is Checked

The definitions concern finite networks on dd species, constant real rate assignments and real trajectories with prescribed initial data.