Category Theory
Zulip Server
Archive

You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.


Stream: theory: category theory

Topic: softened preorder


view this post on Zulip John Baez (Jan 21 2026 at 22:09):

Thanks to all your help with some questions of mine, I may be ready to prove a theorem. I'd be happy for feedback.

First a definition:

Definition. A softened preorder is a category such that given f,g ⁣:xyf, g \colon x \to y, there exists an automorphism α ⁣:yy\alpha \colon y \to y such that g=αfg = \alpha f.

The idea is that if we can always take α=1y\alpha = 1_y then our category is a preorder, but in general we are weakening or 'softening' the condition that there's at most one morphism from any object xx to any object yy. Note that the roles of xx and yy are really symmetrical here, since f=α1gf = \alpha^{-1} g.

Exercise. The opposite of a softened preorder may not be a softened preorder, but it is always an opsoftened preorder: given f,g ⁣:xyf, g \colon x \to y, there exists an automorphism α ⁣:xx\alpha \colon x \to x such that g=fαg = f \alpha.

I'm happy to hear suggestions for better names for these kind of categories - and I know category theorists like nothing more than arguing about terminology, so consider this opportunity to argue my big gift to all of you. But I want to move on here....

Theorem. Suppose PP is a preorder, F:PGpdF: P \to \mathbf{Gpd} is a pseudofunctor, and C=FC = \int F is the category built via the covariant Grothendieck construction from FF. Then CC is a softened preorder. Conversely if CC is a softened preorder then CFC \simeq \int F for some preorder PP and pseudofunctor F:PGpdF: P \to \mathbf{Gpd}.

Let me prove the first part now and try to prove the converse later.

view this post on Zulip John Baez (Jan 21 2026 at 22:31):

To reduce the hassle I will assume FF is a functor, not a pseudofunctor; I believe the pseudofunctor case works similarly.

Proof of forwards direction when FF is a functor. Suppose PP is a preorder, F:PGpdF: P \to \mathbf{Gpd} is a functor, and C=FC = \int F is the category built via the covariant Grothendieck construction from FF.

An object xFx \in \int F is a pair consisting of an object x0Cx_0 \in C together with an object x1F(x0)x_1 \in F(x_0). Similarly yFy \in \int F is a pair (y0,y1)(y_0, y_1) where y1F(y0)y_1 \in F(y_0).

