. are the following: • Is there a group of cardinality>. which is >.-free (that is, every subgroup of cardinality < >. is free), but is not free? • Is there a Whitehead group G (that is, Ext(G,Z) = 0) of cardinality>. which is not free? (See [6] for the first, [7] for the second; also [2] is a general reference for unexplained terminology and further information.) The second author has shown that the first problem is equivalent to a problem in pure combinatorial set theory (involving the important notion of a >.-system; see Theorem 3.) This not only makes it easier to prove independence results (as in [6]), but also allows one to prove (in ZFC!) group-theoretic results such as:
(V') if there is a >.-free group of cardinality >. which is not free,
then there is a strongly >.-free group of cardinality >. which is not free. 1991 Mathematics Subject Classification. Primary 20K20, 20K35; Secondary 03E05. Thanks to Rutgers University for funding the authors' visits to Rutgers. The second author was partially supported by the Basic Research Foundation administered by The Israel Academy of Sciences and Humanities. Pub. No. 505. Final version. @ 1994 American Mathematical Society 0211-4132/94 Sl.OO + S.25 per page
79
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
PAUL C. EKLOF AND SAHARON SHELAH
80
(See (10] or (2, Chap. VII].) A group G is said to be strongly >.-free if every subset of G of cardinality < ).. is contained in a free subgroup H of cardinality < ).. such that G / H is >-.-free. One reason for interest in this class of groups is that they are precisely the groups which are equivalent to a free group with respect to the infinitary language Loo>. (see (1]). There is no known way to prove (v) except to go through the combinatorial equivalent. As for the second problem, the second author has shown that for >-. = N1, there is a combinatorial characterization of the problem: there is a non-free Whitehead group of cardinality N1 if and only if there is a ladder system on a stationary subset of N1 which satisfies 2-uniformization. (See the Appendix to this paper; a knowledge of the undefined terminology in this characterization is not needed for the body of this paper.) Again, there are group-theoretic consequences which are provable in ZFC: (V\7) if there is a non-free Whitehead group of cardinality N1, then there is a strongly N1-free, non-free Whitehead group of cardinality N1. (See (2, §XII.3]. It is consistent with ZFC that there are Whitehead groups of cardinality N1 which are not strongly N1-free.) Our aim in this paper is to generalize (VV) to cardinals>-.> N1 by combining the two methods used to prove (V) and (VV). Since the existence of a non-free Whitehead group G of cardinality N1 implies that for every uncountable cardinal ).. there exist non-free Whitehead groups of cardinality>-. (e.g. the direct sum of ).. copies of G- which is not >-.-free), the appropriate hypothesis to consider is: • there is a >-.-free Whitehead group of cardinality >-.which is not free. By the Singular Compactness Theorem (see (8]),).. must be regular. It can be proved consistent that there are uncountable >-. > N1 such that the hypothesis holds. (See (4] or (11].) In particular, for many>-. (for example,>-.= Nn+l, nEw) it can be proved consistent with ZFC that >-. is the smallest cardinality of a nonfree Whitehead group; hence there is a >-.-free Whitehead group of cardinality>-. which is not free. (See (4].) Our main theorem is then: 1. If there is a >.-free Whitehead group of cardinality>-. which is not fr·ee, then there are 2>- different strongly >.-free Whitehead groups of cardinality >-.. THEOREM
Our proof will proceed in three steps. First, assuming the hypothesis -call it (A)- of the Theorem, we will prove (B) there is a combinatorial object, consisting of a >-.-system with a type of uniformization property.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A COMBINATORIAL PRINCIPLE
81
Second, we will show that the combinatorial property (B) can be improved to a stronger combinatorial property (B+ ), which includes the "reshuffling property". Finally, we prove that (B+) implies (A+): the existence of many strongly >.-free Whitehead groups. Note that we have found, in (B) or (B+ ), a combinatorial property which is equivalent to the existence of a non-free >.-free Whitehead group of cardinality >., answering an open problem in [2, p. 453]. Certainly this combinatorial characterization is more complicated than the one for groups of cardinality N1 cited above. This is not unexpected; indeed the criterion for the existence of >.-free groups in Theorem 3 implies that the solution to the open problem is inevitably going to involve the notion of a >.-system. A good reason for asserting the interest of the solution is that it makes possible the proof of Theorem 1. In an Appendix we provide a simpler proof than the previously published one of the fact that the existence of a non-free Whitehead group of cardinality N1 implies the existence of a ladder system on a stationary subset of N1 which satisfies 2- uniformization. We thank Michael O'Leary for his careful reading of and comments on this paper.
2. Preliminaries The following notion, of a >.-set, may be regarded as a generalization of the notion of a stationary set. DEFINITION
2. {1} The set of all functions
rJ:n={O, ... ,n-1}--t>. (nEw) is denoted .; the domain ofTJ is denoted i(TJ) and called the length of TJi we identify TJ with the sequence (TJ(O), 17(1), ... , TJ(n- 1)). Define a partial ordering on , by: TJ1 ::::;; T/2 if and only if T/1 is a restriction of T/2· This makes , into a tree. For any TJ = (ao, ... , an-1) E ,, TJ " (/3) denotes the sequence (ao, ... , an-b /3). If Sis a subtree of ., an element TJ of S is called a final node of S if no TJ " (/3) belongs to S. Denote the set of final nodes of S by 81. {2) A >.-set is a subtreeS of , together with a cardinal >.'1 for every 17 E S such that >.0 = >., and: (a) for all TJ E S, TJ is a final node of S if and only if >.'1 =No; {b) if TJ E S \ Sf, then TJ " (/3) E S implies /3 E >.'1, >.'1~ (13) < >.'1 and E'1 = {/3 < >.'1 : TJ " (/3) E S} is stationary in >.'1 .
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
PAUL C. EKLOF AND SAHARON SHELAH
82
{3} A A-system is a A-set together with a set B.., for each TJ
E
S such that
B0 = 0, and for all TJ E S \ Sf: {a} for all /3 E E 11 , A 11 ~(f3) ~ IB 11 ~(f3)1 < A11 ; {b) {B 11 ~(f3): /3 E E 11 } is a continuous chain of sets, i.e. if (3 ~ (3' are in E 11 , then B 11 ~(f3) s:;; B,.,~(f3')' and if a is a limit point of E 11 , then B,.,~(a) = U{B,.,~(f3): /3 ...,,B.,: TJ E S) and a node TJ of S, let 8"' = { 11 E S : TJ s; 11}. We will denote by A"' the >...,-system which is natumlly isomorphic to (8"', >..,.,, B~: 11 E 8"') where B~ = 0 and B~ = B,., if 11 =1- TJ. (That is, we replace the initial node, TJ, of 8"' by 0, and translate the other nodes accordingly.) If S = { s, : ( E Sf} is a family of countable sets based on A and ( E Sj, let s¢ = U{s~: k > i(TJ)}. LetS"'= {s¢: ( E Sj}; it is a family of countable sets based on A"~.
In order to construct a (strongly) >..-free group from a family of countable sets based on a >..-system, we need that the family have an additional property: DEFINITION 7. A family S of countable sets based on a >..-system A is said to have the reshuffling property if for every o: < >.. and every subset I of S 1 such that III < >.., there is a well-ordering .-free family of countable sets rge(rp~) ~ Bc;;tki and {b) for any functions cc;;: w ~ Z {( f : US ~ Z such that for all ( E (jEw) such that for all mEw,
then S = {sc;; : ( E Sf} based on A; in particular,
E Sf}, there is a function
Sf there are integers ac;;,i n
c.-system. Given a Whitehead group G of cardinality >. which is >.-free but not free, we begin by defining a >.-system and a family of countable sets based on the >.-system following the procedure given in [2, VII.3.4]; we review that procedure here. Choose a >.-filtration of G, that is, write Gas the union of a continuous chain
of pure subgroups of cardinality < >. such that if G I Ba is not >.-free, then Ba+l I Ba is not free. Since G is not free, E0 = {a
< >.:
Ba is not >.-pure in G}
is stationary in>.. For each a E E0, let >.a ( < >.) be minimal such that Ba+d Ba has a subgroup of cardinality >.a which is not free; >.a is regular by the Singular Compactness Theorem (see [8] or [2, IV.3.5]). If >.a is countable, then let (a)
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A COMBINATORIAL PRINCIPLE
be a final node of the tree; otherwise choose Ga that
~
85
Ba+l of cardinality Aa such
is not free. Then Ha is Aa-free, and we can choose a ..\a-filtration of Ga,
such that for all (3, (Ba,/3 Aa-pure in Ha, then
+ Ba)/ Ba is pure in Ha and if (Ba,/3 + Ba)/ Ba is not
is not free. Since Ha is not free,
Ea = {(3 < Aa: Ba,/3 + Ba/ Ba is not Aa-pure in Ha} is stationary in Aa· For each (3 E Ea, choose Aa,/3 {< ..Xa) minimal such that there is a subgroup Ga,/3 of Ba,/3+1 of cardinality Aa,/3 so that
is not free. If Aa,/3 is countable, let (a, (3) be a final node; otherwise choose a Aa,/3-filtration of Ga,/3· Continue in this way along each branch until a final node is reached. As we have just done, we will use, when convenient, the notation Ga,/3 instead of G(a,/3), etc.; thus for example we will write G.,1,6 instead of G7J~(ti)· In this way we obtain a ..\-system A = (S, ..\7J, B7J : TJ E S) where for each (E Sf, there is a countable subgroup Gt; of G such that
is not free. We can assume that for each TJ E S \Sf and each 8 E E7J, B7J,Hl
+ (B7)) =
G1],ti
+ B7J,ti + (B7J).
We can also assume that for all ( E Sf, Gt; has been chosen so that Gt; + (B 0 so that for all 'Y E E0 the cofinality of 'Y is K. and for all ( E Sf, .A< tm = K.; moreover, for each 'Y E E0 there is a strictly increasing continuous sequence {'YP : p < K.} cofinal in 'Y such that for all ( E Sf if ( {0) = 'Y then s~ = b 1 and r ~ 0. For every sequence of functions JL (JLl, ... , JLr), where /Lk : w -+ Z and every i ~ 1 there exists a function
=
Fi,p. : Zjpt;z-+ 2 and integers a;,J.L E {0, ... , p - 1} {ti-l ::; n < ti, l = 0, 1} such that Fi,p. and a;,J.L depend only on JL f ti {= (JLl f ti, ... ,JLr f ti)) and are such that whenever mo, ... , mr are integers with lmkl ::; pt;- 1 for all k::; r and a; E {0, ... ,p- 1} for j ... , 7n and don't eliminate zero types. Nevertheless, the defect (see [1]) of the system (7) is equal to zero. This means that (i) the columns
(8) generate the whole module Q(71) Ef) ... EEl Q(7n) over K, and (ii) every r-adic relation a1x1 + ... + anXn = 0, where a1, ... , an E Q(7), of the group A is a 7-combination [1] of relations (7) with uniquely determined coefficients 'Yl> ... ,f'n E Q(7), i.e.
where type('Yl)
~
7- (7 1\ 71), ... , type('Yn)
~
7- (r 1\ 7n)·
Let U be a divisible hull of the group A, i. e. U is a vector space over Q with a basis Xi> ... , Xn· Consider the dual vector space U* with the dual basis xi, ... , x~. The following mapping of this basis to the columns (8) xi 1-+ ub ... , x~ 1-+ Un determines a linear mapping g: U*-+ Q(r1) Ef) ... EEl Q(7n)· We define ~(A)= g. Let B be another torsion-free abelian group with a maximal linearly independent system Yb ... , Ym and with the following system of relations
(9)
{
f3nY1
+ ·:· ~ f3~mYm
f3m1Yl
+ ... + f3mmYm
= 0 = 0
having the following columns V1 = ( ~(B)
= h: V*
~~~
f3ml -+
) , ... , Vm = (
~~~
) E Q(al) EEl··· EEl Q(am),
f3mm
Q(a1) EEl··· EEl Q(am), where h(yi) =
Vb ... ,
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
h(y:,.) =
Vm·
FINITELY PRESENTED MODULES
117
Let f: A--+ B be a quasi-homomorphism of groups. It determines uniquely a matrix
T
= ( tu ... t1m )
.. .
tnl · · · tnm
with rational entries,
/~1
(
)
~1
= T (
fxn
)
.
Ym
According to the Criterion of quasi-homomorphism [1], the following matrix equality holds
au ....... ln (
a~l.:·~nn
"'
( 0 )
) ( fx1 )
f~n
~
.
~)
.
Hence
(
a1~
....
~ln
)
T (
anl·· .ann
~l
)
= (
0
Ym
The last equality is a collection of n relations of the group B with coefficients from Q(r1), ... , Q{rn), respectively. Each of them is a uniquely determined Ti-combination of the relations {9), i = 1, ... , n. The coefficients of the Ti-combination form the i-th row of the matrix
~
= (
'Yu · · · 'Yl m )
. . .
'
'Ynl · · · 'Ynm
where 'Yii E Q{ri) and type('Yi;) ~ Ti- (ri As in [1] we have
{10)
(
au . . . a1n ) . . . anl · · · ann
The
matrix~
T=~
1\
a;).
( f3u · · . fJ1m )
. . . f3ml · · · f3mm
determines a K-module homomorphism
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
.
118
ALEXANDER A. FOMIN
which maps an element v E Q(a1)
Ef) ... Ef)
Q(am) written as a column
to an element
cp(v)
=~
(
(31
...
)
=
(
. f3m
'/'11 0 (31 'Yn1 0 (31
+ . · · + '/'1m 0 f3m . . .
)
+ · · · + 'Ynm 0 f3m
Let f* : V* - t U* be the dual linear mapping of dual vector spaces, i. e. f* is defined by a matrix equality
(
f*.
~~i)
)
= Tt (
f*(y~)
~i.
) '
X~
where Tt is the transposed matrix. We define iP (f) diagram
r
U*
(!*, cp). Consider the
V*
+--
gl
(u1, ... , Un)K
=
lh
(v1, ... ,vm)K
The equality (10) implies the commutativity of the diagram. Indeed
gf*(Yi) = g(tlixi
+ ... + tniX~)
= tliu1
+ ... + tniUn =
L Uktki n
k=1
is the i-th column of the matrix on the left side of (10), i = 1, ... , m. Due to (10), this column is equal to~
f31i
)
. . .. = cp(vi) = cph(yi). So the desired functor iP f3mt is defined. We need only to verify that the functor iP satisfies Proposition 3.1. This is routine and may be done analogously to [1]. 0 (
COROLLARY 3.3. Let g : U - t M and h : V - t M be objects of the category of linear mappings to finitely presented modules over K. A and B are corresponding groups, i. e. iP(A) = g, iP(B) =h. Then the following statements are true:
1. lfdimU=dimV andlm(g) =lm(h), thenA~B. 2. If dimU- dimlm(g) = k > 0, then A = F Ef) C, where F is free, rank F = k, and C is coreduced, i. e. C has no free direct summands.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
FINITELY PRESENTED MODULES EXAMPLES
119
3.4.
1. The group F is a free group of rank n if and only if .)-family (>. is an infinite cardinal) in the group G means a collection g of subgroups of G such that (i) 0, G E g; (ii) g is closed under unions of chains; (iii) if B E g and X is any subset of G of cardinality :5 >.., then there is a B' E g that contains both B and X, and satisfies IB' I Bl :5 >... Manifestly, every Axiom-3 family is a G(No)-family, but the converse is false. Using ideas due to Hill [H2], one can show: THEOREM 3.1. [F2] A torsion-free group G that has a single No-prebalanced chain from a pure subgroup A to G admits an Axiom-3 family over A of No-prebalanced subgroups. 0 By making use of the observation that every pure subgroup of a completely decomposable group, whose typeset has cardinality ,.+, admits a ,.-prebalanced chain, one can easily show that, in the presence of CH, pure subgroups of completely decomposable groups admit No-prebalanced chains. One can also derive the following result. THEOREM 3.2. [F2] If there is a ,_+ -prebalanced chain from a pure subgroup A of a torsion-free group G to the group G itself, then in a relative balanced-projective resolution 0 --+ B --+ A EB C --+ G --+ 0 (where C is completely decomposable) the group B admits a ,.-prebalanced chain. 0 Our primary concern is when ,. = N0 , in which case (3.2) can be improved, and we get the following most useful result. THEOREM 3.3. [F2] There is an No-prebalanced chain from a pure subgroup A of a torsion-free group G to G itself if and only if in a relative balanced-projective resolution 0 --+ B --+ A EB C --+ G --+ 0 (where C is completely decomposable), B is a B2-group. 0 It is routine to verify that the condition that B be a B2-group is independent of the particular choice of the relative prebalanced resolution in the theorem.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A SURVEY OF BUTLER GROUPS OF INFINITE RANK
127
The last theorem does not hold (in ZFC) for 11:-prebalancedness for uncountable 11:. In fact, if 2No ~ N3 , then (9.3) infra yields a corank one pure subgroup G of a completely decomposable group that has no N1-prebalanced chain, but the kernel of its balanced-projective resolution admits an No-prebalanced chain. The special case A = 0 in the preceding theorem leads at once to an important criterion we have been looking for: CoROLLARY 3.4. A torsion-free group G admits an No-prebalanced chain if and only if in a balanced-projective resolution 0 -+ B -+ C-+ G-+ 0 of G (where C is completely decomposable) the subgroup B is a B2-group. 0 The crucial lemma is the following whose proof involves relative balancedprojective resolutions. It is used in the proof of (11.1). LEMMA 3.5. [BF2] Suppose 0 -+ T -+ G -+ A -+ 0 is a balanced-exact sequence where T is a torsion group. If A is a subgroup in a torsion-free group B such that there is an N0 -prebalanced chain from A to B, then there exists a commutative diagram with balanced-exact rows
o-T-G-A-o
II
1
1
o-T-H-B-0.0 4. B1-groups with RQ-prebalanced chains From the very definition of B2-groups it is clear that every B2-group admits a (prebalanced, and hence an) No-prebalanced chain. It turns out that this property alone characterizes B 2-groups within the class of B1-groups- no matter what model of ZFC is chosen.
THEOREM 4.1. [F2] A B1-group is a B2-group if and only if it admits an No-
prebalanced chain. 0
It is worth while mentioning the following result which is, in a certain sense, a generalization of (4.1).
CoROLLARY 4.2. [BF2] If a B2-group A is a pure subgroup of a B1-group G such that there is an No-prebalanced chain from A to G, then G is a B 2-group, too. 0 Let A be an infinite cardinal. A continuous well-ordered ascending chain of subgroups of G, 0 = Go < ... < Ga < Ga+l < ... with union G, will be called a A-filtration of G if the cardinalities of the quotients Ga+dGa do not exceed A for any a. From (4.1) it is readily seen that a B 1-group that admits an N1-filtration with (pre)balanced subgroups is actually a B2-group. Hence and from (3.2) it is straightforward to derive the main result in FuchsRangaswamy [FR1], which uses an algebraic, rather than a set-theoretic, condition to ensure that B1-groups are B2-groups: THEOREM 4.3. [FR1] Let G be a B1-group which is the union of a continuous well-ordered ascending chain of pure subgroups Ga. If each Ga has a countable typeset, then G is a B2-group. 0 In the next three corollaries we assume that CH holds. This hypothesis is needed to guarantee that the set of all types has cardinality N1, which fact is essential in the proofs.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
128
L. FUCHS
COROLLARY 4.4. [FR1] (CH) A pure subgroup of a completely decomposable group is a B2-group if and only if it is a B 1 -group. 0
The terminologies for Bt- and B2-groups have been chosen in the right way as is shown by the next corollary which follows from (3.4) and (4.4) at once: CoROLLARY 4.5. [R1] (CH) A torsion-free group B is a B 2-group if and only if both Bext 1 (B, T) = 0 and Bext2(B, T) = 0 for all torsion groups T. 0
From (3.4) we can easily derive: CoROLLARY
4.6.
(CH)
exactly ifBext 2(G,T)
A torsion-free group G admits an N0 -prebalanced chain
= 0 for all torsion groups T. 0
The next simple result is most useful in proofs in which fine distinction has to be made between the Bt- and B2-properties. LEMMA 4. 7. [R1], [F2] Suppose that 0 -+ H -+ C -+ G -+ 0 is a balanced-exact sequence where C is a B2-group and H, G are B 1 -groups. If one of H and G is a B2-group, then so is the other. 0
Another corollary which is worth while recording is as follows: COROLLARY 4.8. (F2] If B is a B2-group, then Bexti(B, T) for all torsion groups T. 0
= 0 for all i
~ 1 and
By a long balanced-projective resolution of the torsion-free group G we mean a long exact sequence
0 -+ I.. We state this key lemma in order to illustrate the idea of proof of (9.1).
LEMMA 9.2. [FMa] (V = L) Let G be a torsion-free group, A and Hm (m < w) 0). Suppose pure subgroups ofG such that Hm and A+Hm are balanced in G (Ho thtzt IAI .x+ where erA w. There are pure subgroups Aa(a < ,X+) in A, pure subgroups A~ (n < w) in each Aa, and in case cfa = w, pure subgroups A~k (k < w) of A~ such that
=
=
=
(a) for all (3 < a < .x+, Ap :5 Aar; Aa = UP< a Ap if a is a limit ordinal; A= Uar.+ Aa;
(b) for every n < w, A~ :5 A~+l
=
and Aa Un 1 is due to Albrecht and Hill [AH] who proved that Bext 2(G, T) = 0 for all torsion-free groups G of cardinality ~ N1 and for all torsion groups T. In addition, they proved that CH implies Bext3 (G, T) = 0 for all torsion-free groups G. These results have been extended to torsion-free groups of higher cardinalities in Fuchs [F2] provided that for some integer n > 1, Nn is assumed to be the continuum. By induction on the index i it is easy to verify the following lemma: LEMMA 10.1. [F2] For all torsion-free groups G of cardinality~ for all torsion groups T, we have
Ni (i ~ 1) and
Bexti+k(G,T) = 0 for k = 1,2, .... D This lemma can be used to derive the following conclusion which yields the above mentioned Albrecht-Hill result in the most important case n = 1. THEOREM 10.2. [F2] lf2No = Nn for an integer n ~ 1, then Bextn+k+ 1 (G,T)=O (k= 1,2, ... ) for all torsion-free groups G and torsion groups T. D
It would of course be most desirable to know how sharp this theorem is. In this connection, we conjecture that if 2No = Nn for an integer n ~ 1, then Bextn ( G, T) :f: 0 must hold for some torsion-free group G and some torsion group T. (This statement is certainly true for n 1 and n = 2.) There are no results known similar to (10.2) if the continuum is equal to Na for some a~ w.
=
11. Subgroups of B2-groups
We have come to the discussion of the important problem as to when a pure subgroup of a 8 2-group is again a 82-group. The conditions considered in earlier publications as candidates to ensure that !!pure subgroup inherits the 82-property were in terms of generalized purity. For instance, Hill-Megibben [HM] pointed out that a completely decomposable pure subgroup of a torsion-free group G ought to be separative, though this property was not sufficient even if G itself was completely decomposable. Bican-Fuchs [BF2] have shown that if CH is assumed, then N0 -prebalancedness is a necessary condition for a subgroup of a 82-group to be again a 82-group. Fortunately, it is possible to establish a necessary and sufficient condition - without additional set-theoretical hypotheses - provided that chains are taken into consideration from the subgroup up to the group itself. The main result is the following theorem which gives a satisfactory answer to the subgroup problem. THEOREM 11.1. [F2] For a pure subgroup A of a 82-group G the following are equivalent: (i) A is a 82-group; (ii) there is an N0 -prebalanced chain from A toG; (iii) there is a continuous well-ordered ascending chain of 82-subgroups from A to G with rank 1 factors. D
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A SURVEY OF BUTLER GROUPS OF INFINITE RANK
135
Since there is always an No-prebalanced chain from an No-prebalanced subgroup of index 5 N1 to the group itself, we see that in any' B2-group, a pure subgroup of index 5 N1 is a B 2-group exactly if it is an No-prebalanced subgroup. A noteworthy idea of Albrecht and Hill [AH] is the notion of absolutely separative groups, i.e. groups that are separative in every torsion-free group that contains them as pure subgroups. They show that a torsion-free group which has a s~called balanced cover for its countable subgroups is absolutely separative, and conclude that separative subgroups in direct sums of countable B2-groups are absolutely separative. The same idea, applied to No-prebalancedness, unveils an interesting property of B 2-groups. We say that a torsion-free group A is absolutely No-prebalanced if A is N0-prebalanced in every torsion-free group B in which it is contained as a pure subgroup. Clearly, all countable torsion-free groups are absolutely No-prebalanced. We are interested in a more exciting example of absolutely No-prebalanced groups: THEOREM 11.2. [BF2], [R2] B2-groups are absolutely No-prebalanced. 0 The next corollary is an analogue of Theorem 5 by Dugas-Rangaswamy [BR] which follows from the fact that a homogeneous B2-group is completely decomposable: COROLLARY 11.3. A necessary and sufficient condition for a homogeneous pure subgroup A of a B 2-group B to be completely decomposable is that there be an Noprebalanced chain from A to B. 0 It is an open question whether or not the results of this section are valid if B2groups are replaced by B1-groups.
12. Unions of chains of B2-groups
Several theorems in abelian group theory are concerned with unions of continuous chains of pure subgroups of free groups. The classical theorem by Pontryagin on countable torsion-free groups has been considerably extended by P. Hill [H1] by showing, inter alia, that the union is itself free whenever the chain is of countable length, no matter what the cardinality of the union is. It is natural to raise a similar question for B 2-groups. It is not difficult to verify by using an Axiom-3 system of decent subgroups that the answer is analogous: THEOREM 12.1. [FR3] If a torsion-free group G is the union of a countable ascending chain 0 = Go < G1 < ... < Gn < . . . of pure subgroups, each of which is a B2-group, then G itself is a B2-group. 0 The same question for B 1-groups is still open. A consequence of the last result fills a gap in the proof of Corollary 6.3 by DugasHill-Rangaswamy [DIIR]. COROLLARY 12.2. [FR3] Let A be a singular cardinal of cofinality w, and G a torsion-free group of cardinality A. If every subgroup of G whose cardinality is < A can be embedded in a pure B2-subgroup of G whose cardinality is < A, then G itself is a B2-group. 0 It should be observed that for chains whose lengths are > w, (12.1) is no longer valid without additional hypotheses. We refer to Fuchs-Rangaswamy [FR3] for chains of length w1.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
136
L. FUCHS
13. Torsion-free extensions of B2-groups by p-groups
'nuning from structural problems to other questions concerning B2-groups, let us start mentioning the characterization of those p-groups by which all the torsion-free extensions of B2-groups are again B2-groups (Fuchs-Rangaswamy [FR2]). This problem has its origin in a question investigated for free groups by several authors, most extensively by Dugas and Irwin [DI]. Let G be a torsion-free group, and B a subgroup of G such that G I B = T is a p-group. The problem consists in characterizing those p-groups T for which G is necessarily free whenever B is free. Dugas and Irwin succeeded in describing how this class of p-groups can be built up from groups of smaller cardinalities. It is important to know that the countable p-groups in this class are precisely the reduced ones. It turns out that a more natural setting for this question is the class of B2-groups rather than free groups. In fact, the class of p-groups T remains unchanged even if the question is widened from free groups to B2-groups. Following Dugas-lrwin [DI], we define a class gP of p-groups recursively. Let a countable p-group T belong to gp if and only if it is reduced. A p-group T of regular cardinality "' should belong to gP if and only if there is a continuous well-ordered ascending chain O=To 0 and i is odd, or if Mn(a1,{3) · · · Mn(a;,{J) < 0 and i IS
even;
b) (x,y;,f3,Mn(ao,f3)+1,{3,1) and (x,y;,f3,Mn(ao,f3)+2,{3,Mn(a;,{3)+1) if Mn(a1 ,{3) .. · Mn(a;, {3) < 0 and i is odd, or if Mn(al, {3) · · · Mn(a;, {3) > 0 and i 1s even. For i = m, the points to be added are c) (x,ym,f3,1,{3,1) and (x,yn,f3,Mn(ao,f3)+1,{3,Mn(am,f3)+1) if Mn(al, {3) · · · Mn(am, {3) > 0 and m is odd, or if Mn(at, {3) · · · Mn(am, {3) < 0 and
m is even;
d) (x,ym,f3,1,{3,1) and (x,ym,f3,Mn(ao,f3)+2,{3,Mn(am,f3)+1) if Mn(at,{3) .. ·Mn(am,f3) < 0 and m is odd, or if Mn(ai,f3) .. ·Mn(am,f3) > 0 and ntIS even. If m then we add the points (x,yo,f3,Mn(ao,f3) + 1,f3,Mn(ao,f3) + and
= 0,
( x, Yo, {3, 1, {3, Mn(ao, {3)
1)
+ 1).
3.1 Remark: We note that although the passage from 8n-1 X (K X w) 2 to Tn involves the loss of some points, and that from Tn to 8n the addition of others, these transitions are relatively conservative. For example, suppose that x E (K x w )n and y E (K x w)n are such that (x, y) E 8n_ 1; an easy compactness argument shows that there is somes E Xn-1 such that Pn-1(s) = x and qn-1(s) = y. This completes the construction. We now consider the partitions of Un given by n~
= {p;;- 1 (x) nUn
E
(K 1 n~ = { q;;- (y) nUn : y E (K :X
wt+ 1) X wt+ 1 ) X
p;;- 1(x) nUn# 0} q;;- 1(y) nUn# 0}.
It is not hard, although admittedly awkward, to verify that the pair (ll~, ll~) forms a K-fold staircase. In general, the flights of the staircase are given by 8~ x (K x w x K x w)w-n- 1 for {3 < K. We now define the groups and homomorphisms relevant to our direct limit construction. If 'Dis a field on a set X, and A ~X, then 'D(A) = {AnD : D E 'D} is the trace of 'D on A. We put
H~ = H(An(Un),13n(Un)) Gn
= H(An-l(Un), 13n-1(Un))
Kn
= H(An(Xn),13n(Xn)).
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
R. G. GOBEL AND R. M. SHORTT
152
Referring to the construction of Un and Xn, we see that since the pair of partitions (II~, II~) of Un form a /\:-fold staircase, we have H~ ~ Hn ~ z(~ 0 for an infinite number of primes. We have Ext(Z(pr,),G) =/= 0 for these primes and 1Ext(Z(p00 ),G)I 2:: 2No in the first case. Hence IIIpExt(Z(pr,, G) I 2:: 2No in any case and this product cannot be an epimorphic image of a countable group. From Salce [Sa], Theorem 3.5 we derive that G cannot be cotorsion with respect to any non-trivial rational cotorsion theory. Recall that in the trivial cotorsion-theory cogenerated by l, all groups are cotorsion. Obviously E+ is free over EndG E+; hence ExtE(E, G) = 0 and the following easy homological argument gives Extz(E, G)= ExtE(E, G). If 0 --:--+ F 1 ~ F 2 ~ E+ ~ 0 is a free Z-resolution, then we have a commuting diagram
=
=
=
=
~
Extz(E,G)
~
0
~
ExtE(E,G)
~
0
giving the isomorphism between Extz and ExtE. Therefore Extz(E, G) = 0 and G is cotorsion with respect to E. Finally recall that E is one of the group realized as H(A, 'B) in the first part of this paper. §6. References [BhS] Bhaskara Rao, K. P. S. and Shortt, R. M., Group-values charges: common extensions and the infinite Chinese remainder property, Proc. AMS 113 (1991) 965-972
[Fa] Faticoni, T. G., Each countable reduced torsion-free commutative ring is a pure subring of an E-ring, Comm. in Algebra 15 (1987) 2545-2564 [FrG] Franzen, B. and Gobel, R., The Brenner-Butler-Corner theorem and its application to modules, in Abelian Group Theory, Gordon and Breach, London 1987, pp. 209-227
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
SOME TORSION-FREE GROUPS ARISING IN MEASURE THEORY
157
[Fu] Fuchs, 1., Infinite Abelian Groups, Vols. I and II, Academic Press, New York 1973 [GoN] Gobel, R. and Nay, W., Independence in completions and endomorphism algebras, Forum mathematicum 1 (1989) 215-226 [GoS] Gobel, R. and Shortt, R. M., Algebraic ramifications of the common extension problem for group-values measures, Fundamenta Math., to appear [RaR] Rangaswamy, K. M. and Reid, J. D., Common extensions of finitely additive measures and a characterization of cotorsion Abelian groups, in Abelian Groups, Proc. of 1991 Curarao Conference, M. Dekker, New York 1993, pp. 231-239 [Sa] Salce, 1., Cotorsion theories for abelian groups, Symposia Mathematica 23 (1979) 11-32 [Sh] Shelah, S., Infinite abelian groups, Whitehead problem and some constructions, Israel Journal of Math. 18 (1974) 243-256
R. Gobel University of Essen, Essen, Germany R. M. Shortt Wesleyan University, Middletown, Connecticut, USA
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
This page intentionally left blank
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
http://dx.doi.org/10.1090/conm/171/01771 Contemporary Mathematics Volume 17'1, 1994
Numerical Invariants for a Class of Butler Groups H. PAT GOETERS, WILLIAM ULLERY AND CHARLES VINSONHALER Dedicated to the Memory of R. S. Pierce
Suppose A~, A2, ... , An (n ~ 2) are nonzero subgroups of the additive group of rationals Q. The cokernel of the diagonal embedding 1 m. Thus for j > m there are indices a(j), {3(j) :::; m such that a(Yj n Xl) ~ Va(j) and b(Yj n Xl) ~ V.au>· There is a natural embedding r t-+ {r1. ... , rk) of R(Vb ... , Vk) into T(Vt) x · · · x T(Vk), where Tj denotes the value of ron Yj. The image of this embedding consists of
for all j > m. {There those k-tuples {rb ... 'rk) such that Tj = ( ur~(j) ur~(j)) are no restrictions on Tj for j :::; m since for such j either Yj n X 11 # 0 or Yj ~ X 2.) Consequently, the natural projection
(t) is an isomorphism, and therefore R(Vi, ... , Vk) is matricial.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
K.R.GOODEARL
196
Now consider any finite list of elements c1, ... , em E R. Let n( i) be the number of distinct values of Ci; then X = wil u ... u wi,n(i) for some pairwise disjoint nonempty clopen subsets Wit on which Ci is constant. Since ( uc;;(s) uc;~(s))
=
ci(s) is constant for s E Wit n X1, we see that cia and cib are constant on w;,t n X1, whence a(Wit n Xt) ~ Wi,t' and b(Wit n Xt) ~ Wi,t" for some t', t". Let J = {j: {1, ... ,m} ~ N I j(i)::; n(i) for all i}.
n:,
The sets Vj = 1 Wi,j(i) for j E J form a special decomposition of X, and Ct, ... ,em all lie in R(Vj I j E J). This verifies the claim above. In particular, it follows that R is a locally matricial F-algebra. Evaluation at any sEX defines a homomorphism R ~ M2(F), from which we obtain a pseudo-rank function N 8 on R such that N 8 (r) = ~ rankr(s) for all r E R. Let ¢>8 be the corresponding state on (Ko(R), [R]), and observe that s([eRn]) = ~ ranke for any idempotent matrix e E Mn(R). In particular, ¢> 8 is a morphism from (K0 (R), [R]) to {{1/2)Z, 1). The maps s induce a morphism¢>: (K0 (R), [R]) ~ ({1/2)zx, 1). Consider any element e E R. Since e is locally constant on X, so is the function ¢>([eR]). For s E Xu, we have e(s) E T8 = F · 12, whence ranke(s) E {0, 2} and so ¢>([eR])(s) E {0, 1}. Note also that ¢>([eR])(s) = ~¢>([eR])(a(s)) + ~¢>([eR])(b(s))
= b(s) = s.
because a(s)
rank_e(s)
ForsE X12, we have e(s)
= ( ue~(s)
ue~(s))
and so
= rankaea(s) + rankaeb{s) = ~ rankea(s) + ~ rankeb(s).
Thus ¢>([eR])(s) = ~¢>([eR])(a(s)) + ~¢>([eR])(b(s)) in this case also. This shows that ¢>([eR]) E L. Since Ko(R) is generated by the classes [eR] for e E R, it follows that ¢>(Ko(R)) ~ L. Thus we may now view¢> as a morphism from (Ko(R), [R]) to (L, 1). Any c E ker ¢> can be expressed in the form c = [eRn] - [f Rn] where e and f are idempotent matrices in some Mn(R). There exists a special decomposition X = V1 U U Vk such that e and f are constant on each Vj From ¢>(c) = 0 it follows that ranke{s) = rankf(s) for all s E X, and hence e(s)T(Vj)n ~ f(s)T(Vj)n whenever s E Vj. Since the matricial algebra Q = R(V1 , Vk) is a direct product of some of the T(Vj)'s, we conclude that eQn ~ fQn, whence eRn ~ f Rn and so c = 0. Therefore ¢> is injective. It remains to show that ¢>(K0 (R)+) = £+. Since£+ is generated as a monoid by its unit interval [0, 1], it suffices to show that any p E L satisfying 0 ::; p ::; 1 is in ¢>(K0 (R)+)o By Lemma 7.4, there is a special decomposition X= Vi U· oUVk such that p is constant on each Vj. As above, we may assume that there is an index m ::; k such that those indices j for which Vj n Xu is empty while Vj n X 12 is nonempty are precisely the indices j > m. Let p 3 denote the value ~f p on Vjo If j ::; m and Vj n Xu is nonempty, then p3 E {0, 1}, and we choose e3 E F 12 = T(Vj) with ranke3 = 2Pj· If 0
•
o
o
0
••
,
o
o
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
Ko OF REGULAR RINGS WITH BOUNDED INDEX
197
l.'J n Xu is empty, then l.'J ~ X2 and Pi E {0, !, 1}; we choose ei E M2(F) = T(ltj) with rankei = 2Pi· In view of the isomorphism (t), there exists e E R(Vi, ... , Vk) such that e(s) = ei for j = 1, ... , m and s E ltj. Hence, c/>([eR]) = p on V1 U · · · U Vm. Given j > m, there exists s E l.'J n X12, and a( s) E V~:r and b( s) E V13 for some a, (3 ~ m. Hence,
j ~ m and
cf>([eR])(s) = !ct>([eR])(a(s)) + !ct>([eR])(b(s)) = !pa(s)
+ !pb(s)
= p(s).
Since cf>([eR]) and pare constant on l.'J, we conclude that they agree there. Thus cf>([eR]) = p, which completes the proof that cf>(Ko(R)+) = L +. Therefore cf> is an isomorphism of (K0 (R), [R]) onto (L, 1). D We conclude with an example showing that the functions a and b in Theorem 7.2 cannot always be chosen to be continuous. This example is based on the existence of boolean spaces which do not admit "continuous symmetric selection functions", as follows. We are indebted to George Bergman for discovering such spaces, and for permission to include the following particular case here. PROPOSITION 7.6. [Bergman] There exists a boolean spaceY which does not admit any continuous function!: YxY---+ Y such thatf(y,z) = f(z,y) E {y,z} for ally, z E Y.
Let Y be the Stone-Cech compactification of an infinite discrete space The closure in Y of any subset of Yo is homeomorphic to its Stone-Cech compactification; in particular, the closure in Y of any infinite subset of Yo is uncountable. Suppose there exists a continuous function f : Y x Y ---+ Y as described. Define a relation ~ on Y by .decreeing that y ~ z if and only if f(y, z) = y. It follows from the assumptions on f that this relation is reflexive and antisymmetric, and that any two elements of Y are comparable. Even though ~ is not necessarily transitive, we shall treat it in the manner of a partial ordering. Observe that if a, b, c E Y are any three elements such that either a ~ b, c or a ~ b, c, then ~ is transitive on the set {a, b, c}. We next build an infinite subset of Yo on which ~ is transitive. To start, choose any Yo E Yo. Since Yo is comparable with all elements of Yo, it must be either < infinitely many or > infinitely many. Hence, there is an infinite set Y1 ~ Yo\ {yo} such that either Yo < y for ally E Yi. or Yo > y for ally E Y1. Similarly, if we choose Y1 E Yi. then there is an infinite set Y2 ~ Y1 \ {y1} such that either Y1 < y for ally E Y2 or Y1 > y for ally E Y2. Continuing by induction, we obtain an infinite sequence of distinct elements y0 , Y1> • • • E Yo such that for each i, either Yi < Yi for all j > i or Yi > Yi for all j > i. It follows from the remark above that~ is transitive on any 3-element set {yi,Yi,Yk}, and therefore ~ is transitive on the set Z = {yo, Y1 , Y2, ... } . Now (Z, ~) is an infinite totally ordered set. It cannot satisfy both ACC and DCC, and so Z must have an infinite subset N such that (N, ~) is either order-isomorphic or order-antiisomorphic to the ordinal w. PROOF.
Yo.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
19~1
K.R.GOODEARL
Since N ~ Yo, its closure N is uncountable. Pick two distinct points ZI, z2 E N \ N. Either ZI < z2 or ZI > z2, say ZI < z2. Thus f(zi, z2) = ZI· Choose
disjoint open sets UI, u2 ~ y such that each Zi E ui. Since f is continuous, there exists an open set V ~ Y x Y such that (zb z2) E V ~ f-I(UI)· There is no loss of generality in assuming that v is a basic open set of the form Vt X v2 where the Vi are open subsets of Y. After replacing the Vi by Vi n Ui, we may also assume that each Vi ~ ui. Given any points Vi E Vi, note that f (VI, V2) E UI and so f (VI , v2) fJ. V2, whence f (VI, v2) = VI . Therefore VI < v2 for all Vt E Vi and V2 E l/2. Finally, note that since each Vi meets N \ N, the sets Vi n N must be infinite. But this is impossible, since neither w nor its order-dual contains infinite sets Wt, w2 such that WI < W2 for all Wi E wi. This contradiction establishes the proposition. D EXAMPLE 7.7. There exist a boolean space X, closed subsets X1 functions a, b: XI ---+Xu such that:
2 Xu, and
(a) a= b =identity on Xu and the composition ~Xu o(a, b) :XI ---+ 'PI,2(Xu) is continuous. ~Xu
(b) There do not exist any continuous functions a', b' : XI ---+Xu such that o (a', b') =~Xu o (a, b). (c) X\ XI is dense in X.
PROOF. Let y be as in Proposition 7.6, and set XI = 'PI,2(Y). Let N = N U {oo} be the one-point compactification of N, and set X =XI x N. Then X is a boolean space, XI X {00} is a closed subspace homeomorphic to XI, and X\ (XI X {oo}) is dense in X. We identify XI with Xt X {oo}. Let Xu be the collection of one-point subsets of Y. Then Xu is closed in Xll and there is a homeomorphism a : Y---+ Xu given by the rule a(y) = {y}. Choose functions ao,bo: XI---+ y such that X= {ao(x),bo(x)} for all X E XI. Then a = aa0 and b =abo are functions from XI to Xu such that a = b = identity on Xu and x = a(x) U b(x) for all x E X1. Moreover, ~Xu o (a, b) coincides with the map from X1 to 'PI,2(Xu) induced by a, whence ~Xu o (a, b) is a homeomorphism. It remains to prove part (b). Suppose, to the contrary, that ~Xu o (a, b) = ~Xu o (a', b') for some continuous functions a', b' : X I ---+ XU· It follows that x = a(x) U b(x) = a'(x) U b'(x) for all x E X1. and so a-Ia'(x) E x for all x E XI. But then f = a-Ia'~y : Y x Y ---+ Y is a continuous map such that f(y, z) = f(z, y) E {y, z} for all y, z E Y, contradicting Proposition 7.6. Therefore part (b) is proved. D If the data from Example 7.7 are used in Theorem 7.3, we obtain a Riesz group L with an order-unit 1 of index 2, to which Theorem 7.5 cannot be applied. Therefore we leave as an open problem whether there exists a regular ring R of index 2 such that (K0 (R), [R]) ~ (L, 1).
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
Ko OF REGULAR RlNGS WITH BOUNDED INDEX
199
REFERENCES
1. W. D. Burgess and J.-M. Goursaud, Ko d'un anneau dont les localises centroux sont simples artiniens, Canad. Math. Bull. 25 (1982), 344-347. 2. W. D. Burgess and W. Stephenson, Pierce sheaves of non-commutative rings, Communic. in Algebra 4 (1976), 51-75. 3. A. B. Carson, Representation of regular rings of finite index, J. Algebra 39 (1976), 512526. 4. - - - , Homogeneous direct summands of regular rings of finite index, Communic. in Algebra 10 (1982), 1361-1368. 5. K. R. Goodearl, Von Neumann Regular Rings, Pitman, London, 1979; Second Ed., Krieger, Melbourne, FL, 1991. 6. ___ , Metrically complete regular rings, Trans. Amer. Math. Soc. 272 (1982), 275-310. 7. - - - , Partially Ordered Abelian Groups with Interpolation, Surveys and Monographs 20, Amer. Math. Soc., Providence, 1986. 8. K. R. Goodearl and D. E. Handelman, Homogenization of regular rings of bounded index, Pacific J. Math. 84 (1979), 63-78. 9. K. R. Goodearl, D. E. Handelman, and J. W. Lawrence, Affine representations of Grothendieck groups and applications to Rickart C*-algebms and No-continuous regular rings, Memoirs Amer. Math. Soc. No. 234 (1980). 10. J. Hannah, Homogenization of regular rings of bounded index, II, Pacific J. Math. 94 (1981), 107-112. 11. I. Kaplansky, Topological representations of algebms. II, Trans. Amer. Math. Soc. 68 (1950), 62-75. 12. M. Kutami, Projective modules over regular rings of bounded index, Math. J. Okayama Univ. 30 (1988), 53-62. 13. E. Pardo, On a density condition for Ki[ of von Neumann regular rings, Communic. in Algebra 22 (1994), 707-719. 14. R. S. Pierce, Modules over commutative regular rings, Memoirs Amer. Math. Soc. No. 70 (1967). DEPARTMENT OF MATHEMATICS, UNIVERSITY OF CALIFORNIA, SANTA BARBARA, CA
93106
E-mail address: [email protected]
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
This page intentionally left blank
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
http://dx.doi.org/10.1090/conm/171/01773 Contemporary Mathematics Volume 1 Tl, 1994
Torsion in Quotients of the Multiplicative Group of a Number Field DARREN HOLLEY AND ROGER WIEGAND March 2, 1994 Dedicated to the memory of Richard S. Pierce, who was Wiegand's advisor, mathematical colleague and friend.
ABSTRACT. Let E and F be subfields of the algebraic number field K. We show that the torsion subgroup of K* / E* F* is finite. The analogous result for three subfields is false.
Let K I k be a finite separable extension, and let E and F be intermediate fields. We are interested in the structure of the group r = K* IE* F*' where L* denotes the multiplicative group of the field L. We allow the possiblity that E = F, but we always assume that neither E nor F is equal to K. It is known that r is always non-trivial. In fact r has infinite torsion-free rank unless k is an algebraic extension of a finite field. {See [W, {1.2)], [GW, (5.3)] and [GW, {1.12)] for proofs of these facts.) The torsion subgroup of r, however, is rather small. We show that r has a bounded subgroup A of exponent dividing the degree [L: k], where Llk is the Galois closure of Klk, such that riA embeds in a direct product of finitely many copies of L *. If k has characteristic 0, the group A is in fact finite. It follows immediately that the torsion subgroup of r is finite if K is an algebraic number field. {More recently, [CGW], the subgroup A has been shown to be trivial in all characteristics.) Both properties {infinite rank and finiteness of the torsion) can fail in the case of three intermediate fields. For example, let E 1 , E 2 and E 3 be the three proper intermediate fields for the extension KIQ, where K = Q(\12, i). In this 1991 Mathematics Subject Classification. Primary 11R32, 12F10; Secondary 13A15. Key words and phrases. Multiplicative group, Picard group, algebraic number field. The research of the second named author was partially supported by a grant from the National Science Foundation. This paper is in final form and will not be submitted elsewhere. @ 1994 American Mathematical Society 0271-4132/94 11.00 + S.25 per page
201
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
202
DARREN HOLLEY AND ROGER WIEGAND
case K* IEiE2E3 is an infinite elementary abelian 2-group. (See [GW, {1.2}, {1.5)].) Our approach is to view the group r = K* IE* F* as the Picard group of a certain one-dimensional affine domain Rover k. When we tensor this domain with the Galois closure Llk, the affine curve corresponding toR breaks up into a union of lines, and a straightforward matrix argument shows that the Picard group of L ®k R is isomorphic to a direct product of copies of L. The kernel A of the map Pic(R) ---+ Pic(L ®k R) is a bounded torsion group whose exponent divides the degree [L: k]. The main result of [W] then implies that A is finite if [L: K] is prime to the characteristic of k. Let Llk be a finite Galois extension with Galois group G, and let F ~ K be intermediate fields. We want to examine carefully what happens to the inclusion F---+ K when we change rings by applying L ®k ( ). Let r = [F : k], s = [K : F],m=rs= [K:k]. Write F = k(u) ~ k[X]I(f), where f E k[X] is the minimal polynomial for u. Then L ®k F ~ L[X]I(f) ~ LT. The isomorphism L ®k F ---+ U takes 1 ® u to (ut. ... , ur), where the Ui are the roots off in L. In order to describe this isomorphism canonically, we choose right coset representatives fh, ... , Or for Gal(LIF) in G. Then the isomorphism L ®k F ~ Lr takes 'Y ®a to the r-tuple ("ya 0;). Thus, the "change of rings" map F---+ Lr takes a to the r-tuple (a 0;). Next, let f/>t, ... , r/Js be right coset representatives for Gal(LI K) in Gal(LI F). Then them elements r/Ji{}i are right coset representatives for Gal(LI K) in G, and we have the isomorphism L ®k K ~ Lm taking 'Y ® {3 to them-tuple ("yf3i 0i ). The change of rings map K---+ Lm takes {3 to them-tuple (f3i 0; ). When we make the identifications L ® F ~ Lr and L ® K ~ Lm, the map U ---+ Lm induced by the inclusion F ---+ K takes the r-tuple ("fGO;) to the mtuple ("yaiO; ). Since a..G is reduced for every limit ordinal >.. Since the pet-injective groups are cotorsion, it makes sense that there is some relationship between them and this condition. THEOREM 14. Suppose>. is a limit, a=>.+ 'Y and G is pet-injective. Then
p1 B>..G=O. PROOF. There is a p>..-pure sequence
0 ~ Glp>..G ~ Ext(H>.., G)~
0.
Ext(T>.., G)~
As in the proof of Lemma 4, there is an embedding of L>..G in Ext(H>..G) which determines an embedding of E>..G in Ext(T>.., G), and E>..G ~ p>.. Ext(T>.., G). Therefore, p'Y E>..G ~pet Ext(T>.., G)= 0, proving the result. In fact, this last result can be viewed as a new way to see that every petinjective is cotorsion. It might be tempting to conjecture that the converse of this result is valid, i.e., if p"~ E>..G = 0 whenever a = >. + "(, then G is petinjective. However, this is false. If pwG and GlpwG are algebraically compact, then E>..G = 0 for all>.. However, such a group may fail to be pw 2-injective. Using terminology from [10], A and Bare AlB-isomorphic if there is a homomorphism A ~ B whose kernel and cokernel are bounded. The terminology comes from the notion of a quotient category, where A denotes the category of abelian groups and B denotes the subcategory cOnsisting of the bounded groups. Of course, this property is symmetric. We will say G is p< 00 -injective if it is p"-injective for some a. The following relates these two notions. THEOREM 15. The reduced p vbn ~ {vb1, ... , vbn}. By virtue of {V3), xbn E G + E~=1 Zbi will thus imply xbn E G. If this is the case, then G + E~ 1 Zbi is closed under x, and we let our sequence end with bn. If G + Zxbn is a nontrivial rank preserving extension of G then we set bn+ 1 := xbn and 9n+1 := 0. Then vbn+l = vxbn > vbn. Note that in this case again, 9n+1, bn+1 and vbn+l are uniquely determined by xbn. This in turn is, up to the sign, uniquely determined by vbn. Hence, vbn+l is uniquely determined by vbn and thus by b. The nonzero elements b1 , ... , bn have different values fJ. vG = v(G + Zbn+1) which shows that every element d of G + E~~ 1 1 Zbi has value either in vG U { oo} or equal to vbi for some i :::; n. Hence by virtue of (CV3), x(G + E~~1 1 Zbi) = x(G + E~=1 Zbi) c G + E~1 1 Zbi. Consequently, the group G + E~~ 1 1 Zbi is closed under x, and we let our sequence end with bn+1·
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
FRANZ-VIKTOR KUHLMANN
234
If the extension is not rank preserving, then there is an element 9n+l E G such that v(xbn- 9n+1) f/. vG U {oo} and we set bn+1 := xbn- 9n+1· We find that vbn+l = v(xbn - 9n+1) 2:: vxbn > vbn since otherwise, v(xbn - 9n+l) = V9n+ 1 E vGU{oo} by (V3). (Note that it is precisely the 2::-sign in the foregoing inequality that makes it impossible to construct analogous sequences with strictly decreasing values in centrifugal precontraction groups.) Again by Lemma 2.6, vbn+1 is uniquely determined by xbn; as before, it follows that vbn+1 is uniquely determined by b. All elements b1 , ... , bn+ 1 have different values f/. vG U {oo}, so every element d of G + L:~,;t 1 1 Zbi has value either in vG U {oo} or equal to vbi for some i:::; n + 1. If vd = vbn+1 then xd = ±xbn+l by (CV2). Otherwise, xd E x(G + 2.:~= 1 Zbi) c G + 2.:~= 1 Zbi + Zxbn = G + l.:~,;t 1 1 Zbi. Hence, x(G + l.:~,;t 1 1 Zbi) c G + l.:~,;t/ Zbi + Zxbn+1· Since vbn+l f/. vG U {oo}, the induction step will again be repeated. The sequence of elements bi constructed in this way may be finite or infinite. If it is finite, the element b will be called x-aJgebraic over (G, x), and otherwise, b will be called x-transcendental over (G, x). These notions are welldefined, although the shift elements 9i and the sequence members bi may not be uniquely determined. Indeed, in our construction, all values vbi were uniquely determined by b, which also yields that all sequences constructed from b must have the same length. Every such sequence will be called a characteristic sequence of b over (G, x). If bm :f. 0 and vbm > vG for some m, then the sequence is infinite and vbi > vG holds for all i 2:: m ; the sequence beginning with bm will then be called a supersequence. If vG is cofinal in vH, then there are no supersequences in H over (G,x). Note that "x-algebraic" does not mean "algebraic" in the model theoretic sense. We show in [K2] that only the elements of the divisible hull G are algebraic over a precontraction group (G, x).
will
By construction, the abelian group generated over G by all the elements of a characteristic sequence, is closed under x and thus a precontraction group. On the other hand, all elements bi are contained in H' which was the substructure of (H, x) generated by b. We find that the elements of a characteristic sequence form a set of generators of H' as an abelian group over G. By construction, it is even a minimal set of generators. For arbitrary bn in a characteristic sequence, all inclusions in the chain G C G + Zbn C G + Zbn + Zbn-1 C ... C G + 2.:~= 1 Zbi are proper. Indeed, from our construction it follows that vbi _ 1 < { vbi, ... , vbn} and there is thus no element of value vbi_ 1 in the group G + l.:~=i Zbi, for every j :::; n. Since x(G + l.:~=i Zbi) c G + l.:~=i+ 1 Zbi + Zxbn, we also see that n
(4)
bi
f/. x(G + L:zbi)
for every j:::; n.
i=j
Note that our assertions also hold for Q in the place of Z. If b1, ... , bn is
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ABELIAN GROUPS WITH CONTRACTIONS I
235
the characteristic sequence of some x-algebraic element b over (G, x), then all groups in this chain are precontraction groups since for every i ~ n, the sequence bi, . . . , bn is a characteristic sequence of bi. The construction carried through in the proof of Lemma 3.10 may be applied to (G + Zbn, x) in the place of (G, x). By virtue of (4), we may take the first adjoined elements to be bn_ 1 , ... , b1 successively. In this way, we obtain a contraction hull of (G + Zbn, x) in (H, x) which contains all elements of the given characteristic sequence of b. Hence, it also contains the precontraction group generated by b over (G, x). If H is divisible, then we may replace Z by Q to obtain a divisible contraction hull. We have proved: LEMMA 3.18. Let (G, x) c (H, x) be an extension of centripetal precontraction groups and assume that G is divisible and (H, x) is a contraction group (resp. a divisible contraction group). Let b E H be x -algebraic over (G, x) with characteristic sequence b1, ... , bn. Then there exists a contraction hull {resp. a divisible contraction hull) of (G + Zbn, x) in (H, x) which contains the precontraction group generated by b over (G, x).
In the sequel, let us assume (G, x) to be a divisible centripetal contraction group. Let b f{. G. We will now examine the question whether the cuts induced in G by the elements of characteristic sequences of b are already determined by the cut Cut(b) := ( {g I G 3 g < b}, {g I G 3 g > b}) induced by b in G. To this end, we need the notion of a v-cut that we have introduced in section 2. Bearing in mind the proof of Lemma 3.15 where we defined an isomorphism by an assignment xib f-+ xib', we will treat the following problem. Assume that (G, x) C ( H', x) is a second extension of centripetal precontraction groups and that b' E H' also induces the cut Cut(b) in G. Is it then possible to construct characteristic sequences of b and b' of equal length and having the same shift elements gi for every i? Let us fix a characteristic sequence b1, ... of b over (G, x). For every bi in this sequence, we have
since by definition, bi ¢ G. Assume that bm, m ~ 1, is an element of our characteristic sequence and that we have already shown Cut(bm-1) to depend only on Cut(b) (and not on the chosen characteristic sequence or the element b ¢ G inducing Cut(b) ). For m = 1, this assumption is trivially true. If m > 1, then assume in addition that we have already constructed the first elements b~, ... b~_ 1 of a characteristic sequence of b', satisfying b~ = b'- g1 and b~ = Xbi-1- gi as well as Cut(bi) =
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
236
FRANZ-VIKTOR KUHLMANN
Cut(bD for all 1 < i < m. For the case m = 1, we set C 1 := Cut(b) = Cut(b'). For m > 1, we set (5)
Cm := ( {xg I G 3 g
< bm-1}, {xg I G
3 g
> bm-d) .
Note that a priori, we only know that (5) is a quasicut. But since bm is an element of our characteristic sequence, bm+gm rj. G. As xbm-1 = bm+gm realizes (5), this shows that (5) is a cut. Since by induction hypothesis, Cut(bm-1) = Cut(b~_ 1) depends only on Cut(b), also Cm depends only on Cut(b), and by virtue of (C~), both xbm- 1 and xb~_ 1 realize Cm. In the sequel, let us treat the cases m = 1 and m > 1 simultaneously by taking the undefined expression "xbo" as "b". Assume that Cm is not realized in G. There are two possibilities for Cm. If Cm is not a shifted v-cut, then by Corollary 2.2, there is no g E G such that v(xbm-1 -g) rJ. vGU{oo} or v(xb~_ 1 -g) rJ. vGU{oo}. Then necessarily, gm = 0 and bm = xbm-1 as well as b~ = xb~_ 1 by our construction of characteristic sequences, implying also that Cut(bm) = Cm = Cut(b~). Moreover, bm and b~ are the last elements of the respective characteristic sequences. If on the other hand, Cm is a shifted v-cut, then by Corollary 2.2, there is some g E G such that v(xbm-1- g) rJ. vG U {oo}. Then by our construction, vbm = v(xbm-1- gm) rJ. vGU {oo} which by Corollary 2.2 yields that Cm- gm is the unique v-cut among all shifts of Cm. By part b) of Lemma 2.1, we find that v(xb~_ 1 -gm) rJ. vGU{ oo }, so we may take b~ := xb~_ 1 -gm. But also any other elements bm , b~ continuing the characteristic sequences would have to satisfy vbm , vb~ rJ. vG U {oo} and would thus induce v-cuts, which are then equal to Cm -gm because of its uniqueness. Consequently, Cut(bm) = Cm -gm = Cut{b~) only depends on Cut{b). Now assume that Cm is realized by some a E G. Then in view of Lemma 3.13, of which only part b) can apply here since G is dense, our construction of characteristic sequences yields vbm > vG, and bm is the beginning of a supersequence. Then b is x-transcendental and for all i ~ m, we have vbi > vG and all cuts Cuti{b) are the same and equal to one of the two possible cuts in G which are realized by 0 {these are (G< 0 , {O}uG> 0 ) and (G< 0 u{O}, G> 0 ) ). But the following pathological case may appear: we cannot exclude the possibility that xb~_ 1 =a. In this case, the characteristic sequence of b' would end with b~_ 1 and b' would be x-algebraic. Then certainly, the assignment b t--t b' would not extend to an isomorphism of precontraction groups over (G,x). On the other hand, if our characteristic sequence of b does not eventually run into a supersequence, then for none of its elements bi, the cut Cut(bi) is realized in G. In this case, our procedure of constructing b~ may be accomplished through the full length of the characteristic sequence of b, showing that the characteristic sequences of b' are at least as long as those of b. If symmetrically, we know that also the characteristic sequences of b' do not run into supersequences, then we may conclude that the characteristic sequences of b and b' are of equal length. If the characteristic sequences of b E H over (G, x) are infinite but do not run
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ABELIAN GROUPS WITH CONTRACTIONS I
237
into supersequences, then b will be called bounded x-transcendental over (G, x). If vG is cofinal in vH, then there are no supersequences in Hover (G, x), and every x-transcendental element is already bounded x-transcendental. Assume that bE His bounded x-transcendental over (G,x) and that b' is as above, satisfying Cut(b) = Cut(b'). Then our construction yields an infinite characteristic sequence b~, . . . of b' with the same shift elements gi and such that the cuts Cut(bi) = Cut(bD are not realized in G, for all i. In particular, also b' is bounded x-transcendental over (G, x). Moreover, we know that all bi and b~ have values not contained in vG U { oo}. Let us further note that every isomorphism L between the ordered groups (G+ 1 Zbi, b}.
This set is finitely satisfiable in (G,x). For this, we only have to show that for every finite subset :F of (6), there is some x E G for which all assertions of :Fare true. We write :F = :F1 U :F2 with :F1 a subset of the first and :F2 a subset of the second set in (6). Let g1 be the maximal element appearing in the assertions of :F1. Then there is some element g' E G such that g1 < g' < b since otherwise, g1 would realize the cut induced by bin G. Since c ~ g1 < g' b we have g > g'. This shows that x = g' satisfies all assertions in :F. Thus we have shown that the set (6) is finitely satisfiable in (G,x). Hence, it is satisfiable in every IGI+ -saturated elementary extension (G, x)* of (G, x). That is, there is some element b' in (G, x)* which induces in G the same cut as band which satisfies xb' = xb. This yields that the assignment b ~---+ b' defines an order preserving isomorphism from G + Zb onto G + Zb' over G. We have to show that this isomorphism is also an isomorphism of contraction groups. If G C G + Zb is not rank preserving, then by our choice of b (to be the first element of some characteristic sequence of b) we know that vb (j. vG U { oo }, and our assertion follows from the uniqueness assertion of Lemma 3.3. If G C G + Zb is rank preserving, then the uniqueness assertion of Lemma 3.6 shows that every order preserving isomorphism from G + Zb onto G + Zb' over G will automatically be an isomorphism of contraction groups. We have shown that (Gb, x) embeds over (G, x) in every IGI+ -saturated elementary extension of (G, x). Hence, (G, x) is existentially closed in (Gb, x), as contended. 0 Now we are able to prove our main lemma. LEMMA 3.22. Let (G,x) c (H,x) be an extension of centripetal precontraction groups and assume that (G, x) is a nontrivial divisible contraction group. Then (G, x) is existentially closed in (H, x).
Proof: In view of Lemma 3.9, we may assume w.l.o.g. that (H, x) is a divisible contraction group. By Corollary 3.17, we know that there exists a divisible contraction group (G', x) in (H, x) such that vG' is cofinal in vH and that (G, x) is existentially closed in (G', x). Now, it remains to show that (G', x) is existentially closed in (H, x). Hence, we may assume from the start that vG is cofinal in v H.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ABELIAN GROUPS WITH CONTRACTIONS I
239
It suffices to show that (G, x) is existentially closed in every substructure of (H, x) which is finitely generated over G. Again in view of Lemma 3.9, we may thus assume w.l.o.g. that (H, x) is a divisible contraction hull of a precontraction group which is finitely generated over (G, x). Picking one of the generators out of a minimal set of, say, m generators, we may consider the substructure (G 1 , x) of (H, x) generated by this element. We know that (G11 x) is a precontraction group. If we are able to show that (G, x) is existentially closed in (G 11 x), then by Lemma 3.10 and Lemma 3.12 there is a divisible contraction hull (Gi, x) of (G 11 x) in (H,x) such that (G,x) is existentially closed in (G~,x). Now (H,x) is a divisible contraction hull of a precontraction group which is generated over ( G~, x) by m -1 generators. This shows that we may proceed by induction on the number of generators. That is, we only have to show that (G, x) is existentially closed in every substructure of (H, x) which is generated over G by one element b. If b is x-algebraic over (G, x), then this is the assertion of Lemma 3.21. If b is x-transcendental over (G, x), then it is bounded x-transcendental since vG is cofinal in vH, and an application of Lemma 3.20 now completes our proof. 0 By Robinson's Test, the foregoing lemma implies: THEOREM 3.23. The theory of nontrivial divisible centripetal contraction groups is model complete.
Now assume that (G,x) is a common substructure of the two divisible centripetal contraction groups (H, x) and (H', x). By Lemma 3.1, (G, x) is a centripetal precontraction group. By Lemma 3.10, there is a divisible contraction hull (G', x) of (G, x) in (H, x) which embeds in (H', x) over (G, x). Let us identify (G',x) with its image in (H',x). By Lemma 3.5, the theory of centripetal contraction groups admits Pep as its prime structure. Hence if G is the trivial group, then we may replace (G, x) by Pcp to obtain that (G', x) is nontrivial. Now (G', x) is a nontrivial divisible centripetal contraction group, so from the model completenes stated in the preceding theorem we may infer that (H, x) and (H', x) are equivalent over (G', x) and hence also over (G, x). We have thus shown that the theory of divisible centripetal contraction groups is substructure complete, that is, THEOREM 3.24. The theory of nontrivial divisible centripetal contraction groups admits elimination of quantifiers.
Combining this result with Lemma 3.9, we obtain: THEOREM 3.25. The theory of nontrivial divisible centripetal contraction groups is the model completion of the theory of centripetal precontraction groups.
Since every two centripetal contraction groups contain the trivial group as a common substructure, substructure completeness yields
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
240
FRANZ-VIKTOR KUHLMANN
THEOREM 3.26. The theory of nontrivial divisible centripetal contraction groups is complete.
Since the axiom system {(OAG), (CO), (CS), (C:S), (C-), (CA'), (CP), (D), 3x : x =f. 0} is recursive, this theorem implies THEOREM 3.27. The theory of nontrivial divisible centripetal contraction groups is decidable.
4. Other concepts of contraction groups
Although we have constantly used the natural valuation in the last sections, we have not put a symbol for it into the language of contraction groups. So the question arises whether we obtain similar results if we do. This would mean that we add a symbol for a binary relation which is interpreted by "vx < vy" or "vx ::::; vy". Then certainly, to obtain completeness, there have to be axioms telling us about the relation between the valuation and the contraction. Note that the natural valuation of an ordered group is not elementarily axiomatizable. It is elementarily axiomatizable that a valuation be compatible with the ordering, but then there will always be models whose valuation is a proper coarsening of the natural valuation. The most direct way to fix the relation between valuation and contraction is to say that the valuation is the valuation associated to x:
(VC) Vx,y
E
G: vx = vy
¢?
xx = ±xy.
This valuation is always a coarsening of the natural valuation; it coincides with the natural valuation for instance on the prime structure and prime models that we have constructed. Since it is definable in the theory of precontraction groups, the definition just being axiom (VC), all model theoretic results remain true for this expansion. It is also possible to axiomatize elementarily that for every nonzero element a the set {vb I xb = a} contains precisely n values, where n > 0 is a fixed natural number or oo. It is rather likely that the model theoretic results also carry over to these expansions. Let us now consider valued abelian groups which are not ordered. In this case, an adequate axiom system for contraction groups might be (OAG), (CO), (CS) together with
{CV') Vx,yEG: vx=vy => xx=xy, and in view of part b) of Lemma 3.2, we would express the property "centripetal" by the axiom Vx E G: x =f. 0 => vxx > vx, and the property "centrifugal" by the axiom Vx E G: x =f. 0 => vxx < vx. Open Problem 1: Determine the algebraic and model theoretic properties of this theory.
Note that the contraction transports (a coarsening of) the ordering of the value set into the group. But this ordering will not be compatible with the addition.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ABELIAN GROUPS WITH CONTRACTIONS I
241
We do not know whether this is a sound situation. If so, then there arises a further question: Open Problem 2: Do there exist o-minimal or weakly o-minimal expansions or models of this theory? Finally, on abelian groups which are not ordered or valued, there may still be classes of elements which are appropriate to be contracted. For example, if the group is an R-module for some ring R, we may consider the axiom scheme
(CR} Vx E G: rx ¥= 0
xrx = xx (r E R), that is, for every element a in the group, the set xRa is a singleton. Combined again with the surjectivity, this describes rather "big" modules. =?
Open Problem 3: Study (CR) or similar axioms in combination with the surjectivity (CS). REFERENCES [C-K] Chang, C. C. - Keisler, H. J.: Model Theory, North Holland, AmsterdamLondon {1973) [D-M-M] van den Dries, L.- Macintyre, A.- Marker, D.: The elementary theory of restricted analytic functions with exponentiation, preprint [K1] Kuhlmann, F.-V.: Valuation theory of fields and modules, to appear in the "Algebra, Logic and Applications" series, eds. A. Macintyre and R. Gobel, Gordon & Breach, New York [K2] Kuhlmann, F.-V.: Abelian groups with contractions II: weak o-minimality, preprint [KS] Kuhlmann, S. : On the structure of nonarchimedean exponential fields I, submitted [K-KS] Kuhlmann, F.-V. - Kuhlmann, S. : On the structure of nonarchimedean exponential fields II, to appear in Comm. Algebra [P] Prestel, A. : Einfiihrung in die mathematische Logik und Modelltheorie, vieweg studium, Braunschweig {1986) [W1] Wilkie, A. J.: Model completeness results for expansions ofthe real field I: restricted Pfaffian functions, to appear in Amer. J. Math. [W2] Wilkie, A. J.: Model completeness results for expansions of the real field II: the exponential function, to appear in Amer. J. Math. MATHEMATISCHES INSTITUT DER UNIVERSITAT HEIDELBERG, IM NEUENHEIMER FELD 288, D-69120 HEIDELBERG, GERMANY E-mail address: [email protected]
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
This page intentionally left blank
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
http://dx.doi.org/10.1090/conm/171/01776 Contemporary Mathematics Volume 1 Tl, 1994
Typesets aDd Colypcscll m Finiac-Rallk Tonioo-Fm: Abelian Groups By Reiff S. Lafleur
Throughout this paper we shall use "group" for "finite-rank torsion-free abelian group". Every group G gives rise to two important sets of types: typeset(G)
= {type(x): 0 'li x e G),
cotypeset(G) = {type(X): X is a rank-1 factor of G).
In 1961 Beaumont and Pierce [2] posed the problem of characterizing those sets of types (necessarily countable) which arise as typesets of rank-2 groups. They showed that for a countable set of types T, if T
= typeset(G) for some G of rank-2, then there
exists a type 10 such that 10 = aNc for all a 'li or in T, where 10 e T if T is fmite.
However, in 196S Dubois [3] constructed a countable set of types T such that
crA-r =type(l) for a 'li or in T, while T is not the typeset of a rank-2 group. Further
results were obtained by Koehler [5] in 1964, Dubois [3] in 1965-1966, and Ito [4] in 1975.
In 1978 Schultz [6] introduced the tcnn cotypeset for the set of types of all rank-1 factors of a group. In 1982 Vinsonhaler and Wickless [7] characterized cotypesets of rank-2 groups. They showed that for a countable set of types T, T = cotypeset(G) for some G of rank-2 if and only if there exists a type 10 such that 10 = av-e for all a 'li or in T, with 10 required to be in T if T is fmitc. The following year Vinsonhaler and Wickless [8] gave a characterization of cotypesets of rank-n groups for any n. However, typesets of rank-2 groups have not been characterized.
The best
results presently known about typesets of rank-2 groups appear in Arnold and Vinsonhaler [1]. Little has been done with typesets of groups whose ranks are greater
Subject Oassification: Primary 20K15, Secondary 06A15, 06Al2 The paper is in final fonn and no version of it will be submitted elsewhere. It contains results from my thesis at the University of Connecticut. ©
1994 American Mathematical Society 0271-4132/94 Sl.OO + S.25 per page
243
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
244
REIFF S. LAFLEUR
than two. This paper gives some new alternative characterizations of cotypesets of rank-n groups. Using these characterizations, for any n ~ 3 we give an example of a set of types which is the cotypeset of a rank-n group but is not the cotypeset of any group of
rank higher than n. Also, we give necessary conditions on typesets of rank-n groups. Using these and the Warfield dual (see Warfield [9]) we can give for any n
~
3 an
example of a set of types which is the typeset of a rank-n group but is not the typeset of any group of higher rank.
An expanded version of these results will appear as my dissertation at the University of Connecticut I would like to thank my major advisor Professor William Wickless for his encouragement and assistance while these results were developed. I would like to thank my associate advisors Professors Charles Vinsonhaler and Eugene Spiegel for discussions on these topics which clarified several points. I would like to thank Professor James Schmerl of the University of Connecticut for his extensive help with the proof of the critical Theorem 2. Fmally, I would like to thank Professor J. B. Nation of the University of Hawaii for providing a key step for the proof of Theorem 2. We will assume the standard facts on types and the typeset and cotypeset of a group. See, for example, Arnold and Vinsonhaler [1] and Vinsonhaler and Wickless [8]. We begin with some DEfiNlTIQNS.
Let T be a set of types. Defme AT= 1\.J{all infs of finite subsets ofT} and
vr = 1\.J{all sups of finite subsets ofT}. "sup closure" of T respectively.
We refer to these as the "inf closure" and
(All sups and infs considered in this paper are of n
nonempty collections and are computed in the set of all types.) DefineS ={nonzero
subspaces of 'n}, and S~ = { 1-dimensional subspaces of 'n}.
THEOREM 1. Let T be a finite or countable set of types. Then the following are equivalent: (1) Tis the cotypeset of a rank-n group. such that Z S I~=tZ;. implies (2) There is a surjective map y.S~-tT . n V'(Z) S sup{11'(Z;.):1SiSk} for all Z.Zt,...q e St. (3) There is a map qr.Sn-t'ff such that q(S0 = T and for all V and We S, q(V+W) = q(V)Vq(W). n n n,. (4) There are maps qr.S -tVf and 9:VT-tS such that cp(StJ = T and for n
all V e Sn and u VT, V S 6(-r) iff cp(V) S-r.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
TYPESETS AND COTYPESETS
245
REMARK. Both S8 and a arc upper scmilattices. The second part of condition 3 states that tp is an upper scmilattice homomorphism. This implies that tp is monotone. We will sec below that the monotonicity of both tp and 8 follows from condition 4 as well. In order to help the reader distinguish between clements of S8 and clements of s~. we
consistently usc Z's to denote clements of S~.
h:a Vinsonhaler and Wicklcss [8] .1!2. Set 11' = fPI S~ and note that Z s I~=t~
implies 1/I(Z) = tp(Z) s tp(I~=t~ = sup{tp(~):lSiSk:} =sup{lp(ZJ:lSiSk:}, while tp(S~ =T implies that 'II' is surjective. ~ Let k = dim(W) and choose Z1oZ2, ...,Zt I -dimensional with I~=t~ = W. We refer to {~} as a basis for W. Define tp(W) =sup{lp(~:lSiSk:}. As a result of condition 2, tp(W) is independent of the choice of the ~ and equals sup{1p(Z):ZeS~,ZSW}. For V, We S~ by expanding a basis for VnW to bases for V and W respectively, we sec that tp(V+W) = cp(V)+tp(W).
Finally, Z e S~ implies
tp(Z) =1/I(Z), so tp(S~ =1/I(S~ =T. ~ We need to define 9. Choose Te a and consider F = {VeS8 :tp(V)ST}. There is a e T such that aS T. Since tp(S~ =T, there is Z e S~ such that tp(Z) =a. Then Z e F, so F "'- ~and uF = u{W:WeF} is nonempty and nonzero. We claim uF is a subspace of Q8 • It is clearly closed under scalar multiplication. Suppose v1 and v2 arc in uF. Then v1 e V1 and v2 e V2 with Yto V2 e F. So v1+v2 e V1+V2 and n tp(V 1+V2) = tp(V1)Vtp(V2) S 't Thus, v1+v2 e uF. Hence uF e S and we may put 8(T) =uF. Clearly tp(V) S T implies V S 8(T). For the converse, first suppose Z e S~. Then Z S 8( T) implies Zn8(T) "'- 0. So ZnV "'- 0 for some V with tp(V) S T. Since Z is 1-dimcnsional, Z S V. Thus tp(Z) S tp(V) ST. Now consider V e S8 with V S 8(T). Choose a basis {~:lSiSk:} for V. Then ~ S V S 8(T) implies tp(~) S T for every i. Thus tp(V) = tp(I~= 1 ~) = sup{tp(~:lSiSk:} ST. ~ We claim that tp is the desired map. We need only prove the second part of 3. We first prove that tp is monotone. Take V S W in S~ The second part of 4 applied to tp(W) S tp(W) yields W S 8tp(W). So V S 8tp(W). Hence tp(V) S tp(W), again by the second part of 4. Thus tp is monotone. Now V S V+W implies tp(V) S tp(V+W). Similarly, tp(W) S tp(V+W). So tp(V)Vtp(W) S tp(V+W). Next suppose T in a satisfies tp(V) S T and tp(W) S T. Then the second part of 4 yields V S 8(T) and W S 8(T). So V+W S 8(T). Thus tp(V+W) S T, again by the second part of 4. Taking T = tp(V)Vtp(W) (which is in a since a is closed under finite sups), we sec that tp(V+W) S tp(V)Vtp(W). So tp(V+W) = tp(V)Vtp(W) as desired.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
246
REIFF S. LAFLEUR
PR n implies ht[6('ft)]+ht[6('l2)] > n because 8 is an embedding. Since
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
REIFF S. LAFLEUR
248
8(-r1) and 8(1:2) are subspaces of .~ it follows that 8(-r1}n8(1:2) ~ 0. Then 8(-rl)r\8(1:2) ~ 8(-rl) implies ql(8(-rl)n8(1:2)] ~ tp8(-r1) ='E"t· Similarly, ql[8(T1)rl8(1:2)] ~ 12· So a= ql[8(T1)n8(1:2)] is the desired type. Now if a1 < 02 n, then there is a in vr such
-r1 and a ~ '1:2· (h) H -r1 and 12 in vr are incomparable, then there can be no chains below both of them whose length is greater than min {n-cht( 'E"t),n-cht(12>l. Later in this paper, we will show that all of these conditions together are not sufficient to prove that T is a cotypeset, for any rank bigger than or equal to 3.
that
a~
QUF.SllON. Theorem 1 states that a set of types T is the cotypeset of a rank-n group iff there is an upper semilattice homomorphism tp from Sn to Vf with tp(S0 =T. In view of this fact, the following question arises: For k > n, ·does there exist an upper
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
TYPESETS AND COTYPESETS
249
8(S~ = S~.
If such a map exists, then
semilattice homomorphism 8 from St to S11 with
any cotypeset of a rank-n group would also be the cotypeset of a rank-k group. For, by
tpo8(S~ =T, = 1 or 2, and for any k > n the answer is yes, such a map does exist.
Theorem 1, tp would exist as above. Then tpo8 would map St to \II' with as required. For n
The trivial proof will be left to the reader. The answer for k > n :l!: 3 is given in the following theorem whose proof will be deferred until later:
IHEoREM2.
For k > n :l!: 3 there does not exist an upper semilattice homomorphism 8 from
St to S with 8(S~ 11
= S~.
THEoREM 3. For any n :l!: 3, there is a set of types T11 which is the cotypeset of a rank-n group, but is not the cotypeset of any higher rank group.
It suffices to find a set of types T n for which there exists an upper semilattice
isomorphism fPn:S 11-t\fl'11 with fPn(S~
=T
11•
(For then Tn would be the cotypeset of a
rank-n group. However, if T11 were the cotypeset of a rank-k group with k > n, then
tp(S~ =T11• But then satisfying tp;, 1 otp(S~ = S~,
there would be qr.Sk-t\fl'11 with
tp;, 1oqr.Sk-tS11 would be an upper
semilattice homomorphism
which is impossible by Theorem
2.) We first defme Cl'n· List the subspaces of 'n of dimension n- 1 as
x., X2, X3, etc.
(We call these co-dimension 1 subspaces.) Partition the set of prime numbers as an infmite union of infinite sets,
n = uPi.
following characteristic: fPn(V}(p) and V! Xi. Fmally, set T11 = fPn(S~. It follows that fPn(S)
= \fl'
11 •
n
For V e S, fPn(V} will be the type with the
=0 if p e Pi and V S Xi and CJ'n(V)(p) =1 if p e Pi It is easy to see that CJ'n(V+W) = tp,.(V)Yfp11(W).
Also fPn is injective since V properly contained in W
implies there is Xi which contains V but not W. So fPn:S 11-t\fl'11 is an upper semilattice isomorphism, and T11 is the desired set of types. We now tum to typesets. The proof of the following theorem is dual to the proofs of the corresponding parts of Theorem 1.
THEoREM 1.• Let T* be a finite or countable set of types. Then the following are equivalent: (2*) There is a surjective map 'If• :S~--tT*
such that Z
s I~=l~
implies
for all z,z.,...q e S~. * . n._ = T * and for all V and (3 ) There 1s a map tp•:Sn-tAT• such that tp• (Sl}
'lf*(Z) :l!: inf('I/*~:1SiSk}
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
REIFF S. LAFLEUR
250
W
E
*
•
•
S , tp (V+W) = tp (V)Atp (W). * • D * * * D * II,. • (4 ) The~ are maps tp :S -tAT and 8 :AT --tS such that tp (StJ = T D
• tp•(V) and for all V e SD and-re AT,* V!. 8*('E) iff
~
-r.
REMARK. The maps tp* and 9* are semilattice anti-homorphisms. These conditions are
• the map tp*:S-tAT D * defined by tp•(V) necessary for typesets smce
is easily seen to satisfy condition 3~
• type(GnV) =mner
Furthermore, dualizing previous results gives the
following necessary conditions for tp~ 8* and T* when T* is the typeset of a rank-n group:
tp* AND 8.*
PRoPERTIES QF
(A*)
V!.W~tp
(C*)
.,• ~
a~
't' ~
•(V)~tp *(W). 8*(a)!. 8*('E). 't' iff
v!. 9* ('E).
w!. 9* .,•(W).
't'
= tp*8*('E). a> 't'~ 8*(a)< 8•('t).
NEcESSARY CoNDUIONS ON
(a*> (b*> (c*) (d*)
Th~
T.*
is an anti-embedding of AT* into S~
ht(AT*) !. n
AT* is closed under arbitrary infs.
For every S e AT~
every k !. n, and every choice of a~o(Jl,
that a 1 > a 1A02 > ... > a 1A(J2A... Ac:Jk,
th~
... ,c:Jk e S such
is an m between k and n and
the~
are
=infS. In particular, if 't'i = inff~ then for all k !. n and a~o(Jl ..... c:Jk e T~ with a 1 > a 1A02 > ... > a 1A(J2A... Ac:Jk, th~ is an m between k and n and there are
Oit+t. .... om e S such that atA02A... Aom
(e*>
*
Oit+t... ·O'm e T such that a1A02A... Aom
(f*) (g*> such that a~ (h*>
='E'i·
Th~ are no finite co-separating sets for any of the types in AT\T~ H 't1 and 't2 in AT* satisfy cht( 't1)+cht(12) > n, then the~ is a in AT* 't1 and a~ 12· H 't1 and 12 in AT* are incomparable, then there can be no chains above
both of them whose length is greater than min {n-ht( 't1),n-ht('12)}.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
TYPESETS AND COTYPESETS
251
REMARK. It is easy to see that conditions (a*> through (h*>are not sufficient to prove that T* is a typeset even for rank-2. In this case they reduce to the requirement that thete is a type 1'o such that aA-c = 1'o for all a'¢ -c in T*, which must be in T* if T* is finite. It is well known that this is not sufficient for rank-2 typesets. We can also point out at this time that the dual conditions (a) through (h) for cotypesets reduce to the requirement that thete is a type 10 such that OV-c = 1'o for all a'¢ -c in T, which must be in TifT is flnite. This is sufficient for rank-2 cotypesets. However, the example T3 that we defmed above satisfies (a) through (h) for all n > 3, but is not a cotypeset for any rank greater than 3. Conditions (a) through (h) are also not sufficient to prove that Tis a rank-3 cotypeset, since T = T3u{[]} fails condition 3 of Theorem 1, but satisfies (a) through (h) for rank-3.
THEoREM 3.•
For any n ~ 3, thete is a set of types T! which is the typeset of a rank-n group, but is not the typeset of any higher rank group.
fiWQE. To defme the necessary set of types T!, interchange O's and 1's in the definition of Tn. Then AT! looks like VTn tmned upside down, so there is a semilattice with ~(S~ =T!. So T! cannot be the typeset of a anti-isomorphism ~:Sn_.AT! group of rank-k higher than n. (For then by Theorem 1* there would exist an · homomorphism tp• :st--4/\T*n san"sfymg · tp* is just type(A) with the O's and 1's interchanged, Now,
• •
•
then type(A) e Tn. So we have shown that typeset(G ) ~ Tn. The proof of the other
containment is similar. The rest of the paper will be devoted to the proof of Theorem 2, which we restate for the benefit of the reader.
THEoREM 2. For k > n :2: 3 there does not exist an upper semilattice homomorphism 8 from Sk to Sn with c5(S~ = S~. PRELIMINARIES. We will need some facts about
spaces. It is well known that a vector
(~-)vector
space cannot be the union of finitely many proper subspaces. Using this one can show that if V is n-dimensional,
...,Vk are proper subspaces of V with dimensions
V~tV2,
n~tn 2 , ... ,nk respectively and m S n-max(nltn2,... ,nt), then there is an m-dimensional subspace W of V which is disjoint from V t.Y2,... ,Vk. The next result we will call
LEMMA!.
In the semilattice
s~
let z1'
~. ~
that any three are independent.
and Z4 be four 1-dimensional subspaces such
Let
Lo = {Z
For each m, let
1 k.~.Z4}.
= {planes generated by pairs of lines from L.nl and Lmt. 1 = L.dJ{lines which are intersections of pairs of planes of Pm~- 1 }. Then every line is contained in L.n for some Pm~- 1
m.
PRooF OF LEMMA 1.
Let {ij,k} be the standard basis for~~ Given Z 1 through~ as above, there is a 3 are mapped to Zlt ~. ~. linear isomorphism of ~ such that ~i, tj, ~k, and ~(i+j+k) and ~ respectively. Since linear isomorphisms preserve sums of pairs of lines and
intersections of pairs of planes, we may assume Z 1 =
~ = ~(i+j+k).
It suffices to prove that for all non-zero (a,b,c) in
the line detennined by ai+bj+ck is contained in some ~(i+j)
~(i-j)
~(i+j-k)
~i,
= [~i+tj]n[~(i+j+k)+~k] = [~i+tJ1n[~(i+k)+~(j+k)] = [~(i+j)+~k]n[~i+~(j-k)]
e L 1• e
~.
Similarly, Similarly,
~(i+k)
~(i-k)
e L]. Similarly, ~(i-j+k)
Lm-
~
= tj, ~ = ~k
and
T with gcd(a,b,c) = 1, We fmt notice that
and
~(j+k)
are in L 1•
Then
and
~(j-k)
are in
Next
and ~(i-j-k)
~.
= ~(-i+j+k)
are
in L]. We defme the content of (a,b,c) to be lal+lbl+lcl. The proof is by induction on content.
All triples of content 1 appear in
Lo.
Now suppose all triples whose
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
TYPESETS AND COTYPESETS
253
content is less than n have appeared and let (a,b,c) have content n. We will express Q(ai+bj+ck) as the intersection of sums of lines that have already appeared. We may assume that there are at least two non-zero components, and in fact that a > 0 and
=[Q(ai+bj)+Qk]n[Qi+Q(bj+ck)]. If c =0 and Q(ai+bj) =[Qi+Qj]n[Q(i+j-k)+Q((a-l)i+(b-l)j+k]. If c =0 and b < 0 then
b ¢ 0. If c ¢ 0, then we have Q(ai+bj+ck)
b > 0, then Q(ai+bj) =[Qi+QJ1n[Q(i-j-k.)+Q((a-l)i+(b+l)j+k]. This completes the proof of Lemma 1.
THEoREM 2. We suppose that such a map 8 exists and make some simple observations. First of all, 8 is monotone. Secondly, we must have 8(Q~ = Q~ Next, suppose Z~o~ •... ,Z1 is PRooF OF
a basis for U ~ Q~ Then 8(U) =80:~= 1 ~) =I~=t8
where 8(UnV) does not appear unless UnV ¢0. These subspaces satisfy the following equations which we will use without mention in the rest of the proof: and dim[8(U+V)]+dim[8{U)n8{V)] = dim[U+V)+dim[UnV] = dim[U]+dim[V], dim[8(U)]+dim[8(V)]. If UnV ¢ 0 then dim[UnV] = 1 ~ dim[8{UnV)] = 1 ~
8(U) =c5{U)nc5(V) =8(V) =8(U+V). So dim[8(U+V)] = 1. But dim[U+V] =3 and k-n =4-3 = 1. So we must have UnV =0. Then dim[UnV] =0 ~ dim[U+V] =4 ~ dim[8(U+V)] =3. But this is impossible since dim[8{U)] =dim[8{V)] = 1. So we
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
REIFF S. LAFLEUR
254
conclude that there can be at most one 2-dimensional subspace that drops. We will assume that there is exactly one such subspace, the case where there are none is similar. Call the unique such subspace ul. Choose 2-dimensional subspaces u2. u3. and u4 such that ul through u4 are pairWise disjoint Then dim[cS(U)] =dim[8(V)] =2, so c5(U)nc5(V) ¢0. Choose Z a !-dimensional subspace of cS(U)-)8(\1). Choose a !-dimensional subspace Z' of •t. such that li(Z') = Z. Then Z' is disjoint from U2 or U3; by renaming we may assume Z'nU2 ¢ 0. Then dim[Z'+U21 = 3, and /j(Z'+U2) = /j(Z')+c5(U2) = c5(U2). If we let V2 =Z'+U2, then we have shown that U2 is contained in a 3-dimensional subspace V2 that drops to a 2-dimensional subspace under 8. Similarly, using U3 and U4, we can show that U3 is contained in a subspace V3 which is 3-dimensional and goes to a 2-dimensional subspace under 8. Now consider diagrams (1) and (2) with U =V2 and V =V3. Then dim[Vu =dim[V3] = 3 and dim[V2+V3] =4, so dim[V2nV3] = 2. Also dim[/j(V2)] =dim[/j(V3)] = 2 and dim[/j(V2+V3)] = 3, so dim[/j(V2)1"\/j(V3)] = 1. This implies that dim[/j(Vf!V3)] = 1 and, thus, that Vf!V3 = U1. But then • 4 = U1+U2 :!0 V2. This contradiction finishes Case 1. 2: k > n = 3. Assume 8 is an upper semilattice homomorphism from St. to S3 with c5(S~ = S~. For W :!0 .~ let SW denote the set of nonzero subspaces of W, and let S~ denote the !-dimensional subspaces of W. The idea is to fmd a 4-dimensional subspace W of ~t. such that /j(S~) = S~. Since 81 SW automatically preserves sums, and since SW is just a copy of the existence of 81 SW would contradict Case 1. Let Zh ~ and ~ be independent !-dimensional subspaces of ~~ Let z~. and be !-dimensional k • • • • • • subspaces of~ such that /j(Zi) =~for 1 = 1,2,3. Let P = Z 1+Z 2+Z 3. Let Z4 be a !-dimensional subspace of P such that any three of Z~ through are independent, and let ZJ = /j(Z:). Then any three of Z1 through ZJ are independent We claim that the !-dimensional subspaces of P are mapped onto S~ by 8. Suppose that U and V are Now distinct planes contained in P, and consider diagrams (1) and (2). dim[U] = dim[V] = 2,. dim[UnV] = 1,. dim[cS(UnV)] = 1. Also since P does not drop, neither can U or V so dim[cS(U)] = dim[/j(V)] = 2. Thus, dim[/j(U)n/j(V)] = 1. Since cS(UnV) is always contained in /j(U)n/j(V), they must be equal. So 8 preserves intersections of distinct planes contained in P, as well as sums of distinct lines contained in P. Thus, by Lemma 1, we have a set of generators of the semilattice of subspaces of P being mapped onto a set of generators of the semilattice of subspaces of Q~ while 8 preserves the two operations in the generating process. Therefore the subspaces of P must be mapped onto the subspaces of ~~ In particular, we must have CASE
s1,
z;
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
z;
z:
TYPESETS AND COTYPESETS
8 = S~. 3 p
Now
w
take
any
3
4-dimensional
extension
255
W
of
P.
Then
S1 = 8(S1) S 8(S 1) S S1. As observed above, this is impossible by Case 1. CAsH 3:
k > n > 3.
The proof of the general case will be by induction on n. The case n = 3 has already been completed.
We will show that if there is an upper semilattice
homomorphism 8 mapping '"' to •• with 8(S~) = S~. then there is W s •"' and X < •• with li(W) =X and dim[X] = n-1 such that 8(SV() = Since dim[X] = n-1, the
s'f.
existence of 81 SW would contradict the induction hypothesis. We first claim that there
there is W S •"' and X < •• such that li(W) = X and dim[X] < dim[W]. Otherwise nothing whose dimension is less than n drops. But then choose U and V disjoint subspaces of •"' with dimensions n-1 and 2 respectively. Then dim[8(U)] = n-1 and dim[8(V)] = 2. These cannot be disjoint so there is a 1-dimensional subspace Z contained in 8(U)n8(V). Choose Z' such that 8(Z') = Z. Now Z' cannot meet both U and V. If UnZ' = 0 then take W = U+Z', while if VnZ' = 0 then take W = V+Z'. In either case let X= li(W).
This proves the claim.
So B = (X T}, Tcr(G(T)) = {p E Tcr(G): p 2:: T}. (2) If A = LpETcr(G) Ap E Regg(G), then Lp;?:r Ap E Regg(G(T)) and
A= Lp>r ApE Regg(Gd(T)). (3) Let BE Regg(Gd(T)) and let G(T) = Br ffi Gd(T). Then C = Br ffi BE Regg(G(T)) and CU(T) =B.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
BUTLER GROUPS {4) Let B
263
= LpETcr(G),p?:r Bp E Regg{G{r)). Bp pETer( G), p>T
Then
E Regg(G~{r))
and B = BT EB B~(r). {5) ForTE Tcr{G), a G~(r) bT = exp R(G~{r))
G(r)
= exp R(G(r)).
The positive integers bCj are called the Burkhardt invariants of the BR-group G. {6) For a, T E Tcr{G) and a~ T, b~ = b~(T). PROOF. These facts are well-known for almost completely decomposable groups and finite rank Butler groups, cf. (2, 3.1]. The same routine proofs work for BR-groups. 0 The next lemma shows that "globally" the situation for BR-groups as well as for finite rank Butler groups is complicated by the fact that regulating subgroups themselves may be ill-behaved. This is again in sharp contrast with the situation for almost completely decomposable groups. See Example 3.15 {8) in this context. LEMMA 3.8. Let G be a BR-group, and let A = LpETcr(G) Ap E Regg(G). Then A(r) = Lp>T Ap and A~(r) = Lp>T Ap are true for all T E Tcr(G) if and only if A*(r) = All(r) for all T E Tcr(G). PROOF. =}: LetT E Tcr{G). Then A(r) =AT EB A~(r) =AT EB Lp>T Ap C AT EB A*(r). Since A~(r):) A*(r), it follows that A*(r) = A~(r). {::::: We prove the desired identities by induction on depth in the critical typeset. If T is a maximal type, then Lp;:::T Ap = AT = A(r) and Lp>T Ap = 0 = A~(r). Now suppose that T is not maximal in Tcr(G) and assume that A( a) = Lp?u Ap and A~(a) = Lp>u Ap for every critical type a> T. Then
A(r) =AT EB A~(r)
=AT EB A*(r) =AT EB
2: A(p) =AT EB 2: Ap = 2: Ap.
Further,
and AU(r):) Lp>T Ap, hence A~(r)
= Lp>T AP'
0
We now consider regulators. A number of containments are true for BRgroups in general and are easily established. LEMMA 3.9. Let G be a BR-group, and let A= LpETcr(G) Ap be a regulating subgroup of G. Then the following hold:
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A. MADER, 0. MUTZBAUER AND K. M. RANGASWAMY
264
(1) For each T E Tcr(G), R(G#(T)) C R(G(T)) C R(G)(T)
(2) L pETcr(G)
b~ Ap c
c
b~G(p)
L
R(G#(T)) C R(G)#(T).
and
pETcr(G)
L
R(G(p))
c R(G).
pETcr(G)
(1) For the arbitrary regulating subgroup A = LpETcr(G) Ap of G, we have that Lp~T Ap is a regulating subgroup of G(T). Hence PROOF.
R(G(T)) cLAP
cA
P~T
and thus R(G(T)) C R(G). Since the exponent of G/R(G) is finite, we obtain that R(G(T)) C G(T) n R(G) = R(G)(T). Similarly, R(G#(T)) C R(G)#(T). Let B E Regg(G(T)). Then B#(T) E Regg(G#(T)) by 3.7 (4), and hence R.(G#(T)) C B#(T) C B, thus R(G#(T)) C R(G(T)) since B was arbitrary. (2) Using 3.7 (5), and (1), we have b~ AT C b~G(T) C R(G(T)) C R(G). D In this context we mention a relationship between Burkhardt invariants which is true under special assumptions. LEMMA 3.10. Let G be a BR-group such that for all A E Regg(G) and all T E Tcr(G), A*(T) = AU(T). If a, T E Tcr(G) and a> T, then bCj divides b~. PROOF. Let C be a regulating subgroup of G(a). Then there is a regulating subgroup B of G(T) such that B :) C and there is a regulating subgroup A of G such that A:) B. By hypothesis and Lemma 3.8, A(T) =Band B(a) =C. Now
b~G(a)
Hence b~G(a)
C b~G(T)
n G(a)
C B
n G(a)
= B
n G(T)(a)
= B(a) =C.
C R(G(a)) and bCj divides b~ as claimed. 0
In the case of almost completely decomposable groups of finite rank, the wellknown theorem of Burkhardt on regulators says that there is equality everywhere in the chain (2) of Lemma 3.9. It is unknown whether this is true in the general case of BR.-groups. However, a local version of Burkhardt's theorem holds. The following lemma is needed in the proof and again later. LEMMA 3.11. Let G be a BR-group, G(T) =AT EB GU(T) and 0 "#a EAT. If a¢J E R(GU(T)) for every ¢J E Hom(An GU(T)), then a E b~ AT. PROOF. Since b~ = exp(GU(T)/R(GU(T))), there exists z E GU(T) such that the order of z + R(GU(T)) is b~, i.e. if ez E R(GU(T)), then b~ divides e. Since tp(a) ~ tp(z), there is a E AT such that a = ea and x 0 (a) ~ x(z) where X is the characteristic. Also (a). is a direct summand of AT. Hence there is a homomorphism ¢J : AT -+ GU(T) such that a¢J = z. Then ez = ea¢J = a¢J E R( GU (T)), hence b~ divides e and a E b~ AT as desired. 0
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
BUTLER GROUPS
265
THEOREM 3.12. Let G be a BR-group and let A= EpETcr(G) Ap be a regulating subgroup of G. Then the following hold: (1) For each T E Tcr(G), R(G(r)) = bCj A,. 81 R(G#(r)). (2) Tcr(G) = Tcr(R(G)) and for each critical type T, R(G)(r) = b~ A,. 81 R(Q)#(r). Thus EpETcr(G) b~ Ap is a regulating subgroup ofR(G). (3) For each critical type T, R(G#(r)) = R(G)#(r), and R(G(r)) = R(G)(r). PROOF. (1) It has already been shown that R(G(r)) ::J bCj A,.81R(G#(r)) (3.9). To show containment in the other direction, let x E R(G(r)) C G(r) = A,. 81 Q#(r). Write x = a+y with a E A,. andy E Q#(r). If B is a regulating subgroup of Q#(r), then A,. 81 B is a regulating subgroup of G(r), so that x E A,. 81 B. Since B C Q#(r), it follows from the uniqueness of the representation x =a+ y that y E B. Since B was an arbitrary regulating subgroup of QU(r), we conclude that y E R(Q#(r)). If 4> E Hom(A,., Q#(r)), then A(1+¢) is another complement of Q#(r) in G(r), i.e. G(r) = A,.(1 + ) 81 Q#(r). Hence we have x = a + y = a' (1 + 4>) + y' = a' + (a' 4> + y')
for some a' E A,. and y' E R( Q# (T)) as before. Since a' 4> + y' E Q# (T), it follows that a = a' and y = a¢+ y'. Hence for every 4> E Hom(A,., Q#(r)), we have a¢= y- y' E R(Q#(r)). By 3.11 a E b~ A,. as claimed. (2) Since R(G)(r) ::J bCj A,., it follows from the decomposition in (1) that R(G)(r) = b~ A,. 81 [R(G)(r) n R(G#(r))]. Further R(G)(r) n R(Q#(r))
c
R(G)(r) n R(G)#(r) = R(G)#(r)
c
R(G)(r)
and bCj A,. n R(G)#(r) = b~ A,. n R(G) n Q#(r) = 0. From R(G)(r) = b~ A,. 81 [R(G)(r) n R(Q#(r))]
c
b~ A,. 81 R(G)U(r)
c
R(G(r))
it now follows that b~ A,. 81 R(G)U(r) = R(G(r)), proving (2). Also we obtain by the last paragraph that R(GU(r)) ::J R(G)(r)nR(GU(r)) = R(G)U(r) ::J R(GU(r)), so R(Q)#(r) = R(GU(r)) as claimed. Finally, R(G(r)) = b~ A,. 81 R(G)U(r) = R(G)(r) by (1) and (2). D Recall that for each type T E T(G), e~ = exp(G#(r)/G*(r)). Further, for T E Tcr(G), set s~ = exp(GU(r)/RE(GU(r)) = exp(G(r)/RE(G(r)). Like b~, the values e~ and sCj are invariants of G. These invariants are related as indicated below. PROPOSITION 3.13. Let G be a BR-group and letT be a critical type. Then (1) eCf divides sCf and sCf divides bCj. (2) If bCj = 1 for all critical types T E Tcr(G) and G(r) = A,. 81 QU(r), then R(G) = EPETcr(G) Ap is the unique regulating subgroup of G and G* (T) = T) is pure for each critical type T.
au (
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A. MADER, 0. MUTZBAUER AND K. M. RANGASWAMY
266
PROOF.
(1)
R(GU(r)) c RE(GU(r)) =
G(p)
c G*(r) c
QU(r)
pETcr(G),p>-r and the claim follows. (2) This follows immediately from Lemma 3.9 and (1).
D
The following theorem generalizes the theorem of Burkhardt on regulators ([6, Lemma 1]) and provides a new direct proof even in the case of almost completely decomposable groups of finite rank. THEOREM 3.14. Let G be a BR-group, and suppose that A = is a regulating subgroup of G such that for every critical type 1£ following identities are true:
~pETcr(G) E Tcr(G)
Ap the
AU(J.£) n LAP= 0 and AJL n LAP= 0. P~JL PlJL Then R(G)
=
b~ Ap
L pETcr(G)
=
b~G(p)
L pETcr(G)
=
L
R(G(p)).
pETcr(G)
PROOF. Because of 3.9 we only need to show that
R(G)
c
Bu(A) =
L
b~ Ap.
pETcr(G)
Let x be a non-zero element of R(G), write x = ~pETcr(G) ap, ap E Ap, and let J.t be maximal among the critical types p with ap -=f. 0. We will show that aJL E b~ Aw We then have x - aJL E R( G) and it follows by induction that x E Bu(A) as desired. Let BE Regg(GU(J.£)) and¢ E Hom(AJL, QU(J.£)). Then
LAp+ AJL(1 +¢)+BE Regg(G) PlJL and
x =Lap= La~+ P~JL PlJL
a~(1
+ ¢) + b, with a~ E Ap, bE B.
Now
LaP- La~= P~JL
a~¢+
bEAn QU(J.£) = AU(J.£).
P~JL
Since AU(J.£) n ~P~JL Ap = 0 by hypothesis, we have a~¢ = -b E B. Using the second hypothesis on A, we have aJL- a~ = ~PlJL (a~- ap) E AJL n ~PlJL Ap = 0. So a~ = aJL, and since B .was an arbitrary regulating subgroup of QU(J.£), we conclude that aJL¢ E R(GU(J.£)) for every¢ E Hom(AJL,GU(J.£)). By 3.11 we now have aJL E b~ AJL as needed. D
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
BUTLER GROUPS
267
Many questions arise concerning regulating subgroups and regulators of BRgroups. For example, for a regulating subgroup A = LpETcr(G) Ap let us call Bu(A) = LpETcr(G) b~ Ap the Burkhardt transform of A. It is not clear whether Bu(A) = Bu(A') for two distinct regulating subgroups of G. The following example of Mutzbauer [11, 2.3] gives some insight. ExAMPLE 3.15. Let p be a prime other than 3, 5, 7, 11, 13, 17, A = 3-ooz, B = {3 · 5)-ooz, C = {3 · 7)-ooz, D = u-ooz, X= 13-ooz, Y = 17-ooz, with types 7A, 7a, ... respectively. In the vector space Qa EB Qb EB Qc EB Qd let
G = (Aa EB Bpb EB Cpc EB Dpd)
+ X(a + b +d)+ Y(c- d).
Then the following can be verified: {1) T(G) = {7A,7B,7c,7D,7X,7Y,tP(Z)} {2) G{7A) = Aa + Bpb + Cpc + A(b +c), GU(7A) = Bpb + Cpc + A(b +c), G*(7A) = Bpb + Cpc. {3) G(7a) = Bpb, G(7c) = Cpc, G(7v) = Dpd, G(7x) = X(a + b +d), G{7y) = Y(c- d), GU(78 ) = GU(7c) = GU(7v) = GU(7x) = GU(7y) = 0 - bG - bG - bG - bG - 1" - p ' bG (4) bG TA TB TG TD TX 7y {5) G contains p {not necessarily distinct) regulating subgroups Vi= A(a+i(b+c))+Bpb+Cpc+Dpd+X(a+b+d)+Y(c-d),
0$ i
< p.
= Bu(Vo) = Bu{Vi) = ... = Bu(Vp_l) = V1 c Vo = G, Vi c Vi for all i. In particular, note that Bu(Vi) = Vi. {7) Vl(7A) = A(a + b +c)+ Bpd + Cpc, Vt(7A) = V/(7A) = Bpd + Cpc, and R{R{G)) = R{V1) = V1 = R{G). {8) G = Vo does not satisfy the hypotheses of Lemma 3.8 while V1 does. {6) R(G)
A result of Butler [7, Theorem 7] on finite rank Butler groups generalizes to BR-groups. 3.16. A partially ordered set (T, $) is said to have property (*) if each 7 E T has either at most one cover in T or there are exactly two covers 71 and 72 and there is no a E T with a~ 71, 72· DEFINITION
THEOREM 3.17. If G is a BR-group whose typeset T has property(*), then every regulating subgroup of G is completely decomposable.
PROOF. Let A = LpETcr(G) Ap be a regulating subgroup of G. We use induction on ITI. If ITI = 1 then G is homogeneous completely decomposable and A= G. Suppose that ITI > 1 and that the claim holds for all BR-groups whose ty property (*) and contains less than ITI elements. Let 1-L = infT, the inner type of G, which belongs toT. Since ITI > 1, 1-L has at least one cover 7 E T. CASE 1. 7 is the only cover of 1-L· Then G*(~-t) = G(7) = GU(I-L)· Hence G = G(~-t) = A~'EBGU(I-L) = A~'EBG(7). The typeset of G(7) satisfies the conditions and of the induction hypothesis and contains fewer elements that T{G). Also,
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
268
A. MADER, 0. MUTZBAUER AND K. M. RANGASWAMY
Lp;:::r Ap is a regulating subgroup of G(7). By induction hypothesis Lp;:::r Ap is completely decomposable and so is A= A~' 61 Lp~r Ap. CASE 2. f.-t has exactly two covers 71 and 72· Then G*(t-t) = G(71) + G(72) = Gh) 61 G(72), the sum being direct since otherwise G(71) n G(72) contains an element of type 2: 7I. 72. By induction hypothesis, the regulating subgroups Lp~r 1 Ap of G(7I) and Lp~r 2 Ap of G(72) are completely decomposable and hence so is A = A~' 61 Lp~r 1 Ap 61 Lp~r 2 Ap. D We end this section by recording the following property of BR-groups which follows by simple induction on the typeset. THEOREM 3.18. A BR-group with a linearly ordered typeset is completely decomposable.
4. BR-groups with completely decomposable regulating subgroups In this section we consider BR-groups with a completely decomposable regulating subgroup. For the sake of brevity we call such groups BRCD-groups (where "CD" stands for completely decomposable.) The class of BRCD-groups coincides with the class of torsion-free groups containing a completely decomposable group with finite typeset and bounded quotient. It is crucial that every regulating subgroup of a BRCD-group is completely decomposable. Note that, by Albrecht-Hill (1, 4.4], BRCD-groups are always B2-groups. The infinite rank analogue of Burkhardt's theorem on regulators (6, Lemma 1] holds for these groups. THEOREM 4.1. Let X be a torsion-free group containing a completely decomposable subgroup A such that Tcr(A) is finite and X/A is bounded. Then X is a BR -group and every regulating subgroup of X is completely decomposable. PROOF. By Lemma 2.1, X and A have the same typesets and the same critical typesets. Hence condition (1) of the definition of BR-group is satisfied by A. Let e = exp(X/A). Then eX~(7)
cAn X~(7)
= A~(7)
= A*(7) c X*(7),
so the second condition is satisfied also. By the Dedekind identity we have the short exact sequence "' A(7) 0 -+ AT= A~(7) and e(A+X(7)) C A+X~(7), X{7) "'
X~(7)
X(7)
-+
X~(7)
-+
A+ X(7) A+ X~(7)
so that X(7)/X~(7) X{7)
= e X~(7)
C
A(7) + X~{7)
X~(7)
-+
0
is 7-homogeneous. Now rv
A{7) "'A
= A~(7)
=
r·
By (8, 86.6], X (7) /X~ (7) is completely decomposable. By the Baer Lemma, X (7) = Br 61 X~ (7) for some 7-homogeneous completely decomposable group
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
BUTLER GROUPS
269
Br- To establish (3), we need to show that LpETcr(X) Bp is in fact a direct sum ffiPETcr(X)
Bp . We have
Hence B.,.
n E9AP c B.,. n AU(r) c B.,. n XU(r)
= 0.
p"lr
Let A.,.= B.,. E!1 ( ffiP-1.,. Ap). Recall that e = exp(X/A). We claim that e2XC
A.,.. In fact, eA.,. c eX(r) = e(B.,. E11 XU(r)) c B.,. E11 AU(r) =B.,. E11 A*(r) cA.,.. Now e 2X C eA C eA.,. + Lp"lr Ap C A.,.. Thus we are again in the initial situation and can replace one by one the Ap by B P while keeping the sums direct, and obtain B = ffipETcr(X) Bp after finitely many steps. D PROPOSITION 4.2. Let X be a BR-group containing a completely decomposable group with bounded quotient. Then X does not possess distinct nested regulating subgroups. PROOF. Suppose that B 1 , B2 are regulating subgroups of X and that B1 C B2. Then B1 is a regulating subgroup of B2 and by 2.3, B1 = B2. D
The following generalization of Burkhardt's theorem [6, Lemma 1] is an immediate consequence of 3.14. THEOREM 4.3. Let G be a BRCD-group, and let A regulating subgroup of G. Then
R(G) =
L
pETcr(G)
b~ Ap =
L
pETcr(G)
b~G(p)
=
=
L
LpETcr(G)
Ap be any
R(G(p)).
pETcr(G)
5. BR-Groups and infinite rank Butler groups In this section we explore the connection between BR-groups and B 2-groups. Three examples are constructed to indicate that the class of BR-groups is distinct from the known classes of infinite rank Butler groups. Specifically we show that a B2-group with a finite typeset need not be a BR-group and, conversely, a BRgroup need not be a B 2-group, not even a finitely Butler group. It is well-known that countable B2-groups are closed under pure subgroups. But a countable BRgroup may be a B2-group and still may contain a pure subgroup which is not a BR-group. Our examples also indicate how some of the properties of finite rank Butler groups do not carry over to the infinite rank case. For example, a B 2group with a linearly ordered typeset need not be completely decomposable, and a BR-group, when localized at a prime, need not be completely decomposable. EXAMPLE
5.1. A B2-group with a finite typeset need not be a BR-group.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A. MADER, 0. MUTZBAUER AND K. M. RANGASWAMY
270
PROOF. Let S be a rational group containing 1 with x8 (1) = (1, 1, ... ). Let T be the type of S. Let P1.P2, ... be an indexing of all primes. Let B = EBiEN Sxi C EeiEN Qxi and
+ PiY):
A= (Zy E9 B,pi 2 (xi
i EN) C Qy E9 E9Qxi. iEN
Then tp(y) = tp(Z) and A has the typeset {tp(Z, r}. Since AU (tp(Z)) = B and A= A(tp(Z)) we get A(tp(Z))jA#(tp(Z)) =A/ B ~ S which is not of type tp(Z). So A is not a BR-group. But A is a countable B2-group since it is the union of the increasing chain of pure subgroups (y}* C (y, XI}* C (y, XI. X2}* C · · · where for each n, (y, XI, ... , Xn}* = Zy + L::~=I finite rank Butler group. 0
Sxi
+ L::~=I
Zpi 2 (xi
+ PiY)
is a
REMARK. Since a completely decomposable group always has a Butler decomposition, the group A of Example 5.1 is not completely decomposable. This shows that a B 2-group with a linearly ordered typeset need not be completely decomposable. EXAMPLE 5.2. A BR-group need not be a B2-group, not even be finitely Butler. Let
00
00
i=I Let p, q, r, s be different primes, and let
i=l
= p-ooz, B = q-ooz, C = r-ooz, with corresponding types TA = tp(A), TB = tp(B), rc = tp(C). A
Tz; denote the type of Z. Next, let p is irrational. Write
1r
In addition let and p be irrational s-adie units such that
1r /
00
11"isi,
0 ~ 11"i
p=LPisi,
O~pi A. Then i(T•) = A + w. L/B' is reduced with torsion T', thus there exists m such that ipkx + B'i ::::; i(T') + m + k(k ~ 0). Therefore, we may take J.L =A+ m. Now suppose that i(T•) = A. Let (1 be the smallest ordinal such that Tu is bounded. Lemma 2 applies to tell us that (1 is a limit ordinal of cofinality > w.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ENDOMORPHISMS OVER INCOMPLETE DISCRETE VALUATION DOMAINS
281
But a is also smallest such that (T'V is bounded, hence l((T')•) = l(T'). Put 1-£ = supdlpkx+B'I}. Since L/B' may be embedded as an isotype submodule of (T')•, the cofinality implies that 1-£+w < l(T') < .X+w. Thus 1-£+w::::; .X= l(T•) .
•
The next lemma on endomorphisms of T• is crucial.
LEMMA 5. Let L be a pure submodule of T• containing T. Suppose that B = (x) EB B'(x =/; 0), is a torsion-free nice submodule of L with L/B totally projective of length A. Then there exists an ordinal!-£ with 1-£ + w ::::; l(T•) such that:
(1) given z E pP-T•, there exists a E EndRT• with a(x) = z and a(B') = 0; (2) for a as in {1}, if y E T• and lpka(y)l < 1-£ for all k ;:::: 0, then there exists (3 E EndRT• with (3(y) = a(y) and (3(B) = 0.
PROOF. (1) Take 1-£ as in Lemma 4 and let z E pP-T•. Then lpkx+B'I::::; lpkzl for all k, thus the map B -+ T• sending x to z and B' to 0 does not decrease heights in T•. Consequently, it extends to a map L -+ T•, and then to a E EndRT•. (2) Since lpka(y)l < 1-£, and since a: T• -+ T• with a(B) ~ pP-T•, we have lpka(y)l = lpka(y) +pP-T•i;:::: lpky+Bir•fB· Put L = (L, y)*, the purification in T•. Then Lj L is torsion-free since L is pure in T•, thus the torsion submodule of Lj B is L/ B. Moreover, Lj B is of torsion-free rank one. The map pky + B ~ pka(y) does not decrease heights, thus it extends to a map Lj B-+ T•. Form the composition L-+ Lj B-+ T• and let (3 be the extension to an endomorphism of T•. • We now consider whether the submodule C(L) contains torsion-free elements. 6. Let L be a pure submodule of T• containing T. Assume that where T is totally projective of length .X.
LEMMA
T ~
T,
(1) If C(L) =/; T, then there exists an ordinal 1-£ with 1-£ + w ::::; l(T•) and pP.T• ~ C(L). (2) If Lhasa nice torsion-free submodule B such that L/ B is totally projective of length A, and if every complete submodule of B has finite rank over R, then C(L) = T. PROOF. (1) Choose a torsion-free element x E C(L). Apply Lemma 3 toT to obtain T1 ;2 T, ¢• : T• -+ Ti, and Xt = ¢•(x). Apply Lemma 4 to (x 1)* and {xt) to obtain 1-£ with 1-£ + w ::::; l(Ti) and lpkxtl ::::; 1-£ + k(k ;:::: 0). Lemma 2 says that the length of T• is either .X or .X+ w, depending on .X. Since l(T1 ) =.X also, we have l(Ti) = l(T•), therefore I-£+ w ::=; l(T•). If z E pP-T•, then pkx 1 ~ pkz does not decrease heights, hence extends to (x 1)* -+ T•, and then to Ti -+ T•. By composition with ¢•, we get a E EndRT• with a(x) = z E C(L). (2) Suppose C(L) =/; T. Then (1) implies that pP-T• ~ C(L). Since pP.T• is cotorsion, so is its image in L/ B, thus bounded by pm for some m. Hence,
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
WARREN MAY
282
pP-+mr• ~ B is reduced torsion-free cotorsion, thus complete. But our hypothesis implies that pP-+mr• has finite rank over R, contrary to Lemma 2. Therefore, C(L) = T. • For the final three lemmas, we assume that M is a reduced and nontorsion Rmodule with torsion submodule T such that MIT is divisible. We further assume that every full R-submodule of RM contains a nice R-submodule B such that RM/ B is totally projective. The first lemma draws some simple conclusions from this hypothesis. LEMMA
7. (1) Any full ksubmodule of RM of the form B1 $ p>. RM contains
a nice ksubmodule B of the same form, with RMI B totally projective of length
>..
(2) Any complete torsion-free ksubmodule of RM is free of finite rank.
PROOF. (1) Given B 1 $p>.RM, choose a nice R-submodule B' such that RMIB' is totally projective. Put B = B' +p>.RM. Then B = (BnBl)tJJp>.RM, and BIB'= p>.(RMIB') since B' is nice, therefore B is nice and RMIB has length>.. (2) Suppose that F ~ RM is complete torsion-free. Choose a free full Rsubmodule of RM, say B. We may assume that B is nice, therefore RMI B is reduced torsion. The image ofF in this quotient must be bounded, consequently, F is free since B is. The completeness implies that the rank is finite. • Suppose that W ~ RM is a submodule such that RMIW is reduced. Since we have a natural identification (RM)• = r•, and since Homn(K, RMIW) = 0, we get an exact sequence 0 ~ w• ~ r•. We use this freely in the following to regard w· as a submodule of r· We now introduce a second module N with the same endomorphisms as M. 0
LEMMA 8. Let M be as above, and further assume that M and N are pure submodules of r• containing T such that EndnM = EndnN (when extended to r· ). Then N ~ RM + (p>.RM)•.
PROOF. We may choose a full R-submodule of RM of form B 1 $ p>. RM, with B 1 free. By Lemma 7, we may assume that B is nice, RMIBis totally projective of length >., and every complete submodule of B has finite rank over fl. We first claim that C(N) = T. Lemma 6 applied to RM shows that C(RM) = T, thus C(M) = T. For the sake of contradiction, we assume that C(N) "# T. Since M is nontorsion, we may write B = (x) $ B' for some torsion-free x. Choose JL to satisfy Lemma 5 for RM and Lemma 6 for N. Then pP-T• ~ C(N). By Lemma 2, we may choose torsion-free E pllT•. By Lemma 5, there exists a E EndnT• with a(x) = z and a(B') = 0. We shall show that a(N) ~ C(N). Let y E N. Then a(y) E C(N) if lpka(y)i ~ JL for some k; therefore we may assume lpka(y)i < JL for all k. Then Lemma 5 provides /3 E EndnT• with f3(y) = a(y) and f3(B) = 0. Thus, f3(M) ~ T and the Proposition implies f3(N) ~ C(N). Hence, a(y) = f3(y) E C(N) in this case also. But a(N) ~ C(N) implies that a(M) ~ C(M) = T by the Proposition. This contradicts a(x) = z.
z
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ENDOMORPHISMS OVER INCOMPLETE DISCRETE VALUATION DOMAINS
283
Next we claim that N ~ (B•)*. If y E T•\(B•)*, it will suffice to show that y rJ. N. The exact sequence 0 -+ B -+ RM -+ CRMI B) -+ 0 induces o-+ B• -+ r•-+ (RMI B)• -+ 0. Note that y + B• is torsion-free in (RMI B)•. If we put A= (y + B•)* in (RMIB)•, then A has torsion-free rank one and torsion RMIB totally projective of length >.. By Lemma 2, we may choose torsion-freezEr· such that IPkY + B·l $ lpkzl for all k ~ 0. Thus, there exists a homomorphism A-+ r• sending y + B• to z. By composing with the natural map to RMI Band extending to r•, we obtain a E EndRT• such that a(y) = z and a(B) = 0. Hence, a(M) ~ T and the Proposition implies that a(N) ~ T. Therefore, we must have y rJ. N. Now let yEN. Then, for some k we have pky = Y1 +v (yl~:Bi, v E (p>..RM)•), since B• = Bi EB (p>.. RM)•. If y1 rJ. Bt. then replacing B 1 by a suitable full Rsubmodule B 2 (replace basis elements by suitable nonzero multiples), we may assume that Yl rJ. (B2)*. We may further assume that B2 EBp>..RM is nice in RM with the quotient totally projective. But then, N ~ (B2 EB (p>.. RM)•)* by what we have already shown. This implies Y1 E (B2)*, contrary to choice. Thus, we must have Y1 E Bt. and hence N ~ (B1 + (p>.. RM)•k This last module equals RM + (p>..RM)• since p>..RM is dense in (p>..RM)•. • LEMMA 9. Let M and N be as in the preceding lemma. (p>..RM)• = RN + (p>..RN)•.
Then RM
+
PROOF. For convenience, put M* = RM + (p>..RM)• and N* = RN + (p>.. RN)•. By Lemma 8, N* ~ M*. Note that RM n (p>.. RM)• = p>.. RM since p>.. RM is a pure submodule of the complete module p>..T•. Thus, RMI p>.. RM is naturally isomorphic to M* I(P>.. RM)•. On the other hand, N* n (p>.. RM)• = (p>..RN)•, thus N* l(p>..flN)• is isomorphic to an R-submodule of the previous quotient. We may choose a free R-module B1 EB B2 in RM such that B1 EBB2 EBp>..flM is full in RM, and such that (B2 EB (p>..RM)•)I(p>..RM)• is a full R-submodule of the above submodule. By Lemma 7, we may assume that B1 EB B2 EB p>.. RM is a nice R-submodule of RM with quotient T totally projective of length >.. Note that the decomposition B 1 EB B2 may still be assumed to hold since the original B 1 was free. We have B1 EB B2 EB (p>..RM)• a torsion-free R-submodule of M* with quotient isomorphic toT. Since (p>.. RN)• is a pure complete submodule of (p>.. RM)•, we may write (p>.. RM)• = (p>.. RN)• EB E for some E. For the sake of contradiction, we assume c N* -::/= M*. Then B1 EB E -::/= 0. Choose nonzero x E B1 EB E and put B* = B2EB(p>.. RN)•. Then M* I B* is reduced, its torsion submodule may be embedded in 'i', the quotient modulo torsion is divisible, and the image of xis a torsion-free element. We may apply Lemma 3 and familiar arguments to obtain a E EndRT• such that a(x) is torsion-free and a(B*) = 0. Thus a(N) ~ T, and consequently, a(M) ~ T. But then a(p>..RM) = 0, and hence we see that a(M*) ~ T. This is contrary to a(x) torsion-free, thus we have the desired contradiction. • The Theorem now follows from Lemma 9. The Proposition guarantees that
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
284
WARREN MAY
we are in the setting of the lemma. The assumption on p>.. RM implies that it equals (p>..RM)•, thus the same is true of p>-RN and the conclusion of the lemma becomes RM = RN. Corollary 2 follows from Lemma 1(3) and the fact that finitely generated Rsubmodules are nice. For Corollary 3, we can apply parts (7) and (3) of Lemma 1. If N is also a Warfield module, we note that the Warfield invariants of M (respectively, N), are the same as for RM (respectively, RN), by Lemma 1(6). Since the Ulm invariants are trivially the same, we obtain the isomorphism. In Corollary 4, we have RM = RN. We may choose torsion-free elements x EM, yEN, and a unit u E R such that y = ux. Multiplication by u gives an isomorphism of M with N. Since all endomorphisms commute with this multiplication, we obtain the corollary.
4. Final Remarks A question raised by the Theorem is the following. Suppose that M varies over a class of modules to which the Theorem applies. Then, up to isomorphism, EndRRM depends only on the algebra EndnM, and not on M. Thus, the correspondence EndnM t---t EndRRM induces a well-defined map from certain isomorphism classes of R-algebras to isomorphism classes of kalgebras. Can this correspondence be given in another manner, say a ring-theoretic one? For example, for modules of torsion-free rank one, EndRRM can be interpreted as REndnM. Finally, we comment on the hypothesis that p>-RM have finite rank over R. For simplicity, take R to be the rational p-adic integers for a prime number p. We shall give modules M and N such that the hypothesis of the Theorem holds, except that p>-RM will have rank N0 , and such that RM =/; RN. Thus the completion (p>.. RM)• in Lemma 9 cannot be avoided as things stand. Take the algebra A = R in Theorem 2.3 in [4], and construct X as in that proof, with >. = N0 . Since the R functor commutes with purification, in that proof we see that RX = tl3i..eik We may choose another basic submodule tl3i.e~R such that $e~R =/; tl3eik Construct X1 and X2 using these two different bask submodules of the completion. Then X1 = X2, EndnX1 = EndnX2, but RX1 =/; RX2. Apply the functor G from [4], putting M = G(X1) and N == G(X2). Then EndnM = EndnN (Theorem 5.1 in [4)), and RM has torsionfree rank N0 and torsion a direct sum of cyclic modules. The nice R-submodule condition of the Theorem is met by Lemma 11 in [9]. Moreover, the functors R and G commute, thus p>-RM = RX1 has rank No. But, p>-RN = RX2 =/; RX1, henee RM =/; RN, as desired. REFERENCES
1. M. Dugas and R. Gobel, Every cotorsion-free algebro is an endomorphism algebro, Math. z. 181 (1982), 451-470. 2. S. Files, Mixed modules over incomplete discrete valuation rings, Comm. Algebra (to appear).
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ENDOMORPHISMS OVER INCOMPLETE DISCRETE VALUATION DOMAINS
285
3. L. Fuchs, Infinite Abelian Groups, Vol. I, Vol. II, Academic Press, New York, 1970, 1973. 4. R. Gobel and W. May, The construction of mixed modules from torsion-free modules, Arch. Math. 48 (1987), 476-490. 5. B. Goldsmith, Endomorphism rings of torsion-free modules over a complete discrete valuation ring, J. London Math. Soc. (2) 18 (1978), 464-471. 6. R. Hunter, F. Richman, and E. Walker, Warfield Modules. In: Abelian Group Theory, Proceedings Las Cruces Conference 1976, Lecture Notes in Mathematics, Vol. 616 (D. Arnold, R. Hunter, and E. Walker, eds.), Springer-Verlag, Berlin-Heidelberg-New York, 1977, pp. 87-123. 7. I. Kaplansky, Infinite Abelian Groups, University of Michigan Press, Ann Arbor, 1969. 8. W. Liebert, Endomorphism rings of reduced torsion-free modules over complete discrete valuation rings, Trans. Amer. Math. Soc. 169 (1972), 347-363. 9. W. May, Isomorphism of endomorphism algebras over complete discrete valuation rings, Math. z. 204 (1990), 485-499. 10. - - - , Endomorphism algebras of not necessarily cotorsion-free modules, Contemp. Math., Vol. 130, 1992, pp. 257-264. 11. W. May and E. Toubassi, Endomorphisms of rank one mixed modules over discrete valuation rings, Pac. J. Math. 108 (1983), 155-163. 12. S. Shelah, Infinite abelian groups, Whitehead problem and some constructions, Israel J. Math. 18 (1974), 243-256. 13. K. Wolfson, Isomorphisms of the endomorphism rings of torsion-free modules, Proc. Amer. Math. Soc. 13 (1962), 712-714. DEPARTMENT OF MATHEMATICS, UNIVERSITY OF ARIZONA, TUCSON, ARIZONA
E-mail address: [email protected]
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
85721
This page intentionally left blank
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
http://dx.doi.org/10.1090/conm/171/01778 Contemporary Mathematics Volume 1 'Tl, 1994
Bext2 (G,T) CAN BE NONTRIVIAL, EVEN ASSUMING GCH MENACHEM MAGIDOR AND SAHARON SHELAH ABSTRACT. Using the consistency of some large cardinals we produce a model of Set Theory in which the generalized continuum hypothesis holds and for some torsion-free abelian group G of cardinality Nw+l and for some torsion group T Bext 2 (G, T) "# 0. Hence G.C.H. is not sufficient for getting the results of [10).
1. INTRODUCTION All groups in this paper are abelian groups. For basic terminology about abelian groups in general we refer the reader to [9]. For terminology concerning Butler groups see [2, 1, 3, 10, 8]. It is commonly agreed that the three major questions concerning the infinite rank Butler groups are: (1) Are B1-groups necessarily B2-groups? (2) Does Bext 2 (G, T) = 0 hold for all torsion-free groups G and torsion groups
T?
(3) Which pure subgroups of B2-groups are again B2-groups? In particular: is a balanced subgroup of a B2-group a B2-group? In [2] it is shown that the answer to all these questions is "Yes" for countable groups G. In the series of papers [1, 4, 3] it was shown that under the continuum hypothesis the answer is "Yes" to all three questions for groups G of cardinality:::::; Nw. In [5] it is shown that the answer to question 2 is "No" if the continuum hypothesis fails. In a more recent paper [10] it is shown that in the constructible universe, L the answer is "Yes" to all three questions for arbitrary groups G. Actually [10] used only the generalized continuum hypothesis and that the combinatorial principle 0~~: holds for every singular cardinal K- whose cofinality is No. Is the use made in [10] of the additional combinatorial principle really needed or does the affirmitive answer to our three questions follow simply from G.C.H.? Let us mention that a key tool used in [3, 10] was the representation of an arbitrary torsion-free group as the union of a chain of subgroups which are countable unions of balanced subgroups. In [7] it is shown that such a representation is equivalent to a weak version of 0~~:. 1991 Mathematics Subject Classification. 20K20, 20K40;Secondary 03E55, 03E35. Key words and phrases. Butler Groups, Balanced Extensions, Consistency Proofs. The research of the second named author was supported by the Basic Research Foundation of the Israeli Academy of Science (Publ. No. 514). This paper is in final form and no version of it will be submitted for publication elsewhere. ©
1994 American Mathematical Society 0271-4132/94 11.00 + 1.25 per page
287
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
MENACHEM MAGIDOR AND SAHARON SHELAH
28~1
In this paper we show that at least for getting an affirmitive answer to questions 2 and 3, one needs some extra set theoretic assumptions in addition to G.C.H. We do it by producing a model of Set Theory, satisfying G.C.H., in which for some torsion-free G of cardinality Nw+l and some torsion T, Bext 2 (G, T)-=/:- 0. Also in the same model there will be a balanced subgroup of a completely decomposable group which is not a B 2-group. Hence the answer to question 3 in this model is "No". The construction of the model requires the consistency of some large cardinals, which can not be avoided since getting a model in which D~< fails for some singular K- requires assumptions stronger than the consistency of Set Theory. Let us stress that the status of question 1 is not known and it is possible (though unlikely) that the implication "every B 1-group is a B 2 -group" is a theorem of Set Theory. Since this paper is aimed at a mixed audience of set theorists and abelian group theorists it is divided into two sections with very different prerequisites. In the next section we describe the construction of the model of Set Theory with certain properties to be listed below. In the following section we shall describe how to use the listed properties to get a group G which will be the counterexample to Bext 2 (G, T) = 0. A reader who is not familiar with standard set theoretical techniques, like forcing, can skip the set theoretic section and simply assume the properties of the model listed below. We do assume some basic Set Theory at the level introduced by [6]. We now describe the properties of the model which will be used in the construction of the counterexample to questions 2 and 3. The model will naturally satisfy G.C.H. Hence by standard cardinal arithmetic N~ 0 = Nw+l· Therefore we caJO. enumerate all the w-sequences from Nw in a sequence of order type Nw+l· Let (!,~Ia: < Nw+l) be this enumeration. Let Fa be the range of fa· The important property of the model is the following: For some stationary subset S of Nw+l such that every point of S has cofinality
c/3
Nl,and for some choice of a cofinal set in {3 of order type and for some fixed countable ordinal 8 we have:
WI,
for every {3 E
s
(1)
has order type 8 for every D ~ C13 which is cofinal subset of C13 and for every {3 E S. In particular forD= C13
has order type 8.
(2) If {3-=/:- 'Y both in S, then E13 n E'Y has order type less than 8. (3) 8 is an indecomposable ordinal, namely 8 can not be represented as a finite sum of smaller ordinals. Or equivalently, 8 is not the finite union of sets of ordinals of order type less than 8.
Denote the conjunction of all the properties above by(*). The main theorem of Section 1 is
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
Bea:t 2 (G, T) UNDER GCH
289
Theorem 1. Assume the consistency of a supercompact cardinal. Then there is a model of Set Theory in which {*) holds. The model also satisfies the Generalized Continuum Hypothesis. The construction of the model is very close to the construction in [11]. The main tool that will be used to get in Section 3 an example of a group G satisfying Bext 2(G, T) =f 0 is the notion of No-prebalancedness (see [8]). We are rephrasing the original definition in a form which is clearly equivalent to the original definition. Definition 1. Let G be a pure subgroup of the group H. G is said to be Noprebalanced in H if for every element h E H- G there are countably many elements go, 91, . . . of G such that for every element g of G the type {in H) of h- g is bounded by the the union of finitely many types of the form lh- 9i for some natural number l. More explicitly for some n, lEw
t(h- g) :::; t(lh- go) U ... U t(lh- 9n)· Also the group G is said to admit an N0 -prebalanced chain if G can be represented as a continuous increasing union of pure N0 -prebalanced subgroups where at the successor stages the factors are of rank 1. We shall use the following fundamental result of Fuchs ([8]): Theorem 2. A torsion-free group G admits an No-prebalanced chain if and only if in its balanced projective resolution
{where C is completely decomposable) B is a B2-group. Moreover, if CH holds, then this condition is equivalent to Bext 2(G, T) = 0 for all torsion groups T. The main result of Section 3 will be Theorem 3. If{*) holds, then there is a torsion-free group G of cardinality Nw+l which does not admit an N0 -pre balanced chain. Using theorem 2 we get Corollary 4. If{*) holds, then there is a group G of cardinality Nw+l such that Bext 2(G, T) =f 0 for some torsion group T. By using the balanced projective resolution of G we also get Corollary 5. If (*) holds, then there is a balanced subgroup of a completely decomposable group of cardinality Nw+l which is not a B 2-group.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
290
MENACHEM MAGIDOR AND SAHARON SHELAH
2. THE CONSISTENCY OF (*)
In this section we shall prove Theorem 1. We assume familiarity with some basic large cardinals notions like supercompact cardinals and some basic forcing techniques. We start from a ground model V having a supercompact cardinal K. We can assume without loss of generality that V satisfies G.C.H. We let JL = K+w and >. = JL+ = K+w+l. In our final model JL will be Nw and>. will be Nw+l· It follows from the results of Menas in [12] that there is a normal ultrafilter U on P,.(>.) such that for some set A E U the map P - sup(P) on A is one-to-one. (Recall that P,.(>.) is the set of all subsets of>. of cardinality less than K). Fix such U and A. Also fix an enumeration (g0 I a < >.) of all the w-sequences in JL· Standard facts about normal ultrafilters on P,.(>.) imply that the set of all P E P,.(>.) satisfying the following properties is in U: (1) The order type of P n JL is a singular cardinal of cofinality w such that the order type of P is its successor. (2) For a E >.the range of g0 is a subset of P n JL if and only if a E P. Hence we can assume without loss of generality that every P E A satisfies all the above properties. Again standard arguments show that the set T = {sup(P) I P E A} is a stationary subset of>.. For a E T, let Pa. be the unique P E A such that sup(P) =a. Note that for PEA and Q ~. P we have that if Q is cofinal in sup(P), then the order type of Q* = U{range(ga.) I a E Q} is the same as the order type of P n JL· This holds since otherwise Q* has cardinality smaller than ti =the order type of P n JL· Hence, by our G.C.H. assumption, we have less than ti a's such that the range of ga. is in Q*, hence less than the order type of P, which is a regular cardinal. Therefore Q must be bounded in P. For a E T the map a - the order type of Pa. n JL maps T into K. Hence it is fixed on some subset S which is still stationary in >.. Let ti be the fixed value of this map on S. Note that for a E S the order type of Pa. is o+.
Claim 6. Let a and (3 be two different members of S. Then Pa. n P13 n JL has order type less than ti. Proof. Let X = Pa. n P13 n JL· Note that if g is an w-sequence from X, then g = gp for some p E Pa n P13. If X has order type ti, then (using the fact that ti is a singular cardinal of cofinality w) we have o+ w-sequences from X, so that Pa. nP13 must have order type which is at least o+. Since the order type of both Pa. and P13 is o+, Pa. and P13 must have the same sup. This is a contradiction. D The model which will witness (*) will be obtained from V by collapsing ti to be countable, followed by the collpasing all the cardinals between o++ and K to have cardinality o++. Denote the resulting model by V1 • Note since V satisfies G.C.H. then the resulting model satisfies G.C.H. Also ti is of course countable, o+ is N1 , JL is Nw and>. is Nw+l· Since the cardinality of the forcing notion is K .,Sis still a stationary subset of>.. Note that now we have for every a E S that the cofinality of a is N1 . In order to verify (*) in the resulting model we fix an enumeration (f'Y I 'Y < >.) of all the w-sequences from Nw = JL· And as in the previous section let F'Y be the range of f"~' (Note that in V1 there are new w-sequences so that the enumeration (g'Y I 'Y < >.) we had in V enumerates only a subset of the set of all w-sequences). For 'Y < >. let 77('Y) be the unique 17 such that g"f = J.,. Without
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
291
Be:z:t 2 (G, T) UNDER GCH
loss of generality {by reducing 8 to a subset which is still stationary in >.) we can assume that for a: E 8 if "Y < a:, then TJ("Y) l. Then either for some 1 $ j $ g, the J..L-th member of E13 is the same as the J,.L-th member of E133 or for some 1 $ i $ k, the J,.L-th member of E13 is in Fa;. Proof. By assumption ly13 - z is divisible by p =
(2)
f
ly/3- z = P(L rmX-rm m=l
u
in G. Hence
p~ v
+ LStYI'/t + L Wq (Yvq- x~q)). t=l
q=l Pq
where the r m's , the St 's and the Wq 's are integers. Let us define a (bipartite) graph P, whose nodes are all the symbols (x's and y's) appearing in equation 2, where Yp is connected by an edge to x< iff for some 1 $ q $ v, p = Vq, ( = eq and Pq = p. Let w be the connected component of Y/3 in P and let a E Q be the sum of all the coefficients in the right side of equation 2 of symbols in W. a is easily seen to be a member of pQP, where QP is the ring of rationals whose denominators are prime to p. This is true because the only summands on the right side of 2, that can possibly add to a a rational number which is not in pQP, is of the form ~ Pq (Yvq - Xc.,q ) where Pq = p. But in this case Yvq and x~q are connected by an edge of P, so they are both in W or both outside of W. In both cases the contribution of this summand to a is 0.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
Be:J:t 2 (G, T) UNDER GCH
293
We use the fact that the sum of the coefficients of symbols in W must be the same for the left side and the right side of 2. Of course Y/3 E W and its coefficient in equation 2 is l which is not in pQP, so there must be a symbol in W appearing in the representation of z, so that either Xo:; E W for some 1 ~ i ~ k, or Y/3i E W for some 1 ~ j ~ g. Our lemma will be verified if we prove
Claim 10. (1) Ify., E W, then the JL-th member of E., is the same as the JL-th member of E13. (2) If x"f E W, then f"f(n) is the JL-th member of E13.
Proof. The proof is by induction on the length of the path in P leading from Y/3 to the symbol y., and x"f respectively. If this length is 0, we are in the case where the symbol is y., = Yf3, and the claim is obvious. For the induction step, in the first case we are given y.,. Let x"f be the element preceding y., in the path leading from Y/3 toy.,. By the induction assumption f"f(n) is the J.L-th member of E13. x"f and Y/3 are connected by an edge of P, so that 'k(y.,- x"f) is one of the generators of G. Hence 'Y E c., and f"f(n) is the J.L-th member of E.,, and the claim is verified in this case. The other case (the x"f case) is argued similary where y., is now the element in the path preceding x"f. D D For z E G13 let S(z) be the set of all elements 'Y of E13 such that for some JL < 8 and n E w, 'Y is the J.L-th member of E13 and ly13 - z is divisible in G by p~ where p~ > l. It follows from lemma 9 that for z E G13, S(z) is included in a finite union of singletons and of sets of the form E., n E13 for 'T1 < (3. So S(z) is a finite union of sets of order type less than 8. 8 is an indecomposable ordinal, so for z E G13 the order type of S(z) is less than 8. By definition of D, every element of D*, except possibly finitely many, is in Uo
For infinite cardinal number
zf
G e H. Let ¢:
=
--1
G and ¢1.: G
j E K be the natural projections. An element x in =
};.
~E K
zf
let
K
< e1> for
--1
zf
is written x
n.e. with n-EZ. If sCK, then e = };.Ee. and ll(s) ~ ~ ~ s ~ s ~
denotes DiEs< ei>. We assume a basic knowledge of slender groups such as is found in [2]. In particular for ;·E
zf
above, if S is a partition of
and
K
K, then ¢/ll(s)) equals 0 for almost all s E S. DEFINITIONS 3. Assume Premise 2. Let 1r .: ll( K)
--1
J
< e > be J
the natural projection. A subset X of D( K) is summable if, for every j E
1r}x) = 0 for almost all x E X. Henceforth "summable" will
K,
nK, ).
always be in reference to the decomposition ll(K) (=
zf.
Let
~
If x
E .. n .e. (n . E Z) for
each x E X, then, for every j E K., nxj
0 for almost all x E X.
X be a summable subset of
w·e write ExEXmxx (mx E Z)
~EK
for the element
X~
~
XZ
EiEK.(ExEXmxnxi)ei
(the sum in parenthesis is finite). Give Z the discrete topology and
Z11' the corresponding product topology. Then
X is completely independent if
mX =
0 for all
completely independent summable subset of
X
E
zf,
x.
If X
is a
then we may write
= nxEx.
PROPOSITION 4. Let M be a direct summand of
an infinite summable subset of M.
zf.
Let X be Then M contains a completely
independent summable subset Y such that
I Yl = IXI
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
and
zf =
DIRECT SUMMANDS OF Z" FOR LARGE
nyE y
ED
and C ~
z!l
317
~
y
c where the left product is the closure
of y zn IT(x;)
for some a.
PROOF. Let M = G in Premise 2. By replacing each x E X by
xfnx for suitable integer
nx we may assume
is a pure
subgroup (hence a direct summand) of G for each x E X. Let v
IXI.
xa
E
< v: a finite subset J a of x;, X and, for F = EDJ , a decomposition F = ED aa z aa
First we find for each ordinal a
G a such that xa = fa+ ha for some ha E II(Ja+l) where, for each {J < v, I{J = x;- u1. Let A be a K,-complete maximal ideal in
P( K,) containing all singletons. Then (1)
M = , (2) M ~
zK'
zK'
< e/l, >
=
m M where
yet (3) M is not the closure in
II(K,) of any completely independent summable subset X. PROOF.
(1) ·This decomposition of
zK'
is well-known and
follows easily from the definition of measurable (e.g. see the Remark after Theorem 94.4 in [2] and Example 3 in [6]). (2) If j E
zK'
=
(3)
then
K,,
m II.,J. So M -~ z'l'j ~- II.,J. ~rrrJ. 2 rrrJ 2
Suppose
M
equals the closure
x·
in II(/l,)
of a completely
'E jEK,nx/j ( nxj
independent summable subset X. Write x =
zK'. E
Z)
for x E X and ei = 'E XEXmixx (mix E Z) for i E /l,. For each j E /l, n . = 0 for almost all x. Also, for each x E X, m. = 0 for almost XJ 2X
all
i
(consider the projections:
slender).
zK'
X
which is 'E xm.2Xx which, by
-1M= For each i then we have e . = 2
-1
Definitions 3, equals 'E ('Exm. n .)e. where the sum in parenthesis is J 2X XJ J finite and equals 6.. (the Kronecker delta). Now the element 2J
'E x('E iEK,mix)x
in
which,
the
since
equals, by definition,
X
sum
in
'Ef'E.('Exm.n .)]e.= 'E(E.6 ..)e. J 2 2X XJ J J M. Therefore M =I=
2
the
2J J J J
'E }'E x('E iEK,mix)nx)ej
brackets
'E.e.
is
e,.
"'
X
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
finite,
But
ell,
equals is not in
JOHN D. O'NEILL
320
PROPOSITION
7.
Assume Premise 2. Suppose that ¢( ei) = 0
for every i E J, a subset of '"' Let A = {s E P(J): ¢(ll(s)) = 0}. Let p, be the least measurable cardinal number. (a) A is a p,- complete ideal in the Boolean algebra P( J) containing all singletons. (b) Let W be a subset of P(J) - A such that X n Y E A for all X :/= Y in W. Then: (i) I WI ~ If, and (ii) G contains a summable subset X where I XI = I WI. (c) A is a If,+ -saturated in P( J). (d) If I Jl = If, and A is If, -complete, then A contains an element of size K,.
A is an ideal in P(J) containing all singletons. Let S be a subset of A of cardinality < p,. We must PROOF.
(a)
Clearly
show the supremum of S is in A. We may assume the elements in
S are pairwise disjoint. Let x show ¢(x)
=
0. For each j E
If,
=
EsEsXs for xs E ll(s). We must
¢/xs)
=
0 for each s so ¢/x)
=
0 by Theorem 94.4 in [2). Therefore ¢ (x) = 0. (b) (i) For jE
If,
let Wj = {wE W: ¢/ll(w))
:/=
0} We will
show each W j is finite. Since W is the union of all W j' IWI will be ~
If,.
Let { w }, n E IJJ, be a countable subset of W. For fixed j n
E K, it will suffice to show ¢ (ll( w )) = 0 for almost all n. Since wn
n wm
J
E
A for n
:/=
n:,
n there is a partition Q of P(J) of
n n=n nx + y where { x } is a set of pairwise disjoint members of Q and each Yn is a sum of < 21JJ cardinality ~ 21JJ such that each w
elements in A
n Q. Each yn is in A since A is p,-complete. As a
result ¢/ll(wn)) = ¢/ll(xn)) for each n. Since the xn are pairwise
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT SUMMANDS OF Z 10 FOR LARGE
321
tc
disjoint, ¢/IT(wn)) = 0 for almost all n. Therefore Wj is finite. (ii) For every w E W choose xw E IT( w) such that ¢(xw)
t
0.
Then X= {¢(xJ: wEW} issummableand lXI = IWI. (c) This follows from (b). (d) This follows from (c) and from Lemma 1a if we identify J with K there. PROPOSITION 8. Assume Premise 2. If H group N, then H ~ zf. PROOF. H ~ NED ( zft rv
(GED
H)K
=
(zf)K
~
zf.
rv
NED ( G ED NED
rv
zf)K
NED zf for some
rv
(
G ED NED
zft
PROPOSITION 9. Let z* is fully invariant in G since N is an ideal of E. By hypothesis, * is finitely generated over E.
Let Ki d~.< NiG >* / < Ni+ 1 G >*. By Theorem 2.1, it suffices to show that < Ni+ 1 G >* is a quasi-summand of< NiG >* for 0 :5: i < k- 1 and that N(End(Ki)) is zero for 0 :5: i :5: k - 1.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
AGNES T. PARAS
328
The group Ki is a finitely generated S-module since if x1, ... , Xn generate * over E then *= I:~=l Exi ~ I:~=l Nxi + I:~=l Sxi. Hence, Ki ~ I:~=l S(xi+ *), where xi+ *E Ki. By the preceding lemma, Ki is S-finitely generated. Recall that if Q ® S is semisimple then S is Noetherian. By the change ofrings theorem (cf. [8]),
Since Q ® S is a semisimple and Artinian ring, Q ® Ki is projective and finitely generated over Q ® S. Hence, there exist hi E HomQ&S(Q®Ki, Q®S) and Yii E Q®Ki (j = 1, ... , ni for some ni) such that ify E Q®S then y = I:j~ 1 hi(Y)·Yii· Since there are finitely many Yii 's, there is a positive integer l such that l.yii E Ki (j = 1, ... , ni and 0 :::; i < k -1). By the aforementioned isomorphism, there is a positive integer k such that k.fii E Homs(Ki, S) (j = 1, ... , ni , 0:::; i < k -1). Let m = max{k,l}. Then m.fii E Homs(Ki,S), m.yii E Ki (j = 1, ... ,ni, 0:::; i < k- 1) and m 2 .y = I:j~ 1 mfii(y).myii for y E Ki. It is now easy to see that the exact sequence
almost splits, i.e., < NiG >*~< Ni+lG >* tJJHi , where Ki ~ Hi ~< NiG >*. So G ~< Nk-lG >* tBHk_ 2 tB · · · tB H 1 tB H 0 • Thus it remains to determine the group structures of * and Hi (0:::; i < k -1). To complete the proof, we show that the endomorphism ring of Ki is quasiequal to the ring of endomorphisms induced on Ki byE and N(End(Ki)) = 0. Since < NiG >*~< Ni+lG >* tBHi , we have >.i : Ki - t Hi, an isomorphism, such that vi>.i = m 2 .1K;. Let Ei be the ring of endomorphisms induced on Ki by E. If a E E and x E*, define a(x) = a(x), where a(x) E Ki. Suppose
-
=
·~
-
.
that f3 E End(Ki)· Then f3 >.if3vi E Hom(< N'G >*,Hi)· The elements of Hom( *, Hi) may be extended to endomorphisms of
1by defining the image of Hi-l tB · · · tB H 0 to be zero. Note that Gi ~ G and so End(Gi) ~E. Thus we can view Hom(*,Hi) as embedded in End(Gi)· Now m 2/3 = vi>.i/3 and m 2/3(x) = m 2 /3vi(x) = vi>.i/3vi(x) = vif3(x) = f3(x) imply m 2 /3(x) = f3(x) for x E*. Hence, m 2 /3 is induced on Ki by /3. Therefore End(Ki) ~ Ei· Note that the action of E on Ki is equivalent to the action of E / Li where
N ~ Li d~£- {a E E I aNi ~ Ni+ 1 } and Li is an ideal of E. Let N; be the nil radical of E/Li and suppose N; = Mi/Li where Li ~ Mi ~E. Since Q is a flat Z-module (cf. [4, p. 153]), the short exact sequence
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ABELIAN GROUPS AS NOETHERIAN MODULES
329
tensored with Q yields the short exact sequence 0 - Q ® LdN - Q ® E IN - Q ® E I Li - 0. Since the algebra Q ® E IN is semisimple and Artinian,
where ~i is a division ring. The only ideals of Q ® E IN are the ring direct Hence Q ® EILi ~+ Mn;j(~ij) and sums of subcollections of the Mn;(~i)· J(Q®EILi) = 0. It follows that N(End(Ki)) = 0. Similarly, N(End( < Nk-lG >*)) = 0 since End(< Nk-lG >*) is quasi-equal to the set of endomorphisms of G restricted to < Nk-lG >*. Hence, Ki ~ Hi (0 ::; i < k - 1) and < Nk-lG >* are of the form described in Theorem 2.1. Therefore, G is quasi-equal to a direct sum of strongly irreducible groups. Conversely, suppose that G ~ EBi=l Ai where each Ai is strongly irreducible. If H =/= 0 is a fully invariant subgroup of G then H ~ EBi= 1 (HnAi)· If (HnAi) =I= 0 then End(Ai)(H n Ai) ~ (H n Ai)· Since Ai is strongly irreducible, H n Ai is quasi-equal to Ai and End(Ai)-finitely generated. Hence, His End(G)-finitely generated. Since 0 =/= H was an arbitrary fully invariant subgroup of G, it follows that G is E-Noetherian. D REMARK 3.3. For the proof of necessity, we only need the fact that < NiG >* is finitely generated over E for each i. Thus, if G is E-finitely generated then G is E-Noetherian if and only if * is finitely generated over E for each i.
4. Endomorphism Rings of E-Noetherian Groups To complete our characterization of E-Noetherian groups, we consider now their endomorphism rings. If G is E-finitely generated and E is left Noetherian then, certainly, G is E-Noetherian. However, G need not be E-Noetherian if End( G) is left Noetherian. For example, the ring of integers Z is left Noetherian. If End( G) ~ Z then G is E-Noetherian if and only if G is a free Z-module. Thus any group G that is not free with End( G)~ Z is notE-Noetherian. For example, consider the subgroup G =< ~ I pis a prime integer> of Q. Here End( G)~ Z. More generally, it is well known that there are torsion-free groups of essentially any rank with Z as endomorphism ring. LEMMA 4.1. Let A and M be groups. Let R be a ring and M be a Noetherian R-module. Then Hom{A,M) is Noetherian over R. PROOF. Let {a1. ... , an} be a maximal Z-independent subset in A and let F =< a1, ... , an>. Note that F is a full, free subgroup of A. Consider the R-homomorphism {3: Hom(A, M)-+ Mn where {3(/) = (/(a1), ... , f(an)) ,
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
AGNES T. PARAS
330
for f E Hom( A, M). Since F is full in A and M is torsion-free, {3 is monic. Hence, Hom( A, M) imbeds in Mn as an R-submodule. Since M is Noetherian, so is Mn. Thus Hom( A, M) is finitely generated over R, indeed is itself Noetherian over R. D COROLLARY
4.2. Let A and M be groups.
(i) If M is an E-Noetherian group then Hom{A,M) is Noetherian as module over End{M).
(ii) If M is a strongly indecomposable and strongly irreducible group then Hom(A,M) is Noetherian over End{M). LEMMA 4.3. Let S be a strongly indecomposable and irreducible group. Let R be a group such that Hom(S, R) =/= 0 and n{ kerf If E Hom(R, S)} = 0 . Then S is isomorphic to a subgroup of R. PROOF. For f E Hom(R, S) define I(!) = {! o g I g E Hom(S, R)}. Then I(!) is a right ideal of End(S). Clearly, I(!) = 0 if and only if g(S) ~ kerf for all g E Hom(S, R). If I(!)= 0 for all f E Hom(R, S) then
g(S) ~ n{ker
I
I IE Hom(R, S)} = 0
for all g E Hom(S, R). Hence Hom(S, R) = 0. This violates the hypothesis, so I(!) =/= 0 for some f E Hom(R, S). Since End(S) is a fullsubring of a division ring under our hypothesis, we have I(!)= End(S). Then there is a non-zero integer k such that k.ls E I(!), so there exists g E Hom(S, R) such that f o g(s) = ks for every s E S. Thus g is monic and the result follows. D COROLLARY 4.4. Let R and S be strongly indecomposable irreducible groups such that Hom(R, S) =/= 0 and Hom(S, R) =/= 0. Then R ~ S. PROOF.
The subgroups n{ ker
I
I IE Hom(R, S)} and n{ ker gIg E Hom(S, R)}
are fully invariant in R and S, respectively, so are full or are 0. They are not full since Hom(R, S) =/= 0 and Hom(S, R) =/= 0, so they are 0. Then Lemma 4.3 applies symmetrically to give monomorphisms R 2 (and A is connected), then there do exist exceptional modules which are neither preprojective nor preinjective, see [R4].
3. The algorithm for obtaining all exceptional modules For any hereditary artin algebra A, a pair (X, Y) of exceptional A-modules is called an exceptional pair provided that we have Hom(Y, X)
= 0,
Ext 1 (Y, X)
= 0.
An exceptional pair (X, Y) will be called orthogonal, provided that also Hom(X,Y)
=0
is satisfied. If (X, Y) is an orthogonal exceptional pair, we may consider the category C(X, Y) of all A-modules M which have a filtration with factors isomorphic to X and Y. This is an exact abelian subcategory with two simple objects, namely X and Y, it is equivalent to the category of all B-modules of a hereditary artin algebra B with s(B) = 2 (see, for example [R1], section 1). Since C(X, Y) is equivalent to the module category for a hereditary artin algebra B, we may consider those objects in C(X, Y) which correspond under an equivalence to preprojective, or preinjective B-modules, and we will call them preprojective or preinjective objects in C(X, Y), respectively. Since C(X, Y) is closed under extensions inside the category of all A-modules, we see that the preprojective and the preinjective objects in C(X, Y) are exceptional A-modules. For any natural number n, we define a class en = en(A) of indecomposable modules of length n inductively as follows: Let e1 be the simple A-modules. Let us asusme now that for some n > 1 the classes e1, ... 'en-1 already have been defined. Let en be the class of indecomposable A-modules M of length n with the following property: there is an orthogonal exceptional pair (X, Y) with both modules X, Yin U~; 1 1 e, such that M is preprojective or preinjective in C(X, Y). Finally, let = U,> 1 We obtain in this way a class of exceptional A-modules and we claim that all exceptional A-modules belong to this class:
e
THEOREM
e,.
1. The class
e is the class of all exceptional A-modules.
The proof will be given below using the braid group operation on the set of the socalled exceptional sequences. CoROLLARY 1. If X is an exceptional A-module, then End(X) is isomorphic to End( S) for some simple A -module S.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
EXCEPTIONAL SEQUENCES
343
Proof: H (X, Y) is an orthogonal pair of exceptional A-modules, and M is preprojective or preinjective inC= C(X, Y), then End{M) is isomorphic to End{X) or to End{Y). For example, assume that M is preprojective in C. Observe that Y is simple projective in C. The projective cover Z of X inC is an indecomposable module with endomorphism ring isomorphic to End{X). We denote by rc the Auslander-Reiten translation in C. Since M is preprojective inC, it is either of the form Tcty for some t E N0 , and then its endomorphism ring is isomorphic to End{Y), or else it is of the form Tct Z for some t E N0 , and then its endomorphism ring is. isomorphic to End{Z), and therefore isomorphic to End{X). In a similar way one deals with the case when M is preinjective. COROLLARY 2. If X is an exceptional A-module, then dim X is a real root for ~(A).
Proof: It is well-known that the bilinear form (-, -) on zn = K 0 (A) has the following homological interpretation: Given A-modules M,N, let (dimM, dimN) = dimA: Hom(M, N)- dimA: Ext 1 (M, N). Then, according to [R1), Lemma 2.2, (dimM,dimN) = (dimM,dimN) + (dimN,dimM). Assume now that {X, Y) is an orthogonal pair of exceptional modules, and assume that we know already that dim X and dim Y are real roots. Let W xY be the subgroup of W generated by r dim x and r dim y. Then the dimension vectors of the preprojective and the preinjective objects inC belong to the orbits of dimX and dimY under the operation of Wxy, see [R1), 3.2. It follows that the dimension vectors of the preprojective and the preinjective objects inC are real roots for ~(A).
4. The exceptional pairs in the case s
= 2.
Let us now assume that s = s(A) = 2, and let P, Q be the simple modules; we may assume that Ext 1 (P, Q) = 0. LEMMA. If M is an exceptional module, there are exceptional modules M-, M+, unique up to isomorphism, such that (M-, M) and (M, M+) are exceptional pairs. Proof: An exceptional module M is an indecomposable A-module which is either preprojective or preinjective. In case A is representation finite, let P 1 , •.• , Pm be the indecomposable modules, with Hom( Pi, PH1) =F 0, for all 1 :5 i < m. In particular, we have P1 = P, Pm = Q. Let pi+ = Pi+l for 1 :5 i < m, and pi- = Pi-1 for 1 < i :5 m. Let P! = Pm, and P;:; = P1. (Note that in this case m = 2, 3, 4 or 6; the corresponding Cartan matrices ~(A) are labelled At x At, A2, 82 and 6 2, respectively - these are just the Cartan matrices arising for the finite-dimensional semisimple Lie algebras of rank 2.) In case A is representation infinite, there are countable many indecomposable preprojective modules and countably many indecomposable preinjective modules,
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
344
CLAUS MICHAEL RINGEL
and we may label them in the following way (see again [R1]): let {Pil i E Nt} be the indecomposable preprojective modules, and {Q;I i E N 1 } the indecomposable preinjective modules with
It follows that Pt = P, Qt = Q. In this case, P;+ = Pi+t. and Qi = QH- 11 for all i ~ 1; similarly, P;- = P;-t, Qt = Q;-t for all i ~ 2, finally, let PI = Qt, Qt =Pt.
Note that all the exceptional pairs (X, Y) different from (Q, P) satisfy Hom(X, Y) :f; 0.
5. Exceptional sequences and the braid group A sequence X = (X11 ••. , Xn) is called exceptional, provided that any pair (X;, X;) with i < j is exceptional. Actually, we only are interested in isomorphism classes of modules, not in the modules themselves: thus, an exceptional sequence will be considered as a sequence of isomorphism classes. An exceptional sequence X= (Xt, ... , Xn) with n = s(A) is said to be complete. Recall that the braid group Bn inn- 1 generators O't, ... , O'n-t is the free group with these generators and the relations u;ui+ 1 u; = O'i+tO';O'i+t for all1 ~ i < n- 1, and u;u; = u;u; for j ~ i + 2. Given an exceptional sequence (Xt. ... , Xn), we denote by C(Xt. ... , Xn) the closure of the full subcategory with objects X 1, •.• , Xn under kernels, images, and extensions. Of course, this is an exact abelian subcategory (in case (X, Y) is an orthogonal exceptional pair, this subcategory C(X, Y) coincides with the full subcategory of all modules with a filtration with factors isomorphic to X andY). The main ingredients for the definition of the operation of Bn on the set of complete exceptional sequences are the following three observations due to CrawleyBoevey: PROPOSITION 1. Let (X11 ••. , Xn) be an exceptional sequence. C(Xt. ... , Xn) is equivalent to the category of all B -modules for some hereditary arlin algebra B with
si(B)
= n.
PROPOSITION 2. Let (Xt, ... , Xn) be an exceptional sequence of A-modules. If (Y, Y') is an exceptional pair in C(X;, X;+t), then
i.9 an exceptional sequence of A-modules. PROPOSITION 3. Let (X11 ••• , X;-t, Xi+t. ... , X 8 ) be an exceptional sequence, where 1 ~ i ~ s. Then there exists a unique module X; such that (Xt. ... ,X8 ) is a complete exceptional sequence.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
EXCEPTIONAL SEQUENCES
345
For a proof of these assertions, we refer to [CB); his assumption concerning the base field is not used in this part of the paper. We should mention that these results of Crawley-Boevey were motivated by the work mainly of Gorodentsev, Rudakov, and Bondal, but also others, dealing with exceptional sequences of vector bundles (see the papers [GR], [G], [B] and the collection [Ru]); in these papers, a corresponding action of the braid group had been introduced. The natural setting of such braid group actions seems to be in the context of triangulated categories (say the corresponding derived categories). Actually, as Crawley-Boevey has pointed out, one may use the arguments of [G], section 3.3, in order to obtain also the braid group operation on the set of exceptional sequences of a hereditary artin algebra. The proof presented in [CB] is rather straight-forward, it only uses properties of perpendicular categories. Let (X, Y) be an exceptional pair. Recall that C(X, Y) is equivalent to the category of all B-modules, where B is a hereditary artin algebra with s(B) = 2. Thus, we may consider inside C(X, Y) the exceptional m~dule y+; our notation will be r(X, Y) = y+, this module is the unique object in C(X, Y) such that (Y, r(X, Y)) is again an exceptional sequence. Similarly, let l(X, Y) = x- be the unique object in C(X, Y) such that (l(X, Y), X) is an exceptional pair. Given an exceptional sequence X= (X1, ... ,Xn) of A-modules and 1 :::; i < n, we define
and
u; 1(X)
= (X11 ... , Xi-1! l(X;, Xi+ I), Xi, Xi+2, ... , Xn)·
In this way, we obtain an action of the braid group in n-1 generators 0'1! ... , O'n-1 on the set of exceptional sequences: If i + 2 :::; j, then both u;u;(X) and u;ui(X) will be equal to
(the positions marked are those with index i, i+1 and j,j+1). On the other hand, let
Then whereas
ui+lO'iO'i+l(X)
= (... ,xi+2,r(Xi+l!Xi+2),Y', ... )
(only the positions i,i+1,i+2 are labelled). Since (Xi+2, r(Xi+ 11 Xi+2), Y) and (Xi+ 2, r(Xi+ 11 Xi+ 2), Y') are complete exceptional sequences in C(Xi, Xi+l,Xi+2), it follows from Proposition 3 that Y = Y'.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
CLAUS MICHAEL RINGEL
346
6. The reduction theorem Let X = (Xt, ... , Xn) be an exceptional sequence, let 1 ~ i < n. We say that u; is a transposition for X, provided that for Y = u;X, we have Yi+1 =X; (so that Y is obtained from X by just transposing X; and XH 1 ). The following assertion is easy to verify. LEMMA. Let X= (Xt, ... , Xn) be an exceptional sequence, let 1 ~ i < n. Then u; is a transposition for X if and only ifHom(X;, Xi+t) = 0, and Ext 1 (X;, Xi+t) =
0.
LEMMA. Let X = (Xt, ... , Xn) be an exceptional sequence, let 1 there exists t E Z such that Y = ufX satisfies Hom(Yi, Yi+t) = 0.
~
i
< n. Then
PROOF. We apply the considerations of section 4 to C(X;, XH 1 ). We say that uf is a proper reduction for X, provided that Y Hom(Yi, Yi+t) = 0, whereas Hom( Xi, Xi+t) '# 0.
= uf X
satisfies
An exceptional sequence X = (Xt, ... , Xn) is said to be orthogonal, provided that we have Hom(X;,X;) = 0 for all i '# j. THEOREM 2. Any exceptional sequence can be shifted by the braid group action to an orthogonal sequence using only transpositions and proper reductions. In order to give the proof, we need some preparations. For any A-module M, let IMI be its length. For a sequence X = (Xt. ... , Xn) of A-modules, let II XII = (IX.,..(t)l, ... , IX.,..(n)l), where 1r is a permutation of 1, ... , n such that IX.,..(t)l ? · · ·? IX.,..(n)l· For sequences x = (xt, ... ,xn), y = (yt, ... ,yn) in No, we write x ~ y provided that x; ~ y;, for alle 1 ~ i ~ n, and x < y, provided that x ~ y and x '# y. LEMMA. If u; is a transposition for X, then llu;XII reduction for X, then llufXII < II XII. PROOF. Let u;X
=
= IIXII.
(Yt, ... ,Yn)· Then Yj =X; for j
fl
Is uf is a proper
{i,i
+ 1},
whereas
Yi, Yi+I are the simple objects in the category C(X;, XH 1 ). Since we assume that
uf is a proper reduction, at least one of the modules X;, Xi+ 1 cannot be simple in C(X;, XH 1). However, if M is an indecomposable non-simple object in C(X;, Xi+t), then M has a filtration with factors of the form X; and Xi+t, and both types of factors appear at least once.
REMARK. If uf is a proper reduction for X, we have llufXII < IIXII, but we cannot demand to have llufXII ~ llu!- 1 XII ~ · · · ~ IIXII. For example, consider a hereditary algebra with two simple modules P, Q, where Pis projective, Q injective, such that the injective envelope of Pis of length 2, and the projective cover of Q is of length c-t-1, withe? 3. Let X= u~(Q,P). Then IIXII = c, whereas llutXII = c2 -c-1 > c, and llu1 1 XII = c + 1 > c. Of course, uf with t = -2 is a proper reduction for X, and for c ? 4, this is the only possible choice for t. PROOF OF THEOREM 2. Let X = (Xt. ... , Xn) be an exceptional sequence, and assume that X is not orthogonal. Choose a < b such that Hom(Xa, Xb) '# 0, but Hom(X;,X;) = 0 for the remaining a~ i < j ~b. Let cp: Xa--+ Xb be a non-zero
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
EXCEPTIONAL SEQUENCES
347
morphism. According to [HR], we know that cp has to be a monomorphism or an epimorphism. Consider first the case where cp is a monomorphism. This monomorphism induces epimorphisms Ext 1 (Xb, X;) --+ Ext 1 (Xa, X;) for all i. The first Ext-group is zero for b ~ i, thus the second Ext-group also vanishes for these i. We see that both Hom( X a, X;) = 0, and Ext 1 (X0 , X;) = 0 for a< i < b, thus
and always we just use transpositions. Now we apply some power of ub-1! say u~_ 1 , in order to replace (Xa,Xb) by (Q,P) with Hom(Q,P) = 0, thus we use a proper reduction. The case when cp is an epimorphism, is treated similarly: The map cp induces epimorphisms Ext 1 (X;, Xa) --+ Ext 1 (X;, Xb)· The first Ext-group is zero for i ~ a, thus also the second Ext-group vanishes for these i. We see that both Hom( X;, Xb) = 0, and Ext 1 (X;, Xb) = 0 for all a< i < b, thus
always using just transpositions. We now apply some power u! of u a in order to replace (Xa,Xb) by (Q,P) with Hom(Q,P) = 0; thus we use a proper reduction. Since a proper reduction always decreases IIXII, this process has to stop after a finite number of steps, and we obtain some orthogonal exceptional sequence. 7. The orthogonal complete exceptional sequences THEOREM 3. The orthogonal complete exceptional sequences are just those exceptional sequences which consist of the simple modules.
PROOF. Let X be an exceptional sequence. Let C(X) be be the smallest subcategory containing X and being closed under extensions, kernels of epimorphisms and cokernels of monomorphisms. If X is complete, then C(X) =A-mod, as CrawleyBoevey [CB] has shown (again without using any assumption on the base field). Since X1, ... , X 8 are orthogonal modules with division rings as endomorphism rings, C(X) is just the set of A-modules which have a filtration by modules of the form X;, see [Rl] (the process of simplification). This shows that any simple AmoduleS; has a filtration by modules ofthe form X;, thus for any S;, there is some 1r(j) with S; = X1r(j)· Since the length of the sequence X is s = s(A), it follows that any X; is simple. COROLLARY. Any complete exceptional sequence can be shifted by the braid group action to an exceptional sequence consisting only of simple modules by using only transpositions and proper reductions.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
348
CLAUS MICHAEL RINGEL
LEMMA. The complete exceptional sequences which consist of simple modules can be obtained from each other by the braid group action using only transpositions. This can be verified without difficulties. COROLLARY. The braid group acts transitively on the set of complete exceptional sequences. As mentioned in the introduction, this assertion, for A finite-dimensional over some algebraically closed field, is the main result of the paper [CB] by CrawleyBoevey. His proof relies on investigations by Schofield [S] dealing with semiinvariants of quivers, and this is the only part of the paper which uses the assumption on the base field. Actually, the decisive Lemma 7 in [CB] may also be shown directly, using considerations similar to the ones above.
8. Endomorphism rings of exceptional modules Given an artinian ring B, let J(B) be its radical, thus J(B) is the maximal nilpotent ideal of B. THEOREM 4. Let X = (Xt, ... , X be a complete exceptional sequence, let = B(X) be the endomorphism ring of EBi xi. Then B/J(B) is Morita equivalent 8)
B
to A/J(A).
PROOF. Let D(X) = B/J(B). Let Di be the endomorphism ring of Xi, and note that Di is a division ring, thus D = Tii Di. We claim that D(X) and D(uX) are isomorphic, for any braid group element u. Of course, it is sufficient to consider a generator ui, and we may assume that s = 2. But in this case the assertion is obvious.
9. Tilting sequences An exceptional sequence X = (Xt. ... , Xn) is said to be strongly exceptional, provided that we have Ext 1 (Xi,X;) = 0 for all i,j. A strongly exceptional sequence which is complete may be called a tilting sequence. We say that O"i is a p-extension for X, provided that Hom( Xi, Xi+l) = 0 (the letter p shall indicate that p-extensions are the usual procedure to construct indecomposable projective modules starting with simple modules; also in the general case considered here, we use the p-extensions in order to construct relative projective objects inside the subcategory of modules having a filtration with factors of the form xi.) THEOREM 5. Any exceptional sequence can be shifted by the braid group action to a strongly exceptional sequence using only transpositions and p-extensions. PROOF. Let X = (Xt. ... , Xn) be an exceptional sequence, and suppose it is not strongly exceptional. Choose a< b such that Ext 1 (Xa,Xb) '# 0, and such that b-a is minimal. We choose t with a ~ t ~ b maximal such that Hom(Xa, Xt) '# 0. Since Hom( X a, Xb) = 0, we even have a ~ t < b. Let r.p: Xa -+ Xt be a non-zero map.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
EXCEPTIONAL SEQUENCES
349
We claim that cp is an epimorphism. Since Ext 1(Xt,Xa) = 0, cp is a monomorphism or an epimorphism. Let us assume that a < t and that cp is a monomorphism; the map cp induces a surjective map
but the latter group is non-zero, whereas the first one is zero, by the minimality assumption on b-a. Thus, we obtain a contradiction. As a consequence, we see that Hom(Xt, Xi) = 0 for t < i $ b. For, a non-zero map '1/J: Xt --+ Xi can be composed with cp and will give a non-zero map Xa--+ X;., contrary to the maximality oft. Fort> a, we have both Hom(Xt, Xi) = 0, and Ext 1(Xt, Xi) = 0, for all t < i $ b; thus the consecutive application of first Ut, then CTt+l! and so on, finally CTb-1 yields just transpositions, and reduces b - a by 1. The assertion follows by induction. Thus, it remains to consider the case t = a. Since Hom(Xa, X;) = 0, and Ext 1(Xa, Xi) = 0, for all a < i < b, the application of first CTa, then CTa+l! and so on, finally CTb- 2 yields transpositions, and we obtain in this way an exceptional sequence Y with Hom(Yb-1, Yb) = 0, and Ext 1(Yb-l! Yb) '# 0 (here, Yb-1 = Xa)· Obviously, CTb- 1 is a p-extension for Y. In order to see that the process stops, let us introduce a set E(X) as follows: For any pair (u,v) with 1 $ u < v $ n, let E(X;u,v) be the factor group of Ext 1(Xu,X11 ) modulo the subgroup generated by the images of the induced maps Ext 1(Xu,() where(: X;--+ X, is a map with j < v. By definition, a pair (u,v) belongs to E(X) if and only if there exists a sequence u = uo < u1 < ... Um = v with m ~ 1 such that E(X; Ui-1! ui) '# 0 for all1 $ i $ m. If CTi is a transposition for X, then the sets E(X) and E(u;X) clearly will have the same number of elements. Thus, let u; be a p-extension for X; and let Y = CTiX. We claim that in this case the number of elements of E(Y) decreases by (at least) one. Let u < i, and i+1 < v. We note the following: We have E(Y;u,v) = E(X;u,v). Since Yi = XH11 it is easy to see that E(Y;u,i) = E(X;u,i + 1) and E(Y;i,v) = E(X;i + 1,v). There is an epimorphism l'i+I --+ Xi (with kernel a direct sum of copies of Yi); it induces an isomorphism between E(Y; u, i + 1) and E(X; u, i). Finally, assume that E(Y; i + 1, v) '# 0. Then we have E(X; i, v) '# 0 or E(X; i + 1, v) '# 0. In both cases, it follows that the pair (i,v) belongs to E(X). Altogether we see that (u,v) belongs to E(Y) if and only if it belongs to E(X); that (u,i) or (i,v) belongs to E(Y), if and only if (u, i+1), or (i+1, v) belongs to E(X), respectively, and that (u, i+1) or (i+ 1, v) belongs to E(Y), if and only if (u, i) or (i, v) belongs to E(X), respectively. Of course, (i, i + 1) belongs to E(X), but not to E(Y). This completes the proof. Given an exceptional sequence X, we denote by F(X) the set of A-modules which have a filtration with factors of the form X;. THEOREM 6. Let X be an exceptional sequence. Assume that T is a strongly exceptional sequence such that X can be shifted by the braid group action to T using only transpositions and p-extensions. Then the modules T; are just those indecomposable modules Min F(X) which satisfy Ext 1 (M,X;) = 0 for all i. PROOF. Let X= (X11 ... ,Xn)· Let 'P(X) be the set of A-modules Min F(X) which satisfy Ext 1(M, X;) = 0 for all i. If Y is obtained from X by a transposition or a p-extension, then on the one hand, all the modules Yi belong to F(X), thus
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
350
CLAUS MICHAEL RlNGEL
F(Y) ~ F(X) (and actually F(Y) c F(X) in the case of a p-extension), whereas, on the other hand, we have 'P(X) ~ F(Y), thus 'P(X) ~ 'P(Y). The latter implies that 'P(X) ~ 'P(T). Of course, 'P(T) = F(T) is just the additive subcategory add T generated by the modules T;.. It is known (see [DR], Theorem 2) that 'P(X) has precisely n isomorphism classes of indecomposable objects, thus 'P(X) =add T.
THEOREM 7. Let T = (T1, ... , Tn) be a strongly exceptional sequence. The number of exceptional sequences which can be shifted by the bmid group action to T using only tmnspositions and p-extensions is at most n!. PROOF. Let X be an exceptional sequence which can be shifted by the braid group action to T using only transpositions and p-extensions. Consider T1 • There is a surjective map T1 -+ X;. for some (uniquely defined) i such that the kernel, as well as all the other modules T2, ... Tn have filtrations with factors X; where j '# i. Let X' be obtained from X by deleting X;.. Clearly T' = (T2, ... , Tn) is itself strongly exceptional, and X' can be shifted by the braid group action to T' using only transpositions and p-extensions. By induction, we know that there are at most (n- 1)1 possibilities for X'. Since X;. is uniquely detennined by X' and the index i (see [CB], Lemma 2), there are at most n possibilities for X;., when X' is fixed. This completes the proof. 10. Perpendicular categories We have mentioned above that Crawley-Boevey's definition of the braid group operation relies on properties of perpendicular categories. Perpendicular categories have been studied by Geigle-Lenzing [GL] and Schofield [S]; they are defined as follows: Given a collection C of A-modules, then C.L is the full subcategory of all A-modules Y which satisfy both Hom(C, Y) = 0 = Ext 1 (C, Y)
for all C E C;
siinilarly, .Lc is the full subcategory of all A-modules X which satisfy both Hom( X, C) = 0 = Ext 1 (X, C)
for all C E C.
Since A is hereditary, both subcategories C.L and .Lc are exact (this means: they are abelian, and the inclusion functors are exact). If X is an exceptional A-module, then it is known that C.L is equivalent to the category of all B-modules, similarly, .Lc is equivalent to the category of all B'modules; where B, B' are artin algebras with s(B) = s(B') = s(A) -1, see [S]. Note that the procedures above yield an effective way of computing B and B', as soon as a complete exceptional sequence containing X is given: Indeed, let (X1 , ... , X.) be a complete exceptional sequence with X = X;. for some i. We may shift X to the end of the sequence, thus, without loss of generality, we may assume that X= x •. But in this case, we know from [CB] that X.L is just C(Xt. ... , X 8 _ 1 ). Now, using permutations and proper reductions to the sequence (X to .•. , X 8 _ 1 ), we may transform it to an orthogonal sequence (Yto ... , Y8 _t). But then the modules Yto ... , Ys-1 are just the simple objects of X .L. Finally, using
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
EXCEPTIONAL SEQUENCES
351
transpositions and p-extensions, we may transform the sequence (Y11 ••• , Ys- 1 ) to a sequence (Z1 , •.. , Z8 _ 1 ) such that we have Ext 1 (Zi, Yj) = 0 for alll ~ i,j ~ s -1. The latter means that the modules Zi are the indecomposable projective modules Zi is the art in algebra B we are looking in X l.; and the endomorphism ring of for. Of course, in case we deal with algebras over an algebraically closed field k, we may already stop when we have obtained the orthogonal exceptional sequence (Yb ... , Ys- 1 ), since the dimension of the various k-spaces Ext 1 (Y;, Yj) yields the quiver of B, and B is just the corresponding path algebra. Similarly, we also can construct the artin algebra B'.
EB::t
Dictionary The terminology exceptional and strongly exceptional was introduced by Rudakov and his school [Ru) in the analogous situation of vector bundles. Exceptional modules have also been called stones by Kerner [Ke) and Schur modules by Unger [U]. Modules with endomorphism ring a division ring have been named bricks in [R3). A sequence (X11 ••• , Xn) is exceptional if and only if, first, the set of modules X 11 ••• , Xn is standardizable in the sense of [DR) and, second, the order of the modules refines the intrinsic partial ordering of this standardizable set.
A pair of modules M, N with Hom(M, N) = 0, Hom(N, M) = 0 has been called orthogonal in [Rl). A set of modules consisting of pairwise orthogonal modules having divison rings as endomorphism rings has been called discrete by Gabriel and de la Peiia [GP). The p-extensions have been used in a decisive way in [Rl,R2).
A sequence (Xb ... , Xn) is strongly exceptional if and only if, first, the direct sum of the modules X 1, ..• , Xn is a multiplicity-free partial tilting module as defined by Happel-Unger [HU], and, second, the order of the modules refines the partial ordering given by the existence of non-zero maps. Of course, the tilting sequences correspond in the same way to (multiplicity-free) tilting modules. REFERENCES
[AR] Auslander,M.; Reiten, 1.: Representation theory of artin algebras III. Communications in Algebra 3 {1975), 239-294. [B] Bondal, A.I.: Representations of associative algebras and coherent sheaves. Izv. Akad. Nauk SSSR Ser Mat. 53 {1989), 25-44. [CB] Crawley-Boevey, W.: Exceptional sequences of representations of quivers. Proceedings of ICRA VI, Carleton-Ottawa Math. LNS 14 {1992) [DR] Dlab, V., Ringel, C.M.: The module theoretical approach to quasi-hereditary algebras. In: Representations of Algebras and Related Topics. London Math. Soc. Lecture Note Series 168. Cambridge University Press {1992), 200-224 [GP] Gabriel, P., de la Peii.a, J.: Quotients of representation-finite algebras. Communications in Algebra 15 {1987), 279-307. [GL] Geigle, W., Lenzing, H.: Perpendicular categories with applications to representations and sheaves. J.Algebra 144 {1991), 273-343 [G] Gorodentsev, A.L.: Exceptional bundles on surfaces with a moving anticanonical class. Izv. Akad. Nauk SSSR Ser Mat. 52 {1988), 740-757.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
CLAUS MICHAEL RINGEL
352
[GR] Gorodentsev, A.L., Rudakov, A.N.: Exceptional vector bundles on projective space. Duke Math. J. 54 (1987}, 115-130. [HR] Happel, D., Ringel, C.M.: Tilted algebras. Trans. Amer. Math. Soc. 274 (1982}, 399-443. [HU] Happel, D., Unger, L.: Almost complete tilting modules. Proc. Amer. Math. Soc. 106 (1989}, 603-610. [Kl] Ka.c, V.G.: Infinite root systems, representations of graphs and invariant theory. Invent. Math. 56 (1980}, 57-92. [K2] Ka.c, V.G.: Infinite root systems, representations of graphs and invariant theory II. J. Algebra 77 (1982}, 141-162. [K3] Ka.c, V.G.: Infinite dimensional Lie algebras. Second Edition. Cambridge University Press (1985). [Ke] Kerner, 0.: Elementary stones. Communications in Algebra. (To appear) [Rl] Ringel, C.M.: Representations of K-species and bimodules. J. Algebra 41 (1976}, 269-302. [R2] Ringel, C.M.: Reflection functors for hereditary algebras. J. London Math. Soc. 21 (1980), 465-479. [R3] Ringel, C.M.: Bricks in hereditary length categories. Resultate der Mathematik 6 (1983}, 64-70 [R4] Ringel, C.M.: The regular components of the Auslander-Reiten quiver of a tilted algebra. Chinese Ann. Math. B 9 (1988}, 1-18. [Ru] Rudakov, A.N.: Helices and Vector Bundles. London Math. Soc. LNS 148. [S] Schofield, A.: Semi-invariants of quivers. J. London Math. Soc. 43 (1991}, 383-395. [l~ Unger, L.: Schur modules over wild, finite dimensional path algebras with three non isomorphic simple modules. J. Pure Appl. Algebra. 64 (1990}, 205-222. FAKULTAT FUR MATHEMATIK, UNIVERSITAT,
D-33 613
E-mail address: ringelGma.thematik. uni -bielefeld. de
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
BIELEFELD
http://dx.doi.org/10.1090/conm/171/01787 Contemporary Mathematics Volume 1T1, 1994
Direct limits of two-dimensional prime spectra CHRISTEL ROTTHAUS AND SYLVIA WIEGAND May 27, 1994 Dedicated to the memory of Richard S. Pierce
A major unsolved problem over the past thirty years has been to characterize the prime spectra of commutative Noetherian rings-that is, identify properties for a partially ordered set which imply the set is order-isomorphic to the prime spectrum of some Noetherian ring. (For Noetherian rings, the partially ordered set associated with the prime spectrum determines the Zariski topology.) A more specific elusive problem is to characterize as a partially ordered set the prime spectrum of Q[x, y], the polynomial ring in two variables over the rational numbers. Positive results related to these two problems include Roger Wiegand's characterization [rW2] of the prime spectrum of Z[x], the polynomials in one variable over the integers, and the work of William Heinzer, David Lantz and Sylvia Wiegand, characterizing various spectra related to certain twodimensional polynomial rings [HWl], [HW2], [HLWl], [HLW2]. A characterization of the spectra of two-dimensional countable semilocal Noetherian domains appears in [sW]. On the other hand, examples of Heitmann [H], McAdam [Me], and Nagata [N] show that various desirable properties for the prime spectrum can fail in Noetherian rings. In this article, we restrict our attention to prime spectra of integral domains of dimension two, usually Noetherian and countable. In order to get partial answers to the two problems above, we examine spectral properties given in [rWl] and [HWl], and about a dozen other properties of partially ordered sets and mappings between them. We identify some implications between the properties and make observations relevant to the two problems, but many questions remain. 1991 Mathematics Subject Classification. 13802, 13820, 13E05, 13F05, 13H05. Both authors extend thanks to the National Science Foundation for support ofthis research. Sylvia Wiegand thanks Purdue University for its hospitality during academic year 92/93. This paper is in final form and will not be submitted elsewhere ® 1994 American Mathematical Society 0271-4132/94 11.00
353
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
+ $.25
per page
354
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
Our investigation begins with direct limits of prime spectra, since Spec(Q[x, y]) is a direct limit of partially ordered sets which were characterized in [HWl]. It is intriguing that Spec(Z[x]) is also such a direct limit, even though Spec(Z[x]) is not order-isomorphic to Spec(Q[x, y]) [rW2]. For 'Yn a set of n primes of Z and an a set of n primes of Q[X], the spectra of the polynomial rings over the respective localizations at 'Yn and at an are orderisomorphic [HWl]; that is, Un :=Spec{Z7 JY]) ~ Vn := Spec(Q[X]crJY]). In fact the prime spectrum of the polynomial ring in one variable over a countable one-dimensional Noetherian domain with exactly n maximal ideals, is always order-isomorphic to Un if n 2:: 1. It follows that the prime spectrum does not behave nicely with respect to limits. In particular, order-isomorphisms between prime spectra are not preserved under inverse limits-because Z[Y] is an inverse limit of Z 7 n [Y], and Q[X, Y] is an inverse limit of Q[X]crn [YJ. {This is discussed in Sections 2 and 3.) Nevertheless, the natural maps Tn : Un ---t Un+l and On : Vn ---t Vn+l have the same identifying properties and there are compatible maps from Un ---t Vn at each n. (Section 4.) In later sections, we look carefully at the properties of the maps T nand On to see where the two direct limits diverge. In Section 5 we find sufficient conditions to insure that the direct limit is Spec{Z[x]), and in Section 6 we give our first description of partially ordered sets which are direct limits of Un, T n. We examine properties which are related to Noetherian domains in Section 7. The importance of exceptional sequences and orthogonal pairs of sequences, defined in Section 1, is demonstrated in Section 8; we show that a partially ordered set U is a nested direct limit of Un, Tn if and only if U contains an exceptional sequence. The remaining sections contain partial results concerning implications among properties, questions and other miscellaneous itmns. This article is divided into ten topics, as follows: Topics {1) {2) {3) {4) {5) {6) (7) (8) {9) {10)
Background and notation. Z[YJ and Q[X, Y] as inverse limits of Z7 n [Y] and Q[X]crn [Y]. Spec(Z[Y]) and Spec(Q[X,-Y]) as corresponding direct limits. The canonical mapping Tn: Un ---t Un+l' where Un :=Spec{Z7 n[Y]). The characterization of Spec(Z[Y]) as a limit. Partially ordered sets which are a direct limit of Un; special sequences. Other axioms for countable two-dimensional Noetherian domains. Exceptional sequences and orthogonal pairs of sequences. Relationships between axioms. More observations and questions.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRlME SPECTRA
355
1. Background and notation. First we repeat some notation and definitions from (HW1], (HLW2] and (rW1]. 1.1 Notation. For a partially ordered set U of dimension two, the j-elements of U are defined recursively as follows: (a) all maximal elements are j-elements and (b) a non-maximal element u is a j-element if u has infinitely many covers which are j-elements. (An element v > u of U is a cover of u if there is no element w with u < w < v.) For u, v E U, and T a finite subset of U, M(U) ={maximal elements of U of maximal height}, G(u) ={wE U
L(T) ={wE U
I w > u} ("greater" I w < t, for all t E T}
set), ("less" set),
j-set(u) = {j-elements of U minimal with respect to containing u},
r
1 (T)
={wE
u I G(w) = T} ={wE Ulj-set(U) = T}
and
("inverse j-set").
r
(1) 1 (T) t E T}. Then lj_; 1 (Ti)l = oo, for all1 ~ i < oo. Since a and T are bijections to CZ(n + 1)P- G(un+l)- {un+l}, the sets a- 1 (j;;~ 1 (Ti)) are countably infinite and disjoint. The same is true for the sets r- 1 (j;;~ 1 (Ti)). On each set a- 1 (j;;~ 1 (Ti)) in Un, define cp to be a matching
o;,
o;,
cp : a- 1 (j;;~ 1 (Ti))
-+
T-
1
(j;;~l
('Ji)).
Since CZ(n)P is a disjoint union of n
{0} u {u1, ... , un} u (U G(ui)) u (U{j;; 1 (T)I T finite ~ M(CZ(n)P)}, i=l
it is straightforward to check that cp is well-defined on all of Un and an orderpreserving bijection.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
4.3
PROPOSITION.
z }, for z E Spec(Z.,k [Y]), and let G 00 (z) denote {u E Spec(Z[Y]) Iu > z}. Now suppose S ~ Spec(Z.,n [Y]) is a finite set of non-maximal height-one prime ideals and T ~ Spec(Z.,n [Y]) is a finite set of maximal height-two prime ideals. Define for k ~ n :
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
367
(Here we identify S, T with tp~ k(S), tp~ k(T).) ' ' It follows from the axiom {rad{princ}) for Spec(Z[Y]) in Definition 1.4, that there exists a win Spec(Z(Y]) such that G 00 (w) n G 00 (s) ~ T ~ G 00 (w), for all s E S. Therefore, if N ~ n is large enough that wE Spec(Z..tN (Y]) and k ~ N, then That is,
n
k?._N
rk(S,T) -::J
0
for some N
~
n.
5.1 REMARKS AND NOTATION. More generally, consider a direct system of order-preserving maps:
(*)
Tn,n+l : CZ(n)P--+ CZ(n + l}P, n E N
such that Tn,n+l are CP-stable. {1} Let Tn,k = 1"k-l,k ..... Tn,n+b Vk ~ n. {2} For every u E CZ(n)P of height one, and every k
~
n let
Gk(u) ={wE CZ(k)PI w ~ Tn,k(u)} {3} In general, for n ~ k, we identify CZ(n)P with a subset of CZ(k)P, via Tn,k, and CZ(n)P with a subset of~CZ(n)P = U via Tn·
5.2 PROPOSITION. Let (*) Tn,n+l : CZ(n)P--+ CZ(n + l}P; n EN be a direct system of CP-stable maps Tn,n+l for all n EN. Suppose furthermore that{*) satisfies {L-mub-constant}, and {L-more covers} of Definition 1.8. Then U = limCZ(n)P is a standard partially ordered set which satisfies the axioms --+ (infinite covers) and (finite mubs} of Definition 1.../.. PROOF. The axioms {unique min}, {countable} and {dim 2} from Definition 1.2 are immediate. For {infinite covers): Let u E U be a height-one element of U, such that u "I ui, for all i E N. Suppose G(u) (in U) were finite. Then there would be annE N such that u E CZ(n)P, G(u) ~ CZ(n)P, and Gn(u) = G(u). But by {L-more covers}, there is a kEN such that Tn,k(Gn(u)) ~ Gk(Tn,k(u)) = Gk(u). This contradicts Gk(u) ~ G(u) ~ Gn(u). Thus {infinite covers} holds. For (finite mubs}, let u,v E U with ht(u) = ht(v) = 1. Then there is an n EN with u, v E CZ(n)P and by {L-mub-constant) there is anN~ n such that TN,k(GN(u) n GN(v)) = Gk(u) n Gk(v). If u -I Ui or v -I Ui in CZ(n)P, then GN(u) or GN(v) is finite, and so G(u) nG(v) = Gk(u) nGk(v) = GN(u) nGN(v) is finite, for every k ~ N. If u = Ui and v = Vj, for some i,j, suppose N ~ i,j. Then, in CZ(N)P, GN(ui) n GN(uj) = 0, and hence G(u) n G(v) = 0 in u, by (L-mub-constant).
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
368
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
5.3 LEMMA. Let Tn,n+l : CZ(n)P ---+ CZ(n + 1)P be a CP-stable map and let u E CZ(n)P be a height-one element. Then Tn,n+l(Gn(u)) = Gn+l(u) n n
(U Gn+l(ui)). t=l PROOF. This follows because Tn,n+l: CZ(n)P ~ CZ(n
G(un+l)).
5.4 NOTATION. Let Tn,n+l : CZ(n)P order-preserving maps such that:
---+
CZ(n
+ 1)P
+ 1)P- ({un+d U
be
a direct system of
(a) Each Tn,n+l is CP-stable. (b) (L-mub-constant) and (L-more covers) of Definition 1.8 are satisfied. Consider U = ~CZ(n)P as a union ofCZ(n)P via Tn,n+l· (Note that Tn,n+l is injective by CP-stable.) Let 8 ~ U be a finite set of height-one primes, and T ~ U a finite set of (height-two) maximal elements. Define r(8, T)
= {wE Ul ht(w) = 1, G(s) n G(w)
~
T ~ G(w), 'v's E 8},
and, for all n EN,
r n(8, T) = {wE CZ(n)PI Gn(s) n Gn(w) ~ T n CZ(n)P ~ Gn(w), 'v's E 8}. (Recall Gn(w)
= {v
I > w }.)
E CZ(n)P v
5.5 PROPOSITION. In the notation of 5.4, if T =/=- 0, then for every k > n(s,T) EN, we have rk(8, T) ;::2 rk+1(8, T), where rk(8, T) and rk+1(8, T) are considered as subsets of U. lfT = 0, then rk(8, T) U {uk+l} ;::2 rk+1(8, T). PROOF. First we prove: CLAIM. rk+1(8, T) n CZ(k)P ~ rk(8, T). PROOF OF CLAIM. Let wE rk+1(8, T) n CZ(k)P. Then by Lemma 5.3, k
Gk(w) = Gk+l(w) n ( U Gk+l(ui)); Gk(s) n Gk(w) ~ Gk+l(s) n Gk+1(w) ~ T, 'v's E 8.
Now T ~
i=l
k
U Gk+l(ui);
i=l
k
thus T ~ Gk+l(w)n( U Gk+l(ui))
i=l
= Gk(w), proving
the claim. Continuing the proof of Proposition 5.5, we show that rk+l (8, T) ~ CZ(k)P, if T =/=- 0. If wE rk+1(8, T)- CZ(k)P then ht(w) = 1 and sow= uk+l· (Recall that uk+l is the only height-one prime ideal which is in CZ(k + 1)P but not in CZ(k)P.) However, T ~
k
U Gk+l(ui),
i=l
0, so we have a contradiction. In case T = 0, then rk+ 1(8,T) the claim.
T
so Gk+l(uk+l) = Gk+l(w)
1- T,
since
=/=-
~
CZ(k)P U {uk+l}, so the result holds by
NOTES. 1fT= 0, 8 = {u1}, k =/=- 1, then uk E rk(8,T) -rk-1(8,T). In general, when T =/=- 0, Tk_ 1(8, T) is larger than rk(8, T). For example, if 'Yl =
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
369
{(2)}, 'Y2 = {(2), (3)} , S = {(Y + 2)}, and T = {(2, Y)} in Spec(Z-y1 [Y]) = Spec(Z(2)[Y]), then w = (Y + 8) is in f1(S, T)- f2(S, T), since G1((Y + 8)) = {(2, Y)}, but G2((Y + 8)) n G 2((Y + 2)) = {(3, Y + 2), (2, Y)} cfo {(2, Y)}. 5.6 PROPOSITION. Let 8, T be as above, T
'# 0.
Then
f(S,T)= nrk (S,T),r(S,0)=(nrk (S,0))u(r(S,0)n{uili>n k, and 0 =1- T ~ G(w) implies w '# Un, for all n > k; hence wE CZ(k)P. Now T ~G(w) n CZ(k)P = Gk(w). Also for every s E S, Gk(w) n Gk(s) ~ G(w) n G(s) ~ T. Therefore wE fk(S, T). Next we show "2": Let w E rk(S, T). Let t E G(s) n G(w), for
n
k k ~ n(s,0)· Therefore wE rk{S,0) U {f{S,0) n {uili > n(s,0)}) .. Let w E rk(S,0), and suppose t E G{s) n G{w), for all s E S. Choose k ~ n(s,0) with t E CZ(k)P. Then t E Gk(s) n Gk(w) = 0, a contradiction. Thus G{s) n G{w) = 0, sow E f{S, 0).
-
5.7 THEOREM. Let Tn,n+l : CZ(n)P- CZ(n + l)P be a direct system of order-preserving maps with direct limit U = limCZ(n)P. Then U ~ SpecZ[Y] if each Tn,n+l is a CP-stable map, and axioms (L-mub-constant},(L-more covers} and (L- rad(princ)) of Definition 1.8 are satisfied.
PROOF. By Proposition 5.2, the axioms given imply that U is standard and satisfies (infinite covers) and (finite mubs} of Definition 1.4. For the axiom (rad{princ}) of Definition 1.4, we need that r(S, T) =1- 0, for every pairS and T, finite sets of height-one and height-two elements, respectively. But by Proposition 5.6 and (L- rad(princ}}, r{S, T) 2 rk{S, T) =/:- 0.
n
k w for some height-one element w E U and there is an N 2 E N with w E Wk for all k ~ N2. This implies for k ~ max(N1, N 2) that t is a height-two element of Wk. Again since Wk ~ CZ(k)P we obtain that t E G(ui) n Wk for some i ~ k. 6.4 COROLLARY. Suppose that U is a standard partially ordered set and that {uihEN is a special sequence in U. For n EN put
U (G(ui)U{ui}) 00
Wn=U-
i=n+l
and suppose that there is an order-isomorphism An : Wn ~ CZ(n)P for all n EN with >.n(ui) n-special. Then U is a nested direct limit ofCZ(n)P's with respect to {Wn}nEN·
6.5 PROPOSITION. Let U be a standard partially ordered set, Wn ~ U, n EN subsets in U such that U is a nested direct limit of CZ(n)P 's with respect to {Wn}nEN· Then U admits a special sequence {ui}iEN and
U (G(ui)U{ui}) 00
Wn=U-
i=n+l
PROOF. The special elements u in a CZ(n)P-set are uniquely determined by IG(u)l = oo. This implies that the canonical embedding Wn '---+ Wm for m ~ n maps the set of special elements {u1. ... , un} of Wn into the set of special
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
372
elements of Wm. Let {ui}iEN be the infinite sequence of elements in U with {u1, ... ,un} special in Wn. Then: (a) IG{ui)l = 00 in u since IG{ui) n Wnl = 00 fori~ n. {b) G(ui) n G(u3) = 0 for i,j EN and i i:- j since G(ui) n G(u3) n Wn = 0 and
UWn=U
(c) Let t E M(U) be a height-two maximal element of U. Then t E Wn for some n E N and for n sufficiently large t is of height two in Wn. Therefore t E G(ui) n Wn for some i ~ n. This shows that {Ui hEN is a special sequence in U. Finally, ift E Wn then t ¢ Ui>n+l (G(ui)U{ui}) since the embedding Wn ~ Wm is CP-stable. Conversely, if t E u- ui~n+l (G(ui) u {ui}) then t E Wm for some m E N. We may assume that m 2: n. Since t j> Ui for all i 2: n + 1 we also obtain that t ¢ Wm n U::n+l (G(ui) U {ui}) implying that t E Wn.
6.6 PROPOSITION. Let {Wn, cf>n,m}n,mEN be a direct system of standard partially ordered sets with (i) Wn ~ CZ(n)P and (ii) cf>n,m : Wn --+ Wm CP-stable forn,mEN,n~m.
Let U ~ ~{Wn,c/>n,m}
nEN
Then:
{a) {b) (c) (d)
U satisfies U satisfies U satisfies U satisfies maximals) (e) U satisfies
axiom (N-infinite less sets) from Definition 1.14. (infinite covers) {::=:} {Wn, cf>n,m} satisfies (L-more covers). (finite mubs) {::=:} {Wn, cf>n,m} satisfies (L-mub-constant). (smaller maximals) {::=:} {Wn,c/>n,m} satisfies (L-smaller co(rad(princ))
{::=:}
{Wn, cf>n,m} satisfies (L-rad(princ).
PROOF. straightforward NOTE. A standard partially ordered set U is a direct limit of CZ(n)P if and only if there exists a countably infinite special sequence {unln EN} of height-one elements in U and Wn = U-
00
U (G{ui) U {ui})
~
CZ(n)P.
i~n+l
QUESTIONS. 1. For what rings R, is Spec(R) a direct limit of CZ(n)P's? 2. If U is a direct limit of CZ(n)P's, not every maximal element necessarily has height two. It could be that j- 1 {T) is infinite or finite or empty, for various
finite sets T. There could be two height-one elements in infinitely many maximal, height-two elements, and soU would not be the prime spectrum of a Noetherian ring. If we required that U be a Noetherian spectrum, so that (finite mubs) of Definition 1.4 holds- G(u) n G(v) is finite for each pair u, v, as well as that U be a direct limit of CZ(n)P's, what rings R would have Spec(R) a direct limit of CZ(n)P's? 3. If U is standard and satisfies (infinite covers), and (finite mubs) and U is a direct limit of CZ(n)P's, then what can be said about U?
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
373
7. Other axioms for countable two-dimensional Noetherian domains. 7.1 PROPOSITION: THE EXISTENCE OF A SPECIAL SEQUENCE. Let U be a standard partially ordered set which satisfies {infinite covers), (finite mubs), {smaller comaximals) and (N-oo ht.1s). Let u 1 E U be an element of height one. Then U admits a special sequence {Un In E N} which starts with u1. PROOF. Let {tnl n E N} = M(U) be an enumeration of the height-two elements of U. CLAIM 1. IM(U)- G(u1)l = oo. PROOF OF CLAIM 1. By {N-oo ht.1s), there exists a height-one element u E U, u =1- u1. By {infinite covers), I G(u)l = oo. By {finite mubs), I G(u)nG(ui)I < oo. Hence I G(u)- G(u1)l = oo, proving the claim. Now let i 1 EN be minimal with ti 1 ¢ G(u1). By {smaller comaximals), there exists a height-one element u2 E U such that til E G(u2) and G(ul) nG(u2) = 0. CLAIM 2. Suppose now that {u1, ... , un} have been constructed with G(ui)n G(uj) = 0, fori=/:- j. Then IM(U)- (G(u1) U · · · U G(un))l = oo. PROOF OF CLAIM 2. By {N-oo ht.1s}, there exists a height-one element u E U, u =/:- Ui fori= 1, ... , n. By {infinite covers), I G(u)l = oo. n
By {finite mubs}, I G(u) n ( U G(ui))l n
i=l
< oo.
Hence I G(u)- ( U G(ui))l = oo, proving Claim 2. i=l
Now let in EN be minimal with respect to tin
n
¢ U G(ui)· Then by {smaller i=l
comaximals), there exists a height-one element Un+l E U such that tin E G(un+l) and G(ui) n G(un+I) = 0, for 1 $ i $ n. By this means, we have constructed an infinite special sequence of height-one elements of U.
7.2 PROPOSITION. The following axioms hold when U ~ Spec(R), for R a two-dimensional countable Noetherian domain: {unique min), (countable), {dim 2} of Definition 1.2 {i.e. U is standard); {finite mubs) of Definition 1.4; {N-infinite less sets) and hence {N-oo ht.1s) of Definition 1.14; and {smaller comaximals) of Definition 1.5. If U satisfies {infinite covers) then U admits an infinite special sequence. PROOF. All the axioms in the first statement are obvious except for {smaller comaximals). For this, let u1, ... , Un E U with height(ui) = 1. Suppose t E U has height two and that t ¢ U G(ui), over all i = 1, ... , n; that is, Ui and t are comaximal in Spec(R). Now considering t and the ui as prime ideals in R, u1 · ... · Un and t are comaximal and so there exist a E u 1 · ... · Un and b E t such that 1 = a + b. Let w be a height-one prime ideal containing b and contained in t. Then t E G(w) and G(w)nG(ui) = 0, for every 1 $ i $ n. The last statement follows from Proposition 7.1.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
374
7.3 QuESTIONS. (1) Do the axioms in the first statement of 7.2 characterize the prime spectrum of a countable Noetherian domain of dimension two? (2} Let U be a standard partially ordered set which satisfies (infinite covers), finite mubs}, and (smaller comaximals).
-
(a) When is U a limit ofCZ(n)P's? (b) Suppose U = limCZ(n)P and {vt, ... ,vn} is a finite set of height-one elements ofU with G(vi) n G(vj) = 0 fori =f j. By the proof of Proposition 7.1 {Vt, ... , Vn} can be extended to a special sequence of U. When can {Vt, ... , Vn} be extended to a set of exceptional height-one elements of U? 7.4 REMARKS. Let U be a standard partially ordered set which satisfies (infinite covers}, (finite mubs}, (smaller comaximals} (or (oo smaller comaximals}), and (N-oo ht.1 s). Let {Vt, ... , Vn} be a finite set of height-one elements of U such that G(vi) n G(vj) = 0, fori =f j.
( 1) Then, as shown in Proposition 7.1, {v 1 , ... , Vn} can be extended to an infinite special sequence of height-one elements of U. (2} However U might not be a limit ofCZ(n)P's, as in the example below. EXAMPLE. The partially ordered set U pictured below satisfies all the axioms mentioned but is not a limit of CZ(n)P's:
uo
(3} Also (infinite covers), (finite mubs), (smaller comaximals) and (N-infinite less sets) seem not to be enough to write U as a limit of CZ(n)P 's with respect to any infinite special sequence of height-one elements, as shown by the following example: EXAMPLE.
Consider a partially ordered set U like this picture:
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
375
uo
Here the infinite set a is to satisfy: For every v E set G(v) n G(un) is nonempty and finite.
a and for every n E N, the
7.5 REMARK. Let U be a standard partially ordered set satisfying {infinite covers), (finite mubs}, (oo smaller comaximals) and (N-infinite less sets) from Definitions 1..4, 1. 5 and 1.14. Suppose that {Un In E N} is an infinite special sequence of height-one elements of U as in Definition 1. 9 and that v is a heightone element of U, v I- Un, for all n E N. Then by {infinite covers), I G( v) I = oo, and by {finite mubs}, IG(v) n G(un)l < oo. Hence for infinitely many n E N, G(v) n G(un) 1- 0. 7.6 PROPOSITION. Let U be a standard partially ordered set satisfying {infinite covers), {finite mubs) {Definition 1.4), {N-infinite less sets) {Definition 1.14} and {smaller comaximals) {Definition 1.5). Suppose that {unl n E N} is an infinite special sequence of height-one elements of U and put
Wn=U-(
U G(ui)U{ui})forallnEN.
i:2:n+l
Then Wn is a two-dimensional partially ordered set which satisfies all but the last axiom of Definition 1.3; in particular, the set of height-one maximals and the set of height-one non-maximal elements are both infinite. Thus Wn looks like the diagram below.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
376
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
uo
(The relationships of the lower right boxed section are unknown and too complicated to display. Each point in that box is less than a finite non-zero number of height-two elements.) NOTE. It is not clear and is even unlikely that (infinite inv. j-sets) of CZ(n)P is satisfied. PROOF OF PROPOSITION. Clearly Wn is standard. To see that there are infinitely many height-one maximals, (oo ht-1 maxes), let t E G(un+l); then by (oo smaller comaximals) there are infinitely many height-one elements Vi, i E N such that (i) t E G( vi), (ii) G(vi) n G(uj) = 0, fori EN, 1 ~ j ~ n. Hence the set of {vi, i E N, Vi "# Un+ 1} is contained in Wn and the Vi's are maximal in Wn. For (finite covers), let u be a non-maximal height-one element of Wn with u "# ui, for all 1 ~ i ~ n. Then n
Gn(u)
= G(u) n Wn = U(G(u) n G(ui)). i=l
Hence Gn (u) is finite. That there are infinitely many non-maximal height-one elements follows from (N-infinite less sets), namely, for any t E G(un) there are infinitely many heightone elements v E U with v < t. REMARK. Axiom (infinite inv. j-sets) for CZ(n)P seems to require some {md{princ)) condition on the special sequence {unln EN}.
8. Exceptional sequences and orthogonal pairs of sequences.
In this section we investigate connections between the existence of exceptional sequences (Definition 1.10) in a standard partially ordered set U and representations of U as a nested direct limit of CZ(n)P's.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
377
8.1 THEOREM. Let U be a standard ordered set satisfying (infinite covers}, and (finite mubs} of Definition 1.4. Then U is a nested direct limit ofCZ(n)P's as in Definition 1.11 if and only if U admits an exceptional sequence (Definition 1.10}. PROOF. Suppose U = limWn = --+
nEN
U Wn, where Wn
nEN
~
CZ(n)P and the canon-
ical embedding Wn ~ Wn+l is CP-stable. By Proposition 6.5 there is a special sequence {Un In E N} u1, ... , Un are the n special elements of W .. for each n and
~
U such that
U (G(ui)U{ui}) 00
Wn=U-
i=n+l
Suppose that Sis a finite subset of {unl n EN}, that Tis a finite set of heighttwo maximal elements of U, and further that n is chosen so that S, T ~ Wn. Now Wn ~ CZ(n)P and by axiom (infinite inv. j-sets} for CZ(n)P, the set j;; 1 (T) ={wE Wnl Gn(w) = T} is infinite. But j;; 1 (T) ~ r(S, T) = {w E u I height w = 1, G(w) n G(s) ~ T ~ G(w), Vs E S}. Therefore {unl n EN} is exceptional. Conversely, suppose U is standard and satisfies (infinite covers} and (finite mubs}, and that {unln EN} is an exceptional sequence for U. Put Wn = U- U {G(ui) U {ui}}· i~n=l
Obviously Wn ~ Wn+l· To show that Wn ~ CZ(n)P, we check that the axioms of Definition 1.3 hold. Obviously Wn is standard. For (oo ht-1 maxes}, to show that there are infinitely many height-one maximal elements, lett E G(un+l)· Set T = {t}; S = {u 1 , ... , Un}. By the assumption that {Un In E N} is an exceptional sequence for
u,
r(S, {t}) ={wE U I ht(w) = 1, G(w) n G(ui)
~
{t}
~
G(w), Vi} is infinite.
However, t E G(un+l) implies that t ~ G(ui), Vi, 1 ~ i ~ n, which implies that G(w) n G(ui) = 0, for wE r(S, {t} ). Thus there are infinitely many w =1- Un+b wE Wn such that G(w) n G(ui) 0, Vi, 1 ~ i ~ n. Therefore each of these w is a maximal height-one element of Wn. The axiom (n-special} holds because the exceptional sequence {Un In E N} for U is also a special sequence. For (finite covers}, let u E Wn be a non-maximal height-one element of Wn which is not a special element (that is, u =I- ui, for all 1 ~ i ~ n). Then
=
n
Gn(u) = {t E Wnlu < t} = U(G(u) i=l
n G(ui)),
where G(u) = {t E Ulu < t}.
Hence Gn(u) = G(u) n Wn is finite.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
378
CHRlSTEL ROTTHAUS AND SYLVIA WIEGAND
For (infinite inv. j-sets), note that, for every finite subset T of height-two 1(T) = r( {ul. ... , Un}, T). maximal elements of Wn,
r
8.2 THEOREM. Let U be a standard partially ordered set satisfying (infinite covers), (finite mubs), and (rad(princ)) of Definition 1..4. Then (i) U admits an exceptional sequence of height-one elements. (ii) Every special sequence of height-one elements in U is exceptional. PROOF. By (rW2] we know that U ~ Spec(Z(Y]). Hence U is a nested direct limit of CZ(n)P's and by Proposition 8.1 U admits an exceptional sequence. Now let {unl n EN} be a special sequence for U, letT be a finite set of heighttwo elements of U and letS be a finite set of height-one elements {unln EN}. By Proposition 1.6 U satisfies ( rad(oo princ)): the set r( S, T) = {w E Ul height(w) = 1, and G(w) n G(s) ~ T ~ G(w), E S} is infinite. Thus {Un In E N} is an exceptional sequence.
"'s
8.3 PROPOSITION. If K is an algebraically closed countable field, there exists an orthogonal pair of special sequences in U = Spec(K[x, y]). PROOF. EnumerateK={a:i}~ 1 . Foreachi,letui=X-a:i,Vi=y-a:i. Obviously {ui}iEN and {vi}iEN are orthogonal special sequences in Spec(K(X, Y]). 8.4 THEOREM. Let U be standard partially ordered set satisfying (infinite covers) and (rad(princ)) of Definition 1.4. Then U satisfies the orthogonal pair of special sequences condition. NOTE. We already know that the orthogonal pair of special sequences condition holds whenever all the axioms of Definition 1.4 hold, since it holds for Spec(k[x, y]), and the axioms of Definition 1.4 characterize Spec(k[x, y]), where k is the algebraic closure of a finite field. We show the orthogonal pair of sequences property is implied by (infinite covers) and (rad(princ)) directly. PROOF. First we enumerate the maximal elements: M(U) = {t17 t2, ... }. Each of these has height two by (infinite covers). The proof will be complete once we have proved that there are sequences {Ui hEN and {vi}iEN of height-one elements of U satisfying Statement (*n) for each n ~ 1: STATEMENT (*n)· For every n, there exist u17 u2, ... , Un and V1, v2, ... , Vn such that (i) For every pair i,j, 1 ~ i,j ~ n, G(ui) n G(vj) is a singleton {ti,j}, for some ti,j· (ii) For every i =/:- j, G(ui) n G(ui) = 0; G(vi) n G(vi) = 0. (iii) {t17 ... tn} ~ {ti,jl1 ~ i,j ~ n}. First we show (*n) for n = 1: Since t 1 has height two, there exists a u1 of height one, with u 1 < t. Choose v1 = w from the radical of a principal axiom corresponding to S = {ut}, T = {t1}. Then G(u1) n G(v1) = {tt}.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
379
Now suppose n ;:::: 1 and Statement (*n) holds; that is, we have u1, u2, ... , Un and v1,v2, ... ,vn satisfying (i), (ii) and (iii). We produce Un+l and Vn+l so that the two extended sequences satisfy (i), (ii) and (iii), yielding Statement (*n+l)· Lett be the first element of M(U)- {ti,jl1 ~ i,j ~ n}. Case 1: There exists ani so that ui < t. Then t # ti,j, Vi,j, so v; f. t, Vj. Choose, Vr # i, 1 ~ r ~ n, an element Xr E M(U)- {ti,;} such that Ur < Xr, using the (infinite covers) property. Take Xi = t. Again, v; f. Xr, Vj. Let S = {ubvb···,un,vn}, T = {x1, ... ,xn} (xi = t). Choose Vn+l using the radical of a principal axiom, so that G(vn+l) n G(s) ~ T ~ G(vn+l), Vs E S. Now choose Vm, 1 ~ m ~ n + 1, Ym E M(U)- {ti,;} such that Vm < Ym, using the (infinite covers) property. LetS= {ubvl, ... ,un,Vn,Vn+l},T = {y1, ... , Yn, Yn+ 1}. Choose Un+l using the radical of a principal axiom, so that G(un+l) n G(s) ~ T ~ G(un+l) Vs E S. Then the extended sequences work. Case 2: If Vi < t, for some i, use the symmetric argument. Case 3: For every i, ui f. t and Vi f. t. Choose, Vm, 1 ~ m ~ n + 1, Ym E M(U)- {ti,;} such that Vm < Ym, using the (infinite covers) property. Let S = {ubvb···•un,vn}, T = {y1, ... ,yn,t}. Choose Un+l using the radical of a principal axiom, so that G(un+l) n G(s) ~ T ~ G(un+l), Vs E S. Find vn+l similarly. Then t E G(un+l), t '1. G(ui), Vi~ n.
8.5 REMARK. By Proposition 7.2 and Remark 7.5 we know that if K is a countable field (possibly finite) and f(X, Y) is an irreducible element of K[X, Y], then there exists a special sequence in U = Spec(K[X, Y]) beginning with f(X, Y)K[X, Y]. If K is the algebraic closure of a finite field, then Spec(K[X, Y]) is isomorphic to Spec(Z[Y]) by [rW2) and hence, following Proposition 8.2, there is an exceptional sequence starting at f(X, Y)K[X, Y]. However, if K is Q or Q, the algebraic closure of Q, the only exceptional sequences we know are given by the prime ideals of K[X] and their images under transformations of the variables. 8.6 PROPOSITION. Suppose U ~ Spec(R[X]), where R is a one-dimensional Noetherian domain with countably infinitely many maximal ideals. Then there exists a countably infinite exceptional sequence in U. PROOF. Let {miheN be the set of maximal ideals of R. Take Ui = mi[X). We show the sequence {uihEN is exceptional in Spec(R[X]). Clearly it is a special sequence. Suppose that S ~ {ml[X), ... , mn[X)} in Spec(R[X]). LetT= {t1. ... , tr} be a finite set of height-two maximal elements; say that t; = (m;(i)• g;(X)), where g;(X) is a polynomial in R[X) which is irreducible mod m;(i)• since (R/m;(i))[X) is a principal ideal domain. For convenience we suppose that the m;(i) are among the m1. ... , ron. Let R' be R localized outside the union of the m1, ... , mn. Then R' is a semilocal domain with exactly n maximal ideals and so Spec(R'[X]) satisfies the axioms in Definition 1.3 [HWl), in particular, (infinite inv. j-sets). Thus in Spec(R'[X]), there are infinitely many height-one
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
380
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
prime ideals Q contained in only the maximal ideals (m;(i),g;(X))R'[X], where 1 ~ j ~ r. These Q correspond to height-one prime ideals P of R[X] which are contained in the t;, 1 ~ j ~ r; that is T ~ G(P), for each P. Now let s E S, that is, s = mi[X], for some 1 ~ i ~ n. Then t E G(s) n G(P) implies that t' = tR'[X] is a maximal ideal of R' such that Q = PR' is contained in t'. Since Q is only contained in maximal ideals of R' of form (m;(i),g;(X))R'[X], then t E T. Thus G(s) n G(P) ~ T, for all s E S. 8. 7 REMARK. If R is a countable one-dimensional domain, then Spec(R[x]) is a direct limit of CZ(n)P 's, unless R is a Henselian local domain. PROOF. If R has only finitely many maximal ideals, but is not Henselian, then by [HWl], Spec(R[x]) is CZ(n)P, so it is a direct limit. If R is Henselian, then by [HWl], Spec(R[x]) is not CZ(n)P; the last axiom (infinite inv. j-sets} of Definition 1.3 is not satisfied. If R has infinitely many maximal ideals, then R[x] has a countably infinite exceptional sequence by 8.6 and the obvious localizations are CZ(n)P, so again it is a direct limit. 9. Relationships between axioms. 9.1 PROPOSITION. Let U be a standard partially ordered set satisfying axiom (infinite covers} from Definition 1.4. If U satisfies (rad(princ}) then U also satisfies axiom (N-infinite less sets) of Definition 1.14. PROOF. Lett be a height-two element ofU. If L({t}) = {u E Ulu < t} is infinite, we are done. If not, then (rad(princ)) implies that the set r(L({t}), {t}) =/; 0. Now wE r(L( {t} ), {t}) yields that, for every s E L( {t} ), G(w) n G(s) ~ {t}. However w ~ L({t}) since G(w) nG(w) is infinite by (infinite covers}. In what follows, let U be a standard partially ordered set satisfying (infinite covers}, and (finite mubs) of Definition 1.4. Consider the condition (*) below as well as the other conditions defined earlier. (*)There exists a sequence of exceptional elements and every special sequence is exceptional. By 8.2, (rad(princ}) of Definition 1.4 ==} (*). Certainly (*) ==} There exists a sequence of exceptional elements (Definition 1.10). There exists a sequence of exceptional elements ¢::::::} U is a nested limit of CZ(n)Ps from Definition 1.11, by 8.1. U is a nested limit of CZ(n)Ps ==} There exists a special sequence (Definitions 1.11 and 1.9). (rad(princ}) ==} (N-infinite less sets) of Definition 1.14, by Proposition 9.1. (N-infinite less sets} ==} (N-oo ht.1s} of Definition 1.14. (rad(princ}) ==} (oo smaller comaximals}==} (smaller comaximals} of Definition 1.5 by Proposition 1.6. By Proposition 7.1, (N-oo ht.1s} and (smaller comaximals} together ==} (co-special} of Definition 1.9.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
381
Pictorially, the implications look like this:
(oo smaller comaximals)
Ismaller comaximals I
IN-oo ht.1s I
Inested ~CZ(n)P
I
QUESTIONS. (a) If R is a two-dimensional Noetherian domain such that U = Spec(R) is standard and satisfies {infinite covers) and {finite mubs) of Definition =1.4, then does U satisfy (oo smaller comaximals) of Definition 1.5? (b) Are there examples showing the converses in the diagram are not true? (c) Note that Spec(Q[X, Y]) and Spec(Q[X, Y]) do not satisfy condition(*); that is, not every special sequence in Spec(Q[X, Y]) or Spec(Q[X, Y]) is exceptional. By Remark 8.5, Spec(Q[X, Y]) has a special sequence beginning with X 3 - Y 2 • Such a sequence could not be exceptional, because when S = {(X 3 - Y 2 )} and T = {(X- 1, Y- 1)}, then r(S, T) = 0 [rW2]. What conditions would insure that a special sequence in Spec(Q[X, Y]) could be expanded to an exceptional sequence? 9.2 PROPOSITION. Let U be a standard partially ordered set satisfying {infinite covers), (finite mubs}, {N-oo ht.1s) of Definition 1.14, (smaller comaximals} and suppose that every special sequence is exceptional. Then for every height-one element u E U and every finite set T of height-two elements, this set is infinite:
r({u},T) ={wE
Ul
height(w) = 1, and G(w) nG(u)
~
T
~
G(w)}.
{That is, {rad{princ)) of Definition 1.4 holds for S = {u}.) PROOF. Since U satisfies (N-oo ht.1s) and (smaller comaximals) by Proposition 7.1, the set {u} can be extended to a special sequence {unl n EN} with Ut = u. By assumption the sequence {Un In E N} is exceptional and the assertion follows.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
CHRlSTEL ROTTHAUS AND SYLVIA WIEGAND
382
9.3 PROPOSITION. Let R be a two-dimensional Noetherian domain. Then U = Spec(R) satisfies (oo smaller comaximals} of Definition 1.5. PROOF. Let u 1 , ... , Um be a set of height-one elements of U, and let t be a height-two element outside UG(ui)· Choose J.l. E u 1 n · · · n Um such that the element p = 1 - J.l. E t. We construct Pi = p + TiJ.l. E t, for all i E N such that the Pi have no common prime divisor. Let P1 = p. Pick r2 E t and outside every minimal prime divisor of Pl· Set P2 =
Pl
+ T2J.l.·
Now suppose that p1, ... , Pn have been constructed such that Pi= p+riJ.l. E t, and the minimal prime divisors of the Pi are mutually distinct. Let r = {gl g is a minimal prime divisor of Pi, for some 1 ~ i ~ n }. Then r is a finite set. Pick O'n+l E t - U g. gEr
NOTE.
J.1.
CASE 1.
fj_ g, for every g E r, since otherwise 1 E g. Ti - O'n+l
In this case, set CASE 2.
f}.
Tn+l
Ti - O'n+l
E
U g.
gEr
=
O'n+l·
U g.
gEr
In this case, writer= A1 u A2, where Al = {g E rl Ti- O'n+l E g}; A2 = {g E rl TiIf A2 =/= 0, pick (3 E t n gg.
n
If A2 =
Put
0, pick (3 E t =
O'n+l
Now define
Pn+l
Tn+l
n g.
gE~2
-
n
¢ g} = r - Al·
gE~1
gE~1
+ (3. Then Ti = p + Tn+lJ.i.·
O'n+l
Tn+l
fJ.
U g, for all1
gEr
~ i ~ n. ·
CLAIM. The minimal prime divisors of P1, ... , Pn+l are mutually distinct. PROOF OF CLAIM. Suppose for some i with 1 ~ i ~ n, Pi and Pn+l have a common prime divisor g. Then g E r, which implies that (ri - Tn+l)J.l. = Pi- Pn+l E g, a contradiction. Now every Pi is an element of t. Suppose Vi ~ t is a height-one prime with Pi E Vi· Then t E G(vi) and G(u;) n G(vi) = 0, for every 1 ~ j ~ n. Moreover Vi =I= v; for i =I= j. This shows that U = Spec(R) satisfies ((oo smaller comaximals). 10. More observations and questions.
Let U be a standard partially ordered set. QuESTION 1. When do exceptional sequences exist (Definition 1.10}? Certainly (infinite covers}, (finite mubs}, (rad{princ}) imply the existence of an exceptional sequence, because they imply the partially ordered set is orderisomorphic to Spec(Z[Y]), which has such sequences. Does a weaker axiom
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
DIRECT LIMITS OF TWO-DIMENSIONAL PRIME SPECTRA
383
together with {infinite covers), and {finite mubs) imply it-say {smaller comaximals}, or possibly (smaller comaximals} with the orthogonal pair of special sequences condition or some other condition, or possibly {rad{princ) for singles) with some other condition? For arbitrary partially ordered sets, what conditions would insure that any element could be expanded to an exceptional sequence? QuESTION 2. Does the orthogonal pair of special sequences condition (Definition 1.13) hold for Spec(Q[X, Y])? Does some generalization of the {rad{princ)) axiom hold in Spec(Q[X, Y])?
Here is an idea (incomplete) for showing that the orthogonal pair of special sequences condition does not hold: If it did, then the generators for the elements of {uili E N} or {v3 lj E N} would have arbitrarily high degree in y. Use an extension of the observation that (Y 2 + 1, X 2 + 1) is contained in two maximal ideals rather than just one. QUESTION 3. If U satisfies {infinite covers) and (finite mubs) of Definition 1.4, and (smaller comaximals) of Definition 1.5, then does ((oo smaller comaximals) of Definition 1.5 hold?
That is, if there exists one element v, then do there exist infinitely many?
-
QUESTION 4. If U = limCZ(n)P and {L-mub-constant) of Definition 1.8 holds, then is U ~ Spec(R), for R a Noetherian domain?
What about adding {L-more covers)?
5. If U satisfies {infinite covers) and (finite mubs) of Definition and {infinite less sets for singletons), then is U a Noetherian spectrum?
QuESTION
1..4
Note that Krull's Principal Ideal Theorem implies that {infinite less set for singletons) must hold for the prime spectrum of a Noetherian ring.
-
QUESTION 6. If U = limCZ(n)P, U ~ Spec(R), and {L-more covers) holds in U, then is every prime ideal of R an intersection of maximal ideals? QUESTION 7. For which two-dimensional Noetherian rings, does Spec(R) satisfy the pair of elements condition {Definition 1.12) ?
For example, when R is a unique factorization domain, this would say that each maximal ideal is two-generated up to radical. QuESTION 8. When the pair of elements condition is satisfied, can the two elements u and/or v be part of a prescribed set?
-
9. Is Spec(Z[Y]) embedded in U, for every partially ordered set U which is a limCZ(n)P and which satisfies {L-more covers) of Definition 1.8? QuESTION
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
CHRISTEL ROTTHAUS AND SYLVIA WIEGAND
384
QuESTION 10. Describe the different homeomorphic spaces which can occur as a limit of Un via Tn· Which of these spaces are the prime spectm of rings, respectively Noetherian rings? What conditions would insure that the representation of a partially ordered set U as a limit of Un 's is unique? REFERENCES
W. Heinzer and S. Wiegand, Prime ideals in two-dimensional polynomial rings, Proc. Amer. Math. Soc. 107{3) (1989), 577-586. [HW2] W. Heinzer and S. Wiegand, Prime ideals in polynomial rings over one-dimensional domains, preprint. [HLW1] W. Heinzer, D. Lantz, and S. Wiegand, Projective lines over one-dimensional semilocal domains and spectra of birational extensions, Algebraic Geometry and Applications (C. Bajaj, ed.), Collection of papers from Abhyankar's 60th Birthday conference, Springer Verlag, New York (to appear). [HLW2] W. Heinzer, D. Lantz, and S. Wiegand, Prime ideals in birational extensions of polynomial rings, Contemporary Mathematics (to appear). R. Heitmann, Prime ideal posets in Noetherian rings, Rocky Mountain J. Math. 7{4) [HJ (1977), 667. H. Matsumura, Commutative Ring Theory, Cambridge Studies in Advanced Mathe[MJ matics 8, Cambridge University Press, 1989. S. McAdam, A noetherian example, Communications in Algebra 4 (1976), 245-247. [Me] M. Nagata, On the chain problem of prime ideals, Nagoya Math. J. 10 (1956), 51-64. [N] [rW1] R. Wiegand, Homeomorphisms of affine surfaces over a finite field, J. London Math. Soc.(2) 18 (1978), 28-32. [rW2] R. Wiegand, The prime spectrum of a two-dimensional affine domain, J. Pure Appl. Alg. 40 (1986), 209-214. S. Wiegand, Intersections of prime ideals in Noetherian rings, Communications in [sW] Algebra 11{16) (1983), 1853-1876. [HW1]
MICHIGAN STATE UNIVERSITY, EAST LANSING, Ml
48824
E-mail address: rotthaus@ mth.msu.edu UNIVERSITY OF NEBRASKA LINCOLN, LINCOLN, NE
68588-0323
E-mail address: swiegand@ unlinfo.unl.edu
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
http://dx.doi.org/10.1090/conm/171/01788 Contemporary Mathematics Volume 171, 1994
When is an Abelian p-group determined by the Jacobson radical of its endomorphism ring? PHILLIP SCHULTZ Dedicated to the memory of Dick Pierce
Let G be an abelian p--group. Then G is determined by the Jacobson radical J of its endomorphism ring unless G is the direct sum of a divisible group of infinite rank and an elementary group of much smaller rank. This is proved by establishing some Galois connections among the lattices of the fully invariant subgroups of G and the annihilator ideals of J. ABSTRACT.
§1. Introduction
In [HPS] it was shown that if G and G' are abelian p-groups which have unbounded basic subgroups and whose endomorphism rings have Jacobson radicals J and J' with torsion ideals t(J) and t(J') respectively, then t(J) ~ t(J') if and only if G ~ G'. Examples were given to show that if G = B EB D where B is elementary and D divisible, then G may not be determined by t(J) or even by J. The purpose of this paper is to show just when G is determined by J. It turns out that the counter-examples given in [HPS] are essentially the only ones. That is, G is determined by J unless G = B EB D where B is elementary of rank r > 0 and D is divisible of infinite rank d > 2r. In fact, if G is not of this form but G = B EB D with B bounded and D divisible, a stronger property holds, namely the structure of G can be recovered from that of J. On the other hand, the results of [HPS] show that if G has an unbounded basic subgroup, then any isomorphism from J to J' is induced by an isomorphism from G to G'. 1991 Mathematics Subject Classification. 20K30. This paper is in final form and no version of it will be submitted for publication elsewhere @) 1994 American Mathematical Society 0271-4132/94 Sl.OO + S.25 per page
385
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
386
PHILLIP SCHULTZ
Hausen and Johnson [HJ] have shown that the latter property fails for non-zero bounded groups with the exception of a few explicit finite 2-groups. The main tool in the proof is an ideal theoretic representation in J of the fully invariant subgroup lattice of G. In order to avoid set-theoretic complications, I assume the Generalised Continuum Hypothesis {GCH). I wish to acknowledge helpful remarks from Professors Jutta Hausen and Cheryl E Praeger. §2. Preliminary reductions The following results are all well-known, and can be found for example in
[Fl] or [F2]. Let G be an abelian p--group with a bounded basic subgroup, so
G may be decomposed as G = B EB D, where:
(1) D is a divisible group of rank rd; {2) If B -:/:- 0, then B = EBjE[l,k]Bj, where k is a positive integer and for all j E [1, k], Bj is homocyclic of exponent mi and rank ri > 0, and 1 :::; m1 < m2 < · · · < mk. In order to recover G from t(J) or J, it suffices to recover the parameters k, rd, mi and ri for all j E [1, k]. In this section, I show that k, rd and mi for all j E [1, k] are determined by J. I also dispose of the cases in which G is divisible or homocyclic or G = B EB D with B elementary. LEMMA 2 .1. Let G be a non-zero abelian p-group. Then J = 0 if and only if G is elementary.
PROOF. Let I be the ideal of £{G) generated by multiplication by p. Since multiplication by pis central in £(G), I= p£(G). For any 'JY17 E I, let ('JYI7)' = E: 1 ( -1 )ipi7Ji E I. This expression makes sense, for if a E G has order pi, then a('JYI1)' = E{:::;:{-1)ipia7Ji. Furthermore, ('JYI7)' lies in p£(G) =I. Now it is routine to check that ('JYI7)' is the quasi-inverse of 'JYI1, so I ~ J. Hence J = 0 if and only if p£(G) = 0 which in turn is true if and only if pG = 0. LEMMA 2.2. Let G be an abelian p-group. Then J -:/:- 0 but t(J) = 0 if and only if G is non-zero divisible. In the latter case, the rank of G is determined by J.
PROOF. Suppose G is divisible ofrank r > 0. By Lemma 2.1, J-:/:- 0 and by Chapter 43 of [Fl], £(G) is a torsion-free p--adic module, so t(J) = 0. Conversely, let G be an abelian p--group such that t(J) = 0 but J-:/:- 0. Then 0 -:f. G = REBD, where R is reduced and Dis divisible. Suppose R-:/:- 0. If D = 0, then either R is elementary, in which case J = 0, or R contains a cyclic summand of order ~ p 2 , in which case multiplication by p restricted to this summand is a non-zero element of finite order in J. In either case we have a contradiction, so D -:f. 0. But then the injection of any cyclic summand of R into D is a non-zero element of J of finite order, another contradiction. Hence R = 0.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
JACOBSON RADICAL OF AN ENDOMORPHISM RING
387
It remains to show that if G is divisible, then J determines the rank r of G. Write£ for £(G), and note that J = p£ = Ann(G[p]), the annihilator in£ of G[p]. Since J is torsion-free, JjpJ = p£jp2 £ ~ £jp£ ~ £(G[p]). Hence JjpJ is finite if and only if JjpJ is the zero ring on EBr2Z{p) and JjpJ is infinite if and only if it is the zero ring on EB 2 rZ{p). By the GCH, r is determined by J.
2.3. Let G be a homocyclic p-group of exponent m > 1 and rank r. Then t(J) = J and J determines m and r. LEMMA
PROOF. By [P, Theorem 13.6], J = t(J) = p£(G). Hence as additive groups, J ~ pHom{EBrZ{pm), EBrZ{pm)) ~ ITr EBrZ(pm- 1 ). If r is finite, then J ~ EBr2Z(pm- 1 ) while if r is infinite, then J ~ EB 2 rZ(pm- 1 ). In either case, m and r are determined by J.
2.4. Let G be an abelian p-group with non-zero divisible subgroup D. Let K be the Jacobson radical of £(D). Then G = BEBD where B is a non-zero bounded p-group if and only if J = t(J) EB K, where t(J) is a bounded ideal and K is a maximal torsion-free additive direct summand of J. LEMMA
Suppose G = BEBD with 0 =f. B bounded. Since Dis a fully invariant subgroup of G, £(G) ~ Hom(B, B EB D) EB £(D), where the first term is bounded and the second a torsion-free ideal which is maximal as a torsion-free additive subgroup of £{G). Let 1l' be the corresponding projection of £(G) onto £(D) restricted to J. Then 1l' maps J onto K c;;; £(D) and has t(J) in its kernel. On the other hand, if 'TJ is in the kernel of 1!', then TJID = 0, so 'TJ has finite order and hence lies in t(J). Thus the kernel is precisely t(J). The mapping 1l' splits, since t(J) is a bounded pure subgroup of J, and for the same reason, K is maximal as a torsion-free subgroup of J. Conversely, if G has an unbounded reduced summand B, then G contains cyclic summands of arbitrarily large order. Let G = (a) EB A where (a) is a summand of order ~ pn for some n E N. Then the endomorphism which is multiplication by p on (a} and 0 on A is an element of t(J) of order ~ pn- 1 • Thus t(J) is unbounded. PROOF.
THEOREM 2.5. Let G = B EB D where B is elementary of rank r1 > 0 and D is divisible of rank rd > 0. Then rd is determined by J and r 1 is determined by t(J) together with rd if and only if rd is finite or 2r 1 > rd.
By Lemma 2.4, J has a maximal torsion-free direct summand K which is J(£(D)) and hence determines rd by Lemma 2.2. Now every non-zero element 'TJ of t(J) has order p. By [P, Theorem 13.6] 'TJ raises heights and so maps B into D and annihilates D. Hence t(J) is the zero ring on the additive elementary group Hom(B, D). This group has rank r 1rd if r 1 is finite and 2r'rd otherwise. Hence if r d is known, so is r 1 unless r d is infinite and no less than 2r'. PROOF.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
PHILLIP SCHULTZ
388
In view of Lemmas 2.1 to 2.4 and Theorem 2.5, I shall assume in the rest of this paper that G = EBjE[ 1,k]Bi EB D where D is divisible and each Bi is homocyclic of exponent mi and rank ri, 1 ~ m1 < m2 < · · · < mk and k > 1 or m 1 > 1. I show next that the parameters k and mi are determined by t(J), using the digraph D( G) of G constructed in [PS]. This construction was for bounded groups only, so I first deal with that case and then describe the modifications necessary to deal with the non-bounded case. The vertices of D( G) are the sections of G of the form Br [p8 ] / Br [ps- 1]. There is a path in D(G) from Br[p8 J/Br[p 8 - 1 ] to Br'[ps']IBr'[ps'- 1] if and only if there is an endomorphism in t(J) inducing a mapping of Br[p8 ]/Br[p8 - 1] into Br'[ps'J!Br'[ps'- 1]. An endomorphism TJ E t(J) is called elementary if for some cyclic summands (a) and (b), G = (a) EB A = (b) EB B, TJIA = 0 and GTJ ~ (b). An elementary endomorphism is called irreducible if it is not the product of two elementary endomorphisms and l-elementary if it is the product of l but not more than l irreducible elementaries. It was shown in [PS, Theorem 2.9] that there is a path of length l in the digraph D(G) between vertices Br [p8 ] I Br [p8 - 1] and Br' [ps'] I Br' [ps' - 1] if and only if there exists an l-elementary endomorphism which induces a mapping of Br [p8 ] / Br [p8 - 1] into Br'[ps'J!Br'[ps'- 1]. Furthermore, the proof of [PS, Corollary 2.10] shows that there exists TJ E t(J) 1 \ t(J)l+ 1 inducing a mapping of an element of Br[p8 J/Br[p 8 - 1 ] to an element of Br'[ps']IBr'[ps'- 1 ] if and only if there is an l--elementary endomorphism with the same property. The construction of D( G) can be extended to groups G for which D =I 0 by adjoining for each s E N new vertices D[p8 +1]1 D[p8 ], vertical arrows from D[p 8 +1JID[p 8 ] to D[p8 ]1D[p8 - 1 ], and for all i E [1,k- 1], horizontal arrows from Bk[pi+l]IBk[pi] to D[pi+ 1JID[pi]. Since elements oft(J) annihilateD and increase socle heights, the correspondence between paths in D( G) and elements of t(J) described above continues to hold for the modified construction. The next theorem shows how the parameters k and mi, j E [1, k], can be determined from t(J). THEOREM 2.6. Let G = EBjE[ 1,k]Bi EB D where Bj is homocyclic of exponent mi and D is divisible. max{n: t(J)[p].t(J)n- 1 =I 0} ifD=O, (1) k = { max{n: t(J)[p].t(J)n =I 0} otherwise.
(2) For all j
E
[1, k- 1],
max{exp(TJ): TJ = TJ1TJ2 .. ·Tik-i E t(J)k-j with
mi =
exp(TJ)
{
= exp(TJt) = exp(TJ2) = · · · = exp(TJk-j}
max{exp(TJ): TJ
= TJ1TJ2 .. ·T/k-i-1 E t
( )k-3·+1
J
{
exp(t(J))
otherwise.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ifD=O,
w~th
= exp(TJ1) = exp(TJ2) = · · · = exp(TJk-i+1} exp(t(J)) + 1 if D=O,
exp(TJ) (3) mk =
.
otherwise.
JACOBSON RADICAL OF AN ENDOMORPHISM RING
389
PROOF. (1) k-1 is the length of the unique path in D(G) from B1[p] to Bk[p] if D = 0, and k is the length of the unique path from B1 [p] to D[p] otherwise. By the remarks above, these lengths are realised by the endomorphisms described. (2) If D = 0, the expression on the right hand side defines the largest exponent of a product of (k- j) elements of t(J), all of the same exponent. By the results of [PS], this is the maximum s for which there is a horizontal (k - j - 1)-path in D(G) passing through some Br[p8 ]/ Br[p8 - 1]. There is a unique such path, going from Bj[pmiJ/Bi[pmr 1] to Bk[pmiJ/Bk[pmr 1], so this maximum exponent is mi. The argument for D =I= 0 is similar. (3) If D = 0, the largest exponent in t(J) is achieved by an elementary endomorphism corresponding to the path connecting Bk[pmk]/Bk[pmk- 1 ] to Bk[pmk- 1 ]/ Bk[pmk- 2 ], so this exponent is mk- 1. If D =I= 0, the largest exponent in t(J) is achieved by the elementary irreducible corresponding to the horizontal arrow connecting Bk[pmk ]/ Bk[pmk- 1 ] to D[pmk]/D[pmk- 1 ], so this exponent is mk. §3. The lattice of fully invariant subgroups In order to find the ranks r i it is not enough to consider only the digraph D(G). In addition, we must use the lattice of fully invariant subgroups of G. Throughout this section, let G = B EB D as described in §2. For any j E [1, k -1] the j-th gap mi+1 - mi is denoted by gj, and, if D =I= 0, the k-th gap 9k is defined to be oo. Let F = F( G) denote the lattice of all fully invariant subgroups of Gunder the inclusion relation. Fuchs (F2, Theorem 67.1] describes a combinatorial characterization of F due to Kaplansky, but for this paper it is more convenient to use a modification of another description due to Moore and Hewett [MH]. Their characterization is for groups with no elements of infinite height, but it can be extended to non-reduced groups whose reduced part is bounded. A layer sequence for G is a function i : [1, k + 1] - N U {oo} satisfying (1) 0:::; £(1):::; m1; (2) for j E [2, k + 1], i(j- 1) :::; i(j) :::; i(j- 1) + 9i-1• where the last term i(k + 1) is simply omitted if D = 0. As usual, we let n + oo = oo for all n E N. It is straightforward to check that the set C = C( G) of layer sequences for G forms a complete distributive lattice under the pointwise operations. For i E C, let G[£] = EB;E[ 1,k]B;[pi(i)] EB D[pi(k+ 1)], where D[p00 ] means D itself. THEOREM 3.1.. The mapping i - G[£] is a lattice isomorphism of C onto
F. PROOF. I show first that for all i E C, G[£] E F. It is clear that the summand D[pi(k+l)] is fully invariant in G. Let (a) be a cyclic summand of maximal order in G, and let TJ E e(G). Then b = pmk-t(k)a E G(i] and brJ has exponent :::; i(k) and height ;;::: mk - i(k). But every such element is in G[i]. Now let
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
PHILLIP SCHULTZ
390
c = e +dE G[t'], where e E EBjE[1,k]Bi(pt(i)] and dE D(pt(k+l)]. Then e has exponent ~ t'(k) and height ~ mk- t'(k), so e =b).. for some).. E £(G). Hence CT/ = b)..TJ + dTJ. By the remarks above, both b)..TJ and dTJ are in G[t']. Next, it is routine to verify that t' ~ t'' in .C implies G[t'] ~ G[t''] in :F. It remains to show that each H E :F has the form H = G[t'] for some t' E .C. Now H = E EB F, where E = H n Band F = H n D. Since F is fully invariant in G, F = D(pt(k+l)] for some t'(k + 1) EN U {oo}, so if E = 0 we are done. Assume that E =I= 0, and for each j E [1, k], let t'(j) be the maximum exponent of an element of Bi n E. Since H is fully invariant in G, every element of Bi of exponent~ t'(j) is in E, so for all j E [1,k], Bi[pt(i)] ~ E and hence EBiE(1,k]Bi[ptU)] ~ E. Conversely, let 0 =I= x E E, say x = LjE(1,k] bi, with bi E Bi. Since H is fully invariant, each bi E E, so bi E Bi[pt(i)] and hence X E EBjE(1,k]Bj(pt(i)J. Certainly 0 ~ £(1) ~ m1. Suppose it has been shown that t'(j- 1) ~ t'(j) ~ t'(j - 1) + Yi-1 for some j E [2, k- 1]. Let (a} be a cyclic summand of G of exponent t'(j + 1). Then pmH 1 -t(i+ 1)a E E, so every element of B of exponent ~ t'(j+1) and height~ mi+1-t'(j+1) is in E. Hence t'(j) ~ t'(j+1) ~ t'(j)+Yi· Furthermore, every element of D of exponent ~ t'(k) E H, so t'(k) ~ t'(k + 1). We have constructed a layer sequence t' such that H = G[t']. §4. The Galois connections
Throughout this section, let G = BEBD as described in §2. I now establish two Galois connections between the lattices :F = :F( G) of fully invariant subgroups of G and I= I( G) of ideals of t(J). To simplify the notation, we let for all HE :F and, for all IE I,
(1) (2) (3) (4)
H' = {TJ E t(J): HTJ = 0}, H* = {TJ E t(J) : GTJ ~ H}, I' = {g E G : gi = 0} and I*= GI.
Note that H' and H* are in I and I' and I* are in :F. In particular, it is trivial to verify that G' = 0, the zero ideal, G* = t(J), t(J)* = G(pmk- 1] and if G is reduced otherwise. I define H" to mean (H')', I'* to mean (I')*, and so on. The word annihilator is frequently used in this context of rings acting on groups, but I shall reserve it for another use. Namely, for all I E I, the left annihilator of I, denoted .CI, means {>-. E t(J) : )..[ = 0}, and the right annihilator of I, denoted 1U, means {p E t(J): Ip = 0}.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
JACOBSON RADICAL OF AN ENDOMORPHISM RING
391
The first Galois connection. The proofs of the following facts are completely routine, and follow the usual pattern of constructing a Galois correspondence (see for example [B, Chapter V, Theorem 20]):
(1) (2) (3) (4) (5) (6) (7) (8)
If H E F then H' E I. If I E I then I' E F. If H ~ K in F then K' ~ H' in I. If I~ J in I then J' ~I' in F. For all HE F, H ~ H". For all IE I, I~ I". For all HE F, H' = H"'. For all IE I, I' =I"'.
An element H of F is called closed if H = H"; an element I of I is called closed if I = I". It follows that H E F is closed if and only if H = I' for some I E I and I E I is closed if and only if I = H' for some H E F. From the facts above, the set of closed elements of the respective lattices themselves inherit a lattice structure, and there is a lattice anti-isomorphism between the lattice of closed elements of F and the lattice of closed elements of I. I now identify the first of these lattices: THEOREM
4.1. HE F is closed if and only if D
~H.
PROOF. SupposeD~ H. By (5) above, H ~ H", so it suffices to show that if a¢ H, then a¢ H", or equivalently, that if a ¢ H, then there exists some "' E H' such that aTJ # 0. This is certainly true if H = G, so suppose H is a proper subgroup and let a¢ H, say a= Ebj + d with each b3 E Bj and dE D. By 3.1 above, H = G[i] for some layer sequence l, so at least one bi ¢ B[pi(il]. Say for example that bi has exponent > i(i). Take TJ E t(J) such that Bj'f/ = 0 for all j # i and"' acts as multiplication by pt(i) on Bi. Then"' E H', but aTJ # 0. Thus H = H" is closed. Now suppose that D Sf'; H and let i(k + 1) = n < oo, so D[pn] is the largest subgroup of D contained in H. Take a ED of order n + 1. Then every element of t(J) maps a to zero, so a E H" but clearly a¢ H. Our next object is to identify the closed ideals of t(J). Clearly, they are annihilator ideals, in the sense that they annihilate some fully invariant subgroup of G, but they are also annihilators in the ring theoretic sense. For reasons which will become clear later, the zero ideal 0 and the whole ring t(J) must be dealt with separately. LEMMA
PROOF.
4.2. 0 and t(J) are closed ideals. O' = G and G' =0;
if G is reduced otherwise. If G is reduced, then pmk- 1 G'
= t(J).
If not, then D'
= t(J).
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
392
PHILLIP SCHULTZ
In the next two lemmas, I characterise the closed ideals ring theoretically. LEMMA 4.3. Let IE I. The following are equivalent:
(1) For some H = G[t'] E F with t'(k) < mk, I= H'. (2) For some H = G[t'] E F with t'(k) < mk, I= RH*. (3) For some K E I, I= RK.
PROOF. (1) ===? (2) Suppose I= H' where H = G[t'] for some layer sequence t' such that t'(k) < mk. Let 1J E H'. Then for all J.L E H*, GJ.L1] ~ H17 = 0, so 1J E RH*. Conversely, let 1J E RH*. Let (a) be a cyclic summand of G of maximal order, and let G = (a) EB A. Since a f/. H, by the definition of layer sequence, no cyclic summand of G of maximal order is contained in H, so by [PS, Theorem 2.9], for all hE B n H, there exists J.L E J with aJ.L =hand AJ.L = 0. Thus every element of B n H is in GJ.L for some J.L E H*, while (D n H)17 = 0 since 1J E t(J). Hence H17 ~ GH*17 = 0, so 1J E H' =I. (2) ===?(3) is obvious. (3) ===? (1) Suppose I = RK, and let H = K*. Then HI = GKI = 0, so I~ H'. Conversely, let 1J E H'. Then for all J.L E K, GJ.L1] ~ H17 = 0, so J.L1J = 0 and hence 1J E RK = I. Since H = GK, H contains no element of exponent mk, soH= G[t'] with t'(k) < mk. THEOREM 4.4. The closed ideals in I are the right annihilator ideals in I together with 0 and t(J). PROOF. By Lemma 4.2, 0 and t(J) are closed. By Lemma 4.3, all right annihilator ideals are closed and all proper closed ideals are right annihilators. Note that neither 0 nor t(J) are right annihilators. Denote by 3 the lattice of right annihilator ideals in t (J). For any I E 3, I = H' for a unique H = G[t'] E F satisfying t'(k) < mk. Denote this I by I(t'). Let C* denote the lattice of layer sequences for G satisfying t'(k) < mk and F* the lattice of fully invariant subgroups of G of the form G[t'] for t' E C*. COROLLARY 4.5. The mapping t' lattices C* and 3.
~
I(t') is an anti-isomorphism between the
REMARK. Since the lattice C* is completely determined by the parameters k and mi, which in turn are determined by t(J), we may regard ideals of t(J) of the form G[t']' as known. 4.6 The second Galois connection. I use Lemma 4.3 to establish a Galois connection from .J to itself. The mappings I ~---+ CI and I ~---+ RI are clearly lattice anti-isomorphisms satisfying conditions (1) to (8) of §4.1, with 1 replaced alternately by R and C. Thus the closed ideals for the Galois connection determined by these maps are precisely those I for which CRI =I= RCI. I show now that every I in .J is closed with respect to these operations. (Note however that CO= RO= t(J) while Rt(J) = Ct(J) = t(J)n-l, where t(J) has Loewy length n, so 0 is not closed. This is no contradiction, since Of/. .J). As in the previous section, we need a separate Lemma to deal with I= t(J).
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
JACOBSON RADICAL OF AN ENDOMORPHISM RING
393
LEMMA 4.7. t(J) is closed. PROOF . .Ct(J) = 'R.t(J) = t(J)n- 1, where n is the Loewy length of t(J), and
'R.t(J)n-1
= .Ct(J)n-1 = t(J).
LEMMA 4.8. Let H E :F*, and let I= H'. Then .CI = H*. PROOF. By Lemma 4.3, I= 'R.H*. Let J.L E H*. Then for all TJ E I, J.LTJ = 0, so J.L E I. Conversely, suppose J.L ¢ H*. Then there exists a E G such that aJ.L ¢ H = H" = {g E G: 9"1 = 0 'VTJ E I}. Thus there is some TJ E I for which aJ.LTJ =/= 0, so J.L ¢ .CI. THEOREM 4.9. For all IE I, IE 3 if and only if .C'R.I =I= 'R..CI. PROOF. Let IE 3, so I= H' for some G =/=HE I. By Lemma 4.8, .CI = H* and by Lemma 4.3, RH* =I, so R.CI =I. Now let K = GI E :F*, so I= K*. Then by Lemma 3.4, RI = K' E I*, so by Lemma 4.8, .CRI = K* = I. Conversely, if I= R.CI, then IE 3 by definition. REMARK. As in the Remark following Corollary 4.5, we may assume ideals of t(J) of the form G(£]* are known. §5. J determines G if m 1 =I= 1 In §2 I showed that t(J) determines the parameters k and mi of G. In this section, I show that if B 1 is not elementary, the left and right annihilators of certain ideals I(£) of 3 determine the parameters ri. The idea is to single out, for each j E (1, k] a section of t(J) isomorphic as additive group to Hom(Bj, Bi[p]). The latter group is elementary of rank determined by r i. LEMMA 5.1. For j E (2, k], and, ifm1
(1) Vj = pmi- 1 G(p]* n G(pmi- 1]' and (2) Ui = pmiG(p]* n G(pmi]'.
> 1 for j
= 1, let
Define ()i: Vj/Ui----+ Hom(Bi,Bi[p])
by Then
()i
()i : TJ + Ui is an additive isomorphism.
t-+
TJIBj.
PROOF. I start by defining a potential inverse for ()i: for any f E Hom(Bi,Bi[p]), let f¢i be f + Ui on Bi and zero on the complement tBi-:ftiBi tfJ D. It is routine to verify that f + Ui E Vj/Ui. Thus it remains to show that ()j is a well-defined additive function which is inverse to ¢i. Suppose TJ + Ui = J.L + Ui E Vj/Ui. Then TJ- J.L E G(pmi], so (TJ- J.L)i 8 i = 0. Thus ()i is well-defined.
Let TJ = TJ1 +TJ2 +TJa, where "11 = TJIEBiiB;· Then clearly each of TJ 1, 'f/2 and 'f/3 is in Vj. Since Vj s; G(pmi- 1]', TJ 1 = 0. Since
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
PHILLIP SCHULTZ
394
Vj ~ pm1- 1G[p]*, 713 raises heights in EFJi>jBi by at least mj, so 713 E Uj. Hence 71 + Ui = 112 + Ui. Now let 112 = 77( 1) + 77( 2) + 77( 3), where 77( 1) is 112 followed by the projection of G onto EFJijBi. Once again it is routine to verify that each of 77( 1), 77( 2 ) and 77( 3 ) is in Vj. Since 77( 1) E pm1- 1 G*, 77( 1) = 0. Since 77( 3 ) E pm1 G*, 77( 3 ) E Ui. Hence 71 + Ui = 77( 2) + Ui. But 77( 2) can be regarded as a map from Bj to pm1- 1 Bj = Bj[p], so 71(}i E Hom(Bj,Bj[p]) and moreover (}i preserves addition and is a left and right inverse for ¢>i. THEOREM 5.2. For all j E (2, k], and, if m1 > 1 for j = 1, t(J) determines the parameters ri . PROOF. By Lemma 5.1, it remains to show that the ideals Vj and Uj of t(J) are determined by t(J), and not just by the action of t(J) on G. I define layer sequences as follows: fj(i) = {
mi
fori< j
mi
for~>
.-
. J
£-:-(i) = { 3
mi
fori< J. '
mi - 1 for i ~ j
0 for i < j { 0 for i < j £·3 [p](i ) -- { 1 £ • > - . i j [p]( ) 1 £ •> . tOr ~ J tOr ~ _ J. It is routine to verify that G(fj] = G[pm1], G(fj] = G[pmr 1], G(fj[p]] = pm1G[p] and G(fj[p]] = pm1- 1G[p]. By the remarks following Corollary 4.5 and Theorem 4.9, the ideals Vj and Uj of Lemma 5.1 are determined by t(J). Thus the vector space Hom(Bj, Bi[p]) is determined by t(J) and its dimension is rJ if finite and 2r1 if infinite. Hence for each j E (1, k], ri is determined by t(J).
r
By Lemmas 2.1 and 2.4, rd is determined by J and by Theorem 2.6, each mi is determined by J. Hence Theorem 5.2 completes the proof that J determines G except for the case that B 1 is elementary. §6. J determines G if k > 1 In this final section, we may assume that m 1 = 1 but k > 1. To simplify the notation, I denoteD by Bk+ 1 and rd by rk+l· . ,...., pm1-1G[p]* LEMMA 6.1. (a) For all J E (2, k], Hom(B1. Bi) = pm1G[iJ]* n G[P]"
,...., pmk~~* (b) Hom(B1, Bk+1) = G
.
PROOF. First note that if 71 E Hom(B1. Bj), then 71 raises heights in the socle of G and has order p. Thus each Hom(B1. Bi) is an additive elementary subgroup of t(J). For j E (2, k + 1], define ¢>i : pmr 1G[p]* Hom(B1, Bj) by ¢>i : 71 ~ ~T/'Trj, where~ is the injection of B 1 into G and 7rj is the canonical projection of G onto Bi. Since every element of Hom(B1, Bj) the restriction to B1 of a homomorphism
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
JACOBSON RADICAL OF AN ENDOMORPHISM RING
395
of G into pmi- 1G[p], 1 or if m1 > 1 and by Lemmas 6.2 and 6.3, r1 is determined by J if k > 1. The only remaining possibility is that k = 1. In that case, Lemma 2.1 and Theorem 2.5 ensure that G is determined by J if and only if (1) and (2) are satisfied. REFERENCES [B] [F1] [F2] [HJ]
G. Birkhoff, Lattice Theory, Amer. Math. Soc. Colloquium Publications, Vol. 25, 1967. L. Fuchs, Infinite Abelian Groups, Vol. 1, Academic Press, New York, 1970. L. Fuchs, Infinite Abelian Groups, Vol. 2, Academic Press, New York, 1973. J. Hausen and J. A. Johnson, Abelian p-groups strongly determined by the Jacobson radical of their endomorphism rings, Journal of Algebra (to appear). [HPS] J. Hausen, C. E. Praeger and P. Schultz, Most Abelian p-groups are determined by the Jacobson radical of their endomorphism rings, Math. Z (to appear). [MH] J. Douglas Moore and Edwin J. Hewett, On fully invariant subgroups of abelian pgroups, Comment. Math. Univ. St. Pauli 20 (2} (1971), 97-106. [P] R. S. Pierce, Homomorphisms of primary abelian groups, Topics in Abelian Groups, Scott, Foresman, 1963, pp. 215-310. [PS] C. E. Praeger and P. Schultz, The Loewy length of the Jacobson radical of a bounded endomorphism ring, Abelian groups and non-commutative rings, Amer. Math. Soc., Contemporary Methematics 130, 1992, pp. 349-360. THE UNIVERSITY
OF
WESTERN AUSTRALIA, NEDLANDS, WESTERN AUSTRALIA, 6009
E-mail address: [email protected]
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
http://dx.doi.org/10.1090/conm/171/01789 Contemporary Mathematics Volume 1 Tl, 1994
SIMILARITIES AND DIFFERENCES BETWEEN ABELIAN GROUPS AND MODULES OVER NON-PERFECT RINGS JAN TRLIFAJ ABSTRACT. The notions of a Whitehead test module, an almost free module, and a slender module are investigated over arbitrary non-perfect rings. Methods that have originally been developed for abelian groups are used to show similarities, but also important differences, appearing in the general case. In particular, a class of countable hereditary non-perfect rings is described over which all semisimple modules are slender.
In the past several years, methods originally developed for the investigation of abelian groups have been used to study the more general case of modules over non-left perfect rings (see e.g. (EM]). Recall that a ring R is non-left perfect provided there is a strictly decreasing countably infinite chain of principal right ideals of R. When generalizing results concerning particular properties of abelian groups, we often meet the following possibilities: {1) the results generalize to modules over arbitrary non-left perfect rings, while the corresponding results for modules over left perfect rings do not hold; {2) the results generalize only to modules over certain non-left perfect rings (e.g. the countable hereditary ones); {3) there is no generalization toR-modules even if R is a countable hereditary non-left perfect ring. The main objective of the present paper is to demonstrate these possibilities by three important notions of contemporary module theory: that of a Whitehead 1991 Mathematics Subject Classification. Primary 20K40, 20K35; Secondary 16P70, 16E60. Key words and phrases. non-perfect ring, slender module, almost free module, Whitehead test module. This research has partially been supported by grant FDR-0579 of the Czech Ministry of Education. This paper is in final form and no version of it will be submitted for publication elsewhere. ® 1994 American Mathematical Society 0271-4132/94 11.00
397
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
+
1.25 per page
398
JAN TRLIFAJ
test module, of an almost free module, and of a slender module. We show that these notions provide examples of possibilities (1), (2), and (3), respectively. Each of the notions is treated in a separate section, and the necessary definitions appear there. Before proceeding to the sections, we fix our basic notation. First, Z denotes the ring of all integers, and Q the Z-module of all rational numbers. Let R be an associative ring with unit. Then R is said to be (von Neumann) regular provided each r E R has a pseudo-inverse s E R (i.e. r = rsr). It is easy to see that left- (or right-) perfect and regular rings coincide with the semisimple rings (= finite ring direct products of full matrix rings over skewfields). The non-perfect regular rings include e.g. all full endomorphism rings of infinite dimensional linear spaces. Since factors, products and direct limits of regular rings are regular, many other examples of non-perfect regular rings can be constructed starting from the above mentioned ones (see e.g. [G]). The category of all (unitary left R-) modules is denoted by R-Mod. Homomorphisins in module categories are written as acting on the opposite side from scalars. A module M is simple provided 0 and M are the only submodules of M. A module M is semisimple provided M is a sum of its simple submodules. The injective hull of a module M is denoted by I(M). A system of modules (Ma; a< A) is said to be a continuous chain provided Mo = 0, Ma ~ Ma+l for all a < A, and Ma = Uf3. ~ K-. Assume >. is regular and >. > K-. Then the induction step follows from the induction premise and (El, Theorem 1.5]. If>. is singular, >. > K-, the general singular compactness theorem [H, §4] applies (with "free" = "a direct sum of countably generated projectives" = projective, by a classical result of Kaplansky). 0 In fact, a weaker version of JD (called a generalized weak diamond) is enough for the proof of 1.6. Moreover, for certain classes of left hereditary non-left perfect rings, the claim of 1.6 can be strengthened to "each free module is a test module" (this is of course true for R = Z, but also if R is a simple non-semisimple regular ring such that R has countable dimension over its center). More details on this will appear in (CT]. Nevertheless, the following problem remains open: 1. 7 PROBLEM. For what classes of non-left perfect non-left hereditary rings is the existence of test modules consistent? (Or, vice versa, for what classes of non-left perfect non-left hereditary rings is it true in ZFC that there are no test modules?}
§2 Almost Free Modules 2.1 DEFINITION. Let K- be a regular uncountable cardinal and M be a module. (i) M is almost K--free if there is a set, C, of free submodules of M such that: (1) gen(X) < K- for all X E C, and (2) for each subset A~ M with card(A) < K- there is some X E C with A~ X.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
ABELIAN GROUPS AND MODULES OVER NON-PERFECT RINGS
401
(ii) M is K.-free provided it is almost K.-free and among the sets C of free submodules satisfying {1) and {2) there is at least one satisfying {3) C is closed under unions of well-ordered chains of length < ""· (iii) M is strongly K.-free provided it is almost K.-free and among the sets C of free submodules satisfying {1) and {2) there is at least one such that 0 E C and {2+) for any subset A ~ M with card(A) < ,.., and any X E C there is some Y E C such that XU A~ Y andY/Xis free. Clearly, any free module is both K.-free and strongly K.-free. If R is a free ideal ring (e.g. R = Z), then any strongly K.-free module is K.-free. A similar result holds true for left hereditary rings: 2.2 THEOREM. Let ,.., be a regular uncountable cardinal. Let R be a left hereditary ring such that (card(R))+ < ,.., and R is not left perfect. Then each ~ K.-generated strongly K.-free module is K.-free. PROOF. Let M be a strongly K.-free module and C be as in 2.1(iii). In view of {2), we can assume that gen(M) = ""· By [EM, IV, Proposition 1.11], M has a strictly increasing K.-filtration (Met; a < K.) such that for all a < f3 < ,..,, card(Mct+l!Mct) ~ card(MQ), Mct+l E C, MfJ+dMct+l is free, and card(MQ) ~ (card(R))+ provided a > 0. By 2.1{ii), it suffices to prove that MQ is free for all a < ""· This is clear in the case when either a = 0, or a is non-limit, or cf(a) = N0 . Since R is left hereditary, it is also clear that each MQ is projective. Assume cf(a) > N0 and put J.L = card(Mct)· Of course, No < J.L = gen(Mct) < ""· First, suppose there is some f3 pkTp (recall that G c TITP). Since each Tp is
finite, we have, for each k, G = Gk e Gk *. Our next theorem gives some alternate characterizations of isomorphism in Qy.
Theorem 2 Let G,G' e y. Then the following are equivalent: a) G:G' in Qy
=
b) There exists k such that Gk * G'k * as abelian groups. c) There exists subgroups H c G, H' c G', each of bounded index such that
H
=H' as abelian groups.
and
g
and f: G .... T' = T(G'). Since G is pure in TITP
Proof a)
-t
TITP'
is algebraically compact, we can extend
b) Let G, G' e
llip e Hom(TITP,TITP'). Let F
= {x 1, ... ,xn}
f
to an element
be a maximal rank free subgroup of G.
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
W.. J. WICKLESS
410
Since f(G)
c T' and F is finitely generated, then f(F) c EBi= ~ Tp.' for some s > 0. 1
That is, denoting xip = 1t"p(xi), fp(xip) = 0 for 1 S: i S: n and p > Ps· Using condition d) of Theorem 1, we have fp = 0 for all sufficiently large p 2: Ps· We have shown that Homz(G,T) is a torsion group. Hence, tensoring Q into the exact sequence 0 .... Hom(G,T') -+ Hom(G,G') .... Hom(G,G')/Hom(G,T') yields the isomorphism easily that if G
=G'
Q
8
[Hom(G,G')/Hom(G,T'))
in WALK then G
=G'
=Q
8
-+
0
Hom(G,G').
It follows
in the category QAb, the category
with objects abelian groups and morphisms HomQAb(G,G')
=Q 8 Homz(G,G').
Suppose G :: G' in Qy. Then, by the remark following the definition of the category Qg, G
=G'
in WALK. From the previous paragraph, G
=G'
in QAb. By
the standard argument, there exists f e Hom2 (G,G'), g e Homz(G',G) and a positive integer n, such that gf =n 10 and fg =n lH. If pk is the largest prime occurring
in the prime factorization of n, then the restrictions of the maps f, g to Gk *, G'k * will be inverse group isomorphisms. The implication b) .... c) is trivial. H
=H'
For c) .... a) suppose there exist subgroups H
c G, H' c G' and t > 0 such that
as abelian groups and with t G c H, t G' c H'. If pk is the largest prime
occurring in the prime factorization of
t,
Hk *
then
Moreover, the isomorphism 8 from H to H' will carry onto H'k* =G'k *. Let "8 : V .... V' be the map induced by
= Gk* and H'k* =G'k *. * * ~ =Gk isomorphically
0 Ell 8 : Gk Ell Gk* -+ G'k Ell G'k*. It is easy to check that "8 is an isomorphism in Qy. This completes the proof of the proposition. Definition 4 A type
t"
is called a nontrivial locally free type if
t"
= [(kp))
with
kp < oo for all primes p and kp > 0 for infinitely many p. For short we say such a t"
is an n1f type. Definition 5 Let
t"
= [(kp)) be an nlf type. A group G e
outer type less than or equal to
t"
k (Of(G) :s; 1) if p P Tp(G)
g
is said to have
=0
for almost all
primes p. Definition 6 For an nlf type
t"
let Qfi'C be the full subcategory of Qg with
objects mixed groups G e g such that OT(G) S: objects locally free torsion-free groups
H
t".
Let Qtt" be the category with
of outer type less than or equal to
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
t"
MIXED TO TORSION-FREE GROUPS
411
(OT(H) ~ t) with no rank one summand of type t, and morphisms HomQ'l (H,H') = QHom(H,H'). t
It is easy to check that, for each nlf type t, the categories Qgt and Qtt defined above are additive categories. We now can prove our main theorem. Theorem 3 For each nlf type t there is a rank-preserving category equivalence between the categories Qgt and Ql-r Proof Let
t = [(kp)]
be an nlf type.
We will construct rank-preserving
additivefunctors f=ft:Qgt-+Qlt and g=gt:Qtt-+Qgt suchthat gf=lQg and fg = lQt.
t
t
Let G e Qg't' Choose F c G a maximal free subgroup. By Theorem 1 (d), the natural projection map 1t'p : ITTp -+ Tp will map F onto Tp for almost all p. For these p there is a natural epimorphism 1 e 1t'p : Fp = Zp e F-+ Tp. Let Np be the k
kernel of 1 e 1t'p. Because OT(G) ~ t, we have p P Fp c Np for almost all p. We defme a locally free group H = f(G) with F c H c QF by defining each localization k Hp. For primes p such that Np has been defined and such that p P Fp c Np, set -k
Hp =p P Np c QF. For the (finitely many) other primes set Hp =Fp· If H = (') Hp then, plainly, F c H c QH, thus rank H = rank F = rank G. Since, for all p, -k H c p P F , it follows that H is locally free with OT(H) ~ t. Furthermore, if F is p p another maximal free subgroup of G, then F and F are quasi-equal; thus F'p = Fp for almost all p. Hence, up to quasi-isomorphism, our construction of H = f(G) is independent of the choice of the maximal free subgroup F c G. To show that f(G) e Qt't" we need to prove, additionally, that f(G) can have no rank one summand of type t. Suppose to the contrary that f(G) = A EB B, where A is a rank one group of type t. Choose 0 '¢ a e A (') F such that the p-height of a in f(G) is greater than or equal to kp for each prime p. It follows that k k a e p P [f(G)]p for each p. But, by construction, p P [f(G)]p = Np for almost all p. Thus, now regarding a e F c G, 1t'p(a) = 0 for almost all p. Hence, a e EBTP. But a e F and F (') EBTp=0, a .contradiction. Let ({' e HomQg (G,G') for some G, G' e Qg7: Choose a map t
a e Homz(G,G') such that a induces f. Let F c G and F c G' be maximal free
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
412
W. J. WICKLESS
subgroups. Since F is finitely generated and F c G' is a maximal free subgroup, it follows that t a(F) c F for some t > 0. Thus a(Fp) c F p for almost all p. Since a(Tp) c Tp' for all p, we have a(Np) c N'p for almost all p. Thus a, regarded in the natural way as an element of
Homz(QF,QF),
maps
-k p P Np
=f(G)p
to
-k p P N'p = f(G')p for almost all p. Therefore, a induces a quasi-homomorphism,
which we call f(rp) from f(G) to f(G'). It is a simple exercise to see that f(rp) is independent of the choice of a such that rp
=a.
It is also easy to check that, with the
above definitions for f(G) and f(rp), f is an additive functor from Qyt to Q'lr:
O'lr:
To construct the inverse functor, let H e
k
choose a maximal free subgroup F c H such that p P
Since OT(H) s; t
0 },
two completely decomposable torsion-free groups Hy:J Z
of almost disjoint infinite it is routine to construct rank EB
Z such that: (1) the H,Ys
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
MIXED TO TORSION-FREE GROUPS
are pairwise non quasi-isomorphic and (2) each Hf(Z IB Z) will be as advertised.
415
=T.
The family {g(Hyl
In some contrast to Theorem 6, we show that the completely decomposable mixed groups in fi are detennined in fi by their Z-endomorphism rings. Theolem 7 Let G, G' e Qfi with G completely decomposable. Suppose the rings Endz(G) and Endz(G') are isomorphic and that rank G
= rank G'.
Then the
groups G and G' are isomorphic. Proof Since G e
g
we can regard E
=Endz(G)
as a pure subring of IIEP
where Ep = Endz(Tp>· Moreover, in this identification, each Ep will be the ideal of p-torsion elements of E. (See [GW].) Thus, employing the obvious notation, if
=
=
E:: E', then each Ep Ep'· By the Baer-Kaplansky Theorem, Tp Tp' for all p. That is, G and G' will have isomorphic torsion subgroups. Thus, in view of Theorem 2, to prove our result it will suffice to prove that G Suppose rank G
= n.
=G'
in Qfi.
Since G is completely decomposable we can, again
employing Theorem 2, choose a subset of orthogonal idempotents {e1'... ,en}
of E
such that G =IBlSiSneiG IB L, with each eiG e fi of rank one and L finite. Since E:: E' there is a corresponding set of orthogonal idempotents {e 1·, ... ,en'} in E'. Thus we can obtain an analogous group direct sum decomposition G'
=IBlSiSnei'G' IB L'
with L' = (1 - l: 1SiSnei') G' also finite. To prove that G G' in Qfi we will prove that, as groups, eiG
=
=eiEei =ei'E'ei' =Endz(ei'G').
=ei'G'
for all
Since rank eiG = 1, Endz(ei'G') Endz· Two-vertex exchanges produce n-tuples (B 1, ... ,Bn) from (A 1, ... ,An) so that g(B 1, ... ,Bn) is quasi-isomorphic to g· In this paper, using quasi-representing graphs, we will show that the same two-vertex exchange also characterizes groups Mathematical Subject Classification Primary 20k15 This paper is in final form, and no version of it will be submitted for publication elsewhere. ®
1994 American Mathematical Society 0271-4132/94 11.00 + 1.25 per page
419
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
420
PETER D. YOM
y(:A 1.... .An) without the strongly indecomposability condition. We give a characterization theorem for the class of
cr-groups and some applications.
1. TWO-VERTEX EXCHANGE.
Throughout the paper, the term group will
mean torsion-free abelian group of finite rank. Standard notation and terminology are as in [1). For a positive integer n, let On= {l, ... ,n} and Sn be the symmetric group of order n. Ann-tuple (A 1, ... .An) of subgroups of Q is called trimmed if A;
!:;;
I.{Ajl j :F. i} for each
i e On. Whenever we employ the notation q(A 1, ... ,An) it is tacitly assummed that thentuple (A1, ... ,An) is trimmed. If B; ::Ap(i) for some p e Sn then q(A 1, ... ,An) is quasiisomorphic to q(B 1, ... ,Bn). Hence, the quasi-isomorphism class of G = q(A 1, ... .An) is determined by the types t;
= type A;. Hereafter we will refer to the group G as an n-tuple
(tt. ... ,tn). keeping in mind that it is defined up to quasi-isomorphism. In this notation we say ann-tuple (at .... ,an) is quasi-isomorphic toG if there is a group q(B 1, ... ,Bn) quasiisomorphic to G and a;
= type B; for each i e
On.
Let G =(tt, ... ,tn) and defme CG be the complete graph with vertices t}. ... ,tn and edges i:j labeled by t; A 'tj for i :F. j. A representing graph for G is any subgraph of
CG that is obtained by iteration of the algorithm: if a graph contains a circuit S with edge labels ~ t and at least one edge labeled by t, then remove an edge of S labeled by t. A labeled graph is a quasi-representing graph for a Butler group H if it is a representing graph for some
(a~o
... ,an) which is quasi-isomorphic to H. Suppose Tis a quasi-representing
graph for a Butler group H, with n vertices and with edges i:j labeled by 'tij. If we lett; = sup{tij
I i :t:.j, i:j e
T} for each i eOn. then Tis a representing graph for (tt, ... ,tn). and
(tt .... ,tn) is quasi-isomorphic to H [1, Theorem 1.6].
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
A CHARACTERIZATION OF A CLASS OF BULTER GROUPS II
421
Let Cl,G) be the set of quasi-representing graphs for G. Given T e Cl,G) and U e
Cl,H), define L(T,U) be the set of label-preserving bijections cp from the edges ofT to the edges of U such that S is a circuit in T iff cp(S) is a circuit in U. For a nonempty subset X of On, we write tx = sup{t;
Iie
X}.
LEMMA 1. [1, Corollary 1.7] Let T e Cl,G), U e Cl,H)./f L(T,U) is nonempty then G
is quasi-isomorphic to H.
LEMMA 2. Let G = ('tl···· ,tn). lftk" tm ~ t1 for some k,m with 2 ~ k
* m ~ n, then
there is a quasi-representing graph for Gin Ca \ {k:m}.
Proof. LetS= 'tk,'tm.'tl be a circuit inCa with edges k:m,m:l,l:k. Then 'tk" tm ~ 'tl " 'tk and 'tk" 'tm ~ t1 " 'tm by the hypothesis. By the algorithm for quasi-representing
graphs, the edge k:m may be deleted from S. Thus, there is a quasi-representing graph for Gin Ca \ {k:m}. •
COROLLARY 3. Let G = (tt.···•'tn). Suppose {X,Y} is a partition of {3, ... ,n} such that tx "tY ~ t1 "t2. Then there exists T e Q{G) such that (i) k:m ~ T for all k e X,
m e Y (ii) any path in T connecting 'tk and 'tm contains t1 or t2.
Proof. By recursive applications of Lemma 2, there is a quasi-representing graph T for G inCa \ {k:m Ike X,
m e Y}. Since Tis a connected graph and {X,Y} is a partition of
{3, ... ,n }, any path in T connecting 'tk and 'tm must contain t1 or t2. •
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
422
PETER D. YOM
Let G = (tt. ... ,tn) and T e the set of all edges
labeled~
~G).
For each type 't, define the subgraph T(t) be
t. It is easy to see that T(t) is connected. For each type t,
define an equivalence relation on vertices ofT as follows: t; and tj are t-equivalent in G provided i = j or t; and tj are connected by a path in 1\T(t).
THEOREM 4. (Two-vertex exchange) Let G = (tt,t2,t3, ... ,tn) and H = (O'J,0'2,t3, ... ,tn)
with t; -:~: O'j for i, j e {1,2}. Then the following are equivalent: (a)
G and Hare quasi-isomorphic;
(b)
rank G/G[t] =rank H/H[t] and rank G{t) =rank H(t) for each type t;
(c)
There is a partition {X,Y} of {3, ... ,n} such that (i) tx "tY s; tt "t2. (ii) at = (tt "t2) v (t2 "tx) v (t 1 "tr). (iii) a2 = (tt "t2) v (tt "tx) v (t 2 " tr).
L{T,U) is nonempty for some T e
(d)
Proof.
(a)~(b)
is clear.
(b)~(c)
~G)
and U e
~H).
By Corollary 2.1(b) in [1], rankG(t)+1 =the number of
t;'s with t; ~ t. Lett= tt "t2. Since rankG(t) = rankH(t), it follows that O'J, 0'2
~
t.
Thus, tt "t2 s; O't "0'2 and, by a symmetrical argument, we have tt "t2 = O't "0'2. A similar argument gives rise to functions e,f: {3, ... ,n}
~
{1,2} such that
t 1 "t; = O'e(i) At; for 3 s; i s; n } t2 " t; = O'f(i) " t; for 3 s; i s; n and {e(i), f(i)} = { 1,2}
(l.l)
We will show that e can be chosen to satisfy if 3 s; i, j s; n and t;" tj $ tt " t2, then e(i) = e(J)
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
(1.2)
A CHARACTERIZATION OF A CLASS OF BULTER GROUPS II
423
In this case, we let X= {i I e(l) = 1} andY= {i I e(l) = 2}. Then {X,Y} is a partition of {3, ... ,n} and (1.2) implies that (i) is satisfied. Since His trimmed and 'tt
A
't2 = Ot
A
02,
(ii) and (iii) follow as consequences of (1.1).
We now use the hypothesis that rank G/G['t] =rank H/H['t] to verify that e can be chosen to satisfy (1.2). By Corollary 2.1(e) in [1], rank G/G['t] = k('t)-1, where k('t) is the number of 't-equivalence classes. Note that {'t;} is a 't;-equivalence class for each i e On. Since rank G/G['t] =rank H/H['t], it follows that Ot, 02 are in distinct 't-equivalence classes in H for 't = 'tt or 't2. Similarly 't 1, 't2 are in distinct 't-equivalence classes in G for 't = 01 or 02. Fix i and j such that 't; A 'tj :$ 'tt
A
equal to e(j). In view of (1.1), we have 'tt =Om
'tj, 't2
A
Otherwise, 't;
A A
't2 and we prove that e(l) can be chosen to be 't; = Ok A 't;, 't2
A
A
't; =Om
't; and 'tt "'tj
A
'tj = Ok" 'tj, where {k,m} = {1,2}. We claim that 't; 'tj = 'tt "'t; A 'tj = Ok" 't;
A
Om "'tj!: Ok" Om = 'tt
A
A
'tj$ 'tt.
't2. This is a
contradiction to the assumption. A similar argument shows that 't; A 'tj:$ 't2, Ot. or 02. Next, we show that either 'tt
A
't; = 't2
A
't; or 'tt "'tj = 't2
A
'tj. In which case
e(l), respectively e(j), can be chosen to be either 1 or 2, hence chosen so that e(l) = e(J), as
desired. Assume 'tt that 'tt
A
A
't; :$ 't2 " 't; and we will show that 'tt
't; :$ 't2. If 'tt
A
'tj $ 't2 " 'tj, then 'tt
A
A
'tj = 't2 " 'tj- First, observe
'tj $ 't2. Hence, we now have a sequence
of vertices Ok,'ti,'tj,Om connecting Ot. 02 and the edges k:i, i:j, j:m are labeled :$ 't 2 (because 'tt
A
't; = Ok" 't; and 'tt "'tj =Om
A
'tj from the above paragraph). This is a
contradiction to the fact that Ot, 02 are in distinct 't2-equivalence classes in H. Therefore, we must have that 'tt
A
'tj!: 't2 A 'tj. We can use a similar argument and the fact that 'tt,
't2 are in distinct Om- equivalence classes in G to show that 't2
A
Licensed to AMS. License or copyright restrictions may apply to redistribution; see http://www.ams.org/publications/ebooks/terms
'tj!: 'tt
A
'tj ( in this
424
PETER D. YOM
case, the sequence of vertices
t~ot;,tj,"t2
has edges l:i, i:j,j:2 with labels:$ Om). Hence,
if t1 At;:$ t2 At;, we have that t1 A 'tj= t2 A 'tj as desired. The other case is similar. (c)~(d) X,
By Corollary 3, assume Tis a quasi-representing graph for Gin CG \{k:m Ike
m e f}. Since the lattice of types is distributive, we can show that
01 A 'tk 01 A 'tm
01 A 02
= 't1
A 't2
= t1 A 'tk and 02 A 'tk = 't2 A 'tk if k e = 't2 A 'tm and 02 A 'tm = 'tl A 'tm if m e
} (1.3)
X
Y
Since 01 A 02 = t1 A t2, it follows that with the same partition {X,f} of {3, ... ,n} we have -rX A -rY s; 01 A 02. Let W
= c8
\{k:m Ike X, me f}. We will
show that L(T,U} is nonempty for some quasi-representing graph U for H with U ~ W. In the sequel, we will write edges i:j with label equal to t; A 'tj by t;'tj. By (1.3), we define a label-preserving bijection