Grigorchuk group

This article is about a particular group, i.e., a group unique upto isomorphism. View specific information (such as linear representation theory, subgroup structure) about this group
View a complete list of particular groups (this is a very huge list!)[SHOW MORE]

VIEW FACTS ABOUT THIS GROUP: All factsGroup property satisfactionsSubgroup property satisfactionsGroup property dissatisfactionsSubgroup property satisfactions
VIEW DEFINITIONS USING THIS AS EXAMPLE: All terms |Group properties |Subgroup properties|
VIEW FACTS USING THIS AS EXAMPLE: All facts |Group property non-implications |Subgroup property non-implications |Group metaproperty dissatisfactionsSubgroup metaproperty dissatisfactions

Definition

As a subgroup of the automorphism group of the infinite rooted binary tree

PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]

One of the people editing this page intended to fill in this information at a later stage, but hasn't gotten around to doing it yet. If you see this placeholder for a long time, file an error report at the error reporting page.

Arithmetic functions

Function	Value	Similar groups	Explanation
order	infinite
exponent	infinite		although every element has finite order (and in fact all orders are powers of 2) there is no common bound on the orders of all elements.
minimum size of generating set	2
underlying prime of p-group	2

Group properties

Property	Satisfied?	Explanation	Comment
abelian group	No
nilpotent group	No
solvable group	No
2-generated group	Yes
finitely generated group	Yes	follows from being 2-generated.
residually finite group	Yes
Hopfian group	Yes	finitely generated and residually finite implies Hopfian
finitely presented group	No	Grigorchuk group is not finitely presented
group with solvable word problem	Yes
group with solvable conjugacy problem	Yes
LERF group (also called subgroup-separable group)	Yes
p-group	Yes	Here, $p = 2$, i.e., the group is a 2-group
periodic group	Yes	Follows from being a 2-group, order of every element is a finite power of 2