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 with finite products.
Suppose we have a monoid object (R,□:R×R→R,e:1→R), which has a monoid action ⋅:R×M→M on an object M.
With this equipment, we can define another category,
which is sort of like the slice C/M.
Its objects are the same as C/M: they're
maps f:A→M into M. Now to be a morphism
from f:A→M to g:B→M you need to supply
a k:A→B but also a ϕ:A→R
such that the following diagram commutes:
The identity map from f 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 Z of all of the morphisms into R,
thought of as morphisms that are "close enough to the identity".
If it satisfies
- e∈Z
- If ψ∈Z then ψk∈Z
- If ϕ∈Z and ψ∈Z, then ϕ□ψ∈Z
Then the subset of morphisms of the above category where ϕ∈Z is a subcategory.
A Monadic Generalization
Suppose we have a monad T:C→C and a monad algebra ⋅:TM→M. Suppose for each A there is subset of the morphisms A→TA that are designated "T-boring". They are required to satisfy the following axioms:
- ηA is T-boring.
- If f,g:A→TA are T-boring, then their kleisli composition μA∘Tg∘f is.
- If ψ:B→TB is T-boring, and k:A→B is any map,
then there exists a T-boring map ϕ:A→TA such that ϕ∘k=Tk∘ψ.
Then we define a category whose objects are maps into M, and whose morphisms from f:A→M to g:B→M consist of a map k:A→B and a T-boring map ϕ:A→TA such that g∘k=a∘Tf∘ϕ. Identities and composition work by the following diagrams:
Dinatural Generalization
Suppose as before that we have a monad T:C→C and
⋅:TM→M. Zeroness is represented by a monoid-valued
presheaf
Z:Cop→Mon. Define Z′:Cop×C→Set
by
Z′(C1,C2)=U(Z(C1))
for the forgetful U:Mon→Set.
Require a dinatural transformation
α:Z′→hom(−,T−)
For each A,
compatibility of the monoid structure (∗A,eA) on Z(A)
with the monad structure is given by:
αA(eA)=ηA
αA(x∗Ay)=μA∘TαA(x)∘αA(y)
The Special Case I Thought Was Interesting
Let R be a commutative semiring.
Let R± be the commutative semiring whose
underlying set is R×R and where multiplication
is given by
(a,b)(c,d)=(ac+bd,ad+bc)
to simulate negatives. Let −:R±→R± be
defined by swapping components.
Let Ri be the commutative semiring whose underlying
set is R±×R± and where multiplication is given by
(a,b)(c,d)=(ac−bd,ad+bc)
to simulate complex numbers. There is a homomorphism
of the multiplicative groups Ri→R±
given by squared norm:
∥(a,b)∥2=a2+b2
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?