Free abelian group: Difference between revisions

Content deleted Content added

Inline

Revision as of 03:58, 28 November 2013

In abstract algebra, a free abelian group is an abelian group that has a "basis" in the sense that every element of the group can be written in one and only one way as a finite linear combination of elements of the basis, with integer coefficients. Hence, free abelian groups over a basis B are also known as formal sums over B. Informally, free abelian groups or formal sums may also be seen as signed multisets with elements in B.

Free abelian groups have very nice properties which make them similar to vector spaces and allow a general abelian group to be understood as a quotient of a free abelian group by "relations". Every free abelian group has a rank defined as the cardinality of a basis. The rank determines the group up to isomorphism, and the elements of such a group can be written as finite formal sums of the basis elements. Every subgroup of a free abelian group is itself free abelian, which is important for the description of a general abelian group as a cokernel of a homomorphism between free abelian groups.

Example

For example, let G be the group that is the direct sum $\mathbb {Z} \oplus \mathbb {Z}$ of two copies of the infinite cyclic group $\mathbb {Z}$ . Symbolically,

G=\{(a,b)|a,b\in \mathbb {Z} \}

.

One basis for this group is {(1,0),(0,1)}. If we say $\ e_{1}=(1,0)$ and $\ e_{2}=(0,1)$ , then we can write the element (4,3) as

\ (4,3)=4e_{1}+3e_{2}

where 'multiplication' is defined so that

\ 4e_{1}:=e_{1}+e_{1}+e_{1}+e_{1}

.

In this basis, there is no other way to write (4,3), but if we choose our basis to be {(1,0),(1,1)}, where $\ f_{1}=(1,0)$ and $\ f_{2}=(1,1)$ , then we can write (4,3) as

\ (4,3)=f_{1}+3f_{2}

.

Unlike vector spaces, not all abelian groups have a basis, hence the special name for those that do. (For instance, any group having periodic elements is not a free abelian group because any element can be expressed in an infinite number of ways simply by putting in an arbitrary number of cycles constructed from a periodic element.) The trivial abelian group {0} is also considered to be free abelian, with basis the empty set.

Every lattice forms a finitely-generated free abelian group.

Terminology

Note that a free abelian group is not a free group except in two cases: a free abelian group having an empty basis (rank 0, giving the trivial group) or having just 1 element in the basis (rank 1, giving the infinite cyclic group). Other abelian groups are not free groups because in free groups ab must be different from ba if a and b are different elements of the basis, while in free abelian groups they must be identical. Free groups are the free objects in the category of groups, that is, the "most general" or "least constrained" groups with a given number of generators, whereas free abelian groups are the free objects in the category of abelian groups; in the general category of groups, it is an added constraint to demand that ab = ba, whereas this is a necessary property in the category of abelian groups.

Properties

For every set B, there exists a free abelian group with basis B, and all such free abelian groups having B as basis are isomorphic. One example may be constructed as the abelian group of functions on B, where each function may take integer values, and all but finitely many of its values are zero. This is the direct sum of copies of $\mathbb {Z}$ , one copy for each element of B.
If F is a free abelian group with basis B, then we have the following universal property: for every arbitrary function f from B to some abelian group A, there exists a unique group homomorphism from F to A which extends f. This universal property can also be used to define free abelian groups.
Given any abelian group A, there always exists a free abelian group F and a surjective group homomorphism from F to A. This follows from the universal property mentioned above.
All free abelian groups are torsion-free, and all finitely generated torsion-free abelian groups are free abelian. (The same applies to flatness, since an abelian group is torsion-free if and only if it is flat.) The additive group of rational numbers Q is a (not finitely generated) torsion-free group that's not free abelian. The reason: Q is divisible but non-zero free abelian groups are never divisible.
Free abelian groups are a special case of free modules, as abelian groups are nothing but modules over the ring $\mathbb {Z}$ .

Importantly, every subgroup of a free abelian group is free abelian (see below). As a consequence, to every abelian group A there exists a short exact sequence

0 → G → F → A → 0

with F and G being free abelian (which means that A is isomorphic to the factor group F/G). This is called a free resolution of A. Furthermore, the free abelian groups are precisely the projective objects in the category of abelian groups.^[1]

It can be surprisingly difficult to determine whether a concretely given group is free abelian. Consider for instance the Baer–Specker group $\mathbb {Z} ^{\mathbb {N} }$ , the direct product (not to be confused with the direct sum, which differs from the direct product on an infinite number of summands) of countably many copies of $\mathbb {Z}$ . Reinhold Baer proved in 1937 that this group is not free abelian; Specker proved in 1950 that every countable subgroup of $\mathbb {Z} ^{\mathbb {N} }$ is free abelian.

