Free group

Short description: Mathematics concept

Diagram showing the Cayley graph for the free group on two generators. Each vertex represents an element of the free group, and each edge represents multiplication by a or b.

In mathematics, the free group F_S over a given set S consists of all words that can be built from members of S, considering two words to be different unless their equality follows from the group axioms (e.g. st = suu⁻¹t but s ≠ t⁻¹ for s,t,u ∈ S). The members of S are called generators of F_S, and the number of generators is the rank of the free group. An arbitrary group G is called free if it is isomorphic to F_S for some subset S of G, that is, if there is a subset S of G such that every element of G can be written in exactly one way as a product of finitely many elements of S and their inverses (disregarding trivial variations such as st = suu⁻¹t).

A related but different notion is a free abelian group; both notions are particular instances of a free object from universal algebra. As such, free groups are defined by their universal property.

History

Free groups first arose in the study of hyperbolic geometry, as examples of Fuchsian groups (discrete groups acting by isometries on the hyperbolic plane). In an 1882 paper, Walther von Dyck pointed out that these groups have the simplest possible presentations. The algebraic study of free groups was initiated by Jakob Nielsen in 1924, who gave them their name and established many of their basic properties. Max Dehn realized the connection with topology, and obtained the first proof of the full Nielsen–Schreier theorem. Otto Schreier published an algebraic proof of this result in 1927, and Kurt Reidemeister included a comprehensive treatment of free groups in his 1932 book on combinatorial topology. Later on in the 1930s, Wilhelm Magnus discovered the connection between the lower central series of free groups and free Lie algebras.

Examples

The group (Z,+) of integers is free of rank 1; a generating set is S = {1}. The integers are also a free abelian group, although all free groups of rank [math]\displaystyle{ \geq 2 }[/math] are non-abelian. A free group on a two-element set S occurs in the proof of the Banach–Tarski paradox and is described there.

On the other hand, any nontrivial finite group cannot be free, since the elements of a free generating set of a free group have infinite order.

In algebraic topology, the fundamental group of a bouquet of k circles (a set of k loops having only one point in common) is the free group on a set of k elements.

Construction

The free group F_S with free generating set S can be constructed as follows. S is a set of symbols, and we suppose for every s in S there is a corresponding "inverse" symbol, s⁻¹, in a set S⁻¹. Let T = S ∪ S⁻¹, and define a word in S to be any written product of elements of T. That is, a word in S is an element of the monoid generated by T. The empty word is the word with no symbols at all. For example, if S = {a, b, c}, then T = {a, a⁻¹, b, b⁻¹, c, c⁻¹}, and

[math]\displaystyle{ a b^3 c^{-1} c a^{-1} c\, }[/math]

is a word in S.

If an element of S lies immediately next to its inverse, the word may be simplified by omitting the c, c⁻¹ pair:

[math]\displaystyle{ a b^3 c^{-1} c a^{-1} c\;\;\longrightarrow\;\;a b^3 \, a^{-1} c. }[/math]

A word that cannot be simplified further is called reduced.

The free group F_S is defined to be the group of all reduced words in S, with concatenation of words (followed by reduction if necessary) as group operation. The identity is the empty word.

A reduced word is called cyclically reduced if its first and last letter are not inverse to each other. Every word is conjugate to a cyclically reduced word, and a cyclically reduced conjugate of a cyclically reduced word is a cyclic permutation of the letters in the word. For instance b⁻¹abcb is not cyclically reduced, but is conjugate to abc, which is cyclically reduced. The only cyclically reduced conjugates of abc are abc, bca, and cab.

Universal property

The free group F_S is the universal group generated by the set S. This can be formalized by the following universal property: given any function f from S to a group G, there exists a unique homomorphism φ: F_S → G making the following diagram commute (where the unnamed mapping denotes the inclusion from S into F_S):

That is, homomorphisms F_S → G are in one-to-one correspondence with functions S → G. For a non-free group, the presence of relations would restrict the possible images of the generators under a homomorphism.

To see how this relates to the constructive definition, think of the mapping from S to F_S as sending each symbol to a word consisting of that symbol. To construct φ for the given f, first note that φ sends the empty word to the identity of G and it has to agree with f on the elements of S. For the remaining words (consisting of more than one symbol), φ can be uniquely extended, since it is a homomorphism, i.e., φ(ab) = φ(a) φ(b).

The above property characterizes free groups up to isomorphism, and is sometimes used as an alternative definition. It is known as the universal property of free groups, and the generating set S is called a basis for F_S. The basis for a free group is not uniquely determined.

Being characterized by a universal property is the standard feature of free objects in universal algebra. In the language of category theory, the construction of the free group (similar to most constructions of free objects) is a functor from the category of sets to the category of groups. This functor is left adjoint to the forgetful functor from groups to sets.

Facts and theorems

Some properties of free groups follow readily from the definition:

1. Any group G is the homomorphic image of some free group F(S). Let S be a set of generators of G. The natural map φ: F(S) → G is an epimorphism, which proves the claim. Equivalently, G is isomorphic to a quotient group of some free group F(S). If S can be chosen to be finite here, then G is called finitely generated. The kernel Ker(φ) is the set of all relations in the presentation of G; if Ker(φ) can be generated by the conjugates of finitely many elements of F, then G is finitely presented.
2. If S has more than one element, then F(S) is not abelian, and in fact the center of F(S) is trivial (that is, consists only of the identity element).
3. Two free groups F(S) and F(T) are isomorphic if and only if S and T have the same cardinality. This cardinality is called the rank of the free group F. Thus for every cardinal number k, there is, up to isomorphism, exactly one free group of rank k.
4. A free group of finite rank n > 1 has an exponential growth rate of order 2n − 1.

