🔢 mathematics

Explicitly combing hedgehogs over fields of Stufe 4

This paper provides an explicit construction of a matrix in $\operatorname{SL}_3(K[x,y,z])$ with first row $(x,y,z)$ for any field $K$ of Stufe at most 4, thereby offering a concrete solution to a problem previously settled only by an existential proof.

Original authors: Peter Müller

Published 2026-05-18

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Peter Müller

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 Big Picture: The "Hedgehog" Problem

Imagine a perfect, smooth ball (like a beach ball). Now, imagine sticking a tiny needle (a vector) into every single point on the surface of that ball. All the needles must point in a direction that is perfectly tangent to the surface (like the bristles of a hedgehog).

The famous "Hairy Ball Theorem" from real-world math says: You cannot comb a hedgehog. If you try to arrange all those needles so they flow smoothly without any of them stopping or pointing straight up (a "bald spot"), you will fail. On a real sphere, there will always be at least one point where the needle vanishes or stands straight up.

However, this paper isn't about real balls; it's about algebraic balls defined by equations over different types of number systems (fields). The question posed by mathematician Umberto Zannier was: Can we "comb" this algebraic hedgehog if we use specific types of number systems, specifically those involving 2-adic numbers?

The Challenge: The "Stufe" of a Field

To understand the solution, you need to know a property of the number system called the Stufe (German for "step" or "level").

Think of the Stufe as a measure of how "negative" a number system can get using only squares.
In the real numbers, you can't make -1 by adding squares (since $1^2 + 1^2 = 2$ , etc.). So, the real numbers have an infinite Stufe. This is why the Hairy Ball Theorem works there.
In other number systems (like $p$ $p$ -adic numbers), you can make -1 by adding squares.
- If you need 2 squares to make -1, the Stufe is 2.
- If you need 4 squares to make -1, the Stufe is 4.

The Problem:
Mathematicians already knew that if the Stufe is 2, you can easily "comb" the hedgehog (construct a matrix that works). But for the 2-adic numbers ( $\mathbb{Q}_2$ ), the Stufe is 4. Previous mathematicians (Ananyevskiy and Levine) proved that a solution exists for Stufe 4, but their proof was like a magic trick: they showed a solution must exist, but they didn't show you what the solution actually looks like. They left the "recipe" hidden.

The Solution: Müller's Explicit Recipe

Peter Müller's paper does the heavy lifting to find that missing recipe. He doesn't just say "it's possible"; he writes down the exact formula for the matrix that combs the hedgehog.

The Analogy of the Matrix:
Think of the matrix as a 3D machine with three rows of instructions:

Row 1: The position on the sphere ( $x, y, z$ ).
Row 2 & 3: The instructions for the "needles" (the vector field).

The goal is to build this machine so that no matter where you stand on the sphere, the needles never stop moving (they never vanish). The paper provides a specific set of algebraic instructions (polynomials) for Rows 2 and 3, based on four numbers ( $a, b, c, d$ ) that satisfy the condition $a^2 + b^2 + c^2 + d^2 = -1$ .

How He Found It (The Detective Work)

Finding this recipe wasn't easy. Müller describes a process that feels like searching for a needle in a haystack, but with a computer:

The Guess: He assumed the instructions (the polynomials) were simple (degree 1).
The Trap: When he tried to solve the equations, he hit a wall. The computer couldn't solve the massive system of equations directly.
The "Mod 2" Shortcut: He looked at the problem using a very simple number system (just 0 and 1). He found 80 possible starting patterns.
The Filter: Most of those 80 patterns failed when he tried to lift them up to more complex numbers. Only four patterns survived.
The Breakthrough: He realized that the remaining patterns were hiding a secret relationship. By treating the variables as ingredients in a complex recipe, he found that the relationship between them could be simplified into a sum of squares.
The Final Formula: He matched this simplified relationship to the four numbers ( $a, b, c, d$ ) required for the Stufe 4 field. This allowed him to write down the final, explicit matrix shown in Theorem 1.2.

The "Z2" Bonus

The paper also tackles a harder version of the problem: the 2-adic integers ( $\mathbb{Z}_2$ ). This is like asking for a hedgehog comb that works not just on the "fractional" 2-adic numbers, but on the "whole number" 2-adic integers.

Müller shows that by plugging in specific values involving $\sqrt{-7}$ , he can create a matrix that works perfectly for this stricter system.
He even provides a specific example (Theorem 1.3) where the determinant of the matrix is exactly 5, proving it works.

Summary

The Problem: Can we arrange vectors on a mathematical sphere so they never stop, specifically in a number system where you need 4 squares to make -1?
The Previous State: Mathematicians knew the answer was "Yes," but they couldn't show how.
The Paper's Contribution: Peter Müller provided the explicit formula (the "how"). He used computer algebra to search through thousands of possibilities, filter out the failures, and derive a concrete set of instructions that anyone can use to "comb the hedgehog" over these specific fields.
The Result: A concrete matrix exists, and the paper writes it down in full detail, settling a question that had been open for some time.

Technical Summary: Explicitly Combing Hedgehogs over Fields of Stufe 4

Problem Statement
The paper addresses a specific instance of the unimodular matrix completion problem, originally posed by Umberto Zannier. Let $K$ be a field and $K[x, y, z] = K[X, Y, Z]/(X^2 + Y^2 + Z^2 - 1)$ be the coordinate ring of the algebraic unit sphere over $K$ . The central question (Question 1.1) asks whether there exists a matrix in $SL_3(K[x, y, z])$ whose first row is $(x, y, z)$ .

