Detecting large groups

Marc Lackenby

Abstract

In geometric group theory, a finitely presented group $G$ is termed "large" if it contains a normal subgroup of finite index that admits a non-abelian free quotient. This property is a hallmark of complexity, yet detecting it remains a significant challenge. This paper introduces a suite of new methods for identifying large and $p$-large groups by bridging algebraic invariants with profinite completions, $L^2$-Betti numbers, and the theory of error-correcting codes. The results demonstrate that largeness is a fundamental property detectable through the growth of homology and the group's approximation by finite quotients.

Introduction

Large groups are the "heavyweights" of group theory. Their existence implies super-exponential subgroup growth and an infinite virtual first Betti number, meaning the group possesses a high degree of topological and algebraic "holes." Despite their importance, determining whether a specific group is large is notoriously difficult. Marc Lackenby’s research addresses this by providing a unified set of criteria that link the internal structure of a group to its external approximations and analytic properties.

Largeness as a Profinite Property

A central contribution of this work is the proof that largeness is a profinite property. Theorem 1.1 and 1.2 establish that if two finitely presented groups, $G_1$ and $G_2$, have isomorphic profinite (or pro-$p$) completions, then $G_1$ is large (or $p$-large) if and only if $G_2$ is. This implies that the "largeness" of a group is entirely encoded within the collection of its finite quotients. This result settles questions regarding the stability of largeness under algebraic approximations and provides a new lens through which to view the classification of groups.

Analytic and Topological Detection

The paper further connects largeness to analytic invariants, specifically $L^2$-Betti numbers. Drawing on the foundational work of Lück and Shalom, Lackenby proves in Theorem 1.6 that a finitely presented group which is virtually residually $p$-finite and possesses a positive first $L^2$-Betti number ($b_1^{(2)}(G) > 0$) must be large.

Topologically, the paper investigates the homology of cyclic covers and 2-complexes. By analyzing how the dimension of the first homology group grows as one takes increasingly larger covers, the author establishes a "rapid descent" criterion. Theorems 1.14 and 1.15 show that a group is large if it possesses an abelian $p$-series where the internal structure descends at a rate comparable to that of a free group. This provides researchers with a concrete numerical target to prove largeness in specific examples.

The Coding Theory Connection

One of the more innovative aspects of the paper is the application of the Plotkin bound from error-correcting code theory. Lackenby treats 1-cocycles on 2-complexes as codewords. By applying the Plotkin bound, he can bound the relative size of these cocycles, creating a geometric constraint that forces the existence of free quotients. This bridge between discrete mathematics and group theory offers a novel way to analyze the "density" of group representations and their eventual collapse onto free non-abelian structures.

Implications and Future Work

The methods presented have immediate applications to specific classes of groups. For instance, Corollary 1.4 settles a long-standing question by showing that any finitely presented parafree group is either large or infinite cyclic.

However, the author notes certain limitations: many of the theorems require the group to be virtually residually $p$-finite. While this covers a vast array of interesting groups, it is not universal. Looking forward, Lackenby suggests that these cocycle methods could be instrumental in tackling the Lubotzky-Sarnak Conjecture, which concerns the property ($\tau$) of fundamental groups of finite-volume hyperbolic 3-manifolds. Future research is expected to further explore the interplay between 3-manifold topology, 4-manifolds, and pro-$p$ completions.

Summary updated

Abstract

Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a variety of new methods for detecting whether G is large or p-large. These relate to the group's profinite and pro-p completions, to its first L2-Betti number and to the existence of certain finite index subgroups with 'rapid descent'. The paper draws on new topological and geometric techniques, together with a result on error-correcting codes.
BibTeX
@article{lackenby2010detecting,
  author = {Marc Lackenby},
  title = {{Detecting large groups}},
  journal = {Journal of Algebra},
  year = {2010},
  doi = {10.1016/j.jalgebra.2010.07.012},
}

Loading related content...

Figure