🔢 mathematics

The real Jacobian conjecture for maps with one component having degree 6

This paper proves that any polynomial map from $\mathbb{R}^2$ to $\mathbb{R}^2$ with a nowhere-zero Jacobian determinant and a component of degree 6 is injective, thereby confirming the real Jacobian conjecture in the plane whenever at least one coordinate function has a degree less than 7.

Original authors: F. Braun, J. Gwoździewicz, F. Fernandes, B. Oréfice-Okamoto

Published 2026-05-13

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: F. Braun, J. Gwoździewicz, F. Fernandes, B. Oréfice-Okamoto

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Real Jacobian Conjecture: A Map-Making Mystery

Imagine you are a cartographer trying to draw a map of a strange, infinite land called $\mathbb{R}^2$ (the flat plane). You have a special machine, a polynomial map, that takes every point in this land and shuffles it to a new location.

The Real Jacobian Conjecture is a famous rule about these machines. It asks: If your machine never "crushes" or "folds" the land (meaning the local area around every point stays distinct), does it guarantee that the machine never sends two different starting points to the same destination? In other words, is the map injective (one-to-one)?

For a long time, mathematicians knew the answer was "No" in general. In 1994, a mathematician named Pinchuk built a machine that didn't crush the land but still sent two different points to the same spot. However, his machine was incredibly complex, with parts of degree 10 and 25.

The big question became: How simple can the machine be before we are guaranteed that it works perfectly?

The Paper's Mission: The Degree 6 Test

