Britton's lemma
ProvedFamousTheorems.britton_lemmaBritton's lemma. Let be a group, subgroups and an isomorphism, and let be the HNN extension. If a reduced word (one containing no pinch with or with ) represents an element of in , then contains no occurrence of .
Britton's lemma is the normal form theorem for HNN extensions. It gives the embedding of into and solves the word problem there. It is central to the Higman embedding theorem and to the construction of finitely presented groups with unsolvable word problem.
Formalization note. Mathlib's HNNExtension.ReducedWord.toList_eq_nil_of_mem_of_range. A reduced word is an element of HNNExtension.NormalWord.ReducedWord G A B, and its toList is the list of its -letters with the intermediate group elements. The hypothesis says that the product of the word lies in the image of .
import Mathlib
namespace FamousTheorems
theorem britton_lemma {G : Type*} [Group G] {A B : Subgroup G} (φ : A ≃* B) (w : HNNExtension.NormalWord.ReducedWord G A B)
(hw : HNNExtension.NormalWord.ReducedWord.prod φ w ∈ (HNNExtension.of : G →* HNNExtension G A B φ).range) :
w.toList = [] := by sorry
end FamousTheorems