Center and centralizers of free groups #
This file develops the theory of commuting elements in a free group.
Main statements #
FreeGroup.center_eq_top_of_subsingletonandFreeGroup.center_eq_bot_of_nontrivial: the center of a free group is⊤or⊥, depending on the number of generators.IsFreeGroup.isCyclic_centralizer: the centralizer of a non-unit element is a cyclic subgroup.IsFreeGroup.commute_iff_exists_zpow: two elements of a free group commute iff they are powers of the same element.
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 FreeAddGroup.mem_zmultiples_of_iff {α : Type u_1} [DecidableEq α] {a : α} {x : FreeAddGroup α} :
theorem IsFreeAddGroup.isAddCyclic_iff_isAddCommutative {G : Type u_1} [AddGroup G] [IsFreeAddGroup G] :
theorem IsFreeGroup.isCyclic_centralizer {G : Type u_1} [Group G] [IsFreeGroup G] {g : G} (ha : g ≠ 1) :
theorem IsFreeAddGroup.isAddCyclic_centralizer {G : Type u_1} [AddGroup G] [IsFreeAddGroup G] {g : G} (ha : g ≠ 0) :
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) :
Commute a c
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) :
AddCommute a c
Free additive groups are commutative-transitive.
theorem IsFreeAddGroup.addCommute_iff_exists_zsmul {G : Type u_1} [AddGroup G] [IsFreeAddGroup G] {a b : G} :