In the mathematical subject of
group theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups.
The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ...
, a one-relator group is a group given by a
group presentation
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 ...
with a single defining relation. One-relator groups play an important role in
geometric group theory
Geometric group theory is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such group (mathematics), groups and topology, topological and geometry, geometric pro ...
by providing many explicit examples of finitely presented groups.
Formal definition
A one-relator group is a group ''G'' that admits a group presentation of the form
where ''X'' is a set (in general possibly infinite), and where
is a freely and cyclically reduced word.
If ''Y'' is the set of all letters
that appear in ''r'' and
then
:
For that reason ''X'' in () is usually assumed to be finite where one-relator groups are discussed, in which case () can be rewritten more explicitly as
where
for some integer
Freiheitssatz
Let ''G'' be a one-relator group given by presentation () above. Recall that ''r'' is a freely and cyclically reduced word in ''F''(''X''). Let
be a letter such that
or
appears in ''r''. Let
. The subgroup
is called a Magnus subgroup of ''G''.
A famous 1930 theorem of
Wilhelm Magnus
Hans Heinrich Wilhelm Magnus known as Wilhelm Magnus (February 5, 1907 in Berlin, Germany – October 15, 1990 in New Rochelle, New York) was a German-American mathematician. He made important contributions in combinatorial group theory, Lie algebr ...
, known as
Freiheitssatz, states that in this situation ''H'' is
freely generated by , that is,
. See also for other proofs.
Properties of one-relator groups
Here we assume that a one-relator group ''G'' is given by presentation () with a finite generating set
and a nontrivial freely and cyclically reduced defining relation
.
*A one-relator group ''G'' is
torsion-free if and only if
is not a proper power.
* Every one-relator group ''G'' is
virtually
In mathematics, especially in the area of abstract algebra that studies infinite groups, the adverb virtually is used to modify a property so that it need only hold for a subgroup of finite index. Given a property P, the group ''G'' is said to b ...
torsion-free, that is, admits a torsion-free
subgroup of finite index.
*A one-relator presentation is diagrammatically aspherical.
*If
is not a proper power then the
presentation complex In geometric group theory, a presentation complex is a 2-dimensional cell complex associated to any presentation of a group, presentation of a group (mathematics), group ''G''. The complex has a single vertex, and one loop at the vertex for each ge ...
''P'' for presentation () is a finite
Eilenberg–MacLane complex .
*If
is not a proper power then a one-relator group ''G'' has
cohomological dimension In abstract algebra, cohomological dimension is an invariant of a group which measures the homological complexity of its representations. It has important applications in geometric group theory, topology, and algebraic number theory.
Cohomological ...
.
* A one-relator group ''G'' is
free
Free may refer to:
Concept
* Freedom, having the ability to do something, without having to obey anyone/anything
* Freethought, a position that beliefs should be formed only on the basis of logic, reason, and empiricism
* Emancipate, to procur ...
if and only if
is a
primitive element; in this case ''G'' is free of rank ''n'' − 1.
*Suppose the element
is of minimal length under the action of
, and suppose that for every
either
or
occurs in ''r''. Then the group ''G'' is
freely indecomposable.
*If
is not a proper power then a one-relator group ''G'' is
locally indicable, that is, every nontrivial finitely generated subgroup of ''G'' admits a
group homomorphism
In mathematics, given two groups, (''G'', ∗) and (''H'', ·), a group homomorphism from (''G'', ∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that
: h(u*v) = h(u) \cdot h(v)
wh ...
onto
.
*Every one-relator group ''G'' has algorithmically decidable
word problem.
[Magnus, Karrass and Solitar, Theorem 4.14, p. 274 ]
*If ''G'' is a one-relator group and
is a Magnus subgroup then the
subgroup membership problem for ''H'' in ''G'' is decidable.
[
* It is unknown if one-relator groups have solvable ]conjugacy problem
In abstract algebra, the conjugacy problem for a group ''G'' with a given presentation is the decision problem of determining, given two words ''x'' and ''y'' in ''G'', whether or not they represent conjugate elements of ''G''. That is, the probl ...
.
* It is unknown if the isomorphism problem is decidable for the class of one-relator groups.
* A one-relator group ''G'' given by presentation () has rank
Rank is the relative position, value, worth, complexity, power, importance, authority, level, etc. of a person or object within a ranking, such as:
Level or position in a hierarchical organization
* Academic rank
* Diplomatic rank
* Hierarchy
* H ...
''n'' (that is, it cannot be generated by fewer than ''n'' elements) unless is a primitive element.
* Let ''G'' be a one-relator group given by presentation (). If then the center
Center or centre may refer to:
Mathematics
*Center (geometry), the middle of an object
* Center (algebra), used in various contexts
** Center (group theory)
** Center (ring theory)
* Graph center, the set of all vertices of minimum eccentricity ...
of ''G'' is trivial, . If and ''G'' is non-abelian with non-trivial center, then the center of ''G'' is infinite cyclic
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary ...
.
* Let where . Let and be the normal closures of ''r'' and ''s'' in ''F''(''X'') accordingly. Then if and only if is conjugate to or in ''F''(''X'').
*There exists a finitely generated one-relator group that is not Hopfian and therefore not residually finite {{unsourced, date=September 2022
In the mathematical field of group theory, a group ''G'' is residually finite or finitely approximable if for every element ''g'' that is not the identity in ''G'' there is a homomorphism ''h'' from ''G'' to a fini ...
, for example the Baumslag–Solitar group
In the mathematical field of group theory, the Baumslag–Solitar groups are examples of two-generator one-relator groups that play an important role in combinatorial group theory and geometric group theory as (counter)examples and test-cases. ...
.
* Let ''G'' be a one-relator group given by presentation (). Then ''G'' satisfies the following version of the Tits alternative In mathematics, the Tits alternative, named for Jacques Tits, is an important theorem about the structure of finitely generated linear groups.
Statement
The theorem, proven by Tits, is stated as follows.
Consequences
A linear group is not am ...
. If ''G'' is torsion-free then every subgroup of ''G'' either contains a free group of rank 2 or is solvable. If ''G'' has nontrivial torsion, then every subgroup of ''G'' either contains a free group of rank 2, or is cyclic
Cycle, cycles, or cyclic may refer to:
Anthropology and social sciences
* Cyclic history, a theory of history
* Cyclical theory, a theory of American political history associated with Arthur Schlesinger, Sr.
* Social cycle, various cycles in soc ...
, or is infinite dihedral.
* Let ''G'' be a one-relator group given by presentation (). Then the normal subgroup admits a free basis of the form for some family of elements .
One-relator groups with torsion
Suppose a one-relator group ''G'' given by presentation () where where and where is not a proper power (and thus ''s'' is also freely and cyclically reduced). Then the following hold:
* The element ''s'' has order
Order, ORDER or Orders may refer to:
* Categorization, the process in which ideas and objects are recognized, differentiated, and understood
* Heterarchy, a system of organization wherein the elements have the potential to be ranked a number of d ...
''m'' in ''G'', and every element of finite order in ''G'' is conjugate to a power of ''s''.
* Every finite subgroup of ''G'' is conjugate to a subgroup of in ''G''. Moreover, the subgroup of ''G'' generated by all torsion elements is a free product of a family of conjugates of in ''G''.[
* ''G'' admits a torsion-free normal subgroup of finite index.][
* Newman's "spelling theorem"] Let be a freely reduced word such that in ''G''. Then ''w'' contains a subword ''v'' such that ''v'' is also a subword of or of length . Since that means that and presentation () of ''G'' is a Dehn presentation.
* ''G'' has virtual cohomological dimension .
* ''G'' is a word-hyperbolic group
In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a ''word hyperbolic group'' or ''Gromov hyperbolic group'', is a finitely generated group equipped with a word metric satisfying certain properties abstra ...
.
* ''G'' has decidable conjugacy problem
In abstract algebra, the conjugacy problem for a group ''G'' with a given presentation is the decision problem of determining, given two words ''x'' and ''y'' in ''G'', whether or not they represent conjugate elements of ''G''. That is, the probl ...
.[
* ''G'' is ]coherent
Coherence, coherency, or coherent may refer to the following:
Physics
* Coherence (physics), an ideal property of waves that enables stationary (i.e. temporally and spatially constant) interference
* Coherence (units of measurement), a deri ...
, that is every finitely generated subgroup of ''G'' is finitely presentable.
* The isomorphism problem is decidable for finitely generated one-relator groups with torsion, by virtue of their hyperbolicity.
* ''G'' is residually finite {{unsourced, date=September 2022
In the mathematical field of group theory, a group ''G'' is residually finite or finitely approximable if for every element ''g'' that is not the identity in ''G'' there is a homomorphism ''h'' from ''G'' to a fini ...
.
Magnus–Moldavansky method
Starting with the work of Magnus in the 1930s, most general results about one-relator groups are proved by induction on the length , ''r'', of the defining relator ''r''.
The presentation below follows Section 6 of Chapter II of Lyndon and Schupp and Section 4.4 of Magnus, Karrass and Solitar for Magnus' original approach and Section 5 of Chapter IV of Lyndon and Schupp for the Moldavansky's HNN-extension version of that approach.
Let ''G'' be a one-relator group given by presentation () with a finite generating set ''X''. Assume also that every generator from ''X'' actually occurs in ''r''.
One can usually assume that (since otherwise ''G'' is cyclic and whatever statement is being proved about ''G'' is usually obvious).
The main case to consider when some generator, say ''t'', from ''X'' occurs in ''r'' with exponent sum 0 on ''t''. Say in this case. For every generator one denotes where . Then ''r'' can be rewritten as a word in these new generators with .
For example, if then .
Let be the alphabet consisting of the portion of given by all with where are the minimum and the maximum subscripts with which occurs in .
Magnus observed that the subgroup is itself a one-relator group with the one-relator presentation . Note that since , one can usually apply the inductive hypothesis to when proving a particular statement about ''G''.
Moreover, if for then is also a one-relator group, where is obtained from by shifting all subscripts by . Then the normal closure of in ''G'' is
:
Magnus' original approach exploited the fact that ''N'' is actually an iterated amalgamated product
In mathematics, specifically group theory, the free product is an operation that takes two groups ''G'' and ''H'' and constructs a new The result contains both ''G'' and ''H'' as subgroups, is generated by the elements of these subgroups, and i ...
of the groups , amalgamated along suitably chosen Magnus free subgroups. His proof of Freiheitssatz and of the solution of the word problem for one-relator groups was based on this approach.
Later Moldavansky simplified the framework and noted that in this case ''G'' itself is an HNN-extension In mathematics, the HNN extension is an important construction of combinatorial group theory.
Introduced in a 1949 paper ''Embedding Theorems for Groups'' by Graham Higman, Bernhard Neumann, and Hanna Neumann, it embeds a given group ''G'' into an ...
of ''L'' with associated subgroups being Magnus free subgroups of ''L''.
If for every generator from its minimum and maximum subscripts in are equal then and the inductive step is usually easy to handle in this case.
Suppose then that some generator from occurs in with at least two distinct subscripts. We put to be the set of all generators from with non-maximal subscripts and we put to be the set of all generators from with non-maximal subscripts. (Hence every generator from and from occurs in with a non-unique subscript.) Then and are free Magnus subgroups of ''L'' and . Moldavansky observed that in this situation
:
is an HNN-extension of ''L''. This fact often allows proving something about ''G'' using the inductive hypothesis about the one-relator group ''L'' via the use of normal form methods and structural algebraic properties for the HNN-extension ''G''.
The general case, both in Magnus' original setting and in Moldavansky's simplification of it, requires treating the situation where no generator from ''X'' occurs with exponent sum 0 in ''r''. Suppose that distinct letters occur in ''r'' with nonzero exponents accordingly. Consider a homomorphism given by and fixing the other generators from ''X''. Then for the exponent sum on ''y'' is equal to 0. The map ''f'' induces a group homomorphism
In mathematics, given two groups, (''G'', ∗) and (''H'', ·), a group homomorphism from (''G'', ∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that
: h(u*v) = h(u) \cdot h(v)
wh ...
that turns out to be an embedding.
The one-relator group ''G can then be treated using Moldavansky's approach. When splits as an HNN-extension of a one-relator group ''L'', the defining relator of ''L'' still turns out to be shorter than ''r'', allowing for inductive arguments to proceed. Magnus' original approach used a similar version of an embedding trick for dealing with this case.
Two-generator one-relator groups
It turns out that many two-generator one-relator groups split as semidirect product
In mathematics, specifically in group theory, the concept of a semidirect product is a generalization of a direct product. There are two closely related concepts of semidirect product:
* an ''inner'' semidirect product is a particular way in w ...
s . This fact was observed by Ken Brown when analyzing the BNS-invariant of one-relator groups using the Magnus-Moldavansky method.
Namely, let ''G'' be a one-relator group given by presentation () with and let be an epimorphism. One can then change a free basis of to a basis such that and rewrite the presentation of ''G'' in this generators as
:
where is a freely and cyclically reduced word.
Since , the exponent sum on ''t'' in ''r'' is equal to 0. Again putting , we can rewrite ''r'' as a word in Let be the minimum and the maximum subscripts of the generators occurring in . Brown showed that is finitely generated if and only if