The mathematical structures underlying homology groups are finitely generated Abelian groups. Throughout this chapter, the group operation is denoted by since all the groups considered here are Abelian (commutative). The unit element is denoted by 0.
3.1.1 Elementary group theory
Let and be Abelian groups. A map is said to be a homomorphism if
for any . If is also a bijection, is called an isomorphism. If there exists an isomorphism , is said to be isomorphic to , denoted by . For example, a map defined by
is a homomorphism. Indeed
A subset is a subgroup if it is a group with respect to the group operation of . For example,
is a subgroup of , while is not.
Let be a subgroup of . We say are equivalent if
and write . Clearly is an equivalence relation. The equivalence class to which belongs is denoted by . Let be the quotient space. The group operation in naturally induces the group operation in by
Note that on the LHS is an operation in while on the RHS is that in . The operation in should be independent of the choice of representatives. In fact, if , , then , for some and we find that
Furthermore, becomes a group with this operation, since is always a normal subgroup of ; see example 2.6. The unit element of is ,
. If , for any and has just one element [0]. If , is itself since if and only if .
Let us work out the quotient group . For even numbers we have and . For odd numbers and . Even numbers and odd numbers never belong to the same equivalence class since . Thus, it follows that
If we define an isomorphism by and , we find . For general , we have
Let be a homomorphism. Then
(a) is a subgroup of
(b) is a subgroup of
Proof
(a) Let . Then since . Note that for . We also have since .
(b) Let where . Since is a homomorphism we have . Clearly since . If since implies .
Theorem 3.1 · Fundamental theorem of homomorphism
Let be a homomorphism. Then
Proof
Both sides are groups according to lemma 3.1. Define a map by . This map is well defined since for , there exists such that and . Now we show that is an isomorphism. First, is a homomorphism,
Second, is one to one: if , then or . This shows that and . Finally, is onto: if , there exists such that .
Let be defined by and . Then and are groups. Theorem 3.1 states that , in agreement with example 3.1.
3.1.2 Finitely generated Abelian groups and free Abelian groups
Let be an element of a group . For denotes
and
If , we put . Take elements of . The elements of of the form
form a subgroup of , which we denote . is called a subgroup of generated by the generators . If itself is generated by finite elements , is said to be finitely generated. If is satisfied only when , are said to be linearly independent.
If is finitely generated by linearly independent elements, is called a free Abelian group of rank .
is a free Abelian group of rank 1 finitely generated by 1 (or ). Let be the set of pairs . It is a free Abelian group of rank 2 finitely generated by generators and . More generally
is a free Abelian group of rank . The group is finitely generated by 1 but is not free since 1 is not linearly independent (note ).
3.1.3 Cyclic groups
If is generated by one element , , is called a cyclic group. If for any , it is an infinite cyclic group while if for some , a finite cyclic group. Let be a cyclic group generated by and let be a homomorphism defined by . maps onto but not necessarily one to one. From theorem 3.1, we have . Let be the smallest positive integer such that . Clearly
and we have
If is an infinite cyclic group, then and . Any infinite cyclic group is isomorphic to while a finite cyclic group is isomorphic to some .
We will need the following lemma and theorem in due course. We first state the lemma without proof.
Let be a free Abelian group of rank and let be a subgroup of . We may always choose generators , out of generators of so that generate . Thus, and is of rank .
Theorem 3.2 · Fundamental theorem of finitely generated Abelian groups
Let be a finitely generated Abelian group (not necessarily free) with generators. Then is isomorphic to the direct sum of cyclic groups,
where . The number is called the rank of .
Proof
Let be generated by elements and let
be a surjective homomorphism,
Theorem 3.1 states that
Since is a subgroup of
lemma 3.2 claims that if we choose the generators properly, we have
We finally obtain
来源与版本
正文:英文 · OCR 机器稿 · 待校对
核对状态:OCR 机器稿 · 待校对
来源版本:second-edition-local
来源 PDF SHA-256:fcd24c3371d092a8c699ccf5cf0765462924b6c48412804231076e8084b1940d
OCR 来源 SHA-256:0b6324f01172a3548cd34382e82fd8bfae574602b6b2cfaa357ba96bc2c35478
OCR 产物 SHA-256:91d628e58b7aa6bd8fdf3ee2f2a58293cf77c3d3a7bb0f2ea2d2c0b6693891cb