arXiv Analytics

Sign in

arXiv:1811.00913 [math.GR]AbstractReferencesReviewsResources

An improved proof of the Almost Stability Theorem

Warren Dicks

Published 2018-11-02Version 1

In 1989, Dicks and Dunwoody proved the Almost Stability Theorem, which has among its corollaries the Stallings-Swan theorem that groups of cohomological dimension one are free. In this article, we use a nestedness result of Bergman, Bowditch, and Dunwoody to simplify somewhat the proof of the finitely generable case of the Almost Stability Theorem. We also simplify the proof of the non finitely generable case. The proof we give here of the Almost Stability Theorem is essentially self contained, except that in the non finitely generable case we refer the reader to the original argument for the proofs of two technical lemmas about groups acting on trees.

Comments: 31 pages, 0 figures, dedicated to Martin Dunwoody on the occasion of his 80th birthday
Categories: math.GR
Subjects: 20E08
Related articles: Most relevant | Search more
arXiv:math/0510151 [math.GR] (Published 2005-10-07, updated 2006-09-19)
Retracts of vertex sets of trees and the almost stability theorem
arXiv:1409.6872 [math.GR] (Published 2014-09-24)
Almost Invariant Sets
arXiv:2205.04375 [math.GR] (Published 2022-05-09)
The Kropholler Conjecture