用户: Aripriner/Higher Algebra/infinty monoids

定义 0.1. We denote by the category whose objects are finite sets ans whose morphisms are partially defined maps(only defined for some elements, not all). Write . There is a functor defined by and for a morphism in , we define via

定义 0.2. If is an -category with finite products, a cartesian commutative monoid in is a functor such that is a cartesian monoid. If it is even a cartesian group, is called a cartesian commutative group in . We let denote the full category spanned by them.

定义 0.3. An -category is called semi-additive if it admits finite products and finite coproducts, its initial and final objects agree, and for any the natural map is an equivalence, and we denote their product and coporduct as .
We say is additive iff it is semi-additive and the map is an equivalence, for example and .

命题 0.4. If is semi-additive, then the natural forgetful functors are equivalences. If is additive, so are

推论 0.5. If is additive, then there is a canonical lift If is only semi-additive, we get a lift to .

证明. In general, if is a finite-preserving functor, then it induces a functor and because it perserves the Segal conditions.
Notice that does not preserve finite products, but the Yoneda embedding does. Thus we can lift it to the functor .
To show then functorality in , consider the Yoneda embedding . Define the full subcategory spanned by the finite product preserving functors. We have the map by construction. And the image of the Yoneda embedding lies in . Thus we have . Similarly for the semi-additive case.

Recall that we have the adjunction Now and both preseve finite products( by explicit computations and by right adjointness). Thus we can lift this adjunction:It is easy to see the equivalence . We want to show the diagram

commutes and all arrows are equivalences.
To prove this statement, we let be the subcategory spanned by -categories admitting finite products and functors preserving finite products. Also let denote the full subcategory spanned by additive and semi-additive -categories.

定理 0.6. If an -category has products, then and are semi-additive and additive respectively. Furthermore, the functors are right adjoints to the inclusion functors.

Using this theorem, we can get a proof of the claim. First we prove that the maps and agree and are equivalences. In fact is the counit of the adjunction in theroem 0.6(see the proof). Hence is an equivalence. Because the inclusion map is full fatihful, we know that the other is an equivalence.
Moreover, by writing down the triangle identies we find that the maps are inverses to the unit (one regards and the other regard then using the identities respectively).
We want to replace one by . To do this, note that if we have is semi-additive, we have . Also by direct inspection as the full subcategory of .
To prove theorem 0.6, we need a lemma

引理 0.7. Let be a category with finite products. Then is semi-additive if the following conditions hold:

1.

The terminal objects is also initial.

2.

We have a natural transformation such that both compositions are homotopic to for all , and the diagram

commutes up to homotopy.

Now we give the proof of theorem 0.6.
证明. We first prove that is semi-additive by lemma 0.7. The constant functor is the final object. To see it is initial, let and compute Now we need to construct functorial maps for all . Consider the map by taking the product of sets and morphisms. It induces a functor . We can see that the Segal conditions are preserved. So we get a functor By construction, is just the identity and is naturally equivalent to the diagonal . Hence we define to be the multiplication induced by . This transformation is functoral and these conditons also hold.
Thus is semi-additive by the lemma 0.7. To show is additive, we can know that for , the codiagonal map is induced by , hence by the multiplication on . Thus we only need to show that is a cartesian commutative group it self. This is easy.
Finally, to show the adjunctions, just notice that using is semi-additive, then for and , we have and are both equivaleces. So by some nonsenses, we have the adjunctions.

推论 0.8. There is a commutative diagram of horizontal adjunction

We also have:

1.

Restricting to gives a fully faithful functor .

2.

Both functors actually take values in .

3.

is left adjoint to the inclusion .

In particular, the top row adjunction restricts to the adjunction

推论 0.9. We get a commutative solid diagram

Finally we talk about free -monoids. Similarly, the forgetful functor has a left adjoint . For , it is given by We need to define homotopy-quotient under the action of a group. In general, given a functor , where is an -cateogry with colimits and is a discrete group, we put On each , to get this homotopy-quotient, we give a functor sending the -complex of to . This is the same as giving a functor . Then we just conder the permutation actions.