🔢 mathematics

Effective Bertini theorems and zeros of $p$ -adic forms of degrees 7 and 11

This paper establishes an effective Bertini-type theorem using a relaxed factorization algorithm to prove Artin's conjecture for $p$ -adic forms of degrees 7 and 11 over finite fields with sufficiently large residue cardinalities ( $q > 679$ and $q > 7393$ , respectively).

Original authors: Lea Beneish, Christopher Keyes

Published 2026-03-03

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Lea Beneish, Christopher Keyes

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

Imagine you are an architect trying to build a bridge across a river. The river represents a complex mathematical problem, and the bridge represents a solution (a "zero" or a point where a formula equals zero).

This paper is about proving that bridges can always be built across a specific type of river, provided the river isn't too "crowded" with obstacles.

Here is the breakdown of the paper's story, using simple analogies:

1. The Big Goal: Artin's Conjecture

In the 1950s, a mathematician named Emil Artin made a bold guess (a conjecture). He said:

"If you have a complex formula involving many variables (like a giant recipe with 100 ingredients), and the formula is of a certain 'prime' complexity (like 7 or 11), you can always find a solution, as long as the numbers you are working with are large enough."

Think of it like a game of hide-and-seek. Artin claimed that no matter how you hide the "treasure" (the solution) inside a giant box of numbers, if the box is big enough, you will always find it.

For a long time, mathematicians knew this was true for simple formulas (degree 2 and 3) and for very large boxes. But for the "prime" degrees of 7 and 11, the box size required to guarantee finding the treasure was unknown or very large.

2. The Problem: The "Crowded River"

The authors are working with p-adic numbers. You can think of these as numbers that have a special "texture" or "grain."

The River: The set of all possible numbers in this system.
The Obstacles: Sometimes, the formula (the river) is so messy that it breaks apart into smaller, simpler pieces (factors). If the river breaks into pieces, finding a smooth path (a solution) is easy.
The Hard Part: The real challenge is when the river is a single, solid, unbreakable block (an irreducible formula). In this case, the river might be so rough and full of jagged rocks (singularities) that you can't find a smooth path to cross.

Previous mathematicians (like Wooley) had built a bridge, but it required the river to be massive (millions of units wide) to guarantee a smooth path. The authors wanted to build a bridge that works for much smaller rivers.

3. The New Tool: The "Effective Bertini Theorem"

To build their bridge, the authors invented a new tool called an Effective Bertini Theorem.

The Analogy:
Imagine you have a giant, 3D sculpture made of clay (the formula). You want to slice it with a knife (a plane) to see what the cross-section looks like.