This paper, by Braun, Fernandes, Gwoźdźiewicz, and Oréfice-Okamoto, tackles the specific case where one part of the machine (let's call it component $p$ ) has a degree of 6.

In the world of polynomials, "degree" is like the complexity rating of the machine.

Degree 1: A simple, straight-line shuffler. (We know these always work).
Degree 2, 3, 4, 5: We already knew these simple machines always work.
Degree 6: This is the new frontier. Is a degree 6 machine simple enough to be safe, or complex enough to be dangerous?

The Main Discovery: The authors prove that if your machine has a degree of 6 (or less) for one of its parts, and it never crushes the land locally, it is guaranteed to be a perfect, one-to-one map. It cannot send two points to the same place.

This means the "danger zone" for these maps starts at degree 7 or higher.

How They Solved It: The Detective's Toolkit

To prove this, the authors didn't just do algebra; they combined two different ways of looking at the problem: Algebraic Geometry (the shape of the equations) and Dynamical Systems (how things move over time).

Here are the metaphors they used to crack the case:

1. The Newton Polygon: The "Shadow" of the Machine

Imagine your polynomial machine casts a shadow on a wall. This shadow is called the Newton Polygon. It's a shape made of dots (lattice points) that tells you about the machine's structure.

The authors looked at the edges of this shadow.
They counted the "branches" of the machine's output as it stretches out toward infinity (the horizon).
They discovered that if the machine has a degree of 6, the shape of this shadow forces the machine to behave in a very specific way. If the machine tried to "fold" the land (creating a counterexample), the shadow would have to look impossible.

2. Hyperbolic Sectors: The "Traffic Jams" at Infinity

The authors treated the machine as a flow of water or wind (a vector field). They looked at what happens at the very edge of the world (infinity).

They identified "Hyperbolic Sectors." Think of these as traffic whirlpools or funnels at the edge of the map.
If a machine is going to fail (send two points to the same spot), these whirlpools must connect in a very specific, chaotic chain.
The authors proved that for a degree 6 machine, the "traffic rules" dictated by the Newton Polygon prevent these whirlpools from connecting in the necessary way to cause a crash. The traffic flows smoothly without colliding.

3. The "Euler Integral": The Final Scorecard

They used a mathematical tool called the Euler integral to count the "connectedness" of the machine's paths.

Imagine counting how many separate islands of land exist for every possible output value.
The math showed that for a degree 6 machine, the total count of these islands must be exactly one.
If there is only one island for every output, the map is a perfect, global one-to-one match. If there were more, the map would be broken.

The Conclusion

The paper acts as a final gatekeeper. It says:

Degrees 1 through 6: Safe. The Real Jacobian Conjecture holds true.
Degree 7 and up: The door is still open. We don't know yet if a degree 7 machine can fail.

By proving that degree 6 is safe, the authors have pushed the boundary of certainty further than ever before. They showed that you need a machine significantly more complex than degree 6 to create the kind of "folding" that breaks the rules of the map.

In short: If your map-making machine isn't too complicated (degree 6 or less), you can trust it to never mix up your coordinates. The chaos only begins when the complexity gets higher.

Technical Summary: The Real Jacobian Conjecture for Maps with One Component Having Degree 6

Problem Statement
The paper addresses the Real Jacobian Conjecture in the plane, which posits that a polynomial map $F = (p, q): \mathbb{R}^2 \to \mathbb{R}^2$ with a nowhere-vanishing Jacobian determinant ( $J_F \neq 0$ ) is a global diffeomorphism (and thus injective). While the conjecture is known to be false in general due to Pinchuk's counterexamples (where $\deg p = 10$ and $\deg q = 25$ ), the exact threshold for validity remains an open question. Specifically, researchers seek the smallest integer $k$ such that the conjecture holds if $\deg p < k$ . Prior to this work, it was established that $6 \le k \le 9$ . The paper aims to prove that $k \ge 7$ , thereby resolving the case where one coordinate function has degree 6.

Methodology
The authors employ a hybrid strategy combining algebraic geometry and dynamical systems to analyze polynomial submersions $p: \mathbb{R}^2 \to \mathbb{R}$ of degree 6. The core logic relies on the equivalence that a map $F=(p,q)$ satisfying the Jacobian condition is injective if and only if the fibers of $p$ are connected (i.e., $p$ is a locally trivial fibration). The strategy involves assuming the existence of a degree 6 submersion with disconnected fibers (a bifurcation set $B(p) \neq \emptyset$ ) and proving that such a $p$ cannot possess a "Jacobian mate" $q$ .

The technical framework utilizes three primary tools:

Newton Polygon Analysis: The authors analyze the Newton polygon $NP(p)$ of the polynomial $p$ . They define a function $N_S(c)$ counting the number of branches at infinity of the curve $p(x,y)=c$ associated with an outer edge $S$ of the polygon. By studying the "type" of these functions (constructible functions describing the number of connected components of fibers across different values of $c$ ), they derive constraints on the topology of the fibers.
Euler Integrals and Sekalski's Theorem: The paper utilizes the Euler integral of the function $N(c)$ (the total number of fiber components). A key result (Corollary 2.8) states that for a polynomial submersion, the Euler integral of $N$ must equal $-1$. This provides a global topological constraint used to rule out certain configurations of fiber components.
Poincaré Compactification and Hyperbolic Sectors: The authors analyze the global dynamics of the Hamiltonian vector field $\nabla p^\perp = (-p_y, p_x)$ . They utilize the Poincaré compactification to study the behavior of orbits at infinity. Specifically, they apply Theorem 3.1 (from previous literature [4]), which states that if a polynomial submersion admits a specific chain of hyperbolic sectors at infinity connected by inseparable orbits, it cannot have a Jacobian mate.

Key Contributions and Results
The central result is Theorem 5.1, which states: Let $p: \mathbb{R}^2 \to \mathbb{R}$ be a polynomial submersion of degree 6. If the bifurcation set $B(p)$ is non-empty, then $p$ has no Jacobian mates.

The proof proceeds by a comprehensive case analysis of the possible Newton polygons for a degree 6 polynomial submersion. The authors categorize the highest homogeneous part $p_+$ based on the factorization of its linear components and the degree of the remaining factor $h$ . The analysis covers all possible configurations of the Newton polygon, including:

Cases where $p$ is nondegenerate on specific edges (implying constant fiber counts and thus no bifurcation).
Cases where $p$ is degenerate, requiring a detailed study of the "type" of the branch-counting functions $N_S(c)$ .
Specific geometric reductions using affine changes of variables to simplify the Newton polygon.

In every case where a disconnected fiber (bifurcation) is assumed, the authors demonstrate a contradiction. This contradiction arises either from:

Violating the Euler integral condition ( $\int N d\chi = -1$ ).
Showing the image of $p$ would be a closed half-interval (impossible for a submersion).
Constructing a configuration of hyperbolic sectors at infinity that satisfies the conditions of Theorem 3.1, thereby proving the non-existence of a Jacobian mate.

Significance
The paper concludes with Corollary 5.2: Let $F = (p, q): \mathbb{R}^2 \to \mathbb{R}^2$ be a polynomial map satisfying the Jacobian condition. If $\deg p < 7$ , then $F$ is a global diffeomorphism.

This result establishes that the Real Jacobian Conjecture holds true in the plane provided at least one coordinate function has a degree strictly less than 7. Consequently, the paper narrows the search for a counterexample to the range $7 \le \deg p \le 9$ . The authors explicitly state that it remains to be decided whether the critical value $k$ is 7, 8, or 9. The work does not claim to solve the conjecture in full generality but significantly tightens the bounds on the degree required for potential counterexamples, effectively ruling out degree 6.