A few other related results are:

1. The Nielsen–Schreier theorem: Every subgroup of a free group is free. Furthermore, if the free group F has rank n and the subgroup H has index e in F, then H is free of rank 1 + e(n–1).
2. A free group of rank k clearly has subgroups of every rank less than k. Less obviously, a (nonabelian!) free group of rank at least 2 has subgroups of all countable ranks.
3. The commutator subgroup of a free group of rank k > 1 has infinite rank; for example for F(a,b), it is freely generated by the commutators [a^m, bⁿ] for non-zero m and n.
4. The free group in two elements is SQ universal; the above follows as any SQ universal group has subgroups of all countable ranks.
5. Any group that acts on a tree, freely and preserving the orientation, is a free group of countable rank (given by 1 plus the Euler characteristic of the quotient graph).
6. The Cayley graph of a free group of finite rank, with respect to a free generating set, is a tree on which the group acts freely, preserving the orientation. As a topological space (a one-dimensional simplicial complex), this Cayley graph Γ(F) is contractible. For a finitely presented group G, the natural homomorphism defined above, φ : F → G, defines a covering map of Cayley graphs φ* : Γ(F) → Γ(G), in fact a universal covering. Hence, the fundamental group of the Cayley graph Γ(G) is isomorphic to the kernel of φ, the normal subgroup of relations among the generators of G. The extreme case is when G = {e}, the trivial group, considered with as many generators as F, all of them trivial; the Cayley graph Γ(G) is a bouquet of circles, and its fundamental group is F itself.
7. Any subgroup of a free group, [math]\displaystyle{ H \subset F }[/math], corresponds to a covering space of the bouquet of circles, namely to the Schreier coset graph of F/H. This can be used to give a topological proof of the Nielsen-Schreier theorem above.
8. The groupoid approach to these results, given in the work by P.J. Higgins below, is related to the use of covering spaces above. It allows more powerful results, for example on Grushko's theorem, and a normal form for the fundamental groupoid of a graph of groups. In this approach there is considerable use of free groupoids on a directed graph.
9. Grushko's theorem has the consequence that if a subset B of a free group F on n elements generates F and has n elements, then B generates F freely.

Free abelian group

Further information: Free abelian group

The free abelian group on a set S is defined via its universal property in the analogous way, with obvious modifications: Consider a pair (F, φ), where F is an abelian group and φ: S → F is a function. F is said to be the free abelian group on S with respect to φ if for any abelian group G and any function ψ: S → G, there exists a unique homomorphism f: F → G such that

f(φ(s)) = ψ(s), for all s in S.

The free abelian group on S can be explicitly identified as the free group F(S) modulo the subgroup generated by its commutators, [F(S), F(S)], i.e. its abelianisation. In other words, the free abelian group on S is the set of words that are distinguished only up to the order of letters. The rank of a free group can therefore also be defined as the rank of its abelianisation as a free abelian group.

Tarski's problems

Around 1945, Alfred Tarski asked whether the free groups on two or more generators have the same first-order theory, and whether this theory is decidable. (Sela 2006) answered the first question by showing that any two nonabelian free groups have the same first-order theory, and (Kharlampovich Myasnikov) answered both questions, showing that this theory is decidable.

A similar unsolved (as of 2011) question in free probability theory asks whether the von Neumann group algebras of any two non-abelian finitely generated free groups are isomorphic.

See also

• Generating set of a group
• Presentation of a group
• Nielsen transformation, a factorization of elements of the automorphism group of a free group
• Normal form for free groups and free product of groups
• Free product

References

• Kharlampovich, Olga; Myasnikov, Alexei (2006). "Elementary theory of free non-abelian groups". Journal of Algebra 302 (2): 451–552. doi:10.1016/j.jalgebra.2006.03.033. 
• W. Magnus, A. Karrass and D. Solitar, "Combinatorial Group Theory", Dover (1976).
• P.J. Higgins, 1971, "Categories and Groupoids", van Nostrand, {New York}. Reprints in Theory and Applications of Categories, 7 (2005) pp 1–195.
• "Diophantine geometry over groups. VI. The elementary theory of a free group.". Geom. Funct. Anal. 16 (3): 707–730. 2006. doi:10.1007/s00039-006-0565-8. 
• Serre, Jean-Pierre, Trees, Springer (2003) (English translation of "arbres, amalgames, SL₂", 3rd edition, astérisque 46 (1983))
• P.J. Higgins, The fundamental groupoid of a graph of groups, Journal of the London Mathematical Society (2) 13 (1976), no. 1, 145–149.
• Aluffi, Paolo (2009). Algebra: Chapter 0. AMS Bookstore. p. 70. ISBN 978-0-8218-4781-7. https://books.google.com/books?id=deWkZWYbyHQC&pg=PA70. .
• Grillet, Pierre Antoine (2007). Abstract algebra. Springer. p. 27. ISBN 978-0-387-71567-4. https://books.google.com/books?id=LJtyhu8-xYwC&pg=PA27. .