Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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 s,r≥1, let ν∈Rs×r be a stoichiometric matrix (column k gives the signed species-amount change per unit extent of reaction k), and let n0∈[0,∞)s be initial species amounts. Extents ξ∈Rr are measured in one fixed amount unit, so n(ξ)=n0+νξ has species amounts in that same unit; ν is dimensionless. The feasible extent set is the polyhedron

F={ξ∈Rr:n0+νξ∈[0,∞)s}.

At ξ∗∈F, let J={j:nj0+(νξ∗)j=0} be the active species set. Define the Bouligand tangent cone TF(ξ∗) to consist of all h∈Rr for which there are tk>0 with tk→0 and hk→h such that ξ∗+tkhk∈F. Then

TF(ξ∗)={h∈Rr:(νh)j≥0 for every j∈J}.

If U⊆Rr is open with ξ∗∈U, and f:U→R is differentiable with a local minimum at ξ∗ relative to F∩U, then Df(ξ∗)h≥0 for every h∈TF(ξ∗). Conversely, if U is convex and f is convex and differentiable on U, this directional inequality for every h∈TF(ξ∗) implies f(ξ)≥f(ξ∗) for every ξ∈F∩U. Suppose V⊆Rs is open, n∗:=n0+νξ∗∈V, Φ:V→R is totally differentiable at n∗, and f(ξ)=Φ(n0+νξ) near ξ∗. For each j, let ej∈Rs have coordinate 1 in position j and 0 in every other position; define μj:=DΦ(n∗)ej. Then

Df(ξ∗)h=∑j=1sμj(νh)j=(νTμ)⋅h.

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.

[F1]

The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder: differentiability at ξ∗ gives f(ξ∗+w)=f(ξ∗)+Df(ξ∗)w+o(∥w∥2) as w→0.

[F2]

A convex subset of Rm contains every line segment between two of its points: convexity of U and the affine inequalities defining F keep every segment between feasible points in F∩U.

[F3]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): the derivative of a composition is the composition of its total derivatives.

[F4]

Convex and strictly convex functions on Euclidean convex sets: a real-valued function is convex when f((1−t)x+ty)≤(1−t)f(x)+tf(y) for points in its convex domain and t∈[0,1].

Proof

technique · direct
1.1F5givenalgebra

Suppose h∈TF(ξ∗), and choose sequences tk,hk from its definition. For each active j∈J, feasibility gives 0+tk(νhk)j≥0, hence (νhk)j≥0. Since [F5] makes the finite matrix map continuous, hk→h implies νhk→νh, so (νh)j≥0. This proves one inclusion.

1.2givenchoosealgebra

Conversely suppose (νh)j≥0 for all j∈J. For each inactive j, put bj=nj0+(νξ∗)j>0. If (νh)j<0, restrict 0≤t≤bj/[−(νh)j]; if (νh)j≥0, no restriction is needed. There are finitely many species, so choose a common ϵ>0 no larger than all positive bounds (or ϵ=1 if there are none). For j∈J, nj0+(ν(ξ∗+th))j=t(νh)j≥0; for inactive j, the choice of ϵ gives bj+t(νh)j≥0 for 0≤t≤ϵ. Thus ξ∗+th∈F throughout that interval. Taking hk=h and any positive tk≤ϵ tending to zero proves h∈TF(ξ∗).

2.1F1step 1.1step 1.2given

By steps 1.1–1.2, every tangent h has a feasible ray ξ∗+th for all sufficiently small t≥0. Openness of U keeps the initial part of this ray in U. At a relative local minimum, [f(ξ∗+th)−f(ξ∗)]/t≥0 for all sufficiently small t>0; differentiability [F1] makes its limit Df(ξ∗)h. Hence Df(ξ∗)h≥0.

2.2F1F2F4step 1.2givenalgebra

Now assume U is convex and f convex and differentiable. For any ξ∈F∩U, put h=ξ−ξ∗. For active j, (νh)j=nj(ξ)−nj(ξ∗)=nj(ξ)≥0, so step 1.2 makes h a tangent direction; the segment ξ∗+th also lies in F∩U by [F2]. Let g(t)=f(ξ∗+th). [F4] gives (g(t)−g(0))/t≤g(1)−g(0) for 0<t<1; as t↓0, the left side tends to Df(ξ∗)h by [F1]. If every tangent derivative is nonnegative, then f(ξ)−f(ξ∗)=g(1)−g(0)≥Df(ξ∗)h≥0.

3.1F3givenalgebra∎

The affine map ξ↦n0+νξ has derivative h↦νh. By [F3], Df(ξ∗)h=DΦ(n∗)(νh). Since νh=∑j=1s(νh)jej and DΦ(n∗) is linear, this equals ∑j=1s(νh)jDΦ(n∗)ej=∑j=1sμj(νh)j=(νTμ)⋅h, as claimed.

Depends on

Dependency tree · 2 levels

Sources