Rank

Every finitely generated free abelian group is isomorphic to $\mathbb {Z} ^{n}$ for some natural number n called the rank of the free abelian group. In general, a free abelian group F has many different bases, but all bases have the same cardinality, and this cardinality is called the rank of F. This rank of free abelian groups can be used to define the rank of all other abelian groups: see rank of an abelian group. The relationships between different bases can be interesting; for example, the different possibilities for choosing a basis for the free abelian group of rank two is reviewed in the article on the fundamental pair of periods.

Formal sum

A formal sum of elements of a given set B is an element of the free abelian group with basis B. In other words, given a set B, let G be the unique (up to isomorphism) free abelian group with basis B. For elements $b_{1},b_{2},...\in B$ and $a_{1},a_{2},...\in \mathbb {Z}$ (where there must be an $n\in \mathbb {Z}$ such that $a_{i}=0$ for all $i\geq n$ ),

\sum _{i=1}^{\infty }a_{i}b_{i}\in G

Subgroup closure

Every subgroup of a free abelian group is itself a free abelian group. This is similar to the Nielsen–Schreier theorem that a subgroup of a free group is free, and is a generalization of the fact that every nontrivial subgroup of the infinite cyclic group is infinite cyclic. This result has been credited to Richard Dedekind.^[2]

Notes

^ Griffith, p.18
^ Johnson, D. L. (1980). Topics in the Theory of Group Presentations. London Mathematical Society lecture note series. Vol. 42. Cambridge University Press. p. 9. ISBN 978-0-521-23108-4..

References

Phillip A. Griffith (1970). Infinite Abelian group theory. Chicago Lectures in Mathematics. University of Chicago Press. ISBN 0-226-30870-7.

[1] Griffith, p.18

[2] Johnson, D. L. (1980). Topics in the Theory of Group Presentations. London Mathematical Society lecture note series. Vol. 42. Cambridge University Press. p. 9. ISBN 978-0-521-23108-4..

[1]

[2]

@@ Line 47: / Line 47: @@
 == Subgroup closure ==