The Old Way: You just guess where to slice. Sometimes you hit a weird, broken piece of clay.
The New Way (The Authors' Tool): They created a mathematical "laser guide." This guide tells you exactly where not to slice. It says: "If you slice here, you might get a broken piece. But if you slice anywhere else (and there are millions of 'else' spots), you are guaranteed to get a nice, solid, unbroken piece of clay."

This tool is an improvement on a method from the 1990s. The authors tweaked it to be more flexible, allowing them to handle cases where the clay has a few cracks (singularities) but is still mostly solid.

4. The Strategy: Finding the "Weak Spots"

The authors didn't just slice the clay randomly. They used a clever two-step strategy:

Find the Cracks: They looked for two specific points on the surface of the sculpture that were "cracked" (singular points).
Connect the Cracks: They drew a line between these two cracked points.
- The Magic: Even though the points themselves were cracked, the line connecting them often passed through a smooth, perfect spot nearby.
- The Metaphor: Imagine two jagged rocks in a river. If you draw a straight line between them, that line might just barely graze a smooth, flat stone in the middle of the water. That smooth stone is your solution!

By finding these "smooth spots" on the line connecting the cracks, they could prove that a solution exists.

5. The Result: Smaller Boxes, Same Treasure

Using this new "laser guide" and the "crack-connecting" strategy, the authors proved Artin's conjecture for degrees 7 and 11 with much smaller requirements:

For Degree 7: You only need the "river" to be 679 units wide (instead of the previous 883).
For Degree 11: You only need the river to be 7,393 units wide (instead of the previous 8,053).

Why Does This Matter?

In the world of math, "smaller numbers" are like finding a shortcut.

It proves that solutions are more common than we thought.
It shows that the "texture" of these numbers (p-adic fields) is friendlier than previously believed.
It provides a better "map" for future mathematicians to navigate these complex number systems.

In a nutshell: The authors took a difficult puzzle about finding hidden solutions in complex number systems. They built a better "laser guide" to slice through the problem and found that you don't need as big a box to find the answer as everyone thought. They proved that for formulas of complexity 7 and 11, the treasure is much easier to find than we expected.

1. Problem Statement

The paper addresses Artin's Conjecture regarding the solubility of homogeneous forms over $p$ -adic fields.

The Conjecture: Let $K$ be a finite extension of $\mathbb{Q}_p$ with residue field $\mathbb{F}_q$ . Artin conjectured that $K$ is a $C_2$ -field, meaning every homogeneous polynomial $F$ of degree $d$ in $n \ge d^2$ variables has a non-trivial zero in $K$ .
Current Status: The conjecture is known to be false for composite degrees (e.g., $d=4$ ). However, it remains open for prime degrees $d$ .
Specific Goal: The authors aim to establish effective lower bounds on the size of the residue field $q$ such that Artin's conjecture holds for prime degrees $d=7$ and $d=11$ . Specifically, they seek to prove that if $q$ is sufficiently large, any degree $d$ form in $n \ge d^2$ variables has a non-trivial zero in $K$ .

2. Methodology

The authors employ a multi-step strategy combining algebraic geometry over finite fields with $p$ -adic analysis.

A. Effective Bertini Theorems

The core technical innovation is the development of Effective Bertini-type theorems for hypersurfaces over finite fields.

Context: Classical Bertini theorems state that a generic hyperplane section of a smooth variety is smooth. Over finite fields, "generic" does not guarantee existence. The authors provide explicit bounds on the number of "bad" planes (those where the intersection fails to have desired properties).
Factorization Algorithm: They utilize and slightly relax a factorization algorithm for bivariate polynomials (originally by Kaltofen). This allows them to detect when a planar slice of a hypersurface contains factors of small degree or specific singularities.
Key Result (Theorem 2.1/2.2): They prove that for a hypersurface $X_f$ $X_{f}$ of degree $d$ $d$ , if $q$ $q$ exceeds a specific polynomial bound in $d$ $d$ , there exists a plane $P$ $P$ defined over $\mathbb{F}_q$ $F_{q}$ such that the intersection $X_f \cap P$ $X_{f} \cap P$ is:
1. Geometrically integral (irreducible).
2. Free of irreducible components of degree $\le D$ (for a chosen $D$ ).
3. Contains specific singular points if the original form has them.

B. Reduction to Reduced Forms

Following the approach of Birch, Lewis, and Laxton, the problem is reduced to analyzing reduced forms.

A form $F$ is "reduced" if the valuation of its resultant of partial derivatives is minimal among all equivalent forms.
Proposition 4.3: If Artin's conjecture holds for all reduced forms, it holds for all forms. Crucially, for reduced forms, the reduction $f$ modulo $p$ has no linear factors over $\mathbb{F}_q$ .

C. Exploiting Singularities (The "Leep-Yeomans" Strategy)

Unlike previous approaches that relied solely on finding smooth points via Hasse-Weil bounds, the authors exploit the structure of singular points.

Strategy: If a form has no smooth $\mathbb{F}_q$ -points, they show it must possess a specific geometric configuration: two singular $\mathbb{F}_q$ -points ( $y, z$ ) spanning a line $L$ that intersects the hypersurface transversely at a marked geometric point.
Application of Bertini: They use their effective Bertini theorem to find a plane containing this line $L$ $L$ such that the resulting plane curve has:
1. At least two singular $\mathbb{F}_q$ -points.
2. A geometrically irreducible component of high degree.
Benefit: The presence of these extra singularities lowers the geometric genus of the curve, which in turn lowers the threshold for $q$ required to guarantee the existence of a smooth point on the curve (via modified Hasse-Weil bounds).

3. Key Contributions

Refined Effective Bertini Theorems (Theorem A):
- They provide explicit bounds on $q$ ensuring the existence of a plane slice with specific factorization properties.
- They extend previous results (Kaltofen, Cafure-Matera) to handle reducible hypersurfaces and allow for the detection of factors of small degree passing through specific points.
- Theorem 2.9: A polynomial condition $\Psi$ is constructed such that if $\Psi \neq 0$ , the slice has no small-degree factors through a marked point.
Analysis of Degrees 7 and 11:
- They perform a detailed case analysis of the possible factorization types of degree 7 and 11 forms over $\mathbb{F}_q$ that lack linear factors.
- They prove lemmas (e.g., Lemma 3.6, 3.10) showing that if a form has no smooth points, it must contain a line with specific intersection properties (transverse geometric point).
Improved Bounds for Artin's Conjecture (Theorem B):
- By combining the effective Bertini theorems with the analysis of singular configurations, they significantly improve the known lower bounds for $q$ .

4. Main Results

The paper establishes the following effective bounds for the residue field size $q$ :

For Degree $d=7$ :
- If $q > 679$ , every degree 7 form in $n \ge 49$ variables over $K$ has a non-trivial zero.
- Improvement: This improves upon Wooley's previous bound of $q > 883$ .
For Degree $d=11$ :
- If $q > 7393$ , every degree 11 form in $n \ge 121$ variables over $K$ has a non-trivial zero.
- Improvement: This improves upon Wooley's previous bound of $q > 8053$ .

Proof Sketch of the Final Result:

Assume $F$ is a reduced form with no non-trivial zero in $K$ .
By Hensel's Lemma, its reduction $f$ over $\mathbb{F}_q$ has no smooth points ( $X_f(\mathbb{F}_q)_{sm} = \emptyset$ ).
Using Propositions 4.5 and 4.6, the authors show that if $X_f$ has no smooth points, there exist two singular points $y, z$ such that the line $\langle y, z \rangle$ meets $X_f$ at a geometric point of multiplicity 1.
They apply the Effective Bertini Theorem (Theorem 2.9) to find a plane $P$ containing $\langle y, z \rangle$ such that the curve $C = X_f \cap P$ has a geometrically integral component $C'$ of degree $d'$ .
They calculate the geometric genus $g'$ of $C'$ . The existence of the singular points $y, z$ reduces $g'$ .
Using the Hasse-Weil bound (Lemma 3.2), they show that for $q > 679$ (for $d=7$ ) and $q > 7393$ (for $d=11$ ), the number of smooth points on $C$ is strictly positive.
This contradicts the assumption that $X_f$ has no smooth points, implying $F$ must have a zero in $K$ .

5. Significance

Advancement in $p$ -adic Theory: The paper provides the strongest known effective results for Artin's conjecture in prime degrees 7 and 11, narrowing the gap between known counterexamples (composite degrees) and the conjectured truth for primes.
Methodological Innovation: The shift from purely counting points to exploiting singular configurations (finding lines with specific intersection properties) to lower the genus of planar slices is a significant methodological refinement. It demonstrates that "bad" geometric features (singularities) can be leveraged to prove "good" arithmetic properties (existence of smooth points).
Algorithmic Impact: The relaxation of the hypotheses in the bivariate factorization algorithm (Theorem 2.9) makes the effective Bertini theorems more flexible and applicable to a wider range of hypersurfaces, including those that are not geometrically irreducible.