FACTOID # 177: 61.5% of Swedes work more than 40 hours per week, but just across the border in Norway only 15.8% of people work this long.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Formal sum

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. Unlike vector spaces, not all abelian groups have a basis, hence the special name for those that do. A typical example of a free abelian group is the direct sum ZZ of two copies of the infinite cyclic group Z; a basis is {(1,0),(0,1)}. The trivial abelian group {0} is also considered to be free abelian, with basis the empty set.


Note a point on terminology: a free abelian group is not the same as a free group that is abelian; in fact most free groups are not abelian.


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.


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 exemplar may be constructed as the abelian group of functions on B, taking integer values all but finitely many of which are zero. This is the direct sum of copies of Z, one copy for each element of B. Formal sums of elements of a given set B are nothing but the elements of the free abelian group with basis B.


Every finitely generated free abelian group is therefore isomorphic to Zn 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.


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.


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

0 → GFA → 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.


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 Z.


It can be surprisingly difficult to determine whether a concretely given group is free abelian. Consider for instance the Baer-Specker group ZN, the direct product of countably many copies of Z. R. Baer proved in 1937 that this group is not free abelian; Specker proved in 1950 that every countable subgroup of ZN is free abelian.


  Results from FactBites:
 
Computer Science: The Search for a Mathematical Theory (7971 words)
Thus formal logic is, by the nature of its approach, cut off from the best cultivated portions of mathematics, and forced onto the most difficult part of the mathematical terrain, into combinatorics.
Their formalism, aimed at retaining the flavor of the machine and its ties to Turing machines, became the standard for the field, beginning, significantly, with tapes formed by finite sequences of symbols from a finite alphabet.
Far from merely complementing the study of computer science, the subject of automata and formal languages became the theoretical core of the curriculum during the 1970s, especially as it was embedded in such tools as lexical analyzers and parser generators.
SSR 61-55 (779 words)
Formal filing did not occur within the succeeding 2-year period but the claimant is deemed to have filed application within this latter period when he mailed the above letter requesting payment of the lump sum and he may be found to be entitled to the lump-sum death payment on the basis of the application filed.
Although the formal application for a lump-sum death payment was executed and filed by R on March 20, 1961, more than 4 years after the worker's death, R's letter of January 20, 1961, was received by the Administration less than 4 years after the worker's death.
Also, the formal application was filed within 6 months from the date thereafter that the Bureau notified him that an application on a prescribed form was necessary.
  More results at FactBites »


 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m