nLab lax natural transformation

Redirected from "oplax natural transformation".
Contents

Contents

Idea

The notion of lax natural transformation is a generalization of the notion of natural transformation from category theory to higher category theory.

As a natural transformation is a morphism between two functors between categories, a lax natural transformation is a morphism between 2-functors between 2-categories:

Where a natural transformation has a commuting naturality square, a lax natural transformation has a 2-morphism filling that square. If that 2-morphism is required to be invertible, one speaks of a pseudonatural transformation, and if it is required to be an identity (which implies that the square commutes), then one speaks of a strict 2-natural transformation (this latter notion only really makes sense for strict 2-functors between strict 2-categories).

In the general terminology of higher category theory, a lax natural transformation may equivalently be called a (lax) 1-transfor.

Definitions

Given (possibly weak) 2-categories C,DC,D and (possibly lax or oplax) 2-functors F,G:CDF, G : C\to D, a lax natural transformation α:FG\alpha:F\Rightarrow G is given by

  • for each ACA\in C a 1-morphism α A:F(A)G(A)\alpha_A:F(A)\to G(A) in DD, as usual

  • for each f:ABf:A\to B in CC a 2-morphism α f:G(f)α Aα BF(f)\alpha_f: G(f) \circ \alpha_A \Rightarrow \alpha_B \circ F(f):

such that

  • for each A,BA,B, the α f\alpha_f are the components of a (strict) natural transformation α A,B:(α A) *G A,B˙(α B) *F A,B\alpha_{A,B}: (\alpha_A)^* \circ G_{A,B} \dot{\to} (\alpha_B)_* \circ F_{A,B}

  • the assignment fα ff\mapsto \alpha_f behaves sensibly with respect to identities and composition (see the references for details).

An oplax natural transformation is as above, only with the 22-cells α f\alpha_f reversed. This distinction is not entirely consistent in the literature; see the discussion of terminology below.

An (op)lax natural transformation α\alpha is a pseudonatural transformation if each α f\alpha_f is invertible, and a strict natural transformation or strict 2-natural transformation if each is an identity.

In all of these cases, the word ‘natural’ is often dropped for brevity.

Categories and nn-categories of lax transformations

Lax transformations from FF to GG and modifications between them form a category Lax(F,G)Lax(F,G); likewise we have Ps(F,G)Ps(F,G) and Oplax(F,G)Oplax(F,G) consisting of pseudo-natural and oplax transformations, respectively.

Pushing it up a notch, for 2-categories CC and DD we have hom-2-categories 2Cat lax(C,D)2Cat_{lax}(C,D), 2Cat ps(C,D)2Cat_{ps}(C,D), and 2Cat oplax(C,D)2Cat_{oplax}(C,D) whose objects are 2-functors (generally taken to be strong or strict), whose morphisms are lax, pseudo, or oplax transformations respectively, and whose 2-cells are modifications. These hom-2-categories are the internal homs for the various version of the Gray tensor product on 2Cat2Cat.

Finally, there is a 3-category consisting of 2-categories, (strong or strict) 2-functors, pseudo-natural transformations, and modifications. No laxness is possible at this level (without “laxifying” the notion of 3-category).

“Lax” versus “oplax”

The choice of which direction to call “lax” and which to call “oplax” is not made consistently in the literature. The convention used above is Benabou’s original choice, as well as that of Leinster, Borceaux, and the majority of Australian writing on category theory. However, some references, such as the Elephant, make the opposite choice. One or two references use “left lax” and “right lax” instead.

It is arguably the case that the direction we call “oplax” occurs more commonly in practice. For instance, icons are a special sort of oplax transformations (although if “lax” and “oplax” were switched, then the acronymic derivation of the word “icon” would no longer work). Likewise, when monoidal categories are viewed as one-object 2-categories, monoidal natural transformations are special oplax transformations (in fact, they are precisely the icons).

On the other hand, the convention used above (besides having a little more weight of tradition) has the advantage that there is a 2-monad whose algebras are 2-functors, and for which lax and oplax algebra morphisms are precisely lax and oplax transformations, respectively, under this convention. Thus, for instance, theorems such as doctrinal adjunction can be applied to lax and oplax transformations without needing to switch back and forth between two different meanings of “lax.”

The Yoneda Lemma

Given a bicategory CC, a lax functor F:C opCatF:C^{op}\to Cat and a 00-cell ACA\in C, there are adjoint functors

I:Lax(yA,F)F(A):J I : Lax(y A,F) \stackrel{\to}{\leftarrow} F(A) : J

such that JIJ \dashv I. Here yA:CCat C opy A:C \to Cat^{C^{op}} is the image of AA under the bicategorical Yoneda embedding.

Proof (sketch)

For aF(A)a\in F(A), let J(a):yAFJ(a):y A\Rightarrow F be the lax transformation defined by J(a) B(f)=(Ff)(a)J(a)_B(f) = (F f)(a). The components

J(a) g:F(g)J(a) X˙J(a) Yg * J(a)_g : F(g) \circ J(a)_X \dot{\to} J(a)_Y \circ g_*

for g:XYg:X\to Y in CC are given by FF‘s comparison map (F g,) a(F_{g,-})_a. The coherence conditions follow from those on FF wrt the associator and left unitor of CC. For x:abx:a\to b in F(A)F(A), J(x)J(x) is a modification because F g,fF_{g,f} is a natural transformation (i.e. 2-cell in CatCat).

Let I(α)=α A(1 A)I(\alpha) = \alpha_A(1_A) as usual. For m:α¨βm:\alpha\ddot{\to}\beta a modification, I(m)=(m A)(1 A)I(m)=(m_A)(1_A).

The unit η:FA˙IJ\eta: F A \dot{\to} I J at aFAa\in F A is the component (F A) a(F_A)_a of FF‘s comparison map, which is natural in aa by definition. The counit ϵ α\epsilon_\alpha is obtained via the usual 1-chasing, and is given in components by

(ϵ α) B(f)=α B(r f)(α f)(1 A) (\epsilon_\alpha)_B(f) = \alpha_B(r_f) \circ (\alpha_f)(1_A)

where rr is the right unitor of CC. Some diagram-chasing confirms that this is indeed natural in everything, and so ϵ:JI˙Lax(yA,F)\epsilon: J I \dot{\to} Lax(y A,F).

The triangle identities may be proved by expanding the definitions above and using the coherence conditions on lax functors and transformations and coherence of CC.

See Gray for the case strict 2-categories and strict 2-functors.

References

See the references at 2-category. For instance (note slightly outdated terminology)

The definition is spelled out explicitly in the following, where they are called lax transformations:

In the following oplax natural transformations are defined, but called, simply, “transformations”:

Last revised on May 12, 2025 at 09:45:29. See the history of this page for a list of all contributions to it.