In the mathematical subject of group theory, a one-relator group is a group given by a group presentation with a single defining relation. One-relator groups play an important role in geometric group theory by providing many explicit examples of finitely presented groups.
A one-relator group is a group G that admits a group presentation of the form
(1) |
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 ( 1 ) is usually assumed to be finite where one-relator groups are discussed, in which case ( 1 ) can be rewritten more explicitly as
(2) |
where for some integer
Let G be a one-relator group given by presentation ( 1 ) 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, [1] known as Freiheitssatz, states that in this situation H is freely generated by , that is, . See also [2] [3] for other proofs.
Here we assume that a one-relator group G is given by presentation ( 2 ) with a finite generating set and a nontrivial freely and cyclically reduced defining relation .
Suppose a one-relator group G given by presentation ( 2 ) where where and where is not a proper power (and thus s is also freely and cyclically reduced). Then the following hold:
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 [27] and Section 4.4 of Magnus, Karrass and Solitar [28] for Magnus' original approach and Section 5 of Chapter IV of Lyndon and Schupp [29] for the Moldavansky's HNN-extension version of that approach. [30]
Let G be a one-relator group given by presentation ( 1 ) 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 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 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 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.
It turns out that many two-generator one-relator groups split as semidirect products . 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 ( 2 ) 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 [31] that is finitely generated if and only if and both and occur exactly once in , and moreover, in that case the group is free. Therefore if is an epimorphism with a finitely generated kernel, then G splits as where is a finite rank free group.
Later Dunfield and Thurston proved [32] that if a one-relator two-generator group is chosen "at random" (that is, a cyclically reduced word r of length n in is chosen uniformly at random) then the probability that a homomorphism from G onto with a finitely generated kernel exists satisfies
for all sufficiently large n. Moreover, their experimental data indicates that the limiting value for is close to .
In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a finitely generated group is the algorithmic problem of deciding whether two words in the generators represent the same element of . The word problem is a well-known example of an undecidable problem.
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
In abstract algebra, a generating set of a group is a subset of the group set such that every element of the group can be expressed as a combination of finitely many elements of the subset and their inverses.
In mathematics, specifically ring theory, a principal ideal is an ideal in a ring that is generated by a single element of through multiplication by every element of The term also has another, similar meaning in order theory, where it refers to an (order) ideal in a poset generated by a single element which is to say the set of all elements less than or equal to in
In group theory, the quaternion group Q8 (sometimes just denoted by Q) is a non-abelian group of order eight, isomorphic to the eight-element subset of the quaternions under multiplication. It is given by the group presentation
An operator is a function over a space of physical states onto another space of states. The simplest example of the utility of operators is the study of symmetry. Because of this, they are useful tools in classical mechanics. Operators are even more important in quantum mechanics, where they form an intrinsic part of the formulation of the theory.
In mathematics, specifically group theory, the free product is an operation that takes two groups G and H and constructs a new group G ∗ H. The result contains both G and H as subgroups, is generated by the elements of these subgroups, and is the “universal” group having these properties, in the sense that any two homomorphisms from G and H into a group K factor uniquely through a homomorphism from G ∗ H to K. Unless one of the groups G and H is trivial, the free product is always infinite. The construction of a free product is similar in spirit to the construction of a free group.
In mathematics, the order of a finite group is the number of its elements. If a group is not finite, one says that its order is infinite. The order of an element of a group is the order of the subgroup generated by the element. If the group operation is denoted as a multiplication, the order of an element a of a group, is thus the smallest positive integer m such that am = e, where e denotes the identity element of the group, and am denotes the product of m copies of a. If no such m exists, the order of a is infinite.
In mathematics, subgroup growth is a branch of group theory, dealing with quantitative questions about subgroups of a given group.
In mathematics, the Lasker–Noether theorem states that every Noetherian ring is a Lasker ring, which means that every ideal can be decomposed as an intersection, called primary decomposition, of finitely many primary ideals. The theorem was first proven by Emanuel Lasker for the special case of polynomial rings and convergent power series rings, and was proven in its full generality by Emmy Noether.
In mathematics, specifically in group theory, the direct product is an operation that takes two groups G and H and constructs a new group, usually denoted G × H. This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics.
In cryptography, XTR is an algorithm for public-key encryption. XTR stands for 'ECSTR', which is an abbreviation for Efficient and Compact Subgroup Trace Representation. It is a method to represent elements of a subgroup of a multiplicative group of a finite field. To do so, it uses the trace over to represent elements of a subgroup of .
In group theory, a word is any written product of group elements and their inverses. For example, if x, y and z are elements of a group G, then xy, z−1xzz and y−1zxx−1yz−1 are words in the set {x, y, z}. Two different words may evaluate to the same value in G, or even in every group. Words play an important role in the theory of free groups and presentations, and are central objects of study in combinatorial group theory.
In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have "small overlaps" with each other. Small cancellation conditions imply algebraic, geometric and algorithmic properties of the group. Finitely presented groups satisfying sufficiently strong small cancellation conditions are word hyperbolic and have word problem solvable by Dehn's algorithm. Small cancellation methods are also used for constructing Tarski monsters, and for solutions of Burnside's problem.
In the mathematical subject of geometric group theory, the Baumslag–Gersten group, also known as the Baumslag group, is a particular one-relator group exhibiting some remarkable properties regarding its finite quotient groups, its Dehn function and the complexity of its word problem.
In mathematics, specifically group theory, a descendant tree is a hierarchical structure that visualizes parent-descendant relations between isomorphism classes of finite groups of prime power order , for a fixed prime number and varying integer exponents . Such groups are briefly called finitep-groups. The vertices of a descendant tree are isomorphism classes of finite p-groups.
In the mathematical field of group theory, an Artin transfer is a certain homomorphism from an arbitrary finite or infinite group to the commutator quotient group of a subgroup of finite index. Originally, such mappings arose as group theoretic counterparts of class extension homomorphisms of abelian extensions of algebraic number fields by applying Artin's reciprocity maps to ideal class groups and analyzing the resulting homomorphisms between quotients of Galois groups. However, independently of number theoretic applications, a partial order on the kernels and targets of Artin transfers has recently turned out to be compatible with parent-descendant relations between finite p-groups, which can be visualized in descendant trees. Therefore, Artin transfers provide a valuable tool for the classification of finite p-groups and for searching and identifying particular groups in descendant trees by looking for patterns defined by the kernels and targets of Artin transfers. These strategies of pattern recognition are useful in purely group theoretic context, as well as for applications in algebraic number theory concerning Galois groups of higher p-class fields and Hilbert p-class field towers.
In mathematics, the Weil–Brezin map, named after André Weil and Jonathan Brezin, is a unitary transformation that maps a Schwartz function on the real line to a smooth function on the Heisenberg manifold. The Weil–Brezin map gives a geometric interpretation of the Fourier transform, the Plancherel theorem and the Poisson summation formula. The image of Gaussian functions under the Weil–Brezin map are nil-theta functions, which are related to theta functions. The Weil–Brezin map is sometimes referred to as the Zak transform, which is widely applied in the field of physics and signal processing; however, the Weil–Brezin Map is defined via Heisenberg group geometrically, whereas there is no direct geometric or group theoretic interpretation from the Zak transform.
In the mathematical subject of group theory, the Howson property, also known as the finitely generated intersection property (FGIP), is the property of a group saying that the intersection of any two finitely generated subgroups of this group is again finitely generated. The property is named after Albert G. Howson who in a 1954 paper established that free groups have this property.
In the mathematical subject of geometric group theory, an acylindrically hyperbolic group is a group admitting a non-elementary 'acylindrical' isometric action on some geodesic hyperbolic metric space. This notion generalizes the notions of a hyperbolic group and of a relatively hyperbolic group and includes a significantly wider class of examples, such as mapping class groups and Out(Fn).