Rigid abelian groups and the probabilistic method

Gábor Braun, Sebastian PokuttaContemporary 2012 · DOI · arXiv · OpenAlex

Abstract

The construction of torsion-free abelian groups with prescribed endomorphism rings is a cornerstone of abelian group theory, pioneered by A.L.S. Corner in the 1960s. Traditionally, these constructions involve adding specific elements from a topological completion to "kill" unwanted homomorphisms—a process that is often technically exhaustive. This paper introduces a paradigm shift by applying the probabilistic method to these constructions. We demonstrate that by selecting elements at random from the completion, the desired endomorphism ring is achieved "almost surely" (with probability one). This approach significantly simplifies the realization problem for various classes of groups and rings.

Introduction: The Realization Problem

In the study of infinite abelian groups, the "realization problem" asks whether, for a given ring $R$, there exists a torsion-free abelian group $G$ such that its endomorphism ring, $End(G)$, is isomorphic to $R$. This problem is central to understanding the structural symmetries of groups.

Since Corner’s seminal work in 1963, the standard technique has involved starting with a base group and extending it by adding elements from a $p$-adic completion. The primary challenge lies in the "killing" step: one must prove that the added elements eliminate all endomorphisms except those induced by the target ring $R$. Historically, this required intricate, deterministic proofs to ensure that no "unwanted" homomorphisms survived the extension. Braun and Pokutta argue that such hand-picking is unnecessary; if elements are chosen at random, they will almost certainly perform this function.

The Probabilistic Method in Group Theory

This paper proposes replacing deterministic existence proofs with a probabilistic approach, a technique famously championed by Paul Erdős in combinatorics but less common in infinite algebra. The core idea is to show that the set of "bad" elements—those that fail to kill unwanted homomorphisms—has measure zero. Consequently, a random selection of elements will succeed with probability one.

Algebraic Independence of $p$-adic Integers

The primary tool in this methodology is the algebraic independence of $p$-adic integers. The authors establish that if $p$-adic integers are chosen according to a suitable probability measure, they are almost surely algebraically independent. This independence is the mechanism that allows the random elements to effectively "block" unwanted endomorphisms without the need for the researcher to hand-pick specific, complex values.

Theoretical Framework

The proofs rely on several pillars of probability and measure theory:

  • Borel-Cantelli Lemma & Fubini’s Theorem: These are used to manage sequences of events and iterated expectations, ensuring that properties hold across the entire construction.
  • Chebotarëv Density Theorem: In the context of the Zassenhaus construction (finite rank groups), this theorem ensures that primes with the necessary properties appear with sufficient frequency to satisfy the construction's requirements.
  • Topological Compactness: To handle the continuum ($2^{\aleph_0}$), the authors utilize the topological compactness of $p$-adic integers to approximate uncountable events with countable ones, overcoming a common hurdle in applying probability to large sets.

Key Insights and Results

The research yields several significant advancements in the simplification of group constructions:

  1. Probabilistic Corner Construction (Theorem 3.5): The authors prove that for every countable $p$-reduced torsion-free ring $R$, a group $G$ can be constructed such that $End(G) \cong R$ with probability 1.
  2. Probabilistic Zassenhaus Construction (Theorem 4.4): The paper successfully provides a probabilistic counterpart to the Zassenhaus method for constructing groups of finite rank with a prescribed endomorphism ring.
  3. The Importance of Distribution: A critical finding (Theorem 3.7) is that the choice of probability distribution is non-trivial. The authors show that a "nearly uniform" distribution can actually cause the construction to fail, resulting in a simple free group instead of the prescribed ring. This highlights that the algebraic success is sensitive to the underlying measure.

Limitations and Future Directions

While the probabilistic method offers a powerful simplification, it currently faces limitations regarding the size of the groups. The techniques are effective up to the size of the continuum ($2^{\aleph_0}$), but probability theory currently lacks the tools to address sets of higher cardinality. Additionally, the method does not yet generalize to "locally free" (Butler) groups.

Future research may explore the relationship between these probabilistic results and set theory. There is a possibility that certain probabilistic statements are independent of ZFC (Zermelo-Fraenkel set theory), meaning a theorem might hold with probability 1 in one mathematical universe but not in another. Furthermore, applying randomness to the structure of the construction itself, rather than just the selection of elements, remains an intriguing open frontier.

Conclusion

By shifting the focus from "existence via construction" to "existence via high probability," this work provides a more streamlined and intuitive framework for the realization problem. It demonstrates that in the vast space of $p$-adic completions, the properties required to define rigid abelian groups are not rare exceptions, but the statistical norm.

Summary updated

Abstract

The construction of torsion-free abelian groups with prescribed endomorphism rings starting with Corner’s seminal work (see Corner, 1963) is a well-studied subject in the theory of abelian groups. Usually these construction work by adding elements from a (topological) completion in order to get rid of (kill) unwanted homomorphisms. The critical part is to actually prove that every unwanted homomorphism can be killed by adding a suitable element. We will demonstrate that some of those constructions can be significantly simplified by choosing the elements at random. As a result, the endomorphism ring will be almost surely prescribed, i.e., with probability one.
BibTeX
@inproceedings{braun2012rigid,
  author = {Gábor Braun and Sebastian Pokutta},
  title = {{Rigid abelian groups and the probabilistic method}},
  booktitle = {Contemporary},
  year = {2012},
  doi = {10.1090/conm/576/11342},
}
Figure