🔢 mathematics

On Buzzard's Theoren

This paper proves that over any infinite field, for any two sequences of distinct points and any sequence of Jacobian-one matrices, there exists a polynomial automorphism with Jacobian one that maps the first sequence to the second while matching the prescribed differentials at each point.

Original authors: Zbigniew Jelonek, Gustavo Menani, Maria Michalska

Published 2026-08-19

📖 7 min read🧠 Deep dive

CC BY 4.0

Original authors: Zbigniew Jelonek, Gustavo Menani, Maria Michalska

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

In the vast landscape of mathematics, there is a branch dedicated to shapes that can be stretched, twisted, and reshaped without tearing or gluing. Within this world, a special class of transformations exists where the rules are strictly defined by polynomials—simple algebraic expressions involving variables raised to whole-number powers. These polynomial automorphisms are like perfect, reversible machines: they take a space, rearrange every single point within it according to a specific formula, and can be run backward to return everything exactly to where it started. For decades, mathematicians have been fascinated by how much control they can exert over these machines. Specifically, they wanted to know if they could program these transformations to send specific starting points to specific destination points, while also ensuring that the way the space stretches or compresses at those exact locations matches a pre-determined pattern. Until now, the most powerful answers to this question were known only in the complex realm of numbers involving square roots of negative one, relying on tools from calculus and analysis that do not work in simpler number systems.

A team of researchers has now solved this puzzle for any infinite collection of numbers, regardless of whether the system is simple or complex. They proved that it is always possible to construct such a polynomial machine that hits any set of target locations and mimics any desired local behavior, provided the number of points is finite and the underlying number system is infinite. Their work confirms that the ability to precisely steer these mathematical transformations is not a luxury reserved for the most complicated number systems, but a fundamental property that holds true across the entire spectrum of infinite fields. This result bridges a gap between different areas of mathematics, showing that a method previously thought to require advanced analytic techniques can be achieved using more direct, algebraic approaches that work everywhere.

The story of this discovery begins with a question that has lingered in the minds of mathematicians for some time. Imagine you have a grid of points in a multi-dimensional space. You want to move a specific group of these points to a new set of locations. Furthermore, you want to control exactly how the space around each of those points is distorted during the move. In mathematical terms, this distortion is described by the "differential," which captures the local stretching and rotation at a specific spot. The challenge is to find a single, smooth polynomial formula that accomplishes both tasks simultaneously: moving the points to their destinations and matching the specific distortion patterns required at each one. For a long time, the only known solutions to this problem relied on the complex numbers, a system that includes imaginary numbers. These solutions used powerful tools from complex analysis, which are like high-powered microscopes that can see the fine details of shapes in ways that simpler number systems cannot.

The researchers, Zbigniew Jelonek, Gustavo Menani, and Maria Michalska, set out to see if this result could be proven without those high-powered tools. They asked whether the same feat could be accomplished using only the basic rules of algebra, which apply to any infinite field of numbers, including the real numbers and many others. Their goal was to show that the ability to prescribe both the destination and the local distortion of points is a universal feature of polynomial automorphisms, not just a quirk of the complex number system. They did not just guess; they provided a rigorous proof that such a transformation always exists.

To achieve this, the team broke the problem down into two manageable steps. First, they addressed the task of simply moving the points from their starting positions to their desired destinations. They demonstrated that by using a sequence of simple, reversible shifts—where one coordinate is adjusted based on the value of another—they could construct a transformation that sends every starting point to its correct target. This initial step ensures that the points are in the right place, but it does not yet guarantee that the local distortion matches the requirement. The transformation might stretch the space too much or in the wrong direction at the target points.

The second step was to correct these distortions without moving the points from their new locations. Here, the researchers employed a clever strategy involving the decomposition of complex distortions into a series of simpler, elementary adjustments. They showed that any desired pattern of stretching and rotation could be built up by combining a finite number of basic building blocks. For each of these building blocks, they constructed a specific polynomial function that would apply the necessary correction at the target points while leaving the points themselves stationary. By layering these corrections on top of the initial movement, they created a final transformation that perfectly satisfied both conditions: the points arrived at their destinations, and the space around them was distorted exactly as prescribed.

The significance of this work lies in its universality. Previous attempts to solve similar problems were limited to the complex number system because the methods used there were deeply tied to the unique properties of complex analysis. By proving that the result holds for any infinite field, the authors have shown that the underlying algebraic structure is sufficient to solve the problem. This means that the same logic applies whether one is working with real numbers, or with other infinite systems of numbers that do not include imaginary components. The proof is constructive, meaning it does not just say the solution exists, but outlines a method for building it. The researchers also noted that the degree of the polynomial required—the complexity of the formula—grows with the number of points, but it remains finite and calculable.

This finding also has implications for the geometry of shapes beyond simple grids. The authors extended their result to show that similar control can be exerted when embedding smooth shapes into higher-dimensional spaces. This means that if one has a smooth surface and wants to place it into a larger space such that specific points land in specific spots and the surface touches the surrounding space in a specific way, it is always possible to do so using polynomial maps. This generalizes the concept of flexibility in geometry, showing that the ability to manipulate shapes with precision is a robust feature of algebraic geometry, not just a special case.