+Every subgroup of a free abelian group is itself a free abelian group.  This is similar to the [[Nielsen–Schreier theorem]] that a subgroup of a [[free group]] is free, and is a generalization of the fact that [[fundamental theorem of cyclic groups|every nontrivial subgroup of the infinite cyclic group is infinite cyclic]]. This result  has been credited to [[Richard Dedekind]].<ref>{{Cite book|title=Topics in the Theory of Group Presentations|volume=42|series=London Mathematical Society lecture note series|first=D. L.|last=Johnson|publisher=Cambridge University Press|year=1980|isbn=978-0-521-23108-4|page=9}}.</ref>
-{{technical|date=November 2013}}
-Every subgroup of a free abelian group is itself a free abelian group.  This is similar to the [[Nielsen–Schreier theorem]] that a subgroup of a [[free group]] is free.<ref>According to Johnson, this result is due to [[Richard Dedekind]].  {{Cite book|title=Topics in the Theory of Group Presentations|volume=42|series=London Mathematical Society lecture note series|first=D. L.|last=Johnson|publisher=Cambridge University Press|year=1980|isbn=978-0-521-23108-4|page=9.}}.</ref>
-[[Theorem]]: Let <math>F</math> be a free abelian group generated by the set <math>X=\{x_k\,|\,k\in I\}</math> and let <math>G\subset F</math> be a subgroup.  Then <math>G</math> is a free abelian group.
-[[Mathematical proof|Proof]]:<ref>This proof is an application of [[Zorn's lemma]] and can be found in Appendix 2 §2, page 880 of {{Lang Algebra|edition=3r}}.</ref> If <math>G=\{0\}</math>, the statement holds, so we can assume that <math>G</math> is nontrivial.  First we shall prove this for finite <math>X</math> by [[Mathematical induction|induction]].  When <math>|X|=1</math>, <math>G</math> is isomorphic to <math>\Z</math> (being nontrivial) and clearly free.  Assume that if a group is generated by a set of size <math>\le k</math>, then every subgroup of it is free.  Let <math>X=\{x_1,x_2,\dots,x_k,x_{k+1}\}</math>, <math>F</math> the free group generated by <math>X</math> and <math>G\subset F</math> a subgroup.  Let <math>\operatorname{pr}\colon G\to F</math> be the projection <math>\operatorname{pr}(a_1x_1+\dots+a_{k+1}x_{k+1})=a_1x_1.</math> If <math>\operatorname{Rng}(\operatorname{pr})=\{0\}</math>, then <math>G</math> is a subset of <math>\langle x_2,\dots,x_{k+1}\rangle</math> and free by the induction hypothesis.  Thus we can assume that the range is nontrivial.  Let <math>m>0</math> be the least such that <math>mx_1\in \operatorname{Rng}(\operatorname{pr})</math> and choose some <math>x</math> such that <math>\operatorname{pr} x=mx_1</math>.  It is standard to verify that <math>x\notin\operatorname{Ker}(\operatorname{pr})</math> and if <math>y\in G</math>, then <math>y=nx+k</math>, where <math>k\in \operatorname{Ker}(\operatorname{pr})</math> and <math>n\in\Z</math>.  Hence <math>G=\operatorname{Ker}(\operatorname{pr}) \oplus \langle x\rangle</math>.  By the induction hypothesis <math>\operatorname{Ker}(\operatorname{pr})</math> and <math>\langle x\rangle</math> are free: first is isomorphic to a subgroup of <math>\langle x_2,\dots x_{k+1}\rangle</math> and the second to <math>\Z</math>.
-Assume now that <math>X=\{x_i\mid i\in I\}</math> is arbitrary.  For each subset <math>J</math> of <math>I</math> let <math>F_J</math> be the free group generated by <math>\{x_i\mid i\in J\}</math>, thus <math>F_J\subset F</math> is a free subgroup and denote <math>G_J=F_J\cap G</math>.
-Now set
-:<math>
-S=\{(G_J,w)\mid G_J {\rm\; is\; a\; nontrivial\; free\; group\;and\; }w{\rm\; is\; a\; basis\; of\;}G_J\}.
-</math>
-Formally <math>w</math> is an injective (one-to-one) map
-:<math>w:J'\to G_J</math>
-such that <math>w[J']</math> generates <math>G_J</math>.
-Clearly <math>S</math> is nonempty: Let us have an element <math>x</math> in <math>G</math>.  Then <math>x=a_1x_{i_1}+\cdots+a_nx_{i_n}</math> and thus the free group generated by <math>J=\{x_{i_1},\dots, x_{i_n}\}</math> contains <math>x</math> and the intersection <math>G\cap F_J</math> is a nontrivial subgroup of a finitely generated free abelian group and thus free by the induction above.
-If <math>(G_J,w),(G_K,u)\in S</math>, define order <math>(G_J,w)\le(G_K,u)</math> if and only if <math>J\subset K</math> and the basis <math>u</math> is an extension of <math>w</math>; formally if <math>w:J'\to G_J</math> and <math>u:K'\to G_K</math>, then <math>J'\subset K'</math> and <math>u\restriction w=w</math>.
-If <math>(G_{J_r},w_r)_{r\in L}</math> is a <math>\le</math>-chain (<math>L</math> is some linear order) of elements of <math>S</math>, then obviously
-:<math>(\bigcup_{r\in L}G_{J_r},\bigcup_{r\in L}w_r)\in S</math>,
-so we can apply [[Zorn's lemma]] and conclude that there exists a maximal
-<math>(G_J,w)</math>.  Since <math>G_I=G</math>, it is enough to prove now that <math>J=I</math>.  Assume on contrary that there is <math>k\in I\setminus J</math>.
-Put <math>K=J\cup\{k\}</math>.  If <math>G_K=F_K\cap G=G_J,</math> then it means that <math>(G_J,w)\le (G_K,w)</math>, but they are not equal, so <math>(G_K,w)</math> is bigger, which contradicts maximality of <math>(G_J,w)</math>.  Otherwise there is an element <math>nx_k + y\in G_K</math> such that <math>n\in\Z\setminus\{0\}</math> and <math>y\in F_J</math>.
-The set of <math>n\in\Z</math> for which there exists <math>y\in F_J</math> such that <math>nx_k+y\in G_K</math> forms a subgroup of <math>\Z</math>.  Let <math>n_0</math> be a generator of this group and let <math>w_k=n_0x_k+y\in G_K</math> with <math>y\in F_J</math>.  Now if <math>z\in G_K</math>, then for some <math>m\in Z</math>, <math>z=z-mw_k+mw_k</math>, where <math>z-mw_k\in G_J</math>.
-On the other hand clearly <math>w_k\Z\cap F_J=\{0\}</math>, so <math>w'=w\cup \{w_k\}</math> is a basis of <math>G_K</math>, so <math>(G_K,w')\ge (G_J,w)</math> contradicting the maximality again. <math>\square</math>
 ==Notes==