A Gaussian prime is an irreducible element of the ring of Gaussian integers. For a real number , let be the graph whose vertices are all the Gaussian primes, with an edge between distinct primes and whenever . The Gaussian moat problem asks whether some contains an infinite path with no repeated vertex. The Gaussian moat conjecture asserts that no does.
Gethner and Stark trace the question to Basil Gordon at the 1962 International Congress of Mathematicians in Stockholm. Erdős later credited the problem to Gordon and Motzkin. Gethner, Wagon and Wick constructed large disks free of Gaussian primes with centers on any line through two Gaussian integers. They also constructed arbitrarily isolated Gaussian primes on the real axis, crediting Vardi with an independent proof. Tsuchimura obtained by computation a finite bound on the distance reachable from the origin through Gaussian primes in steps of length at most . Gethner and Stark formulated a bound on the length of a walk through distinct Gaussian primes that is uniform in its starting point. They proposed sieving by small Gaussian primes for step bounds larger than . Vardi studied the passage from the absence of an infinite path to a uniform bound on the sizes of the connected components of .
The preprint proves the uniform component bound: for every real there is a finite such that every connected component of has at most vertices, components through primes on the coordinate axes included. Consequently every sequence of distinct Gaussian primes whose successive distances are at most has at most terms. This proves the Gaussian moat conjecture. The bound is not explicit. For a rational prime , let and be its two conjugate Gaussian prime factors, each of norm . For a finite set of such primes, let be the set of Gaussian integers divisible by none of with . The preprint also proves the finite sieve obstruction: for every there is a finite set of rational primes such that contains no infinite sequence of distinct points whose successive distances are at most .
The Lean library GaussianMoat proves the uniform component bound. It also proves the finite sieve obstruction. It takes no result as a hypothesis. Lean has checked every result of the Lean library, so the Lean library is the reference: each result on these pages is the Lean library’s, stated as the Lean library states it and linked to the Lean declaration behind it. Where the preprint states a result differently, the page gives the Lean library’s statement, with the preprint’s beside it. The preprint is a guide only, which gives the results their order and their names. In place of the prime number theorem in arithmetic progressions, on which the preprint draws, the Lean library proves that there are such that for every large at least integers with have at least primes in .
GaussianMoat is a Lean library: 25 items, in eight groups. Each has a page written by OctoInform, listed below.
No item matches.