18.11.2012 Views

Symmetric Monoidal Categories for Operads - Index of

Symmetric Monoidal Categories for Operads - Index of

Symmetric Monoidal Categories for Operads - Index of

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

270 18 Shifted Modules over <strong>Operads</strong> and Functors<br />

in the category <strong>of</strong> right R-modules. In §19, we use this construction to analyze<br />

the image <strong>of</strong> relative cell complexes under functors associated to right<br />

R-modules.<br />

The objects LnM[Y/X]andTnM[Y/X] are defined in §§18.2.6-18.2.10.<br />

A preliminary step is to reduce the construction <strong>of</strong> pushouts to reflexive<br />

coequalizers <strong>of</strong> free R-algebras, because we have immediately:<br />

18.2.1 Proposition.<br />

(a) For a free R-algebra A<br />

SR[M,R(X)] = S[M,X].<br />

= R(X), we have a natural isomorphism<br />

(b) The functor SR[M,−] : RE →MR preserves the coequalizers which are<br />

reflexive in E.<br />

Pro<strong>of</strong>. Since we have an identity SR[M,A](n) =SR(M[n],A), assertion (a) is<br />

a corollary <strong>of</strong> assertion (b) <strong>of</strong> theorem 7.1.1, assertion (b) is a corollary <strong>of</strong><br />

proposition 5.2.2. ⊓⊔<br />

In any category, a pushout<br />

S A<br />

T B<br />

is equivalent to a reflexive coequalizer such that:<br />

T ∨ S ∨ A<br />

s0<br />

d0<br />

d1<br />

T ∨ A<br />

Thus, by assertion (b) <strong>of</strong> proposition 18.2.1, the object SR[M,B] thatweaim<br />

to understand is determined by a reflexive coequalizer <strong>of</strong> the <strong>for</strong>m:<br />

s0<br />

SR[M,R(Y ) ∨ R(X) ∨ A] d0<br />

d1<br />

B.<br />

SR[M,R(Y ) ∨ A]<br />

SR[M,B] .<br />

The motivation to introduce refined functors SR[M,−] appears in the next<br />

observations:<br />

18.2.2 Lemma. For any Σ∗-object M and any sum <strong>of</strong> objects X ⊕ Y in E,<br />

we have identities<br />

S[M,X ⊕ Y ] � S[M[X],Y] � S[M,Y ][X].

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!