Unimodular totally disconnected locally compact groups of rational discrete cohomological dimension one
Ilaria Castellano, Bianca Marchionna, Thomas Weigel
TL;DR
The paper extends the Stallings–Swan paradigm to locally compact, totally disconnected groups by proving that every compactly generated, $\mathcal{CO}$-bounded t.d.l.c. group $G$ with rational discrete cohomological dimension $\mathrm{cd}_{\mathbb{Q}}(G)\leq 1$ is the fundamental group of a finite graph of profinite groups, generalizing Dunwoody’s rational result. Central to the approach is the development of rational discrete cohomology for t.d.l.c. groups, the associated $W^*$-algebras via Hecke pairs, and a trace framework that yields non-positive Euler–Poincaré characteristics for unimodular groups with $\mathrm{cd}_{\mathbb{Q}}(G)=1$. The paper then establishes accessibility results, showing that under $\mathcal{CO}$-boundedness (or compact presentability) and unimodularity, such groups are decomposable as finite graphs of profinite groups, with several equivalent characterizations in terms of Bass–Serre theory and Cayley–Abels graphs. Collectively, these results provide a structural theory for a broad class of t.d.l.c. groups, connecting cohomological, analytic, and combinatorial perspectives and extending classical Stallings–Swan theory to the topological setting.
Abstract
It is shown that a Stallings--Swan theorem holds in a totally disconnected locally compact (= t.d.l.c.) context (cf. Thm. B). More precisely, a compactly generated $\mathcal{CO}$-bounded t.d.l.c. group $G$ of rational discrete cohomological dimension less than or equal to $1$ must be isomorphic to the fundamental group of a finite graph of profinite groups. This result generalises Dunwoody's rational version of the classical Stallings--Swan theorem to t.d.l.c. groups. The proof of Theorem B is based on the fact that a compactly generated unimodular t.d.l.c. group with rational discrete cohomological dimension $1$ has necessarily non-positive Euler--Poincaré characteristic (cf. Thm. H).
