## Question about the Hardy-Littlewood method (quite basic)

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Hi, I have a question about the Hardy-Littlewood method.

Writing $R_s(n)$ for the number of ways to write $n$ as a sum of $s$ $k$-th powers and $f(\alpha )$ for the sum $\sum _{m=1}^Ne(\alpha m^k)$, we have

$R_s(n)=\int _\mathfrak Uf(\alpha )^se(-\alpha n)d\alpha ,$

where $\mathfrak U$ is some unit interval. The aim is to work out an asymptotic expression for $R_s(n)$ by studying this integral. We split the domain of integration into the major and minor arcs:

$R_s(n)=\int _\mathfrak Mf(\alpha )^se(-\alpha n)d\alpha +\int _\mathfrak mf(\alpha )^se(-\alpha n)d\alpha$

and aim to work out an asymptotic expressions for the integral over the major arcs whilst making sure the minor arc contributions are "not too big".

Now, this rests on the fact that $f(\alpha )$ gets "big" near a rational number, and moreover gets "more big" the smaller the denominator of the rational number, so that the major arcs, being intervals around rationals with "small" denominators, give the biggest contribution. My problem essentially is, I think, that I don't understand why this should be true; why does $f$ get "big" near rationals, that is.

In Vaughan's book, we approximate $f(\alpha )$ near these rationals through the function $v(\beta )$ (page 14). I think Lemma 2.7 contains what I don't understand. For example, does this lemma say that

$f(\alpha )\sim \frac {S(q,a)}{q}v(\alpha -a/q)$, as $n\rightarrow \infty$?

And how exactly does it influence our definition of the major arcs and our choice of parameter $v$ in the definition of the major arcs? I assume that $v$ is chosen small enough to gain a saving on the estimate $n^{s/k-1}$ in (2.13) on page 16, and that having $q\leq N^v,\alpha \in \mathfrak M(q,a)$ ensures we get an error no larger than $N^{2v}$ in the lemma, but I still feel I'm missing the big picture in the analysis somehow.

Perhaps I don't have a specific problem as such but want to clarify the situation a little bit; perhaps also it is a problem in that I'm simply not quite settled in the fact that $f(\alpha )$ is large at rationals with small denominators.

In any case, I'd appreciate any thoughts/clarifications/things to think about. Thanks very much.

-

I suggest try to working out explicitly the case where $k=1$ first, when the sum is easily computable and you can use the usual approximation to this sum of numbers over the unit circle. – Asaf Jan 26 at 16:44
Good suggestion.  – Tomos Parry Jan 27 at 12:33

## 1 Answer

I'll split this into two questions:

1. Why can $f$ be large near rationals with small denominator?
2. Why is $f$ small away from these points (i.e. on the minor arcs)?

For (1), I should first clarify that $f$ isn't always large at these rationals; it could well be zero. But it is large some of the time.

Let's look at the example of `$f(a/8)$` for `$a \in \{1, 3, \dots, 7\}$`, when (say) $k=2$. We have:

`\[f(a/8) = \sum_{n=1}^N e(a\, n^2 / 8) \]`

Since $e(an/8)$ only detects the residue of $n \bmod{8}$, we have:

`\[f(a/8) = \frac{N}{8} \sum_{n \in \mathbb{Z} / 8 \mathbb{Z}} e(a\, n^2 / 8) + O(1) \]`

But $n^2$ is congruent to $0 \bmod{8}$ a quarter of the time, $4 \bmod{8}$ a quarter of the time and $1 \bmod{8}$ half the time, so:

`\[ f(a/8) = N \left(\frac{1}{4} + \frac{1}{4} e(a/2) + \frac{1}{2} e(a/8) \right) + O(1) = \frac{N}{2} e(a/8) + O(1) \]`

(recalling $a$ was odd). That's going to be pretty large (absolute value about $N/2$). The reason is essentially that $f(a/8)$ is detecting a huge bias in the squares, namely that many more than average are $1 \bmod 8$.

The same's going to happen for other denominators: only about half of all residues modulo $q$ get to be squares (for $q$ a prime power), and this bias causes large values of $f(a/q)$.

Another way of saying exactly the same is that $(n^2 / 8) \pmod{1}$ has a very non-uniform distribution, with a lot of the mass bunched at $1/8$.

This brings us to (2). The question is: might the squares have similar bias "`$(\bmod{\sqrt{2}})$`"? I have no idea where such a bias might plausibly come from, and fortunately in any case the answer is no. That is, if you were to draw the set:

```\[
 \left\{ n^2 / \sqrt{2} \pmod{1}\,:\, n \in \{1 \dots N\} \right\}
\]```

as a subset of $[0, 1)$, you'd find they were smeared out all over the place. More formally, the proportion of these points contained in any interval $[a, b]$ is roughly $(b-a)$, and we say the set is equidistributed modulo 1. As $N$ becomes large, this equidistribution becomes quantitatively better.

Now, by Weyl's Equidistribution Criterion (many good references on the web), my previous statement is essentially equivalent to $f(a / b \sqrt{2})$ being small, whenever $a, b \in \mathbb{Z}$ are smallish. (Intuitively, you get a lot of cancellation in the definition of $f$.) In practice, it's usual to do the converse to this, i.e. deduce equidistribution from bounds on $f(a / b \sqrt{2})$; but I think equidistribution shows more intuitively what is going on in the minor arc bounds.

How do you prove it? Well, there's some work to be done at some point. Proving Weyl's Inequality gives quite a general bound of this form. Another (essentially equivalent) statement is Van der Corput's lemma (see e.g. the first half of Terry Tao's post on this):

If $a_n$ is a real sequence such that $(a_{n+h} - a_n)$ equidistributes $\bmod{1}$ for every non-zero $h \in \mathbb{Z}$, then $a_n$ equidistributes $\bmod{1}$.

In our case, $((n + h)^2 - n^2) / \sqrt{2} = (2 h n + h^2) / \sqrt{2}$ is reasonably easily shown to equidistribute $\bmod{1}$, for fixed $h$.

Hope some of that helps.

-

That explains a lot; it tells me that it boils down to the distribution of the $k$-th powers modulo $q$.  Thanks for your help. – Tomos Parry Jan 27 at 12:30
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 61, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9495634436607361, "perplexity_flag": "head"}