Is the Centralizer of an Element in a Free Group Nontrivial?

  • Thread starter Thread starter Bashyboy
  • Start date Start date
  • Tags Tags
    Group
Click For Summary
SUMMARY

The discussion centers on the properties of the centralizer of an element in a free group, specifically whether it is nontrivial. The participants confirm that the centralizer of a nonidentity element \( h \) in the free group \( F_n \) is indeed an infinite cyclic subgroup, generated by powers of \( h \). This implies that the centralizer \( C_{F_n}(h) \) is abelian, as it is a free group on one generator. The conclusion is that the centralizer is nontrivial for any nonidentity element in a free group.

PREREQUISITES
  • Understanding of free groups and their properties
  • Familiarity with group theory concepts such as centralizers and subgroups
  • Knowledge of cyclic groups and their characteristics
  • Basic mathematical proof techniques
NEXT STEPS
  • Study the structure of free groups and their subgroups
  • Learn about the properties of centralizers in group theory
  • Investigate the implications of infinite cyclic groups in algebra
  • Explore advanced topics in group theory, such as the classification of free groups
USEFUL FOR

Mathematicians, particularly those focused on algebra and group theory, as well as students studying abstract algebra who wish to deepen their understanding of free groups and centralizers.

Bashyboy
Messages
1,419
Reaction score
5

Homework Statement


Note: I did not get this problem from a textbook.

Let
png.png
denote the (nonabelian) free group on the
png.png
generators
png.latex?u_1,...png
, and let
png.png
be arbitrary. My question is, does there exist a
png.png
such that
png.png
, besides
png.png
(the identity); is such an equation in the free group possible? Obviously this equation would imply they commutate, but that won't necessarily be a contradiction. It appears that I am effectively asking whether the centralizer of a given element in
png.png
is nontrivial. I can't determine the answer to this question; perhaps someone would be so kind as to guide me towards it

Homework Equations

The Attempt at a Solution

 
Physics news on Phys.org
There are infinitely many other elements being ##h^k## for any integer ##k##, as ##h^{k}(h)h^{-k}=h##.
 
Last edited:
Further I am fairly confident I can prove that the set of elements that commute with ##h## is:

$$\{g^k\ :\ g\in G\wedge k\in\mathbb Z\wedge \exists m\in\mathbb N(h=g^m)\}$$
That is, powers of any element of which ##h## is a power.

But I shan't bother to write an indication of how the proof would go unless evidence appears against the fact that this thread seems to have been abandoned by the OP (or unless somebody else shows interest).
 
Last edited:
In other words, you claim that the centralizer of ##h## is ##\{g^k\ :\ g \in G,~ k \in \mathbb{Z},~\exists m \in \mathbb{N} (h=g^m)\}##?

I have another question, which seems to be related to your second post, andrewkirk. According to what I have been reading, the centralizer of a nonidentity ##h## in the free group is an infinite cyclic, i.e., a subgroup generated by one element; and evidently all subgroups of the free group are themselves free groups (wiki). Would that not make the centralizer ##C_{F_n}(h)## a free group on one generator, and therefore an abelian group, as the free group on one generator is always abelian? If so, that is rather interesting that ##C_{F_n}(h)## is always an abelian subgroup for all nonidentity ##h \in F_n##.
 
Last edited:
Bashyboy said:
Would that not make the centralizer ##C_{F_n}(h)## a free group on one generator, and therefore an abelian group, as the free group on one generator is always abelian?
Yes, it would make the centraliser a free group on one generator.
 
Bashyboy said:
and evidently all subgroups of the free group are themselves free groups (wiki).

This is not evident at all! It's a pretty deep result.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K