First raised for two variables by Ludwig Kraus in 1884 and stated in full generality by Ott-Heinrich Keller in 1939, the Jacobian conjecture asks something that sounds almost like freshman calculus: if a polynomial map from complex n-space to itself has a Jacobian determinant equal to a nonzero constant, must it be invertible by another polynomial map? That constant-Jacobian condition is precisely the algebraic shadow of the inverse function theorem, yet producing a polynomial — not merely analytic — inverse has resisted every attack for over eighty years. Shreeram Abhyankar championed the problem because it can be stated 'using little beyond a knowledge of calculus,' and Stephen Smale placed it sixteenth on his 1998 list of problems for the new century. Its notoriety is sharpened by a graveyard of published 'proofs' that later collapsed. Deep reductions exist — Bass, Connell, and Wright showed in 1982 that the general case reduces to maps of degree three — and the problem is equivalent, through work of Tsuchimoto, Belov-Kanel, and Kontsevich, to the Dixmier conjecture on the Weyl algebra. A formal statement anchors this famously slippery problem so that progress can be verified rather than merely believed.
theorem Jacobian_Conjecture {n : ℕ} (F : Fin n → MvPolynomial (Fin n) ℂ)
(H : IsUnit (Matrix.of (fun i j => pderiv i (F j))).det) :
∃ G : Fin n → MvPolynomial (Fin n) ℂ,
(∀ i, bind₁ G (F i) = X i) ∧ (∀ i, bind₁ F (G i) = X i) := by sorryJacobian conjecture. Over , any polynomial map whose Jacobian determinant is a nonzero constant (a unit) admits a polynomial inverse , i.e. . (Polynomial-inverse form, following the DeepMind formal-conjectures library.)
No open leaves. Every sub-goal is proved or awaiting decomposition.