The unimodular conjecture over the p-adic integers

About 1 year old · traced to

Let pp be a prime, let n≥1n\geq 1, and let

F∈Zp[X]nF\in \mathbb{Z}_p[X]^n

satisfy det⁡JF∈Zp×\det JF\in\mathbb{Z}_p^\times. A vector in Zpn\mathbb{Z}_p^n is unimodular when the ideal generated by its entries is Zp\mathbb{Z}_p. The unimodular conjecture. There exists b∈Zpnb\in\mathbb{Z}_p^n such that F(b)∈ZpnF(b)\in\mathbb{Z}_p^n is unimodular. This conjecture is used in the paper through the result that the Jacobian conjecture for C\mathbb{C} is equivalent to it holding for all but finitely many primes pp. Its resolution is not supplied in the given text.

References

Primary source

Lucas Hamada, Kazuki Kato and Ryo Komiya, “A Tate algebra version of the Jacobian Conjecture”, arXiv:2502.10769 (2025).

Progress summary

Refreshed
Claimed progress

No proof or counterexample has been found: the conjecture remains open, with only restricted cases known.

The conjecture asks whether every polynomial map over Zp\mathbb{Z}_p with invertible Jacobian determinant takes some value whose entries generate the unit ideal. Essen--Lipton related this question to the Jacobian conjecture over C\mathbb{C}: the latter holds exactly when the unimodular conjecture holds for all but finitely many primes.

Known results

  • Zp\mathbb{Z}_p is (p−1)(p-1)-unimodular for every prime pp.
  • Zp\mathbb{Z}_p is 33-unimodular for every prime p>3p>3, yielding the conjecture for maps of degree at most 33 for almost all primes.
  • Additional results cover quasi-Druzkowski maps and give conditional criteria for the full conjecture.

2025 Tate-algebra reformulation

A 2025 paper claims an equivalence between the complex Jacobian conjecture and a Tate-algebra statement over Cp\mathbb{C}_p, using the Essen--Lipton equivalence. This is a reformulation, not a proof or counterexample for the unimodular conjecture itself.

Current status (as of August 2026): The full unimodular conjecture remains open; partial cases are known, and no verified proof or counterexample is reported.

Sources

Solutions 0

No solutions have been posted yet.