HNN extension

Last updated

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

Contents

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 ofGrelative 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:

Applications and generalizations

Applied to algebraic topology, the HNN extension constructs the fundamental group of a topological space X that has been 'glued back' on itself by a mapping f : X → X (see e.g. Surface bundle over the circle). Thus, HNN extensions describe the fundamental group of a self-glued space in the same way that free products with amalgamation do for two spaces X and Y glued along a connected common subspace, as in the Seifert-van Kampen theorem. These two constructions allow the description of the fundamental group of any reasonable geometric gluing. This is generalized into the Bass–Serre theory of groups acting on trees, constructing fundamental groups of graphs of groups. [3] [4]

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.

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

See also

Related Research Articles

<span class="mw-page-title-main">Group action</span> Transformations induced by a mathematical group

In mathematics, many sets of transformations form a group under function composition; for example, the rotations around a point in the plane. It is often useful to consider the group as an abstract group, and to say that one has a group action of the abstract group that consists of performing the transformations of the group of transformations. The reason for distinguishing the group from the transformations is that, generally, a group of transformations of a structure acts also on various related structures; for example, the above rotation group acts also on triangles by transforming triangles into triangles.

In mathematics, a presentation is one method of specifying a group. A presentation of a group G comprises a set S of generators—so that every element of the group can be written as a product of powers of some of these generators—and a set R of relations among those generators. We then say G has presentation

<span class="mw-page-title-main">Unitary group</span> Group of unitary matrices

In mathematics, the unitary group of degree n, denoted U(n), is the group of n × n unitary matrices, with the group operation of matrix multiplication. The unitary group is a subgroup of the general linear group GL(n, C), and it has as a subgroup the special unitary group, consisting of those unitary matrices with determinant 1.

In mathematics, the adele ring of a global field is a central object of class field theory, a branch of algebraic number theory. It is the restricted product of all the completions of the global field and is an example of a self-dual topological ring.

In mathematics, Dirichlet's unit theorem is a basic result in algebraic number theory due to Peter Gustav Lejeune Dirichlet. It determines the rank of the group of units in the ring OK of algebraic integers of a number field K. The regulator is a positive real number that determines how "dense" the units are.

In mathematics, the fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions in relation to groups. It was proved by Évariste Galois in his development of Galois theory.

In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose sumset is small. It roughly states that if is small, then can be contained in a small generalized arithmetic progression.

In algebraic geometry, a Noetherian scheme is a scheme that admits a finite covering by open affine subsets , where each is a Noetherian ring. More generally, a scheme is locally Noetherian if it is covered by spectra of Noetherian rings. Thus, a scheme is Noetherian if and only if it is locally Noetherian and compact. As with Noetherian rings, the concept is named after Emmy Noether.

In mathematics, in particular in algebraic geometry and differential geometry, Dolbeault cohomology (named after Pierre Dolbeault) is an analog of de Rham cohomology for complex manifolds. Let M be a complex manifold. Then the Dolbeault cohomology groups depend on a pair of integers p and q and are realized as a subquotient of the space of complex differential forms of degree (p,q).

In mathematics, the epsilon numbers are a collection of transfinite numbers whose defining property is that they are fixed points of an exponential map. Consequently, they are not reachable from 0 via a finite series of applications of the chosen exponential map and of "weaker" operations like addition and multiplication. The original epsilon numbers were introduced by Georg Cantor in the context of ordinal arithmetic; they are the ordinal numbers ε that satisfy the equation

In mathematics, Higman's lemma states that the set of finite sequences over a finite alphabet , as partially ordered by the subsequence relation, is well-quasi-ordered. That is, if is an infinite sequence of words over a finite alphabet , then there exist indices such that can be obtained from by deleting some symbols. More generally this remains true when is not necessarily finite, but is itself well-quasi-ordered, and the subsequence relation is generalized into an "embedding" relation that allows the replacement of symbols by earlier symbols in the well-quasi-ordering of . This is a special case of the later Kruskal's tree theorem. It is named after Graham Higman, who published it in 1952.

In mathematics, the Weyl character formula in representation theory describes the characters of irreducible representations of compact Lie groups in terms of their highest weights. It was proved by Hermann Weyl. There is a closely related formula for the character of an irreducible representation of a semisimple Lie algebra. In Weyl's approach to the representation theory of connected compact Lie groups, the proof of the character formula is a key step in proving that every dominant integral element actually arises as the highest weight of some irreducible representation. Important consequences of the character formula are the Weyl dimension formula and the Kostant multiplicity formula.

In differential geometry, the Margulis lemma is a result about discrete subgroups of isometries of a non-positively curved Riemannian manifold. Roughly, it states that within a fixed radius, usually called the Margulis constant, the structure of the orbits of such a group cannot be too complicated. More precisely, within this radius around a point all points in its orbit are in fact in the orbit of a nilpotent subgroup.

In mathematics, in the realm of group theory, a countable group is said to be SQ-universal if every countable group can be embedded in one of its quotient groups. SQ-universality can be thought of as a measure of largeness or complexity of a group.

In mathematics, the spin representations are particular projective representations of the orthogonal or special orthogonal groups in arbitrary dimension and signature. More precisely, they are two equivalent representations of the spin groups, which are double covers of the special orthogonal groups. They are usually studied over the real or complex numbers, but they can be defined over other fields.

Bass–Serre theory is a part of the mathematical subject of group theory that deals with analyzing the algebraic structure of groups acting by automorphisms on simplicial trees. The theory relates group actions on trees with decomposing groups as iterated applications of the operations of free product with amalgamation and HNN extension, via the notion of the fundamental group of a graph of groups. Bass–Serre theory can be regarded as one-dimensional version of the orbifold theory.

In mathematics, the ping-pong lemma, or table-tennis lemma, is any of several mathematical statements that ensure that several elements in a group acting on a set freely generates a free subgroup of that group.

The exponential mechanism is a technique for designing differentially private algorithms. It was developed by Frank McSherry and Kunal Talwar in 2007. Their work was recognized as a co-winner of the 2009 PET Award for Outstanding Research in Privacy Enhancing Technologies.

In graph theory, the hypergraph removal lemma states that when a hypergraph contains few copies of a given sub-hypergraph, then all of the copies can be eliminated by removing a small number of hyperedges. It is a generalization of the graph removal lemma. The special case in which the graph is a tetrahedron is known as the tetrahedron removal lemma. It was first proved by Nagle, Rödl, Schacht and Skokan and, independently, by Gowers.

References

  1. Higman, Graham; Neumann, Bernhard H.; Neumann, Hanna (1949). "Embedding Theorems for Groups". 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
  4. Warren Dicks; M. J. Dunwoody. Groups acting on graphs. p. 14. The fundamental group of graphs of groups can be obtained by successively performing one free product with amalgamation for each edge in the maximal subtree and then one HNN extension for each edge not in the maximal subtree.