Diamond Theorem for a Finitely Generated Free Profinite Group
نویسنده
چکیده
We extend Haran’s Diamond Theorem to closed subgroups of a finitely generated free profinite group. This gives an affirmative answer to Problem 25.4.9 in [FrJ].
منابع مشابه
Elementary Equivalence and Profinite Completions: a Characterization of Finitely Generated Abelian-by-finite Groups
In this paper, we show that any finitely generated abelian-byfinite group is an elementary submodel of its profinite completion. It follows that two finitely generated abelian-by-finite groups are elementarily equivalent if and only if they have the same finite images. We give an example of two finitely generated abelian-by-finite groups G, H which satisfy these properties while G x Z and H x Z...
متن کاملELEMENTARY EQUIVALENCE OF PROFINITE GROUPS by
There are many examples of non-isomorphic pairs of finitely generated abstract groups that are elementarily equivalent. We show that the situation in the category of profinite groups is different: If two finitely generated profinite groups are elementarily equivalent (as abstract groups), then they are isomorphic. The proof applies a result of Nikolov and Segal which in turn relies on the class...
متن کاملModular Representations of Profinite Groups
Our aim is to transfer several foundational results from the modular representation theory of finite groups to the wider context of profinite groups. We are thus interested in profinite modules over the completed group algebra k[[G]] of a profinite group G, where k is a finite field of characteristic p. We define the concept of relative projectivity for a profinite k[[G]]-module. We prove a cha...
متن کاملElementary Equivalence of Profinite Groups
There are many examples of non-isomorphic pairs of finitely generated abstract groups that are elementarily equivalent. We show that the situation in the category of profinite groups is different: If two finitely generated profinite groups are elementarily equivalent (as abstract groups), then they are isomorphic. The proof applies a result of Nikolov and Segal which in turn relies on the class...
متن کاملRational Codes and Free Profinite Monoids
It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is in fact clopen) is a free profinite monoid generated by that code. In this note we...
متن کامل