🔢 mathematics

Quantitative Oppenheim Conjecture for Random Quadratic Forms and Optimal Variance Bounds in Function Fields

This paper establishes a quantitative version of the Oppenheim conjecture for random quadratic forms over function fields by computing higher moments of the Siegel transform, deriving optimal variance bounds for lattice point counts, and determining the exact variance for points within a ball.

Original authors: Jiyoung Han, Noy Soffer Aranov

Published 2026-06-16

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Jiyoung Han, Noy Soffer Aranov

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 standing in a vast, infinite city made of numbers. In this city, there are invisible grids (called lattices) made of points. You also have a special machine, a quadratic form, which takes any point in the city, crunches it through a specific mathematical formula, and spits out a new number.

The big question mathematicians have been asking for nearly a century is: If you feed all the points in this city into the machine, will the resulting numbers cover every possible value, or will they leave huge gaps?

This is known as the Oppenheim Conjecture. In the "real world" (the numbers we use every day), mathematicians already proved that these machines do cover everything, but they couldn't say exactly how fast or how evenly they fill the gaps.

This paper by Jiyung Han and Noy Soffer Aronov tackles this problem in a different, more exotic world called Function Fields. Think of this world as a city built not on a continuous line, but on a grid of discrete, blocky steps (like a video game world made of pixels rather than a smooth painting). In this "pixelated" world, the rules of distance are different (if you take two steps, you don't get twice as far; you just stay at the same distance as the furthest step).

Here is what the authors did, broken down into simple concepts:

1. The "Pixelated" City and the Magic Machine

In this paper, the authors study a specific type of mathematical machine (a quadratic form) in this pixelated city. They wanted to prove that if you look at enough points, the machine's output will fill up any small target area you pick, and they wanted to know exactly how many points it takes to do that.

2. The "Crowd Counting" Problem

To solve this, the authors had to count how many points from the invisible grids land inside specific shapes (like balls or boxes) in this city.

The Challenge: Counting these points is like trying to guess how many people are in a crowded room just by looking at the shadows they cast. It's hard because the shadows overlap and shift.
The Tool: They used a mathematical tool called the Siegel Transform. Imagine this as a special camera that takes a picture of the whole city and instantly tells you the average number of people in any room you point it at.

3. The "Variance" (The Wiggle Room)

Knowing the average number of people in a room isn't enough; you need to know how much the actual number "wiggles" or fluctuates from that average.

The Metaphor: If you flip a coin 100 times, you expect 50 heads. But sometimes you get 48, sometimes 52. The "variance" is a measure of how much you might get 40 or 60 instead.
The Breakthrough: The authors calculated the exact variance for this pixelated city. They found a perfect, tight limit on how much the crowd count can wiggle. They proved that in this specific world, the "wiggle room" is as small as mathematically possible. This is a major achievement because, in the "real" world, we can only estimate this wiggle room, not calculate it exactly.

4. The "Bouncing Ball" Trick

One of the coolest parts of the paper is how they handled the geometry. In the real world, if you roll a ball, it can stop anywhere. In this pixelated world, the rules are stricter: if two balls overlap, one is completely inside the other, or they don't touch at all.

The authors used this "all-or-nothing" property to count points with extreme precision. It's like counting marbles in a jar where the marbles are either perfectly stacked or completely separate, with no messy in-between states. This allowed them to get exact formulas rather than just rough guesses.

5. The Final Result

By combining their perfect variance calculations with their exact counting methods, they proved a Quantitative Oppenheim Conjecture for this pixelated world.

What it means: They showed that for almost any random machine (quadratic form) in this city, if you look at points up to a certain size, the number of outputs landing in your target area is almost exactly what you would expect, with a very small, predictable error margin.

Summary

Think of the authors as cartographers mapping a new, strange continent.

The Map: They proved that the "terrain" of numbers in this pixelated world is dense and continuous, just like in our world.
The Compass: They built a new, ultra-precise compass (the variance bound) that tells you exactly how accurate your map is.
The Discovery: Unlike previous maps that were just sketches, they drew a map with exact coordinates, showing that in this specific mathematical universe, the distribution of numbers is perfectly predictable and follows a strict, optimal pattern.

They didn't just say "it works"; they said "it works this much, with this much error, and here is the exact math to prove it."

Technical Summary: Quantitative Oppenheim Conjecture for Random Quadratic Forms and Optimal Variance Bounds in Function Fields

Problem Statement
The paper addresses the quantitative version of Oppenheim's conjecture within the setting of function fields (specifically local fields of positive characteristic). While Oppenheim's conjecture (that the image of an irrational non-degenerate indefinite quadratic form $Q$ on $\mathbb{Z}^n$ is dense in $\mathbb{R}$ ) was proven for real fields by Margulis using homogeneous dynamics, quantitative versions (estimating the rate of density) have been established for real fields under various Diophantine conditions. However, quantitative results for local fields of positive characteristic were previously absent. The authors aim to fill this gap by proving a quantitative version of Mohammadi's qualitative result for generic non-degenerate isotropic quadratic forms over function fields.

Methodology
The authors employ the geometry of numbers and homogeneous dynamics adapted to the function field setting $K_\infty = \mathbb{F}_q((x^{-1}))$ . The core methodology involves:

Siegel Transforms and Moments: The authors define a function field analogue of the Siegel transform, $\hat{f}(\Lambda) = \sum_{v \in \Lambda \setminus \{0\}} f(v)$ , for smooth, compactly supported functions $f$ . They compute the higher moments of this transform.
Variance Bounds: A central technical component is the derivation of an optimal upper bound for the variance of the number of lattice points in a set. This is achieved by establishing a function field analogue of Rogers' second moment formula.
Margulis $\alpha$ -Function: To control the moments of the Siegel transform, the authors prove that the Margulis $\alpha$ -function (which measures the "thinness" of a lattice) has bounded moments in the function field setting. This relies on the Iwasawa decomposition and the properties of successive minima in ultrametric spaces.
Exact Volume Computations: Unlike the real setting where volume estimates are often asymptotic, the authors leverage the ultrametric inequality to compute the exact volume of sets defined by quadratic forms and norm constraints.
Witt's Theorem: The proof of the volume asymptotics relies on a function field analogue of Witt's theorem, establishing the transitivity of the orthogonal group action on spheres of fixed norm and quadratic form value.

Key Contributions and Results

Quantitative Oppenheim Conjecture (Theorem 1.1): For $n \ge 3$ , for almost every non-degenerate isotropic quadratic form $Q$ , and for any bounded measurable set $I \subseteq K_\infty$ , the number of lattice points $v \in R^n$ satisfying $Q(v) \in I$ and $\|v\| \le q^t$ is given by:
$\# \{v \in R^n : Q(v) \in I, \|v\| \le q^t\} = C_Q q^{(n-2)t} m_{K_\infty}(I) + O_{Q,I}(q^{\delta t(n-2)})$
where $1/2 < \delta < 1$ and $C_Q$ is a constant depending on $Q$ . This establishes the effective density of the image of $Q$ .
Exact Volume Formula (Theorem 1.2): The authors derive an exact formula for the volume of the set $\{v \in K_\infty^n : Q(v) \in I, \|v\| = q^t\}$ . They show that for large $t$ , this volume is exactly $J_Q q^{(n-2)t} m_{K_\infty}(I)$ , where $J_Q$ is a constant. This contrasts with the real setting where such formulas are typically only asymptotic.
Optimal Variance Bounds (Theorem 1.6 & Proposition 1.7):
- The paper establishes an optimal upper bound for the variance of the number of lattice points in a measurable set $B$ : $\text{Var}(X_B) \le C_n \text{Vol}(B)$ .
- Crucially, the authors compute the exact variance for metric balls $B(\alpha, r)$ . They find that the variance depends on whether the ball is centered at the origin or not, providing a precise formula that differs from the real case (where exact variance for off-center balls is difficult to determine).
Higher Moment Formulae (Theorem 3.3): The authors prove a general formula for the $k$ -th moment of the Siegel transform in function fields, analogous to Rogers' formula in the real case. This involves decomposing the space of $k$ -tuples of vectors based on rational subspaces and admissible matrices over the polynomial ring $R = \mathbb{F}_q[x]$ .
Bounded Moments of the Margulis $\alpha$ -Function (Theorem 1.9): The paper proves that the $m$ -th moment of the Margulis $\alpha$ -function is finite for $m < n$ , a necessary condition for the convergence of the moment integrals used in the main proofs.

Significance
The paper claims to fill a significant gap in the literature by providing the first quantitative results for Oppenheim's conjecture over local fields of positive characteristic. Its significance lies in:

Extending Quantitative Number Theory: It demonstrates that effective density results, previously restricted to zero characteristic or specific Diophantine conditions in the real setting, hold generically in the function field setting.
Methodological Innovation: The derivation of exact volume formulas and exact variance bounds for lattice points in function fields highlights the unique advantages of the ultrametric setting (e.g., the strong triangle inequality), which allows for computations that are asymptotic or intractable in the real case.
Foundational Tools: The establishment of the function field analogue of Rogers' higher moment formula and the proof of bounded moments for the Margulis $\alpha$ -function provide essential tools for future research in the geometry of numbers over function fields.

The authors note that their results hold for odd characteristic; the case of characteristic 2 is excluded because the correspondence between quadratic forms and bilinear forms breaks down (as 2 is not invertible), causing specific theorems (like Theorem 4.3) to fail.