A morphism f:xyf: x \to y in F\int F is then a morphism f0:x0y0f_0: x_0 \to y_0 in PP (of which there's at most one) together with a morphism f1:F(f0)(x1)y1f_1 : F(f_0)(x_1) \to y_1.

Suppose we have another morphism g:xyg: x \to y. This is a morphism g0:x0y0g_0: x_0 \to y_0 together with a morphism g1:F(g0)(x1)y1g_1 : F(g_0)(x_1) \to y_1.

But because PP is a preorder, f0=g0f_0 = g_0, so g1:F(f0)(x1)y0g_1: F(f_0)(x_1) \to y_0.

Note that f1:F(f0)(x1)y1f_1 : F(f_0)(x_1) \to y_1 and g1:F(f0)(x1)y1g_1: F(f_0)(x_1) \to y_1 are morphisms with the same source and same target in the groupoid F(y0)F(y_0). We thus have

g1=(g1f11)f1 g_1 = (g_1 f_1^{-1}) f_1

I now claim that

g=αf g = \alpha f

for some morphism α:yy\alpha : y \to y in F\int F. This morphism α\alpha should itself be a pair of a morphism α0 ⁣:y0y0\alpha_0 \colon y_0 \to y_0 and a morphism α1 ⁣:F(α0)(y1)y1\alpha_1 \colon F(\alpha_0)(y_1) \to y_1 . Let's take α0=1\alpha_0 = 1, so we need α1 ⁣:y1y1\alpha_1 \colon y_1 \to y_1 . And let's take

α1=g1f11 ⁣:y1y1\alpha_1 = g_1 f_1^{-1} \colon y_1 \to y_1

So, we're taking α=(1,g1f11)\alpha = (1, g_1 f_1^{-1}) and I claim

g=αf g = \alpha f

view this post on Zulip John Baez (Jan 21 2026 at 22:46):

Everything here is a pair, and we're saying

(g0,g1)=(1,g1f11)(f0,f1)(g_0, g_1) = (1, g_1 f_1^{-1}) \circ (f_0, f_1)

Composition at right is taking place in the Grothendieck construction F\int F. Thus, the first component of each pair composes in the usual way in PP, and for this we're claiming

g0=f0g_0 = f_0

which we've seen is true because PP is a preorder. The second component composes in a more fancy way, and for this we're claiming

g1=(g1f11)F(α1)(f1) g_1 = (g_1 f_1^{-1}) \circ F(\alpha_1)(f_1)

which is true because α1=1\alpha_1 = 1 and FF is a functor so F(α1)(f1)=f1F(\alpha_1)(f_1) = f_1. \qquad

view this post on Zulip David Wärn (Jan 22 2026 at 09:27):

I don't think every softened preorder arises in this way? For any pair of softened preorders C,DC,D, the cograph of the terminal profunctor from CC to DD seems to be a softened preorder. But if C,DC,D are BZB\mathbb Z (or some other connected non-trivial groupoid) then the terminal profunctor isn't representable so the cograph shouldn't come from the Grothendieck construction. Maybe if you assume the automorphism α\alpha is unique in the definition of softened preorder.

view this post on Zulip Nathanael Arkor (Jan 22 2026 at 10:06):

If the automorphism is assumed unique, then xx is called prequasi-initial in Tholen's MacNeille completion of concrete categories with local properties. If xx is also weakly initial, then it is called quasi-initial. There are probably other concepts relevant to what you are studying in this paper.

view this post on Zulip John Baez (Jan 23 2026 at 00:58):

David Wärn said:

I don't think every softened preorder arises in this way?

Indeed, I think you're right. Is the following a counterexample? The category with only two objects x,yx,y, a single morphism f:xyf: x \to y, the identity morphism 1x:xx1_x : x \to x, and two automorphisms 1y,α:yy1_y, \alpha: y \to y. (This forces αf=f\alpha f = f and α2=1y\alpha^2 = 1_y.)

So, I no longer have hopes for the converse here:

Theorem. Suppose PP is a preorder, F:PGpdF: P \to \mathbf{Gpd} is a pseudofunctor, and C=FC = \int F is the category built via the covariant Grothendieck construction from FF. Then CC is a softened preorder. Conversely if CC is a softened preorder then CFC \simeq \int F for some preorder PP and pseudofunctor F:PGpdF: P \to \mathbf{Gpd}.

view this post on Zulip John Baez (Jan 23 2026 at 01:15):

By the way, I was trying to prove that the category of central finite-dimensional simple algebras over a field kk is a softened preorder. (Here AA is central if the center of AA is kk.) This example is the only reason why I care about this topic.

I discovered to my delight that this result is true, and it follows right away from the Skolem-Noether theorem.

(I hadn't expected it to be a new result, so I'm not disappointed: I'm just happy that it was discovered by two bigshots.)

view this post on Zulip Alex Kreitzberg (Jan 23 2026 at 07:52):

It was useful seeing your thought process and how you asked for help in connection with the grothendieck construction, thank you for threading me in. You ended up with a nice example of how a condition on the domain of the pseudofunctor translates to a condition on the opfibration.

view this post on Zulip John Baez (Jan 23 2026 at 22:02):

Thanks! The good thing about doing math in public is that people can help out, and also people can watch and maybe learn something or at least enjoy watching someone flounder around and make mistakes.

I'm not quite done yet because I haven't gotten a "structure theorem" that describes all softened preorders. From my counterexamples so far, I'm guessing every softened preorder is a "quotient" of one obtained by the Grothendieck construction. There may be an adjunction between the 2-category of softened preorders and the 2-category of preorders equipped with pseudofunctors to Gpd\mathsf{Gpd}.

However, instead of investigating this general idea further right now, I think I'll turn toward the examples I'm actually interested in, and come back to this if it turns out to help.