FILTERED MODULES OVER DISCRETE VALUATION DOMAINS
Fred Richman ElbertA.Walker
FloridaAtlantic University New Mexico State University
Boca Raton FL 33431 Las Cruces NM 88003
Abstract. We consider a uni ed setting for studying lo cal valuated
groups and coset-valuated groups, emphasizing the asso ciated ltrations rather
than the values of elements. Stable exact sequences, pro jectives and injectives
are identi ed in the encompassing category, and in the category corresp onding
to coset-valuated groups.
1. Introduction
Throughout, R will denote a discrete valuation domain with prime p, and module will
mean R-mo dule. In the motivating example, R is the ring of integers lo calized at a
prime p. In that case, a mo dule is simply an ab elian group for whichmultiplication
byanyinteger prime to p is an automorphism|a p-lo cal ab elian group. The inde-
comp osable, divisible, torsion mo dule Q=R, where Q is the quotient eld of R, will
1
. b e denoted by R
p
The notion of a valuated mo dule v-mo dule arises from considering a submo dule
A of a mo dule B , together with the height function on B restricted to A. The dual
notion of a coset-valuated mo dule c-mo dule comes up when considering the quotient
mo dule B=A with a valuation related to the height function on B .Traditionally, [2],
[4], one sets
v b + A = sup fhtb + a+1 : a 2 Ag:
For nite ab elian p-groups, the v-group A tells all ab out how the subgroup A sits
0
inside the group B in the sense that if the subgroups A and A are isomorphic as v-
0
groups, then there is an automorphism of B taking A to A [6]. For isotyp e subgroups
A of simply presented p-groups B , the c-group B=A tells all ab out how A sits inside
B [4].
In this pap er we consider these two notions in terms of ltered mo dules, fo cusing
on the submo dules
B =fb 2 B : vb g
rather than on the valuations themselves. This has the virtue, if you are so inclined,
that the structure is de ned in terms of submo dules, not elements, so can b e dealt
with in purely categorical terms. Indep endent of that, or p ossibly b ecause of that,
many of the ideas take a more natural form when the valuations are suppressed. In 1
FILTERED MODULES OVER DISCRETE VALUATION DOMAINS 2
particular, the relationship b etween v-mo dules and c-mo dules app ears more natural,
and we are not forced to consider the somewhat arti cial traditional de nition of the
coset valuation.
We consider a category of ltered mo dules that includes b oth v-mo dules and
c-mo dules. Every ob ject in this category is b oth a quotient of a v-mo dule and a
submo dule of a c-mo dule. The stable exact sequences, the elements of Ext, are
identi ed in this category and in the category of c-mo dules, as are the pro jectives
and injectives.
2. Height
A general setting for height is a forest with a unique zero, whichwe will call simply a
forest. This consists of a set X together with a function : X ! X such that has
a unique p erio dic p oint, which is a xed p oint, called 0. In the motivating example,
X is a p-lo cal ab elian group, and x = px. The elements of a forest are often called
no des.Amap between two forests is a function f such that f x=f x for all
no des x.
If x = y , then wesay that y is the parent of x and that x is a child of y .If
n
x = y , where n can b e 0, then wesay that x is an ancestor of y , and that y is
a descendant of x. A nonzero no de whose parent is 0 is called a ro ot,a childless
no de a leaf.
A subset S of a forest X is a subforest if S S .IfS is a subforest of a forest
X , then so is S , the set of all parents of no des in S .For each ordinal de ne S
inductively by
\
S . S =
<
T
+1
S . In particular, S = S , and, if is a limit ordinal, then S =
<
+1
If X = X , then X = X for each > . The length of X is the least
+1
such that X = X . A forest is torsion if for each x there is n such that
n
x =0.Ifx is a no de in a forest, then the order,or exp onent,of x is the smallest
n
nonnegativeinteger n such that x =0.Ifnosuch n exists, then x is said to have
in nite order.
A mo dule b ecomes a forest up on setting x = px|we forget all its structure
except multiplication by p. Conversely,ifX is a forest, then we can construct a
mo dule S X by taking the free mo dule on X mo dulo the submo dule generated by
fy px : y = xg:
Note that 0 in X b ecomes 0 in S X b ecause 1 p is invertible. The functor S from
forests to mo dules is the left adjoint of the forgetful functor from the category of
FILTERED MODULES OVER DISCRETE VALUATION DOMAINS 3
mo dules to the category of forests. A mo dule isomorphic to some S X is said to b e
simply presented.
As an example of a forest, whichwe will use later, consider the forest F con-
;n
structed from ordinals and n, where n ! . A no de of the forest F is either
;n
nite, strictly increasing, string a a :::a of ordinals less than , or the symbol t ,
1 2 m k
where k n is a nonnegativeinteger, and t is the empty string. The function is
0
de ned by
a a :::a = a :::a if m 1,
1 2 m 2 m
t = t .
k
minn;k +1
Clearly F is a forest of length + n.If1 n
;n ;n
unique ro ot t and zero t .Ifn = ! , then F has no ro ots or zeros.
n 1 n ;n
Related forests are F and F . The nonzero no des of F are x , with n a
1;1 1;! 1;1 n
nonnegativeinteger, satisfying x = 0 and x = x . This is a torsion forest,
0 n+1 n
1
. In F the nonzero no des x are indexed by and S F is isomorphic to R
1;! n 1;1 p
the integers, and x = x throughout. The mo dule S F is isomorphic to the
n+1 n 1;!
quotient eld of R.
+1
Anode x in a forest X is said to have height if x 2 X n X .Ifx 2 X ,
where is the length of X , then x is said to have height 1. In F , the no de
;n
a a :::a k has height a ,ifm 1, and the no de k has height + k . The length of
1 2 m 1
F is +1+n.
;n
3. O-modules
We are interested in mo dules, and forests, with descending ltrations indexed by the
ordinals. For any index class I , not just the ordinals, wemay consider an I -mo dule
to b e a mo dule G together with a family of submo dules G indexed by I . A map
f : A ! B of I -mo dules is a mo dule homomorphism such that f A B for
each in I .
The category of I -mo dules is preab elian:every map has a kernel and a cokernel.
The kernel of a map f : B ! C of I -mo dules is A = fb 2 B : f a=0g with
A = A \ B . It is easy to see that this is the categorical kernel, that is, if g is a
map from an I -mo dule into B such that fg = 0, then g factors uniquely through A.
f
A B ! C
- " g
The cokernel of a map f : A ! B of I -mo dules is C = B=f A with C equal to
the image of B in C . This is the categorical cokernel: if g is a map from B into
FILTERED MODULES OVER DISCRETE VALUATION DOMAINS 4
an I -mo dule such that gf = 0, then g factors uniquely through C .
f
A ! B ! C
g .
If the class I has some structure, like the class of ordinals, wewould normally
want the family of submo dules G to re ect that structure for example, to b e
a descending ltration in the case of ordinals. These conditions will b e relatively
harmless if whenever A and B are ob jects in the more restrictive category, and f :
A ! B is a map, then the kernel and cokernel of f in the larger category are in
the smaller one. Taking I to b e the ordinal numb ers, we put on three such harmless
restrictions.
An o-mo dule is a mo dule G with a family of submo dules G indexed by the
ordinals such that
If < , then G G ,
G0 = G,
pG G + 1.
In general we denote p G by p G . Call such a family of submo dules an
T
O - ltration. Set G1= G . Wesay that G is value reduced if G1=0.
There is an ordinal such that G=G1. The smallest such ordinal is called
the value length of G.
Note that wehave not referred to the additive structure of G, except that the
G are submo dules. The same de nition go es through if G is a forest and the G
are subforests. In this case we sp eak of an o-forest.Obviously an o-mo dule is an
o-forest. Moreover if F is an o-forest, then A = S F b ecomes an o-mo dule if we let
A b e the submo dule generated by F , and S is the left adjoint of the forgetful
functor from o-mo dules to o-forests. The left adjoint prop ertysays that any o-forest
map from an o-forest F to an o-mo dule C extends uniquely to an o-mo dule map
S F ! C .
If we put on two more conditions, wehavecharacterized the submo dules p G, the
height ltration.
T
G + 1 continuity, 1. G
<
2. G +1 pG divisibility.
FILTERED MODULES OVER DISCRETE VALUATION DOMAINS 5
Wesay that an ordinal is a limit ordinal if = sup f : < g, so a limit ordinal
is an ordinal with no immediate predecessor 0 is a limit ordinal. We mightaswell
restrict 1 to limit ordinals .For = 0 it says that G0 = G. An o-mo dule that
satis es 1 is called a valuated mo dule, one that satis es 2 is called a c-valuated
mo dule Hill and Megibb en [4]. We will use the shorter terminology v-mo dule and
c-mo dule. If an o-mo dule G is b oth a v-mo dule and a c-mo dule, then G =p G
and wesay that G is a mo dule with the natural height ltration, or an h-mo dule,
for emphasis.
Note again that the same de nitions can b e applied to o-forests, resulting in
de nitions of c-forests and v-forests.
The continuity and divisibility conditions are not harmless in the way that the
other three conditions are. The cokernel in the category of o-mo dules of a map
between two v-mo dules need not b e a v-mo dule, and the kernel in the category of
o-mo dules of a map b etween two c-mo dules need not b e a c-mo dule.
Finite Jordan-Holder length c-mo dules are h-mo dules, but nite length o-mo dules
need not b e v-mo dules. The idea of a c-mo dule was intro duced byFuchs in [1] as a
group with a coset valuation, whence the \c". He showed that every torsion c-group is
the quotient of a simply presented torsion group. Note that the data for a c-mo dule
A can b e provided by sp ecifying the submo dules A only for a limit ordinal,
!
sub ject to the condition that A + ! p A .
If B is an h-mo dule and A is a submo dule of B , then A is an o-mo dule kernel
exactly when A is an isotyp e submo dule of B , that is, if p A = A \ p B for each
ordinal . Alternatively, the o-submo dule A of B is an isotyp e submo dule exactly
when A is a c-mo dule. That is b ecause A is already a v-mo dule, b eing a submo dule
of the v-mo dule B ,so A is a c-mo dule if and only if it is an h-mo dule|but b ecause
A is an o-submo dule of the mo dule B , this is the same as saying A is isotyp e.
The next theorem characterizes when a submo dule of a c-mo dule is a c-mo dule.
First a lemma isolating a familiar maneuver used with isotyp e subgroups. Here the
m n m n
usual convention is that p C [p ]= p C [p ].
f
Lemma1. Let m and n b e nonnegativeintegers, and A B ! C a short exact
sequence of mo dules. Then the following conditions are equivalent.
m n n
1. p C [p ] f B [p ],
m+n n
2. A \ p B p A.
m+n m+n
Pro of. Supp ose 1 holds and let a 2 A \ p B . Then a = p b for b 2 B .
So
m m n n
f p b 2 p C [p ] f B [p ]
FILTERED MODULES OVER DISCRETE VALUATION DOMAINS 6
m 0 0 n n m 0 n
whence p b b 2 A for some b 2 B [p ], so a = p p b b 2 p A.
m n m 0 0 m+n 0
Now supp ose 2 holds and c 2 p C [p ]. Then c = p c for c 2 C ,so p c =0.
0
Cho ose b so that f b=c . Then
m+n m+n n
p b 2 A \ p B p A
m+n n n m m n
whence p b = p a for a 2 A.Sop p b a = 0 and c = f p b a 2 f B [p ].
We will use this lemma again later. For nowwe only need the case m =0.
f
Theorem 2. Let 0 ! A ! B ! C ! 0 b e an exact sequence of o-mo dules, where
B is a c-mo dule. Then the following are equivalent.
A is a c-mo dule,
n n
f B [p ] = C [p ] for each ordinal and nonnegativeinteger n,
f B [p] = C [p] for each ordinal .
Pro of. If A is a c-mo dule, then
n n
A \ p B =A \ B + n=A + n=p A
n n
so C [p ]=f B [p ] by the lemma. If f B [p] = C [p] for each ordinal
, then, by the lemma,
pA =A \ pB =A \ B +1= A +1
so A is a c-mo dule.
This is just the condition that B maps purely onto C for each .
A one-to-one map A ! B of o-mo dules is said to b e an emb edding if the inverse
image of B isA for each ordinal .Soevery kernel is an emb edding, and vice
versa. If A is a submo dule of a mo dule B , then the mo dule B=A is an o-mo dule
cokernel if and only if A is a nice submo dule of B .