The Setting
Up to the four units and , the Gaussian primes are , of norm ; the two conjugate primes and of norm for each rational prime ; and the rational primes , which with their associates and are the Gaussian primes on the coordinate axes.
The Gaussian moat problem asks whether one can walk to infinity on the Gaussian primes with steps of bounded length: whether, for some real number , there is a self-avoiding walk of Gaussian primes with steps at most . For each real , the library defines the graph on the Gaussian primes along whose edges such walks move, and the components of .
The Definition
Definition 1. The set of Gaussian primes is the set of irreducible elements of the ring : (1)✦ For a real number , the Gaussian prime graph is the graph with vertex set in which two Gaussian primes and are adjacent when they are distinct and at distance at most in : (2)✦ The component of a Gaussian prime in is the set of Gaussian primes reachable from along a finite chain of adjacent primes, itself included: (3)✦
What Is Checked
The three definitions are stated over the irreducible elements of and the distance of , for every real number . The library proves that the adjacency (2) is symmetric and joins no prime to itself, which makes a simple graph.