Jacobian criterion for algebraic independence in characteristic zero
ProvedAPSCounting893.Main.jacobian_independence_criterionalgebraic-geometryalgebraic-independenceapsjacobian
Let be a field of characteristic zero, and let . The polynomials are algebraically independent over if and only if their Jacobian has a nonzero minor:
The determinant is a polynomial, so nonvanishing here means it is not identically zero. This criterion relates algebraic image dimension to polynomial rank certificates and is used in the source's dimension computation and input-reduction argument. It includes the empty family with its empty determinant equal to one.
Formalization Note An injective function selects and orders the columns of the minor. Polynomial inputs may be arbitrary; no degree or polynomial-size representation assumption is imposed in this algebraic lemma.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem APSCounting893.Main.jacobian_independence_criterion
{K : Type} [Field K] [CharZero K] {n r : ℕ}
(F : Fin r → MvPolynomial (Fin n) K) :
AlgebraicIndependent K F ↔
∃ g : Fin r → Fin n, Function.Injective g ∧
(Matrix.of (fun i j => MvPolynomial.pderiv (g j) (F i))).det ≠ 0 := by sorrySource
Agarwal, Hari, Pandey and Shukla, Approximate Polynomial Satisfiability and Integral Closure Membership in the Counting Hierarchy, STOC 2027 submission #893, Lemma 6.1 and its proof, p.23, especially the identification of transcendence degree with Jacobian rank preceding equation (6.1), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf. The same characteristic-zero criterion applies to each coordinate subfamily.