🔢 mathematics

Solubility for families of norm equations coming from abelian number fields

This paper establishes the order of magnitude for the number of values represented by an irreducible binary quadratic form that are norms from an abelian number field with class number one, utilizing the fundamental lemma of sieve theory and the geometry of numbers.

Original authors: Mathieu Da Silva

Published 2026-04-15

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Mathieu Da Silva

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 a master architect trying to build a specific type of bridge. The blueprint for this bridge is a mathematical equation called a norm equation.

In this paper, the author, Mathieu Da Silva, is asking a very specific question: How many different ways can we build this bridge using only whole-number bricks?

Here is a breakdown of the paper's concepts using everyday analogies:

1. The Two Ingredients: The Shape and the Material

To build your bridge, you need two things:

The Shape (The Form $F$ ): Imagine a quadratic equation like $s^2 - 2t^2$ . This is a recipe that takes two whole numbers ( $s$ and $t$ ) and mixes them together to create a new number. The author calls this a "binary quadratic form." It's like a machine that spits out a number based on your input.
The Material (The Number Field $L$ ): Imagine a special warehouse of "magic bricks." These aren't just normal numbers; they are numbers from a complex mathematical world called an "abelian number field." Some of these bricks are very special: they are "norms." A norm is a number that can be built by stacking these magic bricks together in a specific way.

The Goal: The author wants to know: If we run our "Shape Machine" (the form $F$ ) with all possible whole number inputs up to a certain size ( $B$ ), how many of the resulting numbers can be built using our "Magic Bricks" (the norms from $L$ )?

2. The Problem: Finding the Right Bricks

In the past, mathematicians knew how to count these matches for simple cases (like when the warehouse only had 2 types of bricks). But this paper tackles a much harder puzzle:

The warehouse is huge and complex (it has a degree $n \geq 2$ ).
The shape machine is a bit tricky (it's a quadratic form).
We need to find a pattern in the chaos.

The author proves that even in this complex scenario, there is a predictable rhythm to how many matches we find.

3. The Detective Work: Sieves and Lattices

To solve this, the author uses two main tools, which he describes as "Sieves" and "Geometry."

The Sieve (Filtering the Noise): Imagine you have a giant bucket of sand (all possible numbers). You want to keep only the gold grains (the numbers that are norms). You can't look at every single grain. Instead, you use a sieve (a mathematical filter) to shake out the obvious junk.
- The author uses a "Fundamental Lemma of Sieve Theory." Think of this as a super-smart sieve that knows exactly how many holes to poke in the bucket to catch the gold without losing too much. It helps him estimate the count without checking every single number.
The Geometry (Mapping the Territory): The author also uses "Geometry of Numbers." Imagine the numbers are points on a giant grid. The author looks at the shape of the area where the "good" numbers live. He calculates the volume of this area to estimate how many points (numbers) fit inside it. It's like estimating how many people can fit in a stadium by measuring the stadium's area, rather than counting heads one by one.

4. The Big Discovery: The "Logarithmic" Rhythm

The most exciting part of the paper is the answer. The author finds that the number of matches doesn't just grow randomly; it grows according to a very specific formula:

$\text{Count} \approx \frac{B^2}{(\log B)^{\text{something}}}$

$B^2$ : This is the "easy" part. If you double your input size, the number of possibilities quadruples (like the area of a square).
$(\log B)^{\text{something}}$ : This is the "hard" part. It's a correction factor. It accounts for the fact that not every number is a "magic brick." The "something" in the exponent depends on how the "Shape Machine" ( $F$ ) interacts with the "Magic Bricks" ( $L$ ).

The Analogy: Imagine you are looking for red marbles in a jar of mixed marbles.

If the jar is huge ( $B$ ), you expect to find a lot of marbles.
But because red marbles are rare, you have to divide your total by a "rarity factor."
The author calculated exactly how rare the red marbles are based on the specific rules of the jar and the shape of the marble.

5. Why Does This Matter?

This isn't just about counting numbers for fun. It helps mathematicians understand the structure of the universe of numbers.

The "Hasse Norm Principle": This is a famous rule in math that asks: "If a number looks like it can be built locally (in small pieces), can it be built globally (as a whole)?"
The author shows that for these specific types of number fields, the answer is usually "Yes," and he can predict exactly how many solutions exist.

Summary

Mathieu Da Silva has solved a complex counting puzzle. He showed that if you have a specific type of number machine and a specific type of number warehouse, you can predict exactly how many times the machine's output will match the warehouse's inventory. He did this by using a mathematical sieve to filter out the noise and geometry to map the landscape, proving that even in the chaotic world of numbers, there is a beautiful, predictable order.

1. Problem Statement and Motivation

The paper investigates the local and global solubility of norm equations of the form:
$N_{L/\mathbb{Q}}(x) = F(s, t)$
where:

$L/\mathbb{Q}$ is an abelian number field of degree $n \geq 2$ .
$F \in \mathbb{Z}[s, t]$ is an irreducible binary quadratic form over $\mathbb{Q}$ .
$x \in L$ and $(s, t) \in \mathbb{Z}^2$ .

The primary objective is to estimate the number of integer pairs $(s, t)$ with $\max(|s|, |t|) \leq B$ for which the equation has a solution in $L$ . Let $N_{F,L}(B)$ denote this count. The paper aims to establish the order of magnitude of $N_{F,L}(B)$ as $B \to \infty$ .

Context:

This problem relates to the Loughran–Smeets conjecture regarding the distribution of rational points on varieties. However, the paper addresses integral points, which introduces technical difficulties (e.g., the projection map is not proper) that prevent direct application of existing conjectures.
Previous work (e.g., by Daniel, Browning, and the author in [24]) handled the case where $L$ is quadratic. This paper generalizes the result to arbitrary abelian extensions $L$ of degree $n$ , provided the ring of integers $\mathcal{O}_L$ is a Principal Ideal Domain (PID).

2. Main Results

Theorem 1.1 (Main Lower Bound):
Let $L/\mathbb{Q}$ be an abelian extension of degree $n \geq 2$ with class number 1 (so $\mathcal{O}_L$ is a PID). Let $F$ be an irreducible binary quadratic form over $\mathbb{Q}$ . Assume there exists a non-trivial solution $(s_0, t_0, x_0)$ such that $F(s_0, t_0)$ is coprime to the conductor of $L$ . Let $r$ be the number of irreducible factors of $F$ in $L[s, t]$ . Then:
$N_{F,L}(B) \asymp \frac{B^2}{(\log B)^{1 - \frac{r}{n}}}$
This result implies that the lower bound is sharp because it matches the upper bound derived for local solubility.

Proposition 1.4 (Upper Bound for Local Solubility):
If $L$ and the field $K = \mathbb{Q}[x]/(F(x, 1))$ are both Galois over $\mathbb{Q}$ , the number of pairs $(s, t)$ admitting a solution in the adèle ring $\mathbb{A}_{\mathbb{Q}}$ (local solubility) satisfies:
$N^{\text{loc}}_{F,L}(B) \ll \frac{B^2}{(\log B)^{1 - \frac{r}{n}}}$
Since $N_{F,L}(B) \leq N^{\text{loc}}_{F,L}(B)$ , the lower bound in Theorem 1.1 is optimal.

Significance of $r$ :
The exponent $1 - r/n$ depends on the splitting behavior of $F$ in $L$ .

If $F$ remains irreducible in $L$ , $r=1$ , and the exponent is $1 - 1/n$ .
If $F$ splits completely in $L$ , $r=n$ , and the exponent is $0$ (recovering the standard $B^2$ density).

3. Methodology

The proof combines analytic number theory, geometry of numbers, and sieve theory. The strategy is divided into three main stages to establish the lower bound.

A. Analytic Tools and Character Sums

The author utilizes the fact that $L/\mathbb{Q}$ is abelian to express the representation function $r_L(k)$ (number of ideals of norm $k$ ) using Dirichlet characters.

Character Identification: Using class field theory, characters of $\text{Gal}(L/\mathbb{Q})$ are identified with Dirichlet characters modulo the conductor $q_L$ .
Decomposition: $r_L(k)$ is written as a convolution involving a multiplicative function $\psi_L$ derived from the product of non-trivial characters.
Irreducibility Criterion: A key lemma (Lemma 1.8) links the irreducibility of $F$ over $L$ to the non-triviality of specific characters $\tilde{\chi}$ . If $F$ is irreducible over $L$ , all relevant characters are non-trivial, allowing the use of prime number theorems for $L$ -functions.

B. Geometry of Numbers and Lattice Counting

To count pairs $(s, t)$ such that $F(s, t)$ is a norm, the author uses a sieve to filter out non-norms.

Lattice Decomposition: The condition $F(s, t) \equiv 0 \pmod k$ is analyzed by decomposing the set of solutions into lattices. The number of points in these lattices within a box $[-B, B]^2$ is estimated using Minkowski's theorem and results from Daniel [6].
Error Terms: The error terms in lattice counting are controlled carefully, requiring $F$ to be quadratic (degree 2) to ensure the error does not dominate the main term. This explains why the method is restricted to $\deg F = 2$ .

C. Sieve Theory (Fundamental Lemma)

The core of the lower bound proof relies on the Fundamental Lemma of Sieve Theory (Lemma 4.1).

Sieve Setup: The problem is reduced to estimating a sum of the form $\sum \mu^2(F(s,t)) \frac{r_L(F(s,t))}{n^{\omega(F(s,t))}}$ .
Multiplicative Functions: The author defines specific multiplicative functions $g(d)$ related to the density of norms.
Application: By applying the sieve with parameters $y = B^{\epsilon_0}$ and $z = B^\eta$ , the author isolates the contribution of "smooth" numbers and controls the error terms.
Handling Reducibility:
- Case 1 ( $F$ irreducible over $L$ ): The standard sieve yields the exponent $1 - r/n$ .
- Case 2 ( $F$ reducible over $L$ ): The author uses a Galois theoretic argument (Section 5) to decompose $L$ into subfields where $F$ becomes irreducible, effectively reducing the problem to a field of degree $n/2$ (or similar), adjusting the exponent accordingly.

4. Key Contributions

Generalization to Abelian Fields: Extends previous results (limited to quadratic fields) to any abelian extension $L/\mathbb{Q}$ of degree $n$ , provided $\mathcal{O}_L$ is a PID.
Sharp Asymptotic: Provides a matching lower and upper bound, proving that the order of magnitude is exactly $B^2 (\log B)^{-(1-r/n)}$ . This confirms the prediction of the Loughran–Smeets conjecture for this specific family of integral points.
Handling Integral Points: Successfully navigates the difficulties of counting integral points (as opposed to rational points) on non-proper varieties, a setting where standard geometric conjectures often fail or require modification.
Explicit Dependence on Splitting: The result explicitly quantifies how the number of irreducible factors of $F$ in $L$ affects the density of solutions, linking the analytic behavior directly to the algebraic structure of the field extension.

5. Significance and Limitations

Significance:

The paper bridges the gap between the arithmetic of norm forms and the geometry of varieties.
It provides a concrete verification of the "knot group" heuristic (related to the Hasse Norm Principle) in the context of counting integral points.
It demonstrates that for abelian fields, the obstruction to the Hasse Norm Principle (measured by the knot group) does not affect the order of magnitude of the count, only the constant factor.

Limitations:

Class Number 1: The result assumes $\mathcal{O}_L$ is a PID. While explicit examples exist (e.g., cyclotomic fields of small degree), the existence of infinitely many such fields is an open problem.
Degree of $F$ : The method relies on the geometry of numbers estimates for quadratic forms. The error terms in lattice counting for higher-degree forms are currently too large to allow the method to work for $\deg F > 2$ .
Abelian Assumption: The proof heavily relies on the abelian nature of $L$ to use Dirichlet characters and the specific structure of the Galois group. Non-abelian extensions are not covered.

Conclusion

Mathieu Da Silva's paper establishes a precise asymptotic formula for the number of integral solutions to norm equations $N_{L/\mathbb{Q}}(x) = F(s, t)$ where $L$ is an abelian number field and $F$ is a binary quadratic form. By combining sieve methods with deep results from algebraic number theory and geometry of numbers, the author proves that the density of solutions is governed by the splitting behavior of $F$ in $L$ , confirming theoretical predictions for this class of Diophantine problems.