Geometrically, the existence of such a matrix is equivalent to the existence of a nowhere-vanishing vector field on the algebraic sphere $S(\bar{K})$ (where $\bar{K}$ is the algebraic closure of $K$ ). While Zannier had established a positive answer for fields where $-1$ is a sum of two squares (Stufe $\le 2$ ), such as $\mathbb{Q}_p$ for odd primes $p$ , the case for fields of Stufe 4 remained open. Specifically, the field of 2-adic numbers $\mathbb{Q}_2$ has Stufe 4, and while Ananyevskiy and Levine [1] proved the existence of such a matrix for any field of Stufe $\le 4$ using advanced, purely existential methods, they did not provide an explicit construction.

Methodology
The author, Peter Müller, employs a constructive approach combining algebraic geometry, computational algebra, and number theory to derive an explicit matrix. The methodology proceeds as follows:

Formulation as a Polynomial System: The problem is translated into finding a $3 \times 3$ matrix $M$ with polynomial entries of degree at most 1 (an optimistic assumption that simplifies the search space) such that $\det(M) \equiv 1 \pmod{X^2 + Y^2 + Z^2 - 1}$ . This condition generates a system of 16 quadratic polynomial equations in 24 unknown coefficients ( $a_0, \dots, a_{23}$ ).
Reduction and Simplification: The author utilizes symmetry arguments (permuting variables and scaling rows/columns) to reduce the number of free parameters. By fixing specific coefficients (e.g., setting $a_{15}=1$ and $a_0=a_3=a_{12}=a_{13}=0$ ), the system is reduced to 19 unknowns.
Computational Search via Finite Fields: To navigate the complexity of the system, the author first analyzes solutions over the finite field $\mathbb{F}_2$ . There are 80 solutions in $V(\mathbb{F}_2)$ . A depth-first backtracking search is used to lift these solutions to the 2-adic integers $\mathbb{Z}_2$ . Only four of the 80 solutions lift to $\mathbb{Z}_2$ modulo $2^{50}$ , suggesting they correspond to valid solutions in $\mathbb{Q}_2$ .
Handling High-Dimensional Varieties: Direct computation of a Gröbner basis for the full system is infeasible due to memory constraints (exceeding 128GB). Instead, the author specializes variables to observe the dimension of the solution variety. It is discovered that the variety has components of different dimensions. A "slack variable" technique is employed to handle a specific polynomial relation ( $a_{19}^2 + a_{23}^2 + 1 = 0$ ) that has no solutions in fields of Stufe 4, effectively isolating the relevant component of the variety.
Deriving Explicit Relations: By computing elimination ideals and analyzing low-degree polynomial relations among the remaining variables, the author identifies a specific substitution involving new variables $r, s, t, u$ . This substitution simplifies a complex degree-10 polynomial $f$ into a sum of squares $F = \sum q_i^2$ . The condition $F=0$ is then mapped to the equation $a^2 + b^2 + c^2 + d^2 = -1$ , allowing the coefficients of the matrix to be expressed explicitly in terms of $a, b, c, d$ .

Key Contributions and Results

Theorem 1.2 (Explicit Construction): The paper provides an explicit formula for a matrix $M \in SL_3(K[x, y, z])$ with first row $(x, y, z)$ for any field $K$ of Stufe $\le 4$ . The matrix entries are polynomials in $x, y, z$ with coefficients depending on $a, b, c, d \in K$ such that $a^2 + b^2 + c^2 + d^2 = -1$ . The determinant of this matrix is shown to be a non-zero constant $2a^2(a^2 + d^2)(2abc - a^2 + b^2)$ , which does not vanish under the conditions of the theorem.
Theorem 1.3 (Application to $\mathbb{Z}_2$ ): The author constructs a specific example over the ring of 2-adic integers $\mathbb{Z}_2$ by choosing specific values for $a, b, c, d$ involving $\omega = \sqrt{-7}$ . This yields a matrix with entries in $\mathbb{Z}[\omega][x, y, z]$ with determinant 5. By dividing the second row by 5, an explicit matrix in $SL_3(\mathbb{Z}_2[x, y, z])$ is obtained, answering a sharpened version of Zannier's question for the 2-adic integers.
Computational Verification: The paper includes SageMath and msolve code verifying the determinant calculations and the existence of the solutions, making the construction reproducible.

Significance and Claims
The paper claims to complement the existential proof of Ananyevskiy and Levine [1] by providing the first explicit construction of such a matrix for fields of Stufe 4. The author notes that while the theoretical existence was settled, the lack of an explicit example left the problem open for practical applications and further algebraic investigation.

The title "Explicitly Combing Hedgehogs" refers to the topological interpretation: the matrix corresponds to a nowhere-vanishing vector field on the sphere. The paper highlights that while the "Hairy Ball Theorem" prevents such fields on the real sphere $S(\mathbb{R})$ , they exist on algebraic spheres over fields of appropriate Stufe. The author modestly frames the work as providing the necessary computational techniques and explicit formulas to resolve Zannier's specific request for constructive examples, rather than introducing new theoretical machinery for the existence proof itself. The work serves as a bridge between high-level algebraic K-theory results and concrete polynomial algebra.