Math 2.0

Category theory; homological algebra Definition

Pseudofunctor

Builds on BicategoryFunctorNatural transformation2-categoryMonoidal functor

Definition

Let ℬ\mathcal{B} and ℬ′\mathcal{B}' be bicategories with associators α,α′\alpha, \alpha' and unitors λ,ρ,λ′,ρ′\lambda, \rho, \lambda', \rho'. A pseudofunctor F ⁣:ℬ→ℬ′F \colon \mathcal{B} \to \mathcal{B}' consists of:

  1. for each object aa of ℬ\mathcal{B}, an object F(a)F(a) of ℬ′\mathcal{B}';
  2. for each pair a,ba, b, a functor Fa,b ⁣:ℬ(a,b)→ℬ′(F(a),F(b))F_{a,b} \colon \mathcal{B}(a, b) \to \mathcal{B}'(F(a), F(b));
  3. for composable f ⁣:a→bf \colon a \to b and g ⁣:b→cg \colon b \to c, invertible 2-morphisms ϕg,f ⁣:F(g)∘F(f)⇒F(g∘f)\phi_{g,f} \colon F(g) \circ F(f) \Rightarrow F(g \circ f), natural in ff and gg;
  4. for each object aa, an invertible 2-morphism ϕa ⁣:1F(a)⇒F(1a)\phi_a \colon 1_{F(a)} \Rightarrow F(1_a).

These data satisfy, for all f ⁣:a→bf \colon a \to b, g ⁣:b→cg \colon b \to c, h ⁣:c→dh \colon c \to d:

  1. F(αh,g,f)⋅ϕh∘g,f⋅(ϕh,g∘1F(f))=ϕh,g∘f⋅(1F(h)∘ϕg,f)⋅αF(h),F(g),F(f)′F(\alpha_{h,g,f}) \cdot \phi_{h \circ g, f} \cdot (\phi_{h,g} \circ 1_{F(f)}) = \phi_{h, g \circ f} \cdot (1_{F(h)} \circ \phi_{g,f}) \cdot \alpha'_{F(h),F(g),F(f)};
  2. F(λf)⋅ϕ1b,f⋅(ϕb∘1F(f))=λF(f)′F(\lambda_f) \cdot \phi_{1_b, f} \cdot (\phi_b \circ 1_{F(f)}) = \lambda'_{F(f)};
  3. F(ρf)⋅ϕf,1a⋅(1F(f)∘ϕa)=ρF(f)′F(\rho_f) \cdot \phi_{f, 1_a} \cdot (1_{F(f)} \circ \phi_a) = \rho'_{F(f)}.

Here ⋅\cdot is vertical composition of 2-morphisms.

Remarks

If the ϕg,f\phi_{g,f} and ϕa\phi_a are only required to be 2-morphisms, not invertible, FF is called a lax functor; if they are identities, FF is a strict 2-functor. Example: regard the category of rings as a 2-category with only identity 2-morphisms. Send a ring RR to its category of left modules, and a ring map u ⁣:R→Su \colon R \to S to extension of scalars S⊗R−S \otimes_R -. The canonical isomorphisms T⊗S(S⊗RM)≅T⊗RMT \otimes_S (S \otimes_R M) \cong T \otimes_R M and R⊗RM≅MR \otimes_R M \cong M give ϕ\phi, and the axioms hold because these isomorphisms are the standard ones on elementary tensors. Non-example: a monoidal category is a one-object bicategory, and a lax monoidal functor gives a lax functor. The forgetful functor (𝐀𝐛,⊗)→(𝐒𝐞𝐭,×)(\mathbf{Ab}, \otimes) \to (\mathbf{Set}, \times) with ϕ(a,b)=a⊗b\phi(a, b) = a \otimes b is a lax functor but not a pseudofunctor, since A×B→A⊗BA \times B \to A \otimes B is not invertible.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. 2-category concept
  2. Bicategory concept
  3. Functor concept
  4. Monoidal functor concept
  5. Natural transformation concept
  6. Pseudofunctor definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Pseudo-functor
About this page
TagQNMWK3GCF2
URIm2://QNMWK3GCF2
Kinddefinition
WritingW0 stub
MSC18N10
DefinesPseudofunctor
UsesBicategory, Functor, Natural transformation, 2-category, Monoidal functor
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.