>>236
ご教示ありがとうございます
google検索すると 付録で ＜AI による概要＞がついてきます （＾＾

(google検索)
On the origin of the Jacobian conjecture
＜AI による概要＞
The Jacobian Conjecture, a famous unsolved math problem, was officially proposed by Ott-Heinrich Keller in 1939, concerning polynomial maps with a constant non-zero Jacobian determinant having polynomial inverses, but recent discoveries suggest L. Kraus published the exact statement as early as 1884, though his proof was flawed, highlighting early ideas about controlling polynomial dynamics at infinity, which remain central to the conjecture's difficulty today. 
Who proposed it? 
・Ott-Heinrich Keller (1939): Generally credited with formulating the conjecture in its modern form, asking if a polynomial map \(F:\mathbb{C}^{n}\rightarrow \mathbb{C}^{n}\) with a constant non-zero Jacobian determinant (e.g., \(\det (J_{F})=1\)) must have a polynomial inverse.
・L. Kraus (1884): Research in 2025 revealed Kraus addressed the same problem in an 1884 paper, anticipating key concepts but failing in the final step, which involved issues with "ramification at infinity," a core challenge in proving the conjecture. 
Key Concepts: 
・Jacobian: In vector calculus, the Jacobian matrix contains all first-order partial derivatives of a vector-valued function, and its determinant (the Jacobian determinant) measures how volumes change under the transformation.
・The Conjecture: If you have a polynomial function mapping a space to itself (e.g., \(\mathbb{C}^{2}\rightarrow \mathbb{C}^{2}\)), and the Jacobian determinant is always, say, 1 (a non-zero constant), then the function must be invertible, and its inverse must also be a polynomial.
・Why it's Hard: While simple to state, proving it is extremely difficult, with many failed attempts, especially for dimensions \(n\ge 2\). The difficulty often lies in understanding the behavior of these polynomial maps at infinity, a problem Kraus encountered over a century ago. 

つづく