2.3.2. Gradings and filtrations
Let be a set.
A -graded pointed set is a pointed set together with pointed subsets
for
such that and for .
Given a map and a -graded pointed set, we define a structure
of -graded pointed set on by setting .
Given and two sets and a -graded pointed set for ,
then is a -graded pointed set with
.
Assume is a monoid. Given two -graded pointed sets and , there
is a structure of -graded pointed set on . Via the multiplication
map, we obtain a structure of -graded pointed set on . This
makes the category of -graded pointed sets into a monoidal category with
unit object the pointed set with and for .
Let be a poset.
A -filtered set (resp. pointed set) is a set (resp. a pointed set)
together with subsets (resp. pointed subsets)
for such that if and
such that given (resp. ),
the set is non-empty and has a maximal element,
which we denote by .
Note that a structure of -filtered set on a set (resp. a pointed set)
is the same as the data of a map (resp. a map ).
The associated -graded pointed set is
(resp. ) with
|
|
|
If is a (partially) ordered monoid, then the category of -filtered sets
(resp. pointed sets)
is a monoidal category with the image of in . Its unit object
is the set (resp. the pointed set )
with if
and (resp. ) otherwise.
There is a monoidal functor
from the monoidal category of
-filtered sets (resp. pointed sets) to the monoidal category of -graded
pointed sets. Given a map between -filtered sets (resp.
pointed sets), the map is given for by
if and
otherwise.
Note also that given a commutative ring
there is a monoidal functor from the category of -graded pointed sets
to the category of -graded -modules.