In this section we introduce the basic theory of so-called free groups. This will enable us to make precise the notions of generators and relations which were used in earlier chapters. The results of this section rely only on the basic theory of homomorphisms.
The basic idea of a free group F(S) generated by a set S is that there are no relations satisfied by any of the elements in S ( S is "free" of relations). For example,if S is the set {a,b} then the elements of the free group on the two generators a and b are of the form a,aa,ab,abab,bab, etc.,called words in a and b ,together with the inverses of these elements, and all these elements are considered distinct. If we group like terms together,then we obtain elements of the familiar form a,b−3,aba−1b2 etc. Such elements are multiplied by concatenating their words (for example,the product of aba and b−1a3b would simply be abab−1a3b ). It is natural at the outset (even before we know S is contained in some group) to simply define F(S) to be the set of all words in S, where two such expressions are multiplied in F(S) by concatenating them. Although in essence this is what we do, it is necessary to be more formal in order to prove that this concatenation operation is well defined and associative. After all, even the familiar notation an for the product a⋅a⋯a ( n terms) is permissible only because we know that this product is independent of the way it is bracketed (cf. the generalized associative law in Section 1.1). The formal construction of F(S) is carried out below for an arbitrary set S .
自由群 F(S) 由集合 S 生成的的基本思想是,集合 S 中的任何元素之间不存在满足的关系(S 是“无关系”的)。例如,如果 S 是集合 {a,b},那么在两个生成元 a 和 b 上的自由群的元素形式为 a,aa,ab,abab,bab, 等等,称为 a 和 b 中的词,加上这些元素的逆,所有这些元素都被认为是不同的。如果我们把相似的项归在一起,那么我们得到熟悉的形式的元素 a,b−3,aba−1b2 等等。这样的元素通过连接它们的词相乘(例如,aba 和 b−1a3b 的乘积将简单地是 abab−1a3b)。在一开始(甚至在知道 S 包含在某些群中之前)就很自然地定义 F(S) 为所有 S, 中词的集合,其中两个这样的表达式通过连接它们在 F(S) 中相乘。虽然本质上我们就是这样做的,但是为了证明这种连接运算是良定义且结合的,我们需要更加形式化。毕竟,即使是我们熟悉的乘积 a⋅a⋯a(n 项)的表示 an 也只有在我们知道这个乘积与括号的方式无关时才是允许的(参见第1.1节中的广义结合律)。对于任意的集合 S,F(S) 的形式构造将在下面进行。
One important property reflecting the fact that there are no relations that must be satisfied by the generators in S is that any map from the set S to a group G can be uniquely extended to a homomorphism from the group F(S) to G (basically since we have specified where the generators must go and the images of all the other elements are uniquely determined by the homomorphism property - the fact that there are no relations to worry about means that we can specify the images of the generators arbitrarily). This is frequently referred to as the universal property of the free group and in fact characterizes the group F(S) .
一个反映 S 中不存在必须由生成元满足的关系的重要性质是,从集合 S 到一个群 G 的任何映射都可以唯一地扩展为从群 F(S) 到 G 的同态(基本原因是我们已经指定了生成元必须去的位置,而所有其他元素的形象都是由同态性质唯一确定的 - 由于没有关系需要担心,我们可以任意指定生成元的形象)。这通常被称为自由群的普遍性质,实际上也表征了群 F(S) 。
The notion of "freeness" occurs in many algebraic systems and it may already be familiar (using a different terminology) from elementary vector space theory. When the algebraic systems are vector spaces, F(S) is simply the vector space which has S as a basis. Every vector in this space is a unique linear combination of the elements of S (the analogue of a "word"). Any set map from the basis S to another vector space V extends uniquely to a linear transformation (i.e.,vector space homomorphism) from F(S) to V .
“自由性”的概念出现在许多代数系统中,并且在初等向量空间理论中可能已经熟悉(使用不同的术语)。当代数系统是向量空间时,F(S) 只是一个以 S 为基的向量空间。这个空间中的每个向量都是 S 元素的唯一线性组合("单词"的类似物)。从基 S 到另一个向量空间 V 的任何集合映射都可以唯一地扩展为从 F(S) 到 V 的线性变换(即,向量空间同态)。
Before beginning the construction of F(S) we mention that one often sees the universal property described in the language of commutative diagrams. In this form it reads (for groups) as follows: given any set map φ from the set S to a group G there is a unique homomorphism Φ:F(S)→G such that Φ∣S=φ i.e.,such that the following diagram commutes:
在开始构建 F(S) 之前,我们提一下人们经常看到用交换图的语言描述的普遍性质。在这种形式中,对于群来说,它读作:给定从集合 S 到一个群 G 的任何集合映射 φ,都存在一个唯一的同态 Φ:F(S)→G 使得 Φ∣S=φ,即,使得以下图表可交换:
As mentioned above,the only difficulty with the construction of F(S) is the verification that the concatenation operation on the words in F(S) is well defined and associative. To prove the associative property for multiplication of words we return to the most basic level where all the exponents in the words of S are ±1 .
如上所述,构建 F(S) 的唯一困难在于验证 F(S) 中单词的连接操作是良定义且具有结合性。为了证明单词乘法的结合性质,我们回到了最基础的层面,在那里 S 中所有单词的指数都是 ±1。
We first introduce inverses for elements of S and an identity.
我们首先为 S 的元素引入逆元和一个单位元。
Let S−1 be any set disjoint from S such that there is a bijection from S to S−1 . For each s∈S denote its corresponding element in S−1 by s−1 and similarly for each t∈S−1 let the corresponding element of S be denoted by t−1 (so (s−1)−1=s ). Take a singleton set not contained in S∪S−1 and call it {1}. Let 1−1=1 and for any x∈S∪S−1∪{1} let x1=x.
设 S−1 是与 S 不相交的任意集合,并且存在从 S 到 S−1 的双射。对于每个 s∈S,用 s−1 表示其在 S−1 中的对应元素,同样对于每个 t∈S−1,让 S 中的对应元素用 t−1 表示(因此 (s−1)−1=s)。取一个不包含在 S∪S−1 中的单元素集合,称之为 {1}。设 1−1=1,对于任何 x∈S∪S−1∪{1},设 x1=x.。
Next we describe the elements of the free group on the set S . A word on S is by definition a sequence
接下来,我们描述在集合 S 上的自由群的元素。根据定义,S 上的单词是一个序列。
(s1,s2,s3,…)wheresi∈S∪S−1∪{1}andsi=1for allisufficiently large
(that is,for each sequence there is an N such that si=1 for all i≥N ). Thus we can think of a word as a finite product of elements of S and their inverses (where repetitions are allowed). Next, in order to assure uniqueness of expressions we consider only words which have no obvious “cancellations” between adjacent terms (such as baa−1b=bb ). The word (s1,s2,s3,…) is said to be reduced if
(即对于每个序列,都存在一个 N,使得 si=1 对于所有 i≥N)。因此,我们可以将单词视为 S 的元素及其逆元的有限乘积(允许重复)。接下来,为了确保表达式的唯一性,我们只考虑没有明显的“约分”相邻项的单词(例如 baa−1b=bb)。单词 (s1,s2,s3,…) 被称为简化单词,如果。
(1) si+1=si−1 for all i with si=1 ,and
(1)对于所有 i 且 si=1,si+1=si−1。
(2) if sk=1 for some k ,then si=1 for all i≥k .
(2)如果对于某个 k,sk=1,那么对于所有 i≥k,si=1。
The reduced word (1,1,1,…) is called the empty word and is denoted by 1 . We now simplify the notation by writing the reduced word (s1ϵ1,s2ϵ2,…,snϵn,1,1,1,…),si∈S,ϵi=±1 ,as s1ϵ1s2ϵ2…snϵn . Note that by definition,reduced words r1δ1r2δ2…rmδm and s1ϵ1s2ϵ2…snϵn are equal if and only if n=m and δi=ϵi,1≤i≤n . Let F(S) be the set of reduced words on S and embed S into F(S) by
Under this set injection we identify S with its image and henceforth consider S as a subset of F(S) . Note that if S=∅,F(S)={1} .
在这个集合注入下,我们将 S 与其像识别,并从此将 S 视为 F(S) 的子集。注意如果 S=∅,F(S)={1}。
We are now in a position to introduce the binary operation on F(S) . The principal technical difficulty is to ensure that the product of two reduced words is again a reduced word. Although the definition appears to be complicated it is simply the formal rule for "successive cancellation" of juxtaposed terms which are inverses of each other (e.g., ab−1a times a−1ba should reduce to aa ). Let r1δ1r2δ2…rmδm and s1ϵ1s2ϵ2…snϵn be reduced words and assume first that m≤n . Let k be the smallest integer in the range 1≤k≤m+1 such that skϵk=rm−k+1−δm−k+1. Then the product of these reduced words is defined to be:
(r1δ1r2δ2…rmδm)(s1ϵ1s2ϵ2…snϵn)=⎩⎨⎧r1δ1…rm−k+1δm−k+1skϵk…snϵn,sm+1ϵm+1…snϵn,1, if k≤m if k=m+1≤n if k=m+1 and m=n
The product is defined similarly when m≥n ,so in either case it results in a reduced word. Theorem 16. F(S) is a group under the binary operation defined above.
Proof: One easily checks that 1 is an identity and that the inverse of the reduced word s1ϵ1s2ϵ2…snϵn is the reduced word sn−ϵnsn−1−ϵn−1…s1−ϵ1 . The difficult part of the proof is the verification of the associative law. This can be done by induction on the “length” of the words involved and considering various cases or one can proceed as follows: For each s∈S∪S−1∪{1} define σs:F(S)→F(S) by
σs(s1ϵ1s2ϵ2…snϵn)={s⋅s1ϵ1s2ϵ2…snϵn,s2ϵ2s3ϵ3…snϵn, if s1ϵ1=s−1 if s1ϵ1=s−1.
Since σs−1∘σs is the identity map of F(S)→F(S),σs is a permutation of F(S) . Let A(F) be the subgroup of the symmetric group on the set F(S) which is generated by {σs∣s∈S} . It is easy to see that the map
The universal property of free groups now follows easily.
自由群的普遍性质现在很容易得出。
Theorem 17. Let G be a group, S a set and φ:S→G a set map. Then there is a unique group homomorphism Φ:F(S)→G such that the following diagram commutes:
定理 17。设 G 是一个群,S 是一个集合,φ:S→G 是一个集合映射。那么存在一个唯一的群同态 Φ:F(S)→G,使得以下图表可交换:
Proof: Such a map Φ must satisfy Φ(s1ϵ1s2ϵ2…snϵn)=φ(s1)ϵ1φ(s2)ϵ2…φ(sn)ϵn if it is to be a homomorphism (which proves uniqueness), and it is straightforward to check that this map is in fact a homomorphism (which proves existence).
Corollary 18. F(S) is unique up to a unique isomorphism which is the identity map on the set S .
推论 18。F(S) 在集合 S 上的唯一同构是单位映射。
Proof: This follows from the universal property. Suppose F(S) and F′(S) are two free groups generated by S . Since S is contained in both F(S) and F′(S) ,we have natural injections S↪F′(S) and S↪F(S) . By the universal property in the theorem, it follows that we have unique associated group homomorphisms Φ:F(S)→F′(S) and Φ′:F′(S)→F(S) which are both the identity on S . The composite Φ′Φ is a homomorphism from F(S) to F(S) which is the identity on S ,so by the uniqueness statement in the theorem,it must be the identity map. Similarly ΦΦ′ is the identity,so Φ is an isomorphism (with inverse Φ′ ),which proves the corollary.
证明:这遵循泛性质。假设 F(S) 和 F′(S) 是由 S 生成的两个自由群。由于 S 同时包含在 F(S) 和 F′(S) 中,我们有两个自然的单射 S↪F′(S) 和 S↪F(S)。根据定理中的泛性质,可以得出我们有一个唯一的关联群同态 Φ:F(S)→F′(S) 和 Φ′:F′(S)→F(S),它们在 S 上都是恒等映射。复合映射 Φ′Φ 是从 F(S) 到 F(S) 的同态,且在 S 上是恒等映射,所以根据定理中的唯一性陈述,它必须是恒等映射。类似地,ΦΦ′ 也是恒等映射,因此 Φ 是同构(其逆为 Φ′),这证明了推论。
Definition. The group F(S) is called the free group on the set S . A group F is a free group if there is some set S such that F=F(S) - in this case we call S a set of free generators (or a free basis) of F . The cardinality of S is called the rank of the free group.
定义。群 F(S) 被称为由集合 S 生成的自由群。如果一个群 F 存在某个集合 S 使得 F=F(S),在这种情况下我们称 S 为 F 的一组自由生成元(或自由基)。S 的基数被称为自由群的秩。
One can now simplify expressions in a free group by using exponential notation, so we write a3b−2 instead of the formal reduced word aaab−1b−1 . Expressions like aba , however,cannot be simplified in the free group on {a,b} . We mention one important theorem in this area.
现在可以使用指数记法来简化自由群中的表达式,因此我们写作 a3b−2 而不是形式化的简化词 aaab−1b−1。然而,像 aba 这样的表达式在 {a,b} 的自由群中不能简化。我们在此领域提及一个重要的定理。
Theorem 19. (Schreier) Subgroups of a free group are free.
定理 19。(施莱尔)自由群的子群是自由的。
This is not trivial to prove and we do not include a proof. There is a nice proof of this result using covering spaces (cf. Trees by J.-P. Serre, Springer-Verlag, 1980).
Let G be any group. Then G is a homomorphic image of a free group: take S=G and φ as the identity map from G to G ; then Theorem 16 produces a (surjective) homomorphism from F(G) onto G . More generally,if S is any subset of G such that G=⟨S⟩ ,then again there is a unique surjective homomorphism from F(S) onto G which is the identity on S . (Note that we can now independently formulate the notion that a subset generates a group by noting that G=⟨S⟩ if and only if the map π:F(S)→G which extends the identity map of S to G is surjective.)
设 G 为任意群。那么 G 是一个自由群的同态像:取 S=G 和 φ 作为从 G 到 G 的恒等映射;那么定理16产生了一个从 F(G) 到 G 的(满射)同态。更一般地,如果 S 是 G 的任意子集,且 G=⟨S⟩ ,那么同样存在一个从 F(S) 到 G 的唯一满射同态,它在 S 上是恒等的。(注意,我们现在可以独立地表述一个子集生成一个群的概念,通过注意到 G=⟨S⟩ 当且仅当从 S 的恒等映射扩展到 G 的映射 π:F(S)→G 是满射的。)
Definition. Let S be a subset of a group G such that G=⟨S⟩ .
定义。设 S 是群 G 的一个子集,使得 G=⟨S⟩ 。
(1) A presentation for G is a pair(S,R),where R is a set of words in F(S) such that the normal closure of ⟨R⟩ in F(S) (the smallest normal subgroup containing ⟨R⟩)π:F(S)equalsthekernelofthehomomorphism→G(whereπextends the identity map from S to S ). The elements of S are called generators and those of R are called relations of G .
(1)G 的一个表示是一个二元组 (S,R),其中 R 是 F(S) 中的一组单词,使得 ⟨R⟩ 在 F(S) 中的正规闭包(包含 ⟨R⟩)π:F(S)equalsthekernelofthehomomorphism→G(whereπextends 的最小正规子群,恒等映射从 S 到 S)。S 的元素被称为生成元,R 的元素被称为 G 的关系。
(2) We say G is finitely generated if there is a presentation(S,R)such that S is a finite set and we say G is finitely presented if there is a presentation(S,R)with both S and R finite sets.
(2) 我们说 G 是有限生成的,如果存在一个表示 (S,R),使得 S 是一个有限集,并且我们说 G 是有限表示的,如果存在一个表示 (S,R),其中 S 和 R 都是有限集。
Note that if(S,R)is a presentation,the kernel of the map F(S)→G is not ⟨R⟩ itself but rather the (much larger) group generated by R and all conjugates of elements in R . Note that even for a fixed set S a group will have many different presentations (we can always throw redundant relations into R ,for example). If G is finitely presented with S={s1,s2,…,sn} and R={w1,w2,…,wk} ,we write (as we have in preceding chapters):
注意,如果 (S,R) 是一个表示,那么映射 F(S)→G 的核不是 ⟨R⟩ 本身,而是由 R 和 R 中元素的所有共轭生成的(更大的)群。注意,即使对于固定的集 S,一个群也会有多种不同的表示(例如,我们总是可以将在 R 中冗余的关系抛出)。如果 G 是由 S={s1,s2,…,sn} 和 R={w1,w2,…,wk} 有限表示的,我们写作(如我们在前几章中所做的那样):
G=⟨s1,s2,…,sn∣w1=w2=⋯=wk=1⟩
and if w is the word w1w2−1 ,we shall write w1=w2 instead of w=1 .
如果 w 是单词 w1w2−1,我们将写 w1=w2 而不是 w=1。
Examples
示例
(1) Every finite group is finitely presented. To see this let G={g1,…,gn} be a finite group. Let S=G and let π:F(S)→G be the homomorphism extending the identity map of S . Let R0 be the set of words gigjgk−1 ,where i,j=1,…,n and gigj=gk in G. Clearly R0≤kerπ . If N is the normal closure of R0 in F(S) and G=F(S)/N , then G is a homomorphic image of G (i.e., π factors through N ). Moreover,the set of elements {gi∣i=1,…,n} is closed under multiplication. Since this set generates G ,it must equal G . Thus G=∣G∣ and so N=kerπ and (S,R0) is a presentation of G .
(1) 每个有限群都是有限生成的。为了证明这一点,设 G={g1,…,gn} 为一个有限群。设 S=G ,并且让 π:F(S)→G 是 S 的恒等映射的扩张同态。设 R0 是由 gigjgk−1 组成的单词集合,其中 i,j=1,…,n 和 gigj=gk 属于 G。显然 R0≤kerπ 。如果 N 是 R0 在 F(S) 中的正规闭包且 G=F(S)/N ,那么 G 是 G 的同态像(即,π 通过 N 分解)。此外,元素集合 {gi∣i=1,…,n} 在乘法下是封闭的。由于这个集合生成 G ,它必须等于 G 。因此 G=∣G∣ ,所以 N=kerπ ,(S,R0) 是 G 的一个表示式。
This illustrates a sufficient condition for(S,R)to be a presentation for a given finite group G :
这说明了一个充分条件,使得 (S,R) 对于给定的有限群 G 是一个表示式:
(i) S must be a generating set for G ,and
(i) S 必须是 G 的生成集,并且
(ii) any group generated by S satisfying the relations in R must have order ≤∣G∣ . (2) Abelian groups can be presented easily. For instance
(ii) 任何由 S 生成的且满足 R 中关系的群必须有阶 ≤∣G∣ 。(2) 阿贝尔群可以很容易地表示。例如
Z≅F({a})=⟨a⟩
Z×Z≅⟨a,b∣[a,b]=1⟩
Zn×Zm≅⟨a,b∣an=bm=[a,b]=1⟩.
(Recall [a,b]=a−1b−1ab ).
(回顾 [a,b]=a−1b−1ab )。
(3) Some familiar non-abelian groups introduced in earlier chapters have simple presentations:
(3) 在前面的章节中介绍的一些熟悉的非阿贝尔群有简单的表示式:
D2n=⟨r,s∣rn=s2=1,s−1rs=r−1⟩
Q8=⟨i,j∣i4=1,j2=i2,j−1ij=i−1⟩.
To check,for example,the presentation for D2n note that the relations in the presentation ⟨r,s∣rn=s2=1,s−1rs=r−1⟩ imply that this group has a normal subgroup (generated by r ) of order ≤n whose quotient is generated by s (which has order ≤2 ). Thus any group with these generators and relations has order at most 2n . Since we already know of the existence of the group D2n of order 2n satisfying these conditions, the abstract presentation must equal D2n .
例如,要检查 D2n 的表示,请注意表示中的关系 ⟨r,s∣rn=s2=1,s−1rs=r−1⟩ 暗示这个群有一个阶为 ≤n 的正规子群(由 r 生成),其商由 s 生成(其阶为 ≤2)。因此,任何具有这些生成元和关系的群其阶至多为 2n。既然我们已经知道存在一个阶为 2n 且满足这些条件的群 D2n,抽象表示必须等于 D2n。
(4) As mentioned in Section 1.2, in general it is extremely difficult even to determine if a given set of generators and relations is or is not the identity group (let alone determine whether it is some other nontrivial finite group). For example, in the following two presentations the first group is an infinite group and the second is the identity group (cf. Trees, Chapter 1):
As mentioned in Section 1.6 we can use presentations of a group to find homomorphisms between groups or to find automorphisms of a group. We did this in classifying groups of order 6,for example,when we proved that any non-abelian group of order 6 was generated by an element of order 3 and an element of order 2 inverting it; thus there is a homomorphism from S3 onto any non-abelian group of order 6 (hence an isomorphism, by computing orders). More generally,suppose G is presented by,say,generators a,b with relations r1,…,rk . If a′,b′ are any elements of a group H satisfying these relations,there is a homomorphism from G into H . Namely,if π:F({a,b})→G is the presentation homomorphism,we can define π′:F({a,b})→H by π′(a)=a′ and π′(b)=b′ . Then kerπ≤kerπ′ so π′ factors through kerπ and we obtain
如1.6节所述,我们可以使用群的表示来找到群之间的同态或找到群的自同构。例如,在分类阶数为6的群时,我们就这么做了,当时我们证明了任何阶数为6的非阿贝尔群都可以由一个阶数为3的元素和一个阶数为2的元素生成,并对其进行逆变换;因此存在一个从 S3 到任何阶数为6的非阿贝尔群的同态(通过计算阶数,因此是一个同构)。更一般地,假设 G 由生成元 a,b 和关系 r1,…,rk 表示。如果 a′,b′ 是满足这些关系的群 H 中的任意元素,那么存在一个从 G 到 H 的同态。具体来说,如果 π:F({a,b})→G 是表示同态,我们可以通过 π′:F({a,b})→H 定义 π′(a)=a′ 和 π′(b)=b′ 。那么 kerπ≤kerπ′ ,因此 π′ 可以通过 kerπ 分解,我们得到
G≅F({a,b})/kerπ→H.
In,particular,if ⟨a′,b′⟩=H=G ,this homomorphism is an automorphism of G . Conversely, any automorphism must send a set of generators to another set of generators satisfying the same relations. For example, D8=⟨a,b∣a2=b4=1,aba=b−1⟩ and any pair a′,b′ of elements,where a′ is a noncentral element of order 2 and b′ is of order 4, satisfies the same relations. Since there are four noncentral elements of order 2 and two elements of order 4, D8 has 8 automorphisms.
Similarly,any pair of elements of order 4 in Q8 which are not equal or inverses of each other necessarily generate Q8 and satisfy the relations given in Example 3 above. It is easy to check that there are 24 such pairs, so
Free objects can be constructed in (many, but not all) other categories. For instance, a monoid is a set together with a binary operation satisfying all of the group axioms except the axiom specifying the existence of inverses. Free objects in the category of monoids play a fundamental role in theoretical computer science where they model the behavior of machines (Turing machines, etc.). We shall encounter free algebras (i.e., polynomial algebras) and free modules in later chapters.
Let F1 and F2 be free groups of finite rank. Prove that F1≅F2 if and only if they have the same rank. What facts do you need in order to extend your proof to infinite ranks (where the result is also true)?
Prove that the commutator subgroup of the free group on 2 generators is not finitely generated (in particular, subgroups of finitely generated groups need not be finitely generated).
证明2生成元的自由群的换位子群不是有限生成的(特别地,有限生成群的子群不一定是有限生成的)。
Prove that every nonidentity element of a free group is of infinite order.
证明自由群中每个非单位元素都是无限阶的。
Establish a finite presentation for A4 using 2 generators.
用2个生成元为 A4 建立一个有限呈现。
Establish a finite presentation for S4 using 2 generators.
用2个生成元为 S4 建立一个有限呈现。
Prove that the following is a presentation for the quaternion group of order 8 :
证明以下是对阶为8的四元数群的呈现:
Q8=⟨a,b∣a2=b2,a−1ba=b−1⟩.
Use presentations to find the orders of the automorphism groups of the groups Z2×Z4 and Z4×Z4 .
使用呈现来找到群 Z2×Z4 和 Z4×Z4 的自同构群的阶。
Prove that Aut(Q8)≅S4 .
证明 Aut(Q8)≅S4 。
This exercise exhibits an automorphism of S6 that is not inner (hence,together with Exercise 19 in Section 4.4 it shows that ∣Aut(S6):Inn(S6)∣=2 ). Let t1′=(12)(34)(56) , t2′=(14)(25)(36),t3′=(13)(24)(56),t4′=(12)(36)(45),andt5′=(14)(23)(56). Show that t1′,…,t5′ satisfy the following relations:
extends to an automorphism of S6 (which is clearly not inner since it does not send transpositions to transpositions). [Use the presentation for S6 described in Example 5.]
Let S be a set. The group with presentation(S,R),where R={[s,t]∣s,t∈S} is called the free abelian group on S -denote it by A(S) . Prove that A(S) has the following universal property: if G is any abelian group and φ:S→G is any set map,then there is a unique group homomorphism Φ:A(S)→G such that Φ∣S=φ . Deduce that if A is a free abelian group on a set of cardinality n then
设 S 为一个集合。以 (S,R) 为生成元和关系的群被称为在 S 上的自由阿贝尔群,记作 A(S) 。证明 A(S) 具有以下普遍性质:如果 G 是任意阿贝尔群,φ:S→G 是任意集合映射,那么存在唯一的群同态 Φ:A(S)→G 使得 Φ∣S=φ 。推导出如果 A 是在基数 n 的集合上的自由阿贝尔群,那么
A≅Z×Z×⋯×Z (n factors).
Let S be a set and let c be a positive integer. Formulate the notion of a free nilpotent group on S of nilpotence class c and prove it has the appropriate universal property with respect to nilpotent groups of class ≤c .
设 S 为一个集合,c 为一个正整数。构建在 S 上的 nilpotence 类 c 的自由 nilpotent 群的概念,并证明它具有关于类 ≤c 的 nilpotent 群的适当普遍性质。
Prove that there cannot be a nilpotent group N generated by two elements with the property that every nilpotent group which is generated by two elements is a homomorphic image of N (i.e.,the specification of the class c in the preceding problem was necessary).
证明不存在由两个元素生成的幂零群 N,使得每一个由两个元素生成的幂零群都是 N 的同态像(即,前一个问题中对类 c 的指定是必要的)。