Professional Documents
Culture Documents
n n+1
Proof. It suffices to consider / e E(G) with 0 < r(/ G) = r(f G) =
n n n
.. - < oo for some positive integer n. f : f G f G is thus a
n n
quasi-automorphism of f G [9, p. 553, Th. 4.2]; suppose mf G S
2l % 2w
/ G for the positive integer m. Let 6 e G; m/ 6 = / for some
n n % n
aeG. Write m& = (mb - f a) + f a; (mb - / ) e ker f and / 6
n %
f*G; note ker / f G = 0. Thus G = ker / + / G. (We do not
exclude the possibility r(G) = r(/G) < <*>, i.e., the case when / is a
quasi-automorphism of a group with finite rank.)
() = (( - ) + ) ^ ( - ) t() = t() .
If ( ) and (&) are distinct, some / e E(G) maps to 0 and
to nb, n > 0. Then
t(a) ^ (/) = t(fb) = (w) = () .
For aeG, a denotes the coset of a in some specified quotient
group.
Proof. By Lemmas 4.1, 4.2, and [1, p. 117, Th. 11.3], it suffices
to show that for each r e T(G), every subgroup A of rank one in
G which satisfies t{A) = and G() A + C, is a direct summand
of G. Let a be any nonzero element of A; note that a is primitive.
By assumption, some / e F(G) maps a to a. Let H be the pure
subgroup of G generated by fG; H is completely decomposable [4,
p. 606, Cor. 1.7]. a is certainly primitive in H and so H A + B
[1, p. 80, Lemma 5.2]. If eeE(H) projects H onto A, then ef e E(G)
projects G onto A.
We now obtain
THEOREM 5.3. Let < r " be two types which differ at an infi-
nite number of primes. Then there exists an uncountable chain
of types satisfying the maximum condition which contains as its
least element and " as its greatest element.
Proof. Choose a type ' so that < ' ^ " and so that ' is
finite wherever it differs from . Let ^ denote the collection of
all sets C of types such that (1) C is a chain satisfying the maximum
condition; (2) r ' e C ; (3) < <; ' for all eC; (4) if lf 2 are distinct
elements of C, then x and 2 differ from each other and from at
an infinite number of primes. Note that {r'} 6 ^ .
For Clf C2 e ^ , define Cx < C2 if there exists eC2 such that Ct =
354 E. F. CORNELIUS, JR.
REMARK 5.4. (1) If and " are distinct types which differ at
only finitely many primes, then any chain of types between and
" is necessarily finite.
(2) The preceding arguments may be modified in an obvious
fashion to prove the existence of uncountable well ordered type sets.
( 3 ) Under the continuum hypothesis, any uncountable chain of
types has the same cardinality, 2Ko, as the set of all types.
REFERENCES
1. Reinhold Baer, Abelian groups without elements of finite order, Duke Math. J., 3
(1937), 68-122.
2. R. A. Beaumont and R. S. Pierce, Torsion-free rings, Illinois J. Math., 5 (1961),
61-98.
3. 1 Torsion free groups of rank two, Memoirs Amer. Math. Soc, 38 (1961).
4. E. F. Cornelius, Jr., A generalization of separable groups, Pacific J. Math., 39 (1971),
603-613.
5 f A sufficient condition for separability, submitted for publication.
6. L. Fuchs, Abelian groups, reprint, Internat. Series of Monographs of Pure and Appl.
Math., Pergamon Press, New York, 1960.
7. f Infinite Abelian Groups, Vol. 2, Academic Press, New York, 1973.
8. Nathan Jacobson, Structure of rings, rev. ed., Amer. Math. Soc. Colloq. Publ., vol.
37, Amer. Math. Soc, Providence, R. I., 1964.
9. J. D. Reid, On quasi-decompositions of torsion free abelian groups, Proc. Amer.
Math. Soc, 13 (1962), 550-554.
10. , On the ring of quasi-endomorphisms of a torsion-free group, Topics in
CHARACTERIZATION OF A CLASS OF TORSION FREE GROUPS 355