jcreed blog > An Almost Slice Category

An Almost Slice Category

I just wanted to get this definition down in case I want to think about it later.

Suppose we have a category C\C with finite products. Suppose we have a monoid object (R,:R×RR,e:1R)(R, \square : R \x R \to R, e : 1 \to R), which has a monoid action :R×MM\cdot : R \x M \to M on an object MM.

With this equipment, we can define another category, which is sort of like the slice C/M\C / M. Its objects are the same as C/M\C / M: they're maps f:AMf : A \to M into MM. Now to be a morphism from f:AMf : A \to M to g:BMg : B \to M you need to supply a k:ABk : A \to B but also a ϕ:AR\phi : A \to R such that the following diagram commutes:

The identity map from ff to itself is given by
which commutes by monoid action laws. Composition works according to the following diagram chase:

Zero morphisms

Suppose we have a subset ZZ of all of the morphisms into RR, thought of as morphisms that are "close enough to the identity". If it satisfies Then the subset of morphisms of the above category where ϕZ\phi \in Z is a subcategory.

A Monadic Generalization

Suppose we have a monad T:CCT : \C \to \C and a monad algebra :TMM\cdot : TM \to M. Suppose for each AA there is subset of the morphisms ATAA \to TA that are designated "TT-boring". They are required to satisfy the following axioms: Then we define a category whose objects are maps into MM, and whose morphisms from f:AMf : A \to M to g:BMg : B \to M consist of a map k:ABk : A \to B and a TT-boring map ϕ:ATA\phi : A \to TA such that gk=aTfϕg \o k = a\o Tf \o \phi. Identities and composition work by the following diagrams:

Dinatural Generalization

Suppose as before that we have a monad T:CCT : \C \to \C and :TMM\cdot : TM \to M. Zeroness is represented by a monoid-valued presheaf Z:CopMonZ : \C^\op \to \rmon. Define Z:Cop×CSetZ' : \C^\op \x \C \to \rset by Z(C1,C2)=U(Z(C1))Z'(C_1, C_2) = U(Z(C_1)) for the forgetful U:MonSetU : \rmon \to \rset. Require a dinatural transformation α:Zhom(,T)\alpha : Z' \to \hom(\dash, T\dash) For each AA, compatibility of the monoid structure (A,eA)(*_A, e_A) on Z(A)Z(A) with the monad structure is given by: αA(eA)=ηA\alpha_A (e_A) = \eta_A αA(xAy)=μATαA(x)αA(y)\alpha_A(x*_A y) = \mu_A \o T\alpha_A(x) \o \alpha_A(y)

The Special Case I Thought Was Interesting

Let RR be a commutative semiring. Let R±R^\pm be the commutative semiring whose underlying set is R×RR \x R and where multiplication is given by (a,b)(c,d)=(ac+bd,ad+bc)(a,b) (c, d) = (ac+bd, ad+bc) to simulate negatives. Let :R±R±- : R^\pm \to R^\pm be defined by swapping components. Let RiR^i be the commutative semiring whose underlying set is R±×R±R^\pm \x R^\pm and where multiplication is given by (a,b)(c,d)=(acbd,ad+bc)(a,b) (c, d) = (ac-bd, ad+bc) to simulate complex numbers. There is a homomorphism of the multiplicative groups RiR±R^i \to R^\pm given by squared norm: (a,b)2=a2+b2\| (a, b) \|^2 = a^2 + b^2 Although we don't get commutativity on the nose:
we can nonetheless achieve:
Which is kind of like establishing a lax 2-cell across the first square?