I’m glad more people are trying to find setups where the microcosm principle becomes a theorem — and thanks for pointing this out, David.
When Jim and I gave an -categorical formulation of the microcosm principle in terms of -categorical algebras of an operad , the key idea was to use lax maps from the terminal -categorical -algebra to a fixed -categorical -algebra.
Let me try to explain this, because it’s really not as terrifying as it sounds.
Here’s the classic example of the microcosm principle. We can define a monoid object inside any monoidal category — but a monoidal category is like a categorified monoid! So, for a monoid object to make sense in some category, that category needs to be like a categorified monoid object. The monoid object (the ‘microcosm’) can only thrive in a category (a ‘macrocosm’) that resembles itself.
So, let’s see how this fact is ‘explained’ in terms of lax maps. I’ll try to get you to see that a lax monoidal functor from the terminal monoidal category to a monoidal category is the same as a monoid object in . So, the concept of monoid object arises naturally from the concept of monoidal category — if we use lax maps between monoidal categories!
If you’ve never thought about lax monoidal functors, now’s the time to do so. Mac Lane and the Wikipedia article just call them monoidal functors: what makes them lax is that the tensor product is preserved only up to a morphism, not necessarily an isomorphism. So, if is our lax monoidal functor, we have morphisms
for every pair of objects .
Now, suppose is the terminal monoidal category — the one with a single object, namely , and a single morphism. And suppose is a lax monoidal functor from to another monoidal category . What does this amount to?
Well, we get an object in , for starters. But why is it a monoid object? Well, it’s equipped with a multiplication
And, if you examine the coherence laws that must satisfy — read the Wikipedia article — you’ll see they’re precisely what we need to guarantee that this multiplication is associative! Similarly, the lax preservation of the unit object gives the unit for our would-be monoid object .
It’s amazing! You’ve got to do the calculation to see how cool it is.
This idea can be -categorified: for example, a ‘monoidal category object’ makes sense in any monoidal 2-category, and so on. It can also be vastly generalized: what works for monoids works for algebras of any operad. Jim and I explained how for any operad ,
we can define an -categorical -algebra inside any -categorical -algebra: it’s just a lax map from the terminal -categorical -algebra to the given -categorical -algebra. For details, go to page 54 of our our paper.
Anyway, all this sounds very similar to Hasuo, Jacobs and Sokolova’s idea of using lax natural transformations between functors from a Lawvere theory to CAT. They’re only formulating a basic version of the microcosm principle, not an -categorified version. But, they’re doing it for algebras of Lawvere theories, which are more general than algebras of operads! That’s good.
Re: The Microcosm Principle
Here’s something to test the limits of the microcosm principle:
In its most sweeping version, the microcosm principle says that this concept should make sense. But as far as I can see, it doesn’t.
(I hasten to point out that John and Jim weren’t that sweeping: they wrote ‘certain algebraic structures’.)
Explanation:
A rig or semiring is a riNg without Negatives; in other words, it’s a set equipped with both a monoid structure, called multiplication, and a commutative monoid structure, called addition, with multiplication distributing over addition. So any ring is a rig, and is a rig — indeed, a commutative rig — but not a ring.
A rig category is a category equipped with both a monoidal structure, called multiplication and written , and a symmetric monoidal structure, called addition and written , with the former distributing over the latter up to coherent isomorphism. The axioms were written down by Laplaza. There are many examples in which is categorical coproduct, but others in which it is not. For instance, any rig can be regarded as a discrete rig category; the category of finite sets and bijections is a rig category under and (which are not product and coproduct); and the poset of non-negative reals is a rig category under and .
You can certainly define ‘rig’ in a finite product category. The rig axioms use the fact that it’s not any old symmetric monoidal category, e.g. the distributivity axiom has a repeated variable on the right-hand side, so its categorical formulation uses the diagonal map (where is the underlying object of the rig). But I don’t see a sensible way of defining ‘rig in a rig category’.