← Latest papers
🔢 mathematics

Liouville function, von Mangoldt function and norm forms at random binary forms

This paper establishes that the average behavior of arithmetic functions like the Liouville and von Mangoldt functions over random binary forms yields averaged versions of the Chowla and Bateman-Horn conjectures, while also proving an average case of Colliot-Thélène's conjecture regarding the Hasse principle for Châtelet varieties defined by norm forms.

Original authors: Yijie Diao

Published 2026-08-12
📖 1 min read🧠 Deep dive

Original authors: Yijie Diao

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

Technical Summary: Liouville Function, von Mangoldt Function and Norm Forms at Random Binary Forms

Problem Statement
This paper investigates the average behavior of arithmetic functions evaluated at the values of random binary forms of degree dd. Specifically, it addresses three interconnected problems:

  1. The Chowla Conjecture: Analyzing the cancellation of the Liouville function λ(n)\lambda(n) over values of binary forms.
  2. The Bateman–Horn Conjecture: Establishing asymptotic formulas for the simultaneous prime values of tuples of binary forms, utilizing the von Mangoldt function Λ(n)\Lambda(n).
  3. The Hasse Principle: Determining the proportion of Châtelet varieties defined by norm forms that satisfy the rational Hasse principle.

While previous work by Browning, Sofos, and Teräväinen [5] established analogous results for random polynomials in one variable, this paper extends the framework to binary forms in two variables. The central challenge is to demonstrate that "almost all" binary forms (in a combinatorial sense) exhibit the expected statistical behavior predicted by these conjectures, despite the increased complexity of the underlying geometry and arithmetic.

Methodology
The paper employs a probabilistic and analytic number theory approach, centered on the concept of combinatorial cubes. A combinatorial cube CC is defined as a subset of coefficient vectors (c0,,cd)Zd+1(c_0, \dots, c_d) \in \mathbb{Z}^{d+1} where certain coefficients are fixed and others vary within a range [H,H][-H, H]. The goal is to show that for a set of coefficients CC of side length HH, the "bad" forms (those failing the conjectures) constitute a negligible proportion, specifically O((logH)A)O((\log H)^{-A}).

The core technical machinery involves:

  • Equidistribution in Arithmetic Progressions: The paper generalizes a key tool from [5] (Theorem 2.1), which links the equidistribution of an arithmetic function in arithmetic progressions to its average behavior over random polynomials. This is adapted to binary forms by controlling sums of the form F(amkndk+bmlndl+g(m,n))\sum F(am^k n^{d-k} + bm^l n^{d-l} + g(m,n)).
  • Sieve Theory and Localized Counting: For the norm form problems, the author introduces a localized counting function N^c(x)\hat{N}_c(x). This function approximates the global count of integer solutions to NK(x)=gc(u)N_K(x) = g_c(u) by restricting the search to a specific region BB and incorporating local densities (singular series) and archimedean densities.
  • Approximation and Error Analysis: The proof strategy involves showing that the global counting function Nc(x)N_c(x) is well-approximated by N^c(x)\hat{N}_c(x) for almost all coefficients. This requires bounding the error term Nc(x)N^c(x)|N_c(x) - \hat{N}_c(x)| and demonstrating that the localized function N^c(x)\hat{N}_c(x) is rarely small (i.e., it is large enough to guarantee the existence of solutions).
  • Geometric and Algebraic Constraints: The analysis distinguishes between "separable" forms and those with integer zeros or high content. Lemmas are provided to show that forms failing these "admissibility" conditions are rare. The proof also utilizes properties of the Dedekind zeta function and local densities over pp-adic fields.

Key Contributions and Results

  1. Averaged Chowla Conjecture for Binary Forms (Theorem 1.2):
    The paper proves that for almost all binary forms gZ[s,t]g \in \mathbb{Z}[s, t] of degree dd with coefficients in a combinatorial cube, the sum of the Liouville function over the values of the form exhibits cancellation. Specifically, for x[Hc,2Hc]x \in [H^c, 2H^c],
    supx1x2u,vxλ(g(u,v))(logH)A \sup_{x} \frac{1}{x^2} \left| \sum_{u,v \leq x} \lambda(g(u,v)) \right| \leq (\log H)^{-A}
    holds for all but a negligible fraction of forms.

  2. Averaged Bateman–Horn Conjecture for Binary Forms (Theorem 1.3):
    The author establishes an asymptotic formula for the number of simultaneous prime values of an rr-tuple of binary forms. They show that for almost all rr-tuples, the sum of products of von Mangoldt functions satisfies:
    m,nxΛ(g1(m,n))Λ(gr(m,n))x2Sg1,,gr(x) \sum_{m,n \leq x} \Lambda(g_1(m,n)) \cdots \Lambda(g_r(m,n)) \sim x^2 S_{g_1, \dots, g_r}(x)
    where SS is the product of local densities. This holds uniformly for xx in the specified range.

  3. Rational Hasse Principle for Châtelet Varieties (Theorem 1.5):
    The paper proves that for a fixed norm form NKN_K of degree ee and a varying binary form gg of degree dd (where ede|d), the associated Châtelet variety NK(x)=g(u)N_K(x) = g(u) satisfies the rational Hasse principle for 100% of coefficient vectors.
    #Sglob(H)#Sloc(H)=1+O((logH)A) \frac{\#S_{glob}(H)}{\#S_{loc}(H)} = 1 + O((\log H)^{-A})
    Here, Sloc(H)S_{loc}(H) represents forms locally solvable everywhere, and Sglob(H)S_{glob}(H) represents those with a rational point. The result implies that the Brauer–Manin obstruction is the only obstruction for almost all such varieties.

Significance and Claims
The paper claims to extend the "average" methodology of Browning, Sofos, and Teräväinen [5] from univariate polynomials to binary forms, a significant step given the higher dimensionality and different arithmetic properties of binary forms.

  • Resolution of Colliot-Thélène's Conjecture (Average Case): The work provides an average version of a conjecture by Colliot-Thélène regarding the Hasse principle for Châtelet varieties. While previous results covered specific cases (e.g., linear polynomials or specific degrees), this paper proves the principle holds for 100% of norm form equations of the specified type, provided the degree of the norm divides the degree of the binary form.
  • Quantitative Precision: The results are quantitative, providing explicit error terms of the order (logH)A(\log H)^{-A}, which allows for a rigorous definition of "almost all" in the context of height-ordered binary forms.
  • Methodological Advancement: The paper introduces a refined localized counting function and a detailed analysis of archimedean and non-archimedean densities to handle the norm form equations, overcoming the lack of homogeneity in the Châtelet variety equations.

The author explicitly states that their results prove the rational Hasse principle for 100% of the considered norm form equations, a stronger result than the integral Hasse principle previously established for polynomials in [5], which did not guarantee the rational case with probability 1 due to non-homogeneity. The paper does not claim to resolve the conjectures for every individual form, but rather establishes their validity in the statistical limit over the space of coefficients.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →