[Math] Are there Groups of Strictly Primes

algebraic-number-theorygroup-theoryprime numbersreference-request

Motivation

Since Euclid's proof of the infinitude of the primes, the structure and properties of primes has always fascinated mathematicians. This lead to great work in their properties and distribution, such as the Prime Number Theorem. However, much of the study of the structure of primes is done via Analytic Number Theory where much of the work is done using the tools of Analysis.

I am aware of Algebraic Number Theory (it is my goal to have this be my field of expertise so forgive me if perhaps this question comes from my ignorance), but I have not seen groups comprised strictly of primes. Rather, one sees the structure of primes$-$or even number fields in general rather$-$studied through use of Algebraic Geometry, algebraic number fields, Iwasawa Theory, group cohomologies, et cetera.

However, these employ notions far "broader" such as fields (larger special rings that add more structure than just the notion of a group). One doesn't see a group consisting strictly of prime numbers.

My Attempts

For example, in my research into absolute primes (also known as permutation primes), cyclic primes, and palindromic primes, often I am forced to long calculations with big $O$'s and large scale modular arithmetic (some of the more basic tools of Analytic Number Theory). It would be nice to form a group out of these primes and work with them from a group perspective instead. For those that don't know, absolute primes are primes whose digit permutations are also prime and cyclic primes are those whose cyclic permutations of digits remain prime. Even with this added structure of permutations acting on primes, I have never been able to find an operation on the set of such primes that creates a group$-$nevertheless a ring (in any nontrivial way that focuses on the primes at hand and does not end up reflecting more the structure of $\mathbb{Q}$, $\mathbb{Z}$, or $\mathbb{R}$).

When I took a step back and tried to make a group out of the primes in general, any structure I attempted to create failed either with closure under the operation or under inverses. Consulting the literature has yielded nothing. For example, attempting to create a group of primes under ordinary multiplication lacks closure. Moreover, would would inverses look like? Then adding "primes" of the of the form $\frac{1}{p}$ really doesn't give one anything useful. Switching or even adding ordinary addition creates $\mathbb{Q}$ which of course is nothing new. Obviously, I have found people studying primes using groups, rings, and fields. However, the groups, rings, or fields they employ do not consist "primarily" of primes. Using such objects seems like a great way to approach primes.

As Alexey Sosinsky put it,

"The notion of a "group", viewed only 30 years ago as the epitome of sophistication, is today one of the mathematical concepts most widely used in physics, chemistry, biochemistry, and mathematics itself."

Question

To avoid an unanswerable question or one that would require years of research, my question is this: are there examples of groups consisting of only primes in the literature?

This could mean a set $G=\{p \mid p \text{ prime}\}$ under some natural operation or a natural operation on a set like this $G=\{\frac{1}{p}\mid p \text{ prime}\}$. Examples of rings or fields out of "mostly" primes would also be great. To clear up the possible lack of rigor of "mostly primes", say the group, ring, or field must have only finitely many elements that are not of prime form. Meaning they are primes, something of the form $\frac{1}{p}$ where $p$ is prime along with the ordinary primes, et cetera. (basically, they "look" like a prime in some form as in the sets $G$ above). If you can produce such an example in the literature, please be explicit in its construction or provide a citation. Thank you.

EDIT: As suggested by the comments and Marie, the group operation should arrive naturally and certainly nontrivially.

Best Answer

As written your question seems to be underdetermined: you want a group law on the set $\mathcal{P}$ of prime numbers. As has already been pointed out, no problem: every nonempty set admits a group law, and for a countably infinite set this is especially easy to do (and does not require the Axiom of Choice): simply choose a bijection to your favorite countably infinite group and transport the group law using this bijection. Thus you can make a group with underlying set $\mathcal{P}$ which is: cyclic, finitely generated abelian but not cyclic, infinitely generated abelian, nilpotent of any desired nilpotency class, solvable but not nilpotent of any desired solvability class, simple,...If I am not mistaken the set of nonisomorphic group laws on $\mathcal{P}$ has the cardinality of the continuum.

However the first paragraph does not take into account that the elements of the countably infinite set are prime numbers in any way: any countably infinite set would work as well. You acknowledge that you want more than this, namely a natural group law on $\mathcal{P}$. But what do you mean by this? You don't say, so your question cannot really be answered in its current form.

There is a natural algebraic structure on $\mathcal{P}$, but it is not a group law. Rather, the natural structure is that $\mathcal{P}$ forms a basis for the commutative monoid $(\mathbb{Z}^+,\cdot)$ of positive integers under multiplication. This is precisely a restatement in more algebraic language of the uniqueness of prime factorization, and it has as a consequence that the monoid $(\mathbb{Z}^+,\cdot)$ is isomorphic to a free commutative monoid of countably infinite rank, namely $\bigoplus_{i=1}^{\infty} (\mathbb{N},+)$. (These considerations are worked out in more detail in the exercise G1) from the first problem set of an under/graduate number theory course I taught at UGA in 2007 and 2009: see here.)

