Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Browning–Heath-Brown: Counting rational points on quadric surfaces

../


Full paper in Markdown. The file's first page, the Discrete Analysis 2018:15 cover, prints "Licensed under a Creative Commons Attribution License (CC-BY)" and names no version, so the term is the Creative Commons Attribution license without a version; the file is arXiv's v3 (stamp "arXiv:1801.00979v3 [math.NT] 7 Sep 2018"), whose arXiv record names only arXiv's non-exclusive distribution license (https://arxiv.org/abs/1801.00979v3, read 2026-10-02), which neither upgrades nor contradicts the printed notice.

T. D. Browning, D. R. Heath-Brown, "Counting rational points on quadric surfaces," Discrete Analysis 2018:15 (2018), 29 pp., DOI.

Overview

Browning and Heath-Brown study the uniform counting function

NQ(B)=#{x∈Zprim4:Q(x)=0, ∣x∣≤B}N_Q(B)=\#\{\mathbf x\in\mathbb Z^4_{\mathrm{prim}}:Q(\mathbf x)=0, \ |\mathbf x|\le B\}

for a nonsingular integral quaternary quadratic form. Writing ΔQ\Delta_Q for its discriminant, ∥Q∥\|Q\| for its coefficient height, and Δbad=∏pe∥ΔQ, e≥2pe\Delta_{\mathrm{bad}}=\prod_{p^e\parallel\Delta_Q,\,e\ge2}p^e, Theorem 1.1 proves, under Δbad≤B1/20\Delta_{\mathrm{bad}}\le B^{1/20},

NQ(B)≪εϖ(ΔQ)Δbad1/4+ε(∥Q∥4∣ΔQ∣)5/8ΠB(B4/3+B2∣ΔQ∣1/4),N_Q(B)\ll_\varepsilon \varpi(\Delta_Q)\Delta_{\mathrm{bad}}^{1/4+\varepsilon} \left(\frac{\|Q\|^4}{|\Delta_Q|}\right)^{5/8} \Pi_B\left(B^{4/3}+\frac{B^2}{|\Delta_Q|^{1/4}}\right),

where ϖ(m)=∏p∣m(1+p−1)\varpi(m)=\prod_{p\mid m}(1+p^{-1}) and ΠB=∏p≤B(1+χ(p)/p)\Pi_B=\prod_{p\le B}(1+\chi(p)/p), with χ\chi induced by (ΔQ/⋅)(\Delta_Q/\cdot); see (1.1), (1.2), and Theorem 1.1. The implied constant depends only on ε\varepsilon. The result is uniform in the coefficients and removes the BεB^\varepsilon-loss, diagonality hypothesis, and square-free-discriminant hypothesis of the earlier result cited in the introduction. For a fixed form with a nontrivial zero, the asymptotics cQB2c_QB^2 for nonsquare discriminant and cQB2log⁡Bc_QB^2\log B for square discriminant are cited from Heath-Brown [9, Theorems 6 and 7], not proved here. Conjecture 1.2, also not proved, proposes coefficient-independent bounds of these respective orders. The example k(x12+x22+x32−x42)k(x_1^2+x_2^2+x_3^2-x_4^2) following (1.3) shows that any estimate of the displayed shape (1.3) must have exponent α≥1/4\alpha\ge1/4 on Δbad\Delta_{\mathrm{bad}}.

The proof begins with a Siegel-lemma slicing. Lemma 2.1 assigns every point to a primitive hyperplane c⋅x=0\mathbf c\cdot\mathbf x=0 with ∣c∣≪B1/3|\mathbf c|\ll B^{1/3}, giving the sum (2.1) over O(B4/3)O(B^{4/3}) ternary conics. For Q∗(c)≠0Q^*(\mathbf c)\ne0, Lemma 2.2 covers each real slice by logarithmically many ellipsoids whose volumes are controlled explicitly by Q∗(c)Q^*(\mathbf c), ∥Q∥\|Q\|, ΔQ\Delta_Q, ∣c∣|\mathbf c|, and BB; the determinant identities driving this estimate are (2.3)–(2.5). Lemmas 2.3 and 2.4 convert these ellipsoids into coordinate boxes adapted to suitable lattice bases.

The arithmetic treatment of each conic combines the elementary box estimate of Lemma 2.5 with the local lattice decomposition of Lemma 2.6. The latter covers primitive zeros of a nonsingular ternary form qq by lattices satisfying the determinant lower bound (2.11), with the number of lattices governed by explicit local factors and possibly equal to zero when there is a local obstruction. For the hyperplane restriction QcQ_{\mathbf c}, Lemma 2.7 gives the key identity det⁡Mc=Q∗(c)\det M_{\mathbf c}=Q^*(\mathbf c), and Lemma 2.8 transfers the local determinant bound back to the original three-dimensional lattice. Lemma 2.9 then bounds the number of points on one slice in terms of the multiplicative function RR defined in (2.16). Summing the slice bounds yields the reduction (2.17), involving averages of R(Q∗(c))R(Q^*(\mathbf c)).

Section 3 supplies the principal analytic input. Lemma 3.1 computes ϱ(p)=p3+(ΔQ/p)(p2−p)\varrho(p)=p^3+(\Delta_Q/p)(p^2-p) away from 2Δbad2\Delta_{\mathrm{bad}} and bounds all ϱ(pk)\varrho(p^k). Theorem 3.2 is a Shiu-type short-box estimate: subject to the polynomial-size condition (3.2), for h∣Δbad3h\mid\Delta_{\mathrm{bad}}^3 and h≤X1−εh\le X^{1-\varepsilon}, it bounds the average of R(∣Q∗(x)∣)R(|Q^*(\mathbf x)|) over a box and the congruence h∣Q∗(x)h\mid Q^*(\mathbf x) by

≪A,εΔbadεh−1(Δbad3,h4)1/4 SX4log⁡X.\ll_{A,\varepsilon}\Delta_{\mathrm{bad}}^\varepsilon h^{-1} (\Delta_{\mathrm{bad}}^3,h^4)^{1/4}\, \mathfrak S\frac{X^4}{\log X}.

Its proof uses the Selberg-sieve estimate in Lemma 3.3 and the Euler-factor analysis of Lemma 3.4.

In Section 4, Lemma 4.1 covers dyadic regions in (c,Q∗(c))(\mathbf c,Q^*(\mathbf c)) by boxes of side X=B1/6X=B^{1/6}; Lemma 4.2 disposes of forms with exceptionally large coefficients and reduces to primitive forms of controlled height. Applying Theorem 3.2 and estimating S\mathfrak S by Mertens’ theorem produces Theorem 1.1 for nonsquare discriminant. Section 5 handles square discriminant: rational lines can occur, but their Plücker points form a conic, and the resulting additional contribution is O(B2log⁡B)O(B^2\log B); the paper shows that this is absorbed by the stated bound. Thus the scope is homogeneous nonsingular quadrics in four variables, with explicit but potentially large dependence on coefficient shape and square-full discriminant, and with the quantitative restriction Δbad≤B1/20\Delta_{\mathrm{bad}}\le B^{1/20}.

Relation to E940

This source bears on Problem 940.

The paper neither formulates nor proves a density statement for any of the sets in E940.