Chemical Reaction Networks in a Laplacian Framework

The paper’s Theorem 4.2 states and proves that under zero Laplacian deficiency (δ_L = 0), a CRN admits a strictly positive equilibrium if and only if the reaction graph is componentwise strongly connected (CSC) . Its proof shows: (i) if a positive equilibrium exists, then δ_L = 0 forces complex balance (i.e., L^Tψ(x*) = 0), and the structure of the left kernel then implies CSC via the reach/cabal decomposition ; (ii) if G is CSC and δ_L = 0, the equation can be solved using Im S^T + Ker L = R^v (a consequence of δ_L = 0) to obtain x* > 0 . The candidate solution proves the same equivalence but with a different route: it uses the dimension identity to show δ_L = 0 forces Ker(SL^T) = Ker L^T (hence complex balance), characterizes Ker L^T ∩ R^v_{>0} via Markov chains, and invokes the classical deficiency-zero theorem for the converse. This is consistent with the paper’s dictionary (CSC ≡ weakly reversible) and its comparison of δ_L with the classical deficiency δ (they are equal when G is CSC) . Minor issue: the candidate states δ_L “matches exactly” the classical deficiency without the CSC caveat; the paper shows δ_L ≤ δ with equality if G is CSC (Proposition 7.1) . Apart from that nuance, both are correct and align on the main claim.