Jacobi bound problem

The Jacobi bound problem concerns the veracity of Jacobi's inequality which is an inequality on the absolute dimension of a differential algebraic variety in terms of its defining equations. This is one of Kolchin's Problems.

The inequality is the differential algebraic analog of Bézout's theorem in affine space. Although first formulated by Jacobi, In 1936 Joseph Ritt recognized the problem as non-rigorous in that Jacobi didn't even have a rigorous notion of absolute dimension (Jacobi and Ritt used the term "order" - which Ritt first gave a rigorous definition for using the notion of transcendence degree). Intuitively, the absolute dimension is the number of constants of integration required to specify a solution of a system of ordinary differential equations. A mathematical proof of the inequality has been open since 1936.

Statement

Let $(K,\partial )$ be a differential field of characteristic zero and consider $\Gamma$ a differential algebraic variety determined by the vanishing of differential polynomials $u_{1},\ldots ,u_{n}\in K[x_{1},\ldots ,x_{n}]_{\partial }$. If $\Gamma _{1}$ is an irreducible component of $\Gamma$ of finite absolute dimension then

$a(\Gamma _{1})\leq J(u_{1},u_{2},\ldots ,u_{n}).$

In the above display $J(u_{1},u_{2},\ldots ,u_{n})$ is the *jacobi number*. It is defined to be

$\max _{\sigma \in S_{n}}\sum _{i=1}^{n}\operatorname {ord} _{x_{i}}^{\partial }(u_{\sigma (i)})$.

References

• Ritt, Joseph F. (1938). "Algebraic aspects of the theory of differential equations" (PDF). Semicentennial Addresses of the American Mathematical Society. Vol. 2. AMS. pp. 35–55. ISBN 0-8218-0119-8.
• Lando, Barbara A. (1970). "Jacobi's bound for the order of systems of first order differential equations". Transactions of the American Mathematical Society. 152: 119–135. doi:10.1090/S0002-9947-1970-0279079-1.
• Ollivier, François (2022). "Jacobi's Bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages". Applicable Algebra in Engineering, Communication and Computing. 34 (5): 793–885. arXiv:2109.03620. doi:10.1007/s00200-022-00547-6. S2CID 237440393.