The paper concludes by acknowledging a boundary to this result. The proof relies on the number system being infinite. If the collection of numbers is finite, the method does not automatically work, although the authors suggest it might still be possible if the number of points to be moved is small compared to the size of the number system. This caveat highlights the importance of the infinite nature of the field in their construction, as the ability to find polynomials that satisfy multiple conditions simultaneously depends on having enough "room" in the number system to avoid conflicts.

In the end, this work provides a clear and definitive answer to a long-standing question in algebraic geometry. It demonstrates that the power to precisely control both the position and the local behavior of points under polynomial transformations is a fundamental truth that transcends the specific type of numbers being used. The researchers have replaced a reliance on complex analytic tools with a direct algebraic construction, proving that the result is as broad and sturdy as the infinite fields themselves. Their work stands as a testament to the power of algebra to solve problems that were previously thought to require the more delicate machinery of analysis.

Technical Summary: On Buzzard's Theorem

Problem Statement
This paper addresses the problem of constructing polynomial automorphisms over infinite fields with prescribed values and differentials at a finite set of distinct points. Specifically, given an infinite field $K$ , dimension $n \geq 2$ , two sequences of distinct points $\{a_1, \dots, a_k\}$ and $\{b_1, \dots, b_k\}$ in $K^n$ , and a sequence of linear isomorphisms $L_1, \dots, L_k \in SL(n, K)$ , the authors seek a polynomial automorphism $\Phi: K^n \to K^n$ with Jacobian determinant 1 such that $\Phi(a_i) = b_i$ and the differential $d_{a_i}\Phi = L_i$ for all $i = 1, \dots, k$ .

While this problem was previously solved over the complex numbers $\mathbb{C}$ by Buzzard (prescribing 1-jets) and later generalized by Forstneric (prescribing $m$ -jets) and others to flexible varieties, those proofs relied heavily on analytic methods. The specific challenge addressed here is to provide a purely algebraic proof valid over any infinite field, regardless of characteristic.

Methodology
The authors employ a constructive algebraic approach based on the following key components:

Chinese Remainder Theorem for Polynomials: The proof relies on a generalized form of the Chinese Remainder Theorem (Theorem 2.1) and its corollary (Corollary 2.2). This allows for the construction of univariate polynomials $f \in K[t]$ that satisfy specific value and derivative constraints at distinct points. Specifically, for distinct points $x_i$ and target values $a_i, b_i$ , one can find a polynomial $f$ such that $f(x_i) = a_i$ and $f'(x_i) = b_i$ with degree bounds $\deg(f) < 2k$ .
Reduction to General Position: The authors demonstrate that without loss of generality, the point sets can be transformed via linear isomorphisms in $SL(n, K)$ to a "general position" where coordinate overlaps are minimized. This simplifies the construction of the required automorphisms.
Decomposition into Tame Automorphisms: The construction of the final map $\Phi$ is achieved by composing two types of polynomial automorphisms:
- Interpolation Automorphism ( $F$ ): A map constructed to satisfy the point interpolation condition $\Phi(a_i) = b_i$ . This is built using "tame" automorphisms of the form $(x_1, \dots, x_n) \mapsto (x_1 + p(x_2), \dots, x_n + p(x_1))$ , where the polynomials $p$ are derived via the interpolation method mentioned above.
- Differential Correction Automorphism ( $G$ ): A map that fixes the image points $b_i$ but adjusts the differentials to match the target matrices $L_i$ . This is achieved by decomposing the target linear maps $L_i$ into products of elementary matrices (Gaussian elimination). For each elementary matrix factor, a corresponding tame automorphism is constructed using the polynomial interpolation lemma to match the required derivative while keeping the point fixed.

Key Results
The paper establishes the following main theorem (Theorem 1.3 / Theorem 2.5):

Existence: Over any infinite field $K$ , for any $n \geq 2$ and any finite set of distinct points and prescribed $SL(n, K)$ differentials, there exists a polynomial automorphism $\Phi: K^n \to K^n$ with Jacobian 1 satisfying the prescribed conditions.
Degree Bounds: The constructed automorphism $\Phi$ has a bounded degree. Specifically, if $F$ is the interpolation map (degree $\leq k^2$ ) and $G$ is the differential correction map (degree $\leq (2k)^{kn^2}$ ), the composition $\Phi = G \circ F$ has a degree bounded by $k^2(2k)^{kn^2}$ .
Isotopy: The paper further proves (Corollary 2.6) that such an automorphism can be connected to the identity map via a polynomial isotopy $\Psi: K^n \times K \to K^n$ consisting entirely of automorphisms with Jacobian 1.
Extension to Varieties: As a consequence (Corollary 2.7), the result implies that for a smooth affine variety $X$ over an algebraically closed field, one can construct a closed embedding into $K^{2n+1}$ that prescribes both the image points and the tangent spaces at those points.

Significance and Claims
The authors state that the primary significance of this work is the extension of Buzzard's theorem from the complex field $\mathbb{C}$ to every infinite field of any characteristic. The paper explicitly notes that previous generalizations (including those by Forstneric and the group of Arzhantsev et al.) were restricted to $\mathbb{C}$ and relied on analytic methods. By utilizing purely algebraic tools—specifically the Chinese Remainder Theorem and the structure of tame automorphisms—this work provides a constructive proof that is valid in the broader context of algebraic geometry over arbitrary infinite fields.

The paper also modestly notes (Remark 2) that while the main theorem requires an infinite field, the result may hold over finite fields provided the number of points $k$ is sufficiently small relative to the order of the field.

More like this