The profinite completion of the fundamental group of infinite graphs of groups
Abstract
Let (G,) be an abstract graph of finite groups. If is finite, we can construct a profinite graph of groups in a natural way (G,), where G(m) is the profinite completion of G(m) for all m ∈ . The main reason for this is that is finite, so it is already profinite. In this paper we deal with the infinite case, by constructing a profinite graph where is densely embedded and then defining a profinite graph of groups (G,). We also prove that the fundamental group 1(G,) is the profinite completion of 1abs(G,). This answers Open Question 6.7.1 of the book Profinite Graphs and Groups, published by Luis Ribes in 2017. Later we generalise the main theorem of a paper by Luis Ribes and the second author, proving that if R is a virtually free abstract group and H is a finitely generated subgroup of R, then NR(H)=NR(H) answering Open Question 15.11.10 of the book of Ribes. Finally, we generalise the main theorem of a paper by Sheila Chagas and the second author, showing that every virtually free group is subgroup conjugacy separable. This answers Open Question 15.11.11 of the same book of Ribes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.