HNN extension

In mathematics, the HNN extension is an important construction of combinatorial group theory.

Introduced in a 1949 paper Embedding Theorems for Groups[1] by Graham Higman, Bernhard Neumann, and Hanna Neumann, it embeds a given group G into another group G' , in such a way that two given isomorphic subgroups of G are conjugate (through a given isomorphism) in G' .

Construction

Let G be a group with presentation , and let be an isomorphism between two subgroups of G. Let t be a new symbol not in S, and define

The group is called the HNN extension of G relative to α. The original group G is called the base group for the construction, while the subgroups H and K are the associated subgroups. The new generator t is called the stable letter.

Key properties

Since the presentation for contains all the generators and relations from the presentation for G, there is a natural homomorphism, induced by the identification of generators, which takes G to . Higman, Neumann, and Neumann proved that this morphism is injective, that is, an embedding of G into . A consequence is that two isomorphic subgroups of a given group are always conjugate in some overgroup; the desire to show this was the original motivation for the construction.

Britton's Lemma

A key property of HNN-extensions is a normal form theorem known as Britton's Lemma.[2] Let be as above and let w be the following product in :

Then Britton's Lemma can be stated as follows:

Britton's Lemma. If w = 1 in Gα then

  • either and g0 = 1 in G
  • or and for some i ∈ {1, ..., n−1} one of the following holds:
  1. εi = 1, εi+1 = −1, giH,
  2. εi = −1, εi+1 = 1, giK.

In contrapositive terms, Britton's Lemma takes the following form:

Britton's Lemma (alternate form). If w is such that

  • either and g0 ≠ 1 ∈ G,
  • or and the product w does not contain substrings of the form tht−1, where hH and of the form t−1kt where kK,

then in .

Consequences of Britton's Lemma

Most basic properties of HNN-extensions follow from Britton's Lemma. These consequences include the following facts:

  • The natural homomorphism from G to is injective, so that we can think of as containing G as a subgroup.
  • Every element of finite order in is conjugate to an element of G.
  • Every finite subgroup of is conjugate to a finite subgroup of G.
  • If and then contains a subgroup isomorphic to a free group of rank two.

Applications

In terms of the fundamental group in algebraic topology, the HNN extension is the construction required to understand the fundamental group of a topological space X that has been 'glued back' on itself by a mapping f (see e.g. Surface bundle over the circle). That is, HNN extensions stand in relation of that aspect of the fundamental group, as free products with amalgamation do with respect to the Seifert-van Kampen theorem for gluing spaces X and Y along a connected common subspace. Between the two constructions essentially any geometric gluing can be described, from the point of view of the fundamental group.

HNN-extensions play a key role in Higman's proof of the Higman embedding theorem which states that every finitely generated recursively presented group can be homomorphically embedded in a finitely presented group. Most modern proofs of the Novikov–Boone theorem about the existence of a finitely presented group with algorithmically undecidable word problem also substantially use HNN-extensions.

Both HNN-extensions and amalgamated free products are basic building blocks in the Bass–Serre theory of groups acting on trees.[3]

The idea of HNN extension has been extended to other parts of abstract algebra, including Lie algebra theory.

Generalizations

HNN extensions are elementary examples of fundamental groups of graphs of groups, and as such are of central importance in Bass–Serre theory.

gollark: <@319753218592866315> no.
gollark: The economy is an abstraction over production and consumption of whatever.
gollark: Further exploitation of space cool and good.
gollark: "Zero growth" bad, sustained economic growth necessary.
gollark: Globalisation good, complex global supply chains basically fine?

References

  1. Higman, Graham; Neumann, Bernhard H.; Neumann, Hanna (1949). "Embedding Theorems for Groups" (PDF). Journal of the London Mathematical Society. s1-24 (4): 247–254. doi:10.1112/jlms/s1-24.4.247.
  2. Roger C. Lyndon and Paul E. Schupp. Combinatorial Group Theory. Springer-Verlag, New York, 2001. "Classics in Mathematics" series, reprint of the 1977 edition. ISBN 978-3-540-41158-1; Ch. IV. Free Products and HNN Extensions.
  3. Serre, Jean-Pierre (1980), Trees. Translated from the French by John Stillwell, Berlin-New York: Springer-Verlag, ISBN 3-540-10103-9
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.