You are currently browsing the monthly archive for mars 2016.

Many properties of the set of the primes are inherited by any dense subset thereof, such as the existence of solutions to various linear equations. But there’s one property, recently proved, namely the existence of infinitely many gaps bounded by a constant, which is not inherited by dense subsets of the primes. For instance, it is possible to remove basically one half of the primes and be left with a subset of primes such that .

So instead one could ask if when coloring the primes in finitely many colours, one is guaranteed to find a colour class containing infinitely many pairs of primes whose difference is bounded by a common constant. This does not follow immediately from pigeonhole principle, which only says that one colour class contains infinitely many primes.

However, this follows easily if we recall that the work of Maynard does not only give infinitely many bounded gaps, that is , but also for any that . Let be this liminf.

In other words there are infinitely many (disjoint) intervals of size which contains at least primes. So if you colour the primes in colours, and you consider these intervals, you find that each one must contains at least two primes of the same colour. By pigeonhole principle again, there must be a colour for which this occurs infinitely often. Whence the existence in this colour class of infinitely gaps of size at most .

The squarefree numbers form a set which is well-known to have density in the integers, in other words their characteristic function satisfy . In this set all your dream theorems about the count of linear patterns are true and easy.

**Hardy-Littlewood squarefree tuples**

The Hardy-Littlewood conjecture consists, in its strongest form, in an asymptotic, for every , of the form

where is a constant possibly equal to 0. It is quite far from being proven, although interesting steps towards it have been made in the last ten years, by Goldston-Pintz-Yildirim and Maynard.

In the squarefree numbers, the analogous problem is rather easy and was settled by Mirsky in 1947. He proved that

where

and is the cardinality of the size of the projection of the set in , that is the number of forbidden classes modulo for .

I show a quick way of deriving it with a much worse error term . Fix , a large number; ultimately, should be ok. Fix . Then the number of such that none of have a square factor with is easy to compute: in or any interval of length there are by chinese remainder theorem this many of them

Thus in , there are this many of them

There are also people who are not squarefree, but escape our sieving by primes less than . These are the guys such that at least one of the have a divisor with prime. Now there are are at most multiples of in . So at most

should be removed. Let’s try to balance the error terms and ; take .

This way both seem to be .

**Green-Tao type theorem**

We can also easily get asymptotics of the form

where is a convex body and a system of affine-linear forms of which no two are affinely related. Moreover is again the proportion of non-forbidden vectors of residues modulo . One way to do it would be to simply use the Hardy-Littlewood type asymptotics proved above coordinate by coordinate. We can also prove it quite easily, by first observing that the set of n where at least one of the vanishes has size because the 0-set of an affine-linear form is an affine hyperplane. Then as , the divisors will have to satisfy . So now we restrict the set of to the ones where the forms don’t vanish. Then we partition the sum into one where is restricted to be at most (we fix some small ), and the remaining one. Using the well-known fact that , we remark that the remaining one equals

Now the number of in the sum is . Given that , we can bound this sum by . We proceed similarly for , so that the sum to estimate is

Quite gross volume packing arguments indicate that the number of integral points (lattice points) to estimate above is , where

is the density of zeroes modulo the . Moreover we can extend the sum beyond at the cost of a mere . Hence finally for any we can write that

Indeed by multiplicativity it is easy to transform into a product over primes.

## Commentaires récents