Documentation

Mathlib.GroupTheory.FreeGroup.Center

Center and centralizers of free groups #

This file develops the theory of commuting elements in a free group.

Main statements #

Implementation #

We show that, in a free group with at least two generators a and b, the center is trivial, by showing directly in FreeGroup.centralizer_of that the elements that commute with a are exactly its powers. It follows that the center of a free group is either everything (in the cyclic case) or reduced to the identity. We deduce that the centralizer of a nontrivial element v is cyclic: centralizer {v} is a free group which has a nontrivial center (as it contains v), so it is cyclic.

theorem FreeGroup.mem_zpowers_of_iff {α : Type u_1} [DecidableEq α] {a : α} {x : FreeGroup α} :
x ∈ Subgroup.zpowers (of a) ↔ ∀ p ∈ x.toWord, p.1 = a
theorem FreeAddGroup.mem_zmultiples_of_iff {α : Type u_1} [DecidableEq α] {a : α} {x : FreeAddGroup α} :
x ∈ AddSubgroup.zmultiples (of a) ↔ ∀ p ∈ x.toWord, p.1 = a
theorem FreeGroup.commute_of_iff {α : Type u_1} {a : α} {x : FreeGroup α} :
theorem IsFreeGroup.commute_trans {G : Type u_1} [Group G] [IsFreeGroup G] {a b c : G} (h₁ : Commute a b) (h₂ : Commute b c) (hb : b ≠ 1) :

Free groups are commutative-transitive.

theorem IsFreeAddGroup.addCommute_trans {G : Type u_1} [AddGroup G] [IsFreeAddGroup G] {a b c : G} (h₁ : AddCommute a b) (h₂ : AddCommute b c) (hb : b ≠ 0) :

Free additive groups are commutative-transitive.

theorem IsFreeGroup.commute_iff_exists_zpow {G : Type u_1} [Group G] [IsFreeGroup G] {a b : G} :
Commute a b ↔ ∃ (c : G) (n : ℤ) (m : ℤ), a = c ^ n ∧ b = c ^ m
theorem IsFreeAddGroup.addCommute_iff_exists_zsmul {G : Type u_1} [AddGroup G] [IsFreeAddGroup G] {a b : G} :
AddCommute a b ↔ ∃ (c : G) (n : ℤ) (m : ℤ), a = n • c ∧ b = m • c