Facts and Theorems
Some properties of free groups follow readily from the definition:
- 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: F(S) → G is an epimorphism, which proves the claim. Equivalently, G is isomorphic to a quotient group of some free group F(S). The kernel of f is a set of relations in the presentation of G. If S can be chosen to be finite here, then G is called finitely generated.
- 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).
- 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.
- A free group of finite rank n > 1 has an exponential growth rate of order 2n − 1.
A few other related results are:
- The Nielsen–Schreier theorem: Any subgroup of a free group is free.
- 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.
- 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 for non-zero m and n.
- The free group in two elements is SQ universal; the above follows as any SQ universal group has subgroups of all countable ranks.
- 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).
- 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.
- The groupoid approach to these results, given in the work by P.J. Higgins below, is kind of extracted from an approach using covering spaces. 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.
- 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.
Read more about this topic: Free Group
Famous quotes containing the words facts and and/or facts:
“Each truth that a writer acquires is a lantern, which he turns full on what facts and thoughts lay already in his mind, and behold, all the mats and rubbish which had littered his garret become precious. Every trivial fact in his private biography becomes an illustration of this new principle, revisits the day, and delights all men by its piquancy and new charm.”
—Ralph Waldo Emerson (18031882)
“How many facts we have fallen through
And still the old façade glimmers there,
A mirage, but permanent. We must first trick the idea”
—John Ashbery (b. 1927)
Related Subjects
Related Phrases
Related Words