Profinite detection of free products and free factors
Abstract
Let G be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that G is cohomologically good if G is residually finite. If G is LERF, we prove that G splits non-trivially as a free product if and only if its profinite completion G splits non-trivially as a free profinite product. Moreover, we are able to detect one-ended free factors of G from G. As an application, we deduce that any profinitely rigid word in a finitely generated free group is universally profinitely rigid.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.