How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The feasible tangent cone for nonnegative stoichiometric amounts
Statement
Let , let be a stoichiometric matrix (column gives the signed species-amount change per unit extent of reaction ), and let be initial species amounts. Extents are measured in one fixed amount unit, so has species amounts in that same unit; is dimensionless. The feasible extent set is the polyhedron
At , let be the active species set. Define the Bouligand tangent cone to consist of all for which there are with and such that . Then
If is open with , and is differentiable with a local minimum at relative to , then for every . Conversely, if is convex and is convex and differentiable on , this directional inequality for every implies for every . Suppose is open, , is totally differentiable at , and near . For each , let have coordinate in position and in every other position; define . Then
The tangent-cone and optimality claims are mathematical deductions. They do not assert that a particular physical system obeys this model or is at equilibrium.
Facts & Assumptions
Given: The finite stoichiometric matrix, initial amounts, feasible extent set, Euclidean convergence, and differentiability/convexity hypotheses in the Statement.
The total (Fréchet) derivative as the linear first-order approximation with remainder: differentiability at gives as .
A convex subset of contains every line segment between two of its points: convexity of and the affine inequalities defining keep every segment between feasible points in .
The chain rule for total derivatives: : the derivative of a composition is the composition of its total derivatives.
Convex and strictly convex functions on Euclidean convex sets: a real-valued function is convex when for points in its convex domain and .
Every Euclidean linear map has a unique matrix and satisfies for some : a finite-dimensional linear map is bounded and therefore continuous.
Proof
Suppose , and choose sequences from its definition. For each active , feasibility gives , hence . Since [F5] makes the finite matrix map continuous, implies , so . This proves one inclusion.
Conversely suppose for all . For each inactive , put . If , restrict ; if , no restriction is needed. There are finitely many species, so choose a common no larger than all positive bounds (or if there are none). For , ; for inactive , the choice of gives for . Thus throughout that interval. Taking and any positive tending to zero proves .
By steps 1.1–1.2, every tangent has a feasible ray for all sufficiently small . Openness of keeps the initial part of this ray in . At a relative local minimum, for all sufficiently small ; differentiability [F1] makes its limit . Hence .
Now assume is convex and convex and differentiable. For any , put . For active , , so step 1.2 makes a tangent direction; the segment also lies in by [F2]. Let . [F4] gives for ; as , the left side tends to by [F1]. If every tangent derivative is nonnegative, then .
The affine map has derivative . By [F3], . Since and is linear, this equals , as claimed.
Depends on
A convex subset of contains every line segment between two of its points
Convex and strictly convex functions on Euclidean convex sets
The Euclidean inner product on
The total (Fréchet) derivative as the linear first-order approximation with remainder
Every Euclidean linear map has a unique matrix and satisfies for some
The chain rule for total derivatives: