upvote
This is not true at all. The parameter space is absolutely MASSIVE. The counterexample is a degree 7 polynomial in 3 variables, which means 360 coefficients. There's no particular way to bound these coefficients or even the degree or number of variables apriori, but assume you somehow did. Also assume you were confident that it would work with integer coefficients bounded from -12 to 12. Now you have to iterate over 360 degrees of freedom, verify that the Jacobian is a nonzero constant, and somehow show non-invertibility of the transformation, which is not a particularly simple task.

If you searched for coefficients from -12 to 12, this would be 25^360 = 2 * 10^503 different possibilities. A common reference point is that there are 10^80 atoms in the observable universe. Sure you could probably reduce this a bit with clever tricks, but the starting point makes the method completely unviable.

reply
Oh yes there were. The Jacobian conjecture is "notorious for the large number of published and unpublished false proofs which turned out to contain subtle errors."

It's not quite the Reimann hypothesis, but many prominent mathematicians have spent years working on this problem. Yitang Zhang wrote his PhD thesis on it.

reply
I shouldn’t, but:

F1 = x^3y^3z + 3x^2y^4 + 3x^2y^2z + 7xy^3 + 3xyz + 4y^2 + z

F2 = 3x^3y^2z + 9x^2y^3 + 6x^2yz + 12xy^2 + 3xz + y

F3 = -x^3z - 3x^2y + 2x

That’s the counterexample. Low integer coefficients, power 7 in three variables. If someone said it was there, couldn’t we all have written a pretty simple brute force solution for the search space, especially with the constraints that the symbolic determinant had to cancel to a constant?

reply
Honestly just try it. You'll figure out the problem very quickly.
reply