Professional Documents
Culture Documents
The Johns Hopkins University Press
The Johns Hopkins University Press
Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .
http://www.jstor.org/page/info/about/policies/terms.jsp
.
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of
content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms
of scholarship. For more information about JSTOR, please contact support@jstor.org.
The Johns Hopkins University Press is collaborating with JSTOR to digitize, preserve and extend access to
American Journal of Mathematics.
http://www.jstor.org
aa withVf.6
(a) -1 as relations. A set of generatorsof i (B) is by,while
bi,y(i, 1, 2) are the correspondingelementsin B,; hi is an,arc in C from
the originof i (C) to the originof i (B,). The elementshibi7hi-'of i (C)
can be expressedin termsof the aa:
hb,^yhj-1~ piy(aa).
As generatorsfor @(A) we can take the elementsaa and atotherelement
g, and as relations:
AppJ(aa) 1, giy7(aa) 02y(aa)g.
COROLLARY 2. The numberof sets B, is two,and C is the sum of two
arcwise connectedcomponents: Cl, containingB1, and C2, containingB2.
A set of generatorsfor i (Ci) (i 1, 2) is formedby the elementsaja, a set
=
* We do not describe this process, as the resulting theorems are too complicated
to be of much use, and the process can be readily set up for any special example.
t If this last condition is not verified (i (A) can still be constructed after the
definitionof a limit for elements of @ (A) as the closure of the group that will appear
as a result of the continued identification process.