Jacobian conjecture
Conjecture asserting that, over a characteristic-zero field K, given a polynomial map f: Kⁿ → Kⁿ, if its Jacobian determinant J: Kⁿ → K is a nonzero constant map, then f admits a polynomial inverse g: Kⁿ → Kⁿ
Nº Q2605695 ★★★★
Super Rare · Knowledge
Jacobian conjecture
Conjecture asserting that, over a characteristic-zero field K, given a polynomial map f: Kⁿ → Kⁿ, if its Jacobian determinant J: Kⁿ → K is a nonzero constant map, then f admits a polynomial inverse g: Kⁿ → Kⁿ
In mathematics, the Jacobian conjecture is a conjecture concerning polynomials in several variables that states that if a polynomial function from an n {\displaystyle n} -dimensional space to itself has a Jacobian determinant that is a non-zero constant, then the function has a polynomial inverse. The case n = 2 {\displaystyle n=2} (two variables), also called the plane Jacobian conjecture or planar Jacobian conjecture, is the only case that remains unresolved as of 2026.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
In mathematics, the Jacobian conjecture is a conjecture concerning polynomials in several variables that states that if a polynomial function from an n {\displaystyle n} -dimensional space to itself has a Jacobian determinant that is a non-zero constant, then the function has a polynomial inverse. The case n = 2 {\displaystyle n=2} (two variables), also called the plane Jacobian conjecture or planar Jacobian conjecture, is the only case that remains unresolved as of 2026. The case n = 1 {\displaystyle n=1} is trivially true, since the derivative of a polynomial is a nonzero constant only if the degree of the polynomial is 1 , {\displaystyle 1,} and linear polynomial functions are invertible. On July 19, 2026, Levent Alpöge presented an explicit counterexample in three variables which he credited to the large language model Claude Fable 5, disproving the conjecture for n > 2 {\displaystyle n>2} . The correctness of the counterexample is easy to verify with any computer algebra system. It has not been revealed, however, how it was found. Nevertheless, it led some mathematicians to elaborate on the mathematical reasons and the implications of the existence of the counterexample. For fields of positive characteristic, the usual Jacobian conjecture is false in one dimension, so the separable Jacobian conjecture, also called Adjamagbo's Jacobian conjecture, adds a separability premise to make the conjecture true in one dimension. The separable Jacobian conjecture has been proven false for all fields of positive characteristic in all dimensions n ≥ 2 {\displaystyle n\geq 2} , with the separable Jacobian conjecture for fields of characteristic zero coinciding with the usual Jacobian conjecture.
Text: Wikipédia, CC BY-SA 4.0. ·