In summary, the whole point of the prime numbers is that they are not closed under their natural operation. Your question is a bit like asking for a way of combining two chemical elements to get a third chemical element. Such operations can be defined, but are in a clear chemical sense unnatural: rather we combine elements to get compounds. That's the point of elements.

There are however natural group laws on quotient sets of the primes, especially if we generalize $\mathcal{P}$ to the set of prime ideals in a Dedekind ring $R$. Namely, let $\mathcal{I}(R)$ be the monoid of all nonzero ideals of $R$, and let $\operatorname{Cl} R$ be the ideal class group of $R$. Then we have natural maps

$\mathcal{P} \stackrel{\iota}{\rightarrow} \mathcal{I}(R) \stackrel{q}{\rightarrow} \operatorname{Cl} R$.

Now once again the map $\iota$ is an injection which realizes $\mathcal{P}$ as a basis for the free commutative monoid $\mathcal{I}(R)$: this is the natural algebraic structure on the primes! The map $q$ is a surjective monoid homomorphism. Denote by $\Phi$ the composite map $\mathfrak{p} \mapsto [\mathfrak{p}]$ which sends a prime ideal to its ideal class. Since $\mathcal{P}$ is a set of generators for $\mathcal{I}(R)$ and $q$ is surjective, $\Phi(\mathcal{P})$ is certainly a set of generators for $\operatorname{Cl} R$ (which is a group, but we get a set of generators even as a monoid -- i.e., without having to take inverses). One can ask whether or not $\Phi$ is actually surjective -- i.e., when every ideal class can be represented by a prime ideal. In this paper of mine I call $R$ replete when $\Phi$ is surjective. When this holds, the class group $\operatorname{Cl} R$ is a group formed out of the images of the prime numbers. Moreover, we can define something which is "almost" a group law on $\mathcal{P}$: we try to define $\mathfrak{p}_1 \cdot \mathfrak{p}_2 = \mathfrak{p_3}$ if $[\mathfrak{p_1}][\mathfrak{p_2}] = [\mathfrak{p_3}]$, but it doesn't quite work: $\mathfrak{p}_3$ is not well-defined but only its ideal class: i.e., if $\mathfrak{p}_4$ is another prime ideal such that there are $\alpha,\beta \in R \setminus \{0\}$ with $\alpha \mathfrak{p}_3 = \beta \mathfrak{p}_4$, then also $\mathfrak{p}_1 \cdot \mathfrak{p}_2 = \mathfrak{p}_4$. So it is a group law on the quotient of $\mathcal{P}$ by the equivalence relation of equality up to a principal ideal: it is still natural and important in the study of $R$ and $\operatorname{Cl} R$. When $R$ is not replete, the relationship between $\mathcal{P}$ and $\operatorname{Cl} R$ is more complicated.

When is $R$ replete? When $R = \mathbb{Z}_K$ is the ring of integers of a number field, then the repleteness of $R$ is a weak form of the Chebotarev Density Theorem (applied to the Hilbert class field of $K$), which says moreover that the fibers of the map $\Phi$ all have the same density. In my paper I observe that when $k$ is a field, $E_{/k}$ is an elliptic curve, and $k[E^{\circ}]$ is the coordinate ring of the affine curve $E^{\circ} = E \setminus \{O\}$, then $k[E^{\circ}]$ is (a Dedekind domain, as is well known) and is at least very close to being replete: it satisfies a condition that I called weakly replete which is good enough for the applications. But when is $k[E^{\circ}]$ actually replete? I give only partial information about this in Theorem 14 of my paper:

$\bullet$ If $k$ is alebraically closed, $k[E^{\circ}]$ is not replete.
$\bullet$ If $k$ does not have characteristic $2$ and $k[E^{\circ}]$ is not replete, then let $y^2 = P_3(x)$ be a Weierstrass equation for $E$. Then the $x$--coordinate map $E^{\circ}(k) \rightarrow k$ is surjective.

I don't say so in the paper, but the second part implies that $k[E^{\circ}]$ is replete whenever $k$ is a Hilbertian field of characteristic different from $2$: in particular when $k$ is a number field. And now that I look back on it, the characteristic not equal to $2$ hypothesis just looks like a bit of laziness on my part.

This discussion was a bit technical, but since you say you are interested in number fields and elliptic curves I thought you might be interested. In fact, giving a precise necessary and sufficient condition on $E$ and $k$ that makes $k[E^{\circ}]$ replete remains an open question. I am pretty sure that no one is working on this